| /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 | node-cache.cc | 49 Entry* old_entries = entries_; in Resize()
53 entries_ = zone->NewArray<Entry>(num_entries); in Resize()
54 memset(entries_, 0, sizeof(Entry) * num_entries); in Resize()
64 Entry* entry = &entries_[j]; in Resize()
80 if (entries_ == NULL) { in Find()
83 entries_ = zone->NewArray<Entry>(num_entries); in Find()
85 memset(entries_, 0, sizeof(Entry) * num_entries); in Find()
86 Entry* entry = &entries_[hash & (INITIAL_SIZE - 1)]; in Find()
96 Entry* entry = &entries_[i]; in Find()
108 Entry* entry = &entries_[hash & (size_ - 1)]; in Find()
|
| D | node-cache.h | 21 explicit NodeCache(int max = 256) : entries_(NULL), size_(0), max_(max) {} in entries_() function
38 Entry* entries_; // lazily-allocated hash 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/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 | 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()
668 HCheckTableEntry* entry = &entries_[i]; in KillUnstableEntries()
686 HCheckTableEntry* entry = &entries_[i]; in Kill()
701 if (entries_[i].object_ != NULL) { in Compact()
702 if (dest != i) entries_[dest] = entries_[i]; in Compact()
721 MemMove(&tmp_entries[0], &entries_[0], L * sizeof(HCheckTableEntry)); in Compact()
722 MemMove(&entries_[0], &entries_[L], R * sizeof(HCheckTableEntry)); in Compact()
723 MemMove(&entries_[R], &tmp_entries[0], L * sizeof(HCheckTableEntry)); in Compact()
[all …]
|
| D | heap-snapshot-generator.h | 155 HeapEntry* root() { return &entries_[root_index_]; } in root()
156 HeapEntry* gc_roots() { return &entries_[gc_roots_index_]; } in gc_roots()
158 return &entries_[gc_subroot_indexes_[index]]; in gc_subroot()
160 List<HeapEntry>& entries() { return entries_; } in entries()
192 List<HeapEntry> entries_; variable
257 List<EntryInfo> entries_; variable
294 HashMap entries_; variable
310 bool is_empty() const { return entries_.occupancy() == 0; } in is_empty()
313 HashMap entries_;
547 HeapEntriesMap entries_; variable
|
| D | heap-snapshot-generator.cc | 233 DCHECK(entries_.is_empty()); // Root entry must be the first one. in AddRootEntry()
273 entries_.Add(entry); in AddEntry()
274 return &entries_.last(); in AddEntry()
327 sorted_entries_.Allocate(entries_.length()); in GetSortedEntriesList()
328 for (int i = 0; i < entries_.length(); ++i) { in GetSortedEntriesList()
329 sorted_entries_[i] = &entries_[i]; in GetSortedEntriesList()
345 GetMemoryUsedByList(entries_) + in RawSnapshotSize()
380 entries_.Add(EntryInfo(0, NULL, 0)); in HeapObjectsMap()
397 entries_.at(to_entry_info_index).addr = NULL; in MoveObject()
410 entries_.at(to_entry_info_index).addr = NULL; in MoveObject()
[all …]
|
| D | unicode.h | 44 CacheEntry entries_[kSize]; variable
70 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 | 46 entries_ = pc_and_deoptimization_indexes_ + in SafepointTable()
|
| /external/vixl/src/vixl/a64/ |
| D | macro-assembler-a64.cc | 60 for (it = entries_.begin(), end = entries_.end(); it != end; ++it) { in Reset()
63 entries_.clear(); in Reset()
101 for (it = entries_.begin(), end = entries_.end(); it != end; ++it) { in Emit()
109 entries_.clear(); in Emit()
123 entries_.push_back(literal); in AddEntry()
|
| D | macro-assembler-a64.h | 112 bool IsEmpty() const { return entries_.empty(); } in IsEmpty()
127 std::vector<RawLiteral*> entries_;
|
| /external/v8/src/arm/ |
| D | assembler-arm.cc | 3633 : entries_(), current_section_(ConstantPoolArray::SMALL_SECTION) {} in ConstantPoolBuilder()
3637 return entries_.size() == 0; in IsEmpty()
3671 for (it = entries_.begin(), i = 0; it != entries_.end(); it++, i++) { in AddEntry()
3675 entry_section = entries_[i].section_; in AddEntry()
3681 entries_.push_back(ConstantPoolEntry(rinfo, entry_section, merged_index)); in AddEntry()
3701 for (std::vector<ConstantPoolEntry>::iterator entry = entries_.begin(); in Relocate()
3702 entry != entries_.end(); entry++) { in Relocate()
3749 for (std::vector<ConstantPoolEntry>::iterator entry = entries_.begin(); in Populate()
3750 entry != entries_.end(); entry++) { in Populate()
3776 DCHECK(entry->merged_index_ < (entry - entries_.begin())); in Populate()
[all …]
|
| D | assembler-arm.h | 690 std::vector<ConstantPoolEntry> entries_; variable
|