svc/configd/rc_node.c

46  * rc_node_t's are also placed in the cache_hash[] hash table, for rapid
76  * a new node takes the place of the old node in the global hash and the
119  * strings into a hash table and detecting collisions, which takes linear time
126  * the authorizations from one of the sets into the hash table we can merely
128  * This reduces memory requirements and hash table clutter.  The enabling set
140  * While entering the enabling strings into the hash table, we keep track
231  * are added to a permcheck_t hash table as noted in the section on
233  * hash table, perm_granted() is called.  If the client is authorized,
241  * find no match, so it needs to decide which string in the hash
245  * in the hash table.  The pc_auth_type enum designates the
251  * authorization in the hash table.  It does this using the
254  * specific authorization string is added to the hash table.  Thus, if
431 /* Element of a permcheck_t hash table. */
439  * permcheck hash table to use in the audit event.  That is to say of all
440  * the strings in the hash table, we must choose one and use it in the audit
465 /* An authorization set hash table. */
627 	uint32_t hash;
638 	hash = type * 7 + mainid * 5 + backend;
641 		hash = hash * 11 + *ids++ * 7;
649 	return (hash);
1341 	 * Generic hash function from uts/common/os/modhash.c.
1788  * Because of the lock ordering, cp has to already be in the hash table with
4327 	 * the notify list and cache hash table.
4462 	 * remove it, we must find the current in-hash object and grab its
4947 	 * from the hash table and set the NODE_DEAD flag, and