| /external/tensorflow/tensorflow/core/kernels/boosted_trees/quantiles/ |
| D | weighted_quantiles_summary.h | 84 entries_.clear(); in BuildFromBufferEntries()
85 entries_.reserve(buffer_entries.size()); in BuildFromBufferEntries()
89 entries_.emplace_back(entry.value, entry.weight, cumulative_weight, in BuildFromBufferEntries()
98 entries_.clear(); in BuildFromSummaryEntries()
99 entries_.reserve(summary_entries.size()); in BuildFromSummaryEntries()
100 entries_.insert(entries_.begin(), summary_entries.begin(), in BuildFromSummaryEntries()
115 const auto& other_entries = other_summary.entries_; in Merge()
119 if (entries_.empty()) { in Merge()
120 BuildFromSummaryEntries(other_summary.entries_); in Merge()
125 std::vector<SummaryEntry> base_entries(std::move(entries_)); in Merge()
[all …]
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/quantiles/ |
| D | weighted_quantiles_summary.h | 76 entries_.clear(); in BuildFromBufferEntries()
77 entries_.reserve(buffer_entries.size()); in BuildFromBufferEntries()
81 entries_.emplace_back(entry.value, entry.weight, cumulative_weight, in BuildFromBufferEntries()
90 entries_.clear(); in BuildFromSummaryEntries()
91 entries_.reserve(summary_entries.size()); in BuildFromSummaryEntries()
92 entries_.insert(entries_.begin(), summary_entries.begin(), in BuildFromSummaryEntries()
107 const auto& other_entries = other_summary.entries_; in Merge()
111 if (entries_.empty()) { in Merge()
112 BuildFromSummaryEntries(other_summary.entries_); in Merge()
117 std::vector<SummaryEntry> base_entries(std::move(entries_)); in Merge()
[all …]
|
| /external/v8/src/compiler/ |
| D | value-numbering-reducer.cc | 18 : entries_(nullptr), in ValueNumberingReducer()
31 if (!entries_) { in Reduce()
36 entries_ = temp_zone()->NewArray<Node*>(kInitialCapacity); in Reduce()
37 memset(entries_, 0, sizeof(*entries_) * kInitialCapacity); in Reduce()
38 entries_[hash & (kInitialCapacity - 1)] = node; in Reduce()
50 Node* entry = entries_[i]; in Reduce()
54 entries_[dead] = node; in Reduce()
57 entries_[i] = node; in Reduce()
79 Node* entry = entries_[j]; in Reduce()
91 if (!entries_[(j + 1) & mask]) { in Reduce()
[all …]
|
| D | node-cache.cc | 36 Entry* old_entries = entries_; in Resize()
40 entries_ = zone->NewArray<Entry>(num_entries); in Resize()
41 memset(entries_, 0, sizeof(Entry) * num_entries); in Resize()
51 Entry* entry = &entries_[j]; in Resize()
67 if (!entries_) { in Find()
70 entries_ = zone->NewArray<Entry>(num_entries); in Find()
72 memset(entries_, 0, sizeof(Entry) * num_entries); in Find()
73 Entry* entry = &entries_[hash & (kInitialSize - 1)]; in Find()
83 Entry* entry = &entries_[i]; in Find()
95 Entry* entry = &entries_[hash & (size_ - 1)]; in Find()
[all …]
|
| D | node-cache.h | 33 : entries_(nullptr), size_(0), max_(max) {} in entries_() function
52 Entry* entries_; // lazily-allocated hash entries. variable
|
| D | value-numbering-reducer.h | 34 Node** entries_; in NON_EXPORTED_BASE() local
|
| /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()
|
| /external/grpc-grpc/src/core/lib/slice/ |
| D | slice_hash_table.h | 99 Entry* entries_; variable
120 entries_ = static_cast<Entry*>(gpr_zalloc(sizeof(Entry) * size_)); in SliceHashTable()
130 Entry& entry = entries_[i]; in ~SliceHashTable()
136 gpr_free(entries_); in ~SliceHashTable()
144 if (!entries_[idx].is_set) { in Add()
145 entries_[idx].is_set = true; in Add()
146 entries_[idx].key = key; in Add()
147 entries_[idx].value = std::move(value); in Add()
164 if (!entries_[idx].is_set) break; in Get()
165 if (grpc_slice_eq(entries_[idx].key, key)) { in Get()
[all …]
|
| D | slice_weak_hash_table.h | 51 entries_[idx].Set(key, std::move(value)); in Add()
59 const auto& entry = entries_[idx]; in Get()
104 Entry entries_[Size]; variable
|
| /external/v8/src/interpreter/ |
| D | handler-table-builder.cc | 16 HandlerTableBuilder::HandlerTableBuilder(Zone* zone) : entries_(zone) {} in HandlerTableBuilder()
19 int handler_table_size = static_cast<int>(entries_.size()); in ToHandlerTable()
24 Entry& entry = entries_[i]; in ToHandlerTable()
36 int handler_id = static_cast<int>(entries_.size()); in NewHandlerEntry()
38 entries_.push_back(entry); in NewHandlerEntry()
45 entries_[handler_id].offset_start = offset; in SetTryRegionStart()
51 entries_[handler_id].offset_end = offset; in SetTryRegionEnd()
57 entries_[handler_id].offset_target = offset; in SetHandlerTarget()
62 entries_[handler_id].catch_prediction_ = prediction; in SetPrediction()
67 entries_[handler_id].context = reg; in SetContextRegister()
|
| D | handler-table-builder.h | 55 ZoneVector<Entry> entries_; variable
|
| /external/perfetto/src/profiling/memory/ |
| D | interner.h | 101 auto it = entries_.find(item); in Intern()
102 if (it == entries_.cend()) { in Intern()
105 auto it_and_inserted = entries_.emplace(std::move(item)); in Intern()
115 ~Interner() { PERFETTO_DCHECK(entries_.empty()); } in ~Interner()
117 size_t entry_count_for_testing() { return entries_.size(); } in entry_count_for_testing()
122 entries_.erase(*entry); in Return()
125 std::unordered_set<Entry, typename Entry::Hash> 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 …]
|
| /external/tensorflow/tensorflow/compiler/xla/ |
| D | metric_table_report.cc | 29 entries_.push_back(std::move(entry)); in AddEntry()
58 absl::c_sort(entries_, metric_greater); in MakeReport()
132 AppendLine("There are ", entries_.size(), " ", entry_name_, "."); in AppendHeader()
136 const std::vector<Category> categories = MakeCategories(&entries_); in AppendCategoryTable()
194 for (const auto& entry : entries_) { in AppendEntryTable()
208 const int64 remaining_entries = entries_.size() - entries_shown; in AppendEntryTable()
237 for (const auto& entry : entries_) { in UnaccountedMetric()
|
| /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 | 60 CacheEntry entries_[kSize]; variable
87 CacheEntry entries_[kSize]; variable
|
| D | safepoint-table.h | 119 uint8_t* bits = &Memory<uint8_t>(entries_ + (index * entry_size_)); in GetEntry()
165 Address entries_; variable
|
| /external/perfetto/include/perfetto/base/ |
| D | circular_queue.h | 186 if (!entries_) { in ~CircularQueue()
192 free(entries_); in ~CircularQueue()
267 free(entries_); // It's fine to free(nullptr) (for the ctor call case).
272 entries_ = new_vec;
279 return &entries_[index]; in Get()
284 T* entries_ = nullptr; variable
|
| /external/bsdiff/ |
| D | fake_patch_writer.h | 33 entries_.push_back(entry); in AddControlEntry()
54 const std::vector<ControlEntry>& entries() const { return entries_; } in entries()
61 std::vector<ControlEntry> entries_;
|
| /external/v8/src/profiler/ |
| D | heap-snapshot-generator.cc | 221 DCHECK(entries_.empty()); // Root entry must be the first one. in AddRootEntry()
262 entries_.emplace_back(this, type, name, id, size, trace_node_id); in AddEntry()
263 return &entries_.back(); in AddEntry()
300 sorted_entries_.reserve(entries_.size()); in GetSortedEntriesList()
301 for (HeapEntry& entry : entries_) { in GetSortedEntriesList()
330 entries_.emplace_back(0, kNullAddress, 0, true); in HeapObjectsMap()
348 entries_.at(to_entry_info_index).addr = kNullAddress; in MoveObject()
361 entries_.at(to_entry_info_index).addr = kNullAddress; in MoveObject()
365 entries_.at(from_entry_info_index).addr = to; in MoveObject()
372 entries_.at(from_entry_info_index).size, object_size); in MoveObject()
[all …]
|
| D | heap-snapshot-generator.h | 178 HeapEntry* root() { return &entries_[root_index_]; } in root()
179 HeapEntry* gc_roots() { return &entries_[gc_roots_index_]; } in gc_roots()
181 return &entries_[gc_subroot_indexes_[static_cast<int>(root)]]; in gc_subroot()
183 std::vector<HeapEntry>& entries() { return entries_; } in entries()
214 std::vector<HeapEntry> entries_; variable
283 std::vector<EntryInfo> entries_; variable
316 base::HashMap entries_; variable
332 bool is_empty() const { return entries_.occupancy() == 0; } in is_empty()
335 base::HashMap entries_;
582 HeapEntriesMap entries_; variable
|
| /external/v8/src/heap/ |
| D | worklist.h | 225 entries_[index_++] = entry; in Push()
231 *entry = entries_[--index_]; in Pop()
244 if (callback(entries_[i], &entries_[new_index])) { in Update()
254 callback(entries_[i]); in Iterate()
264 EntryType entries_[kCapacity]; variable
|
| /external/protobuf/src/google/protobuf/compiler/objectivec/ |
| D | objectivec_helpers.h | 187 size_t num_entries() const { return entries_.size(); } in num_entries()
197 vector<DataEntry> entries_; variable
|