Lines Matching defs:table
421 * Find entry in the hash table
746 /* The AVL tree based cache uses a hash table for quick access */
748 /* Determine hash table size based on type */
763 /* Create the hash table */
1430 /* Lookup the cache table */
1848 nsc_keephot_t *table;
1861 if ((table = maken(keep)) == NULL) {
1873 (void) insertn(table, entry->stats.hits, entry);
1878 if (table[i].ptr == NULL)
1880 ptr = (nsc_entry_t *)table[i].ptr;
1899 table[i].ptr = malloc(bufsiz);
1900 if (table[i].ptr == NULL) {
1906 (void) memcpy(table[i].ptr, ptr->buffer, ptr->bufsize);
1907 ((nss_pheader_t *)table[i].ptr)->pbufsiz = bufsiz;
1908 table[i].num = bufsiz;
1914 if (table[i].ptr == NULL)
1915 continue; /* unused slot in table */
1924 largs->buffer = table[i].ptr;
1925 largs->bufsize = table[i].num;
1935 * Free the table here.
1937 free(table);
2088 /* lookup the hash table ==> O(1) */
2101 /* move it to the hash table */
2309 * Dynamic adjustment of hash table size.
2311 * Hash table size is roughly 1/8th of the
2333 (me, "%s: resizing hash table from %d to %d\n",