| /llvm-project-15.0.7/llvm/include/llvm/ADT/ |
| H A D | DenseSet.h | 63 using key_type = ValueT; 64 using value_type = ValueT; 101 bool erase(const ValueT &V) { in erase() 118 using value_type = ValueT; 126 ValueT &operator*() { return I->getFirst(); } 148 using value_type = ValueT; 267 template <typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT>> 269 ValueT, DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT, 273 detail::DenseSetImpl<ValueT, 288 ValueT, SmallDenseMap<ValueT, detail::DenseSetEmpty, InlineBuckets, [all …]
|
| H A D | SparseSet.h | 56 template<typename ValueT> 121 template<typename ValueT, 130 using DenseT = SmallVector<ValueT, 8>; 139 using value_type = ValueT; 140 using reference = ValueT &; 141 using const_reference = const ValueT &; 142 using pointer = ValueT *; 143 using const_pointer = const ValueT *; 266 ValueT &operator[](const KeyT &Key) { 267 return *insert(ValueT(Key)).first; [all …]
|
| H A D | DenseMap.h | 41 template <typename KeyT, typename ValueT> 43 using std::pair<KeyT, ValueT>::pair; 47 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond() 48 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond() 68 using mapped_type = ValueT; 133 P->getSecond().~ValueT(); in clear() 203 return ValueT(); in lookup() 343 ValueT &operator[](KeyT &&Key) { 370 P->getSecond().~ValueT(); in destroyAll() 416 B->getSecond().~ValueT(); in moveFromOldBuckets() [all …]
|
| H A D | MapVector.h | 34 template<typename KeyT, typename ValueT, 36 typename VectorType = std::vector<std::pair<KeyT, ValueT>>> 99 ValueT &operator[](const KeyT &Key) { 104 Vector.push_back(std::make_pair(Key, ValueT())); 111 ValueT lookup(const KeyT &Key) const { in lookup() 112 static_assert(std::is_copy_constructible<ValueT>::value, in lookup() 115 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; in lookup() 130 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { in insert() 232 template <typename KeyT, typename ValueT, unsigned N> 234 : MapVector<KeyT, ValueT, SmallDenseMap<KeyT, unsigned, N>, [all …]
|
| H A D | TypeSwitch.h | 66 template <typename ValueT, typename CastT> 68 decltype(std::declval<ValueT &>().template dyn_cast<CastT>()); 72 template <typename CastT, typename ValueT> 74 ValueT value, 76 is_detected<has_dyn_cast_t, ValueT, CastT>::value> * = nullptr) { 82 template <typename CastT, typename ValueT> 84 ValueT value, 86 !is_detected<has_dyn_cast_t, ValueT, CastT>::value> * = nullptr) {
|
| H A D | SparseMultiSet.h | 83 template<typename ValueT, 100 ValueT Data; 127 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf; 135 unsigned sparseIndex(const ValueT &Val) const { in sparseIndex() 186 using value_type = ValueT; 187 using reference = ValueT &; 188 using const_reference = const ValueT &; 189 using pointer = ValueT *; 190 using const_pointer = const ValueT *; 225 using value_type = ValueT; [all …]
|
| H A D | AllocatorList.h | 86 template <class ValueT, class IteratorBase> 88 : public iterator_adaptor_base<IteratorImpl<ValueT, IteratorBase>, 90 std::bidirectional_iterator_tag, ValueT> { 96 iterator_adaptor_base<IteratorImpl<ValueT, IteratorBase>, IteratorBase, 97 std::bidirectional_iterator_tag, ValueT>; 100 using value_type = ValueT; 101 using pointer = ValueT *; 102 using reference = ValueT &;
|
| /llvm-project-15.0.7/mlir/include/mlir/Support/ |
| H A D | ThreadLocalCache.h | 27 template <typename ValueT> 38 if (std::shared_ptr<ValueT> value = it.second.lock()) in ~CacheType() 61 ValueT &get() { in get() 64 std::weak_ptr<ValueT> &threadInstance = staticCache[this]; in get() 65 if (std::shared_ptr<ValueT> value = threadInstance.lock()) in get() 70 instances.push_back(std::make_shared<ValueT>()); in get() 71 std::shared_ptr<ValueT> &instance = instances.back(); in get() 80 ValueT &operator*() { return get(); } 81 ValueT *operator->() { return &get(); } 96 void remove(ValueT *value) { in remove() [all …]
|
| H A D | LLVM.h | 49 template <typename KeyT, typename ValueT> 52 template <typename KeyT, typename ValueT, typename KeyInfoT, typename BucketT> 56 template <typename ValueT, typename ValueInfoT> 119 template <typename KeyT, typename ValueT, 121 typename BucketT = llvm::detail::DenseMapPair<KeyT, ValueT>> 122 using DenseMap = llvm::DenseMap<KeyT, ValueT, KeyInfoT, BucketT>; 123 template <typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT>> 124 using DenseSet = llvm::DenseSet<ValueT, ValueInfoT>;
|
| H A D | InterfaceSupport.h | 68 template <typename ConcreteType, typename ValueT, typename Traits, 79 Interface<ConcreteType, ValueT, Traits, BaseType, BaseTrait>; 82 using ValueType = ValueT; 94 Interface(ValueT t = ValueT()) 98 Interface(std::nullptr_t) : BaseType(ValueT()), impl(nullptr) {} in Interface() 110 Interface(ValueT t, std::nullptr_t) : BaseType(t), impl(nullptr) {} in Interface() 114 static bool classof(ValueT t) { return ConcreteType::getInterfaceFor(t); } in classof() 273 template <typename ConcreteType, typename ValueT, typename Traits, 277 Interface<ConcreteType, ValueT, Traits, BaseType, BaseTrait> &);
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.ctor/ |
| H A D | pointer.pass.cpp | 41 typedef typename std::conditional<!IsArray, A, A[]>::type ValueT; in test_pointer() typedef 45 using U1 = std::unique_ptr<ValueT>; in test_pointer() 46 using U2 = std::unique_ptr<ValueT, Deleter<ValueT> >; in test_pointer() 58 A* p = newValue<ValueT>(expect_alive); in test_pointer() 60 std::unique_ptr<ValueT> s(p); in test_pointer() 65 A* p = newValue<ValueT>(expect_alive); in test_pointer() 67 std::unique_ptr<ValueT, NCDeleter<ValueT> > s(p); in test_pointer() 73 A* p = newValue<ValueT>(expect_alive); in test_pointer() 75 std::unique_ptr<ValueT, DefaultCtorDeleter<ValueT> > s(p); in test_pointer()
|
| /llvm-project-15.0.7/llvm/include/llvm/IR/ |
| H A D | ValueMap.h | 99 using mapped_type = ValueT; 100 using value_type = std::pair<KeyT, ValueT>; 165 ValueT lookup(const KeyT &Val) const { in lookup() 167 return I != Map.end() ? I->second : ValueT(); in lookup() 207 ValueT &operator[](const KeyT &Key) { 242 friend class ValueMap<KeyT, ValueT, Config>; 289 ValueT Target(std::move(I->second)); 346 ValueT& second; 350 operator std::pair<KeyT, ValueT>() const { 402 const ValueT& second; [all …]
|
| /llvm-project-15.0.7/mlir/include/mlir/Analysis/DataFlow/ |
| H A D | SparseAnalysis.h | 80 template <typename ValueT> 90 ValueT &getValue() { in getValue() 94 const ValueT &getValue() const { in getValue() 95 return const_cast<Lattice<ValueT> *>(this)->getValue(); in getValue() 114 const Lattice<ValueT> &rhsLattice = in join() 115 static_cast<const Lattice<ValueT> &>(rhs); in join() 127 ChangeResult join(const ValueT &rhs) { in join() 135 ValueT newValue = ValueT::join(*optimisticValue, rhs); in join() 138 assert(ValueT::join(newValue, rhs) == newValue && in join() 176 ValueT knownValue; [all …]
|
| /llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_dense_map.h | 32 using mapped_type = ValueT; 60 P->getSecond().~ValueT(); in clear() 113 ValueT lookup(const KeyT &Key) const { in lookup() 117 return ValueT(); in lookup() 191 TheBucket->getSecond().~ValueT(); in erase() 201 TheBucket->getSecond().~ValueT(); in erase() 225 ValueT &operator[](KeyT &&Key) { 262 P->getSecond().~ValueT(); in destroyAll() 304 ValueT(__sanitizer::move(B->getSecond())); in moveFromOldBuckets() 308 B->getSecond().~ValueT(); in moveFromOldBuckets() [all …]
|
| H A D | sanitizer_dense_map_info.h | 36 template <typename KeyT, typename ValueT> 39 ValueT second = {}; 41 constexpr DenseMapPair(const KeyT &f, const ValueT &s) in DenseMapPair() 56 ValueT &getSecond() { return second; } in getSecond() 57 const ValueT &getSecond() const { return second; } in getSecond()
|
| /llvm-project-15.0.7/llvm/include/llvm/DebugInfo/PDB/Native/ |
| H A D | HashTable.h | 31 template <typename ValueT> class HashTable; 33 template <typename ValueT> 35 : public iterator_facade_base<HashTableIterator<ValueT>, 39 friend HashTable<ValueT>; 70 const std::pair<uint32_t, ValueT> &operator*() const { 93 const HashTable<ValueT> *Map; 98 template <typename ValueT> 108 using const_iterator = HashTableIterator<ValueT>; 144 const ValueT *Value; in load() 250 bool set_as(const Key &K, ValueT V, TraitsT &Traits) { in set_as() [all …]
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.hash/ |
| H A D | hash_unique_ptr.pass.cpp | 31 template <class ValueT, class Del> 33 using UPtr = std::unique_ptr<ValueT, Del>; in test_enabled_with_deleter() 42 template <class ValueT, class Del> 44 using UPtr = std::unique_ptr<ValueT, Del>; in test_disabled_with_deleter()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/ObjCARC/ |
| H A D | BlotMapVector.h | 22 template <class KeyT, class ValueT> class BlotMapVector { 28 using VectorTy = std::vector<std::pair<KeyT, ValueT>>; 55 ValueT &operator[](const KeyT &Arg) { 61 Vector.push_back(std::make_pair(Arg, ValueT())); 67 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert()
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | MachineInstrBundle.h | 93 template <typename ValueT> 95 : public iterator_facade_base<MIBundleOperandIteratorBase<ValueT>, 96 std::forward_iterator_tag, ValueT> { 145 ValueT &operator*() const { return *OpI; } 146 ValueT *operator->() const { return &*OpI; }
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | CostAllocator.h | 28 template <typename ValueT> class ValuePool { 30 using PoolRef = std::shared_ptr<const ValueT>; 41 const ValueT &getValue() const { return Value; } in getValue() 45 ValueT Value;
|
| /llvm-project-15.0.7/mlir/include/mlir/Analysis/ |
| H A D | DataFlowFramework.h | 111 template <typename ValueT> 112 explicit GenericProgramPointBase(ValueT &&value) in GenericProgramPointBase() 114 value(std::forward<ValueT>(value)) {} in GenericProgramPointBase() 124 template <typename ValueT> 126 ValueT &&value) { in construct() 128 ConcreteT(std::forward<ValueT>(value)); in construct()
|
| /llvm-project-15.0.7/mlir/include/mlir/TableGen/ |
| H A D | Class.h | 195 template <typename ValueT> 196 MethodBody &operator<<(ValueT &&value) { 198 os << std::forward<ValueT>(value); 386 template <typename NameT, typename ValueT> 387 void addMemberInitializer(NameT &&name, ValueT &&value) { in addMemberInitializer() 389 stringify(std::forward<ValueT>(value))); in addMemberInitializer() 483 template <typename NameT, typename ValueT = std::string> 484 UsingDeclaration(NameT &&name, ValueT &&value = "") 486 value(stringify(std::forward<ValueT>(value))) {} in name()
|
| /llvm-project-15.0.7/mlir/docs/Tutorials/ |
| H A D | DataFlowAnalysis.md | 152 /// `ValueT`. 153 template <typename ValueT> 158 ValueT &getValue(); 159 const ValueT &getValue() const; 163 ChangeResult join(const LatticeElement<ValueT> &rhs); 167 ChangeResult join(const ValueT &rhs); 190 template <typename ValueT> 202 LatticeElement<ValueT> &getLatticeElement(Value value); 206 LatticeElement<ValueT> *lookupLatticeElement(Value value); 221 Operation *op, ArrayRef<LatticeElement<ValueT> *> operands) = 0; [all …]
|
| /llvm-project-15.0.7/llvm/include/llvm/Support/ |
| H A D | YAMLParser.h | 327 template <class BaseT, class ValueT> class basic_collection_iterator { 330 using value_type = ValueT; 338 ValueT *operator->() const { 343 ValueT &operator*() const { 349 operator ValueT *() const {
|
| /llvm-project-15.0.7/llvm/include/llvm/ExecutionEngine/Orc/Shared/ |
| H A D | SimplePackedSerialization.h | 501 template <typename SPSValueT, typename ValueT> 503 StringMap<ValueT>> { 505 static size_t size(const StringMap<ValueT> &M) { in size() 512 static bool serialize(SPSOutputBuffer &OB, const StringMap<ValueT> &M) { in serialize() 523 static bool deserialize(SPSInputBuffer &IB, StringMap<ValueT> &M) { in deserialize() 532 ValueT V; in deserialize()
|