Searched refs:Tails (Results 1 – 3 of 3) sorted by relevance
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoadStoreVectorizer.cpp | 955 SmallVector<int, 16> Heads, Tails; in vectorizeInstructions() local
974 Tails.push_back(j); in vectorizeInstructions()
988 for (unsigned TIt = 0; TIt < Tails.size(); TIt++) in vectorizeInstructions()
989 if (Head == Tails[TIt] && in vectorizeInstructions()
1001 while (I != -1 && (is_contained(Tails, I) || is_contained(Heads, I))) { in vectorizeInstructions()
|
| H A D | SLPVectorizer.cpp | 6932 SmallBitVector Tails(E, false); in vectorizeStores() local
6938 auto &&FindConsecutiveAccess = [this, &Stores, &Tails, &IterCnt, MaxIter, in vectorizeStores()
6958 Tails.set(K); in vectorizeStores()
6966 Tails.set(Idx); in vectorizeStores()
6991 if (ConsecutiveChain[I].first == E || Tails.test(I)) in vectorizeStores()
6999 Tails.set(I); in vectorizeStores()
7004 Tails.test(ConsecutiveChain[I].first) && !TriedTails.test(I) && in vectorizeStores()
7007 Tails.reset(ConsecutiveChain[I].first); in vectorizeStores()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopIdiomRecognize.cpp | 661 SetVector<StoreInst *> Heads, Tails; in processLoopStores() local
739 Tails.insert(SL[k]); in processLoopStores()
755 if (Tails.count(*it)) in processLoopStores()
767 while (Tails.count(I) || Heads.count(I)) { in processLoopStores()
|