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
|
/*
* The balanced tree node functions
*
* Copyright (C) 2010-2018, 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_NODE_H )
#define _LIBFDATA_INTERNAL_BTREE_NODE_H
#include <common.h>
#include <types.h>
#include "libfdata_btree_range.h"
#include "libfdata_extern.h"
#include "libfdata_libcdata.h"
#include "libfdata_libcerror.h"
#include "libfdata_types.h"
#if defined( __cplusplus )
extern "C" {
#endif
typedef struct libfdata_internal_btree_node libfdata_internal_btree_node_t;
struct libfdata_internal_btree_node
{
/* The (node) level
*/
int level;
/* The sub node (data) ranges array
*/
libcdata_array_t *sub_node_ranges_array;
/* The number of leaf values in the branch
*/
int branch_number_of_leaf_values;
/* The leaf value (data) ranges array
*/
libcdata_array_t *leaf_value_ranges_array;
/* The flags
*/
uint8_t flags;
};
int libfdata_btree_node_initialize(
libfdata_btree_node_t **node,
int level,
libcerror_error_t **error );
int libfdata_btree_node_free(
libfdata_btree_node_t **node,
libcerror_error_t **error );
/* Node functions
*/
LIBFDATA_EXTERN \
int libfdata_btree_node_get_level(
libfdata_btree_node_t *node,
int *level,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_node_is_branch(
libfdata_btree_node_t *node,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_node_is_leaf(
libfdata_btree_node_t *node,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_node_is_root(
libfdata_btree_node_t *node,
libcerror_error_t **error );
/* Sub node data range functions
*/
LIBFDATA_EXTERN \
int libfdata_btree_node_get_number_of_sub_nodes(
libfdata_btree_node_t *node,
int *number_of_sub_nodes,
libcerror_error_t **error );
int libfdata_btree_node_get_sub_node_data_range_by_index(
libfdata_btree_node_t *node,
int sub_node_index,
libfdata_btree_range_t **sub_node_data_range,
libcerror_error_t **error );
int libfdata_btree_node_get_sub_node_data_range_by_mapped_index(
libfdata_btree_node_t *node,
int mapped_index,
libfdata_btree_range_t **sub_node_data_range,
libcerror_error_t **error );
int libfdata_btree_node_get_sub_node_data_range_by_key(
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 *sub_node_index,
libfdata_btree_range_t **sub_node_data_range,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_node_get_sub_node_by_index(
libfdata_btree_node_t *node,
int sub_node_index,
int *sub_node_data_file_index,
off64_t *sub_node_data_offset,
size64_t *sub_node_data_size,
uint32_t *sub_node_data_flags,
intptr_t **key_value,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_node_set_sub_node_by_index(
libfdata_btree_node_t *node,
int sub_node_index,
int sub_node_data_file_index,
off64_t sub_node_data_offset,
size64_t sub_node_data_size,
uint32_t sub_node_data_flags,
intptr_t *key_value,
int (*free_key_value)(
intptr_t **key_value,
libcerror_error_t **error ),
uint8_t key_value_flags,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_node_append_sub_node(
libfdata_btree_node_t *node,
int *sub_node_index,
int sub_node_data_file_index,
off64_t sub_node_data_offset,
size64_t sub_node_data_size,
uint32_t sub_node_data_flags,
intptr_t *key_value,
int (*free_key_value)(
intptr_t **key_value,
libcerror_error_t **error ),
uint8_t key_value_flags,
libcerror_error_t **error );
/* Branch leaf values functions
*/
int libfdata_btree_node_get_number_of_leaf_values_in_branch(
libfdata_btree_node_t *node,
int *number_of_leaf_values,
libcerror_error_t **error );
/* Leaf value data range functions
*/
LIBFDATA_EXTERN \
int libfdata_btree_node_get_number_of_leaf_values(
libfdata_btree_node_t *node,
int *number_of_leaf_values,
libcerror_error_t **error );
int libfdata_btree_node_get_leaf_value_data_range_by_index(
libfdata_btree_node_t *node,
int leaf_value_index,
libfdata_btree_range_t **leaf_value_data_range,
libcerror_error_t **error );
int libfdata_btree_node_get_leaf_value_data_range_by_mapped_index(
libfdata_btree_node_t *node,
int mapped_index,
libfdata_btree_range_t **leaf_value_data_range,
libcerror_error_t **error );
int libfdata_btree_node_get_leaf_value_data_range_by_key(
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 ),
libfdata_btree_range_t **leaf_value_data_range,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_node_get_leaf_value_by_index(
libfdata_btree_node_t *node,
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,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_node_get_leaf_value_by_key(
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 *leaf_value_data_file_index,
off64_t *leaf_value_data_offset,
size64_t *leaf_value_data_size,
uint32_t *leaf_value_data_flags,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_node_set_leaf_value_by_index(
libfdata_btree_node_t *node,
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,
int (*free_key_value)(
intptr_t **key_value,
libcerror_error_t **error ),
uint8_t key_value_flags,
libcerror_error_t **error );
LIBFDATA_EXTERN \
int libfdata_btree_node_append_leaf_value(
libfdata_btree_node_t *node,
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,
int (*free_key_value)(
intptr_t **key_value,
libcerror_error_t **error ),
uint8_t key_value_flags,
libcerror_error_t **error );
#if defined( __cplusplus )
}
#endif
#endif /* !defined( _LIBFDATA_INTERNAL_BTREE_NODE_H ) */
|
