Lines Matching defs:members
316 void **members; // closed hash table of pointers
323 static inline void **ptr_set_next(ptr_set *set, void **slot) { return ++slot == set->end ? set->members : slot; }
372 // capture old members
373 void **old_members = set->members;
380 set->members = (void **)aux_calloc(set->length, sizeof(void *));
382 set->end = set->members + set->length;
403 for (depth = 0, slot = set->members + hash; depth < PTR_SET_DEPTH; depth++, slot = ptr_set_next(set, slot)) {
427 // allocate members
428 set->members = (void **)aux_calloc(PTR_SET_GROWTH, sizeof(void *));
430 set->end = set->members + PTR_SET_GROWTH;
438 aux_free(set->members);
486 // searching for other members to fillin gap
508 void **members; // closed hash table of pointers
515 static inline void **ptr_map_next(ptr_map *map, void **slot) { return ++slot == map->end ? map->members : slot; }
565 // capture old members
566 void **old_members = map->members;
576 map->members = (void **)aux_calloc(2, size); // enough room for values, too
578 map->end = map->members + map->length;
599 for (depth = 0, slot = map->members + hash; depth < PTR_SET_DEPTH; depth++, slot = ptr_map_next(map, slot)) {
625 // allocate & clear members
626 map->members = (void **)aux_calloc(2, size);
628 map->end = map->members + PTR_SET_GROWTH;
636 aux_free(map->members);
677 // searching for other members to fillin gap