Add the VectorizableTree to the index iterator to be able to return TreeEntry pointers. More...

Inheritance diagram for llvm::GraphTraits< BoUpSLP * >::ChildIteratorType:

Public Member Functions
	ChildIteratorType (SmallVector< BoUpSLP::EdgeInfo, 1 >::iterator W, ContainerTy &VT)
NodeRef	operator* ()
Public Member Functions inherited from llvm::iterator_adaptor_base< ChildIteratorType, SmallVector< BoUpSLP::EdgeInfo, 1 >::iterator >
ChildIteratorType &	operator+= (difference_type n)
ChildIteratorType &	operator-= (difference_type n)
difference_type	operator- (const ChildIteratorType &RHS) const
ChildIteratorType &	operator++ ()
ChildIteratorType &	operator-- ()
std::conditional_t< std::is_same< typename std::iterator_traits< SmallVector< BoUpSLP::EdgeInfo, 1 >::iterator >::value_type, typename std::iterator_traits< SmallVector< BoUpSLP::EdgeInfo, 1 >::iterator >::value_type >::value, typename std::iterator_traits< SmallVector< BoUpSLP::EdgeInfo, 1 >::iterator >::reference, typename std::iterator_traits< SmallVector< BoUpSLP::EdgeInfo, 1 >::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

Public Attributes
ContainerTy &	VectorizableTree

Additional Inherited Members
Public Types inherited from llvm::iterator_adaptor_base< ChildIteratorType, SmallVector< BoUpSLP::EdgeInfo, 1 >::iterator >
using	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< ChildIteratorType, SmallVector< BoUpSLP::EdgeInfo, 1 >::iterator >
	iterator_adaptor_base ()=default
const SmallVector< BoUpSLP::EdgeInfo, 1 >::iterator &	wrapped () const
Protected Attributes inherited from llvm::iterator_adaptor_base< ChildIteratorType, SmallVector< BoUpSLP::EdgeInfo, 1 >::iterator >
SmallVector< BoUpSLP::EdgeInfo, 1 >::iterator	I

Detailed Description

Add the VectorizableTree to the index iterator to be able to return TreeEntry pointers.

Definition at line 6066 of file SLPVectorizer.cpp.

Constructor & Destructor Documentation

llvm::GraphTraits< BoUpSLP * >::ChildIteratorType::ChildIteratorType	(	SmallVector< BoUpSLP::EdgeInfo, 1 >::iterator	W,
		ContainerTy &	VT )

inline

Definition at line 6071 of file SLPVectorizer.cpp.

NodeRef llvm::GraphTraits< BoUpSLP * >::ChildIteratorType::operator* ( )

inline

Definition at line 6075 of file SLPVectorizer.cpp.

ContainerTy& llvm::GraphTraits< BoUpSLP * >::ChildIteratorType::VectorizableTree

Definition at line 6069 of file SLPVectorizer.cpp.

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