Lines Matching refs:NAME
56 NAME name of the hash table structure.
69 NAME *htab;
106 insert_entry_2 (NAME *htab, HASHTYPE hval, size_t idx, TYPE data)
142 #define _TABLE(name) \
143 name##_ent *table = htab->table
144 #define TABLE(name) _TABLE (name)
145 TABLE(NAME);
196 #define INIT(name) _INIT (name)
197 #define _INIT(name) \
198 name##_init
199 INIT(NAME) (htab, init_size)
200 NAME *htab;
221 #define FREE(name) _FREE (name)
222 #define _FREE(name) \
223 name##_free
224 FREE(NAME) (htab)
225 NAME *htab;
233 #define INSERT(name) _INSERT (name)
234 #define _INSERT(name) \
235 name##_insert
236 INSERT(NAME) (htab, hval, data)
237 NAME *htab;
260 #define INSERT(name) _INSERT (name)
261 #define _INSERT(name) \
262 name##_overwrite
263 INSERT(NAME) (htab, hval, data)
264 NAME *htab;
283 #define FIND(name) _FIND (name)
284 #define _FIND(name) \
285 name##_find
286 FIND(NAME) (htab, hval, val)
287 NAME *htab;
306 # define ITERATEFCT(name) _ITERATEFCT (name)
307 # define _ITERATEFCT(name) \
308 name##_iterate
310 ITERATEFCT(NAME) (htab, ptr)
311 NAME *htab;
316 # define TYPENAME(name) _TYPENAME (name)
317 # define _TYPENAME(name) name##_ent
323 p = ((TYPENAME(NAME) *) p)->next;
342 p = ((TYPENAME(NAME) *) p)->next;
348 __builtin_prefetch (((TYPENAME(NAME) *) p)->next, 0, 2);
350 return ((TYPENAME(NAME) *) (*ptr = p))->data;
