Home
last modified time | relevance | path

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

12345678910>>...43

/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DAMDGPUMetadata.cpp95 YIO.mapOptional(Kernel::Attrs::Key::ReqdWorkGroupSize, in mapping()
97 YIO.mapOptional(Kernel::Attrs::Key::WorkGroupSizeHint, in mapping()
99 YIO.mapOptional(Kernel::Attrs::Key::VecTypeHint, in mapping()
101 YIO.mapOptional(Kernel::Attrs::Key::RuntimeHandle, MD.mRuntimeHandle, in mapping()
109 YIO.mapOptional(Kernel::Arg::Key::Name, MD.mName, std::string()); in mapping()
110 YIO.mapOptional(Kernel::Arg::Key::TypeName, MD.mTypeName, std::string()); in mapping()
111 YIO.mapRequired(Kernel::Arg::Key::Size, MD.mSize); in mapping()
112 YIO.mapRequired(Kernel::Arg::Key::Align, MD.mAlign); in mapping()
113 YIO.mapRequired(Kernel::Arg::Key::ValueKind, MD.mValueKind); in mapping()
117 YIO.mapOptional(Kernel::Arg::Key::ValueType, Unused); in mapping()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Basic/
H A 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/contrib/llvm-project/clang/include/clang/Basic/
H A 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/contrib/llvm-project/llvm/include/llvm/ADT/
H A DStringMap.h65 unsigned LookupBucketFor(StringRef Key) { in LookupBucketFor() argument
66 return LookupBucketFor(Key, hash(Key)); in LookupBucketFor()
70 LLVM_ABI unsigned LookupBucketFor(StringRef Key, uint32_t FullHashValue);
75 int FindKey(StringRef Key) const { return FindKey(Key, hash(Key)); } in FindKey() argument
78 LLVM_ABI int FindKey(StringRef Key, uint32_t FullHashValue) const;
86 LLVM_ABI StringMapEntryBase *RemoveKey(StringRef Key);
112 LLVM_ABI static uint32_t hash(StringRef Key);
234 iterator find(StringRef Key) { return find(Key, hash(Key)); } in find() argument
236 iterator find(StringRef Key, uint32_t FullHashValue) { in find() argument
237 int Bucket = FindKey(Key, FullHashValue); in find()
[all …]
H A DMapVector.h101 ValueT &operator[](const KeyT &Key) {
102 std::pair<typename MapType::iterator, bool> Result = Map.try_emplace(Key);
105 Vector.push_back(std::make_pair(Key, ValueT()));
112 ValueT lookup(const KeyT &Key) const { in lookup() argument
115 typename MapType::const_iterator Pos = Map.find(Key); in lookup()
120 std::pair<iterator, bool> try_emplace(const KeyT &Key, Ts &&...Args) { in try_emplace() argument
121 auto [It, Inserted] = Map.try_emplace(Key); in try_emplace()
124 Vector.emplace_back(std::piecewise_construct, std::forward_as_tuple(Key), in try_emplace()
131 std::pair<iterator, bool> try_emplace(KeyT &&Key, Ts &&...Args) { in try_emplace() argument
132 auto [It, Inserted] = Map.try_emplace(Key); in try_emplace()
[all …]
H A DSparseSet.h78 unsigned operator()(const KeyT &Key) const {
79 return KeyFunctorT()(Key);
229 iterator find(const KeyT &Key) {
230 return findIndex(KeyIndexOf(Key));
233 const_iterator find(const KeyT &Key) const {
234 return const_cast<SparseSet*>(this)->findIndex(KeyIndexOf(Key));
240 bool contains(const KeyT &Key) const { return find(Key) != end(); }
245 size_type count(const KeyT &Key) const { return contains(Key) ? 1 : 0; }
270 ValueT &operator[](const KeyT &Key) {
271 return *insert(ValueT(Key)).first;
[all …]
H A 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()
181 size_type count(const K &Key) const { in count() argument
182 return TopLevelMap.count(Key); in count()
185 V lookup(const K &Key) const { in lookup() argument
186 auto I = TopLevelMap.find(Key); in lookup()
193 void insert(const K &Key, const V &Val) { in insert() argument
194 insertIntoScope(CurScope, Key, Val); in insert()
201 iterator begin(const K &Key) { in begin() argument
[all …]
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DDiagnosticInfo.cpp198 DiagnosticInfoOptimizationBase::Argument::Argument(StringRef Key, in Argument() argument
200 : Key(std::string(Key)) { in Argument()
226 DiagnosticInfoOptimizationBase::Argument::Argument(StringRef Key, const Type *T) in Argument() argument
227 : Key(std::string(Key)) { in Argument()
232 DiagnosticInfoOptimizationBase::Argument::Argument(StringRef Key, StringRef S) in Argument() argument
233 : Key(std::string(Key)), Val(S.str()) {} in Argument()
235 DiagnosticInfoOptimizationBase::Argument::Argument(StringRef Key, int N) in Argument() argument
236 : Key(std::string(Key)), Val(itostr(N)) {} in Argument()
238 DiagnosticInfoOptimizationBase::Argument::Argument(StringRef Key, float N) in Argument() argument
239 : Key(std::string(Key)), Val(llvm::to_string(N)) {} in Argument()
[all …]
H A DProfileSummary.cpp26 static Metadata *getKeyValMD(LLVMContext &Context, const char *Key, in getKeyValMD() argument
29 Metadata *Ops[2] = {MDString::get(Context, Key), in getKeyValMD()
34 static Metadata *getKeyFPValMD(LLVMContext &Context, const char *Key, in getKeyFPValMD() argument
37 Metadata *Ops[2] = {MDString::get(Context, Key), in getKeyFPValMD()
44 static Metadata *getKeyValMD(LLVMContext &Context, const char *Key, in getKeyValMD() argument
46 Metadata *Ops[2] = {MDString::get(Context, Key), MDString::get(Context, Val)}; in getKeyValMD()
104 static ConstantAsMetadata *getValMD(MDTuple *MD, const char *Key) { in getValMD() argument
113 if (KeyMD->getString() != Key) in getValMD()
119 static bool getVal(MDTuple *MD, const char *Key, uint64_t &Val) { in getVal() argument
120 if (auto *ValMD = getValMD(MD, Key)) { in getVal()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
H A Dflat_set21 template<class Key, class Compare = less<Key>, class KeyContainer = vector<Key>>
27 template<class Key, class Compare, class KeyContainer, class Allocator>
28 struct uses_allocator<flat_set<Key, Compare, KeyContainer>, Allocator>;
31 template<class Key, class Compare, class KeyContainer, class Predicate>
32 typename flat_set<Key, Compare, KeyContainer>::size_type
33 erase_if(flat_set<Key, Compare, KeyContainer>& c, Predicate pred);
36 template<class Key, class Compare = less<Key>, class KeyContainer = vector<Key>>
42 template<class Key, class Compare, class KeyContainer, class Allocator>
43 struct uses_allocator<flat_multiset<Key, Compare, KeyContainer>, Allocator>;
46 template<class Key, class Compare, class KeyContainer, class Predicate>
[all …]
H A Dflat_map21 template<class Key, class T, class Compare = less<Key>,
22 class KeyContainer = vector<Key>, class MappedContainer = vector<T>>
28 template<class Key, class T, class Compare, class KeyContainer, class MappedContainer,
30 struct uses_allocator<flat_map<Key, T, Compare, KeyContainer, MappedContainer>,
34 template<class Key, class T, class Compare, class KeyContainer, class MappedContainer,
36 typename flat_map<Key, T, Compare, KeyContainer, MappedContainer>::size_type
37 erase_if(flat_map<Key, T, Compare, KeyContainer, MappedContainer>& c, Predicate pred);
40 template<class Key, class T, class Compare = less<Key>,
41 class KeyContainer = vector<Key>, class MappedContainer = vector<T>>
47 template<class Key, class T, class Compare, class KeyContainer, class MappedContainer,
[all …]
/freebsd/contrib/llvm-project/clang/lib/Lex/
H A DHeaderMap.cpp133 Result.Key = HMAP_EmptyBucketKey; in getBucket()
141 Result.Key = getEndianAdjustedWord(BucketPtr->Key); in getBucket()
190 if (B.Key == HMAP_EmptyBucketKey) continue; in dump()
192 StringRef Key = getStringOrInvalid(B.Key); in dump() local
195 llvm::dbgs() << " " << i << ". " << Key << " -> '" << Prefix << "' '" in dump()
211 if (B.Key == HMAP_EmptyBucketKey) return StringRef(); // Hash miss. in lookupFilename()
214 std::optional<StringRef> Key = getString(B.Key); in lookupFilename() local
215 if (LLVM_UNLIKELY(!Key)) in lookupFilename()
217 if (!Filename.equals_insensitive(*Key)) in lookupFilename()
243 if (B.Key == HMAP_EmptyBucketKey) in reverseLookupFilename()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_dense_map.h73 bool contains(const KeyT &Key) const { return doFind(Key) != nullptr; } in contains() argument
76 size_type count(const KeyT &Key) const { return contains(Key) ? 1 : 0; } in count() argument
78 value_type *find(const KeyT &Key) { return doFind(Key); } in find() argument
79 const value_type *find(const KeyT &Key) const { return doFind(Key); } in find() argument
87 value_type *find_as(const LookupKeyT &Key) { in find_as() argument
88 return doFind(Key); in find_as()
91 const value_type *find_as(const LookupKeyT &Key) const { in find_as() argument
92 return doFind(Key); in find_as()
97 ValueT lookup(const KeyT &Key) const { in lookup() argument
98 if (const BucketT *Bucket = doFind(Key)) in lookup()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
H A Dset20 template <class Key, class Compare = less<Key>,
21 class Allocator = allocator<Key>>
26 typedef Key key_type;
138 void merge(set<Key, C2, Allocator>& source); // C++17
140 void merge(set<Key, C2, Allocator>&& source); // C++17
142 void merge(multiset<Key, C2, Allocator>& source); // C++17
144 void merge(multiset<Key, C2, Allocator>&& source); // C++17
205 template<class Key, class Compare = less<Key>, class Allocator = allocator<Key>>
206 set(initializer_list<Key>, Compare = Compare(), Allocator = Allocator())
207 -> set<Key, Compare, Allocator>; // C++17
[all …]
/freebsd/contrib/llvm-project/clang/lib/APINotes/
H A DAPINotesWriter.cpp299 hash_value_type ComputeHash(key_type_ref Key) { return llvm::djbHash(Key); } in ComputeHash() argument
302 EmitKeyDataLength(raw_ostream &OS, key_type_ref Key, data_type_ref) { in EmitKeyDataLength() argument
303 uint32_t KeyLength = Key.size(); in EmitKeyDataLength()
312 void EmitKey(raw_ostream &OS, key_type_ref Key, unsigned) { OS << Key; } in EmitKey() argument
357 hash_value_type ComputeHash(key_type_ref Key) { in ComputeHash() argument
358 return static_cast<size_t>(Key.hashValue()); in ComputeHash()
372 void EmitKey(raw_ostream &OS, key_type_ref Key, unsigned) { in EmitKey() argument
374 writer.write<uint32_t>(Key.parentContextID); in EmitKey()
375 writer.write<uint8_t>(Key.contextKind); in EmitKey()
376 writer.write<uint32_t>(Key.contextID); in EmitKey()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/experimental/
H A Dunordered_map
H A Dset
H A Dmap
/freebsd/contrib/llvm-project/llvm/tools/llvm-remarkutil/
H A DRemarkCounter.cpp106 static unsigned getValForKey(StringRef Key, const Remark &Remark) { in getValForKey() argument
107 auto *RemarkArg = find_if(Remark.Args, [&Key](const Argument &Arg) { in getValForKey()
108 return Arg.Key == Key && Arg.isValInt(); in getValForKey()
142 for (auto &Key : Arguments) { in getAllMatchingArgumentsInRemark() local
144 if (Key.match(Arg.Key) && Arg.isValInt()) in getAllMatchingArgumentsInRemark()
145 ArgumentSetIdxMap.insert({Arg.Key, ArgumentSetIdxMap.size()}); in getAllMatchingArgumentsInRemark()
182 for (auto [Key, Idx] : ArgumentSetIdxMap) { in collect()
183 auto Count = getValForKey(Key, Remark); in collect()
189 if (std::optional<std::string> Key = getGroupByKey(Remark)) in collect() local
190 ++CountedByRemarksMap[*Key]; in collect()
[all …]
/freebsd/contrib/llvm-project/clang/lib/CodeGen/
H A DCGPointerAuthInfo.h29 unsigned Key : 2; variable
35 IsIsaPointer(false), AuthenticatesNullValues(false), Key(0), in CGPointerAuthInfo()
37 CGPointerAuthInfo(unsigned Key, PointerAuthenticationMode AuthenticationMode, in CGPointerAuthInfo() argument
41 AuthenticatesNullValues(AuthenticatesNullValues), Key(Key), in CGPointerAuthInfo()
55 return Key; in getKey()
86 return LHS.Key != RHS.Key || LHS.Discriminator != RHS.Discriminator ||
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DSparsePropagation.h68 virtual bool IsUntrackedValue(LatticeKey Key) { return false; } in IsUntrackedValue() argument
72 virtual LatticeVal ComputeLatticeVal(LatticeKey Key) { in ComputeLatticeVal() argument
98 virtual void PrintLatticeKey(LatticeKey Key, raw_ostream &OS);
151 LatticeVal getExistingValueState(LatticeKey Key) const { in getExistingValueState() argument
152 auto I = ValueState.find(Key); in getExistingValueState()
159 LatticeVal getValueState(LatticeKey Key);
184 void UpdateState(LatticeKey Key, LatticeVal LV);
219 LatticeKey Key, raw_ostream &OS) { in PrintLatticeKey() argument
229 SparseSolver<LatticeKey, LatticeVal, KeyInfo>::getValueState(LatticeKey Key) { in getValueState() argument
230 auto I = ValueState.find(Key); in getValueState()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DProgramStateTrait.h73 #define CLANG_ENTO_PROGRAMSTATE_MAP(Key, Value) llvm::ImmutableMap<Key, Value> argument
87 #define REGISTER_MAP_WITH_PROGRAMSTATE(Name, Key, Value) \ argument
89 CLANG_ENTO_PROGRAMSTATE_MAP(Key, Value))
95 #define REGISTER_MAP_FACTORY_WITH_PROGRAMSTATE(Name, Key, Value) \ argument
96 using Name = llvm::ImmutableMap<Key, Value>; \
148 template <typename Key, typename Data, typename Info>
149 struct ProgramStatePartialTrait<llvm::ImmutableMap<Key, Data, Info>> {
150 using data_type = llvm::ImmutableMap<Key, Data, Info>;
152 using key_type = Key;
196 template <typename Key, typename Info>
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DOnDiskHashTable.h62 typename Info::key_type Key;
67 Item(typename Info::key_type_ref Key, typename Info::data_type_ref Data, in Item() argument
69 : Key(Key), Data(Data), Next(nullptr), Hash(InfoObj.ComputeHash(Key)) {} in Item()
115 void insert(typename Info::key_type_ref Key, in insert() argument
118 insert(Key, Data, InfoObj); in insert()
124 void insert(typename Info::key_type_ref Key, in insert() argument
129 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj)); in insert()
133 bool contains(typename Info::key_type_ref Key, Info &InfoObj) { in contains() argument
134 unsigned Hash = InfoObj.ComputeHash(Key); in contains()
136 if (I->Hash == Hash && InfoObj.EqualKey(I->Key, Key)) in contains()
[all …]
/freebsd/crypto/heimdal/lib/hdb/
H A Dhdb-protos.h107 Key **/*key*/);
211 hdb_free_key (Key */*key*/);
217 Key */*keys*/);
228 Key **/*ret_key_set*/,
237 Key **/*keys*/,
301 Key **/*key*/);
340 Key */*k*/);
345 Key */*k*/,
392 Key */*k*/);
397 Key */*k*/,
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/Utils/
H A DAMDGPUPALMetadata.cpp82 auto *Key = mdconst::dyn_extract<ConstantInt>(Tuple->getOperand(I)); in readFromIR() local
84 if (!Key || !Val) in readFromIR()
86 setRegister(Key->getZExtValue(), Val->getZExtValue()); in readFromIR()
142 return PALMD::Key::PS_SCRATCH_SIZE; in getScratchSizeKey()
144 return PALMD::Key::VS_SCRATCH_SIZE; in getScratchSizeKey()
146 return PALMD::Key::GS_SCRATCH_SIZE; in getScratchSizeKey()
148 return PALMD::Key::ES_SCRATCH_SIZE; in getScratchSizeKey()
150 return PALMD::Key::HS_SCRATCH_SIZE; in getScratchSizeKey()
152 return PALMD::Key::LS_SCRATCH_SIZE; in getScratchSizeKey()
154 return PALMD::Key::CS_SCRATCH_SIZE; in getScratchSizeKey()
[all …]

12345678910>>...43