Go to the documentation of this file.
59 typedef unsigned long hash_value_t;
62 #define HTABLE_MIN_SIZE 31
74 #define HTABLE_DECLARE(prefix, pr, entry_t) \
75 HTABLE_DECLARE_WITH(prefix, pr, entry_t, unsigned, hash_value_t)
77 #define HTABLE_DECLARE_WITH(prefix, pr, entry_t, size_t, hash_value_t) \
78 typedef struct prefix##_s { \
81 entry_t**pr##_table; \
86 #define HTABLE_SCOPE su_inline
99 #define HTABLE_PROTOS(prefix, pr, entry_t) \
100 HTABLE_PROTOS_WITH(prefix, pr, entry_t, unsigned, hash_value_t)
102 #define HTABLE_PROTOS_WITH(prefix, pr, entry_t, size_t, hash_value_t) \
103 HTABLE_SCOPE int prefix##_resize(su_home_t *, prefix##_t pr[1], size_t); \
104 HTABLE_SCOPE int prefix##_is_full(prefix##_t const *); \
105 HTABLE_SCOPE entry_t **prefix##_hash(prefix##_t const *, hash_value_t hv); \
106 HTABLE_SCOPE entry_t **prefix##_next(prefix##_t const *, entry_t * const *ee); \
107 HTABLE_SCOPE void prefix##_append(prefix##_t *pr, entry_t const *e); \
108 HTABLE_SCOPE void prefix##_insert(prefix##_t *pr, entry_t const *e); \
109 HTABLE_SCOPE int prefix##_remove(prefix##_t *, entry_t const *e)
123 #define HTABLE_BODIES(prefix, pr, entry_t, hfun) \
124 HTABLE_BODIES_WITH(prefix, pr, entry_t, hfun, unsigned, hash_value_t)
126 #define HTABLE_BODIES_WITH(prefix, pr, entry_t, hfun, size_t, hash_value_t) \
129 int prefix##_resize(su_home_t *home, \
133 entry_t **new_hash; \
134 entry_t **old_hash = pr->pr##_table; \
137 unsigned again = 0; \
141 new_size = 2 * pr->pr##_size + 1; \
142 if (new_size < HTABLE_MIN_SIZE) \
143 new_size = HTABLE_MIN_SIZE; \
144 if (new_size < 5 * pr->pr##_used / 4) \
145 new_size = 5 * pr->pr##_used / 4; \
147 if (!(new_hash = su_zalloc(home, sizeof(*new_hash) * new_size))) \
150 old_size = pr->pr##_size; \
152 do for (j = 0; j < old_size; j++) { \
156 if (again < 2 && hfun(old_hash[j]) % old_size > j) { \
158 again = 1; continue; \
161 i0 = hfun(old_hash[j]) % new_size; \
163 for (i = i0; new_hash[i]; i = (i + 1) % new_size, assert(i != i0)); \
165 new_hash[i] = old_hash[j], old_hash[j] = NULL; \
168 while (again++ == 1); \
170 pr->pr##_table = new_hash, pr->pr##_size = new_size; \
172 assert(pr->pr##_used == used); \
174 su_free(home, old_hash); \
180 int prefix##_is_full(prefix##_t const *pr) \
182 return pr->pr##_table == NULL || 3 * pr->pr##_used > 2 * pr->pr##_size; \
186 entry_t **prefix##_hash(prefix##_t const *pr, hash_value_t hv) \
188 return pr->pr##_table + hv % pr->pr##_size; \
192 entry_t **prefix##_next(prefix##_t const *pr, entry_t * const *ee) \
194 if (++ee < pr->pr##_table + pr->pr##_size && ee >= pr->pr##_table) \
195 return (entry_t **)ee; \
197 return pr->pr##_table; \
201 void prefix##_append(prefix##_t *pr, entry_t const *e) \
206 for (ee = prefix##_hash(pr, hfun(e)); *ee; ee = prefix##_next(pr, ee)) \
208 *ee = (entry_t *)e; \
212 void prefix##_insert(prefix##_t *pr, entry_t const *e) \
218 for (ee = prefix##_hash(pr, hfun(e)); \
220 ee = prefix##_next(pr, ee)) \
221 *ee = (entry_t *)e, e = e0; \
222 *ee = (entry_t *)e; \
226 int prefix##_remove(prefix##_t *pr, entry_t const *e) \
229 size_t size = pr->pr##_size; \
230 entry_t **htable = pr->pr##_table; \
235 for (i = hfun(e) % size; htable[i]; i = (i + 1) % size) \
236 if (e == htable[i]) \
240 if (!htable[i]) return -1; \
243 for (j = (i + 1) % size; htable[j]; j = (j + 1) % size) { \
245 k = hfun(htable[j]) % size; \
249 if (j > i ? (i < k && k < j) : (i < k || k < j)) \
252 htable[i] = htable[j], i = j; \
261 extern int prefix##_dummy
Sofia-SIP 1.13.16 -
Copyright (C) 2006 Nokia Corporation. All rights reserved.
Licensed under the terms of the GNU Lesser General Public License.