summaryrefslogtreecommitdiffstats
path: root/llvm/test/Analysis/BranchProbabilityInfo/basic.ll
diff options
context:
space:
mode:
authorDaniel Jasper <djasper@google.com>2015-04-15 06:24:07 +0000
committerDaniel Jasper <djasper@google.com>2015-04-15 06:24:07 +0000
commita73f3d51accba740a2b94ae2ebe2e0a843398172 (patch)
tree01c8fccb78654f238ba21ec9b94fbebcdc383e0c /llvm/test/Analysis/BranchProbabilityInfo/basic.ll
parent69c62a9bdbd81a3a2b48715aa1589d53c0d1fbc8 (diff)
downloadbcm5719-llvm-a73f3d51accba740a2b94ae2ebe2e0a843398172.tar.gz
bcm5719-llvm-a73f3d51accba740a2b94ae2ebe2e0a843398172.zip
Re-apply r234898 and fix tests.
This commit makes LLVM not estimate branch probabilities when doing a single bit bitmask tests. The code that originally made me discover this is: if ((a & 0x1) == 0x1) { .. } In this case we don't actually have any branch probability information and should not assume to have any. LLVM transforms this into: %and = and i32 %a, 1 %tobool = icmp eq i32 %and, 0 So, in this case, the result of a bitwise and is compared against 0, but nevertheless, we should not assume to have probability information. CodeGen/ARM/2013-10-11-select-stalls.ll started failing because the changed probabilities changed the results of ARMBaseInstrInfo::isProfitableToIfCvt() and led to an Ifcvt of the diamond in the test. AFAICT, the test was never meant to test this and thus changing the test input slightly to not change the probabilities seems like the best way to preserve the meaning of the test. llvm-svn: 234979
Diffstat (limited to 'llvm/test/Analysis/BranchProbabilityInfo/basic.ll')
-rw-r--r--llvm/test/Analysis/BranchProbabilityInfo/basic.ll28
1 files changed, 28 insertions, 0 deletions
diff --git a/llvm/test/Analysis/BranchProbabilityInfo/basic.ll b/llvm/test/Analysis/BranchProbabilityInfo/basic.ll
index 0f669119bfe..2c9c1561868 100644
--- a/llvm/test/Analysis/BranchProbabilityInfo/basic.ll
+++ b/llvm/test/Analysis/BranchProbabilityInfo/basic.ll
@@ -212,3 +212,31 @@ exit:
ret i32 %result
}
+define i32 @zero3(i32 %i, i32 %a, i32 %b) {
+; CHECK: Printing analysis {{.*}} for function 'zero3'
+entry:
+; AND'ing with a single bit bitmask essentially leads to a bool comparison,
+; meaning we don't have probability information.
+ %and = and i32 %i, 2
+ %tobool = icmp eq i32 %and, 0
+ br i1 %tobool, label %then, label %else
+; CHECK: edge entry -> then probability is 16 / 32
+; CHECK: edge entry -> else probability is 16 / 32
+
+then:
+; AND'ing with other bitmask might be something else, so we still assume the
+; usual probabilities.
+ %and2 = and i32 %i, 5
+ %tobool2 = icmp eq i32 %and2, 0
+ br i1 %tobool2, label %else, label %exit
+; CHECK: edge then -> else probability is 12 / 32
+; CHECK: edge then -> exit probability is 20 / 32
+
+else:
+ br label %exit
+
+exit:
+ %result = phi i32 [ %a, %then ], [ %b, %else ]
+ ret i32 %result
+}
+
OpenPOWER on IntegriCloud