Static Value-Flow Analysis
|
#include "Util/iterator_range.h"
Go to the source code of this file.
Classes | |
struct | SVF::GenericGraphTraits< GraphType > |
struct | SVF::Inverse< GraphType > |
struct | SVF::GenericGraphTraits< Inverse< Inverse< T > > > |
Namespaces | |
namespace | SVF |
for isBitcode | |
Functions | |
template<class GraphType > | |
iter_range< typename GenericGraphTraits< GraphType >::nodes_iterator > | SVF::nodes (const GraphType &G) |
template<class GraphType > | |
iter_range< typename GenericGraphTraits< Inverse< GraphType > >::nodes_iterator > | SVF::inverse_nodes (const GraphType &G) |
template<class GraphType > | |
iter_range< typename GenericGraphTraits< GraphType >::ChildIteratorType > | SVF::children (const typename GenericGraphTraits< GraphType >::NodeRef &G) |
template<class GraphType > | |
iter_range< typename GenericGraphTraits< Inverse< GraphType > >::ChildIteratorType > | SVF::inverse_children (const typename GenericGraphTraits< GraphType >::NodeRef &G) |
template<class GraphType > | |
iter_range< typename GenericGraphTraits< GraphType >::ChildEdgeIteratorType > | SVF::children_edges (const typename GenericGraphTraits< GraphType >::NodeRef &G) |