Lines Matching refs:table
69 #define HASHTABLE_ENTRIES_COUNT(table) ((table)->entries_size) argument
75 #define HASHTABLE_INIT(table, type, field, _entries_size) \ argument
78 (table)->entries = (void *)calloc(1, \
79 sizeof(*(table)->entries) * (_entries_size)); \
80 (table)->entries_size = (_entries_size); \
81 for (var = 0; var < HASHTABLE_ENTRIES_COUNT(table); ++var) {\
82 (table)->entries[var].field.capacity = \
84 (table)->entries[var].field.size = 0; \
85 (table)->entries[var].field.values = (type *)malloc(\
88 assert((table)->entries[var].field.values != NULL);\
95 #define HASHTABLE_DESTROY(table, field) \ argument
98 for (var = 0; var < HASHTABLE_ENTRIES_COUNT(table); ++var) {\
99 free((table)->entries[var].field.values); \
103 #define HASHTABLE_GET_ENTRY(table, hash) (&((table)->entries[hash])) argument
108 #define HASHTABLE_FOREACH(table, var) \ argument
109 for ((var) = &((table)->entries[0]); \
110 (var) < &((table)->entries[HASHTABLE_ENTRIES_COUNT(table)]);\
157 hashtable_index_t name##_CALCULATE_HASH(struct name *table, type *data) \
160 return HASH(data, table->entries_size); \
203 #define HASHTABLE_CALCULATE_HASH(name, table, data) \ argument
204 (name##_CALCULATE_HASH((table), data))