| 
|
QuoteRef: chaiGJ_1981
topics >
all references >
ThesaHelp:
references c-d
Topic:
register allocation
Topic:
register arguments to subroutines
Topic:
graph coloring
Topic:
register allocation by use-def graphs
Topic:
register allocation by graph coloring
Reference
Chaitin, G.J., Auslander, M.A., Chandra, A.K., Cocke, J., Hopkins, M.E., Markstein, P.W., "Register allocation via coloring", "Computer Languages ", 6, pp. 47-57 , 1981 . Google
47 ;;Quote: register allocation maps unlimited symbolic registers into real registers
47 ;;Quote: automatic scalars and subroutine arguments should be kept in registers
48 ;;Quote: chromatic number of a graph is the minimal number of colors to color the graph
48 ;;Quote: assign different registers for same variable in different connected components of its def_use chains
49 ;;Quote: two register names interfere if one is live at definition of the other
50 ;;Quote: coalesce nodes of register interference graph to prevent unnecessary copying
50 ;;Quote: coalesce registers for condition code computations, self modifying operations, and register specific operations
51+ ;;Quote: add spill code if can not n_color the register interference graph
51 ;;Quote: n_color a graph by removing nodes with fewer then n colors; many graphs fully colored
51 ;;Quote: backtrack graph coloring according to urgency, i.e., uncolored_neighbors div unused_colors
51 ;;Quote: in graph coloring, urgency ranking sometimes useful but backtracking was not
ThesaHelp: references c-d (337 items)
Topic: register allocation (28 items)
Topic: register arguments to subroutines (2 items)
Topic: graph coloring (7 items)
Topic: register allocation by use-def graphs (9 items)
Topic: register allocation by graph coloring (21 items)