Home
last modified time | relevance | path

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

12345678910>>...20

/freebsd-12.1/contrib/libstdc++/include/ext/pb_ds/detail/
H A Dcontainer_base_dispatch.hpp118 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>
153 typedef pat_trie_data_<Key, Mapped, at1t, Alloc> type;
156 template<typename Key, typename Policy_Tl, typename Alloc>
181 template<typename Key, typename Policy_Tl, typename Alloc>
196 struct container_base_dispatch<Key, Mapped, splay_tree_tag,
209 template<typename Key, typename Policy_Tl, typename Alloc>
236 template<typename Key, typename Policy_Tl, typename Alloc>
270 template<typename Key, typename Policy_Tl, typename Alloc>
[all …]
H A Dbasic_types.hpp67 struct value_type_base<Key, Mapped, Allocator, false>
94 struct value_type_base<Key, Mapped, Allocator, true>
118 template<typename Key, typename Allocator>
127 template<typename Key, typename Allocator>
137 typedef Key value_type;
160 template<typename Key, typename Allocator>
169 template<typename Key, typename Allocator>
179 typedef Key value_type;
202 template<typename Key, typename Mapped>
208 template<typename Key>
[all …]
/freebsd-12.1/contrib/llvm/lib/Support/
H A DAMDGPUMetadata.cpp93 YIO.mapOptional(Kernel::Attrs::Key::ReqdWorkGroupSize, in mapping()
97 YIO.mapOptional(Kernel::Attrs::Key::VecTypeHint, in mapping()
109 YIO.mapRequired(Kernel::Arg::Key::Size, MD.mSize); in mapping()
110 YIO.mapRequired(Kernel::Arg::Key::Align, MD.mAlign); in mapping()
141 YIO.mapOptional(Kernel::CodeProps::Key::NumSGPRs, in mapping()
143 YIO.mapOptional(Kernel::CodeProps::Key::NumVGPRs, in mapping()
177 YIO.mapRequired(Kernel::Key::Name, MD.mName); in mapping()
183 YIO.mapOptional(Kernel::Key::Attrs, MD.mAttrs); in mapping()
185 YIO.mapOptional(Kernel::Key::Args, MD.mArgs); in mapping()
196 YIO.mapRequired(Key::Version, MD.mVersion); in mapping()
[all …]
/freebsd-12.1/usr.sbin/ctm/ctm/
H A Dctm_pass2.c88 (!strcmp(sp->Key,"FR") || !strcmp(sp->Key,"DR"))) { in Pass2()
106 sp->Key,name); in Pass2()
123 sp->Key,name); in Pass2()
130 sp->Key,name); in Pass2()
197 sp->Key); in Pass2()
205 sp->Key); in Pass2()
211 sp->Key); in Pass2()
218 sp->Key); in Pass2()
245 sp->Key); in Pass2()
251 sp->Key); in Pass2()
[all …]
H A Dctm_pass3.c128 for(sp=Syntax;sp->Key;sp++) in Pass3()
129 if(!strcmp(p+3,sp->Key)) in Pass3()
180 if(!strcmp(sp->Key,"FM") || !strcmp(sp->Key, "FS")) { in Pass3()
193 sp->Key,name); in Pass3()
199 if(!strcmp(sp->Key,"FE")) { in Pass3()
217 sp->Key,name); in Pass3()
223 if(!strcmp(sp->Key,"FN")) { in Pass3()
229 sp->Key,name,i); in Pass3()
234 sp->Key,name); in Pass3()
242 if(!strcmp(sp->Key,"DM")) { in Pass3()
[all …]
/freebsd-12.1/contrib/llvm/lib/IR/
H A DDiagnosticInfo.cpp165 : Key(Key) { in Argument()
185 : Key(Key) { in Argument()
191 : Key(Key), Val(S.str()) {} in Argument()
194 : Key(Key), Val(itostr(N)) {} in Argument()
197 : Key(Key), Val(llvm::to_string(N)) {} in Argument()
200 : Key(Key), Val(itostr(N)) {} in Argument()
203 : Key(Key), Val(itostr(N)) {} in Argument()
206 : Key(Key), Val(utostr(N)) {} in Argument()
210 : Key(Key), Val(utostr(N)) {} in Argument()
214 : Key(Key), Val(utostr(N)) {} in Argument()
[all …]
/freebsd-12.1/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/
H A 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.1/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/
H A 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.1/contrib/libstdc++/include/ext/pb_ds/detail/hash_fn/
H A 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,
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,
249 template<typename Key, typename Allocator, typename Comb_Hash_Fn>
252 ranged_hash_fn<Key, null_hash_fn, Allocator, Comb_Hash_Fn, false>
260 template<typename Key, typename Allocator, typename Comb_Hash_Fn>
[all …]
H A 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, \
180 template<typename Key, typename Hash_Fn, typename Allocator,
182 class ranged_probe_fn<Key, Hash_Fn, Allocator, Comb_Probe_Fn,
301 template<typename Key, typename Allocator, typename Comb_Probe_Fn>
[all …]
/freebsd-12.1/contrib/libstdc++/include/ext/pb_ds/detail/eq_fn/
H A 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.1/contrib/compiler-rt/lib/esan/
H A Desan_hashtable.h27 size_t operator()(const T &Key) const { in operator()
28 return (size_t)Key; in operator()
64 bool remove(const KeyTy &Key);
75 KeyTy Key; member
82 HashPair(KeyTy Key, DataTy Data) : Key(Key), Data(Data) {} in HashPair()
83 KeyTy Key; member
183 if (EqualFunc(Entry->Key, Key)) { in lookup()
227 if (EqualFunc(Entry->Key, Key)) { in add()
239 Add->Key = Key; in add()
252 const KeyTy &Key) { in remove() argument
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DStringMap.h87 int FindKey(StringRef Key) const;
158 size_t KeyLength = Key.size(); in Create()
188 return Create(Key, ValueTy()); in Create()
333 iterator find(StringRef Key) { in find() argument
334 int Bucket = FindKey(Key); in find()
340 int Bucket = FindKey(Key); in find()
356 ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; }
442 bool erase(StringRef Key) { in erase() argument
443 iterator I = find(Key); in erase()
547 return Key;
[all …]
H A DSparseSet.h78 unsigned operator()(const KeyT &Key) const {
79 return KeyFunctorT()(Key);
225 iterator find(const KeyT &Key) {
226 return findIndex(KeyIndexOf(Key));
229 const_iterator find(const KeyT &Key) const {
236 size_type count(const KeyT &Key) const {
237 return find(Key) == end() ? 0 : 1;
263 ValueT &operator[](const KeyT &Key) {
264 return *insert(ValueT(Key)).first;
305 bool erase(const KeyT &Key) {
[all …]
H A DScopedHashTable.h50 K Key; variable
56 const K &getKey() const { return Key; } in getKey()
183 size_type count(const K &Key) const { in count() argument
184 return TopLevelMap.count(Key); in count()
187 V lookup(const K &Key) const { in lookup() argument
188 auto I = TopLevelMap.find(Key); in lookup()
195 void insert(const K &Key, const V &Val) { in insert() argument
196 insertIntoScope(CurScope, Key, Val); in insert()
203 iterator begin(const K &Key) { in begin() argument
205 TopLevelMap.find(Key); in begin()
[all …]
/freebsd-12.1/contrib/libstdc++/include/ext/pb_ds/
H A Dassoc_container.hpp62 template<typename Key,
125 template<typename Key,
162 template<typename Key,
299 template<typename Key,
462 container_base<Key, Mapped, Tag, Policy_Tl, Allocator>
465 template<typename Key, typename Mapped, typename Tag,
495 template<typename Key, typename Mapped, typename Cmp_Fn = std::less<Key>,
566 template<typename Key,
635 container_base<Key, Mapped, list_update_tag, \
639 template<typename Key,
[all …]
/freebsd-12.1/contrib/libc++/include/experimental/
H A Dunordered_map22 template <class Key, class T,
23 class Hash = hash<Key>,
24 class Pred = equal_to<Key>>
26 std::unordered_map<Key, T, Hash, Pred,
27 polymorphic_allocator<pair<const Key,T>>>;
29 template <class Key, class T,
30 class Hash = hash<Key>,
31 class Pred = equal_to<Key>>
33 std::unordered_multimap<Key, T, Hash, Pred,
34 polymorphic_allocator<pair<const Key,T>>>;
H A Dset22 template <class Key, class T, class Compare = less<Key>>
23 using set = std::set<Key, T, Compare,
24 polymorphic_allocator<pair<const Key,T>>>;
26 template <class Key, class T, class Compare = less<Key>>
27 using multiset = std::multiset<Key, T, Compare,
28 polymorphic_allocator<pair<const Key,T>>>;
H A Dmap22 template <class Key, class T, class Compare = less<Key>>
23 using map = std::map<Key, T, Compare,
24 polymorphic_allocator<pair<const Key,T>>>;
26 template <class Key, class T, class Compare = less<Key>>
27 using multimap = std::multimap<Key, T, Compare,
28 polymorphic_allocator<pair<const Key,T>>>;
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DSparsePropagation.h152 auto I = ValueState.find(Key); in getExistingValueState()
219 LatticeKey Key, raw_ostream &OS) { in PrintLatticeKey() argument
230 auto I = ValueState.find(Key); in getValueState()
234 if (LatticeFunc->IsUntrackedValue(Key)) in getValueState()
247 auto I = ValueState.find(Key); in UpdateState()
253 ValueState[Key] = std::move(LV); in UpdateState()
417 LatticeVal PNIV = getValueState(Key); in visitPHINode()
427 UpdateState(Key, Overdefined); in visitPHINode()
450 UpdateState(Key, PNIV); in visitPHINode()
512 LatticeKey Key; in Print() local
[all …]
/freebsd-12.1/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/
H A Dtraits.hpp57 template<typename Key,
67 Key,
77 Key,
86 Key,
124 template<typename Key,
133 Key,
143 Key,
152 Key,
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DProgramStateTrait.h71 #define CLANG_ENTO_PROGRAMSTATE_MAP(Key, Value) llvm::ImmutableMap<Key, Value> argument
85 #define REGISTER_MAP_WITH_PROGRAMSTATE(Name, Key, Value) \ argument
93 #define REGISTER_MAP_FACTORY_WITH_PROGRAMSTATE(Name, Key, Value) \ argument
94 using Name = llvm::ImmutableMap<Key, Value>; \
146 template <typename Key, typename Data, typename Info>
148 using data_type = llvm::ImmutableMap<Key, Data, Info>;
150 using key_type = Key;
194 template <typename Key, typename Info>
195 struct ProgramStatePartialTrait<llvm::ImmutableSet<Key, Info>> {
196 using data_type = llvm::ImmutableSet<Key, Info>;
[all …]
/freebsd-12.1/contrib/llvm/tools/clang/lib/Lex/
H A DHeaderMap.cpp135 Result.Key = HMAP_EmptyBucketKey; in getBucket()
143 Result.Key = getEndianAdjustedWord(BucketPtr->Key); in getBucket()
188 if (B.Key == HMAP_EmptyBucketKey) continue; in dump()
190 StringRef Key = getStringOrInvalid(B.Key); in dump() local
193 llvm::dbgs() << " " << i << ". " << Key << " -> '" << Prefix << "' '" in dump()
222 if (B.Key == HMAP_EmptyBucketKey) return StringRef(); // Hash miss. in lookupFilename()
225 Optional<StringRef> Key = getString(B.Key); in lookupFilename() local
226 if (LLVM_UNLIKELY(!Key)) in lookupFilename()
228 if (!Filename.equals_lower(*Key)) in lookupFilename()
/freebsd-12.1/contrib/llvm/include/llvm/Support/
H A DOnDiskHashTable.h63 typename Info::key_type Key;
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
135 unsigned Hash = InfoObj.ComputeHash(Key); in contains()
137 if (I->Hash == Hash && InfoObj.EqualKey(I->Key, Key)) in contains()
191 InfoObj.EmitKey(Out, I->Key, Len.first); in Emit()
197 InfoObj.EmitKey(Out, I->Key, Len.first); in Emit()
322 internal_key_type Key; variable
[all …]
/freebsd-12.1/crypto/heimdal/lib/hdb/
H A Dhdb-protos.h96 Key **/*key*/);
200 hdb_free_key (Key */*key*/);
206 Key */*keys*/);
217 Key **/*ret_key_set*/,
226 Key **/*keys*/,
290 Key **/*key*/);
329 Key */*k*/);
334 Key */*k*/,
374 Key */*k*/);
379 Key */*k*/,

12345678910>>...20