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
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
|
/*
* The balanced tree functions
*
* Copyright (C) 2010-2016, Joachim Metz <joachim.metz@gmail.com>
*
* Refer to AUTHORS for acknowledgements.
*
* This software is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This software 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 Lesser General Public License
* along with this software. If not, see <http://www.gnu.org/licenses/>.
*/
#if !defined( _LIBFDATA_INTERNAL_BTREE_H )
#define _LIBFDATA_INTERNAL_BTREE_H
#include <common.h>
#include <types.h>
#include "libfdata_btree_node.h"
#include "libfdata_btree_range.h"
#include "libfdata_extern.h"
#include "libfdata_libcerror.h"
#include "libfdata_libfcache.h"
#include "libfdata_types.h"
#if defined( __cplusplus )
extern "C" {
#endif
typedef struct libfdata_internal_btree libfdata_internal_btree_t;
struct libfdata_internal_btree
{
/* The root node data range
*/
libfdata_btree_range_t *root_node_data_range;
/* The time stamp
*/
time_t timestamp;
/* The flags
*/
uint8_t flags;
/* The calculate node cache entry index value
*/
int (*calculate_node_cache_entry_index)(
libfdata_btree_t *tree,
libfcache_cache_t *cache,
int level,
int node_data_file_index,
off64_t node_data_offset,
size64_t node_data_size,
uint32_t node_data_flags,
int *cache_entry_index,
libcerror_error_t **error );
/* The calculate leaf value cache entry index value
*/
int (*calculate_leaf_value_cache_entry_index)(
libfdata_btree_t *tree,
libfcache_cache_t *cache,
int leaf_value_index,
int leaf_value_data_file_index,
off64_t leaf_value_data_offset,
size64_t leaf_value_data_size,
uint32_t leaf_value_data_flags,
int *cache_entry_index,
libcerror_error_t **error );
/* The data handle
*/
intptr_t *data_handle;
/* The free data handle function
*/
int (*free_data_handle)(
intptr_t **data_handle,
libcerror_error_t **error );
/* The clone (duplicate) data handle function
*/
int (*clone_data_handle)(
intptr_t **destination_data_handle,
intptr_t *source_data_handle,
libcerror_error_t **error );
/* The read node function
*/
int (*read_node)(
intptr_t *data_handle,
intptr_t *file_io_handle,
libfdata_btree_node_t *node,
int node_data_file_index,
off64_t node_data_offset,
size64_t node_data_size,
uint32_t node_data_flags,
intptr_t *key_value,
uint8_t read_flags,
libcerror_error_t **error );
/* The read leaf value function
*/
int (*read_leaf_value)(
intptr_t *data_handle,
intptr_t *file_io_handle,
libfdata_btree_t *tree,
libfcache_cache_t *cache,
int leaf_value_index,
int leaf_value_data_file_index,
off64_t leaf_value_data_offset,
size64_t leaf_value_data_size,
uint32_t leaf_value_data_flags,
intptr_t *key_value,
uint8_t read_flags,
libcerror_error_t **error );
};
LIBFDATA_EXTERN \
int libfdata_btree_initialize(
libfdata_btree_t **tree,
intptr_t *data_handle,
int (*free_data_handle)(
intptr_t **data_handle,
libcerror_error_t **error ),
int (*clone_data_handle)(
intptr_t **destination_data_handle,
intptr_t *source_data_handle,
libcerror_error_t **error ),
int (*read_node)(
intptr_t *data_handle,
intptr_t *file_io_handle,
libfdata_btree_node_t *node,
int node_data_file_index,
off64_t node_data_offset,
size64_t node_data_size,
uint32_t node_data_flags,
intptr_t *key_value,
uint8_t read_flags,
libcerror_error_t **error ),
int (*read_leaf_value)(
intptr_t *data_handle,
intptr_t *file_io_handle,
libfdata_btree_t *tree,
libfcache_cache_t *cache,
int leaf_value_index,
int leaf_value_data_file_index,
off64_t leaf_value_data_offset,
size64_t leaf_value_data_size,
uint32_t leaf_value_data_flags,
intptr_t *key_value,
uint8_t read_flags,
libcerror_error_t **error ),
uint8_t flags,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_free(
libfdata_btree_t **tree,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_clone(
libfdata_btree_t **destination_tree,
libfdata_btree_t *source_tree,
libcerror_error_t **error );
/* Cache entry functions
*/
int libfdata_btree_calculate_node_cache_entry_index(
libfdata_btree_t *tree,
libfcache_cache_t *cache,
int level,
int node_data_file_index,
off64_t node_data_offset,
size64_t node_data_size,
uint32_t node_data_flags,
int *cache_entry_index,
libcerror_error_t **error );
int libfdata_btree_calculate_leaf_value_cache_entry_index(
libfdata_btree_t *tree,
libfcache_cache_t *cache,
int leaf_value_index,
int leaf_value_data_file_index,
off64_t leaf_value_data_offset,
size64_t leaf_value_data_size,
uint32_t leaf_value_data_flags,
int *cache_entry_index,
libcerror_error_t **error );
/* Root node functions
*/
LIBFDATA_EXTERN \
int libfdata_btree_get_root_node(
libfdata_btree_t *tree,
int *node_data_file_index,
off64_t *node_data_offset,
size64_t *node_data_size,
uint32_t *node_data_flags,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_set_root_node(
libfdata_btree_t *tree,
int node_data_file_index,
off64_t node_data_offset,
size64_t node_data_size,
uint32_t node_data_flags,
libcerror_error_t **error );
/* Leaf value functions
*/
int libfdata_btree_read_leaf_value(
libfdata_internal_btree_t *internal_tree,
intptr_t *file_io_handle,
libfcache_cache_t *cache,
libfdata_btree_range_t *leaf_value_data_range,
intptr_t **leaf_value,
uint8_t read_flags,
libcerror_error_t **error );
int libfdata_btree_read_node(
libfdata_internal_btree_t *internal_tree,
intptr_t *file_io_handle,
libfcache_cache_t *cache,
libfdata_btree_range_t *node_data_range,
int level,
libfdata_btree_node_t **node,
uint8_t read_flags,
libcerror_error_t **error );
int libfdata_btree_read_sub_tree(
libfdata_internal_btree_t *internal_tree,
intptr_t *file_io_handle,
libfcache_cache_t *cache,
libfdata_btree_range_t *node_data_range,
int level,
int mapped_first_leaf_value_index,
libfdata_btree_node_t **node,
uint8_t read_flags,
libcerror_error_t **error );
int libfdata_btree_get_leaf_node_by_index(
libfdata_internal_btree_t *internal_tree,
intptr_t *file_io_handle,
libfcache_cache_t *cache,
libfdata_btree_range_t *node_data_range,
int level,
int leaf_value_index,
libfdata_btree_node_t **node,
uint8_t read_flags,
libcerror_error_t **error );
int libfdata_btree_get_leaf_node_by_key(
libfdata_internal_btree_t *internal_tree,
intptr_t *file_io_handle,
libfcache_cache_t *cache,
libfdata_btree_range_t *node_data_range,
int maximum_node_level,
int current_node_level,
intptr_t *key_value,
int (*key_value_compare_function)(
intptr_t *first_key_value,
intptr_t *second_key_value,
libcerror_error_t **error ),
int *node_index,
libfdata_btree_node_t **node,
uint8_t read_flags,
libcerror_error_t **error );
int libfdata_btree_get_next_leaf_node_by_key(
libfdata_internal_btree_t *internal_tree,
intptr_t *file_io_handle,
libfcache_cache_t *cache,
libfdata_btree_range_t *node_data_range,
int node_index,
libfdata_btree_node_t *node,
intptr_t *key_value,
int (*key_value_compare_function)(
intptr_t *first_key_value,
intptr_t *second_key_value,
libcerror_error_t **error ),
int *next_node_index,
libfdata_btree_node_t **next_node,
uint8_t read_flags,
libcerror_error_t **error );
int libfdata_btree_get_previous_leaf_node_by_key(
libfdata_internal_btree_t *internal_tree,
intptr_t *file_io_handle,
libfcache_cache_t *cache,
libfdata_btree_range_t *node_data_range,
int node_index,
libfdata_btree_node_t *node,
intptr_t *key_value,
int (*key_value_compare_function)(
intptr_t *first_key_value,
intptr_t *second_key_value,
libcerror_error_t **error ),
int *previous_node_index,
libfdata_btree_node_t **previous_node,
uint8_t read_flags,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_get_number_of_leaf_values(
libfdata_btree_t *tree,
intptr_t *file_io_handle,
libfcache_cache_t *cache,
int *number_of_values,
uint8_t read_flags,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_get_leaf_value_by_index(
libfdata_btree_t *tree,
intptr_t *file_io_handle,
libfcache_cache_t *cache,
int leaf_value_index,
intptr_t **value,
uint8_t read_flags,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_set_leaf_value_by_index(
libfdata_btree_t *tree,
intptr_t *file_io_handle,
libfcache_cache_t *cache,
int leaf_value_index,
intptr_t *leaf_value,
int (*free_leaf_value)(
intptr_t **leaf_value,
libcerror_error_t **error ),
uint8_t write_flags,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_get_leaf_value_by_key(
libfdata_btree_t *tree,
intptr_t *file_io_handle,
libfcache_cache_t *cache,
intptr_t *key_value,
int (*key_value_compare_function)(
intptr_t *first_key_value,
intptr_t *second_key_value,
libcerror_error_t **error ),
uint8_t search_flags,
intptr_t **value,
uint8_t read_flags,
libcerror_error_t **error );
#if defined( __cplusplus )
}
#endif
#endif
|
