Lines Matching refs:hash
103 * DT_HASH base of hash table for dynamic lookups
107 * dynamic lookup hash table. Here's the layout of the hash table:
127 * consumer where the next entry in the hash chain is. We can use
353 Word hash[2];
359 if (Pread(P, hash, sizeof (hash), hptr) != sizeof (hash)) {
360 dprintf("Pread of .hash at %lx failed\n",
365 hnbuckets = hash[0];
366 hnchains = hash[1];
608 uint_t *hash;
624 /* find the .hash bucket address for this symbol */
627 hash = &((uint_t *)hptr)[2 + htmp];
629 /* read the elf hash bucket index */
630 if (Pread(P, &ndx, sizeof (ndx), (uintptr_t)hash) !=
632 dprintf("Pread of .hash at %lx failed\n", (long)hash);
655 hash = &((uint_t *)hptr)[2 + hnbuckets + ndx];
656 if (Pread(P, &ndx, sizeof (ndx), (uintptr_t)hash) !=
658 dprintf("Pread of .hash at %lx failed\n",
659 (long)hash);