HomeSort by relevance Sort by last modified time
    Searched refs:Heap (Results 76 - 100 of 336) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/v8/src/
spaces.h 42 // Heap structures:
44 // A JS heap consists of a young generation, an old generation, and a large
64 // buffer overflow) iterate intergenerational pointers without decoding heap
68 // the Heap::InNewSpace() predicate must be a pointer to a live heap object in
300 // any heap object.
562 inline Heap* heap() { return heap_; } function in class:v8::internal::MemoryChunk
620 Heap* heap_;
629 static MemoryChunk* Initialize(Heap* heap
764 Heap* heap() const { return heap_; } function in class:v8::internal::Space
    [all...]
mark-compact.cc 36 #include "heap-profiler.h"
83 ASSERT(HEAP->mark_compact_collector()->IsMarked(object));
134 static void VerifyMarking(Heap* heap) {
135 VerifyMarking(heap->old_pointer_space());
136 VerifyMarking(heap->old_data_space());
137 VerifyMarking(heap->code_space());
138 VerifyMarking(heap->cell_space());
139 VerifyMarking(heap->map_space());
140 VerifyMarking(heap->new_space())
920 Heap* heap = map->GetHeap(); local
1093 Heap* heap = obj->GetHeap(); local
1179 Heap* heap = map->GetHeap(); local
1334 heap); local
1361 heap); local
1364 heap); local
1376 Heap* heap = map->GetHeap(); local
1404 Heap* heap = map->GetHeap(); local
1448 Heap* heap = map->GetHeap(); local
1492 Heap* heap = map->GetHeap(); local
    [all...]
  /external/chromium_org/v8/src/
