Home
last modified time | relevance | path

Searched refs:Key (Results 1 – 25 of 778) sorted by relevance

12345678910>>...32

/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/
Dcontainer_base_dispatch.hpp113 template<typename Key, typename Mapped, typename Data_Structure_Taq,
117 template<typename Key, typename Mapped, typename Policy_Tl, typename Alloc>
118 struct container_base_dispatch<Key, Mapped, list_update_tag,
128 typedef lu_map_data_<Key, Mapped, at0t, Alloc, at1t> type;
131 template<typename Key, typename Policy_Tl, typename Alloc>
132 struct container_base_dispatch<Key, null_mapped_type, list_update_tag,
142 typedef lu_map_no_data_<Key, null_mapped_type, at0t, Alloc, at1t> type;
145 template<typename Key, typename Mapped, typename Policy_Tl, typename Alloc>
146 struct container_base_dispatch<Key, Mapped, pat_trie_tag, Policy_Tl, Alloc>
153 typedef pat_trie_data_<Key, Mapped, at1t, Alloc> type;
[all …]
Dbasic_types.hpp59 template<typename Key, typename Mapped, typename Allocator, bool Store_Hash>
66 template<typename Key, typename Mapped, typename Allocator>
67 struct value_type_base<Key, Mapped, Allocator, false>
76 …typedef typename Allocator::template rebind<std::pair<const Key, Mapped> >::other value_type_alloc…
93 template<typename Key, typename Mapped, typename Allocator>
94 struct value_type_base<Key, Mapped, Allocator, true>
103 …typedef typename Allocator::template rebind<std::pair<const Key, Mapped> >::other value_type_alloc…
118 template<typename Key, typename Allocator>
121 value_type_base<Key, null_mapped_type, Allocator, false>
127 template<typename Key, typename Allocator>
[all …]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Support/
DAMDGPUMetadata.cpp94 YIO.mapOptional(Kernel::Attrs::Key::ReqdWorkGroupSize, in mapping()
96 YIO.mapOptional(Kernel::Attrs::Key::WorkGroupSizeHint, in mapping()
98 YIO.mapOptional(Kernel::Attrs::Key::VecTypeHint, in mapping()
100 YIO.mapOptional(Kernel::Attrs::Key::RuntimeHandle, MD.mRuntimeHandle, in mapping()
108 YIO.mapOptional(Kernel::Arg::Key::Name, MD.mName, std::string()); in mapping()
109 YIO.mapOptional(Kernel::Arg::Key::TypeName, MD.mTypeName, std::string()); in mapping()
110 YIO.mapRequired(Kernel::Arg::Key::Size, MD.mSize); in mapping()
111 YIO.mapRequired(Kernel::Arg::Key::Align, MD.mAlign); in mapping()
112 YIO.mapRequired(Kernel::Arg::Key::ValueKind, MD.mValueKind); in mapping()
116 YIO.mapOptional(Kernel::Arg::Key::ValueType, Unused); in mapping()
[all …]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/IR/
DDiagnosticInfo.cpp162 DiagnosticInfoOptimizationBase::Argument::Argument(StringRef Key, in Argument() argument
164 : Key(std::string(Key)) { in Argument()
183 DiagnosticInfoOptimizationBase::Argument::Argument(StringRef Key, const Type *T) in Argument() argument
184 : Key(std::string(Key)) { in Argument()
189 DiagnosticInfoOptimizationBase::Argument::Argument(StringRef Key, StringRef S) in Argument() argument
190 : Key(std::string(Key)), Val(S.str()) {} in Argument()
192 DiagnosticInfoOptimizationBase::Argument::Argument(StringRef Key, int N) in Argument() argument
193 : Key(std::string(Key)), Val(itostr(N)) {} in Argument()
195 DiagnosticInfoOptimizationBase::Argument::Argument(StringRef Key, float N) in Argument() argument
196 : Key(std::string(Key)), Val(llvm::to_string(N)) {} in Argument()
[all …]
DProfileSummary.cpp27 static Metadata *getKeyValMD(LLVMContext &Context, const char *Key, in getKeyValMD() argument
30 Metadata *Ops[2] = {MDString::get(Context, Key), in getKeyValMD()
35 static Metadata *getKeyFPValMD(LLVMContext &Context, const char *Key, in getKeyFPValMD() argument
38 Metadata *Ops[2] = {MDString::get(Context, Key), in getKeyFPValMD()
45 static Metadata *getKeyValMD(LLVMContext &Context, const char *Key, in getKeyValMD() argument
47 Metadata *Ops[2] = {MDString::get(Context, Key), MDString::get(Context, Val)}; in getKeyValMD()
105 static ConstantAsMetadata *getValMD(MDTuple *MD, const char *Key) { in getValMD() argument
114 if (!KeyMD->getString().equals(Key)) in getValMD()
120 static bool getVal(MDTuple *MD, const char *Key, uint64_t &Val) { in getVal() argument
121 if (auto *ValMD = getValMD(MD, Key)) { in getVal()
[all …]
/freebsd-12-stable/usr.sbin/ctm/ctm/
Dctm_pass2.c71 for(sp=Syntax;sp->Key;sp++) in Pass2()
72 if(!strcmp(p+3,sp->Key)) in Pass2()
88 (!strcmp(sp->Key,"FR") || !strcmp(sp->Key,"DR"))) { in Pass2()
106 sp->Key,name); in Pass2()
113 sp->Key,name); in Pass2()
114 if (sp->Key[1] == 'R') in Pass2()
123 sp->Key,name); in Pass2()
130 sp->Key,name); in Pass2()
139 sp->Key,name); in Pass2()
159 sp->Key,name); in Pass2()
[all …]
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/Basic/
DTypeTraits.h22 #define TYPE_TRAIT_1(Spelling, Name, Key) UTT_##Name, argument
25 #define TYPE_TRAIT_1(Spelling, Name, Key) +1 argument
28 #define TYPE_TRAIT_2(Spelling, Name, Key) BTT_##Name, argument
31 #define TYPE_TRAIT_2(Spelling, Name, Key) +1 argument
34 #define TYPE_TRAIT_N(Spelling, Name, Key) TT_##Name, argument
37 #define TYPE_TRAIT_N(Spelling, Name, Key) +1 argument
43 #define ARRAY_TYPE_TRAIT(Spelling, Name, Key) ATT_##Name, argument
46 #define ARRAY_TYPE_TRAIT(Spelling, Name, Key) +1 argument
52 #define UNARY_EXPR_OR_TYPE_TRAIT(Spelling, Name, Key) UETT_##Name, argument
53 #define CXX11_UNARY_EXPR_OR_TYPE_TRAIT(Spelling, Name, Key) UETT_##Name, argument
[all …]
/freebsd-12-stable/contrib/llvm-project/clang/lib/Basic/
DTypeTraits.cpp19 #define TYPE_TRAIT_1(Spelling, Name, Key) #Name, argument
21 #define TYPE_TRAIT_2(Spelling, Name, Key) #Name, argument
23 #define TYPE_TRAIT_N(Spelling, Name, Key) #Name, argument
28 #define TYPE_TRAIT_1(Spelling, Name, Key) #Spelling, argument
30 #define TYPE_TRAIT_2(Spelling, Name, Key) #Spelling, argument
32 #define TYPE_TRAIT_N(Spelling, Name, Key) #Spelling, argument
37 #define ARRAY_TYPE_TRAIT(Spelling, Name, Key) #Name, argument
42 #define ARRAY_TYPE_TRAIT(Spelling, Name, Key) #Spelling, argument
47 #define UNARY_EXPR_OR_TYPE_TRAIT(Spelling, Name, Key) #Name, argument
48 #define CXX11_UNARY_EXPR_OR_TYPE_TRAIT(Spelling, Name, Key) #Name, argument
[all …]
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/
Dtraits.hpp57 template<typename Key,
67 Key,
73 Key,
79 Key,
84 Key,
93 template<typename Key,
101 struct tree_traits<Key, null_mapped_type, Cmp_Fn, Node_Update,
103 : public bin_search_tree_traits<Key, null_mapped_type, Cmp_Fn,
105 splay_tree_node_<typename types_traits<Key, null_mapped_type, Allocator, false>::value_type,
107 Key,
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/
Dtraits.hpp56 template<typename Key,
66 Key,
72 Key,
78 Key,
83 Key,
92 template<typename Key,
101 Key,
107 Key,
113 Key,
118 Key,
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/hash_fn/
Dranged_hash_fn.hpp59 template<typename Key, typename Hash_Fn, typename Allocator,
64 template<typename Key, typename Hash_Fn, typename Allocator, \
68 ranged_hash_fn<Key, Hash_Fn, Allocator, Comb_Hash_Fn, false>
75 template<typename Key, typename Hash_Fn, typename Allocator,
77 class ranged_hash_fn< Key, Hash_Fn, Allocator, Comb_Hash_Fn, false>
84 typedef typename Allocator::template rebind< Key>::other key_allocator;
146 template<typename Key, typename Hash_Fn, typename Allocator, \
150 ranged_hash_fn<Key,Hash_Fn, Allocator, Comb_Hash_Fn, true>
157 template<typename Key, typename Hash_Fn, typename Allocator,
159 class ranged_hash_fn<Key, Hash_Fn, Allocator, Comb_Hash_Fn, true>
[all …]
Dranged_probe_fn.hpp59 template<typename Key, typename Hash_Fn, typename Allocator,
64 template<typename Key, typename Hash_Fn, typename Allocator, \
68 ranged_probe_fn<Key, Hash_Fn, Allocator, Comb_Probe_Fn, Probe_Fn, false>
75 template<typename Key, typename Hash_Fn, typename Allocator,
77 class ranged_probe_fn<Key, Hash_Fn, Allocator, Comb_Probe_Fn,
86 typedef typename Allocator::template rebind<Key>::other key_allocator;
170 template<typename Key, typename Hash_Fn, typename Allocator, \
174 ranged_probe_fn<Key, Hash_Fn, Allocator, Comb_Probe_Fn, Probe_Fn, true>
180 template<typename Key, typename Hash_Fn, typename Allocator,
182 class ranged_probe_fn<Key, Hash_Fn, Allocator, Comb_Probe_Fn,
[all …]
/freebsd-12-stable/contrib/llvm-project/clang/lib/Lex/
DHeaderMap.cpp134 Result.Key = HMAP_EmptyBucketKey; in getBucket()
142 Result.Key = getEndianAdjustedWord(BucketPtr->Key); in getBucket()
187 if (B.Key == HMAP_EmptyBucketKey) continue; in dump()
189 StringRef Key = getStringOrInvalid(B.Key); in dump() local
192 llvm::dbgs() << " " << i << ". " << Key << " -> '" << Prefix << "' '" in dump()
221 if (B.Key == HMAP_EmptyBucketKey) return StringRef(); // Hash miss. in lookupFilename()
224 Optional<StringRef> Key = getString(B.Key); in lookupFilename() local
225 if (LLVM_UNLIKELY(!Key)) in lookupFilename()
227 if (!Filename.equals_insensitive(*Key)) in lookupFilename()
253 if (B.Key == HMAP_EmptyBucketKey) in reverseLookupFilename()
[all …]
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/ADT/
DSparseSet.h77 unsigned operator()(const KeyT &Key) const {
78 return KeyFunctorT()(Key);
224 iterator find(const KeyT &Key) {
225 return findIndex(KeyIndexOf(Key));
228 const_iterator find(const KeyT &Key) const {
229 return const_cast<SparseSet*>(this)->findIndex(KeyIndexOf(Key));
235 bool contains(const KeyT &Key) const { return find(Key) == end() ? 0 : 1; }
240 size_type count(const KeyT &Key) const { return contains(Key) ? 1 : 0; }
265 ValueT &operator[](const KeyT &Key) {
266 return *insert(ValueT(Key)).first;
[all …]
DStringMap.h61 unsigned LookupBucketFor(StringRef Key);
66 int FindKey(StringRef Key) const;
74 StringMapEntryBase *RemoveKey(StringRef Key);
218 iterator find(StringRef Key) { in find() argument
219 int Bucket = FindKey(Key); in find()
225 const_iterator find(StringRef Key) const { in find() argument
226 int Bucket = FindKey(Key); in find()
234 ValueTy lookup(StringRef Key) const { in lookup() argument
235 const_iterator it = find(Key); in lookup()
243 ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; }
[all …]
DScopedHashTable.h49 K Key; variable
52 ScopedHashTableVal(const K &key, const V &val) : Key(key), Val(val) {} in ScopedHashTableVal()
55 const K &getKey() const { return Key; } in getKey()
182 size_type count(const K &Key) const { in count() argument
183 return TopLevelMap.count(Key); in count()
186 V lookup(const K &Key) const { in lookup() argument
187 auto I = TopLevelMap.find(Key); in lookup()
194 void insert(const K &Key, const V &Val) { in insert() argument
195 insertIntoScope(CurScope, Key, Val); in insert()
202 iterator begin(const K &Key) { in begin() argument
[all …]
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/eq_fn/
Dhash_eq_fn.hpp58 template<typename Key, class Eq_Fn, class Allocator, bool Store_Hash>
62 template<typename Key, class Eq_Fn, class Allocator>
65 hash_eq_fn<Key, Eq_Fn, Allocator, false>
70 template<typename Key, class Eq_Fn, class Allocator>
71 struct hash_eq_fn<Key, Eq_Fn, Allocator, false> : public Eq_Fn
75 typedef typename Allocator::template rebind<Key>::other key_allocator;
117 template<typename Key, class Eq_Fn, class Allocator>
120 hash_eq_fn<Key, Eq_Fn, Allocator, true>
125 template<typename Key, class Eq_Fn, class Allocator>
126 struct hash_eq_fn<Key, Eq_Fn, Allocator, true> :
[all …]
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/
Dassoc_container.hpp59 detail::container_base_dispatch<Key, Mapped, Tag, Policy_Tl, Allocator>::type
62 template<typename Key,
79 typedef typename allocator::template rebind<Key>::other::value_type key_type;
121 container_base<Key, Mapped, Tag, typename __gnu_cxx::typelist::append< \
125 template<typename Key,
157 basic_hash_table<Key, Mapped, Hash_Fn, Eq_Fn, Resize_Policy, Store_Hash, \
162 template<typename Key,
164 typename Hash_Fn = typename detail::default_hash_fn<Key>::type,
165 typename Eq_Fn = typename detail::default_eq_fn<Key>::type,
294 basic_hash_table<Key, Mapped, Hash_Fn, Eq_Fn, Resize_Policy, Store_Hash, \
[all …]
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/Utils/
DAMDGPUPALMetadata.cpp59 auto Key = mdconst::dyn_extract<ConstantInt>(Tuple->getOperand(I)); in readFromIR() local
61 if (!Key || !Val) in readFromIR()
63 setRegister(Key->getZExtValue(), Val->getZExtValue()); in readFromIR()
120 return PALMD::Key::PS_SCRATCH_SIZE; in getScratchSizeKey()
122 return PALMD::Key::VS_SCRATCH_SIZE; in getScratchSizeKey()
124 return PALMD::Key::GS_SCRATCH_SIZE; in getScratchSizeKey()
126 return PALMD::Key::ES_SCRATCH_SIZE; in getScratchSizeKey()
128 return PALMD::Key::HS_SCRATCH_SIZE; in getScratchSizeKey()
130 return PALMD::Key::LS_SCRATCH_SIZE; in getScratchSizeKey()
132 return PALMD::Key::CS_SCRATCH_SIZE; in getScratchSizeKey()
[all …]
/freebsd-12-stable/contrib/llvm-project/libcxx/include/experimental/
Dunordered_map21 template <class Key, class T,
22 class Hash = hash<Key>,
23 class Pred = equal_to<Key>>
25 std::unordered_map<Key, T, Hash, Pred,
26 polymorphic_allocator<pair<const Key,T>>>;
28 template <class Key, class T,
29 class Hash = hash<Key>,
30 class Pred = equal_to<Key>>
32 std::unordered_multimap<Key, T, Hash, Pred,
33 polymorphic_allocator<pair<const Key,T>>>;
Dset21 template <class Key, class T, class Compare = less<Key>>
22 using set = std::set<Key, T, Compare,
23 polymorphic_allocator<pair<const Key,T>>>;
25 template <class Key, class T, class Compare = less<Key>>
26 using multiset = std::multiset<Key, T, Compare,
27 polymorphic_allocator<pair<const Key,T>>>;
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
DSparsePropagation.h66 virtual bool IsUntrackedValue(LatticeKey Key) { return false; } in IsUntrackedValue() argument
70 virtual LatticeVal ComputeLatticeVal(LatticeKey Key) { in ComputeLatticeVal() argument
97 virtual void PrintLatticeKey(LatticeKey Key, raw_ostream &OS);
150 LatticeVal getExistingValueState(LatticeKey Key) const { in getExistingValueState() argument
151 auto I = ValueState.find(Key); in getExistingValueState()
158 LatticeVal getValueState(LatticeKey Key);
183 void UpdateState(LatticeKey Key, LatticeVal LV);
218 LatticeKey Key, raw_ostream &OS) { in PrintLatticeKey() argument
228 SparseSolver<LatticeKey, LatticeVal, KeyInfo>::getValueState(LatticeKey Key) { in getValueState() argument
229 auto I = ValueState.find(Key); in getValueState()
[all …]
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/
Dtraits.hpp57 template<typename Key,
67 Key,
77 Key,
86 Key,
124 template<typename Key,
133 Key,
143 Key,
152 Key,
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DProgramStateTrait.h70 #define CLANG_ENTO_PROGRAMSTATE_MAP(Key, Value) llvm::ImmutableMap<Key, Value> argument
84 #define REGISTER_MAP_WITH_PROGRAMSTATE(Name, Key, Value) \ argument
86 CLANG_ENTO_PROGRAMSTATE_MAP(Key, Value))
92 #define REGISTER_MAP_FACTORY_WITH_PROGRAMSTATE(Name, Key, Value) \ argument
93 using Name = llvm::ImmutableMap<Key, Value>; \
145 template <typename Key, typename Data, typename Info>
146 struct ProgramStatePartialTrait<llvm::ImmutableMap<Key, Data, Info>> {
147 using data_type = llvm::ImmutableMap<Key, Data, Info>;
149 using key_type = Key;
193 template <typename Key, typename Info>
[all …]
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Support/
DOnDiskHashTable.h63 typename Info::key_type Key;
68 Item(typename Info::key_type_ref Key, typename Info::data_type_ref Data, in Item() argument
70 : Key(Key), Data(Data), Next(nullptr), Hash(InfoObj.ComputeHash(Key)) {} in Item()
116 void insert(typename Info::key_type_ref Key, in insert() argument
119 insert(Key, Data, InfoObj); in insert()
125 void insert(typename Info::key_type_ref Key, in insert() argument
130 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj)); in insert()
134 bool contains(typename Info::key_type_ref Key, Info &InfoObj) { in contains() argument
135 unsigned Hash = InfoObj.ComputeHash(Key); in contains()
137 if (I->Hash == Hash && InfoObj.EqualKey(I->Key, Key)) in contains()
[all …]

12345678910>>...32