/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
D | ValueMap.h | 38 template<typename KeyT, typename ValueT, typename Config, typename ValueInfoT> 41 template<typename DenseMapT, typename KeyT> 43 template<typename DenseMapT, typename KeyT> 49 template<typename KeyT> 62 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {} in onRAUW() 64 static void onDelete(const ExtraDataT &/*Data*/, KeyT /*Old*/) {} in onDelete() 75 template<typename KeyT, typename ValueT, typename Config = ValueMapConfig<KeyT>, 78 friend class ValueMapCallbackVH<KeyT, ValueT, Config, ValueInfoT>; 79 typedef ValueMapCallbackVH<KeyT, ValueT, Config, ValueInfoT> ValueMapCVH; 88 typedef KeyT key_type; [all …]
|
D | DenseMap.h | 31 template<typename KeyT, typename ValueT, 32 typename KeyInfoT = DenseMapInfo<KeyT>, 36 template<typename KeyT, typename ValueT, 37 typename KeyInfoT = DenseMapInfo<KeyT>, 40 typedef std::pair<KeyT, ValueT> BucketT; 47 typedef KeyT key_type; 67 const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); in ~DenseMap() 72 P->first.~KeyT(); in ~DenseMap() 81 typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator; 82 typedef DenseMapIterator<KeyT, ValueT, [all …]
|
D | IntervalMap.h | 409 template <typename KeyT, typename ValT> 418 static_cast<unsigned>(2*sizeof(KeyT)+sizeof(ValT)), 423 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase; 432 static_cast<unsigned>(sizeof(KeyT) + sizeof(void*)) 538 template <typename KeyT, typename ValT, unsigned N, typename Traits> 539 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> { 541 const KeyT &start(unsigned i) const { return this->first[i].first; } in start() 542 const KeyT &stop(unsigned i) const { return this->first[i].second; } in stop() 545 KeyT &start(unsigned i) { return this->first[i].first; } in start() 546 KeyT &stop(unsigned i) { return this->first[i].second; } in stop() [all …]
|
D | ImmutableMap.h | 59 template <typename KeyT, typename ValT, 60 typename ValInfo = ImutKeyValueInfo<KeyT,ValT> > 264 template <typename KeyT, typename ValT, 265 typename ValInfo = ImutKeyValueInfo<KeyT,ValT> > 335 ImmutableMap<KeyT, ValT> asImmutableMap() const { in asImmutableMap() 336 return ImmutableMap<KeyT, ValT>(Factory->getCanonicalTree(Root)); in asImmutableMap()
|
/external/llvm/include/llvm/IR/ |
D | ValueMap.h | 41 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/llvm/include/llvm/ADT/ |
D | DenseMap.h | 38 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 …]
|
D | IntervalMap.h | 430 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 …]
|
D | MapVector.h | 29 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 …]
|
D | SparseSet.h | 63 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 …]
|
D | SparseMultiSet.h | 113 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()
|
D | ImmutableMap.h | 58 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()
|
D | DenseSet.h | 26 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/ |
D | DenseMap.h | 38 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/swiftshader/third_party/LLVM/unittests/VMCore/ |
D | ValueMapTest.cpp | 181 template<typename KeyT> 182 struct LockMutex : ValueMapConfig<KeyT> { 188 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New) { in onRAUW() 192 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/llvm/unittests/IR/ |
D | ValueMapTest.cpp | 180 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/llvm/lib/Transforms/ObjCARC/ |
D | BlotMapVector.h | 17 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/lib/Transforms/Scalar/ |
D | ObjCARC.cpp | 57 template<class KeyT, class ValueT> 60 typedef DenseMap<KeyT, size_t> MapTy; 64 typedef std::vector<std::pair<KeyT, ValueT> > VectorTy; 91 ValueT &operator[](KeyT Arg) { in operator []() 103 insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert() argument 114 const_iterator find(KeyT Key) const { in find() 124 void blot(KeyT Key) { in blot() 127 Vector[It->second].first = KeyT(); in blot()
|
/external/swiftshader/third_party/LLVM/include/llvm/ |
D | Module.h | 33 template<typename KeyT, typename ValueT,
|
/external/clang/lib/Sema/ |
D | SemaExprObjC.cpp | 947 QualType KeyT = Method->parameters()[1]->getType(); in BuildObjCDictionaryLiteral() local 948 const PointerType *PtrKey = KeyT->getAs<PointerType>(); in BuildObjCDictionaryLiteral() 978 << 1 << KeyT in BuildObjCDictionaryLiteral() 1003 QualType KeyT = KeysT->castAs<PointerType>()->getPointeeType(); in BuildObjCDictionaryLiteral() local 1011 KeyT); in BuildObjCDictionaryLiteral()
|
/external/llvm/tools/dsymutil/ |
D | DwarfLinker.cpp | 49 template <typename KeyT, typename ValT> 51 IntervalMap<KeyT, ValT, IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, 52 IntervalMapHalfOpenInfo<KeyT>>;
|
/external/llvm/docs/ |
D | ProgrammersManual.rst | 1637 ``MapVector<KeyT,ValueT>`` provides a subset of the DenseMap interface. The
|