Lines Matching refs:hash
62 unsigned hash = 0;
66 hash = 31 * hash + (unsigned) *c;
68 return hash;
113 /* Remove from data hash table */
120 unsigned hash = s->hash_func(e->data) % NBUCKETS;
121 BY_DATA(s)[hash] = e->data_next;
124 /* Remove from index hash table */
147 static struct idxset_entry* data_scan(pa_idxset *s, unsigned hash, const void *p) {
150 pa_assert(hash < NBUCKETS);
153 for (e = BY_DATA(s)[hash]; e; e = e->data_next)
160 static struct idxset_entry* index_scan(pa_idxset *s, unsigned hash, uint32_t idx) {
163 pa_assert(hash < NBUCKETS);
165 for (e = BY_INDEX(s)[hash]; e; e = e->index_next)
173 unsigned hash;
178 hash = s->hash_func(p) % NBUCKETS;
180 if ((e = data_scan(s, hash, p))) {
193 /* Insert into data hash table */
194 e->data_next = BY_DATA(s)[hash];
196 if (BY_DATA(s)[hash])
197 BY_DATA(s)[hash]->data_previous = e;
198 BY_DATA(s)[hash] = e;
200 hash = e->idx % NBUCKETS;
202 /* Insert into index hash table */
203 e->index_next = BY_INDEX(s)[hash];
205 if (BY_INDEX(s)[hash])
206 BY_INDEX(s)[hash]->index_previous = e;
207 BY_INDEX(s)[hash] = e;
231 unsigned hash;
236 hash = idx % NBUCKETS;
238 if (!(e = index_scan(s, hash, idx)))
245 unsigned hash;
250 hash = s->hash_func(p) % NBUCKETS;
252 if (!(e = data_scan(s, hash, p)))
263 unsigned hash;
268 hash = idx % NBUCKETS;
270 if (!(e = index_scan(s, hash, idx)))
281 unsigned hash;
286 hash = s->hash_func(data) % NBUCKETS;
288 if (!(e = data_scan(s, hash, data)))
315 unsigned hash;
321 hash = *idx % NBUCKETS;
323 e = index_scan(s, hash, *idx);
405 unsigned hash;
413 hash = *idx % NBUCKETS;
415 if ((e = index_scan(s, hash, *idx))) {
434 hash = *idx % NBUCKETS;
436 if ((e = index_scan(s, hash, *idx))) {