Changes between Version 13 and Version 14 of Commentary/Compiler/Backends/NCG/RegisterAllocator
- Timestamp:
- 09/18/07 09:30:16 (6 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
Commentary/Compiler/Backends/NCG/RegisterAllocator
v13 v14 83 83 }}} 84 84 85 * Graphviz 85 * '''Visualisation of conflict graphs'''[[BR]] 86 Graphviz, available from [http://www.graphviz.org] can be used to make nice visualisations of the register conflict graphs. Use {{{-ddump-asm-regalloc-stages}}}, and copy one of the graphs into a new file {{{niceGraph.dot}}} 87 88 {{{ 89 graphviz/bin/circo -Tpng -o niceGraph.png 90 }}} 91 86 92 87 93 * checkSpills … … 92 98 93 99 * '''Work lists for iterative coalescing.'''[[BR]] 94 The iterative coalescing alternates between scanning the graph for trivially colorable (triv) nodes and perforing coalescing. When two nodes are coalesced, other nodes that are not adjacent to the coalesced nodes do not change and do not need to be rescanned straight away. Runtime performance of the iterative coalescer could probably be improved by keeping a work-list of "nodes that might have become trivially colorable", to help rescanningnodes that won't have changed.100 The iterative coalescing alternates between scanning the graph for trivially colorable (triv) nodes and perforing coalescing. When two nodes are coalesced, other nodes that are not adjacent to the coalesced nodes do not change and do not need to be rescanned straight away. Runtime performance of the iterative coalescer could probably be improved by keeping a work-list of "nodes that might have become trivially colorable", to help find nodes that won't have changed. 95 101 96 102 * '''Improve spill code generator/cleaner.'''[[BR]]
