[LLVMdev] Converting into SSA form

[Chayan Sarkar]

E-path PRE requires the program in SSA form like SSAPRE algorithm.
Then it finds the eliminatable path (e-path) for an expression and
converts partially redundant to fully redundant and removes redundancy

Chayan

On Mon, Jun 7, 2010 at 1:58 PM, Eli Friedman <eli.friedman at gmail.com> wrote:
> On Sun, Jun 6, 2010 at 8:56 PM, Chayan Sarkar <chayan.ju at gmail.com> wrote:
>> Hi Jeffrey,
>>
>> Actually I am trying to implement "E-path PRE" which is based on
>> non-algebric equivallence. So, the  variable names need to be
>> preserved.
>
> Then why do you want to run mem2reg before your optimization in the first place?
>
> -Eli
>