Searched refs:Tails (Results 1 – 3 of 3) sorted by relevance
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| H A D | LoadStoreVectorizer.cpp | 923 SmallVector<int, 16> Heads, Tails; in vectorizeInstructions() local
942 Tails.push_back(j); in vectorizeInstructions()
956 for (unsigned TIt = 0; TIt < Tails.size(); TIt++) in vectorizeInstructions()
957 if (Head == Tails[TIt] && in vectorizeInstructions()
969 while (I != -1 && (is_contained(Tails, I) || is_contained(Heads, I))) { in vectorizeInstructions()
|
| H A D | SLPVectorizer.cpp | 6616 SmallBitVector Tails(E, false); in vectorizeStores() local
6622 auto &&FindConsecutiveAccess = [this, &Stores, &Tails, &IterCnt, MaxIter, in vectorizeStores()
6641 Tails.set(K); in vectorizeStores()
6649 Tails.set(Idx); in vectorizeStores()
6674 if (ConsecutiveChain[I].first == E || Tails.test(I)) in vectorizeStores()
6682 Tails.set(I); in vectorizeStores()
6687 Tails.test(ConsecutiveChain[I].first) && !TriedTails.test(I) && in vectorizeStores()
6690 Tails.reset(ConsecutiveChain[I].first); in vectorizeStores()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | LoopIdiomRecognize.cpp | 660 SetVector<StoreInst *> Heads, Tails; in processLoopStores() local
738 Tails.insert(SL[k]); in processLoopStores()
754 if (Tails.count(*it)) in processLoopStores()
766 while (Tails.count(I) || Heads.count(I)) { in processLoopStores()
|