similar to: [LLVMdev] PgmDependenceGraph

On 8/8/12 2:40 AM, David Huang wrote: > Hi All, > I want to build dependence graph for a function for forward slicing. I assume that this is something like reaching definitions analysis, correct? Just out of curiosity, do you need an intra-procedural analysis or an inter-procedural analysis? > I found the PgmDependenceGraph.cpp in a very old release of > poolalloc. But it seems to

I want to use PgmDependenceGraph pass , but my pass cannot work with PgmDependenceGraph. I tried again in Hello2 pass, and it could not work also. The following is I did with llvm/lib/Transforms/Hello.cpp: 1.insert #include "llvm/Analysis/PgmDependenceGraph.h" in Hello.cpp. 2.insert AU.addRequired<PgmDependenceGraph>() in the getAnalysisUsage(AnalysisUsage &AU) of Hello2.

I want to find buffer overflows from general C programs, a bit like SAFECode :). To quicken the dataflow analysis, I wished to slice operands of character strings from C program using pgmdepgraph, but now, I thought I have to use def-use and use-def chain. Do you think it has any sense? Xia ______________________________________ ע������30��������䣨 http://mail.sina.com.cn/chooseMode.html ��

Greeting. I am working on one DSA related project. Got several questions about LLVM's DSA analysis: 1. I looked through the llvm doc, it seems "-ds-aa" option is the one I should use. (http://llvm.org/docs/AliasAnalysis.html#the-ds-aa-pass). however based on the poolalloc's svn history, this option was removed on (or before) 2011. May I know why this one was removed ? and is

On 5/19/13 11:46 AM, Jing Zhou wrote: > Greeting. > > I am working on one DSA related project. Got several questions about > LLVM's DSA analysis: > > 1. I looked through the llvm doc, it seems "-ds-aa" option is the one > I should use. > (http://llvm.org/docs/AliasAnalysis.html#the-ds-aa-pass). however > based on the poolalloc's svn history, this

Am 19.04.2011 um 16:44 schrieb John Criswell: > On 4/19/11 5:57 AM, Andreas Wilhelm wrote: >> >> Hello, >> >> I found some code within the pool allocation project to identify parallelizable function calls. >> Unfortunately the functionality isn't part of the current release of poolalloc (in release 14 it was). > > Can you tell me in what file(s) this

Hi, Is there a way to use LLVM to build the visual representation of program dependence graph (PDG) of a routine/program? >From looking at https://llvm.org/svn/llvm-project/poolalloc/branches/release_14/lib/DSA/PgmDependenceGraph.cpp, it looks like there is an incomplete implementation of PDG in LLVM. However, when I search within LLVM3.0 package, I don't find the .cpp/h code. So, I also

Hello everyone ! I am trying to determine for certain Load instructions from my pass their corresponding Alloca instructions (that can be in other previous blocks). The chain can be something like : `TargetLoad(var) -> other stores/loads that use var (or dependencies on var) -> alloca(var).` , linked on several basic blocks. Do you know how can I do it? I tried to use the methods from

On 1/21/13 5:22 AM, Alexandru Ionut Diaconescu wrote: > Hello everyone ! > > I am trying to determine for certain Load instructions from my pass > their corresponding Alloca instructions (that can be in other previous > blocks). The chain can be something like : `TargetLoad(var) -> other > stores/loads that use var (or dependencies on var) -> alloca(var).` , > linked

On 04/20/2011 08:05 AM, Andreas Wilhelm wrote: > Am 19.04.2011 um 16:44 schrieb John Criswell: > >> On 4/19/11 5:57 AM, Andreas Wilhelm wrote: >>> Hello, >>> >>> I found some code within the pool allocation project to identify >>> parallelizable function calls. >>> Unfortunately the functionality isn't part of the current release of

Hello, everyone! I'm writing an automatic memory leak fixing tool recently. For my task, I'm using the DSA (Data Structure Analysis) for alias analysis. In my task, when I detect a memory leak, I need to find a pointer (in C) 'must-alias' with the corresponding resource. In DSA, I think if two Value* point to the same DSNode, they 'may-alias'. If two Value* point to

Dear Josh, > If I understand correctly, if you find memory leak, you want to find the corresponding call(s) to malloc() that allocated the memory object, correct? Can you more completely explain what you are trying to accomplish? Thanks for your reply. In my task, I use data flow analysis to locate a program point where a malloc must be leaked (by must leaked, I mean (a) it must be

On 12/16/16 9:53 PM, 杨至轩(Zhixuan Yang) via llvm-dev wrote: > Hello, everyone! > > I'm writing an automatic memory leak fixing tool recently. For my > task, I'm using the DSA (Data Structure Analysis) for alias analysis. > In my task, when I detect a memory leak, I need to find a pointer (in > C) 'must-alias' with the corresponding resource. If I understand

Harmen, your suggestion of inverting the mapping almost worked (and Andrew was correct that the function I need is the same as the one in which poolinit appears). Unfortunately, it appears that this mapping only considers the original function and not any of its clones. Since the pool descriptor in question may very well only exist in a clone, I can't use this. Is there another way?

Thanks for all your help so far. My problem is that what I have are the pool descriptors, which I by traversing the uses of poolinit and accessing the first argument of each call. I need to find the DSNode (in the original function) to which this pool descriptor corresponds. The rub is that this pool descriptor of course does not exist except in the clone. If I call getFuncInfo(), I get a

I figure (hopefully correctly) that I can iterate over all pool descriptors in a program by iterating over all users of poolinit and looking at the first argument. However, once I have a pool descriptor, I need to get its corresponding DSNode in the function in which it is complete (or in the global graph if it is a global). How do I do this? Thanks, --Patrick

Hi Patrick, That's right. DSNodes are coupled to the original function. For function clones, you first need to get the original function, and then use the DSNode from that function. FuncInfo contains the information if a function is a clone and what the original function is. If you want to find the corresponding DSNode for some instruction, you must call PA::FuncInfo::MapValueToOriginal(

Dear all, Is anyone aware of any implementation of an inter procedural slicing algorithm for LLVM? I am mostly interested in a static algorithm but a dynamic one can be helpful too. Thanks, Silviu Ganceanu Research Student, Ecole Polytechique Federale de Luasanne -------------- next part -------------- An HTML attachment was scrubbed... URL:

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 All, Are there any known implementations of static inter-procedural slicing for LLVM (especially forward slicing)? I did find a few references to it in the archives dating back to 2008, but am not sure what the current status is. Any pointers would be highly appreciated. Thanks Rohit Grad Student Middleware Security and Testing Group http://cs.wisc.edu/mist University of Wisconsin-Madison