| /external/v8/src/ |
| serialize.h | 338 // Deserialize the snapshot into an empty heap.
355 // Fills in some heap data in an area from start to end (non-inclusive). The
359 // the heap.
520 // We can't serialize a heap with external two byte strings.
591 set_root_index_wave_front(Heap::kStrongRootListLength);
611 o->map() == HEAP->fixed_cow_array_map();
629 // Serialize the current state of the heap. The order is:
|
| isolate.h | 43 #include "heap.h"
596 (exception != heap()->termination_exception());
806 Heap* heap() { return &heap_; } function in class:v8::internal::Isolate
[all...] |
| stub-cache.h | 234 // Finds the Code object stored in the Heap::non_monomorphic_cache().
301 Heap* heap() { return isolate()->heap(); } function in class:v8::internal::StubCache
322 // This works well because the heap object tag size and the hash
331 // risk of collision even if the heap is spread over an area larger than
568 Heap* heap() { return isolate()->heap(); } function in class:v8::internal::BASE_EMBEDDED
[all...] |
| objects.h | 53 // - HeapObject (superclass for everything allocated in the heap)
218 // As an example, a JavaScript object is a heap object and its map
462 // We use the full 8 bits of the instance_type field to encode heap object
520 // heap.cc and mark-compact.cc.
572 // "Data", objects that cannot contain non-map-word pointers to heap
[all...] |
| debug.cc | 700 // the function will live in the heap until next gc, and can be found by
896 Heap* heap = isolate_->heap(); local
909 return heap->undefined_value();
915 return heap->undefined_value();
941 Handle<Object> break_points_hit(heap->undefined_value());
1612 Heap* heap = isolate->heap(); local
2261 Heap* heap = isolate_->heap(); local
[all...] |
| log.cc | 979 // to leave logging functions free from heap allocations.
[all...] |
| serialize.cc | 332 "Heap::roots_array_start()");
363 "Heap::NewSpaceStart()");
367 "Heap::NewSpaceMask()");
371 "Heap::always_allocate_scope_depth()");
375 "Heap::NewSpaceAllocationLimitAddress()");
379 "Heap::NewSpaceAllocationTopAddress()");
669 // Don't GC while deserializing - just expand the heap.
683 isolate_->heap()->IterateStrongRoots(this, VISIT_ONLY_STRONG);
684 isolate_->heap()->IterateWeakRoots(this, VISIT_ALL);
686 isolate_->heap()->set_global_contexts_list
1247 Heap* heap = HEAP; local
[all...] |
| assembler.h | 323 template<typename StaticVisitor> inline void Visit(Heap* heap);
367 // across two consecutive 32-bit instructions. Heap management
508 // addresses when deserializing a heap.
598 // Static variable Heap::roots_array_start()
617 // Static variable Heap::NewSpaceStart()
|
| global-handles.cc | 417 if (isolate_->heap()->InNewSpace(value) &&
509 f(isolate_->heap(), node->location())) {
532 ASSERT(isolate_->heap()->gc_state() == Heap::NOT_IN_GC);
574 if (node->IsRetainer() && isolate_->heap()->InNewSpace(node->object())) {
|
| /external/v8/test/cctest/ |
| test-deoptimization.cc | 103 HEAP->CollectAllGarbage(i::Heap::kAbortIncrementalMarkingMask);
|
| /external/chromium_org/v8/src/ |
| objects-inl.h | 42 #include "heap.h"
268 MaybeObject* Object::AllocateNewStorageFor(Heap* heap,
273 return heap->AllocateHeapNumber(0);
275 return heap->AllocateHeapNumber(Number());
621 Heap* heap = map->GetHeap(); local
622 return (map == heap->function_context_map() ||
623 map == heap->catch_context_map() ||
624 map == heap->with_context_map() |
1172 Heap* heap = local
2145 Heap* heap = GetHeap(); local
2170 Heap* heap = array->GetHeap(); local
[all...] |
| global-handles.cc | 207 if (GetGlobalHandles()->isolate()->heap()->InNewSpace(object_)) {
503 if (isolate_->heap()->InNewSpace(value) &&
596 node->IsWeak() && f(isolate_->heap(), node->location())) {
629 if (!can_skip(isolate_->heap(), &object)) {
666 ASSERT(isolate_->heap()->gc_state() == Heap::NOT_IN_GC);
723 if (isolate_->heap()->InNewSpace(node->object())) {
[all...] |
| isolate.h | 44 #include "heap.h"
628 (exception != heap()->termination_exception());
867 Heap* heap() { return &heap_; } function in class:v8::internal::Isolate
[all...] |
| objects-debug.cc | 357 Heap* heap = GetHeap(); local
358 CHECK(!heap->InNewSpace(this));
362 instance_size() < heap->Capacity()));
689 Object* raw_table = GetIsolate()->heap()->weak_object_to_code_table();
1074 Heap* heap = GetHeap(); local
1076 if (e->get(i) == heap->the_hole_value()) holes++;
[all...] |
| stub-cache.h | 181 // Finds the Code object stored in the Heap::non_monomorphic_cache().
249 Heap* heap() { return isolate()->heap(); } function in class:v8::internal::StubCache
280 // This works well because the heap object tag size and the hash
289 // risk of collision even if the heap is spread over an area larger than
395 // Name must be unique and receiver must be a heap object.
504 Heap* heap() { return isolate()->heap(); } function in class:v8::internal::BASE_EMBEDDED
[all...] |
| runtime.h | 753 // Alternatively, heap initialization can be completely restarted.
755 Heap* heap, Object* dictionary);
|
| store-buffer.cc | 39 StoreBuffer::StoreBuffer(Heap* heap)
40 : heap_(heap),
123 isolate->heap()->store_buffer()->Compact();
388 // When we are not in GC the Heap::InNewSpace() predicate
502 // This function iterates over all the pointers in a paged space in the heap,
556 // allocated during heap traversal, and if space->top() moved then it
|
| /external/chromium_org/v8/src/ia32/ |
| macro-assembler-ia32.cc | 52 code_object_ = Handle<Object>(isolate()->heap()->undefined_value(),
86 void MacroAssembler::LoadRoot(Register destination, Heap::RootListIndex index) {
87 if (isolate()->heap()->RootCanBeTreatedAsConstant(index)) {
88 Handle<Object> value(&isolate()->heap()->roots_array_start()[index]);
103 Heap::RootListIndex index) {
104 ASSERT(Heap::RootCanBeWrittenAfterInitialization(index));
115 Heap::RootListIndex index) {
125 void MacroAssembler::CompareRoot(Register with, Heap::RootListIndex index) {
126 ASSERT(isolate()->heap()->RootCanBeTreatedAsConstant(index));
127 Handle<Object> value(&isolate()->heap()->roots_array_start()[index])
[all...] |
| assembler-ia32-inl.h | 297 void RelocInfo::Visit(Heap* heap) {
300 StaticVisitor::VisitEmbeddedPointer(heap, this);
303 StaticVisitor::VisitCodeTarget(heap, this);
305 StaticVisitor::VisitCell(heap, this);
310 StaticVisitor::VisitCodeAgeSequence(heap, this);
312 } else if (heap->isolate()->debug()->has_break_points() &&
317 StaticVisitor::VisitDebugTarget(heap, this);
382 ASSERT(!isolate()->heap()->InNewSpace(obj));
|
| /external/sqlite/dist/orig/ |
| shell.c | 1073 fprintf(pArg->out, "Pager Heap Usage: %d bytes\n", iCur); iHiwtr = iCur = -1;
1081 fprintf(pArg->out, "Schema Heap Usage: %d bytes\n", iCur);
1084 fprintf(pArg->out, "Statement Heap/Lookaside Usage: %d bytes\n", iCur);
[all...] |
| /external/sqlite/dist/ |
| shell.c | 1078 fprintf(pArg->out, "Pager Heap Usage: %d bytes\n", iCur); iHiwtr = iCur = -1;
1086 fprintf(pArg->out, "Schema Heap Usage: %d bytes\n", iCur);
1089 fprintf(pArg->out, "Statement Heap/Lookaside Usage: %d bytes\n", iCur);
[all...] |
| /art/runtime/gc/space/ |
| dlmalloc_space.cc | 19 #include "gc/heap.h"
157 if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) {
216 if (VLOG_IS_ON(heap) || VLOG_IS_ON(startup)) {
227 // morecore_start. Don't use an internal dlmalloc lock (as we already hold heap lock). When
231 // Do not allow morecore requests to succeed beyond the initial size of the heap
288 // Trim the heap so that we minimize the size of the Zygote space.
298 VLOG(heap) << "Begin " << reinterpret_cast<const void*>(begin_) << "\n"
307 VLOG(heap) << "Creating new AllocSpace: ";
308 VLOG(heap) << "Size " << GetMemMap()->Size();
309 VLOG(heap) << "GrowthLimit " << PrettySize(growth_limit)
412 Heap* heap = Runtime::Current()->GetHeap(); local
[all...] |
| /external/chromium_org/v8/src/x64/ |
| assembler-x64-inl.h | 492 void RelocInfo::Visit(Heap* heap) {
495 StaticVisitor::VisitEmbeddedPointer(heap, this);
498 StaticVisitor::VisitCodeTarget(heap, this);
500 StaticVisitor::VisitCell(heap, this);
505 StaticVisitor::VisitCodeAgeSequence(heap, this);
507 } else if (heap->isolate()->debug()->has_break_points() &&
512 StaticVisitor::VisitDebugTarget(heap, this);
|
| /external/chromium_org/v8/test/cctest/ |
| test-deoptimization.cc | 103 CcTest::heap()->CollectAllGarbage(i::Heap::kAbortIncrementalMarkingMask);
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| queue.h | 29 #include "fst/lib/heap.h"
228 Heap<S, C> heap_;
|
