7 #ifndef __DefUseAnalysisAbstractPF_HXX_LOADED__
8 #define __DefUseAnalysisAbstractPF_HXX_LOADED__
15 #include "filteredCFG.h"
31 typedef std::vector < std::pair < SgInitializedName* , SgNode* > >
multitype;
42 bool searchVector(std::vector <filteredCFGNodeType> done,
60 std::vector<filteredCFGEdgeType > in_edges = cfgNode.inEdges();
61 for (std::vector<filteredCFGEdgeType >::const_iterator i = in_edges.begin(); i != in_edges.end(); ++i) {
63 T filterNode = filterEdge.
source();
64 if (filterNode.getNode()!=oneNode)
65 otherNode = filterNode.getNode();
68 std::cout <<
"getOtherInNode:: other: " << otherNode <<
" previous: " <<
69 oneNode <<
" size of in: " << in_edges.size() << std::endl;
79 std::vector<filteredCFGEdgeType > in_edges = cfgNode.inEdges();
80 for (std::vector<filteredCFGEdgeType >::const_iterator i = in_edges.begin(); i != in_edges.end(); ++i) {
82 node = filterEdge.
source().getNode();
90 template <
typename T >
93 std::cout <<
"\n!! Worklist : " ;
94 for (
typename std::vector<T >::iterator i = worklist.begin(); i != worklist.end(); ++i, pos++) {
96 std::cout <<
" - " << node.toStringForDebugging();
98 std::cout << std::endl;