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
|
/*
* The balanced tree range 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_BTREE_RANGE_H )
#define _LIBFDATA_BTREE_RANGE_H
#include <common.h>
#include <types.h>
#include "libfdata_extern.h"
#include "libfdata_libcerror.h"
#include "libfdata_types.h"
#if defined( __cplusplus )
extern "C" {
#endif
typedef struct libfdata_btree_range libfdata_btree_range_t;
struct libfdata_btree_range
{
/* The file index
*/
int file_index;
/* The offset
*/
off64_t offset;
/* The size
*/
size64_t size;
/* The flags
*/
uint32_t flags;
/* The key value
*/
intptr_t *key_value;
/* The free key value function
*/
int (*free_key_value)(
intptr_t **key_value,
libcerror_error_t **error );
/* The key value flags
*/
uint8_t key_value_flags;
/* The mapped first leaf value index
*/
int mapped_first_leaf_value_index;
/* The mapped last leaf value index
*/
int mapped_last_leaf_value_index;
/* The mapped number of leaf values
*/
int mapped_number_of_leaf_values;
};
int libfdata_btree_range_initialize(
libfdata_btree_range_t **range,
libcerror_error_t **error );
int libfdata_btree_range_free(
libfdata_btree_range_t **range,
libcerror_error_t **error );
int libfdata_btree_range_clone(
libfdata_btree_range_t **destination_range,
libfdata_btree_range_t *source_range,
libcerror_error_t **error );
int libfdata_btree_range_get(
libfdata_btree_range_t *range,
int *data_file_index,
off64_t *data_offset,
size64_t *data_size,
uint32_t *data_flags,
intptr_t **key_value,
libcerror_error_t **error );
int libfdata_btree_range_set(
libfdata_btree_range_t *range,
int data_file_index,
off64_t data_offset,
size64_t data_size,
uint32_t 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
|
