3853     ArrayRef<unsigned> BestOrder = OrdersUses.front().first;  in reorderTopToBottom()  local
3857         BestOrder = Pair.first;  in reorderTopToBottom()
3862     if (BestOrder.empty())  in reorderTopToBottom()
3865     inversePermutation(BestOrder, Mask);  in reorderTopToBottom()
3866     SmallVector<int> MaskOrder(BestOrder.size(), UndefMaskElem);  in reorderTopToBottom()
3867     unsigned E = BestOrder.size();  in reorderTopToBottom()
3868     transform(BestOrder, MaskOrder.begin(), [E](unsigned I) {  in reorderTopToBottom()
4138       ArrayRef<unsigned> BestOrder = OrdersUses.front().first;  in reorderBottomToTop()  local
4142           BestOrder = Pair.first;  in reorderBottomToTop()
4147       if (BestOrder.empty()) {  in reorderBottomToTop()
4157       inversePermutation(BestOrder, Mask);  in reorderBottomToTop()
4158       SmallVector<int> MaskOrder(BestOrder.size(), UndefMaskElem);  in reorderBottomToTop()
4159       unsigned E = BestOrder.size();  in reorderBottomToTop()
4160       transform(BestOrder, MaskOrder.begin(), [E](unsigned I) {  in reorderBottomToTop()
4168         if (TE->ReuseShuffleIndices.size() == BestOrder.size()) {  in reorderBottomToTop()
4176         assert((BestOrder.size() == TE->ReorderIndices.size() ||  in reorderBottomToTop()