| /external/v8/src/heap/ |
| D | store-buffer-inl.h | 14 return reinterpret_cast<Address>(heap_->store_buffer_top_address()); in TopAddress()
19 DCHECK(!heap_->cell_space()->Contains(addr)); in Mark()
20 DCHECK(!heap_->code_space()->Contains(addr)); in Mark()
21 DCHECK(!heap_->old_data_space()->Contains(addr)); in Mark()
22 Address* top = reinterpret_cast<Address*>(heap_->store_buffer_top()); in Mark()
24 heap_->public_set_store_buffer_top(top); in Mark()
36 SLOW_DCHECK(!heap_->cell_space()->Contains(addr) && in EnterDirectlyIntoStoreBuffer()
37 !heap_->code_space()->Contains(addr) && in EnterDirectlyIntoStoreBuffer()
38 !heap_->old_data_space()->Contains(addr) && in EnterDirectlyIntoStoreBuffer()
39 !heap_->new_space()->Contains(addr)); in EnterDirectlyIntoStoreBuffer()
[all …]
|
| D | incremental-marking.cc | 20 : heap_(heap), in IncrementalMarking()
43 heap_->mark_compact_collector()->RecordSlot(HeapObject::RawField(obj, 0), in RecordWriteSlow()
80 Code* host = heap_->isolate() in RecordCodeTargetPatch()
94 heap_->mark_compact_collector()->RecordCodeEntrySlot( in RecordWriteOfCodeEntrySlow()
118 heap_->mark_compact_collector()->RecordRelocSlot(rinfo, in RecordWriteIntoCodeSlow()
373 DeactivateIncrementalWriteBarrierForSpace(heap_->old_pointer_space()); in DeactivateIncrementalWriteBarrier()
374 DeactivateIncrementalWriteBarrierForSpace(heap_->old_data_space()); in DeactivateIncrementalWriteBarrier()
375 DeactivateIncrementalWriteBarrierForSpace(heap_->cell_space()); in DeactivateIncrementalWriteBarrier()
376 DeactivateIncrementalWriteBarrierForSpace(heap_->property_cell_space()); in DeactivateIncrementalWriteBarrier()
377 DeactivateIncrementalWriteBarrierForSpace(heap_->map_space()); in DeactivateIncrementalWriteBarrier()
[all …]
|
| D | store-buffer.cc | 17 : heap_(heap), in StoreBuffer()
77 heap_->public_set_store_buffer_top(start_); in SetUp()
94 heap_->public_set_store_buffer_top(start_); in TearDown()
112 if (heap_->InNewSpace(*reinterpret_cast<Object**>(current))) { in Uniq()
145 PointerChunkIterator it(heap_); in EnsureSpace()
185 PointerChunkIterator it(heap_); in ExemptPopularPages()
198 containing_chunk = MemoryChunk::FromAnyPointerAddress(heap_, addr); in ExemptPopularPages()
224 containing_chunk = MemoryChunk::FromAnyPointerAddress(heap_, addr); in Filter()
255 PointerChunkIterator it(heap_); in PrepareForIteration()
294 Address* top = reinterpret_cast<Address*>(heap_->store_buffer_top()); in CellIsInStoreBuffer()
[all …]
|
| D | gc-tracer.cc | 83 : heap_(heap), in GCTracer()
105 reinterpret_cast<intptr_t>((heap_->new_space()->top()) - in Start()
118 current_.start_object_size = heap_->SizeOfObjects(); in Start()
119 current_.start_memory_size = heap_->isolate()->memory_allocator()->Size(); in Start()
120 current_.start_holes_size = CountTotalHolesSize(heap_); in Start()
122 heap_->new_space()->top() - heap_->new_space()->bottom(); in Start()
142 current_.end_object_size = heap_->SizeOfObjects(); in Stop()
143 current_.end_memory_size = heap_->isolate()->memory_allocator()->Size(); in Stop()
144 current_.end_holes_size = CountTotalHolesSize(heap_); in Stop()
146 reinterpret_cast<intptr_t>(heap_->new_space()->top()); in Stop()
[all …]
|
| D | sweeper-thread.cc | 20 heap_(isolate->heap()), in SweeperThread()
21 collector_(heap_->mark_compact_collector()), in SweeperThread()
44 collector_->SweepInParallel(heap_->old_data_space(), 0); in Run()
45 collector_->SweepInParallel(heap_->old_pointer_space(), 0); in Run()
|
| D | heap-inl.h | 646 if (heap_->InNewSpace(string)) { in AddString()
672 DCHECK(heap_->InNewSpace(obj)); in Verify()
673 DCHECK(obj != heap_->the_hole_value()); in Verify()
677 DCHECK(!heap_->InNewSpace(obj)); in Verify()
678 DCHECK(obj != heap_->the_hole_value()); in Verify()
686 DCHECK(!heap_->InNewSpace(string)); in AddOldString()
718 : heap_(isolate->heap()), daf_(isolate) { in AlwaysAllocateScope()
723 DCHECK(heap_->always_allocate_scope_depth_ == 0); in AlwaysAllocateScope()
724 heap_->always_allocate_scope_depth_++; in AlwaysAllocateScope()
729 heap_->always_allocate_scope_depth_--; in ~AlwaysAllocateScope()
[all …]
|
| D | mark-compact.cc | 53 heap_(heap), in MarkCompactCollector()
61 explicit VerifyMarkingVisitor(Heap* heap) : heap_(heap) {} in VerifyMarkingVisitor()
67 CHECK(heap_->mark_compact_collector()->IsMarked(object)); in VisitPointers()
89 Heap* heap_; member in v8::internal::VerifyMarkingVisitor
329 free_list_old_data_space_.Reset(new FreeList(heap_->old_data_space())); in SetUp()
330 free_list_old_pointer_space_.Reset(new FreeList(heap_->old_pointer_space())); in SetUp()
395 DCHECK(heap_->incremental_marking()->IsStopped()); in CollectGarbage()
403 VerifyMarking(heap_); in CollectGarbage()
411 VerifyNativeContextSeparation(heap_); in CollectGarbage()
459 VerifyMarkbitsAreClean(heap_->old_pointer_space()); in VerifyMarkbitsAreClean()
[all …]
|
| D | heap.cc | 1227 explicit ScavengeVisitor(Heap* heap) : heap_(heap) {} in ScavengeVisitor()
1239 if (!heap_->InNewSpace(object)) return; in ScavengePointer()
1244 Heap* heap_; member in v8::internal::ScavengeVisitor
1253 explicit VerifyNonPointerSpacePointersVisitor(Heap* heap) : heap_(heap) {} in VerifyNonPointerSpacePointersVisitor()
1257 CHECK(!heap_->InNewSpace(HeapObject::cast(*current))); in VisitPointers()
1263 Heap* heap_; member in v8::internal::VerifyNonPointerSpacePointersVisitor
1364 limit_ = reinterpret_cast<intptr_t*>(heap_->new_space()->ToSpaceStart()); in Initialize()
1366 reinterpret_cast<intptr_t*>(heap_->new_space()->ToSpaceEnd()); in Initialize()
1394 explicit ScavengeWeakObjectRetainer(Heap* heap) : heap_(heap) {} in ScavengeWeakObjectRetainer()
1397 if (!heap_->InFromSpace(object)) { in RetainAs()
[all …]
|
| D | heap.h | 378 heap_(heap) {} in PromotionQueue()
459 Heap* heap_; variable
489 explicit ExternalStringTable(Heap* heap) : heap_(heap) {} in ExternalStringTable()
505 Heap* heap_; variable
1332 explicit RelocationLock(Heap* heap) : heap_(heap) { in RelocationLock()
1333 heap_->relocation_mutex_.Lock(); in RelocationLock()
1337 ~RelocationLock() { heap_->relocation_mutex_.Unlock(); } in ~RelocationLock()
1340 Heap* heap_;
2085 Heap* heap_;
2107 Heap* heap_;
[all …]
|
| D | spaces-inl.h | 159 if (!scan_on_scavenge()) heap_->increment_scan_on_scavenge_pages(); in set_scan_on_scavenge()
162 if (scan_on_scavenge()) heap_->decrement_scan_on_scavenge_pages(); in set_scan_on_scavenge()
165 heap_->incremental_marking()->SetOldSpacePageFlags(this); in set_scan_on_scavenge()
|
| D | sweeper-thread.h | 35 Heap* heap_; variable
|
| D | mark-compact.h | 28 explicit Marking(Heap* heap) : heap_(heap) {} in Marking()
135 Heap* heap_;
542 inline Heap* heap() const { return heap_; } in heap()
882 Heap* heap_; variable
|
| D | incremental-marking-inl.h | 93 if (bytes_rescanned_ > 2 * heap_->PromotedSpaceSizeOfObjects()) { in BlackToGreyAndUnshift()
|
| D | store-buffer.h | 109 Heap* heap_;
|
| D | incremental-marking.h | 198 Heap* heap_; variable
|
| D | gc-tracer.h | 341 Heap* heap_; variable
|
| D | spaces.h | 603 inline Heap* heap() const { return heap_; } in heap()
655 Heap* heap_; variable
819 : heap_(heap), id_(id), executable_(executable) {} in Space()
823 Heap* heap() const { return heap_; } in heap()
851 Heap* heap_;
1585 Heap* heap_; variable
|
| D | spaces.cc | 437 chunk->heap_ = heap; in Initialize()
499 CodeRange* code_range = heap_->isolate()->code_range(); in CommitArea()
506 heap_->isolate()->memory_allocator()->ZapBlock(start, length); in CommitArea()
516 CodeRange* code_range = heap_->isolate()->code_range(); in CommitArea()
2154 FreeList::FreeList(PagedSpace* owner) : owner_(owner), heap_(owner->heap()) { in FreeList()
2181 node->set_size(heap_, size_in_bytes); in Free()
2268 DCHECK((*cur)->map() == heap_->raw_unchecked_free_space_map()); in FindNodeFor()
|
| /external/openfst/src/include/fst/extensions/far/ |
| D | stlist.h | 162 heap_.push(make_pair(key, i)); in STListReader()
169 if (heap_.empty()) return; in STListReader()
170 size_t current = heap_.top().second; in STListReader()
174 << heap_.top().first << ", file: " << sources_[current]; in STListReader()
212 return error_ || heap_.empty(); in Done()
217 size_t current = heap_.top().second; in Next()
219 heap_.pop(); in Next()
228 heap_.push(make_pair(key, current)); in Next()
230 if(!heap_.empty()) { in Next()
231 current = heap_.top().second; in Next()
[all …]
|
| D | sttable.h | 202 bool Done() const { return error_ || heap_.empty(); } in Done()
214 push_heap(heap_.begin(), heap_.end(), *compare_); in Next()
216 heap_.pop_back(); in Next()
218 if (!heap_.empty()) in Next()
279 heap_.clear(); in MakeHeap()
287 heap_.push_back(i); in MakeHeap()
289 make_heap(heap_.begin(), heap_.end(), *compare_); in MakeHeap()
297 pop_heap(heap_.begin(), heap_.end(), *compare_); in PopHeap()
298 current_ = heap_.back(); in PopHeap()
317 vector<int64> heap_; // Heap containing ID of streams with unread keys variable
|
| /external/v8/src/ |
| D | heap-snapshot-generator.cc | 372 heap_(heap) { in HeapObjectsMap()
487 heap_->CollectAllGarbage(Heap::kMakeHeapIterableMask, in UpdateHeapObjectsMap()
489 HeapIterator iterator(heap_); in UpdateHeapObjectsMap()
558 HeapIterator iterator(heap_); in FindUntrackedObjects()
701 heap_->HashSeed()); in GenerateId()
785 : heap_(snapshot->profiler()->heap_object_map()->heap()), in V8HeapExplorer()
1118 PrototypeIterator iter(heap_->isolate(), js_obj); in ExtractJSObjectReferences()
1119 SetPropertyReference(obj, entry, heap_->proto_string(), iter.GetCurrent()); in ExtractJSObjectReferences()
1127 heap_->prototype_string(), proto_or_map, in ExtractJSObjectReferences()
1133 heap_->prototype_string(), js_fun->prototype()); in ExtractJSObjectReferences()
[all …]
|
| D | isolate.cc | 796 DoThrow(heap_.termination_exception(), NULL); in TerminateExecution()
806 pending_exception() == heap_.termination_exception()) { in CancelTerminateExecution()
811 scheduled_exception() == heap_.termination_exception()) { in CancelTerminateExecution()
860 return Throw(heap_.illegal_access_string()); in ThrowIllegalOperation()
939 *target = MessageLocation(Handle<Script>(heap_.empty_script()), -1, -1); in ComputeLocation()
1255 pending_exception() == heap_.termination_exception(); in OptionalRescheduleException()
1530 heap_.isolate_ = this; in Isolate()
1619 heap_.mark_compact_collector()->sweeping_in_progress()) { in Deinit()
1620 heap_.mark_compact_collector()->EnsureSweepingCompleted(); in Deinit()
1643 heap_.TearDown(); in Deinit()
[all …]
|
| D | heap-snapshot-generator.h | 208 Heap* heap() const { return heap_; } in heap()
259 Heap* heap_; variable
448 Heap* heap_; variable
551 Heap* heap_; variable
|
| D | isolate.h | 573 thread_local_top_.pending_exception_ = heap_.the_hole_value(); in clear_pending_exception()
589 thread_local_top_.pending_message_obj_ = heap_.the_hole_value(); in THREAD_LOCAL_TOP_ACCESSOR()
590 thread_local_top_.pending_message_script_ = heap_.the_hole_value(); in THREAD_LOCAL_TOP_ACCESSOR()
628 return thread_local_top_.scheduled_exception_ != heap_.the_hole_value(); in has_scheduled_exception()
632 thread_local_top_.scheduled_exception_ = heap_.the_hole_value(); in clear_scheduled_exception()
872 Heap* heap() { return &heap_; } in heap()
1127 Heap heap_; variable
|
| /external/openfst/src/include/fst/ |
| D | queue.h | 218 : QueueBase<S>(SHORTEST_FIRST_QUEUE), heap_(comp) {} in ShortestFirstQueue()
220 StateId Head() const { return heap_.Top(); } in Head()
226 key_[s] = heap_.Insert(s); in Enqueue()
228 heap_.Insert(s); in Enqueue()
234 key_[heap_.Pop()] = kNoKey; in Dequeue()
236 heap_.Pop(); in Dequeue()
245 heap_.Update(key_[s], s); in Update()
249 bool Empty() const { return heap_.Empty(); } in Empty()
252 heap_.Clear(); in Clear()
257 Heap<S, C, false> heap_;
|