diff --git a/llvm/test/Transforms/InstCombine/icmp-not-bool-constant.ll b/llvm/test/Transforms/InstCombine/icmp-not-bool-constant.ll new file mode 100644 --- /dev/null +++ b/llvm/test/Transforms/InstCombine/icmp-not-bool-constant.ll @@ -0,0 +1,192 @@ +; NOTE: Assertions have been autogenerated by utils/update_test_checks.py +; RUN: opt < %s -instcombine -S | FileCheck %s + +; Test all integer predicates with bool types and true/false constants, +; with not on LHS (icmp pred (xor X, true), true|false). +; Use vectors to provide test coverage that is not duplicated in other folds. + +define <2 x i1> @eq_t_not(<2 x i1> %a) { +; CHECK-LABEL: @eq_t_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: ret <2 x i1> [[NOT]] +; + %not = xor <2 x i1> %a, + %r = icmp eq <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @eq_f_not(<2 x i1> %a) { +; CHECK-LABEL: @eq_f_not( +; CHECK-NEXT: ret <2 x i1> [[A:%.*]] +; + %not = xor <2 x i1> %a, + %r = icmp eq <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ne_t_not(<2 x i1> %a) { +; CHECK-LABEL: @ne_t_not( +; CHECK-NEXT: ret <2 x i1> [[A:%.*]] +; + %not = xor <2 x i1> %a, + %r = icmp ne <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ne_f_not(<2 x i1> %a) { +; CHECK-LABEL: @ne_f_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: ret <2 x i1> [[NOT]] +; + %not = xor <2 x i1> %a, + %r = icmp ne <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ugt_t_not(<2 x i1> %a) { +; CHECK-LABEL: @ugt_t_not( +; CHECK-NEXT: ret <2 x i1> zeroinitializer +; + %not = xor <2 x i1> %a, + %r = icmp ugt <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ugt_f_not(<2 x i1> %a) { +; CHECK-LABEL: @ugt_f_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: ret <2 x i1> [[NOT]] +; + %not = xor <2 x i1> %a, + %r = icmp ugt <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ult_t_not(<2 x i1> %a) { +; CHECK-LABEL: @ult_t_not( +; CHECK-NEXT: ret <2 x i1> [[A:%.*]] +; + %not = xor <2 x i1> %a, + %r = icmp ult <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ult_f_not(<2 x i1> %a) { +; CHECK-LABEL: @ult_f_not( +; CHECK-NEXT: ret <2 x i1> zeroinitializer +; + %not = xor <2 x i1> %a, + %r = icmp ult <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @sgt_t_not(<2 x i1> %a) { +; CHECK-LABEL: @sgt_t_not( +; CHECK-NEXT: ret <2 x i1> [[A:%.*]] +; + %not = xor <2 x i1> %a, + %r = icmp sgt <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @sgt_f_not(<2 x i1> %a) { +; CHECK-LABEL: @sgt_f_not( +; CHECK-NEXT: ret <2 x i1> zeroinitializer +; + %not = xor <2 x i1> %a, + %r = icmp sgt <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @slt_t_not(<2 x i1> %a) { +; CHECK-LABEL: @slt_t_not( +; CHECK-NEXT: ret <2 x i1> zeroinitializer +; + %not = xor <2 x i1> %a, + %r = icmp slt <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @slt_f_not(<2 x i1> %a) { +; CHECK-LABEL: @slt_f_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: ret <2 x i1> [[NOT]] +; + %not = xor <2 x i1> %a, + %r = icmp slt <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @uge_t_not(<2 x i1> %a) { +; CHECK-LABEL: @uge_t_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: ret <2 x i1> [[NOT]] +; + %not = xor <2 x i1> %a, + %r = icmp uge <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @uge_f_not(<2 x i1> %a) { +; CHECK-LABEL: @uge_f_not( +; CHECK-NEXT: ret <2 x i1> +; + %not = xor <2 x i1> %a, + %r = icmp uge <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ule_t_not(<2 x i1> %a) { +; CHECK-LABEL: @ule_t_not( +; CHECK-NEXT: ret <2 x i1> +; + %not = xor <2 x i1> %a, + %r = icmp ule <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ule_f_not(<2 x i1> %a) { +; CHECK-LABEL: @ule_f_not( +; CHECK-NEXT: ret <2 x i1> [[A:%.*]] +; + %not = xor <2 x i1> %a, + %r = icmp ule <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @sge_t_not(<2 x i1> %a) { +; CHECK-LABEL: @sge_t_not( +; CHECK-NEXT: ret <2 x i1> +; + %not = xor <2 x i1> %a, + %r = icmp sge <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @sge_f_not(<2 x i1> %a) { +; CHECK-LABEL: @sge_f_not( +; CHECK-NEXT: ret <2 x i1> [[A:%.*]] +; + %not = xor <2 x i1> %a, + %r = icmp sge <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @sle_t_not(<2 x i1> %a) { +; CHECK-LABEL: @sle_t_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: ret <2 x i1> [[NOT]] +; + %not = xor <2 x i1> %a, + %r = icmp sle <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @sle_f_not(<2 x i1> %a) { +; CHECK-LABEL: @sle_f_not( +; CHECK-NEXT: ret <2 x i1> +; + %not = xor <2 x i1> %a, + %r = icmp sle <2 x i1> %not, + ret <2 x i1> %r +} diff --git a/llvm/test/Transforms/InstSimplify/icmp-not-bool-constant.ll b/llvm/test/Transforms/InstSimplify/icmp-not-bool-constant.ll new file mode 100644 --- /dev/null +++ b/llvm/test/Transforms/InstSimplify/icmp-not-bool-constant.ll @@ -0,0 +1,204 @@ +; NOTE: Assertions have been autogenerated by utils/update_test_checks.py +; RUN: opt < %s -instsimplify -S | FileCheck %s + +; Test all integer predicates with bool types and true/false constants, +; with not on LHS (icmp pred (xor X, true), true|false). +; Use vectors to provide test coverage that is not duplicated in other folds. + +define <2 x i1> @eq_t_not(<2 x i1> %a) { +; CHECK-LABEL: @eq_t_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: ret <2 x i1> [[NOT]] +; + %not = xor <2 x i1> %a, + %r = icmp eq <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @eq_f_not(<2 x i1> %a) { +; CHECK-LABEL: @eq_f_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: [[R:%.*]] = icmp eq <2 x i1> [[NOT]], zeroinitializer +; CHECK-NEXT: ret <2 x i1> [[R]] +; + %not = xor <2 x i1> %a, + %r = icmp eq <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ne_t_not(<2 x i1> %a) { +; CHECK-LABEL: @ne_t_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: [[R:%.*]] = icmp ne <2 x i1> [[NOT]], +; CHECK-NEXT: ret <2 x i1> [[R]] +; + %not = xor <2 x i1> %a, + %r = icmp ne <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ne_f_not(<2 x i1> %a) { +; CHECK-LABEL: @ne_f_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: ret <2 x i1> [[NOT]] +; + %not = xor <2 x i1> %a, + %r = icmp ne <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ugt_t_not(<2 x i1> %a) { +; CHECK-LABEL: @ugt_t_not( +; CHECK-NEXT: ret <2 x i1> zeroinitializer +; + %not = xor <2 x i1> %a, + %r = icmp ugt <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ugt_f_not(<2 x i1> %a) { +; CHECK-LABEL: @ugt_f_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: ret <2 x i1> [[NOT]] +; + %not = xor <2 x i1> %a, + %r = icmp ugt <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ult_t_not(<2 x i1> %a) { +; CHECK-LABEL: @ult_t_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: [[R:%.*]] = icmp ult <2 x i1> [[NOT]], +; CHECK-NEXT: ret <2 x i1> [[R]] +; + %not = xor <2 x i1> %a, + %r = icmp ult <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ult_f_not(<2 x i1> %a) { +; CHECK-LABEL: @ult_f_not( +; CHECK-NEXT: ret <2 x i1> zeroinitializer +; + %not = xor <2 x i1> %a, + %r = icmp ult <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @sgt_t_not(<2 x i1> %a) { +; CHECK-LABEL: @sgt_t_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: [[R:%.*]] = icmp sgt <2 x i1> [[NOT]], +; CHECK-NEXT: ret <2 x i1> [[R]] +; + %not = xor <2 x i1> %a, + %r = icmp sgt <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @sgt_f_not(<2 x i1> %a) { +; CHECK-LABEL: @sgt_f_not( +; CHECK-NEXT: ret <2 x i1> zeroinitializer +; + %not = xor <2 x i1> %a, + %r = icmp sgt <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @slt_t_not(<2 x i1> %a) { +; CHECK-LABEL: @slt_t_not( +; CHECK-NEXT: ret <2 x i1> zeroinitializer +; + %not = xor <2 x i1> %a, + %r = icmp slt <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @slt_f_not(<2 x i1> %a) { +; CHECK-LABEL: @slt_f_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: ret <2 x i1> [[NOT]] +; + %not = xor <2 x i1> %a, + %r = icmp slt <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @uge_t_not(<2 x i1> %a) { +; CHECK-LABEL: @uge_t_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: ret <2 x i1> [[NOT]] +; + %not = xor <2 x i1> %a, + %r = icmp uge <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @uge_f_not(<2 x i1> %a) { +; CHECK-LABEL: @uge_f_not( +; CHECK-NEXT: ret <2 x i1> +; + %not = xor <2 x i1> %a, + %r = icmp uge <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ule_t_not(<2 x i1> %a) { +; CHECK-LABEL: @ule_t_not( +; CHECK-NEXT: ret <2 x i1> +; + %not = xor <2 x i1> %a, + %r = icmp ule <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @ule_f_not(<2 x i1> %a) { +; CHECK-LABEL: @ule_f_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: [[R:%.*]] = icmp ule <2 x i1> [[NOT]], zeroinitializer +; CHECK-NEXT: ret <2 x i1> [[R]] +; + %not = xor <2 x i1> %a, + %r = icmp ule <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @sge_t_not(<2 x i1> %a) { +; CHECK-LABEL: @sge_t_not( +; CHECK-NEXT: ret <2 x i1> +; + %not = xor <2 x i1> %a, + %r = icmp sge <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @sge_f_not(<2 x i1> %a) { +; CHECK-LABEL: @sge_f_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: [[R:%.*]] = icmp sge <2 x i1> [[NOT]], zeroinitializer +; CHECK-NEXT: ret <2 x i1> [[R]] +; + %not = xor <2 x i1> %a, + %r = icmp sge <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @sle_t_not(<2 x i1> %a) { +; CHECK-LABEL: @sle_t_not( +; CHECK-NEXT: [[NOT:%.*]] = xor <2 x i1> [[A:%.*]], +; CHECK-NEXT: ret <2 x i1> [[NOT]] +; + %not = xor <2 x i1> %a, + %r = icmp sle <2 x i1> %not, + ret <2 x i1> %r +} + +define <2 x i1> @sle_f_not(<2 x i1> %a) { +; CHECK-LABEL: @sle_f_not( +; CHECK-NEXT: ret <2 x i1> +; + %not = xor <2 x i1> %a, + %r = icmp sle <2 x i1> %not, + ret <2 x i1> %r +}