| /external/google-breakpad/src/common/ |
| D | simple_string_dictionary.h | 89 const Entry* entry = &map_.entries_[current_++]; in Next()
104 NonAllocatingMap() : entries_() { in NonAllocatingMap()
117 memcpy(entries_, other.entries_, sizeof(entries_));
125 assert(size == sizeof(entries_)); in NonAllocatingMap()
126 if (size == sizeof(entries_)) { in NonAllocatingMap()
127 memcpy(entries_, map, size); in NonAllocatingMap()
136 if (entries_[i].is_active()) { in GetCount()
181 if (!entries_[i].is_active()) { in SetKeyValue()
182 entry = &entries_[i]; in SetKeyValue()
200 if (strncmp(entries_[i].key, key, key_size) == 0) in SetKeyValue()
[all …]
|
| D | stabs_reader.cc | 72 : entries_(stab, stab_size), in StabsReader()
74 iterator_(&entries_, big_endian, value_size), in StabsReader()
|
| D | stabs_reader.h | 202 ByteBuffer entries_; variable
|
| /external/v8/src/compiler/ |
| D | value-numbering-reducer.cc | 46 : entries_(nullptr), capacity_(0), size_(0), zone_(zone) {} in ValueNumberingReducer()
56 if (!entries_) { in Reduce()
61 entries_ = zone()->NewArray<Node*>(kInitialCapacity); in Reduce()
62 memset(entries_, 0, sizeof(*entries_) * kInitialCapacity); in Reduce()
63 entries_[hash & (kInitialCapacity - 1)] = node; in Reduce()
75 Node* entry = entries_[i]; in Reduce()
79 entries_[dead] = node; in Reduce()
82 entries_[i] = node; in Reduce()
104 Node* entry = entries_[j]; in Reduce()
114 entries_[i] = entry; in Reduce()
[all …]
|
| D | node-cache.cc | 35 Entry* old_entries = entries_; in Resize()
39 entries_ = zone->NewArray<Entry>(num_entries); in Resize()
40 memset(entries_, 0, sizeof(Entry) * num_entries); in Resize()
50 Entry* entry = &entries_[j]; in Resize()
66 if (!entries_) { in Find()
69 entries_ = zone->NewArray<Entry>(num_entries); in Find()
71 memset(entries_, 0, sizeof(Entry) * num_entries); in Find()
72 Entry* entry = &entries_[hash & (kInitialSize - 1)]; in Find()
82 Entry* entry = &entries_[i]; in Find()
94 Entry* entry = &entries_[hash & (size_ - 1)]; in Find()
[all …]
|
| D | liveness-analyzer.h | 84 void Lookup(int var) { entries_.push_back(Entry(Entry::kLookup, var)); } in Lookup()
85 void Bind(int var) { entries_.push_back(Entry(Entry::kBind, var)); } in Bind()
86 void Checkpoint(Node* node) { entries_.push_back(Entry(node)); } in Checkpoint()
132 ZoneDeque<Entry> entries_; variable
|
| D | node-cache.h | 33 : entries_(nullptr), size_(0), max_(max) {} in entries_() function
52 Entry* entries_; // lazily-allocated hash entries. variable
|
| D | liveness-analyzer.cc | 88 : entries_(zone), in LivenessAnalyzerBlock()
101 for (auto entry : base::Reversed(entries_)) { in Process()
174 for (auto entry : entries_) { in Print()
|
| D | value-numbering-reducer.h | 27 Node** entries_; variable
|
| /external/libweave/src/ |
| D | access_black_list_manager_impl.cc | 41 decltype(entries_)::key_type key; in Load()
49 entries_[key] = expiration_time; in Load()
52 if (entries_.size() < list->GetSize()) { in Load()
67 for (const auto& e : entries_) { in Save()
81 for (auto i = begin(entries_); i != end(entries_);) { in RemoveExpired()
83 i = entries_.erase(i); in RemoveExpired()
104 if (entries_.size() >= capacity_) { in Block()
113 auto& value = entries_[std::make_pair(user_id, app_id)]; in Block()
121 if (!entries_.erase(std::make_pair(user_id, app_id))) { in Unblock()
139 auto both = entries_.find(std::make_pair(user, app)); in IsBlocked()
[all …]
|
| D | access_black_list_manager_impl.h | 51 entries_; variable
|
| /external/regex-re2/re2/ |
| D | prefilter_tree.cc | 25 for (int i = 0; i < entries_.size(); i++) in ~PrefilterTree()
26 delete entries_[i].parents; in ~PrefilterTree()
104 for (int i = 0; i < entries_.size(); i++) { in Compile()
105 IntMap* parents = entries_[i].parents; in Compile()
114 (entries_[it->index()].propagate_up_at_count > 1); in Compile()
119 entries_[it->index()].propagate_up_at_count -= 1; in Compile()
209 entries_.resize(node_map_.size()); in AssignUniqueIds()
220 Entry* entry = &entries_[prefilter->unique_id()]; in AssignUniqueIds()
233 Entry* entry = &entries_[prefilter->unique_id()]; in AssignUniqueIds()
259 Entry* child_entry = &entries_[child_id]; in AssignUniqueIds()
[all …]
|
| D | prefilter_tree.h | 107 vector<Entry> entries_; variable
|
| /external/webrtc/webrtc/p2p/base/ |
| D | relayport.cc | 200 entries_.push_back( in RelayPort()
206 for (size_t i = 0; i < entries_.size(); ++i) in ~RelayPort()
207 delete entries_[i]; in ~RelayPort()
273 ASSERT(entries_.size() == 1); in PrepareAddress()
274 entries_[0]->Connect(); in PrepareAddress()
318 for (size_t i = 0; i < entries_.size(); ++i) { in SendTo()
319 if (entries_[i]->address().IsNil() && payload) { in SendTo()
320 entry = entries_[i]; in SendTo()
323 } else if (entries_[i]->address() == addr) { in SendTo()
324 entry = entries_[i]; in SendTo()
[all …]
|
| D | turnport.cc | 258 while (!entries_.empty()) { in ~TurnPort()
259 DestroyEntry(entries_.front()); in ~TurnPort()
934 return (std::find_if(entries_.begin(), entries_.end(), in HasPermission()
935 std::bind2nd(std::ptr_fun(MatchesIP), ipaddr)) != entries_.end()); in HasPermission()
942 EntryList::const_iterator it = std::find_if(entries_.begin(), entries_.end(), in FindEntry()
944 return (it != entries_.end()) ? *it : NULL; in FindEntry()
951 EntryList::const_iterator it = std::find_if(entries_.begin(), entries_.end(), in FindEntry()
953 return (it != entries_.end()) ? *it : NULL; in FindEntry()
957 auto it = std::find(entries_.begin(), entries_.end(), e); in EntryExists()
958 return it != entries_.end(); in EntryExists()
[all …]
|
| D | relayport.h | 111 std::vector<RelayEntry*> entries_; variable
|
| D | turnport.h | 268 EntryList entries_; variable
|
| /external/v8/src/ |
| D | unicode-inl.h | 15 CacheEntry entry = entries_[code_point & kMask]; in get()
23 entries_[code_point & kMask] = CacheEntry(code_point, result); in CalculateValue()
29 CacheEntry entry = entries_[c & kMask]; in get()
48 entries_[c & kMask] = CacheEntry(c, result[0] - c); in CalculateValue()
51 entries_[c & kMask] = CacheEntry(c, 0); in CalculateValue()
|
| D | unicode.h | 55 CacheEntry entries_[kSize]; variable
82 CacheEntry entries_[kSize]; variable
|
| D | safepoint-table.h | 100 uint8_t* bits = &Memory::uint8_at(entries_ + (index * entry_size_)); in GetEntry()
139 Address entries_; variable
|
| D | safepoint-table.cc | 44 entries_ = pc_and_deoptimization_indexes_ + in SafepointTable()
|
| /external/v8/src/crankshaft/ |
| D | hydrogen-check-elimination.cc | 179 HCheckTableEntry* old_entry = &entries_[i]; in Copy()
181 HCheckTableEntry* new_entry = ©->entries_[i]; in Copy()
320 HCheckTableEntry* this_entry = &entries_[i]; in Merge()
677 HCheckTableEntry* entry = &entries_[i]; in KillUnstableEntries()
695 HCheckTableEntry* entry = &entries_[i]; in Kill()
710 if (entries_[i].object_ != NULL) { in Compact()
711 if (dest != i) entries_[dest] = entries_[i]; in Compact()
730 MemMove(&tmp_entries[0], &entries_[0], L * sizeof(HCheckTableEntry)); in Compact()
731 MemMove(&entries_[0], &entries_[L], R * sizeof(HCheckTableEntry)); in Compact()
732 MemMove(&entries_[R], &tmp_entries[0], L * sizeof(HCheckTableEntry)); in Compact()
[all …]
|
| /external/v8/src/profiler/ |
| D | heap-snapshot-generator.cc | 228 DCHECK(entries_.is_empty()); // Root entry must be the first one. in AddRootEntry()
268 entries_.Add(entry); in AddEntry()
269 return &entries_.last(); in AddEntry()
322 sorted_entries_.Allocate(entries_.length()); in GetSortedEntriesList()
323 for (int i = 0; i < entries_.length(); ++i) { in GetSortedEntriesList()
324 sorted_entries_[i] = &entries_[i]; in GetSortedEntriesList()
341 GetMemoryUsedByList(entries_) + in RawSnapshotSize()
376 entries_.Add(EntryInfo(0, NULL, 0)); in HeapObjectsMap()
393 entries_.at(to_entry_info_index).addr = NULL; in MoveObject()
406 entries_.at(to_entry_info_index).addr = NULL; in MoveObject()
[all …]
|
| D | heap-snapshot-generator.h | 158 HeapEntry* root() { return &entries_[root_index_]; } in root()
159 HeapEntry* gc_roots() { return &entries_[gc_roots_index_]; } in gc_roots()
161 return &entries_[gc_subroot_indexes_[index]]; in gc_subroot()
163 List<HeapEntry>& entries() { return entries_; } in entries()
192 List<HeapEntry> entries_; variable
263 List<EntryInfo> entries_; variable
300 HashMap entries_; variable
316 bool is_empty() const { return entries_.occupancy() == 0; } in is_empty()
319 HashMap entries_;
559 HeapEntriesMap entries_; variable
|
| /external/vixl/src/vixl/a64/ |
| D | macro-assembler-a64.cc | 67 for (it = entries_.begin(), end = entries_.end(); it != end; ++it) { in Reset()
73 entries_.clear(); in Reset()
111 for (it = entries_.begin(), end = entries_.end(); it != end; ++it) { in Emit()
130 entries_.push_back(literal); in AddEntry()
|