← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to storage/heap/hp_rprev.c

  • Committer: Mark Atwood
  • Date: 2008-10-03 01:39:40 UTC
  • mto: This revision was merged to the branch mainline in revision 437.
  • Revision ID: mark@fallenpegasus.com-20081003013940-mvefjo725dltz41h
rename logging_noop to logging_query

Show diffs side-by-side

added added

removed removed

Lines of Context:
storage/heap/hp_rprev.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
 
 
20
 
using namespace drizzled;
 
14
   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA */
 
15
 
 
16
#include "heapdef.h"
21
17
 
22
18
        /* Read prev record for key */
23
19
 
24
20
 
25
 
int heap_rprev(HP_INFO *info, unsigned char *record)
 
21
int heap_rprev(HP_INFO *info, uchar *record)
26
22
{
27
 
  unsigned char *pos;
28
 
  HP_SHARE *share=info->getShare();
 
23
  uchar *pos;
 
24
  HP_SHARE *share=info->s;
29
25
  HP_KEYDEF *keyinfo;
30
26
 
31
27
  if (info->lastinx < 0)
32
 
    return(errno=HA_ERR_WRONG_INDEX);
 
28
    return(my_errno=HA_ERR_WRONG_INDEX);
33
29
  keyinfo = share->keydef + info->lastinx;
 
30
  if (keyinfo->algorithm == HA_KEY_ALG_BTREE)
 
31
  {
 
32
    heap_rb_param custom_arg;
 
33
 
 
34
    if (info->last_pos)
 
35
      pos = tree_search_next(&keyinfo->rb_tree, &info->last_pos,
 
36
                             offsetof(TREE_ELEMENT, right),
 
37
                             offsetof(TREE_ELEMENT, left));
 
38
    else
 
39
    {
 
40
      custom_arg.keyseg = keyinfo->seg;
 
41
      custom_arg.key_length = keyinfo->length;
 
42
      custom_arg.search_flag = SEARCH_SAME;
 
43
      pos = tree_search_key(&keyinfo->rb_tree, info->lastkey, info->parents, 
 
44
                           &info->last_pos, info->last_find_flag, &custom_arg);
 
45
    }
 
46
    if (pos)
 
47
    {
 
48
      memcpy(&pos, pos + (*keyinfo->get_key_length)(keyinfo, pos),
 
49
             sizeof(uchar*));
 
50
      info->current_ptr = pos;
 
51
    }
 
52
    else
 
53
    {
 
54
      my_errno = HA_ERR_KEY_NOT_FOUND;
 
55
    }
 
56
  }
 
57
  else
34
58
  {
35
59
    if (info->current_ptr || (info->update & HA_STATE_NEXT_FOUND))
36
60
    {
37
61
      if ((info->update & HA_STATE_DELETED))
38
 
        pos= hp_search(info, share->keydef + info->lastinx, &info->lastkey[0], 3);
 
62
        pos= hp_search(info, share->keydef + info->lastinx, info->lastkey, 3);
39
63
      else
40
 
        pos= hp_search(info, share->keydef + info->lastinx, &info->lastkey[0], 2);
 
64
        pos= hp_search(info, share->keydef + info->lastinx, info->lastkey, 2);
41
65
    }
42
66
    else
43
67
    {
44
68
      pos=0;                                    /* Read next after last */
45
 
      errno=HA_ERR_KEY_NOT_FOUND;
 
69
      my_errno=HA_ERR_KEY_NOT_FOUND;
46
70
    }
47
71
  }
48
72
  if (!pos)
49
73
  {
50
74
    info->update=HA_STATE_PREV_FOUND;           /* For heap_rprev */
51
 
    if (errno == HA_ERR_KEY_NOT_FOUND)
52
 
      errno=HA_ERR_END_OF_FILE;
53
 
    return(errno);
 
75
    if (my_errno == HA_ERR_KEY_NOT_FOUND)
 
76
      my_errno=HA_ERR_END_OF_FILE;
 
77
    return(my_errno);
54
78
  }
55
79
  hp_extract_record(share, record, pos);
56
80
  info->update=HA_STATE_AKTIV | HA_STATE_PREV_FOUND;