Searched refs:ChainLen (Results 1 – 3 of 3) sorted by relevance
705 for (unsigned ChainLen = Chain.size(); ChainIdx < ChainLen; ++ChainIdx) { in getVectorizablePrefix() local
4683 const unsigned ChainLen = Chain.size(); in vectorizeStoreChain() local4684 LLVM_DEBUG(dbgs() << "SLP: Analyzing a store chain of length " << ChainLen in vectorizeStoreChain()4697 for (unsigned i = 0, e = ChainLen; i + VF <= e; ++i) { in vectorizeStoreChain()
3507 std::vector<size_t> ChainLen(NBucket, 0); in printHashHistogram() local3512 if (MaxChain <= ++ChainLen[B]) in printHashHistogram()3514 TotalSyms += ChainLen[B]; in printHashHistogram()3523 ++Count[ChainLen[B]]; in printHashHistogram()3553 std::vector<size_t> ChainLen(NBucket, 0); in printHashHistogram() local3563 ChainLen[B] = Len; in printHashHistogram()3573 ++Count[ChainLen[B]]; in printHashHistogram()