search for: dsg

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

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

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

LLVM, What do I pass into the DSG in order to access the globals vector of functions that a function pointer may be calling. The code: CallInst *calli = dynamic_cast<CallInst*>(*i); std::vector<GlobalValue*> funcVect = theGraph.getNodeForValue(calli->getCalledFunction()).getNode()->getGlobals(); Doesn't ap...

...Leakage.cpp:159: invalid conversion from `const DSNode*' to `DSNode*' MemLeakage.cpp:159: initializing argument 1 of `void <unnamed>::GlobalMemLeakage::KillSetInsert(DSNode*, BBsets&)' How to use a 'Node *' type iterator? Or is there any other way to traverse the DSGraph? thanks, Jerry On Sat, 16 Nov 2002, Bill? Wendling wrote: > 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::r...

...0097 X2000113 1 0.2080 0.2165 0.2149 0.2314 0.2028 2 0.1578 0.1671 0.1577 0.1593 0.1672 3 0.1897 0.1948 0.2290 0.2292 0.2067 Here's the function: STLpA<-function(TS, area, Ystart, period=23, nSG="5,5", DSG=0) { require (RTisean) for(i in 1:unique(area)){ vi.metric=TS[area==i] filt.vi<-sav_gol(vi.metric,n=nSG,D=DSG) vi.sg<-ts(filt.vi[,1], start=Ystart,frequency=period) stld.tmp<-stl(vi.sg, s.window="periodic", robust=TRUE, na.action=na.approx) stld.trend<-stld.temp$time.series[,t...

> I tried to used the getScalarMap function of the DSGraph to get the nodes > that the scalars point to in a function. But the getScalarMap returns a > null map always. Is there any problem in the getScalarMap function or is > there any "protocol" to be followed while using the function? DSGraph::getScalarMap returns a reference to...

At Tom Eastep''s request, an informal Shorewall Documentation Support = Group (DSG) is hoping to relieve some of the writing and editing burdens = that come with maintaining and improving the Shorewall documentation. = The DSG welcomes and needs your suggestions and contributions about all = aspects of the documentation, including structure, content, references, = style, grammar...

We''re starting to collect several comments for doc revisions, which is = great. Another existing source of comments and suggestions is the list = archives. Would someone be willing to spend an hour or two to (1) search = the list archives for documentation issues/suggestions, perhaps using = search terms like: docs, documentation, instructions, Quick Start, = samples, etc., and (2)

Hello, Is it possible to display the data structure graphs created by the Data Structure Analysis using a visualization tool? Thanks --------------------------------- Do you Yahoo!? Yahoo! Search presents - Jib Jab's 'Second Term' -------------- next part -------------- An HTML attachment was scrubbed... URL:

On Mon, 21 Feb 2005, xavier wrote: > Hello, > > Is it possible to display the data structure graphs created by the Data Structure Analysis using a visualization tool? yes. Just run one of these commands: analyze -datastructure x.bc -- local DSGs analyze -budatastructure x.bc -- BU DSGs analyze -tddatastructure x.bc -- TD DSGs These commands will output one "dot" file for each function in the program and a globals graph. You can use the dot program (search for graphviz) to render these in just about any format...

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

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: *** [Debug/MemLeakage.o] Error...

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 scalarmap is always empty. I printed the size of the map which came > > out to be zero always. But t...

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

...or=gray63]; If you look at it, you'll see each node has the InComplete Bit on. But when I use 'analyze -tddatastructure file.bc' I got the graph in which all the nodes don't have the bit on. So they are different. Could you tell me why the results from the analyze tool and from the dsg.dump() are different? Besides, each time I call the getAnaysis<TDDataStructure>(), it writes out some bu_funname.dot files to the disk. Why is that? Thanks, xiaodong On Thu, 21 Nov 2002, Chris Lattner wrote: > > I was wondering if this is the right way to get TopDown DSGraph? > &...

Specifically we did the following: ...... 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 D...

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

...s been significant updates. I'm not sure why getNodeForValue would work for you but getScalarMap doesn't... getNodeForValue USES the scalar map! :) > We also saw that Scalar Type has been removed from the DSNode types. Why > is that? Originally, LLVM values were represented in the DSGraph as DSNodes with the Scalar field set. Thus you would have something like this: X: ( int*%X ) | | v A: [ S int*] | | v B: [ H int] IOW, X in the scalar map would point to a "scalar" node (A), which would point to the actual data the scal...

...the reply was: >What is the type of pnode? Guessing from the error message, I would think >it's a 'const DSNode*'. You need to use either df_iterator<const DSNode*> >or a DSNode* argument, you can't mix them. I checked and found out that I was using DSNode *pnode = dsg->getNodeforValue(fi).getNode() to get pnode. So I think it's a DSNode. Would you please answer these questions? Thanks, Jerry