Mozilla

History

fur%netscape.com 7e85101bed 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.


git-svn-id: svn://10.0.0.236/trunk@26282 18797224-902f-48f8-a5cc-f745e15eee43

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

CodeGenerator

Renamed to x86Stub_gas.s

1999-02-28 00:20:52 +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

Initial check-in of ElectricalFire, a Java JIT compiler.

1998-12-03 21:10:47 +00:00

PrimitiveGraph

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