[LLVMdev] Converting into SSA form

[Alistair Lynn]

Hello Chayan-

I think you might find Kaleidoscope tutorial (http://llvm.org/docs/tutorial/), particularly the section on mutable variables and SSA construction (http://llvm.org/docs/tutorial/LangImpl7.html), useful here.

Alistair

On 5 Jun 2010, at 10:03, Chayan Sarkar wrote:

> But, the mem2reg pass removes all load store instructions. It replaces
> all variables by their if possible (kind of constant propagation). I
> have generated the bitcode of the source program and the applied the
> mem2reg pass and obviously not getting desired thing.
> 
> What I want is convert it into SSA form without replacing any variable
> by their constant value. Please elaborate on your point.
> 
> Also, what call an inbuilt pass from my own pass after doing some analysis.
> 
> Thank you & regards,
> Chayan
> 
> On Tue, Jun 1, 2010 at 10:59 PM, Ander Martinez <dwarfnauko at gmail.com> wrote:
>> You can use STOREs and LOADs on memory and then use mem2reg pass.
>> 
>> 2010/6/1 Chayan Sarkar <chayan.ju at gmail.com>:
>>> Hi,
>>> 
>>> Can anyone tell me, whether it is possible to convert a program into
>>> SSA form without considering algebric equivalence ?
>>> 
>>> regards,
>>> Chayan
>>> _______________________________________________
>>> LLVM Developers mailing list
>>> LLVMdev at cs.uiuc.edu         http://llvm.cs.uiuc.edu
>>> http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev
>>> 
>> 
> 
> _______________________________________________
> LLVM Developers mailing list
> LLVMdev at cs.uiuc.edu         http://llvm.cs.uiuc.edu
> http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev