| /system/libhidl/transport/allocator/1.0/utils/include/hidlmemory/ |
| FrameworkUtils.h | 31 sp<HidlMemory> fromHeap(const sp<IMemoryHeap>& heap);
|
| /prebuilts/go/darwin-x86/test/ |
| escape_iface.go | 18 sink = m // ERROR "m escapes to heap"
40 i := 0 // ERROR "moved to heap: i"
41 v := M0{&i} // ERROR "&i escapes to heap"
42 var x M = v // ERROR "v escapes to heap"
43 sink = x // ERROR "x escapes to heap"
53 i := 0 // ERROR "moved to heap: i"
54 v := M0{&i} // ERROR "&i escapes to heap"
55 // BAD: v does not escape to heap here
56 var x M = v // ERROR "v escapes to heap"
58 sink = v1 // ERROR "v1 escapes to heap"
[all...] |
| escape_struct_param1.go | 38 s := "cat" // ERROR "moved to heap: s$"
39 ps := &s // ERROR "&s escapes to heap$"
46 s := "cat" // ERROR "moved to heap: s$"
47 ps := &s // ERROR "&s escapes to heap$"
55 s := "cat" // ERROR "moved to heap: s$"
56 ps := &s // ERROR "&s escapes to heap$" "moved to heap: ps$"
57 pps := &ps // ERROR "&ps escapes to heap$"
117 s2 := "bat" // ERROR "moved to heap: s2$"
118 s3 := "cat" // ERROR "moved to heap: s3$
[all...] |
| escape_struct_param2.go | 38 s := "cat" // ERROR "moved to heap: s$"
39 ps := &s // ERROR "&s escapes to heap$"
46 s := "cat" // ERROR "moved to heap: s$"
47 ps := &s // ERROR "&s escapes to heap$"
55 s := "cat" // ERROR "moved to heap: s$"
56 ps := &s // ERROR "&s escapes to heap$" "moved to heap: ps$"
57 pps := &ps // ERROR "&ps escapes to heap$"
117 s2 := "bat" // ERROR "moved to heap: s2$"
118 s3 := "cat" // ERROR "moved to heap: s3$
[all...] |
| escape_slice.go | 21 i := 0 // ERROR "moved to heap: i"
22 s = append(s, &i) // ERROR "&i escapes to heap"
28 i := 0 // ERROR "moved to heap: i"
29 s = append(s, &i) // ERROR "&i escapes to heap"
35 i := 0 // ERROR "moved to heap: i"
36 s = append(s, &i) // ERROR "&i escapes to heap"
42 i := 0 // ERROR "moved to heap: i"
43 s = append(s, &i) // ERROR "&i escapes to heap"
51 i := 0 // ERROR "moved to heap: i"
52 s[0] = &i // ERROR "&i escapes to heap"
[all...] |
| escape4.go | 14 func alloc(x int) *int { // ERROR "can inline alloc" "moved to heap: x"
15 return &x // ERROR "&x escapes to heap"
21 p = alloc(2) // ERROR "inlining call to alloc" "&x escapes to heap" "moved to heap: x"
27 }() // ERROR "inlining call to f1.func1" "inlining call to alloc" "&x escapes to heap" "moved to heap: x"
29 f = func() { // ERROR "func literal escapes to heap" "can inline f1.func2"
30 p = alloc(3) // ERROR "inlining call to alloc" "&x escapes to heap" "moved to heap: x"
45 t := new(T) // ERROR "new.T. escapes to heap"
[all...] |
| /prebuilts/go/linux-x86/test/ |
| escape_iface.go | 18 sink = m // ERROR "m escapes to heap"
40 i := 0 // ERROR "moved to heap: i"
41 v := M0{&i} // ERROR "&i escapes to heap"
42 var x M = v // ERROR "v escapes to heap"
43 sink = x // ERROR "x escapes to heap"
53 i := 0 // ERROR "moved to heap: i"
54 v := M0{&i} // ERROR "&i escapes to heap"
55 // BAD: v does not escape to heap here
56 var x M = v // ERROR "v escapes to heap"
58 sink = v1 // ERROR "v1 escapes to heap"
[all...] |
| escape_struct_param1.go | 38 s := "cat" // ERROR "moved to heap: s$"
39 ps := &s // ERROR "&s escapes to heap$"
46 s := "cat" // ERROR "moved to heap: s$"
47 ps := &s // ERROR "&s escapes to heap$"
55 s := "cat" // ERROR "moved to heap: s$"
56 ps := &s // ERROR "&s escapes to heap$" "moved to heap: ps$"
57 pps := &ps // ERROR "&ps escapes to heap$"
117 s2 := "bat" // ERROR "moved to heap: s2$"
118 s3 := "cat" // ERROR "moved to heap: s3$
[all...] |
| escape_struct_param2.go | 38 s := "cat" // ERROR "moved to heap: s$"
39 ps := &s // ERROR "&s escapes to heap$"
46 s := "cat" // ERROR "moved to heap: s$"
47 ps := &s // ERROR "&s escapes to heap$"
55 s := "cat" // ERROR "moved to heap: s$"
56 ps := &s // ERROR "&s escapes to heap$" "moved to heap: ps$"
57 pps := &ps // ERROR "&ps escapes to heap$"
117 s2 := "bat" // ERROR "moved to heap: s2$"
118 s3 := "cat" // ERROR "moved to heap: s3$
[all...] |
| escape_slice.go | 21 i := 0 // ERROR "moved to heap: i"
22 s = append(s, &i) // ERROR "&i escapes to heap"
28 i := 0 // ERROR "moved to heap: i"
29 s = append(s, &i) // ERROR "&i escapes to heap"
35 i := 0 // ERROR "moved to heap: i"
36 s = append(s, &i) // ERROR "&i escapes to heap"
42 i := 0 // ERROR "moved to heap: i"
43 s = append(s, &i) // ERROR "&i escapes to heap"
51 i := 0 // ERROR "moved to heap: i"
52 s[0] = &i // ERROR "&i escapes to heap"
[all...] |
| escape4.go | 14 func alloc(x int) *int { // ERROR "can inline alloc" "moved to heap: x"
15 return &x // ERROR "&x escapes to heap"
21 p = alloc(2) // ERROR "inlining call to alloc" "&x escapes to heap" "moved to heap: x"
27 }() // ERROR "inlining call to f1.func1" "inlining call to alloc" "&x escapes to heap" "moved to heap: x"
29 f = func() { // ERROR "func literal escapes to heap" "can inline f1.func2"
30 p = alloc(3) // ERROR "inlining call to alloc" "&x escapes to heap" "moved to heap: x"
45 t := new(T) // ERROR "new.T. escapes to heap"
[all...] |
| /external/python/cpython3/Lib/ |
| heapq.py | 0 """Heap queue algorithm (a.k.a. priority queue).
6 property of a heap is that a[0] is always its smallest element.
10 heap = [] # creates an empty heap
11 heappush(heap, item) # pushes a new item on the heap
12 item = heappop(heap) # pops the smallest item from the heap
13 item = heap[0] # smallest item on the heap without popping i
[all...] |
| /prebuilts/go/darwin-x86/test/fixedbugs/ |
| issue12006.go | 18 // Append forces heap allocation and copies entries in vals to heap, therefore they escape to heap.
46 var i, j, k int // ERROR "moved to heap: i" "moved to heap: j" "moved to heap: k"
47 FooNx(&k, &i, &j) // ERROR "&k escapes to heap" "&i escapes to heap" "&j escapes to heap" "TFooNx ... argument does not escape"
53 var i, j, k int // ERROR "moved to heap: i" "moved to heap: j" "moved to heap: k
[all...] |
| /prebuilts/go/linux-x86/test/fixedbugs/ |
| issue12006.go | 18 // Append forces heap allocation and copies entries in vals to heap, therefore they escape to heap.
46 var i, j, k int // ERROR "moved to heap: i" "moved to heap: j" "moved to heap: k"
47 FooNx(&k, &i, &j) // ERROR "&k escapes to heap" "&i escapes to heap" "&j escapes to heap" "TFooNx ... argument does not escape"
53 var i, j, k int // ERROR "moved to heap: i" "moved to heap: j" "moved to heap: k
[all...] |
| /art/runtime/gc/accounting/ |
| mod_union_table-inl.h | 32 Heap* heap,
34 : ModUnionTableReferenceCache(name, heap, space) {}
|
| /device/linaro/bootloader/arm-trusted-firmware/drivers/auth/mbedtls/ |
| mbedtls_common.c | 15 * mbed TLS heap
23 static unsigned char heap[MBEDTLS_HEAP_SIZE]; variable
33 /* Initialize the mbed TLS heap */
34 mbedtls_memory_buffer_alloc_init(heap, MBEDTLS_HEAP_SIZE);
|
| /external/valgrind/massif/tests/ |
| basic2.post.exp | 36 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
39 00.00% (0B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
42 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
45 98.04% (3,600B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
49 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B)
52 98.04% (7,600B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc.
56 n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B
[all...] |
| /external/v8/src/heap/ |
| scavenger-inl.h | 8 #include "src/heap/scavenger.h"
14 DCHECK(object->GetIsolate()->heap()->InFromSpace(object));
16 // We use the first word (where the map pointer usually is) of a heap
26 DCHECK(object->GetIsolate()->heap()->InFromSpace(*p));
31 object->GetHeap()->UpdateAllocationSite<Heap::kGlobal>(
40 SlotCallbackResult Scavenger::CheckAndScavengeObject(Heap* heap,
44 if (heap->InFromSpace(object)) {
55 if (heap->InToSpace(object)) {
65 void StaticScavengeVisitor::VisitPointer(Heap* heap, HeapObject* obj
[all...] |
| memory-reducer.cc | 5 #include "src/heap/memory-reducer.h"
8 #include "src/heap/gc-tracer.h"
9 #include "src/heap/heap-inl.h"
24 : CancelableTask(memory_reducer->heap()->isolate()),
29 Heap* heap = memory_reducer_->heap(); local
31 double time_ms = heap->MonotonicallyIncreasingTimeInMs();
32 heap->tracer()->SampleAllocation(time_ms, heap->NewSpaceAllocationCounter()
[all...] |
| objects-visiting-inl.h | 8 #include "src/heap/array-buffer-tracker.h"
9 #include "src/heap/mark-compact.h"
10 #include "src/heap/objects-visiting.h"
217 Heap* heap, HeapObject* object, Address entry_address) {
219 heap->mark_compact_collector()->RecordCodeEntrySlot(object, entry_address,
221 StaticVisitor::MarkObject(heap, code);
227 Heap* heap, RelocInfo* rinfo) {
231 heap->mark_compact_collector()->RecordRelocSlot(host, rinfo, object)
306 Heap* heap = map->GetHeap(); local
329 Heap* heap = map->GetHeap(); local
358 Heap* heap = array->GetHeap(); local
371 Heap* heap = map->GetHeap(); local
384 Heap* heap = map->GetHeap(); local
414 Heap* heap = map->GetHeap(); local
426 Heap* heap = map->GetHeap(); local
453 Heap* heap = map->GetHeap(); local
[all...] |
| /art/tools/ahat/src/main/com/android/ahat/ |
| HeapTable.java | 28 * Class for rendering a table that includes sizes of some kind for each heap.
32 * Configuration for a value column of a heap table.
44 long getSize(T element, AhatHeap heap);
57 for (AhatHeap heap : snapshot.getHeaps()) {
58 if (hasNonZeroEntry(heap, config, elements)) {
59 heaps.add(heap);
65 // Print the heap and values descriptions.
67 for (AhatHeap heap : heaps) {
68 subcols.add(new Column(heap.getName(), Column.Align.RIGHT));
88 for (AhatHeap heap : heaps)
[all...] |
| /external/libdrm/intel/ |
| mm.h | 41 struct mem_block *heap; member in struct:mem_block
49 * return: a heap pointer if OK, NULL if error
60 * startSearch = linear offset from start of heap to begin search
63 drm_private extern struct mem_block *mmAllocMem(struct mem_block *heap,
|
| /external/syslinux/efi/ |
| mem.c | 9 void *efi_malloc(size_t size, enum heap heap, malloc_tag_t tag)
|
| /frameworks/native/libs/binder/ |
| MemoryBase.cpp | 28 MemoryBase::MemoryBase(const sp<IMemoryHeap>& heap,
30 : mSize(size), mOffset(offset), mHeap(heap)
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| heap_simulator_test.cc | 43 // HeapCallRecorder is a dummy heap algorithm that simply records its calls.
70 // HeapSimulatorTracker runs the heap simulator, recording the sequence of calls
71 // made to the underlying heap algorithm. Tests compare the actual call
493 // Base class for heap algorithm tests.
520 // Create a dummy LogicalBuffer to pass to the heap algorithm.
536 NoFragmentationStatsHeap heap; local
537 EXPECT_EQ(0, heap.Finish().heap_size);
541 NoFragmentationStatsHeap heap; local
542 heap.Alloc(buffer_a_, 10);
543 heap.Alloc(buffer_b_, 20)
554 NoFragmentationStatsHeap heap; local
[all...] |
