← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to storage/heap/hp_rfirst.c

  • Committer: Monty Taylor
  • Date: 2008-07-15 21:40:58 UTC
  • mfrom: (77.1.113 codestyle32)
  • mto: This revision was merged to the branch mainline in revision 176.
  • Revision ID: mordred@camelot-20080715214058-rm3phulldos9xehv
Merged from codestyle.

Show diffs side-by-side

added added

removed removed

Lines of Context:
storage/heap/hp_rfirst.c
11
11
 
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 */
15
 
 
16
 
#include "heap_priv.h"
17
 
 
18
 
#include <string.h>
19
 
#include <cassert>
20
 
 
21
 
using namespace drizzled;
 
14
   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA */
 
15
 
 
16
#include "heapdef.h"
22
17
 
23
18
/* Read first record with the current key */
24
19
 
25
 
int heap_rfirst(HP_INFO *info, unsigned char *record, int inx)
 
20
int heap_rfirst(HP_INFO *info, uchar *record, int inx)
26
21
{
 
22
  HP_SHARE *share = info->s;
 
23
  HP_KEYDEF *keyinfo = share->keydef + inx;
 
24
  
 
25
  DBUG_ENTER("heap_rfirst");
27
26
  info->lastinx= inx;
28
 
  {
29
 
    if (!(info->getShare()->records))
30
 
    {
31
 
      errno=HA_ERR_END_OF_FILE;
32
 
      return(errno);
33
 
    }
34
 
    assert(0); /* TODO fix it */
 
27
  if (keyinfo->algorithm == HA_KEY_ALG_BTREE)
 
28
  {
 
29
    uchar *pos;
 
30
 
 
31
    if ((pos = tree_search_edge(&keyinfo->rb_tree, info->parents,
 
32
                                &info->last_pos, offsetof(TREE_ELEMENT, left))))
 
33
    {
 
34
      memcpy(&pos, pos + (*keyinfo->get_key_length)(keyinfo, pos), 
 
35
             sizeof(uchar*));
 
36
      info->current_ptr = pos;
 
37
      memcpy(record, pos, (size_t)share->reclength);
 
38
      /*
 
39
        If we're performing index_first on a table that was taken from
 
40
        table cache, info->lastkey_len is initialized to previous query.
 
41
        Thus we set info->lastkey_len to proper value for subsequent
 
42
        heap_rnext() calls.
 
43
        This is needed for DELETE queries only, otherwise this variable is
 
44
        not used.
 
45
        Note that the same workaround may be needed for heap_rlast(), but
 
46
        for now heap_rlast() is never used for DELETE queries.
 
47
      */
 
48
      info->lastkey_len= 0;
 
49
      info->update = HA_STATE_AKTIV;
 
50
    }
 
51
    else
 
52
    {
 
53
      my_errno = HA_ERR_END_OF_FILE;
 
54
      DBUG_RETURN(my_errno);
 
55
    }
 
56
    DBUG_RETURN(0);
 
57
  }
 
58
  else
 
59
  {
 
60
    if (!(info->s->records))
 
61
    {
 
62
      my_errno=HA_ERR_END_OF_FILE;
 
63
      DBUG_RETURN(my_errno);
 
64
    }
 
65
    DBUG_ASSERT(0); /* TODO fix it */
35
66
    info->current_record=0;
36
67
    info->current_hash_ptr=0;
37
68
    info->update=HA_STATE_PREV_FOUND;
38
 
    return(heap_rnext(info,record));
 
69
    DBUG_RETURN(heap_rnext(info,record));
39
70
  }
40
71
}