1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
/* Copyright (C) 2000-2002, 2004, 2006 MySQL AB
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; version 2 of the License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
/* Read a record from a random position */
#include "heapdef.h"
/*
Returns one of following values:
0 = Ok.
HA_ERR_RECORD_DELETED = Record is deleted.
HA_ERR_END_OF_FILE = EOF.
*/
int heap_rrnd(register HP_INFO *info, uchar *record, uchar *pos)
{
HP_SHARE *share=info->s;
info->lastinx= -1;
if (!(info->current_ptr= pos))
{
info->update= 0;
return(my_errno= HA_ERR_END_OF_FILE);
}
if (get_chunk_status(&share->recordspace, info->current_ptr) != CHUNK_STATUS_ACTIVE)
{
/* treat deleted and linked chunks as deleted */
info->update= HA_STATE_PREV_FOUND | HA_STATE_NEXT_FOUND;
return(my_errno=HA_ERR_RECORD_DELETED);
}
info->update=HA_STATE_PREV_FOUND | HA_STATE_NEXT_FOUND | HA_STATE_AKTIV;
hp_extract_record(share, record, info->current_ptr);
info->current_hash_ptr=0; /* Can't use rnext */
return(0);
} /* heap_rrnd */
#ifdef WANT_OLD_HEAP_VERSION
/*
If pos == -1 then read next record
Returns one of following values:
0 = Ok.
HA_ERR_RECORD_DELETED = Record is deleted.
HA_ERR_END_OF_FILE = EOF.
*/
int heap_rrnd_old(register HP_INFO *info, uchar *record, uint32_t pos)
{
HP_SHARE *share=info->s;
asdfasdf;
info->lastinx= -1;
if (pos == (uint32_t) -1)
{
pos= ++info->current_record;
if (pos % share->block.records_in_block && /* Quick next record */
pos < share->used_chunk_count+share->deleted_chunk_count &&
(info->update & HA_STATE_PREV_FOUND))
{
info->current_ptr+=share->block.recbufferlen;
goto end;
}
}
else
info->current_record=pos;
if (pos >= share->used_chunk_count+share->deleted_chunk_count)
{
info->update= 0;
return(my_errno= HA_ERR_END_OF_FILE);
}
/* Find record number pos */
hp_find_record(info, pos);
end:
if (!info->current_ptr[share->reclength])
{
info->update= HA_STATE_PREV_FOUND | HA_STATE_NEXT_FOUND;
return(my_errno=HA_ERR_RECORD_DELETED);
}
info->update=HA_STATE_PREV_FOUND | HA_STATE_NEXT_FOUND | HA_STATE_AKTIV;
memcpy(record,info->current_ptr,(size_t) share->reclength);
info->current_hash_ptr=0; /* Can't use rnext */
return(0);
} /* heap_rrnd */
#endif /* WANT_OLD_HEAP_VERSION */
|