LLVM  4.0.0
Public Member Functions | Friends | List of all members
llvm::LazyCallGraph::edge_iterator Class Reference

A lazy iterator used for both the entry nodes and child nodes. More...

#include <LazyCallGraph.h>

Inheritance diagram for llvm::LazyCallGraph::edge_iterator:
[legend]
Collaboration diagram for llvm::LazyCallGraph::edge_iterator:
[legend]

Public Member Functions

 edge_iterator ()
 
edge_iteratoroperator++ ()
 
- Public Member Functions inherited from llvm::iterator_adaptor_base< edge_iterator, EdgeVectorImplT::iterator, std::forward_iterator_tag >
edge_iterator & operator+= (difference_type n)
 
edge_iterator & operator-= (difference_type n)
 
difference_type operator- (const edge_iterator &RHS) const
 
edge_iterator & operator++ ()
 
edge_iterator & operator-- ()
 
bool operator== (const edge_iterator &RHS) const
 
bool operator< (const 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< 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< 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< edge_iterator, EdgeVectorImplT::iterator, std::forward_iterator_tag >
EdgeVectorImplT::iterator I
 

Detailed Description

A lazy iterator used for both the entry nodes and child nodes.

When this iterator is dereferenced, if not yet available, a function will be scanned for "calls" or uses of functions and its child information will be constructed. All of these results are accumulated and cached in the graph.

Definition at line 289 of file LazyCallGraph.h.

Constructor & Destructor Documentation

llvm::LazyCallGraph::edge_iterator::edge_iterator ( )
inline

Definition at line 306 of file LazyCallGraph.h.

Member Function Documentation

edge_iterator& llvm::LazyCallGraph::edge_iterator::operator++ ( )
inline

Friends And Related Function Documentation

friend class LazyCallGraph
friend

Definition at line 292 of file LazyCallGraph.h.

friend class LazyCallGraph::Node
friend

Definition at line 293 of file LazyCallGraph.h.


The documentation for this class was generated from the following file: