|
LLVM
3.7.0
|
DenseSet - This implements a dense probed hash-table based set. More...
#include <DenseSet.h>
Classes | |
| class | ConstIterator |
| class | Iterator |
Public Types | |
| typedef ValueT | key_type |
| typedef ValueT | value_type |
| typedef unsigned | size_type |
| typedef Iterator | iterator |
| typedef ConstIterator | const_iterator |
Public Member Functions | |
| DenseSet (unsigned NumInitBuckets=0) | |
| bool | empty () const |
| size_type | size () const |
| size_t | getMemorySize () const |
| void | resize (size_t Size) |
| Grow the DenseSet so that it has at least Size buckets. More... | |
| void | clear () |
| size_type | count (const ValueT &V) const |
| Return 1 if the specified key is in the set, 0 otherwise. More... | |
| bool | erase (const ValueT &V) |
| void | swap (DenseSet &RHS) |
| iterator | begin () |
| iterator | end () |
| const_iterator | begin () const |
| const_iterator | end () const |
| iterator | find (const ValueT &V) |
| template<class LookupKeyT > | |
| iterator | find_as (const LookupKeyT &Val) |
| Alternative version of find() which allows a different, and possibly less expensive, key type. More... | |
| template<class LookupKeyT > | |
| const_iterator | find_as (const LookupKeyT &Val) const |
| void | erase (Iterator I) |
| void | erase (ConstIterator CI) |
| std::pair< iterator, bool > | insert (const ValueT &V) |
| template<typename InputIt > | |
| void | insert (InputIt I, InputIt E) |
DenseSet - This implements a dense probed hash-table based set.
Definition at line 39 of file DenseSet.h.
| typedef ConstIterator llvm::DenseSet< ValueT, ValueInfoT >::const_iterator |
Definition at line 120 of file DenseSet.h.
| typedef Iterator llvm::DenseSet< ValueT, ValueInfoT >::iterator |
Definition at line 119 of file DenseSet.h.
| typedef ValueT llvm::DenseSet< ValueT, ValueInfoT >::key_type |
Definition at line 46 of file DenseSet.h.
| typedef unsigned llvm::DenseSet< ValueT, ValueInfoT >::size_type |
Definition at line 48 of file DenseSet.h.
| typedef ValueT llvm::DenseSet< ValueT, ValueInfoT >::value_type |
Definition at line 47 of file DenseSet.h.
|
inlineexplicit |
Definition at line 50 of file DenseSet.h.
|
inline |
Definition at line 122 of file DenseSet.h.
|
inline |
Definition at line 125 of file DenseSet.h.
|
inline |
Definition at line 60 of file DenseSet.h.
Referenced by llvm::TypeFinder::clear(), and true::DivergencePropagator::populateWithSourcesOfDivergence().
|
inline |
Return 1 if the specified key is in the set, 0 otherwise.
Definition at line 65 of file DenseSet.h.
Referenced by recomputeLiveInValues(), relocationViaAlloca(), and llvm::LoopInfoBase< N, M >::verify().
|
inline |
Definition at line 52 of file DenseSet.h.
Referenced by llvm::ScalarEvolution::releaseMemory().
|
inline |
Definition at line 123 of file DenseSet.h.
Referenced by llvm::FunctionType::get(), llvm::StructType::get(), llvm::getUniqued(), and llvm::PBQP::ValuePool< AllowedRegVector >::getValue().
|
inline |
Definition at line 126 of file DenseSet.h.
|
inline |
Definition at line 69 of file DenseSet.h.
Referenced by computeLiveInValues().
|
inline |
Definition at line 144 of file DenseSet.h.
|
inline |
Definition at line 145 of file DenseSet.h.
|
inline |
Definition at line 128 of file DenseSet.h.
|
inline |
Alternative version of find() which allows a different, and possibly less expensive, key type.
The DenseMapInfo is responsible for supplying methods getHashValue(LookupKeyT) and isEqual(LookupKeyT, KeyT) for each key type used.
Definition at line 136 of file DenseSet.h.
Referenced by llvm::FunctionType::get(), llvm::StructType::get(), llvm::getUniqued(), and llvm::PBQP::ValuePool< AllowedRegVector >::getValue().
|
inline |
Definition at line 140 of file DenseSet.h.
|
inline |
Definition at line 54 of file DenseSet.h.
|
inline |
Definition at line 147 of file DenseSet.h.
Referenced by computeKillSet(), computeLiveInValues(), computeLiveOutSeed(), llvm::EliminateDuplicatePHINodes(), llvm::DwarfDebug::endFunction(), llvm::DWARFDebugAranges::generate(), llvm::FunctionType::get(), llvm::StructType::get(), getRegsUsedByPHIs(), llvm::PBQP::ValuePool< AllowedRegVector >::getValue(), llvm::DenseSet< StructType *, StructTypeKeyInfo >::insert(), insertRelocationStores(), insertRematerializationStores(), recomputeLiveInValues(), uniquifyImpl(), and llvm::LoopBase< N, M >::verifyLoopNest().
|
inline |
Definition at line 154 of file DenseSet.h.
|
inline |
Grow the DenseSet so that it has at least Size buckets.
Will not shrink the Size of the set.
Definition at line 58 of file DenseSet.h.
|
inline |
Definition at line 53 of file DenseSet.h.
Referenced by computeLiveInValues().
|
inline |
Definition at line 73 of file DenseSet.h.
1.8.6