|
LLVM
4.0.0
|
ContextualFoldingSet - This template class is a further refinement of FoldingSet which provides a context argument when calling Profile on its nodes. More...
#include <FoldingSet.h>
Public Types | |
| typedef FoldingSetIterator< T > | iterator |
| typedef FoldingSetIterator < const T > | const_iterator |
| typedef FoldingSetBucketIterator< T > | bucket_iterator |
Public Member Functions | |
| ContextualFoldingSet (Ctx Context, unsigned Log2InitSize=6) | |
| Ctx | getContext () const |
| iterator | begin () |
| iterator | end () |
| const_iterator | begin () const |
| const_iterator | end () const |
| bucket_iterator | bucket_begin (unsigned hash) |
| bucket_iterator | bucket_end (unsigned hash) |
| T * | GetOrInsertNode (Node *N) |
| GetOrInsertNode - If there is an existing simple Node exactly equal to the specified node, return it. More... | |
| T * | FindNodeOrInsertPos (const FoldingSetNodeID &ID, void *&InsertPos) |
| FindNodeOrInsertPos - Look up the node specified by ID. More... | |
Public Member Functions inherited from llvm::FoldingSetImpl | |
| void | clear () |
| clear - Remove all nodes from the folding set. More... | |
| 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. More... | |
| Node * | GetOrInsertNode (Node *N) |
| GetOrInsertNode - If there is an existing simple Node exactly equal to the specified node, return it. More... | |
| Node * | FindNodeOrInsertPos (const FoldingSetNodeID &ID, void *&InsertPos) |
| FindNodeOrInsertPos - Look up the node specified by ID. More... | |
| void | InsertNode (Node *N, void *InsertPos) |
| InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set. More... | |
| void | InsertNode (Node *N) |
| InsertNode - Insert the specified node into the folding set, knowing that it is not already in the folding set. More... | |
| unsigned | size () const |
| size - Returns the number of nodes in the folding set. More... | |
| bool | empty () const |
| empty - Returns true if there are no nodes in the folding set. More... | |
| void | reserve (unsigned EltCount) |
| reserve - Increase the number of buckets such that adding the EltCount-th node won't cause a rebucket operation. More... | |
| unsigned | capacity () |
| capacity - Returns the number of nodes permitted in the folding set before a rebucket operation is performed. More... | |
Additional Inherited Members | |
Protected Member Functions inherited from llvm::FoldingSetImpl | |
| FoldingSetImpl (unsigned Log2InitSize=6) | |
| FoldingSetImpl (FoldingSetImpl &&Arg) | |
| FoldingSetImpl & | operator= (FoldingSetImpl &&RHS) |
| ~FoldingSetImpl () | |
Protected Attributes inherited from llvm::FoldingSetImpl | |
| void ** | Buckets |
| Buckets - Array of bucket chains. More... | |
| unsigned | NumBuckets |
| NumBuckets - Length of the Buckets array. More... | |
| unsigned | NumNodes |
| NumNodes - Number of nodes in the folding set. More... | |
ContextualFoldingSet - This template class is a further refinement of FoldingSet which provides a context argument when calling Profile on its nodes.
Currently, that argument is fixed at initialization time.
T must be a subclass of FoldingSetNode and implement a Profile function with signature void Profile(FoldingSetNodeID &, Ctx);
Definition at line 496 of file FoldingSet.h.
| typedef FoldingSetBucketIterator<T> llvm::ContextualFoldingSet< T, Ctx >::bucket_iterator |
Definition at line 541 of file FoldingSet.h.
| typedef FoldingSetIterator<const T> llvm::ContextualFoldingSet< T, Ctx >::const_iterator |
Definition at line 537 of file FoldingSet.h.
| typedef FoldingSetIterator<T> llvm::ContextualFoldingSet< T, Ctx >::iterator |
Definition at line 533 of file FoldingSet.h.
|
inlineexplicit |
Definition at line 527 of file FoldingSet.h.
|
inline |
Definition at line 534 of file FoldingSet.h.
References llvm::FoldingSetImpl::Buckets.
|
inline |
Definition at line 538 of file FoldingSet.h.
References llvm::FoldingSetImpl::Buckets.
|
inline |
Definition at line 543 of file FoldingSet.h.
References llvm::FoldingSetImpl::Buckets, and llvm::FoldingSetImpl::NumBuckets.
|
inline |
Definition at line 547 of file FoldingSet.h.
References llvm::FoldingSetImpl::Buckets, and llvm::FoldingSetImpl::NumBuckets.
|
inline |
Definition at line 535 of file FoldingSet.h.
References llvm::FoldingSetImpl::Buckets, and llvm::FoldingSetImpl::NumBuckets.
|
inline |
Definition at line 539 of file FoldingSet.h.
References llvm::FoldingSetImpl::Buckets, and llvm::FoldingSetImpl::NumBuckets.
|
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 561 of file FoldingSet.h.
References llvm::FoldingSetImpl::FindNodeOrInsertPos().
|
inline |
Definition at line 531 of file FoldingSet.h.
|
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 554 of file FoldingSet.h.
References llvm::FoldingSetImpl::GetOrInsertNode().
1.8.6