Michael Meissner wrote:
>
> | As far as I know, register allocation is done at the end of the global
> | optimization pass, just before code generation, using a technique called
> | graph coloring - which works best when the CPU has at least 16 registers
> | available, obviously not the case with x86 machines.
>
> Not really. After register allocation is the second scheduling pass, the
> delayed branch pass, peephole support and then emitting the assembler code. In
> addition, GCC does NOT use graph coloring for register allocation (that method
> is patented by IBM).
You are referred to the following DejaNews link:
http://x1.dejanews.com/getdoc.xp?AN=120687154&CONTEXT=895690490.972161229&hitnum=1
Cheers,
------------------------
André Balsa
andrebalsa@altern.org
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu