Quote: build register interference graph in two passes: bit matrix then adjacency vectors

Quotation Skeleton

The algorithm for building the interference graph [for register allocation] is therefore a two-pass algorithm. In the first pass over … [Intermediate Language (IL)] … [N by N] … vectors are storage allocated, and a second pass … believed that this two-pass approach is much better … article; non- segmented adjacency vectors can be processed … [Also] as nodes are coalesced the bit matrix … … In order to obtain a new interference graph … two-pass interference graph building algorithm is re-run on …   Google-1   Google-2

Copyright clearance needed for quotation.

Additional Titles

Quote: rebuild register interference graph after coalescing symbolic registers

Related Topics

Topic: register allocation by graph coloring (21 items)