Searched refs:Tails (Results 1 – 5 of 5) sorted by relevance
597 SmallSetVector<int, 16> Heads, Tails; in vectorizeInstructions() local616 Tails.insert(j); in vectorizeInstructions()630 for (unsigned TIt = 0; TIt < Tails.size(); TIt++) in vectorizeInstructions()631 if (Head == Tails[TIt] && in vectorizeInstructions()643 while (I != -1 && (Tails.count(I) || Heads.count(I))) { in vectorizeInstructions()
3632 SetVector<StoreInst *> Heads, Tails; in vectorizeStores() local3657 Tails.insert(Stores[k]); in vectorizeStores()3668 if (Tails.count(*it)) in vectorizeStores()3676 while (Tails.count(I) || Heads.count(I)) { in vectorizeStores()
840 SmallVector<int, 16> Heads, Tails; in vectorizeInstructions() local859 Tails.push_back(j); in vectorizeInstructions()873 for (unsigned TIt = 0; TIt < Tails.size(); TIt++) in vectorizeInstructions()874 if (Head == Tails[TIt] && in vectorizeInstructions()886 while (I != -1 && (is_contained(Tails, I) || is_contained(Heads, I))) { in vectorizeInstructions()
511 SetVector<StoreInst *> Heads, Tails; in processLoopStores() local585 Tails.insert(SL[k]); in processLoopStores()601 if (Tails.count(*it)) in processLoopStores()613 while (Tails.count(I) || Heads.count(I)) { in processLoopStores()
580 SetVector<StoreInst *> Heads, Tails; in processLoopStores() local654 Tails.insert(SL[k]); in processLoopStores()670 if (Tails.count(*it)) in processLoopStores()682 while (Tails.count(I) || Heads.count(I)) { in processLoopStores()