mirror of
https://github.com/mozilla/gecko-dev.git
synced 2025-02-06 14:44:26 +00:00
e5af901910
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.