heap.h 49 // Defines all the roots in Heap.
310 typedef String* (*ExternalStringTableUpdaterCallback)(Heap* heap,
339 explicit PromotionQueue(Heap* heap)
344 heap_(heap) { }
423 Heap* heap_;
456 friend class Heap;
470 Heap* heap_;
482 class Heap {
    [all...]
builtins.cc 37 #include "heap-profiler.h"
189 return isolate->heap()->undefined_value(); // Make compiler happy.
194 return isolate->heap()->undefined_value();
210 static void FillWithHoles(Heap* heap, FixedArray* dst, int from, int to) {
211 ASSERT(dst->map() != heap->fixed_cow_array_map());
212 MemsetPointer(dst->data_start() + from, heap->the_hole_value(), to - from);
223 static FixedArrayBase* LeftTrimFixedArray(Heap* heap,
233 ASSERT(elms->map() != heap->fixed_cow_array_map())
396 Heap* heap = isolate->heap(); local
511 Heap* heap = isolate->heap(); local
542 Heap* heap = isolate->heap(); local
593 Heap* heap = isolate->heap(); local
660 Heap* heap = isolate->heap(); local
793 Heap* heap = isolate->heap(); local
1000 Heap* heap = isolate->heap(); local
1159 Heap* heap = isolate->heap(); local
1242 Heap* heap = isolate->heap(); local
1666 Heap* heap = isolate->heap(); local
    [all...]
mark-compact.cc 37 #include "heap-profiler.h"
81 explicit VerifyMarkingVisitor(Heap* heap) : heap_(heap) {}
102 Heap* heap_;
106 static void VerifyMarking(Heap* heap, Address bottom, Address top) {
107 VerifyMarkingVisitor visitor(heap);
135 VerifyMarking(space->heap(), page->area_start(), limit);
145 VerifyMarking(space->heap(), p->area_start(), p->area_end())
1272 Heap* heap = isolate_->heap(); local
1314 Heap* heap = map->GetHeap(); local
1403 Heap* heap = obj->GetHeap(); local
1540 Heap* heap = map->GetHeap(); local
1562 Heap* heap = fixed_array->map()->GetHeap(); local
1579 Heap* heap = map->GetHeap(); local
1607 Heap* heap = map->GetHeap(); local
1642 Heap* heap = map->GetHeap(); local
1658 Heap* heap = map->GetHeap(); local
1675 Heap* heap = map->GetHeap(); local
    [all...]
heap-snapshot-generator.h 91 // HeapEntry instances represent an entity from the heap (or a special
157 // HeapSnapshot represents a single heap snapshot. It is stored in
159 // HeapSnapshots. All HeapSnapshots share strings copied from JS heap
224 explicit HeapObjectsMap(Heap* heap);
226 Heap* heap() const { return heap_; } function in class:v8::internal::HeapObjectsMap
279 Heap* heap_;
286 // in any kind of heap memory.
299 // real heap objects and their representations in heap snapshots
    [all...]
  /external/chromium_org/v8/src/mips/
builtins-mips.cc 166 masm->isolate()->heap()->undefined_value(),
240 __ LoadRoot(a3, Heap::kEmptyFixedArrayRootIndex);
283 __ LoadRoot(argument, Heap::kempty_stringRootIndex);
328 __ LoadRoot(t0, Heap::kStackLimitRootIndex);
378 __ LoadRoot(t7, Heap::kUndefinedValueRootIndex);
428 // Now allocate the JSObject on the heap.
440 __ LoadRoot(t6, Heap::kEmptyFixedArrayRootIndex);
459 __ LoadRoot(t7, Heap::kUndefinedValueRootIndex);
473 __ LoadRoot(t7, Heap::kOnePointerFillerMapRootIndex);
479 // failures need to undo the allocation, so that the heap is in
    [all...]
ic-mips.cc 98 __ LoadRoot(scratch0, Heap::kHashTableMapRootIndex);
281 __ LoadRoot(at, Heap::kFixedArrayMapRootIndex);
300 __ LoadRoot(at, Heap::kTheHoleValueRootIndex);
388 __ LoadRoot(t0, Heap::kTrueValueRootIndex);
390 __ LoadRoot(t1, Heap::kFalseValueRootIndex);
567 __ LoadRoot(at, Heap::kHashTableMapRootIndex);
600 __ LoadRoot(at, Heap::kHashTableMapRootIndex);
745 Heap::kNonStrictArgumentsElementsMapRootIndex,
764 __ LoadRoot(scratch3, Heap::kTheHoleValueRootIndex);
793 Heap::kFixedArrayMapRootIndex
    [all...]
code-stubs-mips.cc 395 __ LoadRoot(a1, Heap::kFunctionContextMapRootIndex);
409 __ LoadRoot(a1, Heap::kUndefinedValueRootIndex);
442 __ LoadRoot(a2, Heap::kBlockContextMapRootIndex);
469 __ LoadRoot(a1, Heap::kTheHoleValueRootIndex);
794 // Smis. If it's not a heap number, then return equal.
809 __ LoadRoot(t2, Heap::kUndefinedValueRootIndex);
840 // It is a heap number, so return non-equal if it's NaN and equal if it's
891 // Check whether the non-smi is a heap number.
    [all...]
  /external/chromium_org/v8/src/x64/
ic-x64.cc 95 Heap::kHashTableMapRootIndex);
291 Heap::kFixedArrayMapRootIndex);
306 __ CompareRoot(scratch, Heap::kTheHoleValueRootIndex);
395 Heap::kHashTableMapRootIndex);
417 Heap::kHashTableMapRootIndex);
609 __ CompareRoot(rdi, Heap::kFixedArrayMapRootIndex);
621 __ CompareRoot(kScratchRegister, Heap::kTheHoleValueRootIndex);
663 __ CompareRoot(rdi, Heap::kFixedDoubleArrayMapRootIndex);
690 __ CompareRoot(r9, Heap::kHeapNumberMapRootIndex);
800 __ CompareRoot(rdi, Heap::kFixedArrayMapRootIndex)
1180 Heap* heap = masm->isolate()->heap(); local
    [all...]
full-codegen-x64.cc 144 __ LoadRoot(kScratchRegister, Heap::kUndefinedValueRootIndex);
163 __ PushRoot(Heap::kUndefinedValueRootIndex);
165 __ LoadRoot(rdx, Heap::kUndefinedValueRootIndex);
277 __ CompareRoot(rsp, Heap::kStackLimitRootIndex);
293 __ LoadRoot(rax, Heap::kUndefinedValueRootIndex);
449 void FullCodeGenerator::EffectContext::Plug(Heap::RootListIndex index) const {
454 Heap::RootListIndex index) const {
460 Heap::RootListIndex index) const {
465 void FullCodeGenerator::TestContext::Plug(Heap::RootListIndex index) const {
470 if (index == Heap::kUndefinedValueRootIndex |
1752 Heap* heap = isolate()->heap(); local
    [all...]
codegen-x64.cc 168 // the V8 heap. We can't, and don't, refer to any relocatable addresses
300 __ CompareRoot(r8, Heap::kEmptyFixedArrayRootIndex);
307 Heap::kFixedCOWArrayMapRootIndex);
321 __ LoadRoot(rdi, Heap::kFixedDoubleArrayMapRootIndex);
350 __ LoadRoot(rdi, Heap::kFixedDoubleArrayMapRootIndex);
394 __ CompareRoot(rbx, Heap::kTheHoleValueRootIndex);
425 __ CompareRoot(r8, Heap::kEmptyFixedArrayRootIndex);
437 __ LoadRoot(rdi, Heap::kFixedArrayMapRootIndex);
444 __ LoadRoot(rdi, Heap::kTheHoleValueRootIndex);
455 // Box doubles into heap numbers
    [all...]
  /external/v8/src/x64/
ic-x64.cc 95 Heap::kHashTableMapRootIndex);
335 Heap::kFixedArrayMapRootIndex);
350 __ CompareRoot(scratch, Heap::kTheHoleValueRootIndex);
432 Heap::kHashTableMapRootIndex);
454 Heap::kHashTableMapRootIndex);
693 __ CompareRoot(rdi, Heap::kFixedArrayMapRootIndex);
701 __ CompareRoot(rdi, Heap::kFixedDoubleArrayMapRootIndex);
728 __ CompareRoot(rdi, Heap::kFixedArrayMapRootIndex);
755 __ CompareRoot(rdi, Heap::kFixedDoubleArrayMapRootIndex);
769 __ CompareRoot(r9, Heap::kHeapNumberMapRootIndex)
1159 Heap* heap = masm->isolate()->heap(); local
    [all...]
