Lines Matching refs:idx
175 unsigned int idx, const void *key)
179 for (node = ares__llist_node_first(htable->buckets[idx]); node != NULL;
245 size_t idx = HASH_IDX(htable, htable->bucket_key(val));
247 if (buckets[idx] == NULL) {
249 buckets[idx] = htable->buckets[i];
258 size_t idx = HASH_IDX(htable, htable->bucket_key(val));
262 if (buckets[idx] == NULL && ares__llist_len(htable->buckets[i]) == 1) {
264 buckets[idx] = htable->buckets[i];
270 if (buckets[idx] == NULL) {
275 buckets[idx] = prealloc_llist[prealloc_llist_len - 1];
282 ares__llist_node_move_parent_first(node, buckets[idx]);
315 unsigned int idx = 0;
325 idx = HASH_IDX(htable, key);
328 node = ares__htable_find(htable, idx, key);
342 idx = HASH_IDX(htable, key);
346 if (htable->buckets[idx] == NULL) {
347 htable->buckets[idx] = ares__llist_create(htable->bucket_free);
348 if (htable->buckets[idx] == NULL) {
353 node = ares__llist_insert_first(htable->buckets[idx], bucket);
359 if (ares__llist_len(htable->buckets[idx]) > 1) {
370 unsigned int idx;
376 idx = HASH_IDX(htable, key);
378 return ares__llist_node_val(ares__htable_find(htable, idx, key));
384 unsigned int idx;
390 idx = HASH_IDX(htable, key);
391 node = ares__htable_find(htable, idx, key);