/external/libmojo/mojo/edk/system/ports/ |
message_queue.cc | 37 for (const auto& message : heap_) 45 return !heap_.empty() && GetSequenceNum(heap_[0]) == next_sequence_num_; 50 if (!HasNextMessage() || (filter && !filter->Match(*heap_[0].get()))) { 55 std::pop_heap(heap_.begin(), heap_.end()); 56 *message = std::move(heap_.back()); 57 heap_.pop_back(); 68 heap_.emplace_back(std::move(message)); 69 std::push_heap(heap_.begin(), heap_.end()) [all...] |
message_queue.h | 62 std::vector<ScopedMessage> heap_; member in class:mojo::edk::ports::MessageQueue
|
/external/v8/src/heap/ |
scavenger.h | 19 explicit Scavenger(Heap* heap) : heap_(heap) {} 40 Heap* heap() { return heap_; } 43 Heap* heap_; member in class:v8::internal::Scavenger 52 explicit ScavengeVisitor(Heap* heap) : heap_(heap) {} 60 Heap* heap_; member in class:v8::internal::ScavengeVisitor
|
incremental-marking.cc | 24 : heap_(heap), 59 heap_->mark_compact_collector()->RecordSlot(obj, slot, value); 84 RelocInfo rinfo(heap_->isolate(), pc, RelocInfo::CODE_TARGET, 0, host); 92 Code* host = heap_->isolate() 95 RelocInfo rinfo(heap_->isolate(), pc, RelocInfo::CODE_TARGET, 0, host); 106 heap_->mark_compact_collector()->RecordCodeEntrySlot( 115 heap_->mark_compact_collector()->RecordRelocSlot(host, rinfo, value); 121 heap_->mark_compact_collector()->marking_deque()->Push(obj); 279 MarkGrey(heap_, map); 288 : heap_(incremental_marking->heap()) { 304 Heap* heap_; member in class:v8::internal::IncrementalMarkingRootMarkingVisitor [all...] |
gc-tracer.cc | 30 start_time_ = tracer_->heap_->MonotonicallyIncreasingTimeInMs(); 34 tracer_->heap_->isolate()->counters()->runtime_call_stats(), &timer_, 41 scope_, tracer_->heap_->MonotonicallyIncreasingTimeInMs() - start_time_); 45 tracer_->heap_->isolate()->counters()->runtime_call_stats(), &timer_); 101 : heap_(heap), 116 current_.end_time = heap_->MonotonicallyIncreasingTimeInMs(); 121 current_.end_time = heap_->MonotonicallyIncreasingTimeInMs(); 146 heap_->isolate()->counters()->young_generation_handling()->AddSample( 157 double start_time = heap_->MonotonicallyIncreasingTimeInMs(); 158 SampleAllocation(start_time, heap_->NewSpaceAllocationCounter() [all...] |
memory-reducer.h | 114 : heap_(heap), 139 Heap* heap() { return heap_; } 161 Heap* heap_; member in class:v8::internal::MemoryReducer
|
page-parallel-job.h | 44 : heap_(heap), 91 Task* task = new Task(heap_, items_, num_items_, start_index, 115 JobTraits::FinalizePageSequentially(heap_, item->chunk, success, 141 heap_(heap), 162 heap_, data_, current->chunk, current->data); 174 Heap* heap_; member in class:v8::internal::PageParallelJob::Task 183 Heap* heap_; member in class:v8::internal::PageParallelJob
|
object-stats.cc | 281 if (obj->IsUndefined(parent_->heap_->isolate())) continue; 294 RecordFixedArrayHelper(nullptr, heap_->weak_new_space_object_to_code_list(), 296 RecordFixedArrayHelper(nullptr, heap_->serialized_templates(), 298 RecordFixedArrayHelper(nullptr, heap_->number_string_cache(), 300 RecordFixedArrayHelper(nullptr, heap_->single_character_string_cache(), 302 RecordFixedArrayHelper(nullptr, heap_->string_split_cache(), 304 RecordFixedArrayHelper(nullptr, heap_->regexp_multiple_cache(), 306 RecordFixedArrayHelper(nullptr, heap_->retained_maps(), 311 nullptr, WeakFixedArray::cast(heap_->noscript_shared_function_infos()), 313 RecordFixedArrayHelper(nullptr, WeakFixedArray::cast(heap_->script_list()) [all...] |
array-buffer-tracker.h | 68 explicit LocalArrayBufferTracker(Heap* heap) : heap_(heap) {} 95 Heap* heap_; member in class:v8::internal::LocalArrayBufferTracker
|
object-stats.h | 20 explicit ObjectStats(Heap* heap) : heap_(heap) { ClearObjectStats(); } 94 Heap* heap() { return heap_; } 118 Heap* heap_; member in class:v8::internal::ObjectStats 136 : heap_(heap), stats_(stats) {} 162 Heap* heap_; member in class:v8::internal::ObjectStatsCollector
|
array-buffer-tracker.cc | 24 heap_->isolate()->array_buffer_allocator()->Free(buffer->backing_store(), 33 heap_->update_external_memory_concurrently_freed( 64 heap_->isolate()->array_buffer_allocator()->Free( 73 heap_->update_external_memory_concurrently_freed(
|
store-buffer.h | 97 StoreBufferOverflow(heap_->isolate()); 118 StoreBufferOverflow(heap_->isolate()); 155 Heap* heap() { return heap_; } 185 Heap* heap_; member in class:v8::internal::StoreBuffer
|
/system/core/libmemunreachable/tests/ |
LeakFolding_test.cpp | 28 LeakFoldingTest() : disable_malloc_(), heap_() {} 31 ASSERT_TRUE(heap_.empty()); 39 Heap heap_; member in class:android::LeakFoldingTest 50 HeapWalker heap_walker(heap_); 54 LeakFolding folding(heap_, heap_walker); 58 allocator::vector<LeakFolding::Leak> leaked(heap_); 74 HeapWalker heap_walker(heap_); 79 LeakFolding folding(heap_, heap_walker); 83 allocator::vector<LeakFolding::Leak> leaked(heap_); 103 HeapWalker heap_walker(heap_); [all...] |
HeapWalker_test.cpp | 30 HeapWalkerTest() : disable_malloc_(), heap_() {} 33 ASSERT_TRUE(heap_.empty()); 41 Heap heap_; member in class:android::HeapWalkerTest 45 HeapWalker heap_walker(heap_); 54 HeapWalker heap_walker(heap_); 68 HeapWalker heap_walker(heap_); 85 HeapWalker heap_walker(heap_); 90 allocator::vector<Range> leaked(heap_); 112 HeapWalker heap_walker(heap_); 118 allocator::vector<Range> leaked(heap_); [all...] |
/art/runtime/gc/accounting/ |
remembered_set.h | 51 : name_(name), heap_(heap), space_(space) {} 68 return heap_; 77 Heap* const heap_; member in class:art::gc::accounting::RememberedSet
|
mod_union_table.h | 61 heap_(heap), 105 return heap_; 114 Heap* const heap_; member in class:art::gc::accounting::ModUnionTable
|
/external/v8/src/ |
identity-map.cc | 25 heap_->UnregisterStrongRoots(keys_); 53 Object* not_mapped = heap_->not_mapped_symbol(); 66 Object* not_mapped = heap_->not_mapped_symbol(); 87 Object* not_mapped = heap_->not_mapped_symbol(); 125 if (index < 0 && gc_counter_ != heap_->gc_count()) { 138 if (gc_counter_ != heap_->gc_count()) Rehash(); 148 CHECK_NE(address, heap_->not_mapped_symbol()); 163 gc_counter_ = heap_->gc_count(); 166 Object* not_mapped = heap_->not_mapped_symbol(); 171 heap_->RegisterStrongRoots(keys_, keys_ + capacity_) [all...] |
isolate-inl.h | 41 thread_local_top_.pending_exception_ = heap_.the_hole_value(); 52 thread_local_top_.pending_message_obj_ = heap_.the_hole_value(); 65 return thread_local_top_.scheduled_exception_ != heap_.the_hole_value(); 71 thread_local_top_.scheduled_exception_ = heap_.the_hole_value();
|
/system/core/libmemunreachable/ |
Allocator.h | 110 heap_(heap) {} 116 heap_(other.heap_) {} 121 T* allocate(std::size_t n) { return reinterpret_cast<T*>(heap_.allocate(n * sizeof(T))); } 123 void deallocate(T* ptr, std::size_t) { heap_.deallocate(ptr); } 127 return heap_ == other.heap_; 138 Heap heap_; member in class:STLAllocator 163 using STLAllocator<T>::heap_; 166 void deallocate(void* ptr) { heap_.deallocate(ptr); [all...] |
/external/v8/src/profiler/ |
sampling-heap-profiler.h | 123 Heap* heap() const { return heap_; } 144 Heap* const heap_; member in class:v8::internal::SamplingHeapProfiler 166 heap_(heap), 173 USE(heap_); variable 174 DCHECK(heap_->gc_state() == Heap::NOT_IN_GC); 184 Heap* const heap_; member in class:v8::internal::SamplingAllocationObserver
|
/art/runtime/gc/collector/ |
garbage_collector.cc | 65 : heap_(heap), 134 heap_->GetLiveBitmap()->ReplaceBitmap(live_bitmap, mark_bitmap); 135 heap_->GetMarkBitmap()->ReplaceBitmap(mark_bitmap, live_bitmap); 145 heap_->GetLiveBitmap()->ReplaceLargeObjectBitmap(live_set, mark_set); 146 heap_->GetMarkBitmap()->ReplaceLargeObjectBitmap(mark_set, live_set); 193 return heap_->GetCurrentGcIteration(); 196 return heap_->GetCurrentGcIteration(); 201 heap_->RecordFree(freed.objects, freed.bytes); 205 heap_->RecordFree(freed.objects, freed.bytes);
|
mark_compact.cc | 114 mark_stack_ = heap_->GetMarkStack(); 120 mark_bitmap_ = heap_->GetMarkBitmap(); 126 heap_->GetReferenceProcessor()->ProcessReferences( 176 heap_->ProcessCards(GetTimings(), false, false, true); 180 heap_->GetCardTable()->ClearCardTable(); 185 heap_->RevokeAllThreadLocalAllocationStacks(self); 188 heap_->SwapStacks(); 208 // heap_->PreSweepingGcVerification(this); 213 for (auto& space : heap_->GetContinuousSpaces()) { 216 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space) [all...] |
mark_sweep-inl.h | 36 DCHECK(IsMarked(obj)) << "Scanning unmarked object " << obj << "\n" << heap_->DumpSpaces();
|
/external/tensorflow/tensorflow/contrib/nearest_neighbor/kernels/ |
hyperplane_lsh_probes.h | 108 heap_.Resize(2 * num_probes_); 110 heap_.Reset(); 118 heap_.InsertUnsorted(score, ProbeCandidate(ii, hash_mask, 0)); 120 heap_.Heapify(); 150 if (heap_.IsEmpty()) { 156 heap_.ExtractMin(&cur_score, &cur_candidate); 180 heap_.Insert(next_score, ProbeCandidate(*cur_table, next_mask, 189 heap_.Insert(next_score, ProbeCandidate(*cur_table, next_mask, 228 SimpleHeap<CoordinateType, ProbeCandidate> heap_; member in class:tensorflow::nearest_neighbor::HyperplaneMultiprobe
|
/art/runtime/gc/ |
verification.h | 40 explicit Verification(gc::Heap* heap) : heap_(heap) {} 73 gc::Heap* const heap_; member in class:art::gc::Verification::gc
|