Lines Matching defs:Zext
879 // fold (aext (zext x)) -> (zext x)
1469 // add (sext i1), X -> sub X, (zext i1)
1474 SDValue ZExt = DAG.getNode(ISD::ZERO_EXTEND, DL, VT, N0.getOperand(0));
1475 return DAG.getNode(ISD::SUB, DL, VT, N1, ZExt);
2211 // fold (OP (zext x), (zext y)) -> (zext (OP x, y))
2302 SDValue Zext = DAG.getNode(ISD::ZERO_EXTEND, N->getDebugLoc(),
2306 CombineTo(N, Zext);
2311 CombineTo(N0.getNode(), Zext);
3003 // Look for sign/zext/any-extended or truncate cases:
3103 // fold (not (zext (setcc x, y))) -> (zext (not (setcc x, y)))
3886 // Sign bits will be lost after a zext.
4157 // fold (sext x) -> (zext x) if the sign bit is known zero.
4169 // fold (zext c1) -> c1
4172 // fold (zext (zext x)) -> (zext x)
4173 // fold (zextzext x)
4178 // fold (zext (truncate (load x))) -> (zext (smaller load x))
4179 // fold (zext (truncate (srl (load x), c))) -> (zext (small load (x+c/n)))
4193 // fold (zext (truncate x)) -> (and x, mask)
4197 // fold (zext (truncate (load x))) -> (zext (smaller load x))
4198 // fold (zext (truncate (srl (load x), c))) -> (zext (smaller load (x+c/n)))
4220 // Fold (zext (and (trunc x), cst)) -> (and x, cst),
4235 Mask = Mask.zext(VT.getSizeInBits());
4240 // fold (zext (load x)) -> (zext (truncate (zextload x)))
4270 // fold (zext (and/or/xor (load x), cst)) ->
4271 // (and/or/xor (zextload x), (zext cst))
4294 Mask = Mask.zext(VT.getSizeInBits());
4309 // fold (zext (zextload x)) -> (zext (truncate (zextload x)))
4310 // fold (zext ( extload x)) -> (zext (truncate (zextload x)))
4334 // zext(setcc) -> (and (vsetcc), (1, 1, ...) for vectors.
4372 // zext(setcc x,y,cc) -> select_cc x, y, 1, 0, cc
4380 // (zext (shl (zext x), cst)) -> (shl (zext x), cst)
4419 // fold (aext (zext x)) -> (zext x)
4445 return TruncOp; // x iff x size == zext size.
4465 Mask = Mask.zext(VT.getSizeInBits());
5179 zextOrTrunc(SrcBitSize).zext(DstBitSize);
5214 if (isS2V && i == 0 && j == 0 && ThisVal.zext(SrcBitSize) == OpVal)
7597 // If the caller doesn't want us to simplify this into a zext of a compare,