Home
last modified time | relevance | path

Searched refs:KeyT (Results 1 – 23 of 23) sorted by relevance

/llvm-project-15.0.7/llvm/include/llvm/IR/
H A DValueMap.h48 template<typename DenseMapT, typename KeyT>
71 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {} in onRAUW()
84 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
98 using key_type = KeyT;
156 iterator find(const KeyT &Val) { in find()
165 ValueT lookup(const KeyT &Val) const { in lookup()
191 bool erase(const KeyT &Val) { in erase()
207 ValueT &operator[](const KeyT &Key) {
229 ValueMapCVH Wrap(KeyT key) const { in Wrap()
345 const KeyT first;
[all …]
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DDenseMap.h43 using std::pair<KeyT, ValueT>::pair;
45 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; } in getFirst()
46 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
67 using key_type = KeyT;
80 if (shouldReverseIterate<KeyT>()) in begin()
304 bool erase(const KeyT &Val) { in erase()
371 P->getFirst().~KeyT(); in destroyAll()
418 B->getFirst().~KeyT(); in moveFromOldBuckets()
884 SmallDenseMap<KeyT, ValueT, InlineBuckets, KeyInfoT, BucketT>, KeyT,
997 OldB->getFirst().~KeyT(); in swap()
[all …]
H A DIntervalMap.h452 using LeafBase = NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize>;
566 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
630 insertFrom(unsigned &Pos, unsigned Size, KeyT a, KeyT b, ValT y) { in insertFrom()
957 KeyT start;
1073 KeyT stop() const { in stop()
1090 void insert(KeyT a, KeyT b, ValT y) { in insert()
1147 bool overlaps(KeyT a, KeyT b) const { in overlaps()
1543 void treeInsert(KeyT a, KeyT b, ValT y);
1591 void insert(KeyT a, KeyT b, ValT y);
1794 iterator::insert(KeyT a, KeyT b, ValT y) { in insert()
[all …]
H A DMapVector.h34 template<typename KeyT, typename ValueT,
35 typename MapType = DenseMap<KeyT, unsigned>,
46 using key_type = KeyT;
99 ValueT &operator[](const KeyT &Key) {
111 ValueT lookup(const KeyT &Key) const { in lookup()
143 size_type count(const KeyT &Key) const { in count()
148 iterator find(const KeyT &Key) { in find()
154 const_iterator find(const KeyT &Key) const { in find()
193 size_type erase(const KeyT &Key) { in erase()
232 template <typename KeyT, typename ValueT, unsigned N>
[all …]
H A DSparseSet.h67 template<typename KeyT, typename ValueT, typename KeyFunctorT>
76 template<typename KeyT, typename KeyFunctorT>
77 struct SparseSetValFunctor<KeyT, KeyT, KeyFunctorT> {
78 unsigned operator()(const KeyT &Key) const {
129 using KeyT = typename KeyFunctorT::argument_type;
136 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
225 iterator find(const KeyT &Key) {
229 const_iterator find(const KeyT &Key) const {
241 size_type count(const KeyT &Key) const { return contains(Key) ? 1 : 0; }
266 ValueT &operator[](const KeyT &Key) {
[all …]
H A DSparseMultiSet.h121 using KeyT = typename KeyFunctorT::argument_type; variable
127 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
376 iterator find(const KeyT &Key) { in find()
380 const_iterator find(const KeyT &Key) const { in find()
387 size_type count(const KeyT &Key) const { in count()
396 bool contains(const KeyT &Key) const { in contains()
401 iterator getHead(const KeyT &Key) { return find(Key); } in getHead()
402 iterator getTail(const KeyT &Key) { in getTail()
412 RangePair equal_range(const KeyT &K) { in equal_range()
483 void eraseAll(const KeyT &K) { in eraseAll()
H A DImmutableMap.h61 template <typename KeyT, typename ValT,
62 typename ValInfo = ImutKeyValueInfo<KeyT,ValT>>
201 template <typename KeyT, typename ValT,
202 typename ValInfo = ImutKeyValueInfo<KeyT,ValT>>
226 ImmutableMapRef(const ImmutableMap<KeyT, ValT> &X, in ImmutableMapRef() argument
227 typename ImmutableMap<KeyT, ValT>::Factory &F) in ImmutableMapRef() argument
257 ImmutableMap<KeyT, ValT> asImmutableMap() const { in asImmutableMap()
258 return ImmutableMap<KeyT, ValT>(Factory->getCanonicalTree(Root.get())); in asImmutableMap()
H A DDenseSet.h34 template <typename KeyT> class DenseSetPair : public DenseSetEmpty {
35 KeyT key;
38 KeyT &getFirst() { return key; } in getFirst()
39 const KeyT &getFirst() const { return key; } in getFirst()
/llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_dense_map.h31 using key_type = KeyT;
73 size_type count(const KeyT &Key) const { in count()
78 value_type *find(const KeyT &Key) { in find()
113 ValueT lookup(const KeyT &Key) const { in lookup()
186 bool erase(const KeyT &Val) { in erase()
225 ValueT &operator[](KeyT &&Key) {
236 const KeyT K = P->getFirst(); in forEach()
263 P->getFirst().~KeyT(); in destroyAll()
272 const KeyT EmptyKey = getEmptyKey(); in initEmpty()
292 const KeyT EmptyKey = getEmptyKey(); in moveFromOldBuckets()
[all …]
H A Dsanitizer_dense_map_info.h36 template <typename KeyT, typename ValueT>
38 KeyT first = {};
41 constexpr DenseMapPair(const KeyT &f, const ValueT &s) in DenseMapPair()
54 KeyT &getFirst() { return first; } in getFirst()
55 const KeyT &getFirst() const { return first; } in getFirst()
/llvm-project-15.0.7/llvm/unittests/IR/
H A DValueMapTest.cpp179 template<typename KeyT, typename MutexT>
186 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New) { in onRAUW()
212 template<typename KeyT>
213 struct NoFollow : ValueMapConfig<KeyT> {
234 template<typename KeyT>
235 struct CountOps : ValueMapConfig<KeyT> {
241 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New) { in onRAUW()
265 template<typename KeyT>
266 struct ModifyingConfig : ValueMapConfig<KeyT> {
271 typedef ValueMap<KeyT, int, ModifyingConfig<KeyT> > **ExtraData;
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/ObjCARC/
H A DBlotMapVector.h22 template <class KeyT, class ValueT> class BlotMapVector {
24 using MapTy = DenseMap<KeyT, size_t>;
28 using VectorTy = std::vector<std::pair<KeyT, ValueT>>;
55 ValueT &operator[](const KeyT &Arg) {
67 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert() argument
79 iterator find(const KeyT &Key) { in find()
86 const_iterator find(const KeyT &Key) const { in find()
96 void blot(const KeyT &Key) { in blot()
100 Vector[It->second].first = KeyT(); in blot()
/llvm-project-15.0.7/mlir/include/mlir/Support/
H A DLLVM.h49 template <typename KeyT, typename ValueT>
52 template <typename KeyT, typename ValueT, typename KeyInfoT, typename BucketT>
119 template <typename KeyT, typename ValueT,
120 typename KeyInfoT = DenseMapInfo<KeyT>,
121 typename BucketT = llvm::detail::DenseMapPair<KeyT, ValueT>>
122 using DenseMap = llvm::DenseMap<KeyT, ValueT, KeyInfoT, BucketT>;
/llvm-project-15.0.7/mlir/lib/Tools/PDLL/AST/
H A DTypeDetail.h32 template <typename ConcreteT, typename KeyT = void>
34 using KeyTy = KeyT;
35 using Base = TypeStorageBase<ConcreteT, KeyT>;
/llvm-project-15.0.7/mlir/lib/Conversion/PDLToPDLInterp/
H A DPredicate.h88 template <typename KeyT>
89 explicit PredicateBase(KeyT &&key) in PredicateBase()
90 : BaseT(Kind), key(std::forward<KeyT>(key)) {} in PredicateBase()
99 template <typename KeyT>
101 KeyT &&key) { in construct()
102 return new (alloc.allocate<ConcreteT>()) ConcreteT(std::forward<KeyT>(key)); in construct()
/llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/
H A Dscheduler-subrange-crash.ll5 …nfo<llvm::SlotIndex> >::insertFrom(unsigned int &, unsigned int, KeyT, KeyT, ValT) [KeyT = llvm::S…
H A Dunigine-liveness-crash.ll4 …nfo<llvm::SlotIndex> >::insertFrom(unsigned int &, unsigned int, KeyT, KeyT, ValT) [KeyT = llvm::S…
/llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_dense_map_test.cpp22 template <typename KeyT, typename ValueT,
23 typename KeyInfoT = DenseMapInfo<KeyT>>
24 class TestDenseMap : public DenseMap<KeyT, ValueT, KeyInfoT> {
25 using BaseT = DenseMap<KeyT, ValueT, KeyInfoT>;
/llvm-project-15.0.7/llvm/include/llvm/ExecutionEngine/Orc/
H A DCore.h222 template <typename KeyT>
224 fromMapKeys(const DenseMap<SymbolStringPtr, KeyT> &M,
/llvm-project-15.0.7/clang/lib/Sema/
H A DSemaExprObjC.cpp1028 QualType KeyT = Method->parameters()[1]->getType(); in BuildObjCDictionaryLiteral() local
1029 const PointerType *PtrKey = KeyT->getAs<PointerType>(); in BuildObjCDictionaryLiteral()
1059 << 1 << KeyT in BuildObjCDictionaryLiteral()
1084 QualType KeyT = KeysT->castAs<PointerType>()->getPointeeType(); in BuildObjCDictionaryLiteral() local
1092 KeyT); in BuildObjCDictionaryLiteral()
/llvm-project-15.0.7/clang/lib/StaticAnalyzer/Core/
H A DExprEngine.cpp692 using KeyT = std::pair<const Expr *, const LocationContext *>; in printIndicesOfElementsToConstructJson() typedef
701 KeyT LastKey; in printIndicesOfElementsToConstructJson()
703 const KeyT &Key = I.first; in printIndicesOfElementsToConstructJson()
716 const KeyT &Key = I.first; in printIndicesOfElementsToConstructJson()
/llvm-project-15.0.7/clang/lib/AST/
H A DExprConstant.cpp623 template<typename KeyT>
624 APValue &createTemporary(const KeyT *Key, QualType T,
1850 template<typename KeyT>
1851 APValue &CallStackFrame::createTemporary(const KeyT *Key, QualType T, in createTemporary()
/llvm-project-15.0.7/llvm/docs/
H A DProgrammersManual.rst2337 ``MapVector<KeyT,ValueT>`` provides a subset of the DenseMap interface. The