search for: akundu

...ell, SSAPRE is actually a fairly hard paper to implement correctly if this is your first go-around. If you want something that gives you an intro to PRE (though the formulation is not "standard" compared to most papers), take a look at http://researcher.watson.ibm.com/researcher/files/us-akundu/thesis-mtech.ps It's implementable, and it'll work, and doesn't require a large amount of detail discovery by the user. Also, if you look at LLVM's svn history, there are old PRE implementations that have been deleted: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Transforms/...

On Sun, Nov 3, 2013 at 1:02 AM, Daniel Berlin <dberlin at dberlin.org> wrote: > As for a "better" way to implement PRE, it depends on what algorithm > you want to use. If you just want to write a PRE pass, that's easy > enough without dominance frontiers. > I simply want to write a PRE pass to get a better understanding of the transformation. Any tips on where to

Is there a reason this is better than the modified algorithm created by Ferrante? It looks like yours has as bad a worst case time bound in reality. That is, the algorithm runs in O(sum of the size of all the dominance frontiers). http://www.cs.rice.edu/~keith/Embed/dom.pdf See figure 5. It will only touch nodes actually in the dominance frontier. This is what GCC uses. There are actually real