Re: SSA without phi

>> Anyway, maybe I'm just not using the simplest approach and I need to
>> get more familiar with SSA. I rename every variable by giving them a
>> completely new name (actually just a number), and keeping their old
>> name in a table. But a lot of tutorials on SSA give the variables an
>> index, and after optimization just drop the index and remove phi-
>> functions. Does that make the implementation more elegant?


>AFAICT, that is likely to be incorrect in the face of any non-trivial
>optimizations. Leaving SSA requires a real register allocation either
>way.
>With a graph based representation you don't get too attached to names;
>they are just pointers to nodes. If a full graph IR is too scary, you
>can always just use them inter-basic block. I guarantee that it will
>simplify your code.
>Tommy


That is incorrect. Leaving SSA does not require register allocation,
renaming plus color-out can guarantee dropping remaining names is
correct. Also retaining some names can be very useful for a production
compiler for debugging purposes


--
~Inderaj

Return to the comp.compilers page.
Search the comp.compilers archives again.