Home
last modified time | relevance | path

Searched refs:ConsecutiveChain (Results 1 – 3 of 3) sorted by relevance

/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
H A DLoadStoreVectorizer.cpp924 int ConsecutiveChain[64]; in vectorizeInstructions() local
929 ConsecutiveChain[i] = -1; in vectorizeInstructions()
935 if (ConsecutiveChain[i] != -1) { in vectorizeInstructions()
936 int CurDistance = std::abs(ConsecutiveChain[i] - i); in vectorizeInstructions()
937 int NewDistance = std::abs(ConsecutiveChain[i] - j); in vectorizeInstructions()
944 ConsecutiveChain[i] = j; in vectorizeInstructions()
974 I = ConsecutiveChain[I]; in vectorizeInstructions()
H A DSLPVectorizer.cpp6618 SmallVector<std::pair<int, int>, 16> ConsecutiveChain( in vectorizeStores() local
6624 &ConsecutiveChain](int K, int Idx) { in vectorizeStores()
6628 return ConsecutiveChain[K].second == 1 && in vectorizeStores()
6629 ConsecutiveChain[K].first == Idx; in vectorizeStores()
6640 if (ConsecutiveChain[Idx].second > -Val) { in vectorizeStores()
6642 ConsecutiveChain[Idx] = std::make_pair(K, -Val); in vectorizeStores()
6646 if (ConsecutiveChain[K].second <= Val) in vectorizeStores()
6650 ConsecutiveChain[K] = std::make_pair(Idx, Val); in vectorizeStores()
6674 if (ConsecutiveChain[I].first == E || Tails.test(I)) in vectorizeStores()
6683 if (ConsecutiveChain[I].second != 1) { in vectorizeStores()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
H A DLoopIdiomRecognize.cpp661 SmallDenseMap<StoreInst *, StoreInst *> ConsecutiveChain; in processLoopStores() local
740 ConsecutiveChain[SL[i]] = SL[k]; in processLoopStores()
773 I = ConsecutiveChain[I]; in processLoopStores()