| /third_party/node/deps/v8/src/objects/ |
| H A D | string-table.cc | 350 // internalized the key, in which case StringTable::LookupKey will perform a in InternalizedStringKey()
440 // - LookupKey supports concurrent access (see comment below). in LookupString()
455 // correctly ordered by LookupKey's write mutex and see the updated map in LookupString()
468 Handle<String> result = LookupKey(isolate, &key); in LookupString()
478 Handle<String> StringTable::LookupKey(IsolateT* isolate, StringTableKey* key) { in LookupKey() function in v8::internal::StringTable
565 template Handle<String> StringTable::LookupKey(Isolate* isolate,
567 template Handle<String> StringTable::LookupKey(Isolate* isolate,
569 template Handle<String> StringTable::LookupKey(Isolate* isolate,
571 template Handle<String> StringTable::LookupKey(Isolate* isolate,
574 template Handle<String> StringTable::LookupKey(LocalIsolat
[all...] |
| H A D | string-table.h | 67 Handle<String> LookupKey(IsolateT* isolate, StringTableKey* key);
|
| /third_party/node/deps/v8/src/base/ |
| H A D | hashmap.h | 83 // operator()(const LookupKey& lookup_key, const Key& entry_key)
89 template <typename LookupKey, typename KeyFunc, typename ValueFunc>
90 Entry* LookupOrInsert(const LookupKey& lookup_key, uint32_t hash,
136 template <typename LookupKey>
137 Entry* Probe(const LookupKey& key, uint32_t hash) const;
240 template <typename LookupKey, typename KeyFunc, typename ValueFunc>
243 const LookupKey& lookup_key, uint32_t hash, const KeyFunc& key_func, in LookupOrInsert()
359 template <typename LookupKey>
362 const LookupKey& key, uint32_t hash) const { in Probe()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| H A D | DenseSet.h | 201 const LookupKeyT &LookupKey) { in insert_as()
202 return TheMap.insert_as({V, detail::DenseSetEmpty()}, LookupKey); in insert_as()
205 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) { in insert_as() argument
206 return TheMap.insert_as({std::move(V), detail::DenseSetEmpty()}, LookupKey); in insert_as()
200 insert_as(const ValueT &V, const LookupKeyT &LookupKey) insert_as() argument
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/ |
| H A D | ConstantsContext.h | 574 using LookupKey = std::pair<TypeClass *, ValType>;
577 using LookupKeyHashed = std::pair<unsigned, LookupKey>;
593 return getHashValue(LookupKey(CP->getType(), ValType(CP, Storage))); in getHashValue()
600 static unsigned getHashValue(const LookupKey &Val) { in getHashValue()
608 static bool isEqual(const LookupKey &LHS, const ConstantClass *RHS) { in isEqual()
649 LookupKey Key(Ty, V); in getOrCreate()
677 LookupKey Key(CP->getType(), ValType(Operands, CP)); in replaceOperandsInPlace()
|
| /third_party/node/deps/v8/src/snapshot/ |
| H A D | shared-heap-deserializer.cc | 48 isolate()->string_table()->LookupKey(isolate(), &key); in DeserializeStringTable()
|
| H A D | deserializer.cc | 504 String result = *isolate()->string_table()->LookupKey(isolate(), &key); in PostProcessNewObject()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/DebugInfo/PDB/Native/ |
| H A D | HashTable.h | 319 auto LookupKey = Traits.storageKeyToLookupKey(Buckets[I].first); in grow() local
320 NewMap.set_as_internal(LookupKey, Buckets[I].second, Traits, in grow()
|
| /third_party/protobuf/src/google/protobuf/ |
| H A D | map.h | 1024 template <typename LookupKey>
1026 key_type>::template key_arg<LookupKey>;
|
| /third_party/node/deps/v8/src/heap/ |
| H A D | factory-base.cc | 582 return isolate()->string_table()->LookupKey(isolate(), key); in InternalizeStringWithKey()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
| H A D | btree.h | 261 template <typename LookupKey>
265 !std::is_same<LookupKey, Key>::value && in can_have_multiple_equivalent_keys()
|