Skip to content
  1. Jul 23, 2008
    • Dan Gohman's avatar
      Enable first-class aggregates support. · fa1211f6
      Dan Gohman authored
      Remove the GetResultInst instruction. It is still accepted in LLVM assembly
      and bitcode, where it is now auto-upgraded to ExtractValueInst. Also, remove
      support for return instructions with multiple values. These are auto-upgraded
      to use InsertValueInst instructions.
      
      The IRBuilder still accepts multiple-value returns, and auto-upgrades them
      to InsertValueInst instructions.
      
      llvm-svn: 53941
      fa1211f6
  2. Jun 03, 2008
  3. May 30, 2008
  4. May 26, 2008
  5. May 23, 2008
  6. May 15, 2008
  7. May 13, 2008
  8. May 03, 2008
  9. Apr 06, 2008
  10. Feb 20, 2008
  11. Dec 29, 2007
  12. Aug 21, 2007
  13. Aug 17, 2007
  14. Jul 30, 2007
  15. Jul 19, 2007
  16. Jul 16, 2007
  17. Jul 14, 2007
  18. Jun 07, 2007
  19. Jun 04, 2007
  20. Jun 03, 2007
  21. May 11, 2007
  22. May 06, 2007
  23. May 03, 2007
  24. May 02, 2007
  25. May 01, 2007
  26. Apr 19, 2007
  27. Apr 18, 2007
  28. Apr 15, 2007
  29. Feb 06, 2007
  30. Feb 05, 2007
  31. Dec 19, 2006
  32. Dec 06, 2006
  33. Oct 31, 2006
  34. Aug 28, 2006
  35. 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
  36. Jul 09, 2006
Loading