search for: alpern

...g 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...

...they are often > not practical. > The one i saw some hope for was > http://link.springer.com/chapter/10.1007%2F978-3-540-76637-7_22 > I haven't had a chance to play with it. If I recall correctly, AWZ will get this too (https://courses.cs.washington.edu/courses/cse501/04wi/papers/alpern-popl88.pdf). AWZ is a Hopcroft-partitioning-based algorithm, and Hopcroft partitioning is O(n*log(n)). -Hal > _______________________________________________ > LLVM Developers mailing list > llvm-dev at lists.llvm.org > http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev -- H...

...r 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 T...

...; I haven't had a chance to play with it. This looks very promising, thank you. On Wed, 4 May 2016 at 11:01 Daniel Berlin <dberlin at dberlin.org> wrote: > >> If I recall correctly, AWZ will get this too ( >> https://courses.cs.washington.edu/courses/cse501/04wi/papers/alpern-popl88.pdf). >> AWZ is a Hopcroft-partitioning-based algorithm, and Hopcroft partitioning >> is O(n*log(n)). >> >> Yes, AWZ will get some, and the hash based ones will get some different > ones. > > The one i have implemented unifies AWZ and hash based and will also...

Hi, Can someone tell which algorithm is used for GVN in LLVM? -- Rekha -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20130928/ca06c78a/attachment.html>

Hello, I was hoping to get some clarification on the aim of the GVN pass. I have been reading a bit about global value numbering, and from what I understand, there are polynomial time algorithms for removing duplicate computations from loops[1]. I have an example program[2] which computes the sum of an array twice, in two separate accumulators. Here, sum0 and sum1 are both sums of the array A.

...of the dominator concept.> 3) Allen '70: Control flow analysis 4) Allen & Cocke '76: A program data flow analysis procedure 5) Ferrante et al. '87: The program dependence graph and its use in optimization 6) Rosen et al. '88: Global value numbers and redundant computations 7) Alpern et al. '88: Detecting equality of variables in programs 8) Cytron et al. '91: Efficiently computing static single assignment form and the control dependence graph Many thanks for taking the time to read through all this. I would be very happy to receive any feedback on these plans, and aga...