Home
last modified time | relevance | path

Searched refs:ValueT (Results 1 – 25 of 27) sorted by relevance

12

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDenseSet.h53 template <typename ValueT, typename MapTy, typename ValueInfoT>
55 static_assert(sizeof(typename MapTy::value_type) == sizeof(ValueT),
63 using key_type = ValueT;
64 using value_type = ValueT;
75 DenseSetImpl(std::initializer_list<ValueT> Elems) in DenseSetImpl()
97 size_type count(const_arg_type_t<ValueT> V) const { in count()
101 bool erase(const ValueT &V) { in erase()
118 using value_type = ValueT;
126 ValueT &operator*() { return I->getFirst(); }
127 const ValueT &operator*() const { return I->getFirst(); }
[all …]
H A DSparseSet.h38 /// directly compares ValueT, only their indices, so it can map keys to
54 /// For best results, ValueT should not require a destructor.
56 template<typename ValueT>
58 static unsigned getValIndex(const ValueT &Val) { in getValIndex()
64 /// generic implementation handles ValueT classes which either provide
67 template<typename KeyT, typename ValueT, typename KeyFunctorT>
69 unsigned operator()(const ValueT &Val) const { in operator()
70 return SparseSetValTraits<ValueT>::getValIndex(Val); in operator()
117 /// @tparam ValueT The type of objects in the set.
121 template<typename ValueT,
[all...]
H A DDenseMap.h41 template <typename KeyT, typename ValueT>
42 struct DenseMapPair : public std::pair<KeyT, ValueT> {
43 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()
47 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
48 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
53 template <typename KeyT, typename ValueT,
55 typename Bucket = llvm::detail::DenseMapPair<KeyT, ValueT>,
59 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
[all …]
H A DMapVector.h33 template <typename KeyT, typename ValueT,
35 typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
83 std::pair<KeyT, ValueT> &front() { return Vector.front(); } in front()
84 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } in front()
85 std::pair<KeyT, ValueT> &back() { return Vector.back(); } in back()
86 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } in back()
98 ValueT &operator[](const KeyT &Key) {
103 Vector.push_back(std::make_pair(Key, ValueT()));
109 // Returns a copy of the value. Only allowed if ValueT is copyable.
110 ValueT looku
[all...]
H A DSparseMultiSet.h83 template<typename ValueT,
99 ValueT Data;
103 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) {} in SMSNode()
126 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
134 unsigned sparseIndex(const ValueT &Val) const { in sparseIndex()
159 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { in addValue()
185 using value_type = ValueT;
186 using reference = ValueT &;
187 using const_reference = const ValueT &;
188 using pointer = ValueT *;
[all …]
H A DAllocatorList.h86 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 &;
H A DIntervalTree.h198 template <typename PointT, typename ValueT> class IntervalData {
201 using ValueType = ValueT;
246 template <typename PointT, typename ValueT,
247 typename DataT = IntervalData<PointT, ValueT>>
251 static_assert(ValueTypeIsValid<ValueT>::value,
256 using ValueType = ValueT;
H A DTypeSwitch.h65 template <typename CastT, typename ValueT>
66 static decltype(auto) castValue(ValueT &&value) { in decltype()
H A DHashing.h437 template <typename ValueT>
438 std::enable_if_t<is_hashable_data<ValueT>::value, hash_code>
439 hash_combine_range_impl(ValueT *first, ValueT *last) {
H A DSTLExtras.h1020 template <typename ValueT, typename... IterTs>
1022 : public iterator_facade_base<concat_iterator<ValueT, IterTs...>,
1023 std::forward_iterator_tag, ValueT> {
1068 template <size_t Index> ValueT *getHelper() const {
1081 template <size_t... Ns> ValueT &get(std::index_sequence<Ns...>) const {
1083 ValueT *(concat_iterator::*GetHelperFns[])() const = {
1088 if (ValueT *P = (this->*GetHelperFn)())
1110 ValueT &operator*() const {
1126 template <typename ValueT, typename... RangeTs> class concat_range {
1129 concat_iterator<ValueT,
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DValueMap.h45 template<typename KeyT, typename ValueT, typename Config>
83 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
85 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
87 using ValueMapCVH = ValueMapCallbackVH<KeyT, ValueT, Config>;
88 using MapT = DenseMap<ValueMapCVH, ValueT, DenseMapInfo<ValueMapCVH>>;
98 using mapped_type = ValueT;
99 using value_type = std::pair<KeyT, ValueT>;
164 ValueT lookup(const KeyT &Val) const { in lookup()
166 return I != Map.end() ? I->second : ValueT(); in lookup()
172 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { in insert()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_dense_map.h26 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
32 using mapped_type = ValueT;
51 if (__sanitizer::is_trivially_destructible<ValueT>::value) { in clear()
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()
215 ValueT &operator[](const KeyT &Key) { return FindAndConstruct(Key).second; }
225 ValueT &operator[](KeyT &&Key) {
[all …]
H A Dsanitizer_dense_map_info.h36 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()
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/
H A DHashTable.h31 template <typename ValueT> class HashTable;
33 template <typename ValueT>
35 : public iterator_facade_base<HashTableIterator<ValueT>,
37 const std::pair<uint32_t, ValueT>> {
39 friend HashTable<ValueT>;
41 HashTableIterator(const HashTable<ValueT> &Map, uint32_t Index, in HashTableIterator()
46 HashTableIterator(const HashTable<ValueT> &Map) : Map(&Map) { in HashTableIterator()
70 const std::pair<uint32_t, ValueT> &operator*() const {
93 const HashTable<ValueT> *Map;
98 template <typename ValueT>
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DBlotMapVector.h22 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()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineInstrBundle.h93 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; }
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DCostAllocator.h28 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;
/freebsd/contrib/llvm-project/llvm/include/llvm/Testing/ADT/
H A DStringMapEntry.h49 using ValueT = typename std::remove_reference_t<StringMapEntryT>::ValueType;
57 testing::SafeMatcherCast<const ValueT &>(ValueMatcherArg)) {}
96 const testing::Matcher<const ValueT &> ValueMatcher;
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DYAMLParser.h331 /// BaseT must have a ValueT* member named CurrentEntry and a member function
333 template <class BaseT, class ValueT> class basic_collection_iterator {
336 using value_type = ValueT;
344 ValueT *operator->() const {
349 ValueT &operator*() const {
355 operator ValueT *() const {
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/Shared/
H A DSimplePackedSerialization.h542 template <typename SPSValueT, typename ValueT>
544 StringMap<ValueT>> {
546 static size_t size(const StringMap<ValueT> &M) { in size()
553 static bool serialize(SPSOutputBuffer &OB, const StringMap<ValueT> &M) { in serialize()
564 static bool deserialize(SPSInputBuffer &IB, StringMap<ValueT> &M) { in deserialize()
573 ValueT V; in deserialize()
/freebsd/contrib/llvm-project/llvm/lib/TextAPI/
H A DTextStubV5.cpp779 template <typename ValueT, typename EntryT = ValueT>
780 Array serializeScalar(TBDKey Key, ValueT Value, ValueT Default = ValueT()) { in serializeScalar()
805 template <typename ValueT = std::string,
806 typename AggregateT = std::vector<std::pair<MachO::Target, ValueT>>>
809 std::map<ValueT, std::set<MachO::Target>> Entries; in serializeField()
/freebsd/contrib/llvm-project/clang/lib/AST/Interp/
H A DInterpBuiltin.cpp102 static void assignInteger(Pointer &Dest, PrimType ValueT, const APSInt &Value) { in assignInteger() argument
104 ValueT, { Dest.deref<T>() = T::from(static_cast<T>(Value)); }); in assignInteger()
579 PrimType ValueT = *S.getContext().classify(Call->getArg(0)->getType()); in interp__builtin_rotate() local
583 S.Stk, ValueT, align(primSize(AmountT)) + align(primSize(ValueT))); in interp__builtin_rotate()
/freebsd/contrib/llvm-project/clang/include/clang/ASTMatchers/
H A DASTMatchersInternal.h1725 template <typename T, typename ValueT>
1734 explicit ValueEqualsMatcher(const ValueT &ExpectedValue)
1742 ValueT ExpectedValue;
H A DASTMatchers.h5845 template <typename ValueT>
5847 void(internal::AllNodeBaseTypes), ValueT>
5848 equals(const ValueT &Value) { in equals()
5850 void(internal::AllNodeBaseTypes), ValueT>( in equals()
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaExprObjC.cpp1022 QualType ValueT = Method->parameters()[0]->getType(); in BuildObjCDictionaryLiteral() local
1023 const PointerType *PtrValue = ValueT->getAs<PointerType>(); in BuildObjCDictionaryLiteral()
1030 << 0 << ValueT in BuildObjCDictionaryLiteral()
1087 QualType ValueT = ValuesT->castAs<PointerType>()->getPointeeType(); in BuildObjCDictionaryLiteral() local
1103 CheckObjCCollectionLiteralElement(SemaRef, Element.Value, ValueT); in BuildObjCDictionaryLiteral()

12