~ubuntu-branches/ubuntu/trusty/drizzle/trusty

« back to all changes in this revision

Viewing changes to plugin/heap/hp_rlast.cc

  • Committer: Bazaar Package Importer
  • Author(s): Monty Taylor
  • Date: 2010-10-02 14:17:48 UTC
  • mfrom: (1.1.1 upstream)
  • mto: (2.1.17 sid)
  • mto: This revision was merged to the branch mainline in revision 3.
  • Revision ID: james.westby@ubuntu.com-20101002141748-m6vbfbfjhrw1153e
Tags: 2010.09.1802-1
* New upstream release.
* Removed pid-file argument hack.
* Updated GPL-2 address to be new address.
* Directly copy in drizzledump.1 since debian doesn't have sphinx 1.0 yet.
* Link to jquery from libjs-jquery. Add it as a depend.
* Add drizzled.8 symlink to the install files.

Show diffs side-by-side

added added

removed removed

Lines of Context:
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
 
        /* Read first record with the current key */
21
 
 
22
 
using namespace drizzled;
23
 
 
24
 
int heap_rlast(HP_INFO *info, unsigned char *record, int inx)
25
 
{
26
 
  HP_SHARE *share=    info->s;
27
 
  HP_KEYDEF *keyinfo= share->keydef + inx;
28
 
 
29
 
  info->lastinx= inx;
30
 
  if (keyinfo->algorithm == HA_KEY_ALG_BTREE)
31
 
  {
32
 
    unsigned char *pos;
33
 
 
34
 
    if ((pos = (unsigned char *)tree_search_edge(&keyinfo->rb_tree,
35
 
                                                 info->parents,
36
 
                                                 &info->last_pos,
37
 
                                                 offsetof(TREE_ELEMENT, right))))
38
 
    {
39
 
      memcpy(&pos, pos + (*keyinfo->get_key_length)(keyinfo, pos),
40
 
             sizeof(unsigned char*));
41
 
      info->current_ptr = pos;
42
 
      hp_extract_record(share, record, pos);
43
 
      info->update = HA_STATE_AKTIV;
44
 
    }
45
 
    else
46
 
    {
47
 
      errno = HA_ERR_END_OF_FILE;
48
 
      return(errno);
49
 
    }
50
 
    return(0);
51
 
  }
52
 
  else
53
 
  {
54
 
    info->current_ptr=0;
55
 
    info->current_hash_ptr=0;
56
 
    info->update=HA_STATE_NEXT_FOUND;
57
 
    return(heap_rprev(info,record));
58
 
  }
59
 
}