← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to plugin/heap/hp_rprev.cc

  • Committer: Monty Taylor
  • Date: 2009-08-17 18:46:08 UTC
  • mto: (1182.1.1 staging)
  • mto: This revision was merged to the branch mainline in revision 1183.
  • Revision ID: mordred@inaugust.com-20090817184608-0b2emowpjr9m6le7
"Fixed" the deadlock test. I'd still like someone to look at what's going on here.

Show diffs side-by-side

added added

removed removed

Lines of Context:
plugin/heap/hp_rprev.cc
1
 
/* Copyright (C) 2000-2002 MySQL AB
2
 
 
3
 
   This program is free software; you can redistribute it and/or modify
4
 
   it under the terms of the GNU General Public License as published by
5
 
   the Free Software Foundation; version 2 of the License.
6
 
 
7
 
   This program is distributed in the hope that it will be useful,
8
 
   but WITHOUT ANY WARRANTY; without even the implied warranty of
9
 
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
10
 
   GNU General Public License for more details.
11
 
 
12
 
   You should have received a copy of the GNU General Public License
13
 
   along with this program; if not, write to the Free Software
14
 
   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA */
15
 
 
16
 
#include "heap_priv.h"
17
 
 
18
 
#include <string.h>
19
 
 
20
 
using namespace drizzled;
21
 
 
22
 
        /* Read prev record for key */
23
 
 
24
 
 
25
 
int heap_rprev(HP_INFO *info, unsigned char *record)
26
 
{
27
 
  unsigned char *pos;
28
 
  HP_SHARE *share=info->s;
29
 
  HP_KEYDEF *keyinfo;
30
 
 
31
 
  if (info->lastinx < 0)
32
 
    return(errno=HA_ERR_WRONG_INDEX);
33
 
  keyinfo = share->keydef + info->lastinx;
34
 
  if (keyinfo->algorithm == HA_KEY_ALG_BTREE)
35
 
  {
36
 
    heap_rb_param custom_arg;
37
 
 
38
 
    if (info->last_pos)
39
 
      pos = (unsigned char *)tree_search_next(&keyinfo->rb_tree,
40
 
                                              &info->last_pos,
41
 
                                              offsetof(TREE_ELEMENT, right),
42
 
                                              offsetof(TREE_ELEMENT, left));
43
 
    else
44
 
    {
45
 
      custom_arg.keyseg = keyinfo->seg;
46
 
      custom_arg.key_length = keyinfo->length;
47
 
      custom_arg.search_flag = SEARCH_SAME;
48
 
      pos = (unsigned char *)tree_search_key(&keyinfo->rb_tree,
49
 
                                             info->lastkey, info->parents,
50
 
                                             &info->last_pos,
51
 
                                             info->last_find_flag,
52
 
                                             &custom_arg);
53
 
    }
54
 
    if (pos)
55
 
    {
56
 
      memcpy(&pos, pos + (*keyinfo->get_key_length)(keyinfo, pos),
57
 
             sizeof(unsigned char*));
58
 
      info->current_ptr = pos;
59
 
    }
60
 
    else
61
 
    {
62
 
      errno = HA_ERR_KEY_NOT_FOUND;
63
 
    }
64
 
  }
65
 
  else
66
 
  {
67
 
    if (info->current_ptr || (info->update & HA_STATE_NEXT_FOUND))
68
 
    {
69
 
      if ((info->update & HA_STATE_DELETED))
70
 
        pos= hp_search(info, share->keydef + info->lastinx, info->lastkey, 3);
71
 
      else
72
 
        pos= hp_search(info, share->keydef + info->lastinx, info->lastkey, 2);
73
 
    }
74
 
    else
75
 
    {
76
 
      pos=0;                                    /* Read next after last */
77
 
      errno=HA_ERR_KEY_NOT_FOUND;
78
 
    }
79
 
  }
80
 
  if (!pos)
81
 
  {
82
 
    info->update=HA_STATE_PREV_FOUND;           /* For heap_rprev */
83
 
    if (errno == HA_ERR_KEY_NOT_FOUND)
84
 
      errno=HA_ERR_END_OF_FILE;
85
 
    return(errno);
86
 
  }
87
 
  hp_extract_record(share, record, pos);
88
 
  info->update=HA_STATE_AKTIV | HA_STATE_PREV_FOUND;
89
 
  return(0);
90
 
}