[LLVMdev] GVN PRE algorithms in LLVM

[Rakshit Singla]

Hello everyone

I am Rakshit Singla, a third year undergrad at IIT Hyderabad, India. I
finished a basic compilers course last semester and am currently doing a
compiler optimizations course.  I have been exploring LLVM for the past few
months (wrote a front-end for the Classroom Object Oriented Language and
have been studying pieces of code.) I would like to work with LLVM and
contribute to the community.

For starters, I have a couple of questions.

What is the GVN algorithm used in LLVM? Is it the one by Alpern, Wegman,
Zadeck or Briggs, Cooper or some other?

How much of PRE is done in LLVM? Are any of the well known algorithms for
PRE used in LLVM?

Thanks and regards,
Rakshit Singla
Third Year Undergrad
Indian Institute of Technology Hyderabad
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20150309/7c13b477/attachment.html>