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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
|
/* Copyright (C) 2003 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 */
#ifndef __NDB_TUP_PAGE_HPP
#define __NDB_TUP_PAGE_HPP
#include <ndb_types.h>
#include "../diskpage.hpp"
struct Tup_page
{
struct File_formats::Page_header m_page_header;
Uint32 m_restart_seq;
Uint32 page_state;
union {
Uint32 next_page;
Uint32 nextList;
};
union {
Uint32 prev_page;
Uint32 prevList;
};
Uint32 first_cluster_page;
Uint32 last_cluster_page;
Uint32 next_cluster_page;
Uint32 prev_cluster_page;
Uint32 frag_page_id;
Uint32 physical_page_id;
Uint32 free_space;
Uint32 next_free_index;
Uint32 list_index; // free space in page bits/list, 0x8000 means not in free
Uint32 uncommitted_used_space;
Uint32 m_page_no;
Uint32 m_file_no;
Uint32 m_table_id;
Uint32 m_fragment_id;
Uint32 m_extent_no;
Uint32 m_extent_info_ptr;
Uint32 unused_ph[9];
STATIC_CONST( DATA_WORDS = File_formats::NDB_PAGE_SIZE_WORDS - 32 );
Uint32 m_data[DATA_WORDS];
};
struct Tup_fixsize_page
{
struct File_formats::Page_header m_page_header;
Uint32 m_restart_seq;
Uint32 page_state;
Uint32 next_page;
Uint32 prev_page;
Uint32 first_cluster_page;
Uint32 last_cluster_page;
Uint32 next_cluster_page;
Uint32 prev_cluster_page;
Uint32 frag_page_id;
Uint32 physical_page_id;
Uint32 free_space;
Uint32 next_free_index;
Uint32 list_index;
Uint32 uncommitted_used_space;
Uint32 m_page_no;
Uint32 m_file_no;
Uint32 m_table_id;
Uint32 m_fragment_id;
Uint32 m_extent_no;
Uint32 m_extent_info_ptr;
Uint32 unused_ph[9];
STATIC_CONST( FREE_RECORD = ~(Uint32)0 );
STATIC_CONST( DATA_WORDS = File_formats::NDB_PAGE_SIZE_WORDS - 32 );
Uint32 m_data[DATA_WORDS];
Uint32* get_ptr(Uint32 page_idx, Uint32 rec_size){
assert(page_idx + rec_size <= DATA_WORDS);
return m_data + page_idx;
}
/**
* Alloc record from page
* return page_idx
**/
Uint32 alloc_record();
Uint32 alloc_record(Uint32 page_idx);
Uint32 free_record(Uint32 page_idx);
};
struct Tup_varsize_page
{
struct File_formats::Page_header m_page_header;
Uint32 m_restart_seq;
Uint32 page_state;
Uint32 next_page;
Uint32 prev_page;
union {
Uint32 first_cluster_page;
Uint32 chunk_size;
};
union {
Uint32 last_cluster_page;
Uint32 next_chunk;
};
Uint32 next_cluster_page;
Uint32 prev_cluster_page;
Uint32 frag_page_id;
Uint32 physical_page_id;
Uint32 free_space;
Uint32 next_free_index;
Uint32 list_index;
Uint32 uncommitted_used_space;
Uint32 m_page_no;
Uint32 m_file_no;
Uint32 m_table_id;
Uint32 m_fragment_id;
Uint32 m_extent_no;
Uint32 m_extent_info_ptr;
Uint32 high_index; // size of index + 1
Uint32 insert_pos;
Uint32 unused_ph[7];
STATIC_CONST( DATA_WORDS = File_formats::NDB_PAGE_SIZE_WORDS - 32 );
STATIC_CONST( CHAIN = 0x80000000 );
STATIC_CONST( FREE = 0x40000000 );
STATIC_CONST( LEN_MASK = 0x3FFF8000 );
STATIC_CONST( POS_MASK = 0x00007FFF );
STATIC_CONST( LEN_SHIFT = 15 );
STATIC_CONST( POS_SHIFT = 0 );
STATIC_CONST( END_OF_FREE_LIST = POS_MASK );
STATIC_CONST( NEXT_MASK = POS_MASK );
STATIC_CONST( NEXT_SHIFT = POS_SHIFT );
STATIC_CONST( PREV_MASK = LEN_MASK );
STATIC_CONST( PREV_SHIFT = LEN_SHIFT );
Uint32 m_data[DATA_WORDS];
void init();
Uint32* get_free_space_ptr() {
return m_data+insert_pos;
}
Uint32 largest_frag_size() const {
return DATA_WORDS - (high_index + insert_pos);
}
Uint32 *get_index_ptr(Uint32 page_idx) {
assert(page_idx < high_index);
return (m_data + (DATA_WORDS - page_idx));
}
Uint32 get_index_word(Uint32 page_idx) const {
assert(page_idx < high_index);
return * (m_data + (DATA_WORDS - page_idx));
}
/**
* Alloc record from page, return page_idx
* temp is used when having to reorg page before allocating
*/
Uint32 alloc_record(Uint32 size, Tup_varsize_page* temp, Uint32 chain);
/**
* Alloc page_idx from page, return page_idx
* temp is used when having to reorg page before allocating
*/
Uint32 alloc_record(Uint32 page_idx, Uint32 size, Tup_varsize_page* temp);
/**
* Free record from page
*/
Uint32 free_record(Uint32 page_idx, Uint32 chain);
void reorg(Tup_varsize_page* temp);
void rebuild_index(Uint32* ptr);
/**
* Check if one can grow tuple wo/ reorg
*/
bool is_space_behind_entry(Uint32 page_index, Uint32 growth_len) const {
Uint32 idx= get_index_word(page_index);
Uint32 pos= (idx & POS_MASK) >> POS_SHIFT;
Uint32 len= (idx & LEN_MASK) >> LEN_SHIFT;
if ((pos + len == insert_pos) &&
(insert_pos + growth_len < DATA_WORDS - high_index))
return true;
return false;
}
void grow_entry(Uint32 page_index, Uint32 growth_len) {
assert(free_space >= growth_len);
Uint32 *pos= get_index_ptr(page_index);
Uint32 idx= *pos;
assert(! (idx & FREE));
assert((((idx & POS_MASK) >> POS_SHIFT) + ((idx & LEN_MASK) >> LEN_SHIFT))
== insert_pos);
* pos= idx + (growth_len << LEN_SHIFT);
insert_pos+= growth_len;
free_space-= growth_len;
}
void shrink_entry(Uint32 page_index, Uint32 new_size){
Uint32 *pos= get_index_ptr(page_index);
Uint32 idx= *pos;
Uint32 old_pos = (idx & POS_MASK) >> POS_SHIFT;
Uint32 old_size = (idx & LEN_MASK) >> LEN_SHIFT;
assert( ! (idx & FREE));
assert(old_size >= new_size);
* pos= (idx & ~LEN_MASK) + (new_size << LEN_SHIFT);
Uint32 shrink = old_size - new_size;
#ifdef VM_TRACE
memset(m_data + old_pos + new_size, 0xF1, 4 * shrink);
#endif
free_space+= shrink;
if(insert_pos == (old_pos + old_size))
insert_pos -= shrink;
}
Uint32* get_ptr(Uint32 page_idx) {
return m_data + ((get_index_word(page_idx) & POS_MASK) >> POS_SHIFT);
}
void set_entry_offset(Uint32 page_idx, Uint32 offset){
Uint32 *pos= get_index_ptr(page_idx);
* pos = (* pos & ~POS_MASK) + (offset << POS_SHIFT);
}
void set_entry_len(Uint32 page_idx, Uint32 len) {
Uint32 *pos= get_index_ptr(page_idx);
* pos = (*pos & ~LEN_MASK) + (len << LEN_SHIFT);
}
Uint32 get_entry_len(Uint32 page_idx) const {
return (get_index_word(page_idx) & LEN_MASK) >> LEN_SHIFT;
}
Uint32 get_entry_chain(Uint32 page_idx) const {
return get_index_word(page_idx) & CHAIN;
}
};
NdbOut& operator<< (NdbOut& out, const Tup_varsize_page& page);
NdbOut& operator<< (NdbOut& out, const Tup_fixsize_page& page);
#endif
|
