mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-21 20:12:56 +02:00
5d51a489ae
(This is the second attempt to submit this patch. The first caused two assertion failures and was reverted. See https://llvm.org/bugs/show_bug.cgi?id=25687) The patch in http://reviews.llvm.org/D13745 is broken into four parts: 1. New interfaces without functional changes (http://reviews.llvm.org/D13908). 2. Use new interfaces in SelectionDAG, while in other passes treat probabilities as weights (http://reviews.llvm.org/D14361). 3. Use new interfaces in all other passes. 4. Remove old interfaces. This patch is 3+4 above. In this patch, MBB won't provide weight-based interfaces any more, which are totally replaced by probability-based ones. The interface addSuccessor() is redesigned so that the default probability is unknown. We allow unknown probabilities but don't allow using it together with known probabilities in successor list. That is to say, we either have a list of successors with all known probabilities, or all unknown probabilities. In the latter case, we assume each successor has 1/N probability where N is the number of successors. An assertion checks if the user is attempting to add a successor with the disallowed mixed use as stated above. This can help us catch many misuses. All uses of weight-based interfaces are now updated to use probability-based ones. Differential revision: http://reviews.llvm.org/D14973 llvm-svn: 254377
65 lines
1.5 KiB
LLVM
65 lines
1.5 KiB
LLVM
; RUN: llc -march=hexagon -mcpu=hexagonv5 -hexagon-eif=0 -print-machineinstrs=if-converter %s -o /dev/null 2>&1 | FileCheck %s
|
|
; Check that the edge weights are updated correctly after if-conversion.
|
|
|
|
; CHECK: BB#3:
|
|
; CHECK: Successors according to CFG: BB#2({{[0-9a-fx/= ]+}}10.00%) BB#1({{[0-9a-fx/= ]+}}90.00%)
|
|
@a = external global i32
|
|
@d = external global i32
|
|
|
|
; In the following CFG, A,B,C,D will be if-converted into a single block.
|
|
; Check if the edge weights on edges to E and F are maintained correctly.
|
|
;
|
|
; A
|
|
; / \
|
|
; B C
|
|
; \ /
|
|
; D
|
|
; / \
|
|
; E F
|
|
;
|
|
define void @test1(i8 zeroext %la, i8 zeroext %lb) {
|
|
entry:
|
|
%cmp0 = call i1 @pred()
|
|
br i1 %cmp0, label %if.else2, label %if.then0, !prof !1
|
|
|
|
if.else2:
|
|
call void @bar(i32 2)
|
|
br label %if.end2
|
|
|
|
if.end2:
|
|
call void @foo(i32 2)
|
|
br label %return
|
|
|
|
if.end:
|
|
%storemerge = phi i32 [ %and, %if.else ], [ %shl, %if.then ]
|
|
store i32 %storemerge, i32* @a, align 4
|
|
%0 = load i32, i32* @d, align 4
|
|
%cmp2 = call i1 @pred()
|
|
br i1 %cmp2, label %if.end2, label %if.else2, !prof !2
|
|
|
|
if.then0:
|
|
%cmp = icmp eq i8 %la, %lb
|
|
br i1 %cmp, label %if.then, label %if.else, !prof !1
|
|
|
|
if.then:
|
|
%conv1 = zext i8 %la to i32
|
|
%shl = shl nuw nsw i32 %conv1, 16
|
|
br label %if.end
|
|
|
|
if.else:
|
|
%and8 = and i8 %lb, %la
|
|
%and = zext i8 %and8 to i32
|
|
br label %if.end
|
|
|
|
return:
|
|
call void @foo(i32 2)
|
|
ret void
|
|
}
|
|
|
|
declare void @foo(i32)
|
|
declare void @bar(i32)
|
|
declare i1 @pred()
|
|
|
|
!1 = !{!"branch_weights", i32 80, i32 20}
|
|
!2 = !{!"branch_weights", i32 10, i32 90}
|