#include <SmallSet.h>
Public Types | |
| typedef size_t | size_type |
Public Member Functions | |
| SmallSet () | |
| bool LLVM_ATTRIBUTE_UNUSED_RESULT | empty () const |
| size_type | size () const |
| size_type | count (const T &V) const |
| count - Return 1 if the element is in the set, 0 otherwise. | |
| bool | insert (const T &V) |
| template<typename IterT > | |
| void | insert (IterT I, IterT E) |
| bool | erase (const T &V) |
| void | clear () |
Detailed Description
template<typename T, unsigned N, typename C = std::less<T>>
class llvm::SmallSet< T, N, C >
SmallSet - This maintains a set of unique values, optimizing for the case when the set is small (less than N). In this case, the set can be maintained with no mallocs. If the set gets large, we expand to using an std::set to maintain reasonable lookup times.
Note that this set does not provide a way to iterate over members in the set.
Definition at line 31 of file SmallSet.h.
Member Typedef Documentation
| typedef size_t llvm::SmallSet< T, N, C >::size_type |
Definition at line 40 of file SmallSet.h.
Constructor & Destructor Documentation
| llvm::SmallSet< T, N, C >::SmallSet | ( | ) | [inline] |
Definition at line 41 of file SmallSet.h.
Member Function Documentation
| void llvm::SmallSet< T, N, C >::clear | ( | ) | [inline] |
Definition at line 101 of file SmallSet.h.
Referenced by llvm::MachineDominatorTree::runOnMachineFunction().
| size_type llvm::SmallSet< T, N, C >::count | ( | const T & | V | ) | const [inline] |
count - Return 1 if the element is in the set, 0 otherwise.
Definition at line 52 of file SmallSet.h.
Referenced by llvm::LiveVariables::addNewBlock(), AntiDepEdges(), llvm::ARMBaseInstrInfo::canCauseFpMLxStall(), llvm::ARMBaseInstrInfo::copyPhysReg(), llvm::Instruction::dropUnknownMetadata(), findDeadCallerSavedReg(), findHoistingInsertPosAndDeps(), IsSafeAndProfitableToMove(), MaySpeculate(), llvm::MachineBasicBlock::SplitCriticalEdge(), and verifyCTRBranch().
| bool LLVM_ATTRIBUTE_UNUSED_RESULT llvm::SmallSet< T, N, C >::empty | ( | ) | const [inline] |
Definition at line 43 of file SmallSet.h.
Referenced by llvm::Instruction::dropUnknownMetadata(), and findHoistingInsertPosAndDeps().
| bool llvm::SmallSet< T, N, C >::erase | ( | const T & | V | ) | [inline] |
Definition at line 90 of file SmallSet.h.
Referenced by llvm::Instruction::dropUnknownMetadata(), and findHoistingInsertPosAndDeps().
| bool llvm::SmallSet< T, N, C >::insert | ( | const T & | V | ) | [inline] |
insert - Insert an element into the set if it isn't already there. Returns true if the element is inserted (it was not in the set before).
Definition at line 63 of file SmallSet.h.
Referenced by llvm::LiveVariables::addNewBlock(), AntiDepEdges(), llvm::ARMBaseInstrInfo::ARMBaseInstrInfo(), AssignProtectedObjSet(), CheckForLiveRegDef(), CheckForLiveRegDefMasked(), llvm::ARMBaseInstrInfo::copyPhysReg(), determinePointerReadAttrs(), llvm::Instruction::dropUnknownMetadata(), findConsecutiveLoad(), findDeadCallerSavedReg(), findHoistingInsertPosAndDeps(), llvm::R600InstrInfo::fitsConstReadLimitations(), llvm::SmallSet< unsigned, 16 >::insert(), isPotentiallyReachableInner(), IsSafeAndProfitableToMove(), llvm::PointerMayBeCaptured(), ProcessSourceNode(), llvm::MachineBasicBlock::SplitCriticalEdge(), TrackDefUses(), and verifyCTRBranch().
| void llvm::SmallSet< T, N, C >::insert | ( | IterT | I, |
| IterT | E | ||
| ) | [inline] |
Definition at line 85 of file SmallSet.h.
| size_type llvm::SmallSet< T, N, C >::size | ( | ) | const [inline] |
Definition at line 47 of file SmallSet.h.
Referenced by llvm::R600InstrInfo::fitsConstReadLimitations(), and IsSafeAndProfitableToMove().
The documentation for this class was generated from the following file:
1.7.6.1