2241         if (VL.size() == ReuseShuffleIndices.size()) {  in isSame()
2242           ::addMask(Mask, ReuseShuffleIndices);  in isSame()
2247       return IsSame(Scalars, ReuseShuffleIndices);  in isSame()
2276       if (!ReuseShuffleIndices.empty())  in getVectorFactor()
2277         return ReuseShuffleIndices.size();  in getVectorFactor()
2294     SmallVector<int, 4> ReuseShuffleIndices;  member
2431       if (!ReuseShuffleIndices.empty()) {  in findLaneForValue()
2432         FoundLane = std::distance(ReuseShuffleIndices.begin(),  in findLaneForValue()
2433                                   find(ReuseShuffleIndices, FoundLane));  in findLaneForValue()
2478       if (ReuseShuffleIndices.empty())  in dump()
2481         for (int ReuseIdx : ReuseShuffleIndices)  in dump()
2514                           ArrayRef<int> ReuseShuffleIndices = None,  in newTreeEntry()  argument
2519                         ReuseShuffleIndices, ReorderIndices);  in newTreeEntry()
2527                           ArrayRef<int> ReuseShuffleIndices = None,  in newTreeEntry()  argument
2536     Last->ReuseShuffleIndices.append(ReuseShuffleIndices.begin(),  in newTreeEntry()
2537                                      ReuseShuffleIndices.end());  in newTreeEntry()
3663   if (!TE.ReuseShuffleIndices.empty())  in getReorderingData()
3806       if (!OpTE->ReuseShuffleIndices.empty())  in reorderTopToBottom()
3875         if (TE->ReuseShuffleIndices.size() == VF) {  in reorderTopToBottom()
3888           reorderReuses(TE->ReuseShuffleIndices, Mask);  in reorderTopToBottom()
3908       if (!TE->ReuseShuffleIndices.empty()) {  in reorderTopToBottom()
3915         addMask(NewReuses, TE->ReuseShuffleIndices);  in reorderTopToBottom()
3916         TE->ReuseShuffleIndices.swap(NewReuses);  in reorderTopToBottom()
3945       if (TE->State != TreeEntry::Vectorize && TE->ReuseShuffleIndices.empty())  in canReorderOperands()
4007           TE->UserTreeIndices.empty() || !TE->ReuseShuffleIndices.empty() ||  in reorderBottomToTop()
4060         if (!OpTE->ReuseShuffleIndices.empty())  in reorderBottomToTop()
4090           if (!TE->ReorderIndices.empty() || !TE->ReuseShuffleIndices.empty() ||  in reorderBottomToTop()
4168         if (TE->ReuseShuffleIndices.size() == BestOrder.size()) {  in reorderBottomToTop()
4170           reorderReuses(TE->ReuseShuffleIndices, Mask);  in reorderBottomToTop()
4187         if (!Gather->ReuseShuffleIndices.empty()) {  in reorderBottomToTop()
4189           reorderReuses(Gather->ReuseShuffleIndices, Mask);  in reorderBottomToTop()
4206         if (Data.first->ReuseShuffleIndices.empty() &&  in reorderBottomToTop()
4220       VectorizableTree.front()->ReuseShuffleIndices.empty())  in reorderBottomToTop()
5833   bool NeedToShuffleReuses = !E->ReuseShuffleIndices.empty();  in getEntryCost()
5936                                   FinalVecTy, E->ReuseShuffleIndices);  in getEntryCost()
5944         ::addMask(Mask, E->ReuseShuffleIndices);  in getEntryCost()
5969                                       FinalVecTy, E->ReuseShuffleIndices);  in getEntryCost()
5985           TTI::SK_PermuteSingleSrc, FinalVecTy, E->ReuseShuffleIndices);  in getEntryCost()
6089     ::addMask(Mask, E->ReuseShuffleIndices);  in getEntryCost()
6114         for (unsigned I : E->ReuseShuffleIndices) {  in getEntryCost()
6169       assert(E->ReuseShuffleIndices.empty() &&  in getEntryCost()
6522         for (unsigned Idx : E->ReuseShuffleIndices) {  in getEntryCost()
6585       if (E->ReuseShuffleIndices.empty()) {  in getEntryCost()
6591             E->Scalars, E->ReorderIndices, E->ReuseShuffleIndices,  in getEntryCost()
7710           if (!E->ReuseShuffleIndices.empty()) {  in vectorizeTree()
7732             for (int Idx : E->ReuseShuffleIndices) {  in vectorizeTree()
7834   bool NeedToShuffleReuses = !E->ReuseShuffleIndices.empty();  in vectorizeTree()
7859       ShuffleBuilder.addMask(E->ReuseShuffleIndices);  in vectorizeTree()
7895       ShuffleBuilder.addMask(E->ReuseShuffleIndices);  in vectorizeTree()
7928       ShuffleBuilder.addMask(E->ReuseShuffleIndices);  in vectorizeTree()
7941       ShuffleBuilder.addMask(E->ReuseShuffleIndices);  in vectorizeTree()
7947       assert(E->ReuseShuffleIndices.empty() && "All inserts should be unique");  in vectorizeTree()
8036       ShuffleBuilder.addMask(E->ReuseShuffleIndices);  in vectorizeTree()
8059       ShuffleBuilder.addMask(E->ReuseShuffleIndices);  in vectorizeTree()
8080       ShuffleBuilder.addMask(E->ReuseShuffleIndices);  in vectorizeTree()
8104       ShuffleBuilder.addMask(E->ReuseShuffleIndices);  in vectorizeTree()
8148       ShuffleBuilder.addMask(E->ReuseShuffleIndices);  in vectorizeTree()
8191       ShuffleBuilder.addMask(E->ReuseShuffleIndices);  in vectorizeTree()
8253       ShuffleBuilder.addMask(E->ReuseShuffleIndices);  in vectorizeTree()
8328       ShuffleBuilder.addMask(E->ReuseShuffleIndices);  in vectorizeTree()
8391           E->Scalars, E->ReorderIndices, E->ReuseShuffleIndices,  in vectorizeTree()