RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-19 19:12:56 +02:00
Code Issues Projects Releases Wiki Activity

[PlaceSafepoints] Pin tests to legacy PM

Browse Source 
This pass isn't used in tree and can be ported to the NPM later on if desired.

Differential Revision: https://reviews.llvm.org/D90189
This commit is contained in:
Arthur Eubanks 2020-10-26 13:21:39 -07:00
parent 7e6a52443b
commit e86f39b76e
9 changed files with 13 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
test/Transforms/PlaceSafepoints/basic.ll
View File

@ -1,4 +1,4 @@
; RUN: opt < %s -S -place-safepoints | FileCheck %s
; RUN: opt < %s -S -place-safepoints -enable-new-pm=0 | FileCheck %s
; Do we insert a simple entry safepoint?

2
test/Transforms/PlaceSafepoints/call-in-loop.ll
View File

@ -1,7 +1,7 @@
; If there's a call in the loop which dominates the backedge, we
; don't need a safepoint poll (since the callee must contain a
; poll test).
;; RUN: opt < %s -place-safepoints -S | FileCheck %s
;; RUN: opt < %s -place-safepoints -S -enable-new-pm=0 | FileCheck %s
declare void @foo()

6
test/Transforms/PlaceSafepoints/finite-loops.ll
View File

@ -1,7 +1,7 @@
; Tests to ensure that we are not placing backedge safepoints in
; loops which are clearly finite.
;; RUN: opt < %s -place-safepoints -spp-counted-loop-trip-width=32 -S | FileCheck %s
;; RUN: opt < %s -place-safepoints -spp-counted-loop-trip-width=64 -S | FileCheck %s -check-prefix=COUNTED-64
;; RUN: opt < %s -place-safepoints -spp-counted-loop-trip-width=32 -S -enable-new-pm=0 | FileCheck %s
;; RUN: opt < %s -place-safepoints -spp-counted-loop-trip-width=64 -S -enable-new-pm=0 | FileCheck %s -check-prefix=COUNTED-64
; A simple counted loop with trivially known range
@ -140,4 +140,4 @@ define void @gc.safepoint_poll() {
entry:
call void @do_safepoint()
ret void
}
}

2
test/Transforms/PlaceSafepoints/libcall.ll
View File

@ -1,4 +1,4 @@
; RUN: opt -S -place-safepoints < %s | FileCheck %s
; RUN: opt -S -place-safepoints < %s -enable-new-pm=0 | FileCheck %s
; Libcalls will not contain a safepoint poll, so check that we insert
; a safepoint in a loop containing a libcall.

2
test/Transforms/PlaceSafepoints/memset.ll
View File

@ -1,4 +1,4 @@
; RUN: opt < %s -S -place-safepoints | FileCheck %s
; RUN: opt < %s -S -place-safepoints -enable-new-pm=0 | FileCheck %s
define void @test(i32, i8 addrspace(1)* %ptr) gc "statepoint-example" {
; CHECK-LABEL: @test

2
test/Transforms/PlaceSafepoints/no-statepoints.ll
View File

@ -1,4 +1,4 @@
; RUN: opt -S -place-safepoints < %s | FileCheck %s
; RUN: opt -S -place-safepoints < %s -enable-new-pm=0 | FileCheck %s
declare void @callee()

4
test/Transforms/PlaceSafepoints/split-backedge.ll
View File

@ -1,5 +1,5 @@
;; A very basic test to make sure that splitting the backedge keeps working
;; RUN: opt < %s -place-safepoints -spp-split-backedge=1 -S | FileCheck %s
;; 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
@ -43,4 +43,4 @@ define void @gc.safepoint_poll() {
entry:
call void @do_safepoint()
ret void
}
}

2
test/Transforms/PlaceSafepoints/statepoint-coreclr.ll
View File

@ -1,4 +1,4 @@
; RUN: opt < %s -S -place-safepoints | FileCheck %s
; RUN: opt < %s -S -place-safepoints -enable-new-pm=0 | FileCheck %s
; Basic test to make sure that safepoints are placed
; for CoreCLR GC

4
test/Transforms/PlaceSafepoints/statepoint-frameescape.ll
View File

@ -1,4 +1,4 @@
; RUN: opt < %s -S -place-safepoints | FileCheck %s
; RUN: opt < %s -S -place-safepoints -enable-new-pm=0 | FileCheck %s
declare void @llvm.localescape(...)
@ -26,4 +26,4 @@ define void @gc.safepoint_poll() {
entry:
call void @do_safepoint()
ret void
}
}