similar to: [LLVMdev] DSGraph::computeCalleeCallerMapping failing

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> >

Hi, I am not exactly sure what causes your error. But if you have a reduced test case we can try looking at it. Thanks, Arushi Hello, i wrote a little pass. It tries to identify every call- / invoke-instruction recursively and calls computeCalleeCallerMapping for each. The sample program just creates a vector of integer and adds an element to it. Do you know what's wrong? Best,

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

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?

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

Hello friends! I have an application to list different kinds of institution names. So I have one table "instits" for the institutions and another table "nome_instits" for their names. For test, I put two rows inside "instits" and three names for the first institution and two names for the last. Then I created this controller: class ServInstitController <

1. What is the difference between DSNodeHandle and DSNode? What do the functions getLink() and getSize() do? 2. In the previous email, you mentioned that we can use DSNode::getPointerSize() to get the number of links, But I checked the doxygen documentation, there is no such member for DSNode. 3. Previously I use the following code: for( df_iterator<DSNode*> I = df_begin(pnode),

> 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*,

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

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 =

The following function produces a segv when the begin() is taken from vmap, the ScalarMap... bool StaticMemAnalysis::isSingleMalloc(DSGraph* theGraph,DSNode* theNode) { int count = 0; std::map<Value*, DSNodeHandle>& vmap = theGraph->getScalarMap(); for (std::map<Value*, DSNodeHandle>::iterator i = vmap.begin(); i != vmap.end(); ++i) { if(i->second.getNode() ==

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.

On Thu, 28 Nov 2002, Chris Lattner wrote: > > > The following function produces a segv when the begin() is taken from > > vmap, the ScalarMap... > > int count = 0; > > std::map<Value*, DSNodeHandle>& vmap = theGraph->getScalarMap(); > > Are you sure "theGraph" is not null at this point? yes... that call returns sucessfully. the segfault

Hi, though DSA isn't maintained in the current build, I need to use it for analyzing dependencies among functions. Therfore I load the EQTDDataStructures pass and retrieve the mapping from nodes int the callee to the ones in the parent DSGraph with computeNodeMapping. In most cases this works well, but for some function calls I get following error: DSGraph.cpp:1379: static void

On Thu, Apr 3, 2008 at 4:53 PM, Zvonimir Rakamaric <zrakamar at gmail.com> wrote: > Thanks guys! > > I was looking into ModRef before, but I don't think that's exactly > what I need. ModRef API call getModRefInfo requires a Value to be > passed to it. However, some memory location M (which is a <DSNode, > offset> pair) visible to the caller can be modified

> ...... > DSGraph* DSG = getAnalysis<BUDataStructures>().getDSGraph( F ); > std::map< Value*, DSNodeHandle> scalarmap = DSG->getScalarMap(); > ...... > > The scalarmap is always empty. I printed the size of the map which came > out to be zero always. But the getNodeForValue works correctly for the > same DSG, which means that the scalarmap cannot be

Chris, We tried that too...but still it returns an empty map. We also saw that Scalar Type has been removed from the DSNode types. Why is that? Thanks, Ganesh On Wed, 20 Nov 2002, Chris Lattner wrote: > > ...... > > DSGraph* DSG = getAnalysis<BUDataStructures>().getDSGraph( F ); > > std::map< Value*, DSNodeHandle> scalarmap = DSG->getScalarMap(); > >

> The following function produces a segv when the begin() is taken from > vmap, the ScalarMap... > int count = 0; > std::map<Value*, DSNodeHandle>& vmap = theGraph->getScalarMap(); Are you sure "theGraph" is not null at this point? -Chris > for (std::map<Value*, DSNodeHandle>::iterator i = vmap.begin(); i > != vmap.end(); ++i) { >

On Fri, Apr 4, 2008 at 2:38 AM, Andrew Lenharth <andrewl at lenharth.org> wrote: > On Thu, Apr 3, 2008 at 4:53 PM, Zvonimir Rakamaric <zrakamar at gmail.com> wrote: > > Thanks guys! > > > > I was looking into ModRef before, but I don't think that's exactly > > what I need. ModRef API call getModRefInfo requires a Value to be > > passed

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