Lines Matching full:hash
53 * return the number of bytes used by hash table, node table and header.
102 /* rebuild the hash table, node zero is never used. This works
103 * because layout of file is node table then hash table,
105 * double size ==> old hash table and new hash table can't
106 * overlap so on the new hash table is entirely in the new
107 * memory area (the grown part) and we know the new hash
108 * hash table is zeroed. That's why we don't need to zero init
112 * all things are fine and we don't need to init the hash
113 * table because in this case the new hash table is completely
155 find_samples_data(size_t hash, char const * filename)
165 list_for_each(pos, &files_hash[hash]) {
181 size_t hash;
187 hash = op_hash_string(filename) % FILES_HASH_SIZE;
188 data = find_samples_data(hash, filename);
261 list_add(&data->list, &files_hash[hash]);
