← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to storage/heap/hp_rprev.c

  • Committer: Stewart Smith
  • Date: 2009-03-04 22:49:53 UTC
  • mto: (910.4.2 sparc) (908.3.6 work)
  • mto: This revision was merged to the branch mainline in revision 912.
  • Revision ID: stewart@flamingspork.com-20090304224953-b2ow237kc1bkp0o0
for getopt, replace GET_ULONG with GET_UINT32.

Don't replace for sql variables (yet). instead just indicated the intense source of fail with GET_ULONG_IS_FAIL.

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