Age | Commit message (Expand) | Author |
2019-02-22 | Merge branch 'bjorn/compiler/use-lists-types' | Björn Gustavsson |
2019-02-21 | beam_ssa_type: Use types from some 'lists' functions | Björn Gustavsson |
2019-02-21 | sys_core_fold: Remove an unsafe optimization | Björn Gustavsson |
2019-02-21 | beam_ssa_type: Optimize setelement with partially constant arguments | Björn Gustavsson |
2019-02-21 | beam_ssa_opt: Do local CSE of get_tuple_element instructions | Björn Gustavsson |
2019-02-21 | Merge branch 'john/compiler/more-validator-cuddling' | John Högberg |
2019-02-21 | beam_validator: Refactor call argument validation | John Högberg |
2019-02-21 | beam_validator: Refactor liveness/stack initialization checks | John Högberg |
2019-02-21 | beam_validator: Refactor try/catch handling | John Högberg |
2019-02-20 | beam_validator: Remember definitions on assignment | John Högberg |
2019-02-20 | beam_validator: Refactor stack trimming | John Högberg |
2019-02-20 | beam_validator: Track definitions of all terms | John Högberg |
2019-02-20 | beam_validator: Remove special handling of map_get/is_map_key | John Högberg |
2019-02-20 | beam_validator: Refactor select_tuple_arity | John Högberg |
2019-02-20 | beam_validator: Treat select_val as a series of '=:=' | John Högberg |
2019-02-20 | beam_validator: Treat all bs_get instructions as extractions | John Högberg |
2019-02-20 | beam_validator: Separate BIF/call types more clearly | John Högberg |
2019-02-20 | beam_validator: Assert that no tuple elements are out of bounds | John Högberg |
2019-02-20 | beam_validator: Get rid of the last uses of set_aliased_type | John Högberg |
2019-02-20 | beam_validator: Minor cosmetic refactoring | John Högberg |
2019-02-20 | erl_bifs: Add a note to the comment for is_pure/3 | Björn Gustavsson |
2019-02-20 | Correct confusing comment in beam_ssa_type | Björn Gustavsson |
2019-02-20 | Improve optimization of switches | Björn Gustavsson |
2019-02-20 | Evaluate pure BIFs with literal arguments | Björn Gustavsson |
2019-02-20 | Refactor optimization of Bool =:= true | Björn Gustavsson |
2019-02-20 | Always make andalso/orelse right-associative | Björn Gustavsson |
2019-02-19 | Do the destructive setelement optimization in SSA | Björn Gustavsson |
2019-02-19 | Merge branch 'john/compiler/cuddle-validator' | John Högberg |
2019-02-18 | compiler: Allow disabling SSA passes in -compile() directives | John Högberg |
2019-02-18 | beam_validator: Infer types from result of all type test BIFs | John Högberg |
2019-02-18 | beam_validator: Infer BIF argument types | John Högberg |
2019-02-15 | inline_SUITE: Make coverage/1 test cheaper | Björn Gustavsson |
2019-02-15 | Remove compile_SUITE:big_file/1 | Björn Gustavsson |
2019-02-15 | Add test modules that disable all SSA optimizations | Björn Gustavsson |
2019-02-15 | Cover erl_bifs.erl | Björn Gustavsson |
2019-02-15 | Remove attempt to handle all bs_match_string instructions | Björn Gustavsson |
2019-02-15 | Cover exception throwing code in beam_ssa_opt | Björn Gustavsson |
2019-02-15 | Parallelize test of listing files | Björn Gustavsson |
2019-02-15 | Don't limit the number of processes when running cover | Björn Gustavsson |
2019-02-15 | Merge branch 'bjorn/compiler/beam_ssa_opt' | Björn Gustavsson |
2019-02-15 | Merge branch 'maint' | Björn Gustavsson |
2019-02-15 | Make sure that beam_ssa_opt optimizes all functions | Björn Gustavsson |
2019-02-14 | Merge branch 'bjorn/compiler/improve-move-elimination' | Björn Gustavsson |
2019-02-13 | Make dialyzer faster for left-associative andalso/orelse expressions | Björn Gustavsson |
2019-02-11 | beam_jump: Improve elimination of redundant moves | Björn Gustavsson |
2019-02-11 | compiler tests: Restrict cover to run on the local node | Björn Gustavsson |
2019-02-11 | Merge pull request #2134 from bjorng/bjorn/compiler/propagate-none | Björn Gustavsson |
2019-02-11 | beam_ssa_type: Propagate the 'none' type from calls | Björn Gustavsson |
2019-02-08 | beam_validator: type_test in BIFs that only fail on invalid types | John Högberg |
2019-02-08 | beam_validator: Simplify complex branches | John Högberg |