1. 12 Sep, 2007 6 commits
  2. 11 Sep, 2007 1 commit
  3. 12 Sep, 2007 1 commit
  4. 31 Aug, 2007 1 commit
  5. 06 Aug, 2007 2 commits
  6. 12 Sep, 2007 4 commits
  7. 11 Sep, 2007 3 commits
  8. 12 Sep, 2007 1 commit
    • chak@cse.unsw.edu.au.'s avatar
      Fix type error in MkZipCfg · 9173913b
      chak@cse.unsw.edu.au. authored
      - Fixes a bug introduced with the patch named 
        'check for unreachable code only with -DDEBUG'
      - Breakage occured only without -DDEBUG (which is 'valdiate's default!)
      9173913b
  9. 11 Sep, 2007 10 commits
  10. 10 Sep, 2007 1 commit
  11. 07 Sep, 2007 1 commit
    • Ben.Lippmeier@anu.edu.au's avatar
      Add iterative coalescing to graph coloring allocator · 12d0b388
      Ben.Lippmeier@anu.edu.au authored
      Iterative coalescing interleaves conservative coalesing with the regular
      simplify/scan passes. This increases the chance that nodes will be coalesced
      as they will have a lower degree than at the beginning of simplify. The end
      result is that more register to register moves will be eliminated in the
      output code, though the iterative nature of the algorithm makes it slower
      compared to non-iterative coloring.
      
      Use -fregs-iterative  for graph coloring allocation with iterative coalescing
          -fregs-graph      for non-iterative coalescing.
      
      The plan is for iterative coalescing to be enabled with -O2 and have a 
      quicker, non-iterative algorithm otherwise. The time/benefit tradeoff
      between iterative and not is still being tuned - optimal graph coloring
      is NP-hard, afterall..
      12d0b388
  12. 11 Sep, 2007 5 commits
  13. 07 Sep, 2007 1 commit
  14. 10 Sep, 2007 2 commits
  15. 11 Sep, 2007 1 commit