Searched refs:Key (Results 26 - 50 of 371) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Lex/
H A DHeaderMapTypes.h23 uint32_t Key; // Offset (into strings) of key. member in struct:clang::HMapBucket
/freebsd-11-stable/contrib/llvm-project/lldb/source/Utility/
H A DEnvironment.cpp13 char *Environment::Envp::make_entry(llvm::StringRef Key, argument
15 const size_t size = Key.size() + 1 /*=*/ + Value.size() + 1 /*\0*/;
20 Next = std::copy(Key.begin(), Key.end(), Next);
/freebsd-11-stable/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 */*
[all...]
/freebsd-11-stable/usr.sbin/ctm/ctm/
H A Dctm_passb.c67 for(sp=Syntax;sp->Key;sp++)
68 if(!strcmp(p+3,sp->Key))
99 (!strcmp(sp->Key,"DR") || !strcmp(sp->Key,"FR")))
114 if (!strcmp(sp->Key,"FS") || !strcmp(sp->Key,"FN") ||
115 !strcmp(sp->Key,"AS") || !strcmp(sp->Key,"DR") ||
116 !strcmp(sp->Key,"FR")) {
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/MC/
H A DMCSubtargetInfo.h35 const char *Key; ///< K-V key string member in struct:llvm::SubtargetFeatureKV
42 return StringRef(Key) < S;
47 return StringRef(Key) < StringRef(Other.Key);
55 const char *Key; ///< K-V key string member in struct:llvm::SubtargetSubTypeKV
61 return StringRef(Key) < S;
66 return StringRef(Key) < StringRef(Other.Key);
222 return Found != ProcDesc.end() && StringRef(Found->Key) == CPU;
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/hash_fn/
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, \
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_F
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DProgramStateTrait.h70 #define CLANG_ENTO_PROGRAMSTATE_MAP(Key, Value) llvm::ImmutableMap<Key, Value>
84 #define REGISTER_MAP_WITH_PROGRAMSTATE(Name, Key, Value) \
86 CLANG_ENTO_PROGRAMSTATE_MAP(Key, Value))
92 #define REGISTER_MAP_FACTORY_WITH_PROGRAMSTATE(Name, Key, Value) \
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;
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DScopedHashTable.h49 K Key; member in class:llvm::ScopedHashTableVal
52 ScopedHashTableVal(const K &key, const V &val) : Key(key), Val(val) {}
55 const K &getKey() const { return Key; }
182 size_type count(const K &Key) const {
183 return TopLevelMap.count(Key);
186 V lookup(const K &Key) const {
187 auto I = TopLevelMap.find(Key);
194 void insert(const K &Key, const V &Val) { argument
195 insertIntoScope(CurScope, Key, Val);
202 iterator begin(const K &Key) { argument
216 insertIntoScope(ScopeTy *S, const K &Key, const V &Val) argument
[all...]
H A DStringSet.h38 std::pair<typename base::iterator, bool> insert(StringRef Key) { argument
39 assert(!Key.empty());
40 return base::insert(std::make_pair(Key, None));
H A DStringMap.h81 unsigned LookupBucketFor(StringRef Key);
86 int FindKey(StringRef Key) const;
94 StringMapEntryBase *RemoveKey(StringRef Key);
178 static StringMapEntry *Create(StringRef Key, AllocatorTy &Allocator, argument
180 size_t KeyLength = Key.size();
197 memcpy(StrBuffer, Key.data(), KeyLength);
204 static StringMapEntry *Create(StringRef Key, InitType &&... InitVal) { argument
206 return Create(Key, A, std::forward<InitType>(InitVal)...);
209 static StringMapEntry *Create(StringRef Key) { argument
210 return Create(Key, ValueT
355 find(StringRef Key) argument
378 operator [](StringRef Key) argument
420 insert_or_assign(StringRef Key, V &&Val) argument
432 try_emplace(StringRef Key, ArgsTy &&... Args) argument
479 erase(StringRef Key) argument
588 StringRef Key; member in class:llvm::StringMapKeyIterator
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Tooling/Refactoring/
H A DAtomicChange.h45 AtomicChange(llvm::StringRef FilePath, llvm::StringRef Key) argument
46 : Key(Key), FilePath(FilePath) {}
64 const std::string &getKey() const { return Key; }
126 AtomicChange(std::string Key, std::string FilePath, std::string Error,
132 std::string Key; member in class:clang::tooling::AtomicChange
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DSparsePropagation.h28 // static inline Value *getValueFromLatticeKey(LatticeKey Key);
66 virtual bool IsUntrackedValue(LatticeKey Key) { return false; } argument
70 virtual LatticeVal ComputeLatticeVal(LatticeKey Key) { argument
97 virtual void PrintLatticeKey(LatticeKey Key, raw_ostream &OS);
150 LatticeVal getExistingValueState(LatticeKey Key) const {
151 auto I = ValueState.find(Key);
158 LatticeVal getValueState(LatticeKey Key);
183 void UpdateState(LatticeKey Key, LatticeVal LV);
218 LatticeKey Key, raw_ostream &OS) {
228 SparseSolver<LatticeKey, LatticeVal, KeyInfo>::getValueState(LatticeKey Key) { argument
217 PrintLatticeKey( LatticeKey Key, raw_ostream &OS) argument
244 UpdateState(LatticeKey Key, LatticeVal LV) argument
411 LatticeKey Key = KeyInfo::getLatticeKeyFromValue(&PN); local
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/basic_tree_policy/
H A Dtraits.hpp59 template<typename Key,
71 template<typename Key,
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Dtraits.hpp63 template<typename Key,
73 Key,
81 typedef types_traits< Key, Mapped, Allocator, false> type_traits;
86 Key,
219 template<typename Key,
228 Key,
238 Key,
247 Key,
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/tree_policy/
H A Dnode_metadata_selector.hpp72 template<typename Key,
86 Key,
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/trie_policy/
H A Dnode_metadata_selector.hpp72 template<typename Key,
86 Key,
/freebsd-11-stable/lib/libdevdctl/
H A Devent_factory.h58 typedef std::pair<Event::Type, std::string> Key; typedef in class:DevdCtl::EventFactory
61 typedef std::map<Key, Event::BuildMethod *> Registry;
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/WindowsResource/
H A DResourceProcessor.h29 void addDefine(StringRef Key, StringRef Value = StringRef()) { argument
30 PreprocessorDefines.emplace_back(Key, Value);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/
H A DMetadataImpl.h23 const typename InfoT::KeyTy &Key) {
24 auto I = Store.find_as(Key);
22 getUniqued(DenseSet<T *, InfoT> &Store, const typename InfoT::KeyTy &Key) argument
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/OProfileJIT/
H A DOProfileJITEventListener.cpp52 void notifyObjectLoaded(ObjectKey Key, const ObjectFile &Obj,
55 void notifyFreeingObject(ObjectKey Key) override;
81 ObjectKey Key, const ObjectFile &Obj,
139 DebugObjects[Key] = std::move(DebugObjOwner);
142 void OProfileJITEventListener::notifyFreeingObject(ObjectKey Key) { argument
147 if (DebugObjects.find(Key) == DebugObjects.end())
150 const ObjectFile &DebugObj = *DebugObjects[Key].getBinary();
173 DebugObjects.erase(Key);
80 notifyObjectLoaded( ObjectKey Key, const ObjectFile &Obj, const RuntimeDyld::LoadedObjectInfo &L) argument
/freebsd-11-stable/crypto/heimdal/lib/kadm5/
H A Dkeys.c44 int len, Key *keys)
54 _kadm5_init_keys (Key *keys, int len)
71 _kadm5_exists_keys(Key *keys1, int len1, Key *keys2, int len2)
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/BinaryFormat/
H A DAMDGPUMetadataVerifier.h42 bool verifyEntry(msgpack::MapDocNode &MapNode, StringRef Key, bool Required,
45 verifyScalarEntry(msgpack::MapDocNode &MapNode, StringRef Key, bool Required,
48 bool verifyIntegerEntry(msgpack::MapDocNode &MapNode, StringRef Key,
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DSymbolRemappingReader.h103 /// A Key represents an equivalence class of symbol names.
104 using Key = uintptr_t;
110 /// The result will be Key() if the name cannot be remapped (typically
112 Key insert(StringRef FunctionName) {
119 /// The result will typically be Key() if no equivalent symbol has been
120 /// inserted, but this is not guaranteed: a Key different from all keys ever
122 Key lookup(StringRef FunctionName) {
/freebsd-11-stable/contrib/llvm-project/clang/lib/Lex/
H A DHeaderMap.cpp134 Result.Key = HMAP_EmptyBucketKey;
142 Result.Key = getEndianAdjustedWord(BucketPtr->Key);
187 if (B.Key == HMAP_EmptyBucketKey) continue;
189 StringRef Key = getStringOrInvalid(B.Key); local
192 llvm::dbgs() << " " << i << ". " << Key << " -> '" << Prefix << "' '"
221 if (B.Key == HMAP_EmptyBucketKey) return StringRef(); // Hash miss.
224 Optional<StringRef> Key = getString(B.Key);
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/Serialization/
H A DModuleFile.cpp31 template<typename Key, typename Offset, unsigned InitialCapacity>
34 const ContinuousRangeMap<Key, Offset, InitialCapacity> &Map) {
38 using MapType = ContinuousRangeMap<Key, Offset, InitialCapacity>;

Completed in 454 milliseconds

1234567891011>>