1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-20 19:42:54 +02:00
llvm-mirror/test/CodeGen/WebAssembly/store-results.ll
Dan Gohman 13d15dbc40 [WebAssembly] Move register stackification and coloring to a late phase.
Move the register stackification and coloring passes to run very late, after
PEI, tail duplication, and most other passes. This means that all code emitted
and expanded by those passes is now exposed to these passes. This also
eliminates the need for prologue/epilogue code to be manually stackified,
which significantly simplifies the code.

This does require running LiveIntervals a second time. It's useful to think
of these late passes not as late optimization passes, but as a domain-specific
compression algorithm based on knowledge of liveness information. It's used to
compress the code after all conventional optimizations are complete, which is
why it uses LiveIntervals at a phase when actual optimization passes don't
typically need it.

Differential Revision: http://reviews.llvm.org/D20075

llvm-svn: 269012
2016-05-10 04:24:02 +00:00

73 lines
2.2 KiB
LLVM

; RUN: llc < %s -asm-verbose=false | FileCheck %s
; Test that the wasm-store-results pass makes users of stored values use the
; result of store expressions to reduce get_local/set_local traffic.
target datalayout = "e-m:e-p:32:32-i64:64-n32:64-S128"
target triple = "wasm32-unknown-unknown"
; CHECK-LABEL: single_block:
; CHECK-NOT: local
; CHECK: i32.const $push{{[0-9]+}}=, 0{{$}}
; CHECK: i32.store $push[[STORE:[0-9]+]]=, 0($0), $pop{{[0-9]+}}{{$}}
; CHECK: return $pop[[STORE]]{{$}}
define i32 @single_block(i32* %p) {
entry:
store i32 0, i32* %p
ret i32 0
}
; Test interesting corner cases for wasm-store-results, in which the operand of
; a store ends up getting used by a phi, which needs special handling in the
; dominance test, since phis use their operands on their incoming edges.
%class.Vec3 = type { float, float, float }
@pos = global %class.Vec3 zeroinitializer, align 4
; CHECK-LABEL: foo:
; CHECK: i32.store $discard=, pos($pop{{[0-9]+}}), $pop{{[0-9]+}}{{$}}
define void @foo() {
for.body.i:
br label %for.body5.i
for.body5.i:
%i.0168.i = phi i32 [ 0, %for.body.i ], [ %inc.i, %for.body5.i ]
%conv6.i = sitofp i32 %i.0168.i to float
store volatile float 0.0, float* getelementptr inbounds (%class.Vec3, %class.Vec3* @pos, i32 0, i32 0)
%inc.i = add nuw nsw i32 %i.0168.i, 1
%exitcond.i = icmp eq i32 %inc.i, 256
br i1 %exitcond.i, label %for.cond.cleanup4.i, label %for.body5.i
for.cond.cleanup4.i:
ret void
}
; CHECK-LABEL: bar:
; CHECK: i32.store $discard=, pos($pop{{[0-9]+}}), $pop{{[0-9]+}}{{$}}
define void @bar() {
for.body.i:
br label %for.body5.i
for.body5.i:
%i.0168.i = phi float [ 0.0, %for.body.i ], [ %inc.i, %for.body5.i ]
store volatile float 0.0, float* getelementptr inbounds (%class.Vec3, %class.Vec3* @pos, i32 0, i32 0)
%inc.i = fadd float %i.0168.i, 1.0
%exitcond.i = fcmp oeq float %inc.i, 256.0
br i1 %exitcond.i, label %for.cond.cleanup4.i, label %for.body5.i
for.cond.cleanup4.i:
ret void
}
; CHECK-LABEL: fi_ret:
; CHECK: i32.store $push0=,
; CHECK: return $pop0{{$}}
define hidden i8* @fi_ret(i8** %addr) {
entry:
%buf = alloca [27 x i8], align 16
%0 = getelementptr inbounds [27 x i8], [27 x i8]* %buf, i32 0, i32 0
store i8* %0, i8** %addr
ret i8* %0
}