Searched refs:ConsecutiveChain (Results 1 – 3 of 3) sorted by relevance
930 int ConsecutiveChain[64]; in vectorizeInstructions() local935 ConsecutiveChain[i] = -1; in vectorizeInstructions()941 if (ConsecutiveChain[i] != -1) { in vectorizeInstructions()942 int CurDistance = std::abs(ConsecutiveChain[i] - i); in vectorizeInstructions()943 int NewDistance = std::abs(ConsecutiveChain[i] - j); in vectorizeInstructions()950 ConsecutiveChain[i] = j; in vectorizeInstructions()980 I = ConsecutiveChain[I]; in vectorizeInstructions()
10126 return ConsecutiveChain[K].second == 1 && in vectorizeStores()10127 ConsecutiveChain[K].first == Idx; in vectorizeStores()10139 if (ConsecutiveChain[Idx].second > -Val) { in vectorizeStores()10145 if (ConsecutiveChain[K].second <= Val) in vectorizeStores()10149 ConsecutiveChain[K] = std::make_pair(Idx, Val); in vectorizeStores()10182 if (ConsecutiveChain[I].second != 1) { in vectorizeStores()10185 if (ConsecutiveChain[I].first != E && in vectorizeStores()10189 Tails.reset(ConsecutiveChain[I].first); in vectorizeStores()10190 if (Cnt < ConsecutiveChain[I].first + 2) in vectorizeStores()10191 Cnt = ConsecutiveChain[I].first + 2; in vectorizeStores()[all …]
661 SmallDenseMap<StoreInst *, StoreInst *> ConsecutiveChain; in processLoopStores() local740 ConsecutiveChain[SL[i]] = SL[k]; in processLoopStores()770 I = ConsecutiveChain[I]; in processLoopStores()