llvm::LazyCallGraph::EdgeSequence::call_iterator Class Reference

An iterator over specifically call edges. More...

#include "llvm/Analysis/LazyCallGraph.h"

Inheritance diagram for llvm::LazyCallGraph::EdgeSequence::call_iterator:

Public Member Functions
	call_iterator ()=default
call_iterator &	operator++ ()
DerivedT &	operator++ ()
Public Member Functions inherited from llvm::iterator_adaptor_base< call_iterator, VectorImplT::iterator, std::forward_iterator_tag >
call_iterator &	operator+= (difference_type n)
call_iterator &	operator-= (difference_type n)
difference_type	operator- (const call_iterator &RHS) const
call_iterator &	operator++ ()
call_iterator &	operator-- ()
std::conditional_t< std::is_same< typename std::iterator_traits< VectorImplT::iterator >::value_type, typename std::iterator_traits< VectorImplT::iterator >::value_type >::value, typename std::iterator_traits< VectorImplT::iterator >::reference, typename std::iterator_traits< VectorImplT::iterator >::value_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
PointerProxy	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_iterator, VectorImplT::iterator, std::forward_iterator_tag >
using	difference_type = typename std::iterator_traits< VectorImplT::iterator >::difference_type
Public Types inherited from llvm::iterator_facade_base< DerivedT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT >
using	iterator_category = IteratorCategoryT
using	value_type = T
using	difference_type = DifferenceTypeT
using	pointer = PointerT
using	reference = ReferenceT
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_iterator, VectorImplT::iterator, std::forward_iterator_tag >
	iterator_adaptor_base ()=default
	iterator_adaptor_base (VectorImplT::iterator u)
const VectorImplT::iterator &	wrapped () const
Protected Attributes inherited from llvm::iterator_adaptor_base< call_iterator, VectorImplT::iterator, std::forward_iterator_tag >
VectorImplT::iterator	I

Detailed Description

An iterator over specifically call edges.

This has the same iteration properties as the iterator, but restricts itself to edges which represent actual calls.

Definition at line 220 of file LazyCallGraph.h.

Constructor & Destructor Documentation

call_iterator()

llvm::LazyCallGraph::EdgeSequence::call_iterator::call_iterator ( )

default

Member Function Documentation

operator++() [1/2]

DerivedT & llvm::iterator_adaptor_base< DerivedT, WrappedIteratorT, IteratorCategoryT, T, DifferenceTypeT, PointerT, ReferenceT >::operator++ ( )

inline

Definition at line 280 of file iterator.h.

operator++() [2/2]

call_iterator & llvm::LazyCallGraph::EdgeSequence::call_iterator::operator++ ( )

inline

Definition at line 244 of file LazyCallGraph.h.

References llvm::iterator_adaptor_base< call_iterator, VectorImplT::iterator, std::forward_iterator_tag >::I.

Friends And Related Function Documentation

LazyCallGraph

friend class LazyCallGraph

friend

Definition at line 223 of file LazyCallGraph.h.

LazyCallGraph::Node

friend class LazyCallGraph::Node

friend

Definition at line 224 of file LazyCallGraph.h.

---

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

• include/llvm/Analysis/LazyCallGraph.h