2009-11-19 00:30:38 +01:00
|
|
|
; RUN: llc < %s -mtriple=arm-apple-darwin -mcpu=cortex-a8 -asm-verbose=false | FileCheck %s
|
2009-11-18 23:52:37 +01:00
|
|
|
|
|
|
|
|
declare void @bar(i32)
|
|
|
|
|
declare void @car(i32)
|
|
|
|
|
declare void @dar(i32)
|
|
|
|
|
declare void @ear(i32)
|
|
|
|
|
declare void @far(i32)
|
|
|
|
|
declare i1 @qux()
|
|
|
|
|
|
|
|
|
|
@GHJK = global i32 0
|
|
|
|
|
|
2010-01-05 18:55:26 +01:00
|
|
|
declare i8* @choose(i8*, i8*)
|
2009-11-18 23:52:37 +01:00
|
|
|
|
|
|
|
|
; BranchFolding should tail-duplicate the indirect jump to avoid
|
|
|
|
|
; redundant branching.
|
|
|
|
|
|
|
|
|
|
; CHECK: tail_duplicate_me:
|
|
|
|
|
; CHECK: qux
|
|
|
|
|
; CHECK: qux
|
|
|
|
|
; CHECK: ldr r{{.}}, LCPI
|
|
|
|
|
; CHECK: str r
|
|
|
|
|
; CHECK-NEXT: bx r
|
|
|
|
|
; CHECK: ldr r{{.}}, LCPI
|
|
|
|
|
; CHECK: str r
|
|
|
|
|
; CHECK-NEXT: bx r
|
|
|
|
|
; CHECK: ldr r{{.}}, LCPI
|
|
|
|
|
; CHECK: str r
|
|
|
|
|
; CHECK-NEXT: bx r
|
|
|
|
|
|
|
|
|
|
define void @tail_duplicate_me() nounwind {
|
|
|
|
|
entry:
|
|
|
|
|
%a = call i1 @qux()
|
|
|
|
|
%c = call i8* @choose(i8* blockaddress(@tail_duplicate_me, %return),
|
|
|
|
|
i8* blockaddress(@tail_duplicate_me, %altret))
|
|
|
|
|
br i1 %a, label %A, label %next
|
|
|
|
|
next:
|
|
|
|
|
%b = call i1 @qux()
|
|
|
|
|
br i1 %b, label %B, label %C
|
|
|
|
|
|
|
|
|
|
A:
|
|
|
|
|
call void @bar(i32 0)
|
|
|
|
|
store i32 0, i32* @GHJK
|
|
|
|
|
br label %M
|
|
|
|
|
|
|
|
|
|
B:
|
|
|
|
|
call void @car(i32 1)
|
|
|
|
|
store i32 0, i32* @GHJK
|
|
|
|
|
br label %M
|
|
|
|
|
|
|
|
|
|
C:
|
|
|
|
|
call void @dar(i32 2)
|
|
|
|
|
store i32 0, i32* @GHJK
|
|
|
|
|
br label %M
|
|
|
|
|
|
|
|
|
|
M:
|
|
|
|
|
indirectbr i8* %c, [label %return, label %altret]
|
|
|
|
|
|
|
|
|
|
return:
|
|
|
|
|
call void @ear(i32 1000)
|
|
|
|
|
ret void
|
|
|
|
|
altret:
|
|
|
|
|
call void @far(i32 1001)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
