PageRenderTime 22ms CodeModel.GetById 27ms RepoModel.GetById 0ms app.codeStats 1ms

/deps/klib/kbtree.h

https://gitlab.com/Blueprint-Marketing/h2o
C Header | 384 lines | 335 code | 23 blank | 26 comment | 109 complexity | ca0f36c0eb7454e47844e97df1dac1d8 MD5 | raw file
    

  1. /*-
    2. 

  2.  * Copyright 1997-1999, 2001, John-Mark Gurney.
    3. 

  3.  *           2008-2009, Attractive Chaos <attractor@live.co.uk>
    4. 

  4.  *
    5. 

  5.  * Redistribution and use in source and binary forms, with or without
    6. 

  6.  * modification, are permitted provided that the following conditions
    7. 

  7.  * are met:
    8. 

  8.  *
    9. 

  9.  * 1. Redistributions of source code must retain the above copyright
    10. 

  10.  *    notice, this list of conditions and the following disclaimer.
    11. 

  11.  * 2. Redistributions in binary form must reproduce the above copyright
    12. 

  12.  *    notice, this list of conditions and the following disclaimer in the
    13. 

  13.  *    documentation and/or other materials provided with the distribution.
    14. 

  14.  *
    15. 

  15.  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
    16. 

  16.  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    17. 

  17.  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    18. 

  18.  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
    19. 

  19.  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
    20. 

  20.  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
    21. 

  21.  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
    22. 

  22.  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
    23. 

  23.  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
    24. 

  24.  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
    25. 

  25.  * SUCH DAMAGE.
    26. 

  26.  */
    27. 

  27. 

  28. #ifndef __AC_KBTREE_H
    29. 

  29. #define __AC_KBTREE_H
    30. 

  30. 

  31. #include <stdlib.h>
    32. 

  32. #include <string.h>
    33. 

  33. #include <stdint.h>
    34. 

  34. 

  35. typedef struct {
    36. 

  36. 	int32_t is_internal:1, n:31;
    37. 

  37. } kbnode_t;
    38. 

  38. 

  39. #define	__KB_KEY(type, x)	((type*)((char*)x + 4))
    40. 

  40. #define __KB_PTR(btr, x)	((kbnode_t**)((char*)x + btr->off_ptr))
    41. 

  41. 

  42. #define __KB_TREE_T(name)						\
    43. 

  43. 	typedef struct {							\
    44. 

  44. 		kbnode_t *root;							\
    45. 

  45. 		int	off_key, off_ptr, ilen, elen;		\
    46. 

  46. 		int	n, t;								\
    47. 

  47. 		int	n_keys, n_nodes;					\
    48. 

  48. 	} kbtree_##name##_t;
    49. 

  49. 

  50. #define __KB_INIT(name, key_t)											\
    51. 

  51. 	kbtree_##name##_t *kb_init_##name(int size)							\
    52. 

  52. 	{																	\
    53. 

  53. 		kbtree_##name##_t *b;											\
    54. 

  54. 		b = (kbtree_##name##_t*)calloc(1, sizeof(kbtree_##name##_t));	\
    55. 

  55. 		b->t = ((size - 4 - sizeof(void*)) / (sizeof(void*) + sizeof(key_t)) + 1) >> 1; \
    56. 

  56. 		if (b->t < 2) {													\
    57. 

  57. 			free(b); return 0;											\
    58. 

  58. 		}																\
    59. 

  59. 		b->n = 2 * b->t - 1;											\
    60. 

  60. 		b->off_ptr = 4 + b->n * sizeof(key_t);							\
    61. 

  61. 		b->ilen = (4 + sizeof(void*) + b->n * (sizeof(void*) + sizeof(key_t)) + 3) >> 2 << 2; \
    62. 

  62. 		b->elen = (b->off_ptr + 3) >> 2 << 2;							\
    63. 

  63. 		b->root = (kbnode_t*)calloc(1, b->ilen);						\
    64. 

  64. 		++b->n_nodes;													\
    65. 

  65. 		return b;														\
    66. 

  66. 	}
    67. 

  67. 

  68. #define __kb_destroy(b) do {											\
    69. 

  69. 		int i, max = 8;													\
    70. 

  70. 		kbnode_t *x, **top, **stack = 0;								\
    71. 

  71. 		if (b) {														\
    72. 

  72. 			top = stack = (kbnode_t**)calloc(max, sizeof(kbnode_t*));	\
    73. 

  73. 			*top++ = (b)->root;											\
    74. 

  74. 			while (top != stack) {										\
    75. 

  75. 				x = *--top;												\
    76. 

  76. 				if (x->is_internal == 0) { free(x); continue; }			\
    77. 

  77. 				for (i = 0; i <= x->n; ++i)								\
    78. 

  78. 					if (__KB_PTR(b, x)[i]) {							\
    79. 

  79. 						if (top - stack == max) {						\
    80. 

  80. 							max <<= 1;									\
    81. 

  81. 							stack = (kbnode_t**)realloc(stack, max * sizeof(kbnode_t*)); \
    82. 

  82. 							top = stack + (max>>1);						\
    83. 

  83. 						}												\
    84. 

  84. 						*top++ = __KB_PTR(b, x)[i];						\
    85. 

  85. 					}													\
    86. 

  86. 				free(x);												\
    87. 

  87. 			}															\
    88. 

  88. 		}																\
    89. 

  89. 		free(b); free(stack);											\
    90. 

  90. 	} while (0)
    91. 

  91. 

  92. #define __kb_get_first(key_t, b, ret) do {	\
    93. 

  93. 		kbnode_t *__x = (b)->root;			\
    94. 

  94. 		while (__KB_PTR(b, __x)[0] != 0)	\
    95. 

  95. 			__x = __KB_PTR(b, __x)[0];		\
    96. 

  96. 		(ret) = __KB_KEY(key_t, __x)[0];	\
    97. 

  97. 	} while (0)
    98. 

  98. 

  99. #define __KB_GET_AUX0(name, key_t, __cmp)								\
    100. 

  100. 	static inline int __kb_get_aux_##name(const kbnode_t * __restrict x, const key_t * __restrict k, int *r) \
    101. 

  101. 	{																	\
    102. 

  102. 		int tr, *rr, begin, end, n = x->n >> 1;							\
    103. 

  103. 		if (x->n == 0) return -1;										\
    104. 

  104. 		if (__cmp(*k, __KB_KEY(key_t, x)[n]) < 0) {						\
    105. 

  105. 			begin = 0; end = n;											\
    106. 

  106. 		} else { begin = n; end = x->n - 1; }							\
    107. 

  107. 		rr = r? r : &tr;												\
    108. 

  108. 		n = end;														\
    109. 

  109. 		while (n >= begin && (*rr = __cmp(*k, __KB_KEY(key_t, x)[n])) < 0) --n; \
    110. 

  110. 		return n;														\
    111. 

  111. 	}
    112. 

  112. 

  113. #define __KB_GET_AUX1(name, key_t, __cmp)								\
    114. 

  114. 	static inline int __kb_getp_aux_##name(const kbnode_t * __restrict x, const key_t * __restrict k, int *r) \
    115. 

  115. 	{																	\
    116. 

  116. 		int tr, *rr, begin = 0, end = x->n;								\
    117. 

  117. 		if (x->n == 0) return -1;										\
    118. 

  118. 		rr = r? r : &tr;												\
    119. 

  119. 		while (begin < end) {											\
    120. 

  120. 			int mid = (begin + end) >> 1;								\
    121. 

  121. 			if (__cmp(__KB_KEY(key_t, x)[mid], *k) < 0) begin = mid + 1; \
    122. 

  122. 			else end = mid;												\
    123. 

  123. 		}																\
    124. 

  124. 		if (begin == x->n) { *rr = 1; return x->n - 1; }				\
    125. 

  125. 		if ((*rr = __cmp(*k, __KB_KEY(key_t, x)[begin])) < 0) --begin;	\
    126. 

  126. 		return begin;													\
    127. 

  127. 	}
    128. 

  128. 

  129. #define __KB_GET(name, key_t)											\
    130. 

  130. 	static key_t *kb_getp_##name(kbtree_##name##_t *b, const key_t * __restrict k) \
    131. 

  131. 	{																	\
    132. 

  132. 		int i, r = 0;													\
    133. 

  133. 		kbnode_t *x = b->root;											\
    134. 

  134. 		while (x) {														\
    135. 

  135. 			i = __kb_getp_aux_##name(x, k, &r);							\
    136. 

  136. 			if (i >= 0 && r == 0) return &__KB_KEY(key_t, x)[i];		\
    137. 

  137. 			if (x->is_internal == 0) return 0;							\
    138. 

  138. 			x = __KB_PTR(b, x)[i + 1];									\
    139. 

  139. 		}																\
    140. 

  140. 		return 0;														\
    141. 

  141. 	}																	\
    142. 

  142. 	static inline key_t *kb_get_##name(kbtree_##name##_t *b, const key_t k) \
    143. 

  143. 	{																	\
    144. 

  144. 		return kb_getp_##name(b, &k);									\
    145. 

  145. 	}
    146. 

  146. 

  147. #define __KB_INTERVAL(name, key_t)										\
    148. 

  148. 	static void kb_intervalp_##name(kbtree_##name##_t *b, const key_t * __restrict k, key_t **lower, key_t **upper)	\
    149. 

  149. 	{																	\
    150. 

  150. 		int i, r = 0;													\
    151. 

  151. 		kbnode_t *x = b->root;											\
    152. 

  152. 		*lower = *upper = 0;											\
    153. 

  153. 		while (x) {														\
    154. 

  154. 			i = __kb_getp_aux_##name(x, k, &r);							\
    155. 

  155. 			if (i >= 0 && r == 0) {										\
    156. 

  156. 				*lower = *upper = &__KB_KEY(key_t, x)[i];				\
    157. 

  157. 				return;													\
    158. 

  158. 			}															\
    159. 

  159. 			if (i >= 0) *lower = &__KB_KEY(key_t, x)[i];				\
    160. 

  160. 			if (i < x->n - 1) *upper = &__KB_KEY(key_t, x)[i + 1];		\
    161. 

  161. 			if (x->is_internal == 0) return;							\
    162. 

  162. 			x = __KB_PTR(b, x)[i + 1];									\
    163. 

  163. 		}																\
    164. 

  164. 	}																	\
    165. 

  165. 	static inline void kb_interval_##name(kbtree_##name##_t *b, const key_t k, key_t **lower, key_t **upper) \
    166. 

  166. 	{																	\
    167. 

  167. 		kb_intervalp_##name(b, &k, lower, upper);						\
    168. 

  168. 	}
    169. 

  169. 

  170. #define __KB_PUT(name, key_t, __cmp)									\
    171. 

  171. 	/* x must be an internal node */									\
    172. 

  172. 	static void __kb_split_##name(kbtree_##name##_t *b, kbnode_t *x, int i, kbnode_t *y) \
    173. 

  173. 	{																	\
    174. 

  174. 		kbnode_t *z;													\
    175. 

  175. 		z = (kbnode_t*)calloc(1, y->is_internal? b->ilen : b->elen);	\
    176. 

  176. 		++b->n_nodes;													\
    177. 

  177. 		z->is_internal = y->is_internal;								\
    178. 

  178. 		z->n = b->t - 1;												\
    179. 

  179. 		memcpy(__KB_KEY(key_t, z), __KB_KEY(key_t, y) + b->t, sizeof(key_t) * (b->t - 1)); \
    180. 

  180. 		if (y->is_internal) memcpy(__KB_PTR(b, z), __KB_PTR(b, y) + b->t, sizeof(void*) * b->t); \
    181. 

  181. 		y->n = b->t - 1;												\
    182. 

  182. 		memmove(__KB_PTR(b, x) + i + 2, __KB_PTR(b, x) + i + 1, sizeof(void*) * (x->n - i)); \
    183. 

  183. 		__KB_PTR(b, x)[i + 1] = z;										\
    184. 

  184. 		memmove(__KB_KEY(key_t, x) + i + 1, __KB_KEY(key_t, x) + i, sizeof(key_t) * (x->n - i)); \
    185. 

  185. 		__KB_KEY(key_t, x)[i] = __KB_KEY(key_t, y)[b->t - 1];			\
    186. 

  186. 		++x->n;															\
    187. 

  187. 	}																	\
    188. 

  188. 	static void __kb_putp_aux_##name(kbtree_##name##_t *b, kbnode_t *x, const key_t * __restrict k) \
    189. 

  189. 	{																	\
    190. 

  190. 		int i = x->n - 1;												\
    191. 

  191. 		if (x->is_internal == 0) {										\
    192. 

  192. 			i = __kb_getp_aux_##name(x, k, 0);							\
    193. 

  193. 			if (i != x->n - 1)											\
    194. 

  194. 				memmove(__KB_KEY(key_t, x) + i + 2, __KB_KEY(key_t, x) + i + 1, (x->n - i - 1) * sizeof(key_t)); \
    195. 

  195. 			__KB_KEY(key_t, x)[i + 1] = *k;								\
    196. 

  196. 			++x->n;														\
    197. 

  197. 		} else {														\
    198. 

  198. 			i = __kb_getp_aux_##name(x, k, 0) + 1;						\
    199. 

  199. 			if (__KB_PTR(b, x)[i]->n == 2 * b->t - 1) {					\
    200. 

  200. 				__kb_split_##name(b, x, i, __KB_PTR(b, x)[i]);			\
    201. 

  201. 				if (__cmp(*k, __KB_KEY(key_t, x)[i]) > 0) ++i;			\
    202. 

  202. 			}															\
    203. 

  203. 			__kb_putp_aux_##name(b, __KB_PTR(b, x)[i], k);				\
    204. 

  204. 		}																\
    205. 

  205. 	}																	\
    206. 

  206. 	static void kb_putp_##name(kbtree_##name##_t *b, const key_t * __restrict k) \
    207. 

  207. 	{																	\
    208. 

  208. 		kbnode_t *r, *s;												\
    209. 

  209. 		++b->n_keys;													\
    210. 

  210. 		r = b->root;													\
    211. 

  211. 		if (r->n == 2 * b->t - 1) {										\
    212. 

  212. 			++b->n_nodes;												\
    213. 

  213. 			s = (kbnode_t*)calloc(1, b->ilen);							\
    214. 

  214. 			b->root = s; s->is_internal = 1; s->n = 0;					\
    215. 

  215. 			__KB_PTR(b, s)[0] = r;										\
    216. 

  216. 			__kb_split_##name(b, s, 0, r);								\
    217. 

  217. 			r = s;														\
    218. 

  218. 		}																\
    219. 

  219. 		__kb_putp_aux_##name(b, r, k);									\
    220. 

  220. 	}																	\
    221. 

  221. 	static inline void kb_put_##name(kbtree_##name##_t *b, const key_t k) \
    222. 

  222. 	{																	\
    223. 

  223. 		kb_putp_##name(b, &k);											\
    224. 

  224. 	}
    225. 

  225. 

  226. 

  227. #define __KB_DEL(name, key_t)											\
    228. 

  228. 	static key_t __kb_delp_aux_##name(kbtree_##name##_t *b, kbnode_t *x, const key_t * __restrict k, int s) \
    229. 

  229. 	{																	\
    230. 

  230. 		int yn, zn, i, r = 0;											\
    231. 

  231. 		kbnode_t *xp, *y, *z;											\
    232. 

  232. 		key_t kp;														\
    233. 

  233. 		if (x == 0) return *k;											\
    234. 

  234. 		if (s) { /* s can only be 0, 1 or 2 */							\
    235. 

  235. 			r = x->is_internal == 0? 0 : s == 1? 1 : -1;				\
    236. 

  236. 			i = s == 1? x->n - 1 : -1;									\
    237. 

  237. 		} else i = __kb_getp_aux_##name(x, k, &r);						\
    238. 

  238. 		if (x->is_internal == 0) {										\
    239. 

  239. 			if (s == 2) ++i;											\
    240. 

  240. 			kp = __KB_KEY(key_t, x)[i];									\
    241. 

  241. 			memmove(__KB_KEY(key_t, x) + i, __KB_KEY(key_t, x) + i + 1, (x->n - i - 1) * sizeof(key_t)); \
    242. 

  242. 			--x->n;														\
    243. 

  243. 			return kp;													\
    244. 

  244. 		}																\
    245. 

  245. 		if (r == 0) {													\
    246. 

  246. 			if ((yn = __KB_PTR(b, x)[i]->n) >= b->t) {					\
    247. 

  247. 				xp = __KB_PTR(b, x)[i];									\
    248. 

  248. 				kp = __KB_KEY(key_t, x)[i];								\
    249. 

  249. 				__KB_KEY(key_t, x)[i] = __kb_delp_aux_##name(b, xp, 0, 1); \
    250. 

  250. 				return kp;												\
    251. 

  251. 			} else if ((zn = __KB_PTR(b, x)[i + 1]->n) >= b->t) {		\
    252. 

  252. 				xp = __KB_PTR(b, x)[i + 1];								\
    253. 

  253. 				kp = __KB_KEY(key_t, x)[i];								\
    254. 

  254. 				__KB_KEY(key_t, x)[i] = __kb_delp_aux_##name(b, xp, 0, 2); \
    255. 

  255. 				return kp;												\
    256. 

  256. 			} else if (yn == b->t - 1 && zn == b->t - 1) {				\
    257. 

  257. 				y = __KB_PTR(b, x)[i]; z = __KB_PTR(b, x)[i + 1];		\
    258. 

  258. 				__KB_KEY(key_t, y)[y->n++] = *k;						\
    259. 

  259. 				memmove(__KB_KEY(key_t, y) + y->n, __KB_KEY(key_t, z), z->n * sizeof(key_t)); \
    260. 

  260. 				if (y->is_internal) memmove(__KB_PTR(b, y) + y->n, __KB_PTR(b, z), (z->n + 1) * sizeof(void*)); \
    261. 

  261. 				y->n += z->n;											\
    262. 

  262. 				memmove(__KB_KEY(key_t, x) + i, __KB_KEY(key_t, x) + i + 1, (x->n - i - 1) * sizeof(key_t)); \
    263. 

  263. 				memmove(__KB_PTR(b, x) + i + 1, __KB_PTR(b, x) + i + 2, (x->n - i - 1) * sizeof(void*)); \
    264. 

  264. 				--x->n;													\
    265. 

  265. 				free(z);												\
    266. 

  266. 				return __kb_delp_aux_##name(b, y, k, s);				\
    267. 

  267. 			}															\
    268. 

  268. 		}																\
    269. 

  269. 		++i;															\
    270. 

  270. 		if ((xp = __KB_PTR(b, x)[i])->n == b->t - 1) {					\
    271. 

  271. 			if (i > 0 && (y = __KB_PTR(b, x)[i - 1])->n >= b->t) {		\
    272. 

  272. 				memmove(__KB_KEY(key_t, xp) + 1, __KB_KEY(key_t, xp), xp->n * sizeof(key_t)); \
    273. 

  273. 				if (xp->is_internal) memmove(__KB_PTR(b, xp) + 1, __KB_PTR(b, xp), (xp->n + 1) * sizeof(void*)); \
    274. 

  274. 				__KB_KEY(key_t, xp)[0] = __KB_KEY(key_t, x)[i - 1];		\
    275. 

  275. 				__KB_KEY(key_t, x)[i - 1] = __KB_KEY(key_t, y)[y->n - 1]; \
    276. 

  276. 				if (xp->is_internal) __KB_PTR(b, xp)[0] = __KB_PTR(b, y)[y->n]; \
    277. 

  277. 				--y->n; ++xp->n;										\
    278. 

  278. 			} else if (i < x->n && (y = __KB_PTR(b, x)[i + 1])->n >= b->t) { \
    279. 

  279. 				__KB_KEY(key_t, xp)[xp->n++] = __KB_KEY(key_t, x)[i];	\
    280. 

  280. 				__KB_KEY(key_t, x)[i] = __KB_KEY(key_t, y)[0];			\
    281. 

  281. 				if (xp->is_internal) __KB_PTR(b, xp)[xp->n] = __KB_PTR(b, y)[0]; \
    282. 

  282. 				--y->n;													\
    283. 

  283. 				memmove(__KB_KEY(key_t, y), __KB_KEY(key_t, y) + 1, y->n * sizeof(key_t)); \
    284. 

  284. 				if (y->is_internal) memmove(__KB_PTR(b, y), __KB_PTR(b, y) + 1, (y->n + 1) * sizeof(void*)); \
    285. 

  285. 			} else if (i > 0 && (y = __KB_PTR(b, x)[i - 1])->n == b->t - 1) { \
    286. 

  286. 				__KB_KEY(key_t, y)[y->n++] = __KB_KEY(key_t, x)[i - 1];	\
    287. 

  287. 				memmove(__KB_KEY(key_t, y) + y->n, __KB_KEY(key_t, xp), xp->n * sizeof(key_t));	\
    288. 

  288. 				if (y->is_internal) memmove(__KB_PTR(b, y) + y->n, __KB_PTR(b, xp), (xp->n + 1) * sizeof(void*)); \
    289. 

  289. 				y->n += xp->n;											\
    290. 

  290. 				memmove(__KB_KEY(key_t, x) + i - 1, __KB_KEY(key_t, x) + i, (x->n - i) * sizeof(key_t)); \
    291. 

  291. 				memmove(__KB_PTR(b, x) + i, __KB_PTR(b, x) + i + 1, (x->n - i) * sizeof(void*)); \
    292. 

  292. 				--x->n;													\
    293. 

  293. 				free(xp);												\
    294. 

  294. 				xp = y;													\
    295. 

  295. 			} else if (i < x->n && (y = __KB_PTR(b, x)[i + 1])->n == b->t - 1) { \
    296. 

  296. 				__KB_KEY(key_t, xp)[xp->n++] = __KB_KEY(key_t, x)[i];	\
    297. 

  297. 				memmove(__KB_KEY(key_t, xp) + xp->n, __KB_KEY(key_t, y), y->n * sizeof(key_t));	\
    298. 

  298. 				if (xp->is_internal) memmove(__KB_PTR(b, xp) + xp->n, __KB_PTR(b, y), (y->n + 1) * sizeof(void*)); \
    299. 

  299. 				xp->n += y->n;											\
    300. 

  300. 				memmove(__KB_KEY(key_t, x) + i, __KB_KEY(key_t, x) + i + 1, (x->n - i - 1) * sizeof(key_t)); \
    301. 

  301. 				memmove(__KB_PTR(b, x) + i + 1, __KB_PTR(b, x) + i + 2, (x->n - i - 1) * sizeof(void*)); \
    302. 

  302. 				--x->n;													\
    303. 

  303. 				free(y);												\
    304. 

  304. 			}															\
    305. 

  305. 		}																\
    306. 

  306. 		return __kb_delp_aux_##name(b, xp, k, s);						\
    307. 

  307. 	}																	\
    308. 

  308. 	static key_t kb_delp_##name(kbtree_##name##_t *b, const key_t * __restrict k) \
    309. 

  309. 	{																	\
    310. 

  310. 		kbnode_t *x;													\
    311. 

  311. 		key_t ret;														\
    312. 

  312. 		ret = __kb_delp_aux_##name(b, b->root, k, 0);					\
    313. 

  313. 		--b->n_keys;													\
    314. 

  314. 		if (b->root->n == 0 && b->root->is_internal) {					\
    315. 

  315. 			--b->n_nodes;												\
    316. 

  316. 			x = b->root;												\
    317. 

  317. 			b->root = __KB_PTR(b, x)[0];								\
    318. 

  318. 			free(x);													\
    319. 

  319. 		}																\
    320. 

  320. 		return ret;														\
    321. 

  321. 	}																	\
    322. 

  322. 	static inline key_t kb_del_##name(kbtree_##name##_t *b, const key_t k) \
    323. 

  323. 	{																	\
    324. 

  324. 		return kb_delp_##name(b, &k);									\
    325. 

  325. 	}
    326. 

  326. 

  327. typedef struct {
    328. 

  328. 	kbnode_t *x;
    329. 

  329. 	int i;
    330. 

  330. } __kbstack_t;
    331. 

  331. 

  332. #define __kb_traverse(key_t, b, __func) do {							\
    333. 

  333. 		int __kmax = 8;													\
    334. 

  334. 		__kbstack_t *__kstack, *__kp;									\
    335. 

  335. 		__kp = __kstack = (__kbstack_t*)calloc(__kmax, sizeof(__kbstack_t)); \
    336. 

  336. 		__kp->x = (b)->root; __kp->i = 0;								\
    337. 

  337. 		for (;;) {														\
    338. 

  338. 			while (__kp->x && __kp->i <= __kp->x->n) {					\
    339. 

  339. 				if (__kp - __kstack == __kmax - 1) {					\
    340. 

  340. 					__kmax <<= 1;										\
    341. 

  341. 					__kstack = (__kbstack_t*)realloc(__kstack, __kmax * sizeof(__kbstack_t)); \
    342. 

  342. 					__kp = __kstack + (__kmax>>1) - 1;					\
    343. 

  343. 				}														\
    344. 

  344. 				(__kp+1)->i = 0; (__kp+1)->x = __kp->x->is_internal? __KB_PTR(b, __kp->x)[__kp->i] : 0; \
    345. 

  345. 				++__kp;													\
    346. 

  346. 			}															\
    347. 

  347. 			--__kp;														\
    348. 

  348. 			if (__kp >= __kstack) {										\
    349. 

  349. 				if (__kp->x && __kp->i < __kp->x->n) __func(&__KB_KEY(key_t, __kp->x)[__kp->i]); \
    350. 

  350. 				++__kp->i;												\
    351. 

  351. 			} else break;												\
    352. 

  352. 		}																\
    353. 

  353. 		free(__kstack);													\
    354. 

  354. 	} while (0)
    355. 

  355. 

  356. #define KBTREE_INIT(name, key_t, __cmp)			\
    357. 

  357. 	__KB_TREE_T(name)							\
    358. 

  358. 	__KB_INIT(name, key_t)						\
    359. 

  359. 	__KB_GET_AUX1(name, key_t, __cmp)			\
    360. 

  360. 	__KB_GET(name, key_t)						\
    361. 

  361. 	__KB_INTERVAL(name, key_t)					\
    362. 

  362. 	__KB_PUT(name, key_t, __cmp)				\
    363. 

  363. 	__KB_DEL(name, key_t)
    364. 

  364. 

  365. #define KB_DEFAULT_SIZE 512
    366. 

  366. 

  367. #define kbtree_t(name) kbtree_##name##_t
    368. 

  368. #define kb_init(name, s) kb_init_##name(s)
    369. 

  369. #define kb_destroy(name, b) __kb_destroy(b)
    370. 

  370. #define kb_get(name, b, k) kb_get_##name(b, k)
    371. 

  371. #define kb_put(name, b, k) kb_put_##name(b, k)
    372. 

  372. #define kb_del(name, b, k) kb_del_##name(b, k)
    373. 

  373. #define kb_interval(name, b, k, l, u) kb_interval_##name(b, k, l, u)
    374. 

  374. #define kb_getp(name, b, k) kb_getp_##name(b, k)
    375. 

  375. #define kb_putp(name, b, k) kb_putp_##name(b, k)
    376. 

  376. #define kb_delp(name, b, k) kb_delp_##name(b, k)
    377. 

  377. #define kb_intervalp(name, b, k, l, u) kb_intervalp_##name(b, k, l, u)
    378. 

  378. 

  379. #define kb_size(b) ((b)->n_keys)
    380. 

  380. 

  381. #define kb_generic_cmp(a, b) (((b) < (a)) - ((a) < (b)))
    382. 

  382. #define kb_str_cmp(a, b) strcmp(a, b)
    383. 

  383. 

  384. #endif
    385. 

  385.