Lines Matching refs:hash
246 * Shared hash functions for multiple databases.
252 uint_t hash = 0;
255 hash = hash * 15 + name[i];
257 return (hash);
724 * There are two different functions using the hash table.
725 * _nss_files_XY_hash - searches the hash table for a particular key.
726 * _nss_files_XY_hashgetent - implements getent on the hash table.
741 uint_t hash, line;
775 hash = fhp->fh_hash_func[hashop](args, 1, NULL, 0);
776 for (hp = htab[hash % fhp->fh_size].h_first; hp != NULL;
778 if (hp->h_hash != hash)
870 * Compare two hashed keys; first we compare the hash and
873 * the same keys next to each other in the hash table.
961 /* expand line hash arrays */
990 * Rebuild the hashfile; hash lock must be held. It returns B_TRUE
1123 * Populate the hash tables in reverse order so that the hash chains
1154 * Enumerate the entries in the hash table, this allows us to run
1194 /* Rebuild may not have build the hash, so jump to retry */
1207 * We walk the hash tables line by line so that the getent returns
1210 * those database we find the hash entry and locate them in the
1211 * hash table and use all the entries with the same key; as we
1214 * hash chain. (One of the reasons why we use insertsorted)
1230 uint_t hash = hp->h_hash;
1231 uint_t bucket = hash % fhp->fh_size;
1237 if (shp->h_hash == hash &&