similar to: [LLVMdev] Andersen alias analysis

Hello, I am researching a more efficient approach to subset-based alias analysis in the style of Andersen's algorithm, and I noticed that there used to be an implementation of that for LLVM back in 2.6 (-anders-aa) which was removed because it was "not being actively maintained and had substantial problems". I'd be interested in knowing what was wrong with it (other than

On 9/19/11 9:12 PM, Manish Gupta wrote: > Dear All, > > I am curious to know the reason for removal of andersen pointer > analysis. Is it because of some issues? We need it on llvm-2.9, if > possible. > > Do we have some better version of pointer analysis on llvm-2.9? The Data Structure Analysis pass (DSA) is a unification-style points-to analysis. It should work with

Dear All, I am curious to know the reason for removal of andersen pointer analysis. Is it because of some issues? We need it on llvm-2.9, if possible. Do we have some better version of pointer analysis on llvm-2.9? Thanks, Manish -------------- next part -------------- An HTML attachment was scrubbed... URL:

The README at the location shared by John says "DSA is undergoing significant changes and may not be entirely stable or correct. See lib/DSA/README" So, I was wondering from where should one pick the code. Although I will start my analysis and see how results turn out to be. But any comments on this line will be helpful. Thanks Manish On Tue, Sep 20, 2011 at 5:13 PM, Manish Gupta

Thanks Everyone for the info. I am planning to work with DSA on llvm-2.9. Hope it is working as John mentioned. Manish On Tue, Sep 20, 2011 at 7:06 AM, John Criswell <criswell at illinois.edu>wrote: > On 9/19/11 9:12 PM, Manish Gupta wrote: > > Dear All, > > I am curious to know the reason for removal of andersen pointer analysis. > Is it because of some issues? We

Hi, I was working on alias analysis using LLVM-2.6 previously. But I just downloaded LLVM-2.7 and found AndersenAA is not there. What happened for andersen's IPA alias analysis? Has it been deleted for some reason? Thanks. Lei -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hello, I am currently working with the implementation of CFL Andersen algorithmand I am trying to do some improvements to the Andersen algorithm. I would like to create loadable module .so and run clang with my e.g. "cfl-anders-improved.so" to avoid the "long" way - generating IR, running opt with my improved algorithm to generate optimalized code and then building it. Is a

I am currectly experimenting with -Xclang option.. I have a simple pass (to just print function names). I ran: clang -Xclang -load -Xclang LLVMHello.so t.c but nothing was printed, no output from the pass. when I run: opt -load LLVMHello.so -hello t.ll I get the output from pass (i.e. list of function names) Part of the source ode of the Hello pass: struct Hello : public FunctionPass {

I have a problem where I add an Andersens AA pass to the pass manager, but it appears to get invalidated by another pass, and never rerun. My understanding from reading the documentation is that when a pass gets invalidated, it should be rerun before any other passes that requires it. Here is a simple example of the problem I am seeing: PassManager passManager; passManager.add(new

Might I suggest the following patch, because this issue has bite me too? You're lured in by the initial good results from the Andersens alias analysis, only to discover the bugs later on. Robert Zeh On Aug 26, 2009, at 9:11 PM, Chris Lattner wrote: > On Aug 26, 2009, at 6:40 PM, Max Stonebraker wrote: >> Hello, >> >> Does the LLVM Andersens alias analysis handle

At one point it handled function pointers. As chris says, it's buggy and probably broken. Some function pointers also do point to the universal set (like global function pointers). On Wed, Aug 26, 2009 at 10:11 PM, Chris Lattner<clattner at apple.com> wrote: > On Aug 26, 2009, at 6:40 PM, Max Stonebraker wrote: >> Hello, >> >> Does the LLVM Andersens alias analysis

Thanks for the reply. Would you happen to know whether there a global alias analysis written for LLVM that is more robust? Is the Steensgaard pass any more reliable? Max On Thu, Aug 27, 2009 at 10:01 AM, Daniel Berlin <dberlin at dberlin.org> wrote: > At one point it handled function pointers. > As chris says, it's buggy and probably broken. > Some function pointers also do

On Aug 26, 2009, at 6:40 PM, Max Stonebraker wrote: > Hello, > > Does the LLVM Andersens alias analysis handle function pointers > precisely? I ran it and it looks like it says every function points > points to the universal set. Is this what I should expect? Hi Max, I don't know the answer offhand but please keep in mind that the current andersen's pass has many

Hello, I am interested in producing the expected number of events, in a recurring events setting. I am using the Andersen-Gill model, as fit by the function "coxph" in the package "survival." I need to produce expected numbers of events for a cohort, cumulatively, at several fixed times. My ultimate goal is: To fit an AG model to a reference sample, then use that fitted model

Dear all, I use the Andersen plot to check for proportional hazards assumption for a factor (say x) in the Cox regression model and obtained a straight line that pass through the origin. However, the formal test done by the R-function cox.zph, which is based on the plot of Schonefeld residuals against time, indicates that proportional hazards assumption is violated. Further, a plot of the score

Hi Xin, Thank you for your reply! I have tried the 3 alias analyses you have mentioned on LLVM 3.5: 1) $ opt -globalsmodref-aa -aa-eval < xxx.bc > /dev/null (May-alias response 100%) 2) $ opt -tbaa -aa-eval < xxx.bc > /dev/null (May-alias response 100%) 3) $ opt -cfl-aa -aa-eval < xxx.bc> /dev/null (Unknown command line argument '-cfl-aa') It seems that they are not

Hi, LLVM dev team: Thanks for your suggestion, I have done the experiment to compare the two pointer analysis(Andersen and Steensgaard) methods in LLVM, but the result was unexpected. In each test, I compare these two methods using same optimization; There are several tests, each with a different optimization. The benchmark is all the 11 C programs in CINT2000 of SPEC. In all the tests, I found

Hi, LLVM dev team: Thanks for your suggestion, I have done the experiment to compare the two pointer analysis(Andersen and Steensgaard) methods in LLVM, but the result was unexpected. In each test, I compare these two methods using same optimization; There are several tests, each with a different optimization. The benchmark is all the 11 C programs in CINT2000 of SPEC. In all the tests, I found

On Aug 9, 2007, at 1:52 PM, David Greene wrote: > So how do I get opt to use Andersens instead of basicaa, for example? Following uses basic alias analysis $ opt -licm foo.bc -disable-output -debug-pass=Structure where as $ opt -anders-aa -licm foo.bc -disable-output -debug-pass=Structure uses Andersens analysis algorithm implementation. - Devang

Hi Damien, I think the problem is that when the passmanager sees an Alias Analysis available, it will use that, but when none is available, it will always run the default implementation (BasicAA), regardless of any alias analysis's run before. This means you should insert Andersen's before any pass that needs it. I suspect (not sure though) that the passmanager will not rerun