similar to: [LLVMdev] Bringing back Andersen-like alias analysis

Hello, we, at the Masaryk University, have developed an interprocedural static slicer with other useful stuff. This includes Andersen's points-to analysis, accurate call-graph, modifies relations. The whole code is available in this repository: https://github.com/jirislaby/LLVMSlicer The question I would like to ask is, would you accept this library into the core LLVM if we send patches or

Hi js, On Feb 13, 2012, at 8:49 AM, Jiri Slaby <jirislaby at gmail.com> wrote: > Hello, > > we, at the Masaryk University, have developed an interprocedural static > slicer with other useful stuff. This includes Andersen's points-to > analysis, accurate call-graph, modifies relations. > > The whole code is available in this repository: >

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:

On 02/14/2012 07:26 AM, Evan Cheng wrote: > Hi js, > > On Feb 13, 2012, at 8:49 AM, Jiri Slaby <jirislaby at gmail.com> wrote: > >> Hello, >> >> we, at the Masaryk University, have developed an interprocedural static >> slicer with other useful stuff. This includes Andersen's points-to >> analysis, accurate call-graph, modifies relations.

Hello, I am curious to know if LLVM offers any passes to do interprocedural slicing, I need to eliminate most of the computations(possibly all, if they don't influence the control flow), but the control flow of the program should be maintained at all cost. I did see an optimization pass to print the CFG of a function without its body to a dot file, but I am interested in generating the

Hi all, This is a GSoC 2013 proposal for LLVM project. Please see the formatted version at here: http://pacman.cs.tsinghua.edu.cn/~liuml07/files/gsoc2013-proposal-program-slicing.pdf Program slicing has been used in many applications, the criteria of which is a pair of statement and variables. I would like to write an inter-procedural program slicing pass in LLVM, which is able to calculate C

Hi, 1. How can I report a bug or commit a patch to the giri progject? I doubt this central commit list is the right place. 2. Are you still maintaining the giri project any more? Thank you. L On Thu, Jun 28, 2012 at 12:49 AM, John Criswell <criswell at illinois.edu>wrote: > On 6/26/12 5:07 PM, amruth.rd wrote: > > Hello, > > > > I am curious to know if

On 6/26/12 5:07 PM, amruth.rd wrote: > Hello, > > I am curious to know if LLVM offers any passes to do interprocedural slicing, I need to eliminate most of the computations(possibly all, if they don't influence the control flow), but the control flow of the program should be maintained at all cost. I did see an optimization pass to print the CFG of a function without its body to a

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

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

Hi all, I had a second thought of the dynamic slicing, as well as the source code generating. Firstly, the dynamic slicing is very useful to software community (I'll illustrate more in the refined proposal later), but it's already implemented by Swarup and John Criswell from UIUC. The static slicing code has been released as Giri project in LLVM, and they would kindly release the dynamic

Thanks for the replies, Daniel and Matthijs. I added some code to generate the copy constraint, which I think (in the present form) is wrong (or at best not field sensitive): +void Andersens::visitGetResultInst(GetResultInst &GR) { + if (isa<PointerType>(GR.getType())) + { + // P1 = getresult P2 --> <Copy/P1/P2> +

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:

Hi Prakash, I think this is highly related to PR2527 [1] and PR2451 [2]. I assume you are using LLVM 2.3, since current svn automatically replaces getresult with extractvalue instructions (but doesn't help for Andersen's). In either case, it seems that Andersen's currently has no ready made way to indicate a part of a first-class aggregate (or vector), which is the essence of the

On Thursday 09 August 2007 19:21, Chris Lattner wrote: > Interesting question, I don't have an answer to this. To make things more > complicated, you can have multiple instances of an analysis group and may > want different things at different times: > > -basicaa -licm -something_that_invalidates_aa -andersaa -licm -whatever Some questions about that: How does this

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

Hi Danny, I captured this as PR359: http://llvm.org/PR1359 Reid. On Wed, 25 Apr 2007 14:09:14 -0400 "Daniel Berlin" <dberlin at dberlin.org> wrote: > Hi guys, i'm not going to have time to work on this for >a month or > two, so i figured i'd post it. > > This patch > > 1. reworks the andersen's implementation to support >field

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