LLVM
8.0.1
|
#include "llvm/ADT/DepthFirstIterator.h"
Public Types | |
using | BaseSet = SmallPtrSet< NodeRef, SmallSize > |
using | iterator = typename BaseSet::iterator |
![]() | |
using | iterator = SmallPtrSetIterator< NodeRef > |
using | const_iterator = SmallPtrSetIterator< NodeRef > |
using | key_type = ConstPtrType |
using | value_type = NodeRef |
![]() | |
using | size_type = unsigned |
Public Member Functions | |
std::pair< iterator, bool > | insert (NodeRef N) |
template<typename IterT > | |
void | insert (IterT Begin, IterT End) |
void | completed (NodeRef) |
![]() | |
SmallPtrSet () | |
SmallPtrSet (const SmallPtrSet &that) | |
SmallPtrSet (SmallPtrSet &&that) | |
SmallPtrSet (It I, It E) | |
SmallPtrSet (std::initializer_list< NodeRef > IL) | |
SmallPtrSet< NodeRef, SmallSize > & | operator= (const SmallPtrSet< NodeRef, SmallSize > &RHS) |
SmallPtrSet< NodeRef, SmallSize > & | operator= (SmallPtrSet< NodeRef, SmallSize > &&RHS) |
SmallPtrSet< NodeRef, SmallSize > & | operator= (std::initializer_list< NodeRef > IL) |
void | swap (SmallPtrSet< NodeRef, SmallSize > &RHS) |
swap - Swaps the elements of two sets. More... | |
![]() | |
SmallPtrSetImpl (const SmallPtrSetImpl &)=delete | |
std::pair< iterator, bool > | insert (NodeRef Ptr) |
Inserts Ptr if and only if there is no element in the container equal to Ptr. More... | |
void | insert (IterT I, IterT E) |
void | insert (std::initializer_list< NodeRef > IL) |
bool | erase (NodeRef Ptr) |
erase - If the set contains the specified pointer, remove it and return true, otherwise return false. More... | |
size_type | count (ConstPtrType Ptr) const |
count - Return 1 if the specified pointer is in the set, 0 otherwise. More... | |
iterator | find (ConstPtrType Ptr) const |
iterator | begin () const |
iterator | end () const |
![]() | |
SmallPtrSetImplBase & | operator= (const SmallPtrSetImplBase &)=delete |
LLVM_NODISCARD bool | empty () const |
size_type | size () const |
void | clear () |
![]() | |
DebugEpochBase () | |
void | incrementEpoch () |
Calling incrementEpoch invalidates all handles pointing into the calling instance. More... | |
~DebugEpochBase () | |
The destructor calls incrementEpoch to make use-after-free bugs more likely to crash deterministically. More... | |
Additional Inherited Members | |
![]() | |
SmallPtrSetImpl (const void **SmallStorage, const SmallPtrSetImpl &that) | |
SmallPtrSetImpl (const void **SmallStorage, unsigned SmallSize, SmallPtrSetImpl &&that) | |
SmallPtrSetImpl (const void **SmallStorage, unsigned SmallSize) | |
![]() | |
SmallPtrSetImplBase (const void **SmallStorage, const SmallPtrSetImplBase &that) | |
SmallPtrSetImplBase (const void **SmallStorage, unsigned SmallSize, SmallPtrSetImplBase &&that) | |
SmallPtrSetImplBase (const void **SmallStorage, unsigned SmallSize) | |
~SmallPtrSetImplBase () | |
const void ** | EndPointer () const |
std::pair< const void *const *, bool > | insert_imp (const void *Ptr) |
insert_imp - This returns true if the pointer was new to the set, false if it was already in the set. More... | |
bool | erase_imp (const void *Ptr) |
erase_imp - If the set contains the specified pointer, remove it and return true, otherwise return false. More... | |
const void *const * | find_imp (const void *Ptr) const |
Returns the raw pointer needed to construct an iterator. More... | |
void | swap (SmallPtrSetImplBase &RHS) |
swap - Swaps the elements of two sets. More... | |
void | CopyFrom (const SmallPtrSetImplBase &RHS) |
void | MoveFrom (unsigned SmallSize, SmallPtrSetImplBase &&RHS) |
![]() | |
static void * | getTombstoneMarker () |
static void * | getEmptyMarker () |
![]() | |
const void ** | SmallArray |
SmallArray - Points to a fixed size set of buckets, used in 'small mode'. More... | |
const void ** | CurArray |
CurArray - This is the current set of buckets. More... | |
unsigned | CurArraySize |
CurArraySize - The allocated size of CurArray, always a power of two. More... | |
unsigned | NumNonEmpty |
Number of elements in CurArray that contain a value or are a tombstone. More... | |
unsigned | NumTombstones |
Number of tombstones in CurArray. More... | |
Definition at line 70 of file DepthFirstIterator.h.
using llvm::df_iterator_default_set< NodeRef, SmallSize >::BaseSet = SmallPtrSet<NodeRef, SmallSize> |
Definition at line 71 of file DepthFirstIterator.h.
using llvm::df_iterator_default_set< NodeRef, SmallSize >::iterator = typename BaseSet::iterator |
Definition at line 72 of file DepthFirstIterator.h.
|
inline |
Definition at line 78 of file DepthFirstIterator.h.
|
inline |
Definition at line 74 of file DepthFirstIterator.h.
Referenced by getFPReg(), and llvm::LoopBase< BasicBlock, Loop >::verifyLoop().
|
inline |
Definition at line 76 of file DepthFirstIterator.h.