Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DValueMap.h45 template<typename KeyT, typename ValueT, typename Config>
47 template<typename DenseMapT, typename KeyT>
49 template<typename DenseMapT, typename KeyT>
55 template<typename KeyT, typename MutexT = sys::Mutex>
70 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {} in onRAUW()
72 static void onDelete(const ExtraDataT &/*Data*/, KeyT /*Old*/) {} in onDelete()
83 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
85 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
87 using ValueMapCVH = ValueMapCallbackVH<KeyT, ValueT, Config>;
99 using key_type = KeyT;
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDenseMap.h43 template <typename KeyT, typename ValueT>
44 struct DenseMapPair : public std::pair<KeyT, ValueT> {
45 using std::pair<KeyT, ValueT>::pair;
47 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; } in getFirst()
48 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
49 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
50 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
55 template <typename KeyT, typename ValueT,
56 typename KeyInfoT = DenseMapInfo<KeyT>,
57 typename Bucket = llvm::detail::DenseMapPair<KeyT, ValueT>,
[all …]
H A DIntervalMap.h439 template <typename KeyT, typename ValT>
448 static_cast<unsigned>(2*sizeof(KeyT)+sizeof(ValT)),
453 using LeafBase = NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize>;
462 static_cast<unsigned>(sizeof(KeyT) + sizeof(void*))
566 template <typename KeyT, typename ValT, unsigned N, typename Traits>
567 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
569 const KeyT &start(unsigned i) const { return this->first[i].first; } in start()
570 const KeyT &stop(unsigned i) const { return this->first[i].second; } in stop()
573 KeyT &start(unsigned i) { return this->first[i].first; } in start()
574 KeyT &stop(unsigned i) { return this->first[i].second; } in stop()
[all …]
H A DMapVector.h33 template <typename KeyT, typename ValueT,
34 typename MapType = DenseMap<KeyT, unsigned>,
35 typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
45 using key_type = KeyT;
86 std::pair<KeyT, ValueT> &front() { return Vector.front(); } in front()
87 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } in front()
88 std::pair<KeyT, ValueT> &back() { return Vector.back(); } in back()
89 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } in back()
101 ValueT &operator[](const KeyT &Key) {
112 ValueT lookup(const KeyT &Key) const { in lookup()
[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;
140 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
229 iterator find(const KeyT &Key) {
233 const_iterator find(const KeyT &Key) const {
240 bool contains(const KeyT &Key) const { return find(Key) != end(); }
245 size_type count(const KeyT &Key) const { return contains(Key) ? 1 : 0; }
[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.h36 template <typename KeyT> class DenseSetPair : public DenseSetEmpty {
37 KeyT key;
40 KeyT &getFirst() { return key; } in getFirst()
41 const KeyT &getFirst() const { return key; } in getFirst()
/freebsd/contrib/llvm-project/compiler-rt/lib/orc/
H A Dinterval_map.h29 template <typename KeyT, typename ValT> class IntervalMapBase {
31 using KeyPairT = std::pair<KeyT, KeyT>;
38 bool operator()(const KeyPairT &LHS, const KeyT &RHS) const { in operator()
41 bool operator()(const KeyT &LHS, const KeyPairT &RHS) const { in operator()
63 iterator find(KeyT K) { in find()
77 const_iterator find(KeyT K) const { in find()
78 return const_cast<IntervalMapBase<KeyT, ValT> *>(this)->find(K); in find()
81 ValT lookup(KeyT K, ValT NotFound = ValT()) const {
90 void erase(KeyT KS, KeyT KE) { in erase()
125 template <typename KeyT, typename ValT, IntervalCoalescing Coalescing>
[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/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_dense_map.h26 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
31 using key_type = KeyT;
50 const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); in clear()
73 bool contains(const KeyT &Key) const { return doFind(Key) != nullptr; } in contains()
76 size_type count(const KeyT &Key) const { return contains(Key) ? 1 : 0; } in count()
78 value_type *find(const KeyT &Key) { return doFind(Key); } in find()
79 const value_type *find(const KeyT &Key) const { return doFind(Key); } in find()
97 ValueT lookup(const KeyT &Key) const { in lookup()
122 detail::DenseMapPair<value_type *, bool> try_emplace(KeyT &&Key, in try_emplace()
138 detail::DenseMapPair<value_type *, bool> try_emplace(const KeyT &Key, in try_emplace()
[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/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) {
66 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert() argument
78 iterator find(const KeyT &Key) { in find()
85 const_iterator find(const KeyT &Key) const { in find()
95 void blot(const KeyT &Key) { in blot()
99 Vector[It->second].first = KeyT(); in blot()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/
H A DSeedCollector.h179 using KeyT = std::tuple<Value *, Type *, Instruction::Opcode>; variable
186 using BundleMapT = MapVector<KeyT, ValT>;
194 template <typename LoadOrStoreT> KeyT getKey(LoadOrStoreT *LSI) const;
274 bool erase(const KeyT &Key) { return Bundles.erase(Key); } in erase()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/
H A DSeedCollector.cpp76 SeedContainer::KeyT SeedContainer::getKey(LoadOrStoreT *LSI) const { in getKey()
88 template SeedContainer::KeyT
90 template SeedContainer::KeyT
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DExprEngine.cpp735 using KeyT = std::pair<const Expr *, const LocationContext *>; in printIndicesOfElementsToConstructJson() typedef
744 KeyT LastKey; in printIndicesOfElementsToConstructJson()
746 const KeyT &Key = I.first; in printIndicesOfElementsToConstructJson()
759 const KeyT &Key = I.first; in printIndicesOfElementsToConstructJson()
799 using KeyT = std::pair<const CXXConstructExpr *, const LocationContext *>; in printPendingInitLoopJson() typedef
808 KeyT LastKey; in printPendingInitLoopJson()
810 const KeyT &Key = I.first; in printPendingInitLoopJson()
823 const KeyT &Key = I.first; in printPendingInitLoopJson()
858 using KeyT = const LocationContext *; in printPendingArrayDestructionsJson() typedef
864 KeyT LastKey = nullptr; in printPendingArrayDestructionsJson()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaExprObjC.cpp1031 QualType KeyT = Method->parameters()[1]->getType(); in BuildObjCDictionaryLiteral() local
1032 const PointerType *PtrKey = KeyT->getAs<PointerType>(); in BuildObjCDictionaryLiteral()
1059 << 1 << KeyT in BuildObjCDictionaryLiteral()
1084 QualType KeyT = KeysT->castAs<PointerType>()->getPointeeType(); in BuildObjCDictionaryLiteral() local
1092 CheckObjCCollectionLiteralElement(SemaRef, Element.Key, KeyT); in BuildObjCDictionaryLiteral()
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DExprConstant.cpp648 template<typename KeyT>
649 APValue &createTemporary(const KeyT *Key, QualType T,
1950 template<typename KeyT>
1951 APValue &CallStackFrame::createTemporary(const KeyT *Key, QualType T, in createTemporary()