Searched refs:ChainLen (Results 1 – 5 of 5) sorted by relevance
3082 std::vector<size_t> ChainLen(NBucket, 0); in printHashHistogram() local3087 if (MaxChain <= ++ChainLen[B]) in printHashHistogram()3089 TotalSyms += ChainLen[B]; in printHashHistogram()3098 ++Count[ChainLen[B]]; in printHashHistogram()3128 std::vector<size_t> ChainLen(NBucket, 0); in printHashHistogram() local3138 ChainLen[B] = Len; in printHashHistogram()3148 ++Count[ChainLen[B]]; in printHashHistogram()
687 for (unsigned ChainLen = Chain.size(); ChainIdx < ChainLen; ++ChainIdx) { in getVectorizablePrefix() local
4680 const unsigned ChainLen = Chain.size(); in vectorizeStoreChain() local4681 LLVM_DEBUG(dbgs() << "SLP: Analyzing a store chain of length " << ChainLen in vectorizeStoreChain()4694 for (unsigned i = 0, e = ChainLen; i + VF <= e; ++i) { in vectorizeStoreChain()
3445 std::vector<size_t> ChainLen(NBucket, 0); in printHashHistogram() local3450 if (MaxChain <= ++ChainLen[B]) in printHashHistogram()3452 TotalSyms += ChainLen[B]; in printHashHistogram()3461 ++Count[ChainLen[B]]; in printHashHistogram()3491 std::vector<size_t> ChainLen(NBucket, 0); in printHashHistogram() local3501 ChainLen[B] = Len; in printHashHistogram()3511 ++Count[ChainLen[B]]; in printHashHistogram()
3585 unsigned ChainLen = Chain.size(); in vectorizeStoreChain() local3586 DEBUG(dbgs() << "SLP: Analyzing a store chain of length " << ChainLen in vectorizeStoreChain()3599 for (unsigned i = 0, e = ChainLen; i < e; ++i) { in vectorizeStoreChain()