Skip to content
  1. Aug 02, 2007
  2. Jul 11, 2007
  3. Jun 29, 2007
  4. Jun 19, 2007
  5. Jun 08, 2007
  6. Jun 05, 2007
  7. Jun 04, 2007
  8. Jun 02, 2007
  9. May 31, 2007
  10. May 30, 2007
  11. May 24, 2007
  12. May 23, 2007
    • Dale Johannesen's avatar
      Two tail merging improvements: · f4a77d24
      Dale Johannesen authored
      When considering blocks with more than 2 predecessors, merge the block with
      the largest number of matching insns, rather than the first block found.
      Considering that 1 matching insn is enough to show a win for candidates that
      already end with a branch.
      
      llvm-svn: 37315
      f4a77d24
  13. May 22, 2007
  14. May 18, 2007
  15. May 15, 2007
  16. May 11, 2007
  17. May 10, 2007
  18. May 07, 2007
  19. May 03, 2007
  20. May 02, 2007
  21. May 01, 2007
  22. Mar 20, 2007
  23. Feb 22, 2007
  24. Feb 21, 2007
  25. Feb 17, 2007
  26. Jan 26, 2007
  27. Dec 19, 2006
  28. Dec 06, 2006
  29. Nov 18, 2006
  30. Nov 08, 2006
    • Chris Lattner's avatar
      optimize single MBB loops better. In particular, produce: · bf3b57f2
      Chris Lattner authored
      LBB1_57:        #bb207.i
              movl 72(%esp), %ecx
              movb (%ecx,%eax), %cl
              movl 80(%esp), %edx
              movb %cl, 1(%edx,%eax)
              incl %eax
              cmpl $143, %eax
              jne LBB1_57     #bb207.i
              jmp LBB1_64     #cond_next255.i
      
      intead of:
      
      LBB1_57:        #bb207.i
              movl 72(%esp), %ecx
              movb (%ecx,%eax), %cl
              movl 80(%esp), %edx
              movb %cl, 1(%edx,%eax)
              incl %eax
              cmpl $143, %eax
              je LBB1_64      #cond_next255.i
              jmp LBB1_57     #bb207.i
      
      This eliminates a branch per iteration of the loop.  This hurted PPC
      particularly, because the extra branch meant another dispatch group for each
      iteration of the loop.
      
      llvm-svn: 31530
      bf3b57f2
Loading