1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-30 23:42:52 +01:00
llvm-mirror/test/Regression/Transforms/SimplifyCFG/2003-08-17-BranchFoldOrdering.ll
2003-09-16 15:29:54 +00:00

25 lines
618 B
LLVM

; This test checks to make sure that 'br X, Dest, Dest' is folded into
; 'br Dest'. This can only happen after the 'Z' block is eliminated. This is
; due to the fact that the SimplifyCFG function does not use
; the ConstantFoldTerminator function.
; RUN: llvm-as < %s | opt -simplifycfg | llvm-dis | not grep 'br bool %c2'
declare void %noop()
int %test(bool %c1, bool %c2) {
call void %noop()
br bool %c1, label %A, label %Y
A:
call void %noop()
br bool %c2, label %Z, label %X ; Can be converted to unconditional br
Z:
br label %X
X:
call void %noop()
ret int 0
Y:
call void %noop()
br label %X
}