[llvm] r371297 - [SimplifyCFG][NFC] Show that we don't consider the cost when merging cond stores

[Roman Lebedev via llvm-commits]

Author: lebedevri
Date: Sat Sep  7 02:25:26 2019
New Revision: 371297

URL: http://llvm.org/viewvc/llvm-project?rev=371297&view=rev
Log:
[SimplifyCFG][NFC] Show that we don't consider the cost when merging cond stores

We count instruction count in each BB's separately, not their cost.

Modified:
    llvm/trunk/test/Transforms/SimplifyCFG/merge-cond-stores.ll

Modified: llvm/trunk/test/Transforms/SimplifyCFG/merge-cond-stores.ll
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Transforms/SimplifyCFG/merge-cond-stores.ll?rev=371297&r1=371296&r2=371297&view=diff
==============================================================================
--- llvm/trunk/test/Transforms/SimplifyCFG/merge-cond-stores.ll (original)
+++ llvm/trunk/test/Transforms/SimplifyCFG/merge-cond-stores.ll Sat Sep  7 02:25:26 2019
@@ -415,3 +415,39 @@ end:
   ret void
 }
 
+define void @test_costly(i32* %p, i32 %a, i32 %b, i32 %c, i32 %d) {
+; CHECK-LABEL: @test_costly(
+; CHECK-NEXT:  entry:
+; CHECK-NEXT:    [[X1:%.*]] = icmp ne i32 [[A:%.*]], 0
+; CHECK-NEXT:    [[X2:%.*]] = icmp eq i32 [[B:%.*]], 0
+; CHECK-NEXT:    [[TMP0:%.*]] = xor i1 [[X2]], true
+; CHECK-NEXT:    [[TMP1:%.*]] = or i1 [[X1]], [[TMP0]]
+; CHECK-NEXT:    br i1 [[TMP1]], label [[TMP2:%.*]], label [[TMP3:%.*]]
+; CHECK:       2:
+; CHECK-NEXT:    [[VAL:%.*]] = sdiv i32 [[C:%.*]], [[D:%.*]]
+; CHECK-NEXT:    [[SPEC_SELECT:%.*]] = select i1 [[X2]], i32 0, i32 [[VAL]]
+; CHECK-NEXT:    store i32 [[SPEC_SELECT]], i32* [[P:%.*]], align 4
+; CHECK-NEXT:    br label [[TMP3]]
+; CHECK:       3:
+; CHECK-NEXT:    ret void
+;
+entry:
+  %x1 = icmp eq i32 %a, 0
+  br i1 %x1, label %fallthrough, label %yes1
+
+yes1:
+  store i32 0, i32* %p
+  br label %fallthrough
+
+fallthrough:
+  %x2 = icmp eq i32 %b, 0
+  %val = sdiv i32 %c, %d
+  br i1 %x2, label %end, label %yes2
+
+yes2:
+  store i32 %val, i32* %p
+  br label %end
+
+end:
+  ret void
+}