Lines Matching refs:hashtable
74 dns_rbtnode_t **hashtable[2];
313 if (rbt->hashtable[0] != NULL) {
316 if (rbt->hashtable[1] != NULL) {
423 * using the hashtable and have realized your folly, please
432 * lend itself to be optimized using the hashtable:
438 * hashtable, so at least in that subtree, a BST O(log N) lookup
443 * to look for a match in the hashtable for all superdomains in
446 * of which is a hashtable lookup involving dns_name_equal()
786 * the hashtable. We can get one of 3 results
848 for (hnode = rbt->hashtable[hindex][hash];
1453 node->hashnext = rbt->hashtable[rbt->hindex][hash];
1455 rbt->hashtable[rbt->hindex][hash] = node;
1464 REQUIRE(rbt->hashtable[index] == NULL);
1470 rbt->hashtable[index] = isc_mem_cget(rbt->mctx,
1477 isc_mem_cput(rbt->mctx, rbt->hashtable[index],
1482 rbt->hashtable[index] = NULL;
1498 * Rebuild the hashtable to reduce the load factor
1508 REQUIRE(rbt->hashtable[oldindex] != NULL);
1512 REQUIRE(rbt->hashtable[newindex] == NULL);
1525 dns_rbtnode_t **newtable = rbt->hashtable[rbt->hindex];
1529 rbt->hashtable[RBT_HASH_NEXTTABLE(rbt->hindex)];
1545 /* Move the first non-empty node from old hashtable to new hashtable */
1572 return rbt->hashtable[RBT_HASH_NEXTTABLE(rbt->hindex)] != NULL;
1582 * Add a node to the hash table. Rehash the hashtable if the node count
1620 hnode = rbt->hashtable[hindex][hash];
1623 rbt->hashtable[hindex][hash] = hnode->hashnext;