Lines Matching defs:table
37 * hashtable dynamically grows if the number of vnodes in the table as a
38 * whole exceeds the size of the table left-shifted by
61 * Due to the hashing algorithm, the size of the hash table needs to be a
127 * the correct table), so we hash to the wrong bucket, grab the wrong
129 * again. If both the size and the table changed since we loaded them,
133 * locks in the table, hence the unlocking code (TABLE_LOCK_EXIT())
134 * doesn't need to do any dances, since neither the table nor the size
212 struct lobucket *table;
218 table = li->li_hashtable;
220 mutex_destroy(&table[i].lh_lock);
221 kmem_free(table, htsize * sizeof (*li->li_hashtable));
240 * in a table hashed by vnode. If the lnode for
241 * this vnode is already in the table return it (ref count is
243 * table when lo_inactive calls freelonode. The creation of
245 * the vnode exists in the table. This is used in the creation
486 * These routines maintain a table of lnodes hashed by vp so
497 lretire(struct loinfo *li, struct lobucket *table, uint_t size)
502 lrhp->lrh_table = table;
524 * table, and retry the allocation then.
598 * Put a lnode in the table
638 * Remove a lnode from the table