1. 15 Apr, 2014 2 commits
    • Kevin Modzelewski's avatar
      List comprehension support · 92117aab
      Kevin Modzelewski authored
      Should support:
      - multiple comprehensions
      - multiple if conditions
      - nested control flow expressions
      - OSR'ing from the list comprehension
      
      Though it tends to hit the OSR bug in the previous commit.
      
      Some extra changes that could have been split out:
      - use pointers-to-const instead of references-to-const for attribute-name passing,
        to make it harder to bind to a temporary name that will go away.
      - add a 'cls_only' flag to getattr / getattrType to not have to special-case clsattrs
        (or simply get it wrong, in the case of getattrType)
      92117aab
    • Kevin Modzelewski's avatar
  2. 14 Apr, 2014 4 commits
  3. 13 Apr, 2014 1 commit
  4. 11 Apr, 2014 5 commits
    • Kevin Modzelewski's avatar
    • Kevin Modzelewski's avatar
      whoops · b3d0e5f3
      Kevin Modzelewski authored
      b3d0e5f3
    • Kevin Modzelewski's avatar
      Convert INSTALLING to markdown · 2572b920
      Kevin Modzelewski authored
      2572b920
    • Kevin Modzelewski's avatar
      Minor documentation changes · 7a8753f1
      Kevin Modzelewski authored
      7a8753f1
    • Kevin Modzelewski's avatar
      Fairly large refactor: do much more during the CFG lowering. · a404585d
      Kevin Modzelewski authored
      In particular, lower all control-flow-involving expressions (such as boolops,
      list comprehensions, if expressions) into actual control flow.  This requires
      unfolding the AST into a flat structure, since the control-flow-expression can
      be nested inside other expressions, including other control-flow-expressions.
      
      The IRGenerator was doing this before, but was leading to duplication because
      it's very similar to what the CFG generator already has to do.
      
      Doing this earlier in the pipeline means that more analysis passes can work on
      the lowered expressions, rather than having to be taught how they work.  In
      particular, the name analysis does not need to have to special case the fact
      that list comprehensions may set names -- but aren't guaranteed to if they don't
      get executed or the iterator is empty.  I tried implementing list comprehensions
      without doing this, and a bunch of the work was in reimplementing the logic that
      the analyzers already implement.
      
      As a side benefit, deopts become much easier since the AST is already unfolded;
      this change gets rid of the messy fake-variable-setting way that the IRGenerator
      was unfolding the AST to get this same effect.
      a404585d
  5. 10 Apr, 2014 3 commits
  6. 08 Apr, 2014 3 commits
  7. 07 Apr, 2014 8 commits
  8. 05 Apr, 2014 1 commit
  9. 04 Apr, 2014 4 commits
  10. 03 Apr, 2014 8 commits