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()
2730     return MakeError(", nbucket = " + Twine(H->nbucket) +  in checkHashTable()
2764     W.printNumber("Num Buckets", HashTable->nbucket);  in printHashTable()
4118   for (uint32_t Buc = 0; Buc < SysVHash.nbucket; Buc++) {  in printHashTableSymbols()
4846   size_t NBucket = HashTable.nbucket;  in printHashHistogram()  local
4855   if (NChain == 0 || NBucket == 0)  in printHashHistogram()
4858   std::vector<size_t> ChainLen(NBucket, 0);  in printHashHistogram()
4861   for (size_t B = 0; B < NBucket; B++) {  in printHashHistogram()
4884   for (size_t B = 0; B < NBucket; B++)  in printHashHistogram()
4888   OS << "Histogram for bucket list length (total of " << NBucket  in printHashHistogram()
4894                  (Count[I] * 100.0) / NBucket,  in printHashHistogram()
4915   size_t NBucket = GnuHashTable.nbuckets;  in printGnuHashHistogram()  local
4916   if (Chains.empty() || NBucket == 0)  in printGnuHashHistogram()
4920   std::vector<size_t> ChainLen(NBucket, 0);  in printGnuHashHistogram()
4921   for (size_t B = 0; B < NBucket; B++) {  in printGnuHashHistogram()
4938   for (size_t B = 0; B < NBucket; B++)  in printGnuHashHistogram()
4942   OS << "Histogram for `.gnu.hash' bucket list length (total of " << NBucket  in printGnuHashHistogram()
4948                  (Count[I] * 100.0) / NBucket,  in printGnuHashHistogram()