Lines Matching defs:SV1
3008 const APInt &SV1 = N1->getConstantOperandAPInt(0);
3009 APInt NewStep = SV0 + SV1;
7872 auto *SV1 = dyn_cast<ShuffleVectorSDNode>(N1);
7873 if (SV0 && SV1 && TLI.isTypeLegal(VT)) {
7888 int M1 = SV1->getMaskElt(i);
7908 // SV0 make the index a LHS index. If it came from SV1, make it
15613 SDValue SV1 = PeekThroughBitcast(N0->getOperand(1));
15614 if (!(SV0 && SV1))
15625 TLI.buildLegalVectorShuffle(VT, SDLoc(N), SV0, SV1, NewMask, DAG);
23945 SDValue SV0 = DAG.getUNDEF(VT), SV1 = DAG.getUNDEF(VT);
23994 } else if (SV1.isUndef() || SV1 == ExtVec) {
23995 SV1 = ExtVec;
24005 DAG.getBitcast(VT, SV1), Mask, DAG);
26110 SDValue SV1 = BC0->getOperand(1);
26113 std::swap(SV0, SV1);
26120 SV1 = DAG.getBitcast(ScaleVT, SV1);
26122 VT, DAG.getVectorShuffle(ScaleVT, SDLoc(N), SV0, SV1, NewMask));
26134 // operand, and SV1 as the second operand.
26135 // i.e. Merge SVN(OtherSVN, N1) -> shuffle(SV0, SV1, Mask) iff Commute = false
26136 // Merge SVN(N1, OtherSVN) -> shuffle(SV0, SV1, Mask') iff Commute = true
26140 const TargetLowering &TLI, SDValue &SV0, SDValue &SV1,
26147 SV0 = SV1 = SDValue();
26194 if (!SV1.getNode() || SV1 == CurrentVec) {
26197 SV1 = CurrentVec;
26222 if (InnerVec == SV1) {
26245 std::swap(SV0, SV1);
26263 SDValue SV1 = N1->getOperand(1);
26265 bool IsSV1Undef = SV1.isUndef();
26266 if (HasSameOp0 || IsSV1Undef || N0 == SV1)
26296 SDValue SV0, SV1;
26299 SV0, SV1, Mask)) {
26306 SV1 ? SV1 : DAG.getUNDEF(VT), Mask);
26333 auto CanMergeInnerShuffle = [&](SDValue &SV0, SDValue &SV1,
26345 MergeInnerShuffle(Commute, SVN, SVN0, Op1, TLI, SV0, SV1,