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 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379
|
/* Taken from Chocolateboy's autobox module. License same as perl's and
* this same as this module's license.
*/
/*
* This is a customized version of the pointer table implementation in sv.c
*/
#ifndef PTABLE_H_
#define PTABLE_H_
#include <assert.h>
#include <limits.h>
#include "ppport.h"
#if PTRSIZE == 8
/*
* This is one of Thomas Wang's hash functions for 64-bit integers from:
* http://www.concentric.net/~Ttwang/tech/inthash.htm
*/
SRL_STATIC_INLINE U32 ptr_hash(PTRV u) {
u = (~u) + (u << 18);
u = u ^ (u >> 31);
u = u * 21;
u = u ^ (u >> 11);
u = u + (u << 6);
u = u ^ (u >> 22);
return (U32)u;
}
#else
/*
* This is one of Bob Jenkins' hash functions for 32-bit integers
* from: http://burtleburtle.net/bob/hash/integer.html
*/
SRL_STATIC_INLINE U32 ptr_hash(PTRV u) {
u = (u + 0x7ed55d16) + (u << 12);
u = (u ^ 0xc761c23c) ^ (u >> 19);
u = (u + 0x165667b1) + (u << 5);
u = (u + 0xd3a2646c) ^ (u << 9);
u = (u + 0xfd7046c5) + (u << 3);
u = (u ^ 0xb55a4f09) ^ (u >> 16);
return u;
}
#endif
#define PTABLE_HASH(ptr) ptr_hash(PTR2nat(ptr))
#define PTABLE_FLAG_AUTOCLEAN 1
typedef struct PTABLE_entry PTABLE_ENTRY_t;
typedef struct PTABLE PTABLE_t;
typedef struct PTABLE_iter PTABLE_ITER_t;
struct PTABLE_entry {
struct PTABLE_entry *next;
void *key;
void *value;
};
struct PTABLE {
struct PTABLE_entry **tbl_ary;
UV tbl_max;
UV tbl_items;
PTABLE_ITER_t *cur_iter; /* one iterator at a time can be auto-freed */
};
struct PTABLE_iter {
struct PTABLE *table;
UV bucket_num;
struct PTABLE_entry *cur_entry;
};
/*
SRL_STATIC_INLINE PTABLE_t * PTABLE_new(void);
SRL_STATIC_INLINE PTABLE_t * PTABLE_new_size(const U8 size_base2_exponent);
SRL_STATIC_INLINE PTABLE_ENTRY_t * PTABLE_find(PTABLE_t *tbl, const void *key);
SRL_STATIC_INLINE void * PTABLE_fetch(PTABLE_t *tbl, const void *key);
SRL_STATIC_INLINE PTABLE_ENTRY_t * PTABLE_store(PTABLE_t *tbl, void *key, void *value);
SRL_STATIC_INLINE void PTABLE_delete(PTABLE_t *tbl, void *key);
SRL_STATIC_INLINE void PTABLE_grow(PTABLE_t *tbl);
SRL_STATIC_INLINE void PTABLE_clear(PTABLE_t *tbl);
SRL_STATIC_INLINE void PTABLE_clear_dec(pTHX_ PTABLE_t *tbl);
SRL_STATIC_INLINE void PTABLE_free(PTABLE_t *tbl);
SRL_STATIC_INLINE PTABLE_ITER_t * PTABLE_iter_new(PTABLE_t *tbl);
SRL_STATIC_INLINE PTABLE_ITER_t * PTABLE_iter_new_flags(PTABLE_t *tbl, int flags);
SRL_STATIC_INLINE PTABLE_ENTRY_t * PTABLE_iter_next(PTABLE_ITER_t *iter);
SRL_STATIC_INLINE void PTABLE_iter_free(PTABLE_ITER_t *iter);
*/
/* create a new pointer => pointer table */
SRL_STATIC_INLINE PTABLE_t *
PTABLE_new_size(const U8 size_base2_exponent)
{
PTABLE_t *tbl;
Newxz(tbl, 1, PTABLE_t);
tbl->tbl_max = (1 << size_base2_exponent) - 1;
tbl->tbl_items = 0;
tbl->cur_iter = NULL;
Newxz(tbl->tbl_ary, tbl->tbl_max + 1, PTABLE_ENTRY_t*);
return tbl;
}
SRL_STATIC_INLINE PTABLE_t *
PTABLE_new(void)
{
return PTABLE_new_size(9);
}
/* map an existing pointer using a table */
SRL_STATIC_INLINE PTABLE_ENTRY_t *
PTABLE_find(PTABLE_t *tbl, const void *key) {
PTABLE_ENTRY_t *tblent;
const UV hash = PTABLE_HASH(key);
tblent = tbl->tbl_ary[hash & tbl->tbl_max];
for (; tblent; tblent = tblent->next) {
if (tblent->key == key)
return tblent;
}
return NULL;
}
SRL_STATIC_INLINE void *
PTABLE_fetch(PTABLE_t *tbl, const void *key)
{
PTABLE_ENTRY_t const *const tblent = PTABLE_find(tbl, key);
return tblent ? tblent->value : NULL;
}
/* double the hash bucket size of an existing ptr table */
SRL_STATIC_INLINE void
PTABLE_grow(PTABLE_t *tbl)
{
PTABLE_ENTRY_t **ary = tbl->tbl_ary;
const UV oldsize = tbl->tbl_max + 1;
UV newsize = oldsize * 2;
UV i;
Renew(ary, newsize, PTABLE_ENTRY_t*);
Zero(&ary[oldsize], newsize - oldsize, PTABLE_ENTRY_t*);
tbl->tbl_max = --newsize;
tbl->tbl_ary = ary;
for (i = 0; i < oldsize; i++, ary++) {
PTABLE_ENTRY_t **curentp, **entp, *ent;
if (!*ary)
continue;
curentp = ary + oldsize;
for (entp = ary, ent = *ary; ent; ent = *entp) {
if ((newsize & PTABLE_HASH(ent->key)) != i) {
*entp = ent->next;
ent->next = *curentp;
*curentp = ent;
continue;
} else {
entp = &ent->next;
}
}
}
}
/* add a new entry to a pointer => pointer table */
SRL_STATIC_INLINE PTABLE_ENTRY_t *
PTABLE_store(PTABLE_t *tbl, void *key, void *value)
{
PTABLE_ENTRY_t *tblent = PTABLE_find(tbl, key);
if (tblent) {
tblent->value = value;
} else {
const UV entry = PTABLE_HASH(key) & tbl->tbl_max;
Newx(tblent, 1, PTABLE_ENTRY_t);
tblent->key = key;
tblent->value = value;
tblent->next = tbl->tbl_ary[entry];
tbl->tbl_ary[entry] = tblent;
tbl->tbl_items++;
if (tblent->next && (tbl->tbl_items > tbl->tbl_max))
PTABLE_grow(tbl);
}
return tblent;
}
/* remove all the entries from a ptr table */
SRL_STATIC_INLINE void
PTABLE_clear(PTABLE_t *tbl)
{
if (tbl && tbl->tbl_items) {
register PTABLE_ENTRY_t * * const array = tbl->tbl_ary;
UV riter = tbl->tbl_max;
do {
PTABLE_ENTRY_t *entry = array[riter];
while (entry) {
PTABLE_ENTRY_t * const oentry = entry;
entry = entry->next;
Safefree(oentry);
}
/* chocolateboy 2008-01-08
*
* make sure we clear the array entry, so that subsequent probes fail
*/
array[riter] = NULL;
} while (riter--);
tbl->tbl_items = 0;
}
}
SRL_STATIC_INLINE void
PTABLE_clear_dec(pTHX_ PTABLE_t *tbl)
{
if (tbl && tbl->tbl_items) {
register PTABLE_ENTRY_t * * const array = tbl->tbl_ary;
UV riter = tbl->tbl_max;
do {
PTABLE_ENTRY_t *entry = array[riter];
while (entry) {
PTABLE_ENTRY_t * const oentry = entry;
entry = entry->next;
if (oentry->value)
SvREFCNT_dec((SV*)(oentry->value));
Safefree(oentry);
}
/* chocolateboy 2008-01-08
*
* make sure we clear the array entry, so that subsequent probes fail
*/
array[riter] = NULL;
} while (riter--);
tbl->tbl_items = 0;
}
}
/* remove one entry from a ptr table */
SRL_STATIC_INLINE void
PTABLE_delete(PTABLE_t *tbl, void *key)
{
PTABLE_ENTRY_t *tblent;
PTABLE_ENTRY_t *tblent_prev;
if (!tbl || !tbl->tbl_items) {
return;
} else {
const UV hash = PTABLE_HASH(key);
tblent_prev = NULL;
tblent = tbl->tbl_ary[hash & tbl->tbl_max];
for (; tblent; tblent_prev = tblent, tblent = tblent->next) {
if (tblent->key == key) {
if (tblent_prev != NULL) {
tblent_prev->next = tblent->next;
}
else {
/* First entry in chain */
tbl->tbl_ary[hash & tbl->tbl_max] = tblent->next;
}
Safefree(tblent);
break;
}
}
}
}
#define PTABLE_ITER_NEXT_ELEM(iter, tbl) \
STMT_START { \
if ((iter)->cur_entry && (iter)->cur_entry->next) { \
(iter)->cur_entry = (iter)->cur_entry->next; \
} \
else { \
do { \
if ((iter)->bucket_num > (tbl)->tbl_max) { \
(iter)->cur_entry = NULL; \
break; \
} \
(iter)->cur_entry = (tbl)->tbl_ary[(iter)->bucket_num++]; \
} while ((iter)->cur_entry == NULL); \
} \
} STMT_END
/* Create new iterator object */
SRL_STATIC_INLINE PTABLE_ITER_t *
PTABLE_iter_new_flags(PTABLE_t *tbl, int flags)
{
PTABLE_ITER_t *iter;
Newx(iter, 1, PTABLE_ITER_t);
iter->table = tbl;
iter->bucket_num = 0;
iter->cur_entry = NULL;
if (flags & PTABLE_FLAG_AUTOCLEAN)
tbl->cur_iter = iter;
if (tbl->tbl_items == 0) {
/* Prevent hash bucket scanning.
* This can be a significant optimization on large, empty hashes. */
iter->bucket_num = INT_MAX;
return iter;
}
PTABLE_ITER_NEXT_ELEM(iter, tbl);
assert(iter->cur_entry != NULL);
return iter;
}
SRL_STATIC_INLINE PTABLE_ITER_t *
PTABLE_iter_new(PTABLE_t *tbl)
{
return PTABLE_iter_new_flags(tbl, 0);
}
/* Return next item from hash, NULL if at end */
SRL_STATIC_INLINE PTABLE_ENTRY_t *
PTABLE_iter_next(PTABLE_ITER_t *iter)
{
PTABLE_ENTRY_t *retval = iter->cur_entry;
PTABLE_t *tbl = iter->table;
PTABLE_ITER_NEXT_ELEM(iter, tbl);
return retval;
}
/* Free iterator object */
SRL_STATIC_INLINE void
PTABLE_iter_free(PTABLE_ITER_t *iter)
{
/* If we're the iterator that can be auto-cleaned by the PTABLE,
* then unregister. */
if (iter->table->cur_iter == iter)
iter->table->cur_iter = NULL;
Safefree(iter);
}
SRL_STATIC_INLINE void
PTABLE_debug_dump(PTABLE_t *tbl, void (*func)(PTABLE_ENTRY_t *e))
{
PTABLE_ENTRY_t *e;
PTABLE_ITER_t *iter = PTABLE_iter_new(tbl);
while (NULL != (e = PTABLE_iter_next(iter))) {
func(e);
}
PTABLE_iter_free(iter);
}
/* clear and free a ptr table */
SRL_STATIC_INLINE void
PTABLE_free(PTABLE_t *tbl)
{
if (!tbl)
return;
PTABLE_clear(tbl);
if (tbl->cur_iter) {
PTABLE_ITER_t *it = tbl->cur_iter;
tbl->cur_iter = NULL; /* avoid circular checks */
PTABLE_iter_free(it);
}
Safefree(tbl->tbl_ary);
Safefree(tbl);
}
#endif
|