mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-25 20:23:11 +01:00
f9cbb7144f
ReduceFunctions could do it, but it also replaces *all* calls with undef, so if any of undef replacements makes reduction uninteresting, it won't work. ReduceBasicBlocks also could do it, but well, it may take many guesses for all the blocks of a function to happen to be out-of-chunk, which is not a very efficient way to go about it. So let's just do this first.
18 lines
478 B
LLVM
18 lines
478 B
LLVM
; RUN: llvm-reduce --test FileCheck --test-arg --check-prefixes=CHECK-ALL,CHECK-INTERESTINGNESS --test-arg %s --test-arg --input-file %s -o %t
|
|
; RUN: cat %t | FileCheck --check-prefixes=CHECK-ALL,CHECK-FINAL %s
|
|
|
|
; CHECK-INTERESTINGNESS: @callee(
|
|
; CHECK-FINAL: declare void @callee()
|
|
define void @callee() {
|
|
ret void
|
|
}
|
|
|
|
; CHECK-ALL: define void @caller()
|
|
define void @caller() {
|
|
entry:
|
|
; CHECK-ALL: call void @callee()
|
|
; CHECK-ALL: ret void
|
|
call void @callee()
|
|
ret void
|
|
}
|