47 lines
1.2 KiB
LLVM
47 lines
1.2 KiB
LLVM
;; A very basic test to make sure that splitting the backedge keeps working
|
|
;; RUN: opt < %s -place-safepoints -spp-split-backedge=1 -S -enable-new-pm=0 | FileCheck %s
|
|
|
|
define void @test(i32, i1 %cond) gc "statepoint-example" {
|
|
; CHECK-LABEL: @test
|
|
; CHECK-LABEL: loop.loop_crit_edge
|
|
; CHECK: call void @do_safepoint
|
|
; CHECK-NEXT: br label %loop
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
br i1 %cond, label %loop, label %exit
|
|
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
; Test for the case where a single conditional branch jumps to two
|
|
; different loop header blocks. Since we're currently using LoopSimplfy
|
|
; this doesn't hit the interesting case, but once we remove that, we need
|
|
; to be sure this keeps working.
|
|
define void @test2(i32, i1 %cond) gc "statepoint-example" {
|
|
; CHECK-LABEL: @test2
|
|
; CHECK-LABEL: loop2.loop2_crit_edge:
|
|
; CHECK: call void @do_safepoint
|
|
; CHECK-NEXT: br label %loop2
|
|
; CHECK-LABEL: loop2.loop_crit_edge:
|
|
; CHECK: call void @do_safepoint
|
|
; CHECK-NEXT: br label %loop
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
br label %loop2
|
|
|
|
loop2:
|
|
br i1 %cond, label %loop, label %loop2
|
|
}
|
|
|
|
declare void @do_safepoint()
|
|
define void @gc.safepoint_poll() {
|
|
entry:
|
|
call void @do_safepoint()
|
|
ret void
|
|
}
|