Mircea Trofin bb6497ffa6
[BPI] Reuse the AsmWriter's BB naming scheme in BranchProbabilityPrinterPass (#73593)
When using `BranchProbabilityPrinterPass`, if a BB has no name, we get pretty unusable information like `edge -> has probability...` (i.e. we have no idea what the vertices of that edge are).

This patch uses `printAsOperand`, which uses the same naming scheme as `Function::dump`, so for example during debugging sessions, the IR obtained from a function and the names used by `BranchProbabilityPrinterPass` will match.

A shortcoming is that `printAsOperand` will result in the numbering algorithm re-running for every edge and every vertex (when `BranchProbabilityPrinterPass` is run on a function). If, for the given scenario, this is a problem, we can revisit this subsequently.

Another nuance is that the entry basic block will be numbered, which may be slightly confusing when it's anonymous, but it's easily identifiable - the first edge would have it as source (and the number should be easily recognizable)
2023-12-02 13:01:48 -08:00

63 lines
2.3 KiB
LLVM

; RUN: opt < %s -passes='print<branch-prob>' -disable-output 2>&1 | FileCheck %s
; CHECK-LABEL: no_hoist
; CHECK: edge %entry -> %if.end probability is 0x40000000 / 0x80000000 = 50.00%
; CHECK: edge %entry -> %if.then probability is 0x40000000 / 0x80000000 = 50.00%
; CHECK: edge %if.end -> %if.end4 probability is 0x40000000 / 0x80000000 = 50.00%
; CHECK: edge %if.end -> %if.then3 probability is 0x40000000 / 0x80000000 = 50.00%
define dso_local void @no_hoist(i64 %arg1, i64 %arg2) local_unnamed_addr #0 {
entry:
%and = and i64 %arg1, 1152921504606846976
%tobool.not = icmp eq i64 %and, 0
br i1 %tobool.not, label %if.end, label %if.then
if.then: ; preds = %entry
tail call void @bar()
br label %if.end
if.end: ; preds = %if.then, %entry
%and1 = and i64 %arg2, 1152921504606846976
%tobool2.not = icmp eq i64 %and1, 0
br i1 %tobool2.not, label %if.end4, label %if.then3
if.then3: ; preds = %if.end
tail call void @baz()
br label %if.end4
if.end4: ; preds = %if.then3, %if.end
ret void
}
; CHECK-LABEL: hoist
; CHECK: edge %entry -> %if.end probability is 0x40000000 / 0x80000000 = 50.00%
; CHECK: edge %entry -> %if.then probability is 0x40000000 / 0x80000000 = 50.00%
; CHECK: edge %if.end -> %if.end4 probability is 0x40000000 / 0x80000000 = 50.00%
; CHECK: edge %if.end -> %if.then3 probability is 0x40000000 / 0x80000000 = 50.00%
define dso_local void @hoist(i64 %arg1, i64 %arg2) local_unnamed_addr #0 {
entry:
%const = bitcast i64 1152921504606846976 to i64
%and = and i64 %arg1, %const
%tobool.not = icmp eq i64 %and, 0
br i1 %tobool.not, label %if.end, label %if.then
if.then: ; preds = %entry
tail call void @bar()
br label %if.end
if.end: ; preds = %if.then, %entry
%and1 = and i64 %arg2, %const
%tobool2.not = icmp eq i64 %and1, 0
br i1 %tobool2.not, label %if.end4, label %if.then3
if.then3: ; preds = %if.end
tail call void @baz()
br label %if.end4
if.end4: ; preds = %if.then3, %if.end
ret void
}
declare dso_local void @bar() local_unnamed_addr #1
declare dso_local void @baz() local_unnamed_addr #1