L2Register Colorer
Used to compute which registers can use the same storage due to not being active at the same time. This is called register coloring.
Author
Mark van Gulik
Parameters
control Flow Graph
The given L2ControlFlowGraph.
Constructors
Functions
Link copied to clipboard
Now that the interference graph has been constructed, merge together any non-interfering nodes that are connected by a move.
Link copied to clipboard
Determine colors for all registers. We use a simple coloring algorithm here, since both L2 and the JVM have an effectively unbounded number of virtual registers, and we're merely interested in keeping the color count as reasonably close to minimal as we can.
Link copied to clipboard
Calculate the register interference graph.