| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Require `then` and `else` with `if` (#6201) | Thomas Lively | 2024-01-04 | 1 | -5/+9 |
| | | | | | | | | | | | | | We previously supported (and primarily used) a non-standard text format for conditionals in which the condition, if-true expression, and if-false expression were all simply s-expression children of the `if` expression. The standard text format, however, requires the use of `then` and `else` forms to introduce the if-true and if-false arms of the conditional. Update the legacy text parser to require the standard format and update all tests to match. Update the printer to print the standard format as well. The .wast and .wat test inputs were mechanically updated with this script: https://gist.github.com/tlively/85ae7f01f92f772241ec994c840ccbb1 | ||||
| * | Update test/spec/memory.wast to latest upstream (#1801) | Alon Zakai | 2019-04-03 | 1 | -0/+1 |
| | | | | | | | | Minus multi-memory which we don't support yet. Improve validator. Fix some minor validation issues in our tests. | ||||
| * | Optimize added constants with propagation only if we see we will remove all ↵ | Alon Zakai | 2019-03-06 | 1 | -0/+23 |
| | | | | | uses of the original add, as otherwise we may just be adding work (both an offset, and an add). Refactor local-utils.h, and make UnneededSetRemover also check for side effects, so it cleanly removes all traces of unneeded sets. | ||||
| * | Run multiple iterations in OptimizeAddedConstants | Alon Zakai | 2019-03-06 | 1 | -0/+20 |
| | | | | | | Multiple propagations may be possible in some cases, like nested structs in C. | ||||
| * | Consistently optimize small added constants into load/store offsets (#1924) | Alon Zakai | 2019-03-01 | 1 | -0/+415 |
| See #1919 - we did not do this consistently before. This adds a lowMemoryUnused option to PassOptions. It can be passed on the commandline with --low-memory-unused. If enabled, we run the new optimize-added-constants pass, which does the real work here, replacing older code in post-emscripten. Aside from running at the proper time (unlike the old pass, see #1919), this also has a -propagate mode, which can do stuff like this: y = x + 10 [..] load(y) [..] load(y) => y = x + 10 [..] load(x, offset=10) [..] load(x, offset=10) That is, it can propagate such offsets to the loads/stores. This pattern is common in big interpreter loops, where the pointers are offsets into a big struct of state. The pass does this propagation by using a new feature of LocalGraph, which can verify which locals are in SSA mode. Binaryen IR is not SSA (intentionally, since it's a later IR), but if a local only has a single set for all gets, that means that local is in such a state, and can be optimized. The tricky thing is that all locals are initialized to zero, so there are at minimum two sets. But if we verify that the real set dominates all the gets, then the zero initialization cannot reach them, and we are safe. This PR also makes safe-heap aware of lowMemoryUnused. If so, we check for not just an access of 0, but the range 0-1023. This makes zlib 5% faster, with either the wasm backend or asm2wasm. It also makes it 0.5% smaller. Also helps sqlite (1.5% faster) and lua (1% faster) | |||||
 |
index : forks/binaryen.git | |
| summaryrefslogtreecommitdiff |