Lines Matching defs:undef
638 static OpRef undef(MVT Ty) { return OpRef(Undef | Ty.SimpleTy); }
644 // If the 31st bit is 1, it's undef, otherwise, bits 28..0 are the
725 OS << "undef";
1051 // Check if the second half of the mask is all-undef.
1083 // If an output segment only has undef elements, the value will be ~0u.
1115 assert(S != ~0u && "Unexpected undef");
1321 return OpRef::undef(Ty);
1329 // on the first two (non-undef) entries in the segment map.
1365 // Seg0 should not be undef here: this would imply a SegList
1455 Vb = OpRef::undef(Ty);
1508 return OpRef::undef(getPairVT(MVT::i8));
1519 OpRef Out[2] = { OpRef::undef(HalfTy), OpRef::undef(HalfTy) };
1572 return OpRef::undef(getSingleVT(MVT::i8));
1609 return OpRef::undef(getSingleVT(MVT::i8));
1647 return OpRef::undef(getPairVT(MVT::i8));
1665 // is all-undef) may produce a perfect shuffle that generates legitimate
1687 return OpRef::undef(getPairVT(MVT::i8));
2455 // this is done by using an "undef" vector as the second input.
2477 OpRef Arg = HavePairs ? Va : concats(Va, OpRef::undef(SingleTy), Results);
2630 // If the mask is all -1's, generate "undef".
2641 OpRef Va = OpRef::undef(ResTy);
2642 OpRef Vb = OpRef::undef(ResTy);
2752 // Idx as a (non-undef) element of the top level shuffle's mask, that
2797 // The second half of the result will be all-undef.
2801 // FoldedShuffle = (Shuffle Inp, undef, FoldedMask)