Skip to content
  1. Mar 20, 2007
  2. Mar 19, 2007
  3. Mar 18, 2007
  4. Mar 17, 2007
  5. Mar 16, 2007
  6. Mar 15, 2007
  7. Mar 14, 2007
    • Evan Cheng's avatar
      Estimate a cost using the possible number of scratch registers required and use · b9e3db67
      Evan Cheng authored
      it as a late BURR scheduling tie-breaker.
      Intuitively, it's good to push down instructions whose results are liveout so
      their long live ranges won't conflict with other values which are needed inside
      the BB. Further prioritize liveout instructions by the number of operands which
      are calculated within the BB.
      
      llvm-svn: 35109
      b9e3db67
    • Evan Cheng's avatar
      Try schedule def + use closer whne Sethi-Ullman numbers are the same. · 28748553
      Evan Cheng authored
      e.g.
      t1 = op t2, c1
      t3 = op t4, c2
      and the following instructions are both ready.
      t2 = op c3
      t4 = op c4
      
      Then schedule t2 = op first.
      i.e.
      t4 = op c4
      t2 = op c3
      t1 = op t2, c1
      t3 = op t4, c2
      
      This creates more short live intervals which work better with the register
      allocator.
      
      llvm-svn: 35089
      28748553
  8. Mar 13, 2007
  9. Mar 09, 2007
  10. Mar 08, 2007
  11. Mar 07, 2007
  12. Mar 06, 2007
  13. Mar 05, 2007
  14. Mar 04, 2007
Loading