#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>
Include dependency graph for graphTemplate.h:

Go to the source code of this file.
Namespaces | |
| namespace | Backstroke |
Classes | |
| 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... | |
Defines | |
| #define | foreach BOOST_FOREACH |
Typedefs | |
| typedef CFG< FullCFGNodeFilter > | Backstroke::FullCFG |
| A full CFG without any filtered nodes. | |
| typedef CFG< InterestingCFGNodeFilter > | Backstroke::FilteredCFG |
| A filtered CFG which only contains interesting nodes and edges. | |
Functions | |
| template<class CFGNodeType> | |
| void | Backstroke::writeCFGNode (std::ostream &out, const CFGNodeType &cfgNode) |
| This function helps to write the DOT file for vertices. | |
| template<class CFGEdgeType> | |
| void | Backstroke::writeCFGEdge (std::ostream &out, const CFGEdgeType &e) |
| This function helps to write the DOT file for edges. | |
| #define foreach BOOST_FOREACH |
Definition at line 20 of file graphTemplate.h.
Referenced by Backstroke::CFG< CFGNodeFilter >::buildCFG(), Backstroke::CFG< CFGNodeFilter >::getAllBackEdges(), Backstroke::CFG< CFGNodeFilter >::getAllEdges(), Backstroke::CFG< CFGNodeFilter >::getAllLoopHeaders(), Backstroke::CFG< CFGNodeFilter >::getAllNodes(), and Backstroke::CFG< CFGNodeFilter >::setEntryAndExit().
1.4.7