|
LLVM
4.0.0
|
A lazy iterator over specifically call edges. More...
#include <LazyCallGraph.h>
Public Member Functions | |
| call_edge_iterator () | |
| call_edge_iterator & | operator++ () |
Public Member Functions inherited from llvm::iterator_adaptor_base< call_edge_iterator, EdgeVectorImplT::iterator, std::forward_iterator_tag > | |
| call_edge_iterator & | operator+= (difference_type n) |
| call_edge_iterator & | operator-= (difference_type n) |
| difference_type | operator- (const call_edge_iterator &RHS) const |
| call_edge_iterator & | operator++ () |
| call_edge_iterator & | operator-- () |
| bool | operator== (const call_edge_iterator &RHS) const |
| bool | operator< (const call_edge_iterator &RHS) const |
| typename std::conditional < std::is_same< typename std::iterator_traits < EdgeVectorImplT::iterator > ::value_type, typename std::iterator_traits < EdgeVectorImplT::iterator > ::value_type >::value,typename std::iterator_traits < EdgeVectorImplT::iterator > ::reference, typename std::iterator_traits < EdgeVectorImplT::iterator > ::value_type & >::type | operator* () const |
Public Member Functions inherited from llvm::iterator_facade_base< DerivedT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT > | |
| DerivedT | operator+ (DifferenceTypeT n) const |
| DerivedT | operator- (DifferenceTypeT n) const |
| DerivedT & | operator++ () |
| DerivedT | operator++ (int) |
| DerivedT & | operator-- () |
| DerivedT | operator-- (int) |
| bool | operator!= (const DerivedT &RHS) const |
| bool | operator> (const DerivedT &RHS) const |
| bool | operator<= (const DerivedT &RHS) const |
| bool | operator>= (const DerivedT &RHS) const |
| PointerT | operator-> () const |
| ReferenceProxy | operator[] (DifferenceTypeT n) const |
Friends | |
| class | LazyCallGraph |
| class | LazyCallGraph::Node |
Additional Inherited Members | |
Public Types inherited from llvm::iterator_adaptor_base< call_edge_iterator, EdgeVectorImplT::iterator, std::forward_iterator_tag > | |
| typedef typename std::iterator_traits < EdgeVectorImplT::iterator > ::difference_type | difference_type |
Protected Types inherited from llvm::iterator_facade_base< DerivedT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT > | |
| enum | { IsRandomAccess, IsBidirectional } |
Protected Member Functions inherited from llvm::iterator_adaptor_base< call_edge_iterator, EdgeVectorImplT::iterator, std::forward_iterator_tag > | |
| iterator_adaptor_base ()=default | |
| iterator_adaptor_base (EdgeVectorImplT::iteratoru) | |
| const EdgeVectorImplT::iterator & | wrapped () const |
Protected Attributes inherited from llvm::iterator_adaptor_base< call_edge_iterator, EdgeVectorImplT::iterator, std::forward_iterator_tag > | |
| EdgeVectorImplT::iterator | I |
A lazy iterator over specifically call edges.
This has the same iteration properties as the edge_iterator, but restricts itself to edges which represent actual calls.
Definition at line 321 of file LazyCallGraph.h.
|
inline |
Definition at line 344 of file LazyCallGraph.h.
|
inline |
Definition at line 347 of file LazyCallGraph.h.
References llvm::iterator_adaptor_base< call_edge_iterator, EdgeVectorImplT::iterator, std::forward_iterator_tag >::I.
|
friend |
Definition at line 325 of file LazyCallGraph.h.
|
friend |
Definition at line 326 of file LazyCallGraph.h.
1.8.6