| 1 |
/*- |
| 2 |
* Copyright 1997-1999, 2001, John-Mark Gurney. |
| 3 |
* 2008-2009, Attractive Chaos <[email protected]> |
| 4 |
* |
| 5 |
* Redistribution and use in source and binary forms, with or without |
| 6 |
* modification, are permitted provided that the following conditions |
| 7 |
* are met: |
| 8 |
* |
| 9 |
* 1. Redistributions of source code must retain the above copyright |
| 10 |
* notice, this list of conditions and the following disclaimer. |
| 11 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 12 |
* notice, this list of conditions and the following disclaimer in the |
| 13 |
* documentation and/or other materials provided with the distribution. |
| 14 |
* |
| 15 |
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
| 16 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 17 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 18 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
| 19 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 20 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 21 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 22 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 23 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 24 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 25 |
* SUCH DAMAGE. |
| 26 |
*/ |
| 27 |
|
| 28 |
#ifndef __AC_KBTREE_H |
| 29 |
#define __AC_KBTREE_H |
| 30 |
|
| 31 |
#include <stdlib.h> |
| 32 |
#include <string.h> |
| 33 |
#include <stdint.h> |
| 34 |
|
| 35 |
#ifdef USE_MALLOC_WRAPPERS |
| 36 |
# include "malloc_wrap.h" |
| 37 |
#endif |
| 38 |
|
| 39 |
typedef struct { |
| 40 |
int32_t is_internal:1, n:31; |
| 41 |
} kbnode_t; |
| 42 |
|
| 43 |
#define __KB_KEY(type, x) ((type*)((char*)x + 4)) |
| 44 |
#define __KB_PTR(btr, x) ((kbnode_t**)((char*)x + btr->off_ptr)) |
| 45 |
|
| 46 |
#define __KB_TREE_T(name) \ |
| 47 |
typedef struct { \ |
| 48 |
kbnode_t *root; \ |
| 49 |
int off_key, off_ptr, ilen, elen; \ |
| 50 |
int n, t; \ |
| 51 |
int n_keys, n_nodes; \ |
| 52 |
} kbtree_##name##_t; |
| 53 |
|
| 54 |
#define __KB_INIT(name, key_t) \ |
| 55 |
kbtree_##name##_t *kb_init_##name(int size) \ |
| 56 |
{ \ |
| 57 |
kbtree_##name##_t *b; \ |
| 58 |
b = (kbtree_##name##_t*)calloc(1, sizeof(kbtree_##name##_t)); \ |
| 59 |
b->t = ((size - 4 - sizeof(void*)) / (sizeof(void*) + sizeof(key_t)) + 1) >> 1; \ |
| 60 |
if (b->t < 2) { \ |
| 61 |
free(b); return 0; \ |
| 62 |
} \ |
| 63 |
b->n = 2 * b->t - 1; \ |
| 64 |
b->off_ptr = 4 + b->n * sizeof(key_t); \ |
| 65 |
b->ilen = (4 + sizeof(void*) + b->n * (sizeof(void*) + sizeof(key_t)) + 3) >> 2 << 2; \ |
| 66 |
b->elen = (b->off_ptr + 3) >> 2 << 2; \ |
| 67 |
b->root = (kbnode_t*)calloc(1, b->ilen); \ |
| 68 |
++b->n_nodes; \ |
| 69 |
return b; \ |
| 70 |
} |
| 71 |
|
| 72 |
#define __kb_destroy(b) do { \ |
| 73 |
int i, max = 8; \ |
| 74 |
kbnode_t *x, **top, **stack = 0; \ |
| 75 |
if (b) { \ |
| 76 |
top = stack = (kbnode_t**)calloc(max, sizeof(kbnode_t*)); \ |
| 77 |
*top++ = (b)->root; \ |
| 78 |
while (top != stack) { \ |
| 79 |
x = *--top; \ |
| 80 |
if (x == 0 || x->is_internal == 0) { free(x); continue; } \ |
| 81 |
for (i = 0; i <= x->n; ++i) \ |
| 82 |
if (__KB_PTR(b, x)[i]) { \ |
| 83 |
if (top - stack == max) { \ |
| 84 |
max <<= 1; \ |
| 85 |
stack = (kbnode_t**)realloc(stack, max * sizeof(kbnode_t*)); \ |
| 86 |
top = stack + (max>>1); \ |
| 87 |
} \ |
| 88 |
*top++ = __KB_PTR(b, x)[i]; \ |
| 89 |
} \ |
| 90 |
free(x); \ |
| 91 |
} \ |
| 92 |
} \ |
| 93 |
free(b); free(stack); \ |
| 94 |
} while (0) |
| 95 |
|
| 96 |
#define __kb_get_first(key_t, b, ret) do { \ |
| 97 |
kbnode_t *__x = (b)->root; \ |
| 98 |
while (__KB_PTR(b, __x)[0] != 0) \ |
| 99 |
__x = __KB_PTR(b, __x)[0]; \ |
| 100 |
(ret) = __KB_KEY(key_t, __x)[0]; \ |
| 101 |
} while (0) |
| 102 |
|
| 103 |
#define __KB_GET_AUX0(name, key_t, __cmp) \ |
| 104 |
static inline int __kb_get_aux_##name(const kbnode_t * __restrict x, const key_t * __restrict k, int *r) \ |
| 105 |
{ \ |
| 106 |
int tr, *rr, begin, end, n = x->n >> 1; \ |
| 107 |
if (x->n == 0) return -1; \ |
| 108 |
if (__cmp(*k, __KB_KEY(key_t, x)[n]) < 0) { \ |
| 109 |
begin = 0; end = n; \ |
| 110 |
} else { begin = n; end = x->n - 1; } \ |
| 111 |
rr = r? r : &tr; \ |
| 112 |
n = end; \ |
| 113 |
while (n >= begin && (*rr = __cmp(*k, __KB_KEY(key_t, x)[n])) < 0) --n; \ |
| 114 |
return n; \ |
| 115 |
} |
| 116 |
|
| 117 |
#define __KB_GET_AUX1(name, key_t, __cmp) \ |
| 118 |
static inline int __kb_getp_aux_##name(const kbnode_t * __restrict x, const key_t * __restrict k, int *r) \ |
| 119 |
{ \ |
| 120 |
int tr, *rr, begin = 0, end = x->n; \ |
| 121 |
if (x->n == 0) return -1; \ |
| 122 |
rr = r? r : &tr; \ |
| 123 |
while (begin < end) { \ |
| 124 |
int mid = (begin + end) >> 1; \ |
| 125 |
if (__cmp(__KB_KEY(key_t, x)[mid], *k) < 0) begin = mid + 1; \ |
| 126 |
else end = mid; \ |
| 127 |
} \ |
| 128 |
if (begin == x->n) { *rr = 1; return x->n - 1; } \ |
| 129 |
if ((*rr = __cmp(*k, __KB_KEY(key_t, x)[begin])) < 0) --begin; \ |
| 130 |
return begin; \ |
| 131 |
} |
| 132 |
|
| 133 |
#define __KB_GET(name, key_t) \ |
| 134 |
static key_t *kb_getp_##name(kbtree_##name##_t *b, const key_t * __restrict k) \ |
| 135 |
{ \ |
| 136 |
int i, r = 0; \ |
| 137 |
kbnode_t *x = b->root; \ |
| 138 |
while (x) { \ |
| 139 |
i = __kb_getp_aux_##name(x, k, &r); \ |
| 140 |
if (i >= 0 && r == 0) return &__KB_KEY(key_t, x)[i]; \ |
| 141 |
if (x->is_internal == 0) return 0; \ |
| 142 |
x = __KB_PTR(b, x)[i + 1]; \ |
| 143 |
} \ |
| 144 |
return 0; \ |
| 145 |
} \ |
| 146 |
static inline key_t *kb_get_##name(kbtree_##name##_t *b, const key_t k) \ |
| 147 |
{ \ |
| 148 |
return kb_getp_##name(b, &k); \ |
| 149 |
} |
| 150 |
|
| 151 |
#define __KB_INTERVAL(name, key_t) \ |
| 152 |
static void kb_intervalp_##name(kbtree_##name##_t *b, const key_t * __restrict k, key_t **lower, key_t **upper) \ |
| 153 |
{ \ |
| 154 |
int i, r = 0; \ |
| 155 |
kbnode_t *x = b->root; \ |
| 156 |
*lower = *upper = 0; \ |
| 157 |
while (x) { \ |
| 158 |
i = __kb_getp_aux_##name(x, k, &r); \ |
| 159 |
if (i >= 0 && r == 0) { \ |
| 160 |
*lower = *upper = &__KB_KEY(key_t, x)[i]; \ |
| 161 |
return; \ |
| 162 |
} \ |
| 163 |
if (i >= 0) *lower = &__KB_KEY(key_t, x)[i]; \ |
| 164 |
if (i < x->n - 1) *upper = &__KB_KEY(key_t, x)[i + 1]; \ |
| 165 |
if (x->is_internal == 0) return; \ |
| 166 |
x = __KB_PTR(b, x)[i + 1]; \ |
| 167 |
} \ |
| 168 |
} \ |
| 169 |
static inline void kb_interval_##name(kbtree_##name##_t *b, const key_t k, key_t **lower, key_t **upper) \ |
| 170 |
{ \ |
| 171 |
kb_intervalp_##name(b, &k, lower, upper); \ |
| 172 |
} |
| 173 |
|
| 174 |
#define __KB_PUT(name, key_t, __cmp) \ |
| 175 |
/* x must be an internal node */ \ |
| 176 |
static void __kb_split_##name(kbtree_##name##_t *b, kbnode_t *x, int i, kbnode_t *y) \ |
| 177 |
{ \ |
| 178 |
kbnode_t *z; \ |
| 179 |
z = (kbnode_t*)calloc(1, y->is_internal? b->ilen : b->elen); \ |
| 180 |
++b->n_nodes; \ |
| 181 |
z->is_internal = y->is_internal; \ |
| 182 |
z->n = b->t - 1; \ |
| 183 |
memcpy(__KB_KEY(key_t, z), __KB_KEY(key_t, y) + b->t, sizeof(key_t) * (b->t - 1)); \ |
| 184 |
if (y->is_internal) memcpy(__KB_PTR(b, z), __KB_PTR(b, y) + b->t, sizeof(void*) * b->t); \ |
| 185 |
y->n = b->t - 1; \ |
| 186 |
memmove(__KB_PTR(b, x) + i + 2, __KB_PTR(b, x) + i + 1, sizeof(void*) * (x->n - i)); \ |
| 187 |
__KB_PTR(b, x)[i + 1] = z; \ |
| 188 |
memmove(__KB_KEY(key_t, x) + i + 1, __KB_KEY(key_t, x) + i, sizeof(key_t) * (x->n - i)); \ |
| 189 |
__KB_KEY(key_t, x)[i] = __KB_KEY(key_t, y)[b->t - 1]; \ |
| 190 |
++x->n; \ |
| 191 |
} \ |
| 192 |
static void __kb_putp_aux_##name(kbtree_##name##_t *b, kbnode_t *x, const key_t * __restrict k) \ |
| 193 |
{ \ |
| 194 |
int i = x->n - 1; \ |
| 195 |
if (x->is_internal == 0) { \ |
| 196 |
i = __kb_getp_aux_##name(x, k, 0); \ |
| 197 |
if (i != x->n - 1) \ |
| 198 |
memmove(__KB_KEY(key_t, x) + i + 2, __KB_KEY(key_t, x) + i + 1, (x->n - i - 1) * sizeof(key_t)); \ |
| 199 |
__KB_KEY(key_t, x)[i + 1] = *k; \ |
| 200 |
++x->n; \ |
| 201 |
} else { \ |
| 202 |
i = __kb_getp_aux_##name(x, k, 0) + 1; \ |
| 203 |
if (__KB_PTR(b, x)[i]->n == 2 * b->t - 1) { \ |
| 204 |
__kb_split_##name(b, x, i, __KB_PTR(b, x)[i]); \ |
| 205 |
if (__cmp(*k, __KB_KEY(key_t, x)[i]) > 0) ++i; \ |
| 206 |
} \ |
| 207 |
__kb_putp_aux_##name(b, __KB_PTR(b, x)[i], k); \ |
| 208 |
} \ |
| 209 |
} \ |
| 210 |
static void kb_putp_##name(kbtree_##name##_t *b, const key_t * __restrict k) \ |
| 211 |
{ \ |
| 212 |
kbnode_t *r, *s; \ |
| 213 |
++b->n_keys; \ |
| 214 |
r = b->root; \ |
| 215 |
if (r->n == 2 * b->t - 1) { \ |
| 216 |
++b->n_nodes; \ |
| 217 |
s = (kbnode_t*)calloc(1, b->ilen); \ |
| 218 |
b->root = s; s->is_internal = 1; s->n = 0; \ |
| 219 |
__KB_PTR(b, s)[0] = r; \ |
| 220 |
__kb_split_##name(b, s, 0, r); \ |
| 221 |
r = s; \ |
| 222 |
} \ |
| 223 |
__kb_putp_aux_##name(b, r, k); \ |
| 224 |
} \ |
| 225 |
static inline void kb_put_##name(kbtree_##name##_t *b, const key_t k) \ |
| 226 |
{ \ |
| 227 |
kb_putp_##name(b, &k); \ |
| 228 |
} |
| 229 |
|
| 230 |
|
| 231 |
#define __KB_DEL(name, key_t) \ |
| 232 |
static key_t __kb_delp_aux_##name(kbtree_##name##_t *b, kbnode_t *x, const key_t * __restrict k, int s) \ |
| 233 |
{ \ |
| 234 |
int yn, zn, i, r = 0; \ |
| 235 |
kbnode_t *xp, *y, *z; \ |
| 236 |
key_t kp; \ |
| 237 |
if (x == 0) return *k; \ |
| 238 |
if (s) { /* s can only be 0, 1 or 2 */ \ |
| 239 |
r = x->is_internal == 0? 0 : s == 1? 1 : -1; \ |
| 240 |
i = s == 1? x->n - 1 : -1; \ |
| 241 |
} else i = __kb_getp_aux_##name(x, k, &r); \ |
| 242 |
if (x->is_internal == 0) { \ |
| 243 |
if (s == 2) ++i; \ |
| 244 |
kp = __KB_KEY(key_t, x)[i]; \ |
| 245 |
memmove(__KB_KEY(key_t, x) + i, __KB_KEY(key_t, x) + i + 1, (x->n - i - 1) * sizeof(key_t)); \ |
| 246 |
--x->n; \ |
| 247 |
return kp; \ |
| 248 |
} \ |
| 249 |
if (r == 0) { \ |
| 250 |
if ((yn = __KB_PTR(b, x)[i]->n) >= b->t) { \ |
| 251 |
xp = __KB_PTR(b, x)[i]; \ |
| 252 |
kp = __KB_KEY(key_t, x)[i]; \ |
| 253 |
__KB_KEY(key_t, x)[i] = __kb_delp_aux_##name(b, xp, 0, 1); \ |
| 254 |
return kp; \ |
| 255 |
} else if ((zn = __KB_PTR(b, x)[i + 1]->n) >= b->t) { \ |
| 256 |
xp = __KB_PTR(b, x)[i + 1]; \ |
| 257 |
kp = __KB_KEY(key_t, x)[i]; \ |
| 258 |
__KB_KEY(key_t, x)[i] = __kb_delp_aux_##name(b, xp, 0, 2); \ |
| 259 |
return kp; \ |
| 260 |
} else if (yn == b->t - 1 && zn == b->t - 1) { \ |
| 261 |
y = __KB_PTR(b, x)[i]; z = __KB_PTR(b, x)[i + 1]; \ |
| 262 |
__KB_KEY(key_t, y)[y->n++] = *k; \ |
| 263 |
memmove(__KB_KEY(key_t, y) + y->n, __KB_KEY(key_t, z), z->n * sizeof(key_t)); \ |
| 264 |
if (y->is_internal) memmove(__KB_PTR(b, y) + y->n, __KB_PTR(b, z), (z->n + 1) * sizeof(void*)); \ |
| 265 |
y->n += z->n; \ |
| 266 |
memmove(__KB_KEY(key_t, x) + i, __KB_KEY(key_t, x) + i + 1, (x->n - i - 1) * sizeof(key_t)); \ |
| 267 |
memmove(__KB_PTR(b, x) + i + 1, __KB_PTR(b, x) + i + 2, (x->n - i - 1) * sizeof(void*)); \ |
| 268 |
--x->n; \ |
| 269 |
free(z); \ |
| 270 |
return __kb_delp_aux_##name(b, y, k, s); \ |
| 271 |
} \ |
| 272 |
} \ |
| 273 |
++i; \ |
| 274 |
if ((xp = __KB_PTR(b, x)[i])->n == b->t - 1) { \ |
| 275 |
if (i > 0 && (y = __KB_PTR(b, x)[i - 1])->n >= b->t) { \ |
| 276 |
memmove(__KB_KEY(key_t, xp) + 1, __KB_KEY(key_t, xp), xp->n * sizeof(key_t)); \ |
| 277 |
if (xp->is_internal) memmove(__KB_PTR(b, xp) + 1, __KB_PTR(b, xp), (xp->n + 1) * sizeof(void*)); \ |
| 278 |
__KB_KEY(key_t, xp)[0] = __KB_KEY(key_t, x)[i - 1]; \ |
| 279 |
__KB_KEY(key_t, x)[i - 1] = __KB_KEY(key_t, y)[y->n - 1]; \ |
| 280 |
if (xp->is_internal) __KB_PTR(b, xp)[0] = __KB_PTR(b, y)[y->n]; \ |
| 281 |
--y->n; ++xp->n; \ |
| 282 |
} else if (i < x->n && (y = __KB_PTR(b, x)[i + 1])->n >= b->t) { \ |
| 283 |
__KB_KEY(key_t, xp)[xp->n++] = __KB_KEY(key_t, x)[i]; \ |
| 284 |
__KB_KEY(key_t, x)[i] = __KB_KEY(key_t, y)[0]; \ |
| 285 |
if (xp->is_internal) __KB_PTR(b, xp)[xp->n] = __KB_PTR(b, y)[0]; \ |
| 286 |
--y->n; \ |
| 287 |
memmove(__KB_KEY(key_t, y), __KB_KEY(key_t, y) + 1, y->n * sizeof(key_t)); \ |
| 288 |
if (y->is_internal) memmove(__KB_PTR(b, y), __KB_PTR(b, y) + 1, (y->n + 1) * sizeof(void*)); \ |
| 289 |
} else if (i > 0 && (y = __KB_PTR(b, x)[i - 1])->n == b->t - 1) { \ |
| 290 |
__KB_KEY(key_t, y)[y->n++] = __KB_KEY(key_t, x)[i - 1]; \ |
| 291 |
memmove(__KB_KEY(key_t, y) + y->n, __KB_KEY(key_t, xp), xp->n * sizeof(key_t)); \ |
| 292 |
if (y->is_internal) memmove(__KB_PTR(b, y) + y->n, __KB_PTR(b, xp), (xp->n + 1) * sizeof(void*)); \ |
| 293 |
y->n += xp->n; \ |
| 294 |
memmove(__KB_KEY(key_t, x) + i - 1, __KB_KEY(key_t, x) + i, (x->n - i) * sizeof(key_t)); \ |
| 295 |
memmove(__KB_PTR(b, x) + i, __KB_PTR(b, x) + i + 1, (x->n - i) * sizeof(void*)); \ |
| 296 |
--x->n; \ |
| 297 |
free(xp); \ |
| 298 |
xp = y; \ |
| 299 |
} else if (i < x->n && (y = __KB_PTR(b, x)[i + 1])->n == b->t - 1) { \ |
| 300 |
__KB_KEY(key_t, xp)[xp->n++] = __KB_KEY(key_t, x)[i]; \ |
| 301 |
memmove(__KB_KEY(key_t, xp) + xp->n, __KB_KEY(key_t, y), y->n * sizeof(key_t)); \ |
| 302 |
if (xp->is_internal) memmove(__KB_PTR(b, xp) + xp->n, __KB_PTR(b, y), (y->n + 1) * sizeof(void*)); \ |
| 303 |
xp->n += y->n; \ |
| 304 |
memmove(__KB_KEY(key_t, x) + i, __KB_KEY(key_t, x) + i + 1, (x->n - i - 1) * sizeof(key_t)); \ |
| 305 |
memmove(__KB_PTR(b, x) + i + 1, __KB_PTR(b, x) + i + 2, (x->n - i - 1) * sizeof(void*)); \ |
| 306 |
--x->n; \ |
| 307 |
free(y); \ |
| 308 |
} \ |
| 309 |
} \ |
| 310 |
return __kb_delp_aux_##name(b, xp, k, s); \ |
| 311 |
} \ |
| 312 |
static key_t kb_delp_##name(kbtree_##name##_t *b, const key_t * __restrict k) \ |
| 313 |
{ \ |
| 314 |
kbnode_t *x; \ |
| 315 |
key_t ret; \ |
| 316 |
ret = __kb_delp_aux_##name(b, b->root, k, 0); \ |
| 317 |
--b->n_keys; \ |
| 318 |
if (b->root->n == 0 && b->root->is_internal) { \ |
| 319 |
--b->n_nodes; \ |
| 320 |
x = b->root; \ |
| 321 |
b->root = __KB_PTR(b, x)[0]; \ |
| 322 |
free(x); \ |
| 323 |
} \ |
| 324 |
return ret; \ |
| 325 |
} \ |
| 326 |
static inline key_t kb_del_##name(kbtree_##name##_t *b, const key_t k) \ |
| 327 |
{ \ |
| 328 |
return kb_delp_##name(b, &k); \ |
| 329 |
} |
| 330 |
|
| 331 |
typedef struct { |
| 332 |
kbnode_t *x; |
| 333 |
int i; |
| 334 |
} __kbstack_t; |
| 335 |
|
| 336 |
#define __kb_traverse(key_t, b, __func) do { \ |
| 337 |
int __kmax = 8; \ |
| 338 |
__kbstack_t *__kstack, *__kp; \ |
| 339 |
__kp = __kstack = (__kbstack_t*)calloc(__kmax, sizeof(__kbstack_t)); \ |
| 340 |
__kp->x = (b)->root; __kp->i = 0; \ |
| 341 |
for (;;) { \ |
| 342 |
while (__kp->x && __kp->i <= __kp->x->n) { \ |
| 343 |
if (__kp - __kstack == __kmax - 1) { \ |
| 344 |
__kmax <<= 1; \ |
| 345 |
__kstack = (__kbstack_t*)realloc(__kstack, __kmax * sizeof(__kbstack_t)); \ |
| 346 |
__kp = __kstack + (__kmax>>1) - 1; \ |
| 347 |
} \ |
| 348 |
(__kp+1)->i = 0; (__kp+1)->x = __kp->x->is_internal? __KB_PTR(b, __kp->x)[__kp->i] : 0; \ |
| 349 |
++__kp; \ |
| 350 |
} \ |
| 351 |
--__kp; \ |
| 352 |
if (__kp >= __kstack) { \ |
| 353 |
if (__kp->x && __kp->i < __kp->x->n) __func(&__KB_KEY(key_t, __kp->x)[__kp->i]); \ |
| 354 |
++__kp->i; \ |
| 355 |
} else break; \ |
| 356 |
} \ |
| 357 |
free(__kstack); \ |
| 358 |
} while (0) |
| 359 |
|
| 360 |
#define KBTREE_INIT(name, key_t, __cmp) \ |
| 361 |
__KB_TREE_T(name) \ |
| 362 |
__KB_INIT(name, key_t) \ |
| 363 |
__KB_GET_AUX1(name, key_t, __cmp) \ |
| 364 |
__KB_GET(name, key_t) \ |
| 365 |
__KB_INTERVAL(name, key_t) \ |
| 366 |
__KB_PUT(name, key_t, __cmp) \ |
| 367 |
__KB_DEL(name, key_t) |
| 368 |
|
| 369 |
#define KB_DEFAULT_SIZE 512 |
| 370 |
|
| 371 |
#define kbtree_t(name) kbtree_##name##_t |
| 372 |
#define kb_init(name, s) kb_init_##name(s) |
| 373 |
#define kb_destroy(name, b) __kb_destroy(b) |
| 374 |
#define kb_get(name, b, k) kb_get_##name(b, k) |
| 375 |
#define kb_put(name, b, k) kb_put_##name(b, k) |
| 376 |
#define kb_del(name, b, k) kb_del_##name(b, k) |
| 377 |
#define kb_interval(name, b, k, l, u) kb_interval_##name(b, k, l, u) |
| 378 |
#define kb_getp(name, b, k) kb_getp_##name(b, k) |
| 379 |
#define kb_putp(name, b, k) kb_putp_##name(b, k) |
| 380 |
#define kb_delp(name, b, k) kb_delp_##name(b, k) |
| 381 |
#define kb_intervalp(name, b, k, l, u) kb_intervalp_##name(b, k, l, u) |
| 382 |
|
| 383 |
#define kb_size(b) ((b)->n_keys) |
| 384 |
|
| 385 |
#define kb_generic_cmp(a, b) (((b) < (a)) - ((a) < (b))) |
| 386 |
#define kb_str_cmp(a, b) strcmp(a, b) |
| 387 |
|
| 388 |
#endif |