| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| * | Merge pull request #1175 from WebAssembly/fuzz | Alon Zakai | 2017-09-10 | 1 | -6/+23 | |
| |\ | | | | | Fuzzer improvements + fixes | |||||
| | * | when if arms are identical, merging them may change the type of the if, if ↵ | Alon Zakai | 2017-09-06 | 1 | -6/+23 | |
| | | | | | | | | | it has a forced type | |||||
| * | | Add support for sign-extension operators from threading proposal (#1167) | Derek Schuff | 2017-09-06 | 1 | -0/+2 | |
| |/ | | | These are not atomic operations, but are added with the atomic operations to keep from having to define atomic versions of all the sign-extending loads (an atomic zero-extending load + signext operation can be used instead). | |||||
| * | Return to more structured type rules for block and if (#1148) | Alon Zakai | 2017-09-05 | 1 | -0/+8 | |
| | | | | | | | | | * if a block has a concrete final element (or a break with a value), then even if it has an unreachable child, keep it with that concrete type. this means we no longe allow the silly case of a block with an unreachable in the middle and a concrete as the final element while the block is unreachable - after this change, the block would have the type of the final element * if an if has a concrete element in one arm, make it have that type as a result, even if the if condition is unreachable, to parallel block * make type rules for brs and switches simpler, ignore whether they are reachable or not. whether they are dead code should not affect how they influence other types in our IR. | |||||
| * | fix off-by-one error in clz/ctz/popcount used bits computation | Alon Zakai | 2017-08-01 | 1 | -2/+2 | |
| | | ||||||
| * | use effective shifts in more places in optimize-instructions | Alon Zakai (kripken) | 2017-08-01 | 1 | -2/+2 | |
| | | ||||||
| * | review comments | Alon Zakai (kripken) | 2017-07-31 | 1 | -5/+5 | |
| | | ||||||
| * | handle squared shifts of an unreachable | Alon Zakai (kripken) | 2017-07-31 | 1 | -2/+2 | |
| | | ||||||
| * | fix optimizing two shifts into one; if the number of effective shifts ↵ | Alon Zakai (kripken) | 2017-07-30 | 1 | -3/+11 | |
| | | | | | overflows, it is not vali to just add them | |||||
| * | do not swap elements in conditionalizeExpensiveOnBitwise if they invalidate ↵ | Alon Zakai (kripken) | 2017-07-29 | 1 | -6/+9 | |
| | | | | | each other - it is not enough to check side effects, we must check the interaction as well | |||||
| * | refactor effective shift size computation | Alon Zakai | 2017-07-29 | 1 | -3/+3 | |
| | | ||||||
| * | fix shl shift computation in getMaxBits | Alon Zakai | 2017-07-29 | 1 | -1/+1 | |
| | | ||||||
| * | fix shift computation in getMaxBits - in wasm only the lower 5 bits matter ↵ | Alon Zakai | 2017-07-29 | 1 | -2/+2 | |
| | | | | | for a 32-bit shift | |||||
| * | do not combine a load/store offset with a constant pointer if it would wrap ↵ | Alon Zakai (kripken) | 2017-07-29 | 1 | -2/+9 | |
| | | | | | a negative value to a positive one, as trapping is tricky | |||||
| * | fix off-by-one in assertion in optimize-instructions | Alon Zakai | 2017-07-17 | 1 | -1/+1 | |
| | | ||||||
| * | optimize shifts of 0 | Alon Zakai | 2017-07-13 | 1 | -0/+6 | |
| | | ||||||
| * | 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. | |||||
 |
index : forks/binaryen.git | |
| summaryrefslogtreecommitdiff |