Lines Matching full:hash
30 // The dwarf accelerator tables are an indirect hash table optimized
46 // where the header contains a magic number, version, type of hash function,
51 // section contains all of the 32-bit hash values in contiguous memory, and
53 // hash.
55 // For a lookup example, we could hash a function name and take it modulo the
57 // as an index into the hashes table and look at each successive hash as long
58 // as the hash value is still the same modulo result (bucket value) as earlier.
86 uint32_t magic; // 'HASH' magic value to allow endian detection
88 uint16_t hash_function; // The hash function enumeration that was used.
89 uint32_t bucket_count; // The number of buckets in this hash table.
90 uint32_t hashes_count; // The total number of unique hash values
91 // and hash data offsets in this table.
92 uint32_t header_data_len; // The bytes to skip to get to the hash
107 << "Hash Function: " << hash_function << "\n"
187 // hash and the offsets to the DIEs themselves.
189 // hash chain.
223 O << " Hash Value: " << format("0x%x", HashValue) << "\n";
