Newer
Older
/*
* Copyright (C) 2010 Mail.RU
* Copyright (C) 2010 Teodor Sigaev
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifndef _SPTREE_H_
#define _SPTREE_H_
#include <sys/types.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <third_party/qsort_arg.h>
#ifndef SPTREE_NODE_SELF
/*
* user could suggest pointer's storage himself
*/
typedef u_int32_t spnode_t;
#define SPNIL (0xffffffff)
typedef struct sptree_node_pointers {
u_int32_t left; /* sizeof(spnode_t) >= sizeof(sptree_node_pointers.left) !!! */
u_int32_t right;
} sptree_node_pointers;
#define GET_SPNODE_LEFT(snp) ( (snp)->left )
#define SET_SPNODE_LEFT(snp, v) (snp)->left = (v)
#define GET_SPNODE_RIGHT(snp) ( (snp)->right )
#define SET_SPNODE_RIGHT(snp, v) (snp)->right = (v)
#endif /* SPTREE_NODE_SELF */
#ifndef alpha
#define alpha ((double)0.75)
#endif
#define COUNTALPHA(size) floor(log((double)(size))/log((double)1.0/alpha))
#define _GET_SPNODE_LEFT(n) GET_SPNODE_LEFT( t->lrpointers + (n) )
#define _SET_SPNODE_LEFT(n, v) SET_SPNODE_LEFT( t->lrpointers + (n), (v) )
#define _GET_SPNODE_RIGHT(n) GET_SPNODE_RIGHT( t->lrpointers + (n) )
#define _SET_SPNODE_RIGHT(n, v) SET_SPNODE_RIGHT( t->lrpointers + (n), (v) )
#define ITHELEM(t, i) ( (t)->members + (t)->elemsize * (i) )
/*
* makes definition of tree with methods, name should
* be unique across all definitions.
*
* Methods:
* void sptree_NAME_init(sptree_NAME *tree, size_t elemsize, void *array,
* spnode_t array_len, spnode_t array_size,
* int (*compar)(const void *, const void *, void *), void *arg)
* void* sptree_NAME_find(sptree_NAME *tree, void *key)
* void sptree_NAME_insert(sptree_NAME *tree, void *value)
* void sptree_NAME_delete(sptree_NAME *tree, void *value)
* spnode_t sptree_NAME_walk(sptree_NAME *t, void* array, spnode_t limit, spnode_t offset)
* sptree_NAME_walk_cb(sptree_NAME *t, int (*cb)(void* cb_arg, void* elem), void *cb_arg )
* sptree_NAME_iterator* sptree_NAME_iterator_init(sptree_NAME *t)
* void sptree_NAME_iterator_init_set(sptree_NAME *t, sptree_NAME_iterator **iterator, void *start)
* void* sptree_NAME_iterator_next(sptree_NAME_iterator *i)
* void sptree_NAME_iterator_free(sptree_NAME_iterator *i)
*/
sptree_node_pointers *lrpointers; \
\
spnode_t nmember; \
spnode_t ntotal; \
\
int (*compare)(const void *, const void *, void *); \
void* arg; \
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
\
spnode_t root; \
spnode_t garbage_head; \
spnode_t size; \
spnode_t max_size; \
spnode_t max_depth; \
} sptree_##name; \
\
static spnode_t \
sptree_##name##_mktree(sptree_##name *t, spnode_t depth, \
spnode_t start, spnode_t end) { \
spnode_t half = ( (end + start) >> 1 ), tmp; \
\
if (depth > t->max_depth) t->max_depth = depth; \
\
if ( half == start || \
( tmp = sptree_##name##_mktree(t, depth+1, start, half)) == half ) \
_SET_SPNODE_LEFT(half, SPNIL); \
else \
_SET_SPNODE_LEFT(half, tmp); \
if ( half+1 >= end || \
( tmp = sptree_##name##_mktree(t, depth+1, half+1, end)) == half ) \
_SET_SPNODE_RIGHT(half, SPNIL); \
else \
_SET_SPNODE_RIGHT(half, tmp); \
\
return half; \
} \
\
static inline void \
sptree_##name##_init(sptree_##name *t, size_t elemsize, void *m, \
spnode_t nm, spnode_t nt, \
int (*compare)(const void *, const void *, void *), void *arg) { \
memset(t, 0, sizeof(*t)); \
t->members = m; \
t->max_size = t->size = t->nmember = nm; \
t->ntotal = (nt==0) ? nm : nt; \
t->compare = compare; \
t->arg = arg; \
t->garbage_head = t->root = SPNIL; \
\
if (t->ntotal == 0 || t->members == NULL) { /* from scratch */ \
if (t->ntotal == 0) { \
t->members = NULL; \
t->ntotal = 64; \
} \
\
if (t->members == NULL) \
} \
t->lrpointers = realloc(NULL, sizeof(sptree_node_pointers) * t->ntotal); \
\
if (t->nmember == 1) { \
t->root = 0; \
_SET_SPNODE_RIGHT(0, SPNIL); \
_SET_SPNODE_LEFT(0, SPNIL); \
qsort_arg(t->members, t->nmember, elemsize, t->compare, t->arg); \
/* create tree */ \
t->root = sptree_##name##_mktree(t, 1, 0, t->nmember); \
} \
} \
\
static inline void \
sptree_##name##_destroy(sptree_##name *t) { \
if (t == NULL) return; \
free(t->members); \
free(t->lrpointers); \
} \
\
static inline void* \
sptree_##name##_find(sptree_##name *t, void *k) { \
spnode_t node = t->root; \
while(node != SPNIL) { \
if (r > 0) { \
node = _GET_SPNODE_RIGHT(node); \
} else if (r < 0) { \
node = _GET_SPNODE_LEFT(node); \
} else { \
} \
} \
return NULL; \
} \
\
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
static inline void* \
sptree_##name##_first(sptree_##name *t) { \
spnode_t node = t->root; \
spnode_t first = SPNIL; \
while (node != SPNIL) { \
first = node; \
node = _GET_SPNODE_LEFT(node); \
} \
if (first != SPNIL) \
return ITHELEM(t, first); \
return NULL; \
} \
\
static inline void* \
sptree_##name##_last(sptree_##name *t) { \
spnode_t node = t->root; \
spnode_t last = SPNIL; \
while (node != SPNIL) { \
last = node; \
node = _GET_SPNODE_RIGHT(node); \
} \
if (last != SPNIL) \
return ITHELEM(t, last); \
return NULL; \
} \
\
static inline spnode_t \
sptree_##name##_size_of_subtree(sptree_##name *t, spnode_t node) { \
if (node == SPNIL) \
return 0; \
return 1 + \
sptree_##name##_size_of_subtree(t, _GET_SPNODE_LEFT(node)) + \
sptree_##name##_size_of_subtree(t, _GET_SPNODE_RIGHT(node)); \
} \
\
static inline spnode_t \
sptree_##name##_get_place(sptree_##name *t) { \
spnode_t node; \
if (t->garbage_head != SPNIL) { \
node = t->garbage_head; \
t->garbage_head = _GET_SPNODE_LEFT(t->garbage_head); \
} else { \
if (t->nmember >= t->ntotal) { \
t->ntotal *= 2; \
t->members = realloc(t->members, t->ntotal * t->elemsize); \
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
t->lrpointers = realloc(t->lrpointers, \
t->ntotal * sizeof(sptree_node_pointers)); \
} \
\
node = t->nmember; \
t->nmember++; \
} \
_SET_SPNODE_LEFT(node, SPNIL); \
_SET_SPNODE_RIGHT(node, SPNIL); \
return node; \
} \
\
static inline spnode_t \
sptree_##name##_flatten_tree(sptree_##name *t, spnode_t root, spnode_t head){ \
spnode_t node; \
if (root == SPNIL) \
return head; \
node = sptree_##name##_flatten_tree(t, _GET_SPNODE_RIGHT(root), head); \
_SET_SPNODE_RIGHT(root, node); \
return sptree_##name##_flatten_tree(t, _GET_SPNODE_LEFT(root), root); \
} \
\
static inline spnode_t \
sptree_##name##_build_tree(sptree_##name *t, spnode_t node, spnode_t size) { \
spnode_t tmp; \
if (size == 0) { \
_SET_SPNODE_LEFT(node, SPNIL); \
return node; \
} \
spnode_t root = sptree_##name##_build_tree(t, \
node, ceil(((double)size-1.0)/2.0)); \
spnode_t list = sptree_##name##_build_tree(t, \
_GET_SPNODE_RIGHT(root), floor(((double)size-1.0)/2.0)); \
tmp = _GET_SPNODE_LEFT(list); \
_SET_SPNODE_RIGHT(root, tmp); \
_SET_SPNODE_LEFT(list, root); \
\
return list; \
} \
\
static inline spnode_t \
sptree_##name##_balance(sptree_##name *t, spnode_t node, spnode_t size) { \
spnode_t fake = sptree_##name##_get_place(t); \
spnode_t z; \
\
z = sptree_##name##_flatten_tree(t, node, fake); \
sptree_##name##_build_tree(t, z, size); \
\
z = _GET_SPNODE_LEFT(fake); \
_SET_SPNODE_LEFT(fake, t->garbage_head); \
t->garbage_head = fake; \
return z; \
} \
\
static inline void \
spnode_t node, depth = 0; \
spnode_t path[ t->max_depth + 2]; \
\
if (t->root == SPNIL) { \
_SET_SPNODE_LEFT(0, SPNIL); \
_SET_SPNODE_RIGHT(0, SPNIL); \
t->root = 0; \
t->garbage_head = SPNIL; \
t->nmember = 1; \
t->size=1; \
return; \
} else { \
spnode_t parent = t->root; \
\
for(;;) { \
return; \
} \
path[depth] = parent; \
depth++; \
if (r>0) { \
if (_GET_SPNODE_RIGHT(parent) == SPNIL) { \
node = sptree_##name##_get_place(t); \
_SET_SPNODE_RIGHT(parent, node); \
break; \
} else { \
parent = _GET_SPNODE_RIGHT(parent); \
} \
} else { \
if (_GET_SPNODE_LEFT(parent) == SPNIL) { \
node = sptree_##name##_get_place(t); \
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
_SET_SPNODE_LEFT(parent, node); \
break; \
} else { \
parent = _GET_SPNODE_LEFT(parent); \
} \
} \
} \
} \
\
t->size++; \
if ( t->size > t->max_size ) \
t->max_size = t->size; \
if ( depth > t->max_depth ) \
t->max_depth = depth; \
\
if ( (double)depth > COUNTALPHA(t->size)) { \
spnode_t parent; \
spnode_t i, size = 1 ; \
\
path[depth] = node; \
\
for (i = 1; ; i++) { \
if (i < depth) { \
parent = path[ depth - i ]; \
size += 1 + sptree_##name##_size_of_subtree( t, \
_GET_SPNODE_RIGHT(parent) == path[depth - i + 1] ? \
_GET_SPNODE_LEFT(parent) : _GET_SPNODE_RIGHT(parent)); \
if ((double)i > COUNTALPHA(size)) { \
spnode_t n = sptree_##name##_balance(t, parent, size); \
spnode_t pp = path[ depth - i - 1 ]; \
if (_GET_SPNODE_LEFT(pp) == parent) \
_SET_SPNODE_LEFT(pp, n); \
else \
_SET_SPNODE_RIGHT(pp, n); \
break; \
} \
} else { \
t->root = sptree_##name##_balance(t, t->root, t->size); \
t->max_size = t->size; \
break; \
} \
} \
} \
} \
\
static inline void \
spnode_t node = t->root; \
spnode_t parent = SPNIL; \
int lr = 0; \
while(node != SPNIL) { \
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
if (r > 0) { \
parent = node; \
node = _GET_SPNODE_RIGHT(node); \
lr = +1; \
} else if (r < 0) { \
parent = node; \
node = _GET_SPNODE_LEFT(node); \
lr = -1; \
} else {/* found */ \
if (_GET_SPNODE_LEFT(node) == SPNIL && _GET_SPNODE_RIGHT(node) == SPNIL) { \
if ( parent == SPNIL ) \
t->root = SPNIL; \
else if (lr <0) \
_SET_SPNODE_LEFT(parent, SPNIL); \
else \
_SET_SPNODE_RIGHT(parent, SPNIL); \
} else if (_GET_SPNODE_LEFT(node) == SPNIL) { \
spnode_t child = _GET_SPNODE_RIGHT(node); \
if (parent == SPNIL) t->root = child; \
else if (lr <0) _SET_SPNODE_LEFT(parent, child); \
else _SET_SPNODE_RIGHT(parent, child); \
} else if (_GET_SPNODE_RIGHT(node) == SPNIL) { \
spnode_t child = _GET_SPNODE_LEFT(node); \
if (parent == SPNIL) t->root = child; \
else if (lr <0) _SET_SPNODE_LEFT(parent, child); \
else _SET_SPNODE_RIGHT(parent, child); \
} else { \
spnode_t todel = _GET_SPNODE_LEFT(node); \
\
parent = SPNIL; \
for(;;) { \
if ( _GET_SPNODE_RIGHT(todel) != SPNIL ) { \
parent = todel; \
todel = _GET_SPNODE_RIGHT(todel); \
} else \
break; \
} \
memcpy(ITHELEM(t, node), ITHELEM(t, todel), t->elemsize); \
if (parent != SPNIL) \
_SET_SPNODE_RIGHT(parent, _GET_SPNODE_LEFT(todel)); \
else \
_SET_SPNODE_LEFT(node, _GET_SPNODE_LEFT(todel)); \
node = todel; /* node to delete */ \
} \
\
_SET_SPNODE_LEFT(node, t->garbage_head); \
t->garbage_head = node; \
\
break; \
} \
} \
\
if (node == SPNIL) /* not found */ \
return; \
\
t->size --; \
if ( t->size > 0 && (double)t->size < alpha * t->max_size ) { \
t->root = sptree_##name##_balance(t, t->root, t->size); \
t->max_size = t->size; \
} \
} \
\
static inline spnode_t \
sptree_##name##_walk(sptree_##name *t, void* array, spnode_t limit, spnode_t offset) { \
int level = 0; \
spnode_t count= 0, \
node, \
stack[ t->max_depth + 1 ]; \
\
if (t->root == SPNIL) return 0; \
stack[0] = t->root; \
\
while( (node = _GET_SPNODE_LEFT( stack[level] )) != SPNIL ) { \
level++; \
stack[level] = node; \
} \
\
while( count < offset + limit && level >= 0 ) { \
\
if (count >= offset) \
memcpy(array + (count-offset) * t->elemsize, \
ITHELEM(t, stack[level]), t->elemsize); \
count++; \
\
node = _GET_SPNODE_RIGHT( stack[level] ); \
level--; \
while( node != SPNIL ) { \
level++; \
stack[level] = node; \
node = _GET_SPNODE_LEFT( stack[level] ); \
} \
} \
\
return (count > offset) ? count - offset : 0; \
} \
\
static inline void \
sptree_##name##_walk_cb(sptree_##name *t, int (*cb)(void*, void*), void *cb_arg ) { \
int level = 0; \
spnode_t node, \
stack[ t->max_depth + 1 ]; \
\
if (t->root == SPNIL) return; \
stack[0] = t->root; \
\
while( (node = _GET_SPNODE_LEFT( stack[level] )) != SPNIL ) { \
level++; \
stack[level] = node; \
} \
\
while( level >= 0 ) { \
return; \
\
node = _GET_SPNODE_RIGHT( stack[level] ); \
level--; \
while( node != SPNIL ) { \
level++; \
stack[level] = node; \
node = _GET_SPNODE_LEFT( stack[level] ); \
} \
} \
} \
\
typedef struct sptree_##name##_iterator { \
sptree_##name *t; \
int level; \
int max_depth; \
spnode_t stack[0]; \
} sptree_##name##_iterator; \
\
static inline sptree_##name##_iterator * \
sptree_##name##_iterator_init(sptree_##name *t) { \
sptree_##name##_iterator *i; \
i = realloc(NULL, sizeof(*i) + sizeof(spnode_t) * (t->max_depth + 1)); \
i->t = t; \
i->level = 0; \
i->stack[0] = t->root; \
while( (node = _GET_SPNODE_LEFT( i->stack[i->level] )) != SPNIL ) { \
i->level++; \
i->stack[i->level] = node; \
static inline void \
sptree_##name##_iterator_init_set(sptree_##name *t, sptree_##name##_iterator **i, void *k) { \
spnode_t node; \
int lastLevelEq = -1, cmp; \
\
if ((*i) == NULL || t->max_depth > (*i)->max_depth) \
*i = realloc(*i, sizeof(**i) + sizeof(spnode_t) * (t->max_depth + 1)); \
\
(*i)->t = t; \
(*i)->level = -1; \
if (t->root == SPNIL) { \
(*i)->max_depth = 0; /* valgrind points out it's used in the check above ^.*/ \
return; \
} \
\
(*i)->max_depth = t->max_depth; \
(*i)->stack[0] = t->root; \
\
node = t->root; \
while(node != SPNIL) { \
\
(*i)->level++; \
(*i)->stack[(*i)->level] = node; \
\
if (cmp > 0) { \
(*i)->level--; /* exclude current node from path, ie "mark as visited" */ \
node = _GET_SPNODE_RIGHT(node); \
} else if (cmp < 0) { \
node = _GET_SPNODE_LEFT(node); \
} else { \
lastLevelEq = (*i)->level; \
node = _GET_SPNODE_LEFT(node); /* one way iterator: from left to right */ \
} \
} \
\
if (lastLevelEq >= 0) \
(*i)->level = lastLevelEq; \
} \
\
static inline void \
sptree_##name##_iterator_free(sptree_##name##_iterator *i) { \
if (i == NULL) return; \
free(i); \
} \
\
sptree_##name##_iterator_next(sptree_##name##_iterator *i) { \
sptree_##name *t; \
spnode_t node, returnNode = SPNIL; \
\
t = i->t; \
if ( i->level >= 0 ) { \
returnNode = i->stack[i->level]; \
\
node = _GET_SPNODE_RIGHT( i->stack[i->level] ); \
i->level--; \
while( node != SPNIL ) { \
i->level++; \
i->stack[i->level] = node; \
node = _GET_SPNODE_LEFT( i->stack[i->level] ); \
} \
} \
\
return (returnNode == SPNIL) ? NULL : ITHELEM(t, returnNode); \