similar to: [LLVMdev] Printing DSGraph in llvm-3.0

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

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

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

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

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;

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

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

> > First off, make sure you are sending the graphs through the "dot" > > utility. It turns them into a nice format that is much easier to > > visualize than the text format... :) > > hmmm... how do I get to use the magical "dot" utility? It sounds > pretty much like what I'm looking for, and I found it in >

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 =

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

Hi, I want to integrate openpam with openssh in our server (which uses QNX632 operating system). I am facing some problems in the "make install" part of openssh. Following are the steps I followed to build zlib, openssl, openpam and openssh. *NOTE*: Since I want the sshd and ssh binaries in my server(using QNX), I had to cross compile the packages for QNX (environment was set to x86)

Hi all; I am sure this question has been brought up before, but I could not find any information in the FAQ or docs etc. Quick question; Is there a way of syncing multiple servers simultaneously from 1 source server? Thanks, -- Vaibhav Goel extension 6347

i dont want to receive messages about all the posts as i get too many in my inbox. how can i get emails from everyone who posts in this site. please help me out [[alternative HTML version deleted]]

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

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

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

> 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++) { Value *V = I->getCallInst().getOperand(0); Function &SF