return X;
break;
case Intrinsic::ctpop: {
+ // ctpop(X) -> 1 iff X is non-zero power of 2.
+ if (isKnownToBeAPowerOfTwo(Op0, Q.DL, /*OrZero*/ false, 0, Q.AC, Q.CxtI,
+ Q.DT))
+ return ConstantInt::get(Op0->getType(), 1);
// If everything but the lowest bit is zero, that bit is the pop-count. Ex:
// ctpop(and X, 1) --> and X, 1
unsigned BitWidth = Op0->getType()->getScalarSizeInBits();
define i64 @ctpop_1_shl(i64 %x) {
; CHECK-LABEL: @ctpop_1_shl(
-; CHECK-NEXT: [[V:%.*]] = shl i64 1, [[X:%.*]]
-; CHECK-NEXT: [[CNT:%.*]] = call i64 @llvm.ctpop.i64(i64 [[V]])
-; CHECK-NEXT: ret i64 [[CNT]]
+; CHECK-NEXT: ret i64 1
;
%v = shl i64 1, %x
%cnt = call i64 @llvm.ctpop.i64(i64 %v)
define i32 @ctpop_imin_lshr(i32 %x) {
; CHECK-LABEL: @ctpop_imin_lshr(
-; CHECK-NEXT: [[V:%.*]] = lshr i32 -2147483648, [[X:%.*]]
-; CHECK-NEXT: [[CNT:%.*]] = call i32 @llvm.ctpop.i32(i32 [[V]])
-; CHECK-NEXT: ret i32 [[CNT]]
+; CHECK-NEXT: ret i32 1
;
%v = lshr i32 2147483648, %x
%cnt = call i32 @llvm.ctpop.i32(i32 %v)
define <2 x i32> @ctpop_shl1_vec(<2 x i32> %x) {
; CHECK-LABEL: @ctpop_shl1_vec(
-; CHECK-NEXT: [[SHL:%.*]] = shl <2 x i32> <i32 1, i32 1>, [[X:%.*]]
-; CHECK-NEXT: [[CNT:%.*]] = call <2 x i32> @llvm.ctpop.v2i32(<2 x i32> [[SHL]])
-; CHECK-NEXT: ret <2 x i32> [[CNT]]
+; CHECK-NEXT: ret <2 x i32> <i32 1, i32 1>
;
%shl = shl <2 x i32> <i32 1 ,i32 1>, %x
%cnt = call <2 x i32> @llvm.ctpop.v2i32(<2 x i32> %shl)
define <2 x i32> @ctpop_lshr_intmin_vec(<2 x i32> %x) {
; CHECK-LABEL: @ctpop_lshr_intmin_vec(
-; CHECK-NEXT: [[SHR:%.*]] = lshr <2 x i32> <i32 -2147483648, i32 -2147483648>, [[X:%.*]]
-; CHECK-NEXT: [[CNT:%.*]] = call <2 x i32> @llvm.ctpop.v2i32(<2 x i32> [[SHR]])
-; CHECK-NEXT: ret <2 x i32> [[CNT]]
+; CHECK-NEXT: ret <2 x i32> <i32 1, i32 1>
;
%shr = lshr <2 x i32> <i32 2147483648 ,i32 2147483648>, %x
%cnt = call <2 x i32> @llvm.ctpop.v2i32(<2 x i32> %shr)