Searched refs:table (Results 1 – 9 of 9) sorted by relevance
8 central hash table, LRU lists, and some statistics counters are covered by14 - A secondary small hash table of locks is used to lock an item by its hash17 - This secondary hash table is mapped to the central hash tables buckets. This18 allows multiple threads to access the hash table in parallel. Only one19 thread may read or write against a particular hash table bucket.
1143 items by directly walking the hash table instead of the LRU's. This makes it1169 items by directly walking the hash table instead of the LRU's. This makes it1396 | hash_power_level | 32u | Current size multiplier for hash table |1398 | hash_is_expanding | bool | Indicates if the hash table is being |1490 | hashpower_init | 32 | Starting size multiplier for hash table |1498 | hash_algorithm | char | Hash table algorithm in use |
722 # controls whether a binary table of contents is generated (YES) or a723 # normal table of contents (NO) in the .chm file.
19 table.insert(result_leak, res)
69 table.insert(o.t, fgen:new_handle(v))308 table.insert(o.t, fgen:new_handle(v))473 table.insert(t, arg.t[x])
292 table.insert(p, v)
11 ability to add many servers to a hash table of some kind and routing keys to
1568 int table = 0; in dump_registry() local1582 table++; in dump_registry()1591 fprintf(stderr, "### TABLE\t[%d]\n", table); in dump_registry()
869 # controls whether a binary table of contents is generated (YES) or a870 # normal table of contents (NO) in the .chm file.