Lines Matching defs:hash
107 * DT_HASH base of hash table for dynamic lookups
111 * dynamic lookup hash table. Here's the layout of the hash table:
131 * consumer where the next entry in the hash chain is. We can use
358 Word hash[2];
364 if (Pread(P, hash, sizeof (hash), hptr) != sizeof (hash)) {
365 dprintf("Pread of .hash at %lx failed\n",
370 hnbuckets = hash[0];
371 hnchains = hash[1];
615 uint_t *hash;
632 dprintf("empty or missing .hash\n");
636 /* find the .hash bucket address for this symbol */
639 hash = &((uint_t *)hptr)[2 + htmp];
641 /* read the elf hash bucket index */
642 if (Pread(P, &ndx, sizeof (ndx), (uintptr_t)hash) !=
644 dprintf("Pread of .hash at %lx failed\n", (long)hash);
667 hash = &((uint_t *)hptr)[2 + hnbuckets + ndx];
668 if (Pread(P, &ndx, sizeof (ndx), (uintptr_t)hash) !=
670 dprintf("Pread of .hash at %lx failed\n",
671 (long)hash);