| /external/chromium_org/v8/src/ |
| objects-visiting-inl.h | 112 Heap* heap = map->GetHeap(); local
118 heap,
122 heap,
250 Heap* heap, Address entry_address) {
252 heap->mark_compact_collector()->RecordCodeEntrySlot(entry_address, code);
253 StaticVisitor::MarkObject(heap, code);
259 Heap* heap, RelocInfo* rinfo)
344 Heap* heap = map->GetHeap(); local
367 Heap* heap = map->GetHeap(); local
391 Heap* heap = map->GetHeap(); local
416 Heap* heap = map->GetHeap(); local
431 Heap* heap = map->GetHeap(); local
479 Heap* heap = map->GetHeap(); local
495 Heap* heap = map->GetHeap(); local
544 Heap* heap = map->GetHeap(); local
[all...] |
| heap-profiler.h | 31 #include "heap-snapshot-generator-inl.h"
42 explicit HeapProfiler(Heap* heap);
88 Heap* heap() const { return ids_->heap(); } function in class:v8::internal::HeapProfiler
|
| store-buffer.h | 55 explicit StoreBuffer(Heap* heap);
67 // This is used by the heap traversal to enter the addresses into the store
134 Heap* heap_;
228 explicit StoreBufferRebuildScope(Heap* heap,
236 (*callback)(heap, NULL, kStoreBufferStartScanningPagesEvent);
|
| mark-compact.h | 37 // Callback function, returns whether an object is alive. The heap size
52 explicit Marking(Heap* heap)
53 : heap_(heap) {
165 Heap* heap_;
196 // heap.
271 // - Typed slots are expected to contain an encoded pointer to a heap
327 void UpdateSlots(Heap* heap);
329 void UpdateSlotsWithFilter(Heap* heap)
616 inline Heap* heap() const { return heap_; } function in class:v8::internal::MarkCompactCollector
[all...] |
| lithium-codegen.h | 53 Heap* heap() const { return isolate()->heap(); } function in class:v8::internal::BASE_EMBEDDED
|
| spaces-inl.h | 31 #include "heap-profiler.h"
163 Page* Page::Initialize(Heap* heap,
173 heap->incremental_marking()->SetOldSpacePageFlags(chunk);
198 MemoryChunk* MemoryChunk::FromAnyPointerAddress(Heap* heap, Address addr) {
202 LargeObjectIterator iterator(heap->lo_space());
231 PointerChunkIterator::PointerChunkIterator(Heap* heap)
233 old_pointer_iterator_(heap->old_pointer_space())
357 Heap* heap = object->GetHeap(); local
[all...] |
| /art/runtime/gc/collector/ |
| sticky_mark_sweep.cc | 17 #include "gc/heap.h"
27 StickyMarkSweep::StickyMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix)
28 : PartialMarkSweep(heap, is_concurrent,
|
| /dalvik/hit/src/com/android/hit/ |
| Queries.java | 78 for (Heap heap: state.mHeaps.values()) {
79 classes.addAll(heap.mClassesById.values());
202 for (Heap heap: state.mHeaps.values()) {
203 result.addAll(heap.mRoots);
212 for (Heap newHeap: newer.mHeaps.values()) {
213 Heap oldHeap = older.getHeap(newHeap.mName);
223 * If this instance wasn't in the old heap, or was there,
|
| /external/chromium_org/v8/src/extensions/ |
| gc-extension.cc | 45 isolate->heap()->CollectGarbage(NEW_SPACE, "gc extension");
47 isolate->heap()->CollectAllGarbage(Heap::kNoGCFlags, "gc extension");
|
| /external/v8/src/ |
| store-buffer.h | 51 explicit StoreBuffer(Heap* heap);
63 // This is used by the heap traversal to enter the addresses into the store
126 Heap* heap_;
210 explicit StoreBufferRebuildScope(Heap* heap,
213 : heap_(heap),
219 (*callback)(heap, NULL, kStoreBufferStartScanningPagesEvent);
229 Heap* heap_;
|
| mark-compact.h | 37 // Callback function, returns whether an object is alive. The heap size
51 explicit Marking(Heap* heap)
52 : heap_(heap) {
164 Heap* heap_;
196 // heap.
271 // - Typed slots are expected to contain an encoded pointer to a heap
307 void UpdateSlots(Heap* heap);
309 void UpdateSlotsWithFilter(Heap* heap)
468 inline Heap* heap() const { return heap_; } function in class:v8::internal::MarkCompactCollector
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-weaktypedarrays.cc | 32 #include "heap.h"
44 static int CountArrayBuffersInWeakList(Heap* heap) {
46 for (Object* o = heap->array_buffers_list();
55 static bool HasArrayBufferInWeakList(Heap* heap, JSArrayBuffer* ab) {
56 for (Object* o = heap->array_buffers_list();
92 int start = CountArrayBuffersInWeakList(isolate->heap());
104 CHECK_EQ(2, CountArrayBuffersInWeakList(isolate->heap()) - start);
105 CHECK(HasArrayBufferInWeakList(isolate->heap(), *iab1))
[all...] |
| test-heap.cc | 45 MarkCompactCollector* collector = CcTest::heap()->mark_compact_collector();
46 IncrementalMarking* marking = CcTest::heap()->incremental_marking();
65 CHECK(CcTest::heap()->Contains(map));
67 CHECK_EQ(CcTest::heap()->meta_map(), map->map());
75 Heap* heap = CcTest::heap(); local
76 CheckMap(heap->meta_map(), MAP_TYPE, Map::kSize);
77 CheckMap(heap->heap_number_map(), HEAP_NUMBER_TYPE, HeapNumber::kSize);
78 CheckMap(heap->fixed_array_map(), FIXED_ARRAY_TYPE, kVariableSizeSentinel)
123 Heap* heap = isolate->heap(); local
154 Heap* heap = isolate->heap(); local
254 Heap* heap = isolate->heap(); local
355 Heap* heap = isolate->heap(); local
408 Heap* heap = isolate->heap(); local
449 Heap* heap = isolate->heap(); local
495 Heap* heap = isolate->heap(); local
957 Heap* heap = isolate->heap(); local
1291 Heap* heap = isolate->heap(); local
1386 Heap* heap = isolate->heap(); local
1490 Heap* heap = isolate->heap(); local
1656 Heap* heap = new_space->heap(); local
1671 Heap* heap = CcTest::heap(); local
1722 Heap* heap = CcTest::heap(); local
2667 Heap* heap = isolate->heap(); local
2761 Heap* heap = CcTest::heap(); local
3048 Heap* heap = isolate->heap(); local
3112 Heap* heap = isolate->heap(); local
3174 Heap* heap = isolate->heap(); local
3223 Heap* heap = isolate->heap(); local
3384 Heap* heap = isolate->heap(); local
3440 Heap* heap = isolate->heap(); local
3497 Heap* heap = isolate->heap(); local
3581 v8::internal::Heap* heap = CcTest::heap(); local
[all...] |
| test-constantpool.cc | 17 Heap* heap = isolate->heap(); local
46 heap->CollectGarbage(NEW_SPACE);
|
| test-symbols.cc | 40 CcTest::heap()->PerformScavenge();
41 CcTest::heap()->CollectAllGarbage(Heap::kNoGCFlags);
|
| /dalvik/vm/alloc/ |
| HeapSource.cpp | 26 #include "alloc/Heap.h"
40 /* How long to wait after a GC before performing a heap trim
62 struct Heap {
67 /* The largest size that this heap is allowed to grow to.
87 * The lowest address of this heap, inclusive.
92 * The highest address of this heap, exclusive.
97 * If the heap has an mspace, the current high water mark in
104 /* Target ideal heap utilization ratio; range 1..HEAP_UTILIZATION_MAX
108 /* The starting heap size.
112 /* The largest that the heap source as a whole is allowed to grow
260 const Heap *const heap = &hs->heaps[i]; local
334 Heap* heap = NULL; local
425 Heap heap; local
778 Heap *const heap = &hs->heaps[i]; local
803 Heap *const heap = &hs->heaps[i]; local
923 Heap* heap = hs2heap(hs); local
1023 Heap* heap = hs2heap(hs); local
1080 Heap* heap = ptr2heap(gHs, *ptrs); local
1139 Heap *heap = ptr2heap(hs, obj); local
1161 Heap* heap = ptr2heap(gHs, ptr); local
1385 Heap* heap = hs2heap(hs); local
1454 Heap *heap = &hs->heaps[i]; local
[all...] |
| /external/v8/src/arm/ |
| codegen-arm.cc | 115 __ CompareRoot(r4, Heap::kEmptyFixedArrayRootIndex);
127 // r6: destination FixedDoubleArray, not tagged as heap object
129 __ LoadRoot(r9, Heap::kFixedDoubleArrayMapRootIndex);
216 // Restore a "smi-untagged" heap object.
219 __ CompareRoot(r9, Heap::kTheHoleValueRootIndex);
249 __ CompareRoot(r4, Heap::kEmptyFixedArrayRootIndex);
262 // r6: destination FixedArray, not tagged as heap object
264 __ LoadRoot(r9, Heap::kFixedArrayMapRootIndex);
273 __ LoadRoot(r7, Heap::kTheHoleValueRootIndex);
274 __ LoadRoot(r9, Heap::kHeapNumberMapRootIndex)
[all...] |
| full-codegen-arm.cc | 161 __ LoadRoot(r2, Heap::kUndefinedValueRootIndex);
177 __ LoadRoot(ip, Heap::kUndefinedValueRootIndex);
290 __ LoadRoot(ip, Heap::kStackLimitRootIndex);
308 __ LoadRoot(r0, Heap::kUndefinedValueRootIndex);
369 __ LoadRoot(ip, Heap::kStackLimitRootIndex);
489 void FullCodeGenerator::EffectContext::Plug(Heap::RootListIndex index) const {
494 Heap::RootListIndex index) const {
500 Heap::RootListIndex index) const {
506 void FullCodeGenerator::TestContext::Plug(Heap::RootListIndex index) const {
511 if (index == Heap::kUndefinedValueRootIndex |
[all...] |
| /art/runtime/gc/ |
| heap_test.cc | 31 Heap* heap = Runtime::Current()->GetHeap(); local
32 int64_t max_memory_before = heap->GetMaxMemory();
33 int64_t total_memory_before = heap->GetTotalMemory();
34 heap->ClearGrowthLimit();
35 int64_t max_memory_after = heap->GetMaxMemory();
36 int64_t total_memory_after = heap->GetTotalMemory();
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| fst-decl.h | 55 template <class T, class Compare> class Heap;
|
| /external/guava/guava/src/com/google/common/collect/ |
| MinMaxPriorityQueue.java | 62 * <a href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a>
64 * it stores elements in a single array, as compact as the traditional heap data
219 private final Heap minHeap;
220 private final Heap maxHeap;
228 this.minHeap = new Heap(ordering);
229 this.maxHeap = new Heap(ordering.reverse());
277 // Adds the element to the end of the heap and bubbles it up to the correct
371 * <p>Occasionally, in order to maintain the heap invariant, it must swap a
374 * first one is the element that was previously at the end of the heap and is
410 Heap heap = heapForIndex(index) local
538 Heap heap; local
[all...] |
| /external/opencv/cv/src/ |
| cvinpaint.cpp | 207 //HEAP::iterator Heap_Iterator;
208 //HEAP Heap;
237 icvCalcFMM(const CvMat *f, CvMat *t, CvPriorityQueueFloat *Heap, bool negate) {
241 while (Heap->Pop(&ii,&jj)) {
261 Heap->Push(i,j,dist);
280 icvTeleaInpaintFMM(const CvMat *f, CvMat *t, CvMat *out, int range, CvPriorityQueueFloat *Heap ) {
286 while (Heap->Pop(&ii,&jj)) {
392 Heap->Push(i,j,dist);
399 while (Heap->Pop(&ii,&jj))
[all...] |
| /external/v8/src/mips/ |
| full-codegen-mips.cc | 168 __ LoadRoot(a2, Heap::kUndefinedValueRootIndex);
184 __ LoadRoot(at, Heap::kUndefinedValueRootIndex);
297 __ LoadRoot(t0, Heap::kStackLimitRootIndex);
314 __ LoadRoot(v0, Heap::kUndefinedValueRootIndex);
379 __ LoadRoot(t0, Heap::kStackLimitRootIndex);
497 void FullCodeGenerator::EffectContext::Plug(Heap::RootListIndex index) const {
502 Heap::RootListIndex index) const {
508 Heap::RootListIndex index) const {
514 void FullCodeGenerator::TestContext::Plug(Heap::RootListIndex index) const {
519 if (index == Heap::kUndefinedValueRootIndex |
[all...] |
| /external/v8/src/x64/ |
| codegen-x64.cc | 137 // the V8 heap. We can't, and don't, refer to any relocatable addresses
259 __ CompareRoot(r8, Heap::kEmptyFixedArrayRootIndex);
266 Heap::kFixedCOWArrayMapRootIndex);
280 __ LoadRoot(rdi, Heap::kFixedDoubleArrayMapRootIndex);
309 __ LoadRoot(rdi, Heap::kFixedDoubleArrayMapRootIndex);
353 __ CompareRoot(rbx, Heap::kTheHoleValueRootIndex);
380 __ CompareRoot(r8, Heap::kEmptyFixedArrayRootIndex);
392 __ LoadRoot(rdi, Heap::kFixedArrayMapRootIndex);
399 __ LoadRoot(rdi, Heap::kTheHoleValueRootIndex);
410 // Box doubles into heap numbers
[all...] |
| full-codegen-x64.cc | 136 MaybeObject* maybe_cell = isolate()->heap()->AllocateJSGlobalPropertyCell(
168 __ LoadRoot(kScratchRegister, Heap::kUndefinedValueRootIndex);
186 __ PushRoot(Heap::kUndefinedValueRootIndex);
188 __ LoadRoot(rdx, Heap::kUndefinedValueRootIndex);
297 __ CompareRoot(rsp, Heap::kStackLimitRootIndex);
314 __ LoadRoot(rax, Heap::kUndefinedValueRootIndex);
329 __ CompareRoot(rsp, Heap::kStackLimitRootIndex);
421 void FullCodeGenerator::EffectContext::Plug(Heap::RootListIndex index) const {
426 Heap::RootListIndex index) const {
432 Heap::RootListIndex index) const
1521 Heap* heap = isolate()->heap(); local
[all...] |
