| /prebuilts/go/linux-x86/test/ |
| notinheap2.go | 25 // Heap allocation is not okay.
31 y = new(nih) // ERROR "heap allocation disallowed"
32 z = make([]nih, 1) // ERROR "heap allocation disallowed"
33 z = append(z, x) // ERROR "heap allocation disallowed"
|
| /system/core/libmemunreachable/ |
| Allocator.cpp | 168 Chunk(HeapImpl* heap, int bucket);
184 HeapImpl* heap() { return heap_; } function in class:android::Chunk
230 Chunk::Chunk(HeapImpl* heap, int bucket)
232 heap_(heap),
382 assert(chunk->heap() == this);
437 Heap::Heap() {
446 Heap::~Heap() {
452 void* Heap::allocate(size_t size)
[all...] |
| /art/runtime/gc/collector/ |
| sticky_mark_sweep.cc | 21 #include "gc/heap.h"
31 StickyMarkSweep::StickyMarkSweep(Heap* heap, bool is_concurrent, const std::string& name_prefix)
32 : PartialMarkSweep(heap, is_concurrent, name_prefix.empty() ? "sticky " : name_prefix) {
|
| /art/runtime/gc/ |
| reference_queue.h | 47 class Heap;
90 // registered to a reference queue are scheduled for appending by the heap worker thread.
|
| heap_test.cc | 33 Heap* heap = Runtime::Current()->GetHeap(); local
34 int64_t max_memory_before = heap->GetMaxMemory();
35 int64_t total_memory_before = heap->GetTotalMemory();
36 heap->ClearGrowthLimit();
37 int64_t max_memory_after = heap->GetMaxMemory();
38 int64_t total_memory_after = heap->GetTotalMemory();
88 // Exercise Heap::PreZygoteFork() to check it does not crash.
|
| /art/tools/ahat/src/heapdump/ |
| AhatSnapshot.java | 21 import com.android.tools.perflib.heap.ArrayInstance;
22 import com.android.tools.perflib.heap.ClassInstance;
23 import com.android.tools.perflib.heap.ClassObj;
24 import com.android.tools.perflib.heap.Heap;
25 import com.android.tools.perflib.heap.Instance;
26 import com.android.tools.perflib.heap.ProguardMap;
27 import com.android.tools.perflib.heap.RootObj;
28 import com.android.tools.perflib.heap.Snapshot;
29 import com.android.tools.perflib.heap.StackFrame
[all...] |
| /external/v8/src/ |
| handles.cc | 21 Heap* heap = heap_object->GetHeap(); local
22 Object** roots_array_start = heap->roots_array_start();
24 location_ < roots_array_start + Heap::kStrongRootListLength &&
25 heap->RootCanBeTreatedAsConstant(
26 static_cast<Heap::RootListIndex>(location_ - roots_array_start))) {
36 return !heap->isolate()->IsDeferredHandle(location_);
128 isolate->heap(), ZoneAllocationPolicy(&zone_));
150 return isolate_->heap()
151 ->root_handle(static_cast<Heap::RootListIndex>(index)
[all...] |
| /external/v8/src/snapshot/ |
| startup-serializer.h | 22 // Serialize the current state of the heap. The order is:
74 std::bitset<Heap::kStrongRootListLength> root_has_been_serialized_;
|
| /external/guava/guava/src/com/google/common/collect/ |
| MinMaxPriorityQueue.java | 63 * <a href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a>
65 * it stores elements in a single array, as compact as the traditional heap data
220 private final Heap minHeap;
221 private final Heap maxHeap;
229 this.minHeap = new Heap(ordering);
230 this.maxHeap = new Heap(ordering.reverse());
278 // Adds the element to the end of the heap and bubbles it up to the correct
372 * <p>Occasionally, in order to maintain the heap invariant, it must swap a
375 * first one is the element that was previously at the end of the heap and is
411 Heap heap = heapForIndex(index) local
539 Heap heap; local
[all...] |
| /external/v8/src/full-codegen/arm/ |
| full-codegen-arm.cc | 153 __ LoadRoot(r2, Heap::kRealStackLimitRootIndex);
159 __ LoadRoot(r9, Heap::kUndefinedValueRootIndex);
311 __ LoadRoot(ip, Heap::kStackLimitRootIndex);
332 __ LoadRoot(r0, Heap::kUndefinedValueRootIndex);
477 void FullCodeGenerator::EffectContext::Plug(Heap::RootListIndex index) const {
482 Heap::RootListIndex index) const {
488 Heap::RootListIndex index) const {
494 void FullCodeGenerator::TestContext::Plug(Heap::RootListIndex index) const {
499 if (index == Heap::kUndefinedValueRootIndex ||
500 index == Heap::kNullValueRootIndex |
[all...] |
| /external/v8/src/full-codegen/arm64/ |
| full-codegen-arm64.cc | 159 __ CompareRoot(x10, Heap::kRealStackLimitRootIndex);
164 __ LoadRoot(x10, Heap::kUndefinedValueRootIndex);
314 __ CompareRoot(jssp, Heap::kStackLimitRootIndex);
332 __ LoadRoot(x0, Heap::kUndefinedValueRootIndex);
468 void FullCodeGenerator::EffectContext::Plug(Heap::RootListIndex index) const {
474 Heap::RootListIndex index) const {
480 Heap::RootListIndex index) const {
486 void FullCodeGenerator::TestContext::Plug(Heap::RootListIndex index) const {
489 if (index == Heap::kUndefinedValueRootIndex ||
490 index == Heap::kNullValueRootIndex |
[all...] |
| /external/v8/src/full-codegen/mips/ |
| full-codegen-mips.cc | 162 __ LoadRoot(a2, Heap::kRealStackLimitRootIndex);
167 __ LoadRoot(t5, Heap::kUndefinedValueRootIndex);
322 __ LoadRoot(at, Heap::kStackLimitRootIndex);
341 __ LoadRoot(v0, Heap::kUndefinedValueRootIndex);
470 void FullCodeGenerator::EffectContext::Plug(Heap::RootListIndex index) const {
475 Heap::RootListIndex index) const {
481 Heap::RootListIndex index) const {
487 void FullCodeGenerator::TestContext::Plug(Heap::RootListIndex index) const {
492 if (index == Heap::kUndefinedValueRootIndex ||
493 index == Heap::kNullValueRootIndex |
[all...] |
| /external/v8/src/full-codegen/mips64/ |
| full-codegen-mips64.cc | 161 __ LoadRoot(a2, Heap::kRealStackLimitRootIndex);
166 __ LoadRoot(t1, Heap::kUndefinedValueRootIndex);
320 __ LoadRoot(at, Heap::kStackLimitRootIndex);
341 __ LoadRoot(v0, Heap::kUndefinedValueRootIndex);
470 void FullCodeGenerator::EffectContext::Plug(Heap::RootListIndex index) const {
475 Heap::RootListIndex index) const {
481 Heap::RootListIndex index) const {
487 void FullCodeGenerator::TestContext::Plug(Heap::RootListIndex index) const {
492 if (index == Heap::kUndefinedValueRootIndex ||
493 index == Heap::kNullValueRootIndex |
[all...] |
| /external/v8/src/full-codegen/ppc/ |
| full-codegen-ppc.cc | 160 __ LoadRoot(r5, Heap::kRealStackLimitRootIndex);
166 __ LoadRoot(ip, Heap::kUndefinedValueRootIndex);
318 __ LoadRoot(ip, Heap::kStackLimitRootIndex);
336 __ LoadRoot(r3, Heap::kUndefinedValueRootIndex);
464 void FullCodeGenerator::EffectContext::Plug(Heap::RootListIndex index) const {}
468 Heap::RootListIndex index) const {
474 Heap::RootListIndex index) const {
480 void FullCodeGenerator::TestContext::Plug(Heap::RootListIndex index) const {
483 if (index == Heap::kUndefinedValueRootIndex ||
484 index == Heap::kNullValueRootIndex |
[all...] |
| /external/v8/src/full-codegen/s390/ |
| full-codegen-s390.cc | 159 __ LoadRoot(r5, Heap::kRealStackLimitRootIndex);
165 __ LoadRoot(ip, Heap::kUndefinedValueRootIndex);
322 __ LoadRoot(ip, Heap::kStackLimitRootIndex);
340 __ LoadRoot(r2, Heap::kUndefinedValueRootIndex);
462 void FullCodeGenerator::EffectContext::Plug(Heap::RootListIndex index) const {}
465 Heap::RootListIndex index) const {
470 Heap::RootListIndex index) const {
475 void FullCodeGenerator::TestContext::Plug(Heap::RootListIndex index) const {
478 if (index == Heap::kUndefinedValueRootIndex ||
479 index == Heap::kNullValueRootIndex |
[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/full-codegen/x64/ |
| full-codegen-x64.cc | 18 #include "src/heap/heap-inl.h"
139 __ PushRoot(Heap::kUndefinedValueRootIndex);
145 __ CompareRoot(rcx, Heap::kRealStackLimitRootIndex);
150 __ LoadRoot(rax, Heap::kUndefinedValueRootIndex);
304 __ CompareRoot(rsp, Heap::kStackLimitRootIndex);
320 __ LoadRoot(rax, Heap::kUndefinedValueRootIndex);
439 void FullCodeGenerator::EffectContext::Plug(Heap::RootListIndex index) const {
444 Heap::RootListIndex index) const {
450 Heap::RootListIndex index) const
[all...] |
| /external/v8/src/heap/ |
| mark-compact.cc | 5 #include "src/heap/mark-compact.h"
17 #include "src/heap/array-buffer-tracker.h"
18 #include "src/heap/gc-tracer.h"
19 #include "src/heap/incremental-marking.h"
20 #include "src/heap/mark-compact-inl.h"
21 #include "src/heap/object-stats.h"
22 #include "src/heap/objects-visiting-inl.h"
23 #include "src/heap/objects-visiting.h"
24 #include "src/heap/page-parallel-job.h"
25 #include "src/heap/spaces-inl.h
1060 Heap* heap = isolate_->heap(); local
1156 Heap* heap = obj->GetHeap(); local
1245 Heap* heap = map->GetHeap(); local
2813 Heap* heap = this->heap(); local
3074 inline Heap* heap() { return collector_->heap(); } function in class:v8::MarkCompactCollector::Evacuator
3105 Heap* heap = page->heap(); local
3836 Heap* heap = this->heap(); local
[all...] |
| incremental-marking.cc | 5 #include "src/heap/incremental-marking.h"
10 #include "src/heap/gc-idle-time-handler.h"
11 #include "src/heap/gc-tracer.h"
12 #include "src/heap/heap-inl.h"
13 #include "src/heap/mark-compact-inl.h"
14 #include "src/heap/object-stats.h"
15 #include "src/heap/objects-visiting-inl.h"
16 #include "src/heap/objects-visiting.h"
23 IncrementalMarking::IncrementalMarking(Heap* heap
186 Heap* heap = map->GetHeap(); local
[all...] |
| remembered-set.h | 9 #include "src/heap/heap.h"
10 #include "src/heap/slot-set.h"
11 #include "src/heap/spaces.h"
103 static void Iterate(Heap* heap, Callback callback) {
105 heap, [callback](MemoryChunk* chunk) { Iterate(chunk, callback); });
111 static void IterateMemoryChunks(Heap* heap, Callback callback) {
112 MemoryChunkIterator it(heap);
[all...] |
| heap.h | 11 // Clients of this interface shouldn't depend on lots of heap internals.
12 // Do not include anything from src/heap here!
19 #include "src/heap-symbols.h"
28 // Defines all the roots in Heap.
254 // Heap roots that are known to be immortal immovable, for which we can safely
398 explicit PromotionQueue(Heap* heap)
403 heap_(heap) {}
440 Heap* heap_;
529 class Heap {
[all...] |
| array-buffer-tracker.cc | 5 #include "src/heap/array-buffer-tracker.h"
6 #include "src/heap/array-buffer-tracker-inl.h"
7 #include "src/heap/heap.h"
78 void ArrayBufferTracker::FreeDeadInNewSpace(Heap* heap) {
79 DCHECK_EQ(heap->gc_state(), Heap::HeapState::SCAVENGE);
80 for (Page* page : PageRange(heap->new_space()->FromSpaceStart(),
81 heap->new_space()->FromSpaceEnd()))
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.ddms/src/com/android/ide/eclipse/ddms/i18n/ |
| messages.properties | 54 DeviceView_Update_Heap=Update Heap
55 DeviceView_Update_Heap_Tooltip=Update Heap
95 PreferencePage_Heap_Updates_Enabled_Default=Heap updates enabled by default
|
| /external/v8/src/builtins/ |
| builtins-constructor.cc | 142 StoreMapNoWriteBarrier(literals_cell, Heap::kOneClosureCellMapRootIndex);
146 StoreMapNoWriteBarrier(literals_cell, Heap::kManyClosuresCellMapRootIndex);
246 Node* empty_array = LoadRoot(Heap::kEmptyFixedArrayRootIndex);
266 instance_size, Heap::kUndefinedValueRootIndex);
291 Heap::kOnePointerFillerMapRootIndex);
295 used_size, Heap::kUndefinedValueRootIndex);
311 Heap::kOnePointerFillerMapRootIndex);
315 used_size, Heap::kUndefinedValueRootIndex);
338 Heap::RootListIndex context_type;
341 context_type = Heap::kEvalContextMapRootIndex
[all...] |
| /external/v8/src/ic/ |
| ic-inl.h | 65 Heap* heap = target->GetHeap(); local
68 Assembler::set_target_address_at(heap->isolate(), address, constant_pool,
70 if (heap->gc_state() == Heap::MARK_COMPACT) {
71 heap->mark_compact_collector()->RecordCodeTargetPatch(address, target);
73 heap->incremental_marking()->RecordCodeTargetPatch(address, target);
|
