FoldingSetImpl - An implementation detail that lets us share code between FoldingSet and ContextualFoldingSet. More...

#include "llvm/ADT/FoldingSet.h"

Inheritance diagram for llvm::FoldingSetImpl< Derived, T >:

Public Types
using	iterator = FoldingSetIterator<T>
using	const_iterator = FoldingSetIterator<const T>
using	bucket_iterator = FoldingSetBucketIterator<T>

Public Member Functions
iterator	begin ()
iterator	end ()
const_iterator	begin () const
const_iterator	end () const
bucket_iterator	bucket_begin (unsigned hash)
bucket_iterator	bucket_end (unsigned hash)
void	reserve (unsigned EltCount)
	reserve - Increase the number of buckets such that adding the EltCount-th node won't cause a rebucket operation.
bool	RemoveNode (T *N)
	RemoveNode - Remove a node from the folding set, returning true if one was removed or false if the node was not in the folding set.
T *	GetOrInsertNode (T *N)
	GetOrInsertNode - If there is an existing simple Node exactly equal to the specified node, return it.
T *	FindNodeOrInsertPos (const FoldingSetNodeID &ID, void *&InsertPos)
	FindNodeOrInsertPos - Look up the node specified by ID.
void	InsertNode (T N, void InsertPos)
	InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set.
void	InsertNode (T *N)
	InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set.
Public Member Functions inherited from llvm::FoldingSetBase
LLVM_ABI void	clear ()
	clear - Remove all nodes from the folding set.
unsigned	size () const
	size - Returns the number of nodes in the folding set.
bool	empty () const
	empty - Returns true if there are no nodes in the folding set.
unsigned	capacity ()
	capacity - Returns the number of nodes permitted in the folding set before a rebucket operation is performed.

Protected Member Functions
	FoldingSetImpl (unsigned Log2InitSize)
	FoldingSetImpl (FoldingSetImpl &&Arg)=default
FoldingSetImpl &	operator= (FoldingSetImpl &&RHS)=default
	~FoldingSetImpl ()=default
Protected Member Functions inherited from llvm::FoldingSetBase
LLVM_ABI	FoldingSetBase (unsigned Log2InitSize=6)
LLVM_ABI	FoldingSetBase (FoldingSetBase &&Arg)
LLVM_ABI FoldingSetBase &	operator= (FoldingSetBase &&RHS)
LLVM_ABI	~FoldingSetBase ()
LLVM_ABI void	reserve (unsigned EltCount, const FoldingSetInfo &Info)
	reserve - Increase the number of buckets such that adding the EltCount-th node won't cause a rebucket operation.
LLVM_ABI bool	RemoveNode (Node *N)
	RemoveNode - Remove a node from the folding set, returning true if one was removed or false if the node was not in the folding set.
LLVM_ABI Node *	GetOrInsertNode (Node *N, const FoldingSetInfo &Info)
	GetOrInsertNode - If there is an existing simple Node exactly equal to the specified node, return it.
LLVM_ABI Node *	FindNodeOrInsertPos (const FoldingSetNodeID &ID, void *&InsertPos, const FoldingSetInfo &Info)
	FindNodeOrInsertPos - Look up the node specified by ID.
LLVM_ABI void	InsertNode (Node N, void InsertPos, const FoldingSetInfo &Info)
	InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set.

Additional Inherited Members
Protected Attributes inherited from llvm::FoldingSetBase
void **	Buckets
	Buckets - Array of bucket chains.
unsigned	NumBuckets
	NumBuckets - Length of the Buckets array. Always a power of 2.
unsigned	NumNodes
	NumNodes - Number of nodes in the folding set.

Detailed Description

template<class Derived, class T>
class llvm::FoldingSetImpl< Derived, T >

FoldingSetImpl - An implementation detail that lets us share code between FoldingSet and ContextualFoldingSet.

Definition at line 454 of file FoldingSet.h.

Member Typedef Documentation

◆ bucket_iterator

template<class Derived, class T>

using llvm::FoldingSetImpl< Derived, T >::bucket_iterator = FoldingSetBucketIterator<T>

Definition at line 474 of file FoldingSet.h.

◆ const_iterator

template<class Derived, class T>

using llvm::FoldingSetImpl< Derived, T >::const_iterator = FoldingSetIterator<const T>

Definition at line 469 of file FoldingSet.h.

◆ iterator

template<class Derived, class T>

using llvm::FoldingSetImpl< Derived, T >::iterator = FoldingSetIterator<T>

Definition at line 464 of file FoldingSet.h.

Constructor & Destructor Documentation

◆ FoldingSetImpl() [1/2]

template<class Derived, class T>

llvm::FoldingSetImpl< Derived, T >::FoldingSetImpl ( unsigned Log2InitSize )

inlineexplicitprotected

Definition at line 456 of file FoldingSet.h.

