← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to storage/heap/hp_rfirst.c

  • Committer: Monty Taylor
  • Date: 2008-12-18 07:42:01 UTC
  • mto: This revision was merged to the branch mainline in revision 714.
  • Revision ID: monty@inaugust.com-20081218074201-4m7d63t72qfuplwx
Fixed max() problem for solaris

Show diffs side-by-side

added added

removed removed

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