2fce4db8b8
It optimizes for two cases: + The case when every node in the interference graph has degree less than K and is therefore trivially K-colorable. + The case when some node in the interference graph is K-colorable using simplify's node-subtraction heuristic. Therefore, no spilling will take place and no spill costs need be taken into account. |
||
---|---|---|
.. | ||
Compiler | ||
Debugger | ||
Driver | ||
Exports | ||
Includes/md | ||
Packages | ||
Quality | ||
Runtime | ||
Tools | ||
Utilities | ||
VM | ||
config | ||
gc | ||
Makefile | ||
README.html |