As I known that, a graph coloring register allocator was used in gcc-3.4.3.
The space complexity is O(n*n), which n is the number of variables.
The time complexity is also O(n*n). (every elements in the graph must be initialized)
(Am I right?......)
Is there a more efficient algorithm for register allocating used in Intel C++ compiler (or compiler for other programming language, just like Fortran ) ???
I think there maybe a algorithm for resgister allocating with space complexity of O(n), and time complexity of O(nlogn).
Thanks a lot.