Home
last modified time | relevance | path

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

/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/IR/
H A DValueMap.h47 template<typename DenseMapT, typename KeyT>
70 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {} in onRAUW()
83 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
97 using key_type = KeyT;
155 iterator find(const KeyT &Val) { in find()
164 ValueT lookup(const KeyT &Val) const { in lookup()
190 bool erase(const KeyT &Val) { in erase()
206 ValueT &operator[](const KeyT &Key) {
228 ValueMapCVH Wrap(KeyT key) const { in Wrap()
344 const KeyT first;
[all …]
/freebsd-14.2/contrib/llvm-project/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()
329 bool erase(const KeyT &Val) { in erase()
396 P->getFirst().~KeyT(); in destroyAll()
443 B->getFirst().~KeyT(); in moveFromOldBuckets()
909 SmallDenseMap<KeyT, ValueT, InlineBuckets, KeyInfoT, BucketT>, KeyT,
1022 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;
1112 KeyT stop() const { in stop()
1129 void insert(KeyT a, KeyT b, ValT y) { in insert()
1186 bool overlaps(KeyT a, KeyT b) const { in overlaps()
1582 void treeInsert(KeyT a, KeyT b, ValT y);
1630 void insert(KeyT a, KeyT b, ValT y);
1833 iterator::insert(KeyT a, KeyT b, ValT y) { in insert()
[all …]
H A DMapVector.h33 template <typename KeyT, typename ValueT,
34 typename MapType = DenseMap<KeyT, unsigned>,
45 using key_type = KeyT;
98 ValueT &operator[](const KeyT &Key) {
110 ValueT lookup(const KeyT &Key) const { in lookup()
167 iterator find(const KeyT &Key) { in find()
173 const_iterator find(const KeyT &Key) const { in find()
212 size_type erase(const KeyT &Key) { in erase()
251 template <typename KeyT, typename ValueT, unsigned N>
253 : MapVector<KeyT, ValueT, SmallDenseMap<KeyT, 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 {
128 using KeyT = typename KeyFunctorT::argument_type;
135 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
225 iterator find(const KeyT &Key) {
229 const_iterator find(const KeyT &Key) const {
236 bool contains(const KeyT &Key) const { return find(Key) != end(); }
266 ValueT &operator[](const KeyT &Key) {
[all …]
H A DSparseMultiSet.h120 using KeyT = typename KeyFunctorT::argument_type; variable
126 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
375 iterator find(const KeyT &Key) { in find()
379 const_iterator find(const KeyT &Key) const { in find()
386 size_type count(const KeyT &Key) const { in count()
395 bool contains(const KeyT &Key) const { in contains()
400 iterator getHead(const KeyT &Key) { return find(Key); } in getHead()
401 iterator getTail(const KeyT &Key) { in getTail()
411 RangePair equal_range(const KeyT &K) { in equal_range()
482 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()
/freebsd-14.2/contrib/llvm-project/compiler-rt/lib/orc/
H A Dinterval_map.h31 using KeyPairT = std::pair<KeyT, KeyT>;
63 iterator find(KeyT K) { in find()
77 const_iterator find(KeyT K) const { in find()
81 ValT lookup(KeyT K, ValT NotFound = ValT()) const {
90 void erase(KeyT KS, KeyT KE) { in erase()
128 template <typename KeyT, typename ValT>
130 : public IntervalMapBase<KeyT, ValT> {
133 void insert(KeyT KS, KeyT KE, ValT V) { in insert()
156 template <typename KeyT, typename ValT>
158 : public IntervalMapBase<KeyT, ValT> {
[all …]
H A Dinterval_set.h27 template <typename KeyT, IntervalCoalescing Coalescing>
30 using ImplMap = IntervalMap<KeyT, std::monostate, Coalescing>;
33 using value_type = std::pair<KeyT, KeyT>;
69 const_iterator find(KeyT K) const { in find()
73 void insert(KeyT KS, KeyT KE) { in insert()
77 void erase(KeyT KS, KeyT KE) { in erase()
/freebsd-14.2/contrib/llvm-project/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()
/freebsd-14.2/contrib/llvm-project/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()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ProfileData/
H A DHashKeyMap.h51 typename KeyT, typename ValueT, typename... MapTArgs>
53 public MapT<decltype(hash_value(KeyT())), ValueT, MapTArgs...> {
55 using base_type = MapT<decltype(hash_value(KeyT())), ValueT, MapTArgs...>;
56 using key_type = decltype(hash_value(KeyT()));
57 using original_key_type = KeyT;
/freebsd-14.2/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DExprEngine.cpp734 using KeyT = std::pair<const Expr *, const LocationContext *>; in printIndicesOfElementsToConstructJson() typedef
743 KeyT LastKey; in printIndicesOfElementsToConstructJson()
745 const KeyT &Key = I.first; in printIndicesOfElementsToConstructJson()
758 const KeyT &Key = I.first; in printIndicesOfElementsToConstructJson()
807 KeyT LastKey; in printPendingInitLoopJson()
809 const KeyT &Key = I.first; in printPendingInitLoopJson()
822 const KeyT &Key = I.first; in printPendingInitLoopJson()
857 using KeyT = const LocationContext *; in printPendingArrayDestructionsJson() typedef
863 KeyT LastKey = nullptr; in printPendingArrayDestructionsJson()
865 const KeyT &Key = I.first; in printPendingArrayDestructionsJson()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/
H A DCore.h230 template <typename KeyT>
232 fromMapKeys(const DenseMap<SymbolStringPtr, KeyT> &M,
/freebsd-14.2/contrib/llvm-project/clang/lib/Sema/
H A DSemaExprObjC.cpp1029 QualType KeyT = Method->parameters()[1]->getType(); in BuildObjCDictionaryLiteral() local
1030 const PointerType *PtrKey = KeyT->getAs<PointerType>(); in BuildObjCDictionaryLiteral()
1057 << 1 << KeyT in BuildObjCDictionaryLiteral()
1082 QualType KeyT = KeysT->castAs<PointerType>()->getPointeeType(); in BuildObjCDictionaryLiteral() local
1090 KeyT); in BuildObjCDictionaryLiteral()
/freebsd-14.2/contrib/llvm-project/clang/lib/AST/
H A DExprConstant.cpp624 template<typename KeyT>
625 APValue &createTemporary(const KeyT *Key, QualType T,
1907 template<typename KeyT>
1908 APValue &CallStackFrame::createTemporary(const KeyT *Key, QualType T, in createTemporary()