#include <SlicedGraphs.h>
Definition at line 1706 of file SlicedGraphs.h.
◆ ChildEdgeIteratorType
◆ ChildIteratorType
◆ EdgeRef
◆ NodeRef
◆ nodes_iterator
◆ child_begin()
Definition at line 1747 of file SlicedGraphs.h.
1748 {
1750 }
static SlicedSVFGEdgeIterImpl begin(const SlicedSVFGView *v, const SVFGNode *n)
SlicedSVFGChildIterImpl< true > ChildIteratorType
◆ child_edge_begin()
◆ child_edge_end()
Definition at line 1768 of file SlicedGraphs.h.
1769 {
1771 }
static SlicedSVFGEdgeIterImpl end(const SlicedSVFGView *v, const SVFGNode *n)
◆ child_end()
◆ containsEdge()
◆ containsNode()
Whether n is retained by this sliced SVFG (the solver's restriction test).
Definition at line 1721 of file SlicedGraphs.h.
1722 {
1723 return g->isKeptNode(
n);
1724 }
◆ direct_child_begin()
Definition at line 1755 of file SlicedGraphs.h.
1756 {
1758 }
static ChildIteratorType child_begin(NodeRef n)
◆ direct_child_end()
Definition at line 1759 of file SlicedGraphs.h.
1760 {
1762 }
static ChildIteratorType child_end(NodeRef n)
◆ edge_dest()
◆ getEntryNode()
◆ getNode()
Definition at line 1785 of file SlicedGraphs.h.
1786 {
1788 (
v->getSVFG() !=
nullptr) ?
v->getSVFG()->getGNode(
id) :
nullptr;
1790 }
◆ getNodeID()
◆ getRawNode()
◆ graphSize()
Definition at line 1781 of file SlicedGraphs.h.
1782 {
1783 return static_cast<unsigned>(
v->getKeptNodeCount());
1784 }
◆ nodes_begin()
Definition at line 1736 of file SlicedGraphs.h.
1737 {
1738 assert(
v->getSVFG() &&
"SlicedSVFGView: bind the SVFG before iterating nodes");
1740 }
◆ nodes_end()
Definition at line 1741 of file SlicedGraphs.h.
1742 {
1743 assert(
v->getSVFG() &&
"SlicedSVFGView: bind the SVFG before iterating nodes");
1745 }
◆ isFilteredGraph
The documentation for this struct was generated from the following file: