#include <SlicedGraphs.h>
|
| static const ICFGNode * | getRawNode (NodeRef n) |
| static const ICFGNode * | getFunEntry (const SlicedICFGView *g, const FunObjVar *fun) |
| static const ICFGNode * | getFunExit (const SlicedICFGView *g, const FunObjVar *fun) |
| static void | getFunICFGNodes (const SlicedICFGView *g, const FunObjVar *fun, std::vector< const ICFGNode * > &out) |
| static void | getSuccNodes (const SlicedICFGView *g, const ICFGNode *n, std::vector< const ICFGNode * > &out) |
| static void | getPredNodes (const SlicedICFGView *g, const ICFGNode *n, std::vector< const ICFGNode * > &out) |
| static bool | containsNode (const SlicedICFGView *g, const ICFGNode *n) |
| static NodeRef | getEntryNode (const SlicedICFGView *) |
| static nodes_iterator | nodes_begin (const SlicedICFGView *v) |
| static nodes_iterator | nodes_end (const SlicedICFGView *v) |
| static ChildIteratorType | child_begin (NodeRef n) |
| static ChildIteratorType | child_end (NodeRef n) |
| static ChildIteratorType | direct_child_begin (NodeRef n) |
| static ChildIteratorType | direct_child_end (NodeRef n) |
| static ChildEdgeIteratorType | child_edge_begin (NodeRef n) |
| static ChildEdgeIteratorType | child_edge_end (NodeRef n) |
| static NodeRef | edge_dest (const EdgeRef &e) |
| static unsigned | graphSize (const SlicedICFGView *v) |
| static unsigned | getNodeID (NodeRef n) |
| static NodeRef | getNode (const SlicedICFGView *v, NodeID id) |
Definition at line 1272 of file SlicedGraphs.h.
◆ ChildEdgeIteratorType
◆ ChildIteratorType
◆ EdgeRef
◆ NodeRef
◆ nodes_iterator
◆ child_begin()
Definition at line 1333 of file SlicedGraphs.h.
1334 {
1336 }
static SlicedICFGEdgeIterImpl begin(const SlicedICFGView *v, const ICFGNode *n)
SlicedICFGChildIterImpl< true > ChildIteratorType
◆ child_edge_begin()
◆ child_edge_end()
Definition at line 1354 of file SlicedGraphs.h.
1355 {
1357 }
static SlicedICFGEdgeIterImpl end(const SlicedICFGView *v, const ICFGNode *n)
◆ child_end()
◆ containsNode()
◆ direct_child_begin()
Definition at line 1341 of file SlicedGraphs.h.
1342 {
1344 }
static ChildIteratorType child_begin(NodeRef n)
◆ direct_child_end()
Definition at line 1345 of file SlicedGraphs.h.
1346 {
1348 }
static ChildIteratorType child_end(NodeRef n)
◆ edge_dest()
◆ getEntryNode()
◆ getFunEntry()
◆ getFunExit()
◆ getFunICFGNodes()
◆ getNode()
◆ getNodeID()
◆ getPredNodes()
◆ getRawNode()
◆ getSuccNodes()
◆ graphSize()
Definition at line 1364 of file SlicedGraphs.h.
1365 {
1366 return static_cast<unsigned>(
v->getKeptNodes().
size());
1367 }
◆ nodes_begin()
◆ nodes_end()
The documentation for this struct was generated from the following file: