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

Ignore generated files

1999-02-28 00:22:25 +00:00

FrontEnd

Gratuitous change to work around bug that appears in egcs 1.0.3

1999-02-09 00:08:41 +00:00

Optimizer

…

PrimitiveGraph

Fix problems in which functions had 'inline' keyword in definition

1999-02-26 08:18:38 +00:00

RegisterAllocator

Faster interference graph simplification due to Amancio Hasty.

1999-04-05 06:32:50 +00:00

Makefile

…