search for: dsgraphs

When I tried to compile the program, I got this error: ../../../include/llvm/Analysis/DSGraph.h: In member function `virtual bool <unnamed>::GlobalMemLeakage::run(Module&)': ../../../include/llvm/Analysis/DSGraph.h:38: `void DSGraph::operator=(const DSGraph&)' is private MemLeakage.cpp:87: within this context gmake: *** [Debug/MemLeakage.o] Error 1 I don't

Thanks Bill. One more question, when I use the DSNode iterator to traverse a node's children. The return value of I.getNode() can only be 'const DSNode *', I cannot use 'DSNode *' type. So as a result, I always get error message like this: MemLeakage.cpp:159: invalid conversion from `const DSNode*' to `DSNode*' MemLeakage.cpp:159: initializing argument 1 of `void

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

Hello, I’m trying to port a project up to 4.0 and I’m seeing the following error: In file included from /Users/jaredcarlson/Projects/llvm-4.0.0.src/include/llvm/ADT/StringRef.h:13: /Users/jaredcarlson/Projects/llvm-4.0.0.src/include/llvm/ADT/STLExtras.h:139:13: error: no type named 'type' in 'std::__1::result_of<std::__1::pointer_to_unary_function<llvm::DSNode *, llvm::DSNode

Dear LLVM, I need to do interprocedural analysis for my project. I was wondering if you can tell me how to create Bottom Up DSGraph and Call Graph in the program. I know DSGraph *dsg = new DSGraph( F ) can create a DSGraph, but looks like that's only local DSGraph. I also need to know how to create the call graph for the whole module in the program. Thanks, xiaodong

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

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;

Also sprach Xiaodong Li: } } When I tried to compile the program, I got this error: } } ../../../include/llvm/Analysis/DSGraph.h: In member function `virtual bool } <unnamed>::GlobalMemLeakage::run(Module&)': } ../../../include/llvm/Analysis/DSGraph.h:38: `void } DSGraph::operator=(const } DSGraph&)' is private } MemLeakage.cpp:87: within this context } gmake: ***

A note to people working on DSGraph related projects: I just checked in a bunch of fixes and minor changes that affect how the DSGraphs are built, and some minor representational fixes. With these changes, the DSGraph interface is pretty much frozen from my end. There are two big caveats though: 1. Bugs still exist. There are a couple of asserts that may be triggered for unimplemented features, but there are also places in t...

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

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

...here any problem in the getScalarMap function or is > there any "protocol" to be followed while using the function? DSGraph::getScalarMap returns a reference to the map, so this cannot be null. Do you mean that all of the "entries" in the map are null? If so, remember that DSGraphs are built in the context of some function (as indicated by hasFunction/getFunction), so only scalars in that context will be in the map... -Chris -- http://llvm.cs.uiuc.edu/ http://www.nondot.org/~sabre/Projects/

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

> 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

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++) { Val...

...is > > > there any "protocol" to be followed while using the function? > > > > DSGraph::getScalarMap returns a reference to the map, so this cannot be > > null. Do you mean that all of the "entries" in the map are null? If so, > > remember that DSGraphs are built in the context of some function (as > > indicated by hasFunction/getFunction), so only scalars in that context > > will be in the map... > > > > -Chris > > > > -- > > http://llvm.cs.uiuc.edu/ > > http://www.nondot.org/~sabre/Projects/ > &...

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 is: #opt -load <path-to-llvmdatastructures.so> -dsa-local -dsa-bu -dsa-td -dsa-only-print < hello.bc Is

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

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

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