| 
|
Quote: rebuild interference graph after coalescing nodes; two or three iterations, much smaller graphs
topics >
all references >
references c-d >
Topic:
register allocation by graph coloring
Quotation Skeleton
In order to obtain a new interference graph … [intermediate language] is rewritten in terms of coalesced symbolic registers, and the … In practice two or three iterations will do. … [p. 100] compile time is dominated by that required … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: register allocation by graph coloring (21 items)