Skip to content
  1. Aug 02, 2006
    • Chris Lattner's avatar
      Add special check to avoid isLoop call. Simple, but doesn't seem to speed · 38b6e838
      Chris Lattner authored
      up lcssa much in practice.
      
      llvm-svn: 29465
      38b6e838
    • Chris Lattner's avatar
      Replace the SSA update code in LCSSA with a bottom-up approach instead of a top · 5a2bc786
      Chris Lattner authored
      down approach, inspired by discussions with Tanya.
      
      This approach is significantly faster, because it does not need dominator
      frontiers and it does not insert extraneous unused PHI nodes.  For example, on
      252.eon, in a release-asserts build, this speeds up LCSSA (which is the slowest
      pass in gccas) from 9.14s to 0.74s on my G5.  This code is also slightly smaller
      and significantly simpler than the old code.
      
      Amusingly, in a normal Release build (which includes the
      "assert(L->isLCSSAForm());" assertion), asserting that the result of LCSSA
      is in LCSSA form is actually slower than the LCSSA transformation pass
      itself on 252.eon.  I will see if Loop::isLCSSAForm can be sped up next.
      
      llvm-svn: 29463
      5a2bc786
  2. Jul 27, 2006
  3. Jul 20, 2006
  4. Jul 19, 2006
  5. Jul 18, 2006
  6. Jul 15, 2006
  7. Jul 14, 2006
  8. Jul 13, 2006
  9. Jul 12, 2006
  10. Jul 11, 2006
  11. Jul 10, 2006
  12. Jul 09, 2006
  13. Jul 07, 2006
  14. Jun 29, 2006
  15. Jun 28, 2006
  16. Jun 27, 2006
  17. Jun 26, 2006
  18. Jun 17, 2006
  19. Jun 16, 2006
Loading