-
Notifications
You must be signed in to change notification settings - Fork 1
/
range.c
360 lines (317 loc) · 9.66 KB
/
range.c
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
#include <assert.h>
#include <errno.h>
#include <inttypes.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <strings.h>
#include "pool.h"
#include "range.h"
#include "rbtree.h"
typedef struct rnode {
struct rb_node node;
struct rnode *next;
range range;
} rnode;
typedef struct {
struct rb_root tree; /* Tree of ranges in set */
poolset *ps; /* Pool of nodes for tree */
rnode *free; /* free list of recycled nodes */
uint64_t size; /* Total size in-range */
/* Total size represented for each type */
uint64_t sizes[sizeof(mask_t) * 8];
} rangeset_t;
#define RANGE_OF(x) (((rnode *)(x))->range)
#define r_offset(x) (RANGE_OF(x).offset)
#define r_length(x) (RANGE_OF(x).length)
#define r_end(x) (RANGE_OF(x).end)
rangeset *new_rangeset(uint64_t pool_size)
{
rangeset_t *tmp = (rangeset_t *)calloc(sizeof(rangeset_t), 1);
if (!tmp) {
perror("Couldn't allocate memory for rangeset");
return NULL;
}
tmp->tree = RB_ROOT;
tmp->ps = new_poolset(pool_size, sizeof(rnode));
if (!tmp->ps) {
free(tmp);
return NULL;
}
return (rangeset *)tmp;
}
void delete_rangeset(rangeset *rset)
{
rangeset_t *rs = (rangeset_t *)rset;
delete_poolset(rs->ps);
free(rs);
}
static rnode *pop_free_range(rangeset_t *rs)
{
rnode *tmp;
if (rs->free) {
tmp = rs->free;
rs->free = tmp->next;
tmp->next = NULL;
return tmp;
}
return NULL;
}
static rnode *get_range(rangeset_t *rs)
{
rnode *tmp;
if (!rs) {
return NULL;
}
/* (1) Check free node list */
tmp = pop_free_range(rs);
if (tmp) {
return tmp;
}
/* (2) Check pool */
return pool_get_atom(rs->ps);
}
static rnode *new_range(rangeset_t *rs, uint64_t offset,
uint64_t length, mask_t typemask)
{
rnode *node = get_range(rs);
if (!node) {
return NULL;
}
node->range.offset = offset;
node->range.length = length;
node->range.end = offset + length;
node->range.typemask = typemask;
return node;
}
/**
* add to free list of nodes for re-use.
*/
static void return_range_node(rangeset_t *rs, rnode *node)
{
node->range.offset = 0;
node->range.length = 0;
node->range.end = 0;
node->next = rs->free;
rs->free = node;
}
/**
* unlink node from range tree, add to free list of nodes for re-use.
*/
static void delete_range_node(rangeset_t *rs, rnode *node)
{
rb_erase(&node->node, &rs->tree);
return_range_node(rs, node);
}
/**
* Given a range in a tree, find the next lowest range.
*/
static rnode *next_lowest(rnode *range)
{
return (rnode *)rb_prev(&range->node);
}
/**
* Given a range in a tree, find the next highest range.
*/
static rnode *next_highest(rnode *range)
{
return (rnode *)rb_next(&range->node);
}
/**
* Merge two ranges into one, deleting the 'right' range.
*/
static void merge(rangeset_t *rs, rnode *left, rnode *right)
{
assert(left->range.offset < right->range.offset);
assert(left->range.end == right->range.offset);
left->range.length += right->range.length;
left->range.end = right->range.end;
assert(left->range.end == left->range.offset + left->range.length);
delete_range_node(rs, right);
}
/**
* Check to the 'left' of a node to see if it can be merged.
*/
static void check_merge_left(rangeset_t *rs, rnode *node)
{
rnode *neighbor = next_lowest(node);
if (neighbor && \
neighbor->range.end == node->range.offset && \
node->range.typemask == neighbor->range.typemask) {
merge(rs, neighbor, node);
}
}
/**
* Check to the 'right' of a node to see if it can be merged.
*/
static void check_merge_right(rangeset_t *rs, rnode *node)
{
rnode *neighbor = next_highest(node);
if (neighbor && \
node->range.end == neighbor->range.offset && \
node->range.typemask == neighbor->range.typemask) {
merge(rs, node, neighbor);
}
}
/* Returns typemask of conflicting range, or 0 if there are no overlaps. */
int range_overlap(rangeset *rset, uint64_t offset, uint64_t len,
const range **r)
{
rangeset_t *rs = (rangeset_t *)rset;
struct rb_root *root = &rs->tree;
struct rb_node **new = &(root->rb_node);
while (*new) {
rnode *this = (rnode *)*new;
bool left = (offset < this->range.offset);
if (left) {
new = &((*new)->rb_left);
if (offset + len > this->range.offset) {
if (r) {
*r = &this->range;
}
return this->range.typemask;
}
} else {
new = &((*new)->rb_right);
if (offset < this->range.end) {
if (r) {
*r = &this->range;
}
return this->range.typemask;
}
}
}
return 0;
}
/**
* link new node into range tree. Coalesce where appropriate.
* @return: 0 if successful, -ERRNO on error, +typemask on collision.
* range **r is updated with a pointer to the conflicting range if
* it is provided.
*/
int add_range(rangeset *rset, uint64_t offset, uint64_t len, mask_t typemask,
const range **r)
{
rangeset_t *rs = (rangeset_t *)rset;
struct rb_root *root = &rs->tree;
struct rb_node **new = &(root->rb_node), *parent = NULL;
rnode *tmp;
int rc, i;
rc = range_overlap(rset, offset, len, r);
if (rc) {
return rc; /* 0 or +typemask */
}
while (*new) {
rnode *this = (rnode *)*new;
bool left = (offset < this->range.offset);
parent = *new;
if (left) {
new = &((*new)->rb_left);
if (offset + len == this->range.offset && \
typemask == this->range.typemask) {
/* Parent's offset is pushed left. The parent's offset can never
* be pushed below left-child because overlaps are prohibited.
* Parent may be able to merge with its nearest-left-neighbor */
this->range.offset = offset;
this->range.length += len;
assert(this->range.end == \
this->range.offset + this->range.length);
check_merge_left(rs, this);
goto out;
}
} else {
new = &((*new)->rb_right);
if (this->range.end == offset && this->range.typemask == typemask) {
/* Coalesce into parent (extends parent's range)
* parent may be able to merge with its nearest-right-neighbor.
*/
this->range.length += len;
this->range.end = offset + len;
assert(this->range.end == this->range.offset + this->range.length);
check_merge_right(rs, this);
goto out;
}
}
}
/* Add new node and rebalance tree. */
tmp = new_range(rs, offset, len, typemask);
if (!tmp) {
return -ENOMEM;
}
rb_link_node(&tmp->node, parent, new);
rb_insert_color(&tmp->node, root);
out:
rs->size += len;
while (typemask) {
i = ffs(typemask) - 1;
rs->sizes[i] += len;
typemask = typemask & ~(1 << i);
}
return 0;
}
static void fprint_range_inorder(FILE *stream, rnode *node)
{
if (node == NULL) {
return;
}
fprint_range_inorder(stream, (rnode *)node->node.rb_left);
fprintf(stream, "0x%09"PRIx64" - 0x%09"PRIx64"\n",
node->range.offset, node->range.end - 1);
fprint_range_inorder(stream, (rnode *)node->node.rb_right);
}
void fprint_ranges(FILE *stream, rangeset *rset)
{
rangeset_t *rs = (rangeset_t *)rset;
fprint_range_inorder(stream, (rnode *)rs->tree.rb_node);
}
void print_ranges(rangeset *rset)
{
fprint_ranges(stdout, rset);
}
static int _range_traversal(rnode *node, enum traversal order, mask_t typemask,
int (*fn)(const range *range, void *opaque), void *opaque)
{
int rc;
#define _RN_CALLBACK(ORDER) do { \
if ((order == (ORDER)) && (node->range.typemask & typemask)) { \
rc = fn(&node->range, opaque); \
if (rc) { \
return rc; \
} \
} \
} while (0);
if (node == NULL) {
return 0;
}
_RN_CALLBACK(T_PREORDER);
_range_traversal((rnode *)node->node.rb_left, order, typemask, fn, opaque);
_RN_CALLBACK(T_INORDER);
_range_traversal((rnode *)node->node.rb_right, order, typemask, fn, opaque);
_RN_CALLBACK(T_POSTORDER);
return 0;
}
int range_traversal_filter(rangeset *rset, enum traversal order,
mask_t typemask,
int (*fn)(const range *node, void *opaque), void *opaque)
{
rangeset_t *rs = (rangeset_t *)rset;
return _range_traversal((rnode *)rs->tree.rb_node, order,
typemask, fn, opaque);
}
int range_traversal(rangeset *rset, enum traversal order,
int (*fn)(const range *node, void *opaque), void *opaque)
{
return range_traversal_filter(rset, order, (mask_t)-1, fn, opaque);
}
uint64_t get_size(rangeset *rset)
{
return ((rangeset_t *)rset)->size;
}
uint64_t get_type_size(rangeset *rset, unsigned type_index)
{
if (!rset || type_index > sizeof(mask_t) * 8) {
return 0;
}
return ((rangeset_t *)rset)->sizes[type_index];
}