summaryrefslogtreecommitdiff
path: root/test/break-to-return.wasm.fromBinary
diff options
context:
space:
mode:
authorAlon Zakai <alonzakai@gmail.com>2017-09-12 15:09:21 -0700
committerGitHub <noreply@github.com>2017-09-12 15:09:21 -0700
commitc6729400f68a346c1d51702946bf6026638782a6 (patch)
treea564073fbc079a88df43e12f177c8f2753670bfa /test/break-to-return.wasm.fromBinary
parent40f52f2ca41822e9dc47ff57239cdf299f7e1ce5 (diff)
downloadbinaryen-c6729400f68a346c1d51702946bf6026638782a6.tar.gz
binaryen-c6729400f68a346c1d51702946bf6026638782a6.tar.bz2
binaryen-c6729400f68a346c1d51702946bf6026638782a6.zip
precompute-propagate pass (#1179)
Implements #1172: this adds a variant of precompute, "precompute-propagate", which also does constant propagation. Precompute by itself just runs the interpreter on each expression and sees if it is in fact a constant; precompute-propagate also looks at the graph of connections between get and set locals, and propagates those constant values. This helps with cases as noticed in #1168 - while in most cases LLVM will do this already, it's important when inlining, e.g. inlining of the clamping math functions. This new pass is run when inlining, and otherwise only in -O3/-Oz, as it does increase compilation time noticeably if run on everything (and for almost no benefit if LLVM has run). Most of the code here is just refactoring out from the ssa pass the get/set graph computation, so it can now be used by both the ssa pass and precompute-propagate.
Diffstat (limited to 'test/break-to-return.wasm.fromBinary')
0 files changed, 0 insertions, 0 deletions