Home
last modified time | relevance | path

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

12

/external/llvm/include/llvm/IR/
DValueMap.h41 template<typename KeyT, typename ValueT, typename Config>
44 template<typename DenseMapT, typename KeyT>
46 template<typename DenseMapT, typename KeyT>
52 template<typename KeyT, typename MutexT = sys::Mutex>
67 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {} in onRAUW()
69 static void onDelete(const ExtraDataT &/*Data*/, KeyT /*Old*/) {} in onDelete()
80 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT> >
82 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
83 typedef ValueMapCallbackVH<KeyT, ValueT, Config> ValueMapCVH;
96 typedef KeyT key_type;
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/
DValueMap.h47 template<typename KeyT, typename ValueT, typename Config>
49 template<typename DenseMapT, typename KeyT>
51 template<typename DenseMapT, typename KeyT>
57 template<typename KeyT, typename MutexT = sys::Mutex>
72 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {} in onRAUW()
74 static void onDelete(const ExtraDataT &/*Data*/, KeyT /*Old*/) {} in onDelete()
85 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
87 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
89 using ValueMapCVH = ValueMapCallbackVH<KeyT, ValueT, Config>;
100 using key_type = KeyT;
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/
DDenseMap.h39 template <typename KeyT, typename ValueT>
40 struct DenseMapPair : public std::pair<KeyT, ValueT> {
41 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; } in getFirst()
42 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
43 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
44 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
50 typename KeyT, typename ValueT, typename KeyInfoT = DenseMapInfo<KeyT>,
51 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
54 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
62 using key_type = KeyT;
[all …]
DIntervalMap.h435 template <typename KeyT, typename ValT>
444 static_cast<unsigned>(2*sizeof(KeyT)+sizeof(ValT)),
449 using LeafBase = NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize>;
458 static_cast<unsigned>(sizeof(KeyT) + sizeof(void*))
562 template <typename KeyT, typename ValT, unsigned N, typename Traits>
563 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
565 const KeyT &start(unsigned i) const { return this->first[i].first; } in start()
566 const KeyT &stop(unsigned i) const { return this->first[i].second; } in stop()
569 KeyT &start(unsigned i) { return this->first[i].first; } in start()
570 KeyT &stop(unsigned i) { return this->first[i].second; } in stop()
[all …]
DMapVector.h35 template<typename KeyT, typename ValueT,
36 typename MapType = DenseMap<KeyT, unsigned>,
37 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
84 std::pair<KeyT, ValueT> &front() { return Vector.front(); } in front()
85 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } in front()
86 std::pair<KeyT, ValueT> &back() { return Vector.back(); } in back()
87 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } in back()
99 ValueT &operator[](const KeyT &Key) {
100 std::pair<KeyT, typename MapType::mapped_type> Pair = std::make_pair(Key, 0);
111 ValueT lookup(const KeyT &Key) const { in lookup()
[all …]
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 {
236 size_type count(const KeyT &Key) const {
263 ValueT &operator[](const KeyT &Key) {
[all …]
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()
DImmutableMap.h61 template <typename KeyT, typename ValT,
62 typename ValInfo = ImutKeyValueInfo<KeyT,ValT>>
256 template <typename KeyT, typename ValT,
257 typename ValInfo = ImutKeyValueInfo<KeyT,ValT>>
285 explicit ImmutableMapRef(const ImmutableMap<KeyT, ValT> &X, in ImmutableMapRef() argument
286 typename ImmutableMap<KeyT, ValT>::Factory &F) in ImmutableMapRef() argument
343 ImmutableMap<KeyT, ValT> asImmutableMap() const { in asImmutableMap()
344 return ImmutableMap<KeyT, ValT>(Factory->getCanonicalTree(Root)); in asImmutableMap()
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()
/external/llvm/include/llvm/ADT/
DDenseMap.h38 template <typename KeyT, typename ValueT>
39 struct DenseMapPair : public std::pair<KeyT, ValueT> {
40 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; } in getFirst()
41 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
42 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
43 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
48 typename KeyT, typename ValueT, typename KeyInfoT = DenseMapInfo<KeyT>,
49 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
52 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
57 typedef KeyT key_type;
[all …]
DIntervalMap.h430 template <typename KeyT, typename ValT>
439 static_cast<unsigned>(2*sizeof(KeyT)+sizeof(ValT)),
444 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase;
453 static_cast<unsigned>(sizeof(KeyT) + sizeof(void*))
559 template <typename KeyT, typename ValT, unsigned N, typename Traits>
560 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
562 const KeyT &start(unsigned i) const { return this->first[i].first; } in start()
563 const KeyT &stop(unsigned i) const { return this->first[i].second; } in stop()
566 KeyT &start(unsigned i) { return this->first[i].first; } in start()
567 KeyT &stop(unsigned i) { return this->first[i].second; } in stop()
[all …]
DMapVector.h29 template<typename KeyT, typename ValueT,
30 typename MapType = llvm::DenseMap<KeyT, unsigned>,
31 typename VectorType = std::vector<std::pair<KeyT, ValueT> > >
60 std::pair<KeyT, ValueT> &front() { return Vector.front(); } in front()
61 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } in front()
62 std::pair<KeyT, ValueT> &back() { return Vector.back(); } in back()
63 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } in back()
75 ValueT &operator[](const KeyT &Key) {
76 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
86 ValueT lookup(const KeyT &Key) const { in lookup()
[all …]
DSparseSet.h63 template<typename KeyT, typename ValueT, typename KeyFunctorT>
72 template<typename KeyT, typename KeyFunctorT>
73 struct SparseSetValFunctor<KeyT, KeyT, KeyFunctorT> {
74 unsigned operator()(const KeyT &Key) const {
125 typedef typename KeyFunctorT::argument_type KeyT;
132 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
224 iterator find(const KeyT &Key) {
228 const_iterator find(const KeyT &Key) const {
235 size_type count(const KeyT &Key) const {
262 ValueT &operator[](const KeyT &Key) {
[all …]
DSparseMultiSet.h113 typedef typename KeyFunctorT::argument_type KeyT; typedef
119 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
371 iterator find(const KeyT &Key) { in find()
375 const_iterator find(const KeyT &Key) const { in find()
382 size_type count(const KeyT &Key) const { in count()
391 bool contains(const KeyT &Key) const { in contains()
396 iterator getHead(const KeyT &Key) { return find(Key); } in getHead()
397 iterator getTail(const KeyT &Key) { in getTail()
407 RangePair equal_range(const KeyT &K) { in equal_range()
478 void eraseAll(const KeyT &K) { in eraseAll()
DImmutableMap.h58 template <typename KeyT, typename ValT,
59 typename ValInfo = ImutKeyValueInfo<KeyT,ValT> >
250 template <typename KeyT, typename ValT,
251 typename ValInfo = ImutKeyValueInfo<KeyT,ValT> >
279 explicit ImmutableMapRef(const ImmutableMap<KeyT, ValT> &X, in ImmutableMapRef() argument
280 typename ImmutableMap<KeyT, ValT>::Factory &F) in ImmutableMapRef() argument
337 ImmutableMap<KeyT, ValT> asImmutableMap() const { in asImmutableMap()
338 return ImmutableMap<KeyT, ValT>(Factory->getCanonicalTree(Root)); in asImmutableMap()
DDenseSet.h26 template <typename KeyT> class DenseSetPair : public DenseSetEmpty {
27 KeyT key;
30 KeyT &getFirst() { return key; } in getFirst()
31 const KeyT &getFirst() const { return key; } in getFirst()
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
DDenseMap.h38 template <typename KeyT, typename ValueT>
39 struct DenseMapPair : public std::pair<KeyT, ValueT> {
40 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; } in getFirst()
41 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
42 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
43 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
49 typename KeyT, typename ValueT, typename KeyInfoT = DenseMapInfo<KeyT>,
50 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
53 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
58 typedef KeyT key_type;
[all …]
/external/llvm/unittests/IR/
DValueMapTest.cpp180 template<typename KeyT, typename MutexT>
181 struct LockMutex : ValueMapConfig<KeyT, MutexT> {
187 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New) { in onRAUW()
191 static void onDelete(const ExtraData &Data, KeyT Old) { in onDelete()
213 template<typename KeyT>
214 struct NoFollow : ValueMapConfig<KeyT> {
235 template<typename KeyT>
236 struct CountOps : ValueMapConfig<KeyT> {
242 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New) { in onRAUW()
245 static void onDelete(const ExtraData &Data, KeyT Old) { in onDelete()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/IR/
DValueMapTest.cpp180 template<typename KeyT, typename MutexT>
181 struct LockMutex : ValueMapConfig<KeyT, MutexT> {
187 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New) { in onRAUW()
191 static void onDelete(const ExtraData &Data, KeyT Old) { in onDelete()
213 template<typename KeyT>
214 struct NoFollow : ValueMapConfig<KeyT> {
235 template<typename KeyT>
236 struct CountOps : ValueMapConfig<KeyT> {
242 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New) { in onRAUW()
245 static void onDelete(const ExtraData &Data, KeyT Old) { in onDelete()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/ObjCARC/
DBlotMapVector.h23 template <class KeyT, class ValueT> class BlotMapVector {
25 using MapTy = DenseMap<KeyT, size_t>;
29 using VectorTy = std::vector<std::pair<KeyT, ValueT>>;
56 ValueT &operator[](const KeyT &Arg) {
68 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert() argument
80 iterator find(const KeyT &Key) { in find()
87 const_iterator find(const KeyT &Key) const { in find()
97 void blot(const KeyT &Key) { in blot()
101 Vector[It->second].first = KeyT(); in blot()
/external/llvm/lib/Transforms/ObjCARC/
DBlotMapVector.h17 template <class KeyT, class ValueT> class BlotMapVector {
19 typedef DenseMap<KeyT, size_t> MapTy;
22 typedef std::vector<std::pair<KeyT, ValueT>> VectorTy;
49 ValueT &operator[](const KeyT &Arg) {
61 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert() argument
73 iterator find(const KeyT &Key) { in find()
80 const_iterator find(const KeyT &Key) const { in find()
90 void blot(const KeyT &Key) { in blot()
94 Vector[It->second].first = KeyT(); in blot()
/external/swiftshader/third_party/llvm-7.0/llvm/tools/dsymutil/
DCompileUnit.h22 template <typename KeyT, typename ValT>
24 IntervalMap<KeyT, ValT, IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize,
25 IntervalMapHalfOpenInfo<KeyT>>;
/external/tensorflow/tensorflow/compiler/jit/kernels/
Dxla_ops.cc146 using KeyT = string; typedef in tensorflow::__anon28d5964d0111::XlaExecutableClosureStore
148 KeyT Produce(XlaExecutableClosure result) { in Produce()
150 KeyT key = absl::StrCat(key_counter_++); in Produce()
157 XlaExecutableClosure Consume(const KeyT& key) { in Consume()
174 absl::flat_hash_map<KeyT, XlaExecutableClosure> closures_ GUARDED_BY(mutex_);
538 XlaExecutableClosureStore::KeyT key = in Compute()
558 const XlaExecutableClosureStore::KeyT& key = key_tensor.flat<tstring>()(0); in Compute()
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/AMDGPU/
Dscheduler-subrange-crash.ll5 …nfo<llvm::SlotIndex> >::insertFrom(unsigned int &, unsigned int, KeyT, KeyT, ValT) [KeyT = llvm::S…
/external/v8/src/compiler/
Dstore-store-elimination.cc79 using KeyT = UnobservableStore; typedef in v8::internal::compiler::__anon93a164fb0111::UnobservablesSet
88 using SetT = PersistentMap<KeyT, ValueT>;
149 static void SetAdd(SetT* set, const KeyT& key) { set->Set(key, kPresent); } in SetAdd()
150 static void SetErase(SetT* set, const KeyT& key) { in SetErase()

12