summaryrefslogtreecommitdiff
path: root/myisammrg/myrg_rnext.c
diff options
context:
space:
mode:
Diffstat (limited to 'myisammrg/myrg_rnext.c')
-rw-r--r--myisammrg/myrg_rnext.c69
1 files changed, 40 insertions, 29 deletions
diff --git a/myisammrg/myrg_rnext.c b/myisammrg/myrg_rnext.c
index e714ce3b139..71a4d081e8a 100644
--- a/myisammrg/myrg_rnext.c
+++ b/myisammrg/myrg_rnext.c
@@ -22,22 +22,21 @@
int myrg_rnext(MYRG_INFO *info, byte *buf, int inx)
{
- MYRG_TABLE *table;
- MI_INFO *mi;
- byte *key_buff;
- uint pack_key_length;
int err;
+ MI_INFO *mi;
/* at first, do rnext for the table found before */
- err=mi_rnext(info->current_table->table,NULL,inx);
- if (err == HA_ERR_END_OF_FILE)
+ if ((err=mi_rnext(info->current_table->table,NULL,inx)))
{
- queue_remove(&(info->by_key),0);
- if (!info->by_key.elements)
- return HA_ERR_END_OF_FILE;
+ if (err == HA_ERR_END_OF_FILE)
+ {
+ queue_remove(&(info->by_key),0);
+ if (!info->by_key.elements)
+ return HA_ERR_END_OF_FILE;
+ }
+ else
+ return err;
}
- else if (err)
- return err;
else
{
/* Found here, adding to queue */
@@ -46,30 +45,42 @@ int myrg_rnext(MYRG_INFO *info, byte *buf, int inx)
}
/* next, let's finish myrg_rkey's initial scan */
- table=info->last_used_table+1;
+ if ((err=_myrg_finish_scan(info, inx, HA_READ_KEY_OR_NEXT)))
+ return err;
+
+ /* now, mymerge's read_next is as simple as one queue_top */
+ mi=(info->current_table=(MYRG_TABLE *)queue_top(&(info->by_key)))->table;
+ return mi_rrnd(mi,buf,mi->lastpos);
+}
+
+
+/* let's finish myrg_rkey's initial scan */
+
+int _myrg_finish_scan(MYRG_INFO *info, int inx, enum ha_rkey_function type)
+{
+ int err;
+ MYRG_TABLE *table=info->last_used_table;
if (table < info->end_table)
{
- mi=info->last_used_table->table;
- key_buff=(byte*) mi->lastkey+mi->s->base.max_key_length;
- pack_key_length=mi->last_rkey_length;
+ MI_INFO *mi= table[-1].table;
+ byte *key_buff=(byte*) mi->lastkey+mi->s->base.max_key_length;
+ uint pack_key_length= mi->last_rkey_length;
+
for (; table < info->end_table ; table++)
{
mi=table->table;
- err=_mi_rkey(mi,NULL,inx,key_buff,pack_key_length,HA_READ_KEY_OR_NEXT,FALSE);
- info->last_used_table=table;
-
- if (err == HA_ERR_KEY_NOT_FOUND)
- continue;
- if (err)
- return err;
-
+ if ((err=_mi_rkey(mi,NULL,inx,key_buff,pack_key_length,
+ type,FALSE)))
+ {
+ if (err == HA_ERR_KEY_NOT_FOUND) /* If end of file */
+ continue;
+ return err;
+ }
/* Found here, adding to queue */
- queue_insert(&(info->by_key),(byte *)table);
+ queue_insert(&(info->by_key),(byte *) table);
}
+ /* All tables are now used */
+ info->last_used_table=table;
}
-
- /* now, mymerge's read_next is as simple as one queue_top */
- mi=(info->current_table=(MYRG_TABLE *)queue_top(&(info->by_key)))->table;
- return mi_rrnd(mi,buf,mi->lastpos);
+ return 0;
}
-