1. 02 May, 2006 1 commit
  2. 01 May, 2006 1 commit
  3. 26 Apr, 2006 1 commit
  4. 28 Apr, 2006 2 commits
  5. 27 Apr, 2006 1 commit
  6. 26 Apr, 2006 1 commit
  7. 25 Apr, 2006 2 commits
  8. 24 Apr, 2006 1 commit
  9. 21 Apr, 2006 1 commit
  10. 20 Apr, 2006 3 commits
  11. 21 Apr, 2006 1 commit
  12. 20 Apr, 2006 2 commits
  13. 19 Apr, 2006 4 commits
  14. 18 Apr, 2006 9 commits
  15. 14 Apr, 2006 5 commits
  16. 12 Apr, 2006 3 commits
    • simonpj@microsoft.com's avatar
      Cosmetics in SpecConstr · 48967672
      simonpj@microsoft.com authored
      SpecConstr currently uses substExpr for tiresome reasons to do with
      GADTs.  Unfortunately the substExpr generates some WARNINGS (when DEBUG)
      is on, because we aren't adding all the in-scope Ids to the in-scope
      set of the substitution.
      
      When we move to FC these substExprs will go away, so I'm not going to
      worry about this now.
      48967672
    • simonpj@microsoft.com's avatar
      Improve pruning of case alternatives to account for GADTs · 2763f56d
      simonpj@microsoft.com authored
      Consider
      
        data T a where
          T1 :: T Int
          T2 :: T Bool
          T3 :: T Char
      
        f :: T Bool -> Int
        f x = case x of
      	  DEFAULT -> ...
      	  T2 -> 3
      
      Here the DEFAULT case covers multiple constructors (T1,T3), but none 
      of them can match a scrutinee of type (T Bool).  So we can prune away
      the default case altogether.
      
      In implementing this, I re-factored this bit of the simplifier, elminiating
      prepareAlts from SimplUtils, and putting all the work into simplAlts in
      Simplify
      
      The proximate cause was a program written by Manuel using PArrays
      2763f56d
    • Simon Marlow's avatar
      Fix a bug in optimising division to shift right · 91a9aeeb
      Simon Marlow authored
      Division by an integral log2 can't be directly optimised to a shift
      right, because shift right behaves like a division that rounds to
      negative infinity, whereas we want one that rounds to zero.  Fix this
      by adding (divisor-1) to the dividend when it is negative before
      shifting.  We do this without jumps, generating very slightly worse
      code than gcc, which uses conditional moves on CPUs that support it.
      91a9aeeb
  17. 11 Apr, 2006 2 commits