Skip to content
  1. Feb 12, 2009
  2. Feb 11, 2009
    • Dan Gohman's avatar
      Don't use special heuristics for nodes with no data predecessors · 6571ef35
      Dan Gohman authored
      unless they actually have data successors, and likewise for nodes
      with no data successors unless they actually have data precessors.
      
      llvm-svn: 64327
      6571ef35
    • Dale Johannesen's avatar
      Make a transformation added in 63266 a bit less aggressive. · cc5fc44d
      Dale Johannesen authored
      It was transforming (x&y)==y to (x&y)!=0 in the case where
      y is variable and known to have at most one bit set (e.g. z&1).
      This is not correct; the expressions are not equivalent when y==0.
      I believe this patch salvages what can be salvaged, including
      all the cases in bt.ll.  Dan, please review.
      Fixes gcc.c-torture/execute/20040709-[12].c
      
      llvm-svn: 64314
      cc5fc44d
    • Evan Cheng's avatar
      Implement PR3495: local spiller optimization. The local spiller can now keep... · a1968b0f
      Evan Cheng authored
      Implement PR3495: local spiller optimization. The local spiller can now keep availability information over BB boundaries. It visits BB's in depth first order. After visiting a BB if it find a successor which has a single predecessor it visits the successor next without clearing the availability information. This allows the successor to omit reloads or change them into copies.
      
      llvm-svn: 64298
      a1968b0f
  3. Feb 10, 2009
  4. Feb 09, 2009
  5. Feb 08, 2009
  6. Feb 07, 2009
  7. Feb 06, 2009
  8. Feb 05, 2009
  9. Feb 04, 2009
  10. Feb 03, 2009
  11. Feb 02, 2009
  12. Feb 01, 2009
  13. Jan 31, 2009
  14. Jan 29, 2009
  15. Jan 28, 2009
Loading