builtins-x64.cc 153 // Now allocate the JSObject on the heap.
168 __ LoadRoot(rcx, Heap::kEmptyFixedArrayRootIndex);
176 __ LoadRoot(rdx, Heap::kUndefinedValueRootIndex);
189 __ LoadRoot(rdx, Heap::kOnePointerFillerMapRootIndex);
195 // failures need to undo the allocation, so that the heap is in a
238 __ LoadRoot(rcx, Heap::kFixedArrayMapRootIndex);
249 __ LoadRoot(rdx, Heap::kUndefinedValueRootIndex);
264 __ or_(rdi, Immediate(kHeapObjectTag)); // add the heap tag
272 // Undo the setting of the new top so that the heap is verifiable. For
334 masm->isolate()->heap()->SetConstructStubDeoptPCOffset(masm->pc_offset())
    [all...]
  /external/chromium_org/v8/src/arm/
builtins-arm.cc 158 masm->isolate()->heap()->undefined_value(),
232 __ LoadRoot(r3, Heap::kEmptyFixedArrayRootIndex);
275 __ LoadRoot(argument, Heap::kempty_stringRootIndex);
323 __ LoadRoot(ip, Heap::kStackLimitRootIndex);
419 // Now allocate the JSObject on the heap.
431 __ LoadRoot(r6, Heap::kEmptyFixedArrayRootIndex);
447 __ LoadRoot(r6, Heap::kUndefinedValueRootIndex);
461 __ LoadRoot(r6, Heap::kOnePointerFillerMapRootIndex);
468 // failures need to undo the allocation, so that the heap is in a
512 __ LoadRoot(r6, Heap::kFixedArrayMapRootIndex)
    [all...]
