Lines Matching refs:hash
47 * rc_node_t's are also placed in the cache_hash[] hash table, for rapid
77 * a new node takes the place of the old node in the global hash and the
120 * strings into a hash table and detecting collisions, which takes linear time
127 * the authorizations from one of the sets into the hash table we can merely
129 * This reduces memory requirements and hash table clutter. The enabling set
141 * While entering the enabling strings into the hash table, we keep track
232 * are added to a permcheck_t hash table as noted in the section on
234 * hash table, perm_granted() is called. If the client is authorized,
242 * find no match, so it needs to decide which string in the hash
246 * in the hash table. The pc_auth_type enum designates the
252 * authorization in the hash table. It does this using the
255 * specific authorization string is added to the hash table. Thus, if
432 /* Element of a permcheck_t hash table. */
440 * permcheck hash table to use in the audit event. That is to say of all
441 * the strings in the hash table, we must choose one and use it in the audit
466 /* An authorization set hash table. */
628 uint32_t hash;
639 hash = type * 7 + mainid * 5 + backend;
642 hash = hash * 11 + *ids++ * 7;
650 return (hash);
1342 * Generic hash function from uts/common/os/modhash.c.
1789 * Because of the lock ordering, cp has to already be in the hash table with
4328 * the notify list and cache hash table.
4463 * remove it, we must find the current in-hash object and grab its
4948 * from the hash table and set the NODE_DEAD flag, and