◆ FoldingSetImpl() [2/2]

template<class Derived, class T>

llvm::FoldingSetImpl< Derived, T >::FoldingSetImpl ( FoldingSetImpl< Derived, T > && Arg )

protecteddefault

◆ ~FoldingSetImpl()

template<class Derived, class T>

llvm::FoldingSetImpl< Derived, T >::~FoldingSetImpl ( )

protecteddefault

Member Function Documentation

◆ begin() [1/2]

template<class Derived, class T>

iterator llvm::FoldingSetImpl< Derived, T >::begin ( )

inline

Definition at line 466 of file FoldingSet.h.

◆ begin() [2/2]

template<class Derived, class T>

const_iterator llvm::FoldingSetImpl< Derived, T >::begin ( ) const

inline

Definition at line 471 of file FoldingSet.h.

◆ bucket_begin()

template<class Derived, class T>

bucket_iterator llvm::FoldingSetImpl< Derived, T >::bucket_begin ( unsigned hash )

inline

Definition at line 476 of file FoldingSet.h.

◆ bucket_end()

template<class Derived, class T>

bucket_iterator llvm::FoldingSetImpl< Derived, T >::bucket_end ( unsigned hash )

inline

Definition at line 480 of file FoldingSet.h.

◆ end() [1/2]

template<class Derived, class T>

iterator llvm::FoldingSetImpl< Derived, T >::end ( )

inline

Definition at line 467 of file FoldingSet.h.

◆ end() [2/2]

template<class Derived, class T>

const_iterator llvm::FoldingSetImpl< Derived, T >::end ( ) const

inline

Definition at line 472 of file FoldingSet.h.

◆ FindNodeOrInsertPos()

template<class Derived, class T>

T * llvm::FoldingSetImpl< Derived, T >::FindNodeOrInsertPos	(	const FoldingSetNodeID &	ID,
		void *&	InsertPos )

inline

FindNodeOrInsertPos - Look up the node specified by ID.

If it exists, return it. If not, return the insertion token that will make insertion faster.

Definition at line 508 of file FoldingSet.h.

Referenced by llvm::RecordRecTy::get().

◆ GetOrInsertNode()

template<class Derived, class T>

T * llvm::FoldingSetImpl< Derived, T >::GetOrInsertNode ( T * N )

inline

GetOrInsertNode - If there is an existing simple Node exactly equal to the specified node, return it.

Otherwise, insert 'N' and return it instead.

Definition at line 500 of file FoldingSet.h.

Referenced by llvm::FoldingSetImpl< FoldingSet, T >::InsertNode().

◆ InsertNode() [1/2]

template<class Derived, class T>

void llvm::FoldingSetImpl< Derived, T >::InsertNode ( T * N )

inline

InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set.

Definition at line 522 of file FoldingSet.h.

◆ InsertNode() [2/2]

template<class Derived, class T>

void llvm::FoldingSetImpl< Derived, T >::InsertNode	(	T *	N,
		void *	InsertPos )

inline

InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set.

InsertPos must be obtained from FindNodeOrInsertPos.

Definition at line 516 of file FoldingSet.h.

Referenced by llvm::RecordRecTy::get().

◆ operator=()

template<class Derived, class T>

FoldingSetImpl & llvm::FoldingSetImpl< Derived, T >::operator= ( FoldingSetImpl< Derived, T > && RHS )

protecteddefault

◆ RemoveNode()

template<class Derived, class T>

bool llvm::FoldingSetImpl< Derived, T >::RemoveNode ( T * N )

inline

RemoveNode - Remove a node from the folding set, returning true if one was removed or false if the node was not in the folding set.

Definition at line 493 of file FoldingSet.h.

◆ reserve()

template<class Derived, class T>

void llvm::FoldingSetImpl< Derived, T >::reserve ( unsigned EltCount )

inline

reserve - Increase the number of buckets such that adding the EltCount-th node won't cause a rebucket operation.

reserve is permitted to allocate more space than requested by EltCount.

Definition at line 487 of file FoldingSet.h.

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

include/llvm/ADT/FoldingSet.h

Public Types

Public Member Functions

Protected Member Functions

Additional Inherited Members

Detailed Description

Member Typedef Documentation

◆ bucket_iterator

◆ const_iterator

◆ iterator

Constructor & Destructor Documentation

◆ FoldingSetImpl() [1/2]

◆ FoldingSetImpl() [2/2]

◆ ~FoldingSetImpl()

Member Function Documentation

◆ begin() [1/2]

◆ begin() [2/2]

◆ bucket_begin()

◆ bucket_end()

◆ end() [1/2]

◆ end() [2/2]

◆ FindNodeOrInsertPos()

◆ GetOrInsertNode()

◆ InsertNode() [1/2]

◆ InsertNode() [2/2]

◆ operator=()

◆ RemoveNode()

◆ reserve()