diff options
| author | Philip Reames <listmail@philipreames.com> | 2018-08-30 00:03:02 +0000 |
|---|---|---|
| committer | Philip Reames <listmail@philipreames.com> | 2018-08-30 00:03:02 +0000 |
| commit | 6bd16b58501b4026eb817d689356428facfec3b0 (patch) | |
| tree | a72947f4a5872343af60210103d1cd36fda84092 /llvm/test | |
| parent | 32a8a2028cb7597cda42eca33dd15860d661f357 (diff) | |
| download | bcm5719-llvm-6bd16b58501b4026eb817d689356428facfec3b0.tar.gz bcm5719-llvm-6bd16b58501b4026eb817d689356428facfec3b0.zip | |
[SimplifyCFG] Fix a cost modeling oversight in branch commoning
The cost modeling was not accounting for the fact we were duplicating the instruction once per predecessor. With a default threshold of 1, this meant we were actually creating #pred copies.
Adding to the fun, there is *absolutely no* test coverage for this. Simply bailing for more than one predecessor passes all checked in tests.
llvm-svn: 341001
Diffstat (limited to 'llvm/test')
| -rw-r--r-- | llvm/test/Transforms/SimplifyCFG/branch-fold-threshold.ll | 52 |
1 files changed, 52 insertions, 0 deletions
diff --git a/llvm/test/Transforms/SimplifyCFG/branch-fold-threshold.ll b/llvm/test/Transforms/SimplifyCFG/branch-fold-threshold.ll index fad5fce1d4b..7b564955856 100644 --- a/llvm/test/Transforms/SimplifyCFG/branch-fold-threshold.ll +++ b/llvm/test/Transforms/SimplifyCFG/branch-fold-threshold.ll @@ -1,5 +1,6 @@ ; RUN: opt %s -simplifycfg -S | FileCheck %s --check-prefix=NORMAL ; RUN: opt %s -simplifycfg -S -bonus-inst-threshold=2 | FileCheck %s --check-prefix=AGGRESSIVE +; RUN: opt %s -simplifycfg -S -bonus-inst-threshold=4 | FileCheck %s --check-prefix=WAYAGGRESSIVE define i32 @foo(i32 %a, i32 %b, i32 %c, i32 %d, i32* %input) { ; NORMAL-LABEL: @foo( @@ -26,3 +27,54 @@ cond.end: %cond = phi i32 [ %0, %cond.false ], [ 0, %lor.lhs.false ], [ 0, %entry ] ret i32 %cond } + +declare void @distinct_a(); +declare void @distinct_b(); + +;; Like foo, but have to duplicate into multiple predecessors +define i32 @bar(i32 %a, i32 %b, i32 %c, i32 %d, i32* %input) { +; NORMAL-LABEL: @bar( +; AGGRESSIVE-LABEL: @bar( +entry: + %cmp_split = icmp slt i32 %d, %b + %cmp = icmp sgt i32 %d, 3 + br i1 %cmp_split, label %pred_a, label %pred_b +pred_a: +; NORMAL-LABEL: pred_a: +; AGGRESSIVE-LABEL: pred_a: +; WAYAGGRESSIVE-LABEL: pred_a: +; NORMAL: br i1 +; AGGRESSIVE: br i1 +; WAYAGGRESSIVE: br i1 + call void @distinct_a(); + br i1 %cmp, label %cond.end, label %lor.lhs.false +pred_b: +; NORMAL-LABEL: pred_b: +; AGGRESSIVE-LABEL: pred_b: +; WAYAGGRESSIVE-LABEL: pred_b: +; NORMAL: br i1 +; AGGRESSIVE: br i1 +; WAYAGGRESSIVE: br i1 + call void @distinct_b(); + br i1 %cmp, label %cond.end, label %lor.lhs.false + +lor.lhs.false: + %mul = shl i32 %c, 1 + %add = add nsw i32 %mul, %a + %cmp1 = icmp slt i32 %add, %b + br i1 %cmp1, label %cond.false, label %cond.end +; NORMAL-LABEL: lor.lhs.false: +; AGGRESIVE-LABEL: lor.lhs.false: +; WAYAGGRESIVE-LABEL: lor.lhs.false: +; NORMAL: br i1 +; AGGRESSIVE: br i1 +; WAYAGGRESSIVE-NOT: br i1 + +cond.false: + %0 = load i32, i32* %input, align 4 + br label %cond.end + +cond.end: + %cond = phi i32 [ %0, %cond.false ], [ 0, %lor.lhs.false ],[ 0, %pred_a ],[ 0, %pred_b ] + ret i32 %cond +} |

