Searched refs:hashes_count (Results 1 – 5 of 5) sorted by relevance
66 …uint32_t hashes_count; // The total number of unique hash values and hash data offsets in … member75 hashes_count (0), in Header()93 sizeof(hashes_count) + in GetByteSize()114 s.Printf ("header.hashes_count = 0x%8.8x %u\n", hashes_count, hashes_count); in Dump()126 sizeof (hashes_count) + in Read()164 hashes_count = data.GetU32 (&offset); in Read()235 header.hashes_count = 0; in Save()306 header.hashes_count = hash_values.size(); in Save()319 for (i=0; i<header.hashes_count; ++i) in Save()327 for (i=0; i<header.hashes_count; ++i) in Save()[all …]
85 uint32_t hashes_count; // The total number of unique hash values member96 hashes_count(0), header_data_len(data_len) {} in TableHeader()
62 Header.hashes_count = num; in ComputeBucketCount()123 Asm->EmitInt32(Header.hashes_count); in EmitHeader()
782 const uint32_t hash_count = m_header.hashes_count; in AppendAllDIEsThatMatchingRegex()819 const uint32_t hash_count = m_header.hashes_count; in AppendAllDIEsInRange()
867 | HEADER.hashes_count | uint32_t1008 …uint32_t hashes_count; // The total number of unique hash values and hash data offsets in thi…1032 are in the ``BUCKETS`` array. ``hashes_count`` is the number of unique 32 bit1048 …uint32_t hashes [Header.hashes_count]; // Every unique 32 bit hash for the entire table is in thi…1049 …uint32_t offsets[Header.hashes_count]; // An offset that corresponds to each item in the "hashes[…