search for: getnumlink

llvm, What is the best way to implement a traversal of the DS graph, starting at a scalar and processing all nodes to which the scalar allows access? Currently the links vector is not public and there is no apparent way to bound the getLink call (ie a getNumLinks call).... Dave

> What is the best way to implement a traversal of the DS graph, starting at > a scalar and processing all nodes to which the scalar allows access? > Currently the links vector is not public and there is no apparent way to > bound the getLink call (ie a getNumLinks call).... Warning, untested code follows, but you should get the idea: #include "llvm/Analysis/DSGraphTraits.h" DSNode *N = ... // Visit all children of a node... for (DSNode::iterator I = N->begin(), E = N->end(); I != E; ++I) if (I->getNode()) visit(I->ge...

...073 > > > > What is the best way to implement a traversal of the DS graph, starting at > > a scalar and processing all nodes to which the scalar allows access? > > Currently the links vector is not public and there is no apparent way to > > bound the getLink call (ie a getNumLinks call).... > > Warning, untested code follows, but you should get the idea: > > > #include "llvm/Analysis/DSGraphTraits.h" > > DSNode *N = ... > > // Visit all children of a node... > for (DSNode::iterator I = N->begin(), E = N->end(); I != E; ++I)...

...E; ++I) if (I->getNode()) visit(I->getNode(), I->getOffset()); The return type of I->getNode() is 'const DSNode *' type. Is there a 'DSNode *' type iterator? Besides, Can I use the following code to visit the children of N? for( unsigned i=0; i < N->getNumLinks(); i++) { visit( N->getLink() ) } Thanks, Jerry