2228     // equal nchain". Check to see if the DT_HASH hash table nchain value  in parseDynamicTable()
2234       else if (HashTable->nchain != DynSymRegion->Size / DynSymRegion->EntSize)  in parseDynamicTable()
2236             "hash table nchain (" + Twine(HashTable->nchain) +  in parseDynamicTable()
2261         (uint64_t)HashTable->nchain * DynSymRegion->EntSize;  in parseDynamicTable()
2270       DynSymRegion->Size = HashTable->nchain * DynSymRegion->EntSize;  in parseDynamicTable()
2719   // Each SHT_HASH section starts from two 32-bit fields: nbucket and nchain.  in checkHashTable()
2729       ((uint64_t)H->nbucket + H->nchain) * sizeof(typename ELFT::Word))  in checkHashTable()
2731                      ", nchain = " + Twine(H->nchain));  in checkHashTable()
2765     W.printNumber("Num Chains", HashTable->nchain);  in printHashTable()
4121     std::vector<bool> Visited(SysVHash.nchain);  in printHashTableSymbols()
4122     for (uint32_t Ch = Buckets[Buc]; Ch < SysVHash.nchain; Ch = Chains[Ch]) {  in printHashTableSymbols()
4847   size_t NChain = HashTable.nchain;  in printHashHistogram()  local
4855   if (NChain == 0 || NBucket == 0)  in printHashHistogram()
4862     std::vector<bool> Visited(NChain);  in printHashHistogram()
4863     for (size_t C = Buckets[B]; C < NChain; C = Chains[C]) {  in printHashHistogram()