Skip to content
  1. Oct 08, 2010
    • Chris Lattner's avatar
      Reimplement (part of) the or -> add optimization. Matching 'or' into 'add' · 4fb38d3c
      Chris Lattner authored
      is general goodness because it allows ORs to be converted to LEA to avoid
      inserting copies.  However, this is bad because it makes the generated .s
      file less obvious and gives valgrind heartburn (tons of false positives in
      bitfield code).
      
      While the general fix should be in valgrind, we can at least try to avoid
      emitting ADD instructions that *don't* get promoted to LEA.  This is more
      work because it requires introducing pseudo instructions to represents
      "add that knows the bits are disjoint", but hey, people really love valgrind.
      
      This fixes this testcase:
      https://bugs.kde.org/show_bug.cgi?id=242137#c20
      
      the add r/i cases are coming next.
      
      llvm-svn: 116007
      4fb38d3c
  2. Oct 06, 2010
  3. Oct 05, 2010
  4. Oct 03, 2010
  5. Sep 24, 2010
  6. Sep 22, 2010
  7. Sep 21, 2010
  8. Sep 17, 2010
  9. Sep 15, 2010
  10. Sep 09, 2010
  11. Sep 08, 2010
  12. Sep 07, 2010
  13. Sep 06, 2010
  14. Sep 03, 2010
  15. Aug 25, 2010
  16. Aug 23, 2010
  17. Aug 19, 2010
  18. Aug 14, 2010
Loading