Lines Matching defs:table
484 static const uint64_t table[] = {
494 if (o->object.type >= ELEMENTSOF(table) || table[o->object.type] <= 0)
497 return table[o->object.type];
630 /* We estimate that we need 1 hash table entry per 768 bytes
632 beyond 75% fill level. Calculate the hash table size for
639 log_debug("Reserving %"PRIu64" entries in hash table.", s / sizeof(HashItem));
664 /* We use a fixed size hash table for the fields as this
810 /* Only entry in the hash table is easy */
843 /* If the field hash table is empty, we can't find anything */
847 /* Map the field hash table, if it isn't mapped yet. */
915 /* If there's no data hash table, then there's no entry. */
919 /* Map the data hash table, if it isn't mapped yet. */
3279 * level (75%, borrowing this value from Java's hash table
3286 log_debug("Data hash table of %s has a fill level at %.1f (%"PRIu64" of %"PRIu64" items, %llu file size, %"PRIu64" bytes per hash table item), suggesting rotation.",
3298 log_debug("Field hash table of %s has a fill level at %.1f (%"PRIu64" of %"PRIu64" items), suggesting rotation.",