| ROSE
    0.9.6a
    | 
#include <rose.h>#include <boost/graph/adjacency_list.hpp>#include <boost/bind.hpp>#include <boost/foreach.hpp>#include <boost/tuple/tuple.hpp>#include <boost/graph/graphviz.hpp>#include <boost/graph/dominator_tree.hpp>#include <boost/graph/reverse_graph.hpp>#include <boost/graph/transpose_graph.hpp>#include <boost/algorithm/string.hpp>
Go to the source code of this file.
| Classes | |
| class | Backstroke::CFG< CFGNodeFilter > | 
| A class holding a Control Flow Graph.  More... | |
| struct | Backstroke::FullCFGNodeFilter | 
| struct | Backstroke::InterestingCFGNodeFilter | 
| class | Backstroke::CFG< CFGNodeFilter > | 
| A class holding a Control Flow Graph.  More... | |
| struct | Backstroke::CFG< CFGNodeFilter >::VertexCopier | 
| This class is used to copy vertices when calling copy_graph().  More... | |
| struct | Backstroke::CFG< CFGNodeFilter >::EdgeCopier | 
| This class is used to copy edges when calling copy_graph().  More... | |
| Namespaces | |
| Backstroke | |
| Constant Groups | |
| Backstroke | |
| Macros | |
| #define | foreach BOOST_FOREACH | 
| Typedefs | |
| typedef CFG< FullCFGNodeFilter > | Backstroke::FullCFG | 
| A full CFG without any filtered nodes.  More... | |
| typedef CFG < InterestingCFGNodeFilter > | Backstroke::FilteredCFG | 
| A filtered CFG which only contains interesting nodes and edges.  More... | |
| Functions | |
| template<class CFGNodeType > | |
| void | Backstroke::writeCFGNode (std::ostream &out, const CFGNodeType &cfgNode) | 
| This function helps to write the DOT file for vertices.  More... | |
| template<class CFGEdgeType > | |
| void | Backstroke::writeCFGEdge (std::ostream &out, const CFGEdgeType &e) | 
| This function helps to write the DOT file for edges.  More... | |
| #define foreach BOOST_FOREACH | 
Definition at line 20 of file graphTemplate.h.