Lines Matching defs:hash
135 * Pointers to active zone_t's are stored in two hash tables; one
144 * so it is slower than an id or name search via a hash table.
150 * zone hash tables and lists. Zones cannot be created or destroyed
1937 * Compute a hash value based on the contents of the label and the DOI. The
1938 * hash algorithm is somewhat arbitrary, but is based on the observation that
1940 * multiples of the number of hash chains, and thus stirring in some primes
1948 uint_t hash;
1953 hash = lab->tsl_doi + (lab->tsl_doi << 1);
1960 hash += *up + (*up << ((i % 16) + 1));
1964 return (hash);
4435 * Look for zone under hash lock to prevent races with calls to
4565 * Look for zone under hash lock to prevent races with other
4811 * Look for zone under hash lock to prevent races with other
4972 /* remove from active list and hash tables */