12
12
You should have received a copy of the GNU General Public License
13
13
along with this program; if not, write to the Free Software
14
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
14
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
16
16
#include "heap_priv.h"
18
18
#include <string.h>
21
using namespace drizzled;
23
21
/* Read first record with the current key */
25
23
int heap_rfirst(HP_INFO *info, unsigned char *record, int inx)
25
HP_SHARE *share = info->s;
26
HP_KEYDEF *keyinfo = share->keydef + inx;
27
28
info->lastinx= inx;
29
if (!(info->getShare()->records))
29
if (keyinfo->algorithm == HA_KEY_ALG_BTREE)
33
if ((pos = (unsigned char *)tree_search_edge(&keyinfo->rb_tree,
36
offsetof(TREE_ELEMENT, left))))
38
memcpy(&pos, pos + (*keyinfo->get_key_length)(keyinfo, pos),
39
sizeof(unsigned char*));
40
info->current_ptr = pos;
41
hp_extract_record(share, record, pos);
43
If we're performing index_first on a table that was taken from
44
table cache, info->lastkey_len is initialized to previous query.
45
Thus we set info->lastkey_len to proper value for subsequent
47
This is needed for DELETE queries only, otherwise this variable is
49
Note that the same workaround may be needed for heap_rlast(), but
50
for now heap_rlast() is never used for DELETE queries.
53
info->update = HA_STATE_AKTIV;
57
errno = HA_ERR_END_OF_FILE;
64
if (!(info->s->records))
31
66
errno=HA_ERR_END_OF_FILE;