/external/webrtc/src/system_wrappers/source/ |
D | map.cc | 44 MapWrapper::MapWrapper() : map_() in MapWrapper() 50 if (!map_.empty()) in ~MapWrapper() 65 return (int)map_.size(); in Size() 70 map_[id] = new MapItem(id,ptr); in Insert() 76 std::map<int, MapItem*>::const_iterator it = map_.begin(); in First() 77 if (it != map_.end()) in First() 86 std::map<int, MapItem*>::const_reverse_iterator it = map_.rbegin(); in Last() 87 if (it != map_.rend()) in Last() 100 std::map<int, MapItem*>::const_iterator it = map_.find(item->item_id_); in Next() 101 if (it != map_.end()) in Next() [all …]
|
/external/google-breakpad/src/processor/ |
D | module_comparer.cc | 112 iter1 = basic_module->functions_.map_.begin(); in CompareModule() 113 iter2 = fast_module->functions_.map_.begin(); in CompareModule() 114 while (iter1 != basic_module->functions_.map_.end() in CompareModule() 115 && iter2 != fast_module->functions_.map_.end()) { in CompareModule() 123 ASSERT_TRUE(iter1 == basic_module->functions_.map_.end()); in CompareModule() 124 ASSERT_TRUE(iter2 == fast_module->functions_.map_.end()); in CompareModule() 131 iter1 = basic_module->public_symbols_.map_.begin(); in CompareModule() 132 iter2 = fast_module->public_symbols_.map_.begin(); in CompareModule() 133 while (iter1 != basic_module->public_symbols_.map_.end() in CompareModule() 134 && iter2 != fast_module->public_symbols_.map_.end()) { in CompareModule() [all …]
|
D | contained_range_map-inl.h | 72 if (!map_) in StoreRange() 73 map_ = new AddressToRangeMap(); in StoreRange() 75 MapIterator iterator_base = map_->lower_bound(base); in StoreRange() 76 MapIterator iterator_high = map_->lower_bound(high); in StoreRange() 77 MapIterator iterator_end = map_->end(); in StoreRange() 137 map_->erase(iterator_base, iterator_high); in StoreRange() 144 map_->insert(MapValue(high, in StoreRange() 158 if (!map_) in RetrieveRange() 167 MapConstIterator iterator = map_->lower_bound(address); in RetrieveRange() 168 if (iterator == map_->end() || address < iterator->second->base_) in RetrieveRange() [all …]
|
D | range_map-inl.h | 68 MapConstIterator iterator_base = map_.lower_bound(base); in StoreRange() 69 MapConstIterator iterator_high = map_.lower_bound(high); in StoreRange() 90 if (iterator_high != map_.end()) { in StoreRange() 112 map_.insert(MapValue(high, Range(base, entry))); in StoreRange() 124 MapConstIterator iterator = map_.lower_bound(address); in RetrieveRange() 125 if (iterator == map_.end()) in RetrieveRange() 162 MapConstIterator iterator = map_.upper_bound(address); in RetrieveNearestRange() 163 if (iterator == map_.begin()) in RetrieveNearestRange() 191 MapConstIterator iterator = map_.begin(); in RetrieveRangeAtIndex() 207 return map_.size(); in GetCount() [all …]
|
D | map_serializers-inl.h | 122 size_t header_size = (1 + m.map_.size()) * sizeof(uint32_t); in SizeOf() 126 for (iter = m.map_.begin(); iter != m.map_.end(); ++iter) { in SizeOf() 148 dest = SimpleSerializer<uint32_t>::Write(m.map_.size(), dest); in Write() 151 dest += sizeof(uint32_t) * m.map_.size(); in Write() 154 dest += sizeof(Address) * m.map_.size(); in Write() 159 for (iter = m.map_.begin(); iter != m.map_.end(); ++iter, ++index) { in Write() 199 if (m->map_) { in SizeOf() 200 size += m->map_->size() * sizeof(uint32_t); in SizeOf() 202 for (iter = m->map_->begin(); iter != m->map_->end(); ++iter) { in SizeOf() 225 if (m->map_ == NULL) { in Write() [all …]
|
D | basic_code_modules.cc | 50 map_(new RangeMap<uint64_t, linked_ptr<const CodeModule> >()) { in BasicCodeModules() 69 if (!map_->StoreRange(module->base_address(), module->size(), module)) { in BasicCodeModules() 78 map_(new RangeMap<uint64_t, linked_ptr<const CodeModule> >()) { in BasicCodeModules() 82 delete map_; in ~BasicCodeModules() 86 return map_->GetCount(); in module_count() 92 if (!map_->RetrieveRange(address, &module, NULL, NULL)) { in GetModuleForAddress() 107 if (!map_->RetrieveRangeAtIndex(sequence, &module, NULL, NULL)) { in GetModuleAtSequence()
|
D | address_map-inl.h | 52 if (map_.find(address) != map_.end()) { in Store() 58 map_.insert(MapValue(address, entry)); in Store() 74 MapConstIterator iterator = map_.upper_bound(address); in Retrieve() 75 if (iterator == map_.begin()) in Retrieve() 88 map_.clear(); in Clear()
|
D | static_range_map-inl.h | 48 MapConstIterator iterator = map_.lower_bound(address); in RetrieveRange() 49 if (iterator == map_.end()) in RetrieveRange() 89 MapConstIterator iterator = map_.upper_bound(address); in RetrieveNearestRange() 90 if (iterator == map_.begin()) in RetrieveNearestRange() 114 MapConstIterator iterator = map_.IteratorAtIndex(index); in RetrieveRangeAtIndex()
|
D | static_range_map.h | 52 StaticRangeMap(): map_() { } in StaticRangeMap() 53 explicit StaticRangeMap(const char *memory): map_(memory) { } in StaticRangeMap() 82 inline int GetCount() const { return map_.size(); } in GetCount() 101 AddressToRangeMap map_; variable
|
D | static_address_map.h | 54 StaticAddressMap(): map_() { } in StaticAddressMap() 55 explicit StaticAddressMap(const char *map_data): map_(map_data) { } in StaticAddressMap() 72 AddressToEntryMap map_; variable
|
D | static_contained_range_map-inl.h | 52 map_(base + sizeof(base_) + sizeof(entry_size_) + entry_size_) { in StaticContainedRangeMap() 68 MapConstIterator iterator = map_.lower_bound(address); in RetrieveRange() 70 if (iterator == map_.end()) in RetrieveRange()
|
D | contained_range_map.h | 78 ContainedRangeMap() : base_(), entry_(), map_(NULL) {} in ContainedRangeMap() 123 : base_(base), entry_(entry), map_(map) {} in ContainedRangeMap() 143 AddressToRangeMap *map_; variable
|
/external/jsoncpp/chromium-overrides/src/lib_json/ |
D | json_value.cpp | 299 value_.map_ = new ObjectValues(); in Value() 306 value_.map_ = mapAllocator()->newMap(); in Value() 482 value_.map_ = new ObjectValues( *other.value_.map_ ); in Value() 489 value_.map_ = mapAllocator()->newMapCopy( *other.value_.map_ ); in Value() 525 delete value_.map_; in ~Value() 532 mapAllocator()->destructMap( value_.map_ ); in ~Value() 608 int delta = int( value_.map_->size() - other.value_.map_->size() ); in operator <() 611 return (*value_.map_) < (*other.value_.map_); in operator <() 617 return value_.map_->compare( *(other.value_.map_) ) < 0; in operator <() 673 return value_.map_->size() == other.value_.map_->size() in operator ==() [all …]
|
/external/jsoncpp/src/lib_json/ |
D | json_value.cpp | 295 value_.map_ = new ObjectValues(); in Value() 302 value_.map_ = mapAllocator()->newMap(); in Value() 478 value_.map_ = new ObjectValues( *other.value_.map_ ); in Value() 485 value_.map_ = mapAllocator()->newMapCopy( *other.value_.map_ ); in Value() 521 delete value_.map_; in ~Value() 528 mapAllocator()->destructMap( value_.map_ ); in ~Value() 604 int delta = int( value_.map_->size() - other.value_.map_->size() ); in operator <() 607 return (*value_.map_) < (*other.value_.map_); in operator <() 613 return value_.map_->compare( *(other.value_.map_) ) < 0; in operator <() 669 return value_.map_->size() == other.value_.map_->size() in operator ==() [all …]
|
D | json_valueiterator.inl | 50 iterator_.map_ = state; 62 return ValueInternalMap::value( iterator_.map_ ); 75 ValueInternalMap::increment( iterator_.map_ ); 88 ValueInternalMap::decrement( iterator_.map_ ); 125 return ValueInternalMap::distance( iterator_.map_, other.iterator_.map_ ); 142 return ValueInternalMap::equals( iterator_.map_, other.iterator_.map_ ); 155 iterator_.map_ = other.iterator_.map_; 176 const char *memberName = ValueInternalMap::key( iterator_.map_, isStatic ); 208 return ValueInternalMap::key( iterator_.map_ );
|
/external/v8/src/ |
D | hashmap.h | 86 Entry* map_; variable 90 Entry* map_end() const { return map_ + capacity_; } in map_end() 108 AllocationPolicy::Delete(map_); in ~TemplateHashMapImpl() 176 q = map_; in Remove() 187 Entry* r = map_ + (q->hash & (capacity_ - 1)); in Remove() 210 for (Entry* p = map_; p < end; p++) { in Clear() 220 return Next(map_ - 1); in Start() 228 DCHECK(map_ - 1 <= p && p < end); in Next() 244 Entry* p = map_ + (hash & (capacity_ - 1)); in Probe() 246 DCHECK(map_ <= p && p < end); in Probe() [all …]
|
D | effects.h | 176 explicit EffectsBase(Zone* zone) : map_(new(zone) Mapping(zone)) {} in EffectsBase() 178 bool IsEmpty() { return map_->is_empty(); } in IsEmpty() 185 Zone* zone() { return map_->allocator().zone(); } in zone() 199 return map_->Contains(var); in Contains() 203 return map_->Find(var, locator); in Find() 207 return map_->Insert(var, locator); in Insert() 212 return map_->ForEach(callback); in ForEach() 216 Mapping* map_;
|
/external/v8/test/cctest/ |
D | test-hashmap.cc | 47 explicit IntSet(IntKeyHash hash) : hash_(hash), map_(DefaultMatchFun) {} in IntSet() 51 HashMap::Entry* p = map_.Lookup(reinterpret_cast<void*>(x), hash_(x), true); in Insert() 59 map_.Remove(reinterpret_cast<void*>(x), hash_(x)); in Remove() 64 map_.Lookup(reinterpret_cast<void*>(x), hash_(x), false); in Present() 72 map_.Clear(); in Clear() 77 for (HashMap::Entry* p = map_.Start(); p != NULL; p = map_.Next(p)) { in occupancy() 80 CHECK_EQ(map_.occupancy(), static_cast<double>(count)); in occupancy() 86 HashMap map_; member in IntSet
|
/external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
D | mapper.cc | 20 file_(NULL), map_(NULL) {} in Mapper() 24 file_(NULL), map_(NULL) { in Mapper() 45 if (map_ != NULL) { in ~Mapper() 46 ::CloseHandle(map_); in ~Mapper() 85 temp.map_ = ::CreateFileMapping(temp.file_, NULL, PAGE_READONLY, 0, 0, NULL); in open() 86 MARISA_ALPHA_THROW_IF(temp.map_ == NULL, MARISA_ALPHA_IO_ERROR); in open() 88 temp.origin_ = ::MapViewOfFile(temp.map_, FILE_MAP_READ, 0, 0, 0); in open() 133 Swap(&map_, &rhs->map_); in swap()
|
/external/compiler-rt/lib/sanitizer_common/ |
D | sanitizer_stackdepot.cc | 139 : map_(StackDepotGetStats()->n_uniq_ids + 100) { in StackDepotReverseMap() 146 map_.push_back(pair); in StackDepotReverseMap() 149 InternalSort(&map_, map_.size(), IdDescPair::IdComparator); in StackDepotReverseMap() 153 if (!map_.size()) in Get() 156 uptr idx = InternalBinarySearch(map_, 0, map_.size(), pair, in Get() 158 if (idx > map_.size()) in Get() 160 return map_[idx].desc->load(); in Get()
|
D | sanitizer_addrhashmap.h | 81 AddrHashMap<T, kSize> *map_; variable 102 map_ = map; in Handle() 106 map_->acquire(this); in Handle() 112 map_ = map; in Handle() 116 map_->acquire(this); in Handle() 122 map_ = map; in Handle() 126 map_->acquire(this); in Handle() 131 map_->release(this); in ~Handle()
|
/external/marisa-trie/lib/marisa/ |
D | mapper.cc | 20 file_(NULL), map_(NULL) {} in Mapper() 24 file_(NULL), map_(NULL) { in Mapper() 43 if (map_ != NULL) { in ~Mapper() 44 ::CloseHandle(map_); in ~Mapper() 82 temp.map_ = ::CreateFileMapping(temp.file_, NULL, PAGE_READONLY, 0, 0, NULL); in open() 83 MARISA_THROW_IF(temp.map_ == NULL, MARISA_IO_ERROR); in open() 85 temp.origin_ = ::MapViewOfFile(temp.map_, FILE_MAP_READ, 0, 0, 0); in open() 129 Swap(&map_, &rhs->map_); in swap()
|
/external/compiler-rt/lib/tsan/rtl/ |
D | tsan_dense_alloc.h | 49 internal_memset(map_, 0, sizeof(map_)); in DenseSlabAlloc() 56 if (map_[i] != 0) in ~DenseSlabAlloc() 57 UnmapOrDie(map_[i], kL2Size * sizeof(T)); in ~DenseSlabAlloc() 77 return &map_[idx / kL2Size][idx % kL2Size]; in Map() 95 T *map_[kL1Size]; 116 map_[fillpos_++] = batch; in Refill()
|
/external/regex-re2/re2/ |
D | regexp.cc | 532 NamedCapturesWalker() : map_(NULL) {} in NamedCapturesWalker() 533 ~NamedCapturesWalker() { delete map_; } in ~NamedCapturesWalker() 536 map<string, int>* m = map_; in TakeMap() 537 map_ = NULL; in TakeMap() 544 if (map_ == NULL) in PreVisit() 545 map_ = new map<string, int>; in PreVisit() 550 if (map_->find(*re->name()) == map_->end()) in PreVisit() 551 (*map_)[*re->name()] = re->cap(); in PreVisit() 563 map<string, int>* map_; member in re2::NamedCapturesWalker 576 CaptureNamesWalker() : map_(NULL) {} in CaptureNamesWalker() [all …]
|
/external/google-breakpad/src/common/ |
D | simple_string_dictionary.h | 81 : map_(map), in Iterator() 88 while (current_ < map_.num_entries) { in Next() 89 const Entry* entry = &map_.entries_[current_++]; in Next() 98 const NonAllocatingMap& map_;
|