| /external/v8/test/cctest/ |
| test-mark-compact.cc | 89 HEAP->ConfigureHeap(2*256*KB, 8*MB, 8*MB);
99 Object* obj = HEAP->AllocateFixedArray(array_size)->ToObjectChecked();
104 CHECK(HEAP->InSpace(*array, NEW_SPACE));
107 HEAP->CollectGarbage(OLD_POINTER_SPACE);
110 CHECK(HEAP->InSpace(*array, OLD_POINTER_SPACE));
115 HEAP->ConfigureHeap(2*256*KB, 8*MB, 8*MB);
123 // Do a mark compact GC to shrink the heap.
124 HEAP->CollectGarbage(OLD_POINTER_SPACE);
128 Min(Page::kMaxNonCodeHeapObjectSize, HEAP->MaxObjectSizeInNewSpace());
131 Object* obj = i::Isolate::Current()->heap()->AllocateFixedArray(length)-
[all...] |
| test-heap.cc | 27 CHECK(HEAP->Contains(map));
29 CHECK_EQ(HEAP->meta_map(), map->map());
37 CheckMap(HEAP->meta_map(), MAP_TYPE, Map::kSize);
38 CheckMap(HEAP->heap_number_map(), HEAP_NUMBER_TYPE, HeapNumber::kSize);
39 CheckMap(HEAP->fixed_array_map(), FIXED_ARRAY_TYPE, kVariableSizeSentinel);
40 CheckMap(HEAP->string_map(), STRING_TYPE, kVariableSizeSentinel);
61 Object* obj = HEAP->NumberFromDouble(value)->ToObjectChecked();
79 Object* code = HEAP->CreateCode(
82 Handle<Object>(HEAP->undefined_value()))->ToObjectChecked();
89 Object* found = HEAP->FindCodeObject(obj_addr + i)
[all...] |
| test-dictionary.cc | 51 CHECK_EQ(table->Lookup(*b), HEAP->undefined_value());
54 HEAP->CollectGarbage(NEW_SPACE);
57 CHECK_EQ(table->Lookup(*b), HEAP->undefined_value());
68 CHECK_EQ(table->Lookup(*a), HEAP->undefined_value());
88 CHECK_EQ(table->Lookup(*key), HEAP->undefined_value());
96 CHECK_EQ(table->Lookup(*key), HEAP->undefined_value());
97 CHECK_EQ(key->GetIdentityHash(OMIT_CREATION), HEAP->undefined_value());
109 // Simulate a full heap so that generating an identity hash code
132 // Simulate a full heap so that generating an identity hash code
|
| /external/chromium_org/v8/test/cctest/ |
| test-mark-compact.cc | 84 HEAP->ConfigureHeap(2*256*KB, 8*MB, 8*MB);
94 Object* obj = HEAP->AllocateFixedArray(array_size)->ToObjectChecked();
99 CHECK(HEAP->InSpace(*array, NEW_SPACE));
102 HEAP->CollectGarbage(OLD_POINTER_SPACE);
105 CHECK(HEAP->InSpace(*array, OLD_POINTER_SPACE));
110 HEAP->ConfigureHeap(2*256*KB, 8*MB, 8*MB);
118 // Do a mark compact GC to shrink the heap.
119 HEAP->CollectGarbage(OLD_POINTER_SPACE);
124 Object* obj = i::Isolate::Current()->heap()->AllocateFixedArray(length)->
130 CHECK(HEAP->InSpace(*array, NEW_SPACE))
[all...] |
| test-heap.cc | 45 MarkCompactCollector* collector = HEAP->mark_compact_collector();
46 IncrementalMarking* marking = HEAP->incremental_marking();
65 CHECK(HEAP->Contains(map));
67 CHECK_EQ(HEAP->meta_map(), map->map());
75 CheckMap(HEAP->meta_map(), MAP_TYPE, Map::kSize);
76 CheckMap(HEAP->heap_number_map(), HEAP_NUMBER_TYPE, HeapNumber::kSize);
77 CheckMap(HEAP->fixed_array_map(), FIXED_ARRAY_TYPE, kVariableSizeSentinel);
78 CheckMap(HEAP->string_map(), STRING_TYPE, kVariableSizeSentinel);
100 Object* obj = HEAP->NumberFromDouble(value)->ToObjectChecked();
119 Heap* heap = isolate->heap() local
150 Heap* heap = isolate->heap(); local
251 Heap* heap = isolate->heap(); local
356 Heap* heap = isolate->heap(); local
409 Heap* heap = isolate->heap(); local
450 Heap* heap = isolate->heap(); local
496 Heap* heap = isolate->heap(); local
1225 Heap* heap = isolate->heap(); local
1320 Heap* heap = isolate->heap(); local
1424 Heap* heap = isolate->heap(); local
1590 Heap* heap = new_space->heap(); local
2683 Heap* heap = Isolate::Current()->heap(); local
2971 Heap* heap = isolate->heap(); local
3034 Heap* heap = isolate->heap(); local
3096 Heap* heap = isolate->heap(); local
3155 Heap* heap = isolate->heap(); local
3316 Heap* heap = isolate->heap(); local
3372 Heap* heap = isolate->heap(); local
3429 Heap* heap = isolate->heap(); local
[all...] |
| test-dictionary.cc | 53 CHECK_EQ(table->Lookup(*b), HEAP->the_hole_value());
56 HEAP->CollectGarbage(NEW_SPACE);
59 CHECK_EQ(table->Lookup(*b), HEAP->the_hole_value());
70 CHECK_EQ(table->Lookup(*a), HEAP->the_hole_value());
90 CHECK_EQ(table->Lookup(*key), HEAP->the_hole_value());
98 CHECK_EQ(table->Lookup(*key), HEAP->the_hole_value());
99 CHECK_EQ(key->GetIdentityHash(OMIT_CREATION), HEAP->undefined_value());
120 // Simulate a full heap so that generating an identity hash code
122 SimulateFullSpace(HEAP->new_space());
123 SimulateFullSpace(HEAP->old_pointer_space())
[all...] |
| test-symbols.cc | 40 HEAP->PerformScavenge();
41 HEAP->CollectAllGarbage(Heap::kNoGCFlags);
|
| /external/chromium_org/v8/src/extensions/ |
| gc-extension.cc | 43 HEAP->CollectGarbage(NEW_SPACE, "gc extension");
45 HEAP->CollectAllGarbage(Heap::kNoGCFlags, "gc extension");
|
| /external/v8/src/ |
| liveobjectlist.h | 34 #include "heap.h"
58 // objects in the JS heap, as well as is the data structure which represents
155 // Mask out the low bit that marks this as a heap object. We'll use this
234 // Based on Heap::ScavengeObject() but only does forwarding of pointers
238 if (!HEAP->InNewSpace(object)) return;
241 ASSERT(HEAP->InFromSpace(heap_obj));
243 // We use the first word (where the map pointer usually is) of a heap
274 inline static MaybeObject* Capture() { return HEAP->undefined_value(); }
281 return HEAP->undefined_value();
284 return HEAP->undefined_value()
[all...] |
| heap-inl.h | 31 #include "heap.h"
72 SemiSpace::AssertValidRange(HEAP->new_space()->top(),
85 MaybeObject* Heap::AllocateStringFromUtf8(Vector<const char> str,
98 MaybeObject* Heap::AllocateSymbol(Vector<const char> str,
107 MaybeObject* Heap::AllocateAsciiSymbol(Vector<const char> str,
141 MaybeObject* Heap::AllocateTwoByteSymbol(Vector<const uc16> str,
173 MaybeObject* Heap::CopyFixedArray(FixedArray* src) {
178 MaybeObject* Heap::CopyFixedDoubleArray(FixedDoubleArray* src) {
183 MaybeObject* Heap::AllocateRaw(int size_in_bytes,
194 Heap::allocation_timeout_-- <= 0)
[all...] |
| /external/v8/src/extensions/ |
| gc-extension.cc | 43 HEAP->CollectAllGarbage(Heap::kNoGCFlags, "gc extension");
|
| /external/valgrind/main/gdbserver_tests/ |
| mcclean_after_fork.stderr.exp | 8 HEAP SUMMARY:
10 total heap usage: 0 allocs, 0 frees, 0 bytes allocated
|
| mcmain_pic.stderr.exp | 6 HEAP SUMMARY:
8 total heap usage: 1 allocs, 0 frees, 16 bytes allocated
|
| /external/valgrind/main/memcheck/tests/ |
| accounting.stderr.exp | 4 HEAP SUMMARY:
6 total heap usage: 1 allocs, 1 frees, 1 bytes allocated
|
| brk2.stderr.exp | 3 HEAP SUMMARY:
5 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| bug287260.stderr.exp | 4 HEAP SUMMARY:
6 total heap usage: 0 allocs, 0 frees, 0 bytes allocated
|
| erringfds.stderr.exp | 4 HEAP SUMMARY:
6 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| leak-pool-0.stderr.exp | 3 HEAP SUMMARY:
5 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| leak-pool-1.stderr.exp | 3 HEAP SUMMARY:
5 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| leak-pool-2.stderr.exp | 3 HEAP SUMMARY:
5 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| leak-pool-3.stderr.exp | 3 HEAP SUMMARY:
5 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| leak-pool-4.stderr.exp | 3 HEAP SUMMARY:
5 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| leak-pool-5.stderr.exp | 3 HEAP SUMMARY:
5 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| /external/valgrind/main/memcheck/tests/linux/ |
| brk.stderr.exp | 3 HEAP SUMMARY:
5 total heap usage: ... allocs, ... frees, ... bytes allocated
|
| capget.stderr.exp | 7 HEAP SUMMARY:
9 total heap usage: ... allocs, ... frees, ... bytes allocated
|
