зеркало из https://github.com/mozilla/gecko-dev.git
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. |
||
---|---|---|
.. | ||
Coloring.cpp | ||
Coloring.h | ||
Liveness.cpp | ||
Liveness.h | ||
Makefile | ||
RegisterAllocator.cpp | ||
RegisterAllocator.h | ||
RegisterAssigner.h | ||
SSATools.cpp | ||
SSATools.h | ||
Spilling.cpp | ||
Spilling.h | ||
Timer.cpp | ||
Timer.h | ||
VirtualRegister.cpp | ||
VirtualRegister.h |