fur%netscape.com e5af901910 Faster interference graph simplification due to Amancio Hasty. ... 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.		1999-04-05 06:32:50 +00:00
..
CodeGenerator
FrontEnd
Optimizer
PrimitiveGraph
RegisterAllocator
Makefile