Home
last modified time | relevance | path

Searched refs:hash_bucket (Results 1 – 5 of 5) sorted by relevance

/external/kmod/shared/
Dhash.c33 struct hash_bucket { struct
44 struct hash_bucket buckets[]; argument
54 n_buckets * sizeof(struct hash_bucket)); in hash_new()
69 struct hash_bucket *bucket, *bucket_end; in hash_free()
151 struct hash_bucket *bucket = hash->buckets + pos; in hash_add()
194 struct hash_bucket *bucket = hash->buckets + pos; in hash_add_unique()
239 const struct hash_bucket *bucket = hash->buckets + pos; in hash_find()
258 struct hash_bucket *bucket = hash->buckets + pos; in hash_del()
310 const struct hash_bucket *b = iter->hash->buckets + iter->bucket; in hash_iter_next()
/external/freetype/src/base/
Dfthash.c106 hash_bucket( FT_Hashkey key, in hash_bucket() function
153 nbp = hash_bucket( (*bp)->key, hash ); in hash_rehash()
240 FT_Hashnode* bp = hash_bucket( key, hash ); in hash_insert()
305 FT_Hashnode* np = hash_bucket( key, hash ); in hash_lookup()
/external/dnsmasq/src/
Dcache.c104 static struct crec** hash_bucket(char* name) { in hash_bucket() function
124 struct crec** up = hash_bucket(cache_get_name(crecp)); in cache_hash()
223 for (up = hash_bucket(name), crecp = *up; crecp; crecp = crecp->hash_next) in cache_scan_free()
420 for (up = hash_bucket(name), crecp = *up; crecp; crecp = next) { in cache_find_by_name()
/external/freetype/
DChangeLog.261781 (hash_bucket, ft_hash_free): Use them.
1794 * src/base/fthash.c (hash_bucket): Updated.
DChangeLog.215816 * src/bdf/bdflib.c (hash_bucket, hash_lookup): Use `const' for first