|
Static Value-Flow Analysis
|
#include <SVFG.h>
Public Types | |
| typedef SVF::SVFGNode * | NodeRef |
Public Types inherited from SVF::GenericGraphTraits< SVF::GenericGraph< SVF::SVFGNode, SVF::SVFGEdge > * > | |
| using | NodeRef = typename GraphType::UnknownGraphTypeError |
Static Public Member Functions | |
| static bool | containsNode (SVF::SVFG *, const SVF::SVFGNode *) |
| static bool | containsEdge (SVF::SVFG *, const SVF::SVFGEdge *) |
Static Public Attributes | |
| static constexpr bool | isFilteredGraph = false |
| typedef SVF::SVFGNode* SVF::GenericGraphTraits< SVF::SVFG * >::NodeRef |
|
inlinestatic |
|
inlinestatic |
Whether n belongs to this graph (the whole SVFG contains every node). Mirrored by GenericGraphTraits<const SlicedSVFGView*>, so a solver templated on the graph type restricts itself to the graph's nodes.
Definition at line 508 of file SVFG.h.
|
staticconstexpr |