From 3c59cdee5caabdfc7735579cb43fbb5af18b6103 Mon Sep 17 00:00:00 2001
From: Stanislav Mekhanoshin <Stanislav.Mekhanoshin@amd.com>
Date: Wed, 20 Oct 2021 12:50:23 -0700
Subject: [PATCH] Precommit updated InstCombine/and-xor-or.ll test. NFC.

---
 .../test/Transforms/InstCombine/and-xor-or.ll | 32 +++++++++++++++----
 1 file changed, 26 insertions(+), 6 deletions(-)

diff --git a/llvm/test/Transforms/InstCombine/and-xor-or.ll b/llvm/test/Transforms/InstCombine/and-xor-or.ll
index e7a4c3ab3097..ec9f335a6c90 100644
--- a/llvm/test/Transforms/InstCombine/and-xor-or.ll
+++ b/llvm/test/Transforms/InstCombine/and-xor-or.ll
@@ -555,16 +555,14 @@ define <4 x i64> @not_and_and_not_4i64(<4 x i64> %a0, <4 x i64> %b, <4 x i64> %c
 
 ; (~b & a) & ~c --> a & ~(b | c)
 
-define i32 @not_and_and_not_commute1(i32 %a0, i32 %b, i32 %c) {
+define i32 @not_and_and_not_commute1(i32 %a, i32 %b, i32 %c) {
 ; CHECK-LABEL: @not_and_and_not_commute1(
-; CHECK-NEXT:    [[A:%.*]] = sdiv i32 42, [[A0:%.*]]
 ; CHECK-NEXT:    [[NOT1:%.*]] = xor i32 [[B:%.*]], -1
 ; CHECK-NEXT:    [[NOT2:%.*]] = xor i32 [[C:%.*]], -1
-; CHECK-NEXT:    [[AND1:%.*]] = and i32 [[A]], [[NOT1]]
+; CHECK-NEXT:    [[AND1:%.*]] = and i32 [[NOT1]], [[A:%.*]]
 ; CHECK-NEXT:    [[AND2:%.*]] = and i32 [[AND1]], [[NOT2]]
 ; CHECK-NEXT:    ret i32 [[AND2]]
 ;
-  %a = sdiv i32 42, %a0 ; thwart complexity-based canonicalization
   %not1 = xor i32 %b, -1
   %not2 = xor i32 %c, -1
   %and1 = and i32 %not1, %a
@@ -574,13 +572,15 @@ define i32 @not_and_and_not_commute1(i32 %a0, i32 %b, i32 %c) {
 
 ; ~c & (a & ~b) --> a & ~(b | c)
 
-define i32 @not_and_and_not_commute2(i32 %a0, i32 %b, i32 %c) {
-; CHECK-LABEL: @not_and_and_not_commute2(
+declare void @use(i32)
+define i32 @not_and_and_not_commute2_extra_not_use(i32 %a0, i32 %b, i32 %c) {
+; CHECK-LABEL: @not_and_and_not_commute2_extra_not_use(
 ; CHECK-NEXT:    [[A:%.*]] = sdiv i32 42, [[A0:%.*]]
 ; CHECK-NEXT:    [[NOT1:%.*]] = xor i32 [[B:%.*]], -1
 ; CHECK-NEXT:    [[NOT2:%.*]] = xor i32 [[C:%.*]], -1
 ; CHECK-NEXT:    [[AND1:%.*]] = and i32 [[A]], [[NOT1]]
 ; CHECK-NEXT:    [[AND2:%.*]] = and i32 [[AND1]], [[NOT2]]
+; CHECK-NEXT:    call void @use(i32 [[NOT2]])
 ; CHECK-NEXT:    ret i32 [[AND2]]
 ;
   %a = sdiv i32 42, %a0 ; thwart complexity-based canonicalization
@@ -588,5 +588,25 @@ define i32 @not_and_and_not_commute2(i32 %a0, i32 %b, i32 %c) {
   %not2 = xor i32 %c, -1
   %and1 = and i32 %a, %not1
   %and2 = and i32 %not2, %and1
+  call void @use(i32 %not2)
+  ret i32 %and2
+}
+
+define i32 @not_and_and_not_extra_and1_use(i32 %a0, i32 %b, i32 %c) {
+; CHECK-LABEL: @not_and_and_not_extra_and1_use(
+; CHECK-NEXT:    [[A:%.*]] = sdiv i32 42, [[A0:%.*]]
+; CHECK-NEXT:    [[NOT1:%.*]] = xor i32 [[B:%.*]], -1
+; CHECK-NEXT:    [[NOT2:%.*]] = xor i32 [[C:%.*]], -1
+; CHECK-NEXT:    [[AND1:%.*]] = and i32 [[A]], [[NOT1]]
+; CHECK-NEXT:    [[AND2:%.*]] = and i32 [[AND1]], [[NOT2]]
+; CHECK-NEXT:    call void @use(i32 [[AND1]])
+; CHECK-NEXT:    ret i32 [[AND2]]
+;
+  %a = sdiv i32 42, %a0 ; thwart complexity-based canonicalization
+  %not1 = xor i32 %b, -1
+  %not2 = xor i32 %c, -1
+  %and1 = and i32 %a, %not1
+  %and2 = and i32 %and1, %not2
+  call void @use(i32 %and1)
   ret i32 %and2
 }