Searched refs:ConsecutiveChain (Results 1 – 3 of 3) sorted by relevance
956 int ConsecutiveChain[64]; in vectorizeInstructions() local961 ConsecutiveChain[i] = -1; in vectorizeInstructions()967 if (ConsecutiveChain[i] != -1) { in vectorizeInstructions()968 int CurDistance = std::abs(ConsecutiveChain[i] - i); in vectorizeInstructions()969 int NewDistance = std::abs(ConsecutiveChain[i] - j); in vectorizeInstructions()976 ConsecutiveChain[i] = j; in vectorizeInstructions()1006 I = ConsecutiveChain[I]; in vectorizeInstructions()
6944 return ConsecutiveChain[K].second == 1 && in vectorizeStores()6945 ConsecutiveChain[K].first == Idx; in vectorizeStores()6957 if (ConsecutiveChain[Idx].second > -Val) { in vectorizeStores()6963 if (ConsecutiveChain[K].second <= Val) in vectorizeStores()6967 ConsecutiveChain[K] = std::make_pair(Idx, Val); in vectorizeStores()7000 if (ConsecutiveChain[I].second != 1) { in vectorizeStores()7003 if (ConsecutiveChain[I].first != E && in vectorizeStores()7007 Tails.reset(ConsecutiveChain[I].first); in vectorizeStores()7008 if (Cnt < ConsecutiveChain[I].first + 2) in vectorizeStores()7009 Cnt = ConsecutiveChain[I].first + 2; in vectorizeStores()[all …]
662 SmallDenseMap<StoreInst *, StoreInst *> ConsecutiveChain; in processLoopStores() local741 ConsecutiveChain[SL[i]] = SL[k]; in processLoopStores()774 I = ConsecutiveChain[I]; in processLoopStores()