/third_party/node/deps/v8/src/codegen/ |
D | external-reference-encoder.cc | 20 map_ = isolate->external_reference_map(); in ExternalReferenceEncoder() 21 if (map_ != nullptr) return; in ExternalReferenceEncoder() 22 map_ = new AddressToIndexHashMap(); in ExternalReferenceEncoder() 23 isolate->set_external_reference_map(map_); in ExternalReferenceEncoder() 30 if (map_->Get(addr).IsNothing()) map_->Set(addr, Value::Encode(i, false)); in ExternalReferenceEncoder() 31 DCHECK(map_->Get(addr).IsJust()); in ExternalReferenceEncoder() 40 if (map_->Get(addr).IsNothing()) map_->Set(addr, Value::Encode(i, true)); in ExternalReferenceEncoder() 41 DCHECK(map_->Get(addr).IsJust()); in ExternalReferenceEncoder() 51 DCHECK(map_->Get(addr).IsJust()); in ~ExternalReferenceEncoder() 61 Maybe<uint32_t> maybe_index = map_->Get(address); in TryEncode() [all …]
|
/third_party/protobuf/js/experimental/runtime/kernel/ |
D | binary_storage.js | 34 this.map_ = null; 59 if (this.map_) { 60 this.map_.set(fieldNumber, field); 62 this.map_ = new Map([[fieldNumber, field]]); 78 return this.map_ ? this.map_.get(fieldNumber) : undefined; 92 if (this.map_) { 93 this.map_.delete(fieldNumber); 110 if (this.map_) { 111 this.map_.forEach(callback);
|
/third_party/node/deps/v8/src/compiler/backend/ |
D | register-allocator-verifier.h | 139 : map_(zone), in BlockAssessments() 148 map_.erase(operand); in Drop() 153 auto existent = map_.find(operand); in AddDefinition() 154 if (existent != map_.end()) { in AddDefinition() 156 map_.erase(existent); in AddDefinition() 160 map_.insert( in AddDefinition() 167 CHECK(map_.empty()); in CopyFrom() 170 map_.insert(other->map_.begin(), other->map_.end()); in CopyFrom() 177 OperandMap& map() { return map_; } in map() 178 const OperandMap& map() const { return map_; } in map() [all …]
|
/third_party/protobuf/src/google/protobuf/ |
D | map_field_lite.h | 68 explicit MapFieldLite(Arena* arena) : map_(arena) { SetDefaultEnumValue(); } in MapFieldLite() 71 const Map<Key, T>& GetMap() const { return map_; } in GetMap() 72 Map<Key, T>* MutableMap() { return &map_; } in MutableMap() 75 int size() const { return static_cast<int>(map_.size()); } in size() 76 void Clear() { return map_.clear(); } in Clear() 78 for (typename Map<Key, T>::const_iterator it = other.map_.begin(); in MergeFrom() 79 it != other.map_.end(); ++it) { in MergeFrom() 80 map_[it->first] = it->second; in MergeFrom() 83 void Swap(MapFieldLite* other) { map_.swap(other->map_); } in Swap() 93 return Arena::CreateMessage<EntryType>(map_.arena_); in NewEntry() [all …]
|
D | map_field.cc | 158 map_(arena), in DynamicMapField() 164 for (Map<MapKey, MapValueRef>::iterator iter = map_.begin(); in ~DynamicMapField() 165 iter != map_.end(); ++iter) { in ~DynamicMapField() 168 map_.clear(); in ~DynamicMapField() 174 Map<MapKey, MapValueRef>* map = &const_cast<DynamicMapField*>(this)->map_; in Clear() 237 MapValueRef& map_val = map_[map_key]; in InsertOrLookupMapValue() 250 Map<MapKey, MapValueRef>::iterator iter = map_.find(map_key); in DeleteMapValue() 251 if (iter == map_.end()) { in DeleteMapValue() 259 map_.erase(iter); in DeleteMapValue() 265 return map_; in GetMap() [all …]
|
D | map_test.cc | 107 map_(*map_ptr_), in MapImplTest() 109 EXPECT_TRUE(map_.empty()); in MapImplTest() 110 EXPECT_EQ(0, map_.size()); in MapImplTest() 114 EXPECT_FALSE(map_.empty()); in ExpectSingleElement() 115 EXPECT_EQ(1, map_.size()); in ExpectSingleElement() 120 EXPECT_FALSE(map_.empty()); in ExpectElements() 121 EXPECT_EQ(map.size(), map_.size()); in ExpectElements() 130 EXPECT_EQ(value, map_[key]); in ExpectElement() 131 EXPECT_EQ(1, map_.count(key)); in ExpectElement() 132 EXPECT_TRUE(map_.contains(key)); in ExpectElement() [all …]
|
D | map_field.h | 568 Map<MapKey, MapValueRef> map_; 735 map_ = reflection->MutableMapData(message, field); 738 map_->InitializeIterator(this); 741 map_ = other.map_; 742 map_->InitializeIterator(this); 743 map_->CopyIterator(this, other); 745 ~MapIterator() { map_->DeleteIterator(this); } 747 map_ = other.map_; 748 map_->CopyIterator(this, other); 752 return a.map_->EqualIterator(a, b); [all …]
|
D | map_entry_lite.h | 345 explicit Parser(MapField* mf) : mf_(mf), map_(mf->MutableMap()) {} 368 typename Map::size_type map_size = map_->size(); 369 value_ptr_ = &(*map_)[key_]; 370 if (PROTOBUF_PREDICT_TRUE(map_size != map_->size())) { 377 map_->erase(key_); // Failure! Undo insertion. 402 typename Map::size_type map_size = map_->size(); 403 value_ptr_ = &(*map_)[key_]; 404 if (PROTOBUF_PREDICT_TRUE(map_size != map_->size())) { 411 map_->erase(key_); // Failure! Undo insertion. 418 map_->erase(key_); [all …]
|
/third_party/skia/third_party/externals/tint/fuzzers/tint_spirv_tools_fuzzer/ |
D | mutator_cache.cc | 22 : map_(), entries_(), max_size_(max_size) { in MutatorCache() 27 auto it = map_.find(key); in Get() 28 if (it == map_.end()) { in Get() 37 auto it = map_.find(key); in Put() 38 if (it != map_.end()) { in Put() 42 if (map_.size() == max_size_) { in Put() 47 auto pair = map_.emplace(key, entries_.begin()); in Put() 54 auto it = map_.find(key); in Remove() 55 if (it == map_.end()) { in Remove() 60 map_.erase(it); in Remove()
|
/third_party/protobuf/js/ |
D | map.js | 66 this.map_ = {}; 89 this.map_[key.toString()] = new jspb.Map.Entry_(key, value); 103 var m = this.map_; 120 var entry = this.map_[strKeys[i]]; 147 var entry = this.map_[rawArray[i][0].toString()]; 232 this.map_ = {}; 247 var hadKey = this.map_.hasOwnProperty(keyValue); 248 delete this.map_[keyValue]; 268 var entry = this.map_[strKeys[i]]; 285 var entry = this.map_[strKeys[i]]; [all …]
|
/third_party/node/deps/v8/src/utils/ |
D | identity-map.h | 165 index_ = map_->NextIndex(index_); 169 Object key() const { return Object(map_->KeyAtIndex(index_)); } in key() 171 return reinterpret_cast<V*>(map_->EntryAtIndex(index_)); in entry() 180 Iterator(IdentityMap* map, int index) : map_(map), index_(index) {} in Iterator() 182 IdentityMap* map_; variable 190 explicit IteratableScope(IdentityMap* map) : map_(map) { in IteratableScope() 191 CHECK(!map_->is_iterable()); in IteratableScope() 192 map_->EnableIteration(); in IteratableScope() 197 CHECK(map_->is_iterable()); in ~IteratableScope() 198 map_->DisableIteration(); in ~IteratableScope() [all …]
|
D | address-map.cc | 15 map_ = isolate->root_index_map(); in RootIndexMap() 16 if (map_ != nullptr) return; in RootIndexMap() 17 map_ = new HeapObjectToIndexHashMap(); in RootIndexMap() 28 Maybe<uint32_t> maybe_index = map_->Get(heap_object); in RootIndexMap() 34 map_->Set(heap_object, index); in RootIndexMap() 38 isolate->set_root_index_map(map_); in RootIndexMap()
|
/third_party/node/deps/v8/src/wasm/ |
D | signature-map.cc | 15 auto pos = map_.find(sig); in FindOrInsert() 16 if (pos != map_.end()) return pos->second; in FindOrInsert() 18 CHECK_GE(kMaxInt, map_.size()); in FindOrInsert() 19 uint32_t index = static_cast<uint32_t>(map_.size()); in FindOrInsert() 20 map_.insert(std::make_pair(sig, index)); in FindOrInsert() 25 auto pos = map_.find(sig); in Find() 26 if (pos == map_.end()) return -1; in Find()
|
D | branch-hint-map.h | 26 map_.emplace(offset, hint); in insert() 29 auto it = map_.find(offset); in GetHintFor() 30 if (it == map_.end()) { in GetHintFor() 37 std::unordered_map<uint32_t, WasmBranchHint> map_;
|
/third_party/node/deps/v8/src/builtins/ |
D | constants-table-builder.cc | 16 : isolate_(isolate), map_(isolate->heap()) { in BuiltinsConstantsTableBuilder() 49 auto find_result = map_.FindOrInsert(object); in AddObject() 52 *find_result.entry = map_.size() - 1; in AddObject() 83 if (map_.Delete(self_reference, &key)) { in PatchSelfReference() 85 map_.Insert(code_object, key); in PatchSelfReference() 94 if (map_.Delete(ReadOnlyRoots(isolate_).basic_block_counters_marker(), in PatchBasicBlockCountersReference() 96 map_.Insert(counters, key); in PatchBasicBlockCountersReference() 108 if (map_.size() == 0) return; in Finalize() 111 isolate_->factory()->NewFixedArray(map_.size(), AllocationType::kOld); in Finalize() 114 ConstantsMap::IteratableScope it_scope(&map_); in Finalize() [all …]
|
/third_party/node/deps/v8/src/compiler/ |
D | compilation-dependencies.cc | 267 : CompilationDependency(kStableMap), map_(map) {} in StableMapDependency() 273 return !map_.object()->is_dictionary_map() && map_.object()->is_stable(); in IsValid() 277 deps->Register(map_.object(), DependentCode::kPrototypeCheckGroup); in Install() 283 return base::hash_combine(h(map_)); in Hash() 288 return map_.equals(zat->map_); in Equals() 291 const MapRef map_; member in v8::internal::compiler::__anonfeb74f180211::StableMapDependency 439 map_(map), in OwnConstantDataPropertyDependency() 445 if (holder_.object()->map() != *map_.object()) { in IsValid() 478 return base::hash_combine(h(holder_), h(map_), representation_.kind(), in Hash() 485 return holder_.equals(zat->holder_) && map_.equals(zat->map_) && in Equals() [all …]
|
D | node-cache.h | 34 explicit NodeCache(Zone* zone) : map_(zone) {} in EXPORT_TEMPLATE_DECLARE() 44 Node** Find(Key key) { return &(map_[key]); } in EXPORT_TEMPLATE_DECLARE() 48 for (const auto& entry : map_) { in EXPORT_TEMPLATE_DECLARE() 54 ZoneUnorderedMap<Key, Node*, Hash, Pred> map_; in EXPORT_TEMPLATE_DECLARE()
|
D | escape-analysis.cc | 34 explicit Sidetable(Zone* zone) : map_(zone) {} in Sidetable() 37 if (id >= map_.size()) { in operator []() 38 map_.resize(id + 1); in operator []() 40 return map_[id]; in operator []() 44 ZoneVector<T> map_; member in v8::internal::compiler::Sidetable 51 : def_value_(std::move(def_value)), map_(zone) {} in SparseSidetable() 53 auto iter = map_.find(node->id()); in Set() 54 if (iter != map_.end()) { in Set() 57 map_.insert(iter, std::make_pair(node->id(), std::move(value))); in Set() 61 auto iter = map_.find(node->id()); in Get() [all …]
|
/third_party/node/deps/v8/src/base/ |
D | hashmap.h | 105 DCHECK_NOT_NULL(impl_.map_); in Invalidate() 106 impl_.allocator().DeleteArray(impl_.map_, capacity()); in Invalidate() 135 Entry* map_end() const { return impl_.map_ + impl_.capacity_; } in map_end() 162 map_ = other.map_; 166 other.map_ = nullptr; 178 Entry* map_ = nullptr; member 200 impl_.map_ = impl_.allocator().template NewArray<Entry>(capacity()); in TemplateHashMapImpl() 201 memcpy(impl_.map_, original->impl_.map_, capacity() * sizeof(Entry)); in TemplateHashMapImpl() 208 if (impl_.map_) impl_.allocator().DeleteArray(impl_.map_, capacity()); in ~TemplateHashMapImpl() 297 q = impl_.map_; in Remove() [all …]
|
/third_party/mesa3d/include/android_stub/backtrace/ |
D | BacktraceMap.h | 76 iterator(BacktraceMap* map, size_t index) : map_(map), index_(index) {} in iterator() 99 if (index_ >= map_->size()) { 102 backtrace_map_t* map = &map_->maps_[index_]; 104 map->load_bias = map_->GetLoadBias(index_); 110 BacktraceMap* map_ = nullptr; 179 explicit ScopedBacktraceMapIteratorLock(BacktraceMap* map) : map_(map) { in ScopedBacktraceMapIteratorLock() 184 map_->UnlockIterator(); in ~ScopedBacktraceMapIteratorLock() 188 BacktraceMap* map_;
|
/third_party/skia/third_party/externals/tint/src/transform/ |
D | transform.h | 77 map_[&TypeInfo::Of<T>()] = std::move(data); in Put() 92 auto it = map_.find(&TypeInfo::Of<T>()); in Get() 93 if (it == map_.end()) { in Get() 102 for (auto& it : other.map_) { in Add() 103 map_.emplace(it.first, std::move(it.second)); in Add() 105 other.map_.clear(); in Add() 120 std::unordered_map<const TypeInfo*, std::unique_ptr<Data>> map_; variable
|
/third_party/node/deps/v8/src/snapshot/ |
D | references.h | 106 : map_(isolate->heap()), attached_reference_index_(0) {} in SerializerReferenceMap() 109 return map_.Find(object); in LookupReference() 113 return map_.Find(object); in LookupReference() 124 map_.Insert(object, reference); in Add() 135 map_.Insert(object, reference); in AddAttachedReference() 140 IdentityMap<SerializerReference, base::DefaultAllocationPolicy> map_;
|
/third_party/node/src/ |
D | node_sockaddr-inl.h | 201 auto it = map_.find(address); in Peek() 202 return it == std::end(map_) ? nullptr : &it->second->second; in Peek() 210 map_.erase(it->first); in CheckExpired() 236 auto it = map_.find(address); in Upsert() 237 if (it != std::end(map_)) { in Upsert() 244 map_[address] = list_.begin(); in Upsert() 249 if (map_.size() > max_size_) { in Upsert() 251 map_.erase((--last)->first); in Upsert() 255 return &map_[address]->second; in Upsert()
|
/third_party/node/deps/v8/src/zone/ |
D | type-stats.h | 28 StatsEntry& entry = map_[std::type_index(typeid(TypeTag))]; in AddAllocated() 41 StatsEntry& entry = map_[std::type_index(typeid(TypeTag))]; in AddDeallocated() 60 StatsEntry& entry = map_[type_id]; in Add() 68 HashMap map_; variable
|
/third_party/cef/libcef/browser/ |
D | browser_context.cc | 46 DCHECK(map_.empty()); in ~ImplManager() 63 PathMap::iterator it = map_.find(path); in RemoveImpl() 64 DCHECK(it != map_.end()); in RemoveImpl() 65 if (it != map_.end()) in RemoveImpl() 66 map_.erase(it); in RemoveImpl() 105 map_.insert(std::make_pair(path, impl)); in SetImplPath() 111 PathMap::const_iterator it = map_.find(path); in GetImplFromPath() 112 if (it != map_.end()) in GetImplFromPath() 130 PathMap map_; member in __anon093c8c430111::ImplManager
|