~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to plugin/heap/hp_rfirst.cc

  • Committer: Eric Day
  • Date: 2010-01-16 19:15:44 UTC
  • mto: This revision was merged to the branch mainline in revision 1271.
  • Revision ID: eday@oddments.org-20100116191544-pdpcz98ngewb0l56
Fixed test to not output verbose drizzleslap output.

Show diffs side-by-side

added added

removed removed

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