search for: computenodemap

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 llvm::DSGraph::computeNodeMapping(const llvm::DSNodeHandle&, const llvm::DSNodeHandle&, llvm::DSGraph::NodeMapTy&, bool): Assertion `Entry.getNode() == N2 && &q...

...andreas.wilhelm at gmx.com > wrote: 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 llvm::DSGraph::computeNodeMapping(const llvm::DSNodeHandle&, const llvm::DSNodeHandle&, llvm::DSGraph::NodeMapTy&, bool): Assertion `Entry.getNode() == N2 &&...

...s some memory locations that correspond to a set of DS nodes M from DSG_bar. I would like to map this set M onto the corresponding nodes (if they exist) in the DSG_foo, i.e. I would like to find out which nodes in the DSG_foo are potentially modified by a call to bar. Currently I am using DSGraph::computeNodeMapping to do the task, but I am not sure if that's the way to go.... Any suggestions would be greatly appreciated! Thanks!

...> > > > > > > > > > > On Apr 3, 2008, at 12:45 PM, Andrew Lenharth wrote: > > > > > On Thu, Apr 3, 2008 at 12:29 PM, Zvonimir Rakamaric <zrakamar at gmail.com > > > > wrote: > > >> Currently I am using DSGraph::computeNodeMapping to do the task, > > >> but I > > >> am not sure if that's the way to go.... > > > > > > I believe that is the correct function to use. > > > > > > Andrew

On Thu, Apr 3, 2008 at 12:29 PM, Zvonimir Rakamaric <zrakamar at gmail.com> wrote: > Currently I am using DSGraph::computeNodeMapping to do the task, but I > am not sure if that's the way to go.... I believe that is the correct function to use. Andrew

...eric queries in the AliasAnalysis interface. --Vikram http://www.cs.uiuc.edu/~vadve http://llvm.org/ On Apr 3, 2008, at 12:45 PM, Andrew Lenharth wrote: > On Thu, Apr 3, 2008 at 12:29 PM, Zvonimir Rakamaric <zrakamar at gmail.com > > wrote: >> Currently I am using DSGraph::computeNodeMapping to do the task, >> but I >> am not sure if that's the way to go.... > > I believe that is the correct function to use. > > Andrew > _______________________________________________ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu http://llvm....

...eCalleeCallerMapping" 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 llvm::DSNodeHandle&, __gnu_cxx::hash_map<const llvm::DSNode*, llvm::DSNodeHandle, __gnu_cxx::hash<const llvm::DSNode*>, std::equal_to<const llvm::DSNode*>, std::allocator<llvm::DSNodeHandle> >&, bool): Assertion `Entry.getNode...