Lines Matching refs:CurrentOrder
1399 /// vector) and sets \p CurrentOrder to the identity permutation; otherwise
1400 /// returns false, setting \p CurrentOrder to either an empty vector or a
1403 SmallVectorImpl<unsigned> &CurrentOrder) const;
2636 OrdersType CurrentOrder;
2637 bool Reuse = canReuseExtract(VL, VL0, CurrentOrder);
2650 if (!CurrentOrder.empty()) {
2654 for (unsigned Idx : CurrentOrder)
2661 NumOpsWantToKeepOrder.try_emplace(CurrentOrder).first;
2714 OrdersType CurrentOrder;
2716 if (llvm::sortPtrAccesses(PointerOps, *DL, *SE, CurrentOrder)) {
2719 if (CurrentOrder.empty()) {
2723 Ptr0 = PointerOps[CurrentOrder.front()];
2724 PtrN = PointerOps[CurrentOrder.back()];
2733 if (CurrentOrder.empty()) {
2742 auto I = NumOpsWantToKeepOrder.try_emplace(CurrentOrder).first;
2976 OrdersType CurrentOrder;
2978 if (llvm::sortPtrAccesses(PointerOps, *DL, *SE, CurrentOrder)) {
2981 if (CurrentOrder.empty()) {
2985 Ptr0 = PointerOps[CurrentOrder.front()];
2986 PtrN = PointerOps[CurrentOrder.back()];
2995 if (CurrentOrder.empty()) {
3005 auto I = NumOpsWantToKeepOrder.try_emplace(CurrentOrder).first;
3183 SmallVectorImpl<unsigned> &CurrentOrder) const {
3192 CurrentOrder.clear();
3219 // element of CurrentOrder still has value E + 1.
3220 CurrentOrder.assign(E, E + 1);
3231 if (ExtIdx >= E || CurrentOrder[ExtIdx] != E + 1)
3234 CurrentOrder[ExtIdx] = I;
3236 if (CurrentOrder[I] != E + 1)
3238 CurrentOrder[I] = I;
3242 CurrentOrder.clear();