similar to: [LLVMdev] DSGraph Fixes

Hi all DSGraph users... This is a note to let you know that I just checked in a rather large change to the data structure graph representation. Here are the bonuses of the new representation: 1. Only the DSNode interface changed, mostly in implementation details, so hopefully client code shouldn't be effected. As a metric, nothing had to change in BottomUp or TopDownClosure.cpp for

Hi, I believe shouldHaveNodeForValue() should return false for ConstantPointerNullValue. Fixed in r121707. Arushi On Mon, Dec 13, 2010 at 12:10 PM, Kevin Streit <kevin.streit at googlemail.com>wrote: > I'm using BUDataStructures... But I tried LocalDatastructures and it didn't > work either... > On Dec 13, 2010 6:52 PM, "Arushi Aggarwal" <arushi987 at

Hi, I'm using DSAnalysis in order to get some points to information. In my particular case for a CallSite. Everything is working well except for some special cases. Consider the following example code: // ====================== void m(short *s) { return; } int main() { m(0); } // ====================== The call to method m in the main method is translated to

I've been trying to merge DSGraphs from different Functions, but i'm not going anywhere. For a Function F and DSGraph G, I tried this (assumming no SCC in the callgraph): vector<DSCallSite> CSV = G->getAuxFunctionCalls(); for (vector<DSCallSite>::iterator I = CSV.begin(), E = CSV.end(); I != E; I++) { Value *V = I->getCallInst().getOperand(0); Function &SF

On 3/4/13 8:05 AM, Kevin Streit wrote: > Hi, > > during the hunt for a bug causing strange behavior of our automatic > parallelization framework, > I found some, at least for me, unexpected behavior of the > DataStructureAnalysis in Poolalloc. > > Consider the following simplified program: > > ==================== > int ARR[4] = {1, 2, 3, 4}; > > int a(int

I have checked in a directory called test/DSGraphs, with one subdirectory for each of the test cases in test/Programs/{Single,Multi}Source/. Running gmake in test/DSGraphs will generate DS graphs for each of the programs for which the bytecode for the original program exists. This includes graphs for a number of large benchmarks, such as the SPEC codes that currently have bytecode available.

I use the following code to do the depth first search on the DSGraph. And I always got this error message. Couldn't figure out what's wrong. Could you please let me know? Besides, I really have no idea about what those functions do. Is there any documentation about DSGraph functions besides the pool allocation paper? Thanks, xiaodong Code: for( df_iterator<DSNode*> I =

> If I have a DSGraph dsg, I want to duplicate a DSgraph which is exactly > the same with dsg. How should I do that? Should I use DSGraph dsg2 = > dsg; or use some other methods? Yes, use the copy constructor. If you want mapping between the original and the new graph's nodes, you can also use this form of the copy ctor: DSGraph(const DSGraph &DSG, std::map<const DSNode*,

Dear LLVM, I was wondering if this is the right way to get TopDown DSGraph? TDDataStructures &TD = getAnalysis<TDDataStructures>(); F is some function DSGraph &dsg = TD.getDSGraph(F); I found out the DSGraph I got using this method is actually bottom up DSGraph, can you let me know why? Thanks, xiaodong

> I was wondering if this is the right way to get TopDown DSGraph? > TDDataStructures &TD = getAnalysis<TDDataStructures>(); > F is some function > DSGraph &dsg = TD.getDSGraph(F); Yes, that's the right way. > I found out the DSGraph I got using this method is actually bottom up > DSGraph, can you let me know why? Why do you think it's a BU graph? -Chris

Thanks, Chris. Actually I got the following graph from my program: digraph DataStructures { label="Function fini"; edge [arrowtail="dot"]; size="10,7.5"; rotate="90"; Node0x100ae1c40 [shape=record,shape=Mrecord,label="{ %struct.a: HIMR\n|{<g0>|<g1>|<g2>}}"]; Node0x100ae1c40:g1 -> Node0x100ae1e00;

I was trying to call "DSGraph::computeCalleeCallerMapping" function on all caller-calle pair. But, in one case it gives an assertion failure. This is the error message I get. Processing internal callee function rt_error opt: /localhome/ssahoo2/llvm/src/lib/Analysis/DataStructure/DataStructure.cpp:2248: static void llvm::DSGraph::computeNodeMapping(const llvm::DSNodeHandle&, const

Dear LLVM, If I have a DSGraph dsg, I want to duplicate a DSgraph which is exactly the same with dsg. How should I do that? Should I use DSGraph dsg2 = dsg; or use some other methods? Thanks, xiaodong

I've been using DSGraph->dump() to get the DSGraph of some functions, but the report make little sense to me. I'm specially looking for the "N" flag mentioned by prof. vikram yesterday. How can I read the results (so that I can manually verify that my passes are making a good job) or there is some other DSGraph function better suited for human consumption? tia nicolas

I've been trying to obtain a DSGraph for a complete module, but haven't succeeded. I tried - getting the DSGraph for each function, and copying the nodes to a Module graph. But since there are no nodehandles, apparently there is no merging of nodes. - modifying BUDataStructure Pass so that it will not execute removeDeadNodes() or removeTriviallyDeadNodes(). - couldn't get

I'll try to answer these because Chris is really busy this week. > From: Xiaodong Li <xli3 at santoor.cs.uiuc.edu> > Subject: [LLVMdev] DSGraph questions > Sender: llvmdev-admin at cs.uiuc.edu > Date: Sun, 10 Nov 2002 11:25:53 -0600 (CST) > > 1. What is the difference between DSNodeHandle and DSNode? What do the > functions getLink() and getSize() do?

I tried with bugpoint, but it still give a large code. I have attached the bugpoint output file. ---- Original message ---- >Date: Fri, 1 Dec 2006 12:57:55 -0600 >From: "Andrew Lenharth" <andrewl at lenharth.org> >Subject: Re: [LLVMdev] DSGraph::computeCalleeCallerMapping failing >To: "LLVM Developers Mailing List" <llvmdev at cs.uiuc.edu> >

Dear Prof. Adve, I recently checked out the llvm using cvs update command under the llvm directory. But when I went to see the DSNode.h, there is no getPointerSize function. I checked the doxygen tree, it's there. So that means I didn't update my cvs tree correctly. Could you let me know how to update my CVS tree? Or there is a problem at somewhere else? Thanks, xiaodong On Sun, 10 Nov

On Sun, Nov 6, 2011 at 12:24 AM, Ankita (Garg) Goel <gargankita at gmail.com> wrote: > Hi, > I am using the DSA analysis in llvm-3.0. I am interested in seeing the > resultant DSGraph for my sample input program. I tried the -dsa-only-print > parameter, but was not successful in getting the .dot file for the graph as > mentioned in Printer.cpp. The exact command that I tried

DSGraph.h has a prototype in it with a std::string& parameter, but does not include <string>. -- Casey Carter Casey at Carter.net ccarter at uiuc.edu AIM: cartec69 -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: patch URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20021027/a98ab220/attachment.ksh>