Target/X86/X86ISelLowering.cpp

5448     int M1 = Mask[i + 1];
5451     if (M0 == SM_SentinelUndef && M1 == SM_SentinelUndef) {
5458     if (M0 == SM_SentinelUndef && M1 >= 0 && (M1 % 2) == 1) {
5459       WidenedMask[i / 2] = M1 / 2;
5462     if (M1 == SM_SentinelUndef && M0 >= 0 && (M0 % 2) == 0) {
5468     if (M0 == SM_SentinelZero || M1 == SM_SentinelZero) {
5470           (M1 == SM_SentinelZero || M1 == SM_SentinelUndef)) {
5479     if (M0 != SM_SentinelUndef && (M0 % 2) == 0 && (M0 + 1) == M1) {
10829     int M1 = TargetMask[i + 0];
10831     Undef1 &= (SM_SentinelUndef == M1);
10833     Zero1 &= isUndefOrZero(M1);
11472       int M1 = Mask[Lane + Elt + 1];
11473       if (0 <= M0 && 0 <= M1 &&
11474           (M0 % NumHalfLaneElts) != (M1 % NumHalfLaneElts))
11478       if (0 <= M1)
11479         PermuteMask[Lane + Elt + 1] = Lane + (2 * (M1 % NumHalfLaneElts)) + 1;
13665       int M1 = Mask[2 * DWord + 1];
13667       M1 = (M1 >= 0 ? M1 % 4 : M1);
13668       if (M0 < 0 && M1 < 0)
13675             (M1 < 0 || isUndefOrEqual(DWordPair.second, M1))) {
13677           DWordPair.second = (M1 >= 0 ? M1 : DWordPair.second);
13685         DWordPairs.push_back(std::make_pair(M0, M1));
15204     auto MatchMasks = [](ArrayRef<int> M1, ArrayRef<int> M2) {
15205       assert(M1.size() == M2.size() && "Unexpected mask size");
15206       for (int i = 0, e = M1.size(); i != e; ++i)
15207         if (M1[i] >= 0 && M2[i] >= 0 && M1[i] != M2[i])
15641       auto MatchMasks = [NumSubLaneElts](ArrayRef<int> M1, ArrayRef<int> M2) {
15643           if (M1[i] < 0 || M2[i] < 0)
15645           if (M1[i] != M2[i])
33295         int M1 = RepeatedMask[Offset + 1];
33301           S1 = (SM_SentinelUndef == M1 ? -1 : 1);
33303         } else if (isUndefOrInRange(M0, 0, 4) && isUndefOrInRange(M1, 0, 4)) {
33305           S1 = (SM_SentinelUndef == M1 ? -1 : M1 & 3);
33307         } else if (isUndefOrInRange(M0, 4, 8) && isUndefOrInRange(M1, 4, 8)) {
33309           S1 = (SM_SentinelUndef == M1 ? -1 : M1 & 3);