Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | add the option to seek named breaks, not just taken breaks; refactor headers ↵ | Alon Zakai (kripken) | 2017-07-11 | 1 | -1/+2 | |
| | | | | to make this practical | |||||
* | Validate finalization (#1014) | Alon Zakai | 2017-05-18 | 1 | -0/+1 | |
| | | | | | | | * validate that types are properly finalized, when in pass-debug mode (BINARYEN_PASS_DEBUG env var): check after each pass is run that the type of each node is equal to the proper type (when finalizing it, i.e., fully recomputing the type). * fix many fuzz bugs found by that. * in particular, fix dce bugs with type changes not being fully updated during code removal. add a new TypeUpdater helper class that lets a pass update types efficiently, by the helper tracking deps between blocks and branches etc., and updating/propagating type changes only as necessary. | |||||
* | optimize if and select in the case their values are identical (#1013) | Alon Zakai | 2017-05-17 | 1 | -0/+39 | |
| | ||||||
* | Fix comparisons of sign-extends to weird constants (#956) | Alon Zakai | 2017-03-21 | 1 | -6/+31 | |
| | | | | * fix eq/ne of sign-ext with a constant, when the constant can never be equal to it as it has the effective sign bit but not the upper bits above it set, which the sign-ext would emit | |||||
* | fix sign-ext opt issues (#935) | Alon Zakai | 2017-03-09 | 1 | -11/+15 | |
| | | | | | | * fix a bug where compared sign-exts of different sizes were turned into zero-exts * fix a bug where we consider an almost sign-ext as ok to change the sign of a load inside it, ignoring that the load has the extra shifting | |||||
* | Default Walker subclasses to using Visitor<SubType> (#921) | jgravelle-google | 2017-02-23 | 1 | -3/+3 | |
| | | | | Most module walkers use PostWalker<T, Visitor<T>>, let that pattern be expressed as simply PostWalker<T> | |||||
* | refactor sign/zero extension code into nice headers, and prepare ↵ | Alon Zakai | 2017-02-16 | 1 | -97/+23 | |
| | | | | PickLoadSigns pass | |||||
* | fix and clean up fallthrough logic in OptimizeInstructions | Alon Zakai (kripken) | 2017-02-16 | 1 | -22/+18 | |
| | ||||||
* | optimize a compare of a load_s and a sign-extend into a load_u and a cheaper ↵ | Alon Zakai (kripken) | 2017-02-16 | 1 | -0/+18 | |
| | | | | zero-extend | |||||
* | take into account loads into local info in OptimizeInstructions | Alon Zakai (kripken) | 2017-02-16 | 1 | -7/+10 | |
| | ||||||
* | use local info about maxBits and sign-extendedness in OptimizeInstructions | Alon Zakai (kripken) | 2017-02-16 | 1 | -11/+120 | |
| | | | | fix the maxBits of a signed load, which this uncovered - all the bits may be used in such a case | |||||
* | remove unneeded masks using getMaxBits | Alon Zakai (kripken) | 2017-02-16 | 1 | -3/+16 | |
| | ||||||
* | tiny refactoring in OptimizeInstructions, for clarity | Alon Zakai (kripken) | 2017-02-16 | 1 | -7/+8 | |
| | ||||||
* | fix fuzz testcase, xor maxBits is the max, not the min | Alon Zakai (kripken) | 2017-02-16 | 1 | -2/+2 | |
| | ||||||
* | handle fallthrough values in load_s/u and sign/zero-extend optimization | Alon Zakai (kripken) | 2017-02-16 | 1 | -6/+30 | |
| | ||||||
* | handle load in getMaxBits | Alon Zakai (kripken) | 2017-02-16 | 1 | -0/+2 | |
| | ||||||
* | handle tee_local in getMaxBits | Alon Zakai (kripken) | 2017-02-16 | 1 | -0/+3 | |
| | ||||||
* | optimize out a sign-ext into a store of the same size | Alon Zakai (kripken) | 2017-02-16 | 1 | -0/+6 | |
| | ||||||
* | optimize out add/sub of 0 | Alon Zakai (kripken) | 2017-02-16 | 1 | -1/+9 | |
| | ||||||
* | optimize sign-extends to a boolean | Alon Zakai (kripken) | 2017-02-16 | 1 | -0/+4 | |
| | ||||||
* | optimize sign-extends to eqz | Alon Zakai (kripken) | 2017-02-16 | 1 | -0/+7 | |
| | ||||||
* | optimize sign-extends to ne | Alon Zakai (kripken) | 2017-02-16 | 1 | -2/+2 | |
| | ||||||
* | Optimize "squared" operations (#905) | Alon Zakai | 2017-02-16 | 1 | -23/+86 | |
| | | | | * optimize 'almost' sign extends: when we can remove one entirely, then extra shifts can be left behind. with that in place, we can then optimize 'squared' operations like shl on shl, as doing so does not break our sign extend opts | |||||
* | optimize linear sums (#904) | Alon Zakai | 2017-02-16 | 1 | -0/+110 | |
| | ||||||
* | Optimize sign-extends (#902) | Alon Zakai | 2017-02-16 | 1 | -18/+139 | |
| | | | | | | * optimize sign-extend output * optimize sign-extend input | |||||
* | Hide dead code (#909) | Loo Rong Jie | 2017-02-15 | 1 | -0/+8 | |
| | ||||||
* | Improve handling of implicit traps (#898) | Alon Zakai | 2017-02-06 | 1 | -4/+4 | |
| | | | | | | | | * add --ignore-implicit-traps option, and by default do not ignore them, to properly preserve semantics * implicit traps can be reordered, but are side effects and should not be removed * add testing for --ignore-implicit-traps | |||||
* | Make ast_utils into a library (#892) | Derek Schuff | 2017-01-31 | 1 | -45/+47 | |
| | | | | Split ExpressionAnalyzer and ExpressionManipulator into cpp files, and turn their giant template functions into simple functions which take a callback. More organization, fewer mammoth headers, makes the build a few seconds faster, and the binaries a couple MB smaller. | |||||
* | Fix regression from #850 (#851) | Alon Zakai | 2016-11-30 | 1 | -27/+1 | |
| | | | | | | * fix regression from #850 - it is not always safe to fold added offsets into load/store offsets, as the add wraps but offset does not * small refactoring to simplify asm2wasm pass invocation | |||||
* | Optimize added factors into load/store offsets (#850) | Alon Zakai | 2016-11-29 | 1 | -0/+40 | |
| | | | | | * optimize added factors into load/store offsets, removing the add * optimize offset of load/store of a constant into the constant | |||||
* | optimize booleans through i32.or | Alon Zakai | 2016-11-04 | 1 | -2/+6 | |
| | ||||||
* | recurse in optimizeBoolean (#809) | Alon Zakai | 2016-10-27 | 1 | -0/+10 | |
| | ||||||
* | optimize ne of 0 in a boolean context (#808) | Alon Zakai | 2016-10-27 | 1 | -7/+17 | |
| | ||||||
* | Conditionalize boolean operations based on cost (#805) | Alon Zakai | 2016-10-26 | 1 | -0/+46 | |
| | | | When we have expensive | expensive, and both are boolean, then we can execute one of them conditionally if it doesn't have side effects. | |||||
* | Optimize out bool & 1 (#804) | Alon Zakai | 2016-10-25 | 1 | -0/+10 | |
| | | | | | | * asm.js corrections to unit.asm.js test * optimize out bool&1 | |||||
* | Optimize to i64.store[less] (#792) | Alon Zakai | 2016-10-20 | 1 | -4/+10 | |
| | ||||||
* | optimize out i32.and of -1 | Alon Zakai | 2016-10-15 | 1 | -4/+9 | |
| | ||||||
* | optimize loads and stores that mask their values, as the load/store ↵ | Alon Zakai | 2016-10-15 | 1 | -0/+28 | |
| | | | | operation masks itself | |||||
* | Type check block/loop/if sigs (#717) | Alon Zakai | 2016-09-28 | 1 | -0/+60 | |
| | | | | | | * type check using block/loop/if types provided in text and binary formats. * print if and loop sigs which were missing. * remove dsl from OptimizeInstructions as after those changes it needs rethinking. | |||||
* | refactor wasm.h to remove numericIndex hacks, and move indexing to the parsers | Alon Zakai | 2016-09-21 | 1 | -9/+14 | |
| | ||||||
* | clean up database-ensuring code using the new prepareToRun method | Alon Zakai | 2016-09-12 | 1 | -9/+6 | |
| | ||||||
* | refactor an optimizeBoolean method | Alon Zakai | 2016-09-10 | 1 | -20/+24 | |
| | ||||||
* | optimize eqz^2 in select and br_if | Alon Zakai | 2016-09-10 | 1 | -8/+23 | |
| | ||||||
* | flip select-eqz when possible | Alon Zakai | 2016-09-07 | 1 | -2/+13 | |
| | ||||||
* | optimize out a set of a get of a global | Alon Zakai | 2016-09-07 | 1 | -0/+8 | |
| | ||||||
* | optimize loads+shifts into signed loads | Alon Zakai | 2016-09-07 | 1 | -0/+27 | |
| | ||||||
* | ensure we create the OptimizeInstructions database on demand, avoiding ↵ | Alon Zakai | 2016-09-07 | 1 | -3/+17 | |
| | | | | global ctors | |||||
* | rewrite OptimizeInstructions to use a dsl of patterns | Alon Zakai | 2016-06-26 | 1 | -50/+136 | |
| | ||||||
* | Add initialization functions for passes to avoid missing pass registration ↵ | Jukka Jylänki | 2016-06-21 | 1 | -1/+3 | |
| | | | | due to linker dead code elimination. Fixes #577. | |||||
* | move function parallelism to pass and pass runner, which allows more ↵ | Alon Zakai | 2016-06-03 | 1 | -1/+3 | |
| | | | | efficient parallel execution (#564) |