code-stubs-arm.cc 406 __ LoadRoot(r1, Heap::kFunctionContextMapRootIndex);
420 __ LoadRoot(r1, Heap::kUndefinedValueRootIndex);
454 __ LoadRoot(r2, Heap::kBlockContextMapRootIndex);
482 __ LoadRoot(r1, Heap::kTheHoleValueRootIndex);
765 // Smis. If it's not a heap number, then return equal.
782 __ LoadRoot(r2, Heap::kUndefinedValueRootIndex);
812 // It is a heap number, so return non-equal if it's NaN and equal if it's
864 // Lhs is a Smi. Check whether the rhs is a heap number.
    [all...]
  /external/chromium_org/v8/test/cctest/
test-serialize.cc 261 internal_isolate->heap()->CollectAllGarbage(Heap::kNoGCFlags, "serialize");
266 // Test that the whole heap can be serialized.
276 // Test that heap serialization is non-destructive.
288 // Tests that the heap can be deserialized.
299 CcTest::heap()->Verify();
303 CHECK(CcTest::heap()->string_table()->IsStringTable());
381 Heap* heap = isolate->heap(); local
532 Heap* heap = isolate->heap(); local
    [all...]
test-global-handles.cc 40 static bool CanSkipCallback(Heap* heap, Object** pointer) {
90 Heap* heap = CcTest::heap(); local
94 global_handles->Create(heap->AllocateFixedArray(1)->ToObjectChecked());
96 global_handles->Create(heap->AllocateFixedArray(1)->ToObjectChecked());
99 global_handles->Create(heap->AllocateFixedArray(1)->ToObjectChecked());
101 global_handles->Create(heap->AllocateFixedArray(1)->ToObjectChecked());
185 Heap* heap = CcTest::heap() local
280 Heap* heap = CcTest::heap(); local
    [all...]
  /art/runtime/gc/accounting/
mod_union_table.cc 23 #include "gc/heap.h"
149 Heap* heap = mod_union_table_->GetHeap(); local
152 space::ContinuousSpace* from_space = heap->FindContinuousSpaceFromObject(obj, false);
153 space::ContinuousSpace* to_space = heap->FindContinuousSpaceFromObject(ref, false);
191 Heap* heap = GetHeap(); local
194 CHECK(heap->IsLiveObjectLocked(ref));
199 CardTable* card_table = heap->GetCardTable();
207 auto* space = heap->FindContinuousSpaceFromObject(reinterpret_cast<Object*>(start), false)
237 Heap* heap = GetHeap(); local
    [all...]
card_table.h 37 class Heap;
44 // non-NULL values to heap addresses should go through an entry in
84 // Returns a value that when added to a heap address >> GC_CARD_SHIFT will address the appropriate
119 // Returns the first address in the heap which maps to this card.
122 // Returns the address of the relevant byte in the card table, given an address on the heap.
  /art/runtime/
runtime.h 30 #include "gc/heap.h"
43 class Heap;
277 gc::Heap* GetHeap() const {
452 gc::Heap* heap_;
thread-inl.h 128 gc::Heap* heap = Runtime::Current()->GetHeap(); local
129 if (heap->IsObjectValidationEnabled()) {
  /art/runtime/gc/collector/
garbage_collector.cc 36 GarbageCollector::GarbageCollector(Heap* heap, const std::string& name)
37 : heap_(heap),
39 verbose_(VLOG_IS_ON(heap)),
  /art/runtime/mirror/
object.cc 26 #include "gc/heap.h"
47 gc::Heap* heap = Runtime::Current()->GetHeap(); local
48 SirtRef<Object> copy(self, heap->AllocObject(self, c, num_bytes));
64 heap->WriteBarrierArray(copy.get(), 0, array->GetLength());
73 heap->WriteBarrierField(copy.get(), field_offset, ref);
79 heap->AddFinalizerReference(Thread::Current(), copy.get());
  /external/openfst/src/include/fst/
fst-decl.h 70 template <class T, class Compare, bool max> class Heap;

Completed in 653 milliseconds

1 2 34 5 6 7 8 91011>>