| /external/skia/tests/ |
| VkHeapTests.cpp | 26 GrVkSubHeap heap(gpu, 0, 0, 64 * 1024, 32);
29 REPORTER_ASSERT(reporter, heap.alloc(64 * 1024, &alloc0));
32 REPORTER_ASSERT(reporter, heap.freeSize() == 0 && heap.largestBlockSize() == 0);
33 heap.free(alloc0);
34 REPORTER_ASSERT(reporter, heap.freeSize() == 64*1024 && heap.largestBlockSize() == 64 * 1024);
37 REPORTER_ASSERT(reporter, heap.alloc(16 * 1024, &alloc0));
38 REPORTER_ASSERT(reporter, heap.alloc(23 * 1024, &alloc1));
39 REPORTER_ASSERT(reporter, heap.alloc(18 * 1024, &alloc2))
[all...] |
| TDPQueueTest.cpp | 15 SkTDPQueue<int, intless> heap; local
16 REPORTER_ASSERT(reporter, 0 == heap.count());
18 heap.insert(0);
19 REPORTER_ASSERT(reporter, 1 == heap.count());
20 REPORTER_ASSERT(reporter, 0 == heap.peek());
21 heap.pop();
22 REPORTER_ASSERT(reporter, 0 == heap.count());
24 heap.insert(0);
25 heap.insert(1);
26 REPORTER_ASSERT(reporter, 2 == heap.count())
[all...] |
| /external/skqp/tests/ |
| VkHeapTests.cpp | 26 GrVkSubHeap heap(gpu, 0, 0, 64 * 1024, 32);
29 REPORTER_ASSERT(reporter, heap.alloc(64 * 1024, &alloc0));
32 REPORTER_ASSERT(reporter, heap.freeSize() == 0 && heap.largestBlockSize() == 0);
33 heap.free(alloc0);
34 REPORTER_ASSERT(reporter, heap.freeSize() == 64*1024 && heap.largestBlockSize() == 64 * 1024);
37 REPORTER_ASSERT(reporter, heap.alloc(16 * 1024, &alloc0));
38 REPORTER_ASSERT(reporter, heap.alloc(23 * 1024, &alloc1));
39 REPORTER_ASSERT(reporter, heap.alloc(18 * 1024, &alloc2))
[all...] |
| TDPQueueTest.cpp | 15 SkTDPQueue<int, intless> heap; local
16 REPORTER_ASSERT(reporter, 0 == heap.count());
18 heap.insert(0);
19 REPORTER_ASSERT(reporter, 1 == heap.count());
20 REPORTER_ASSERT(reporter, 0 == heap.peek());
21 heap.pop();
22 REPORTER_ASSERT(reporter, 0 == heap.count());
24 heap.insert(0);
25 heap.insert(1);
26 REPORTER_ASSERT(reporter, 2 == heap.count())
[all...] |
| /external/v8/src/snapshot/ |
| natives-common.cc | 7 #include "src/heap/heap.h"
15 FixedArray* NativesCollection<CORE>::GetSourceCache(Heap* heap) {
16 return heap->natives_source_cache();
21 FixedArray* NativesCollection<EXPERIMENTAL>::GetSourceCache(Heap* heap) {
22 return heap->experimental_natives_source_cache();
27 FixedArray* NativesCollection<EXTRAS>::GetSourceCache(Heap* heap) {
[all...] |
| /external/valgrind/helgrind/tests/ |
| shmem_abits.stderr.exp | 1 basic heap test
4 doing many heap blocks
5 random heap free and checks
|
| /hardware/intel/img/psb_video/src/ |
| object_heap.c | 42 * Expands the heap
45 static int object_heap_expand(object_heap_p heap)
51 int new_heap_size = heap->heap_size + heap->heap_increment;
53 new_heap_index = (object_base_p *) realloc(heap->heap_index, new_heap_size * sizeof(object_base_p));
57 heap->heap_index = new_heap_index;
58 next_free = heap->next_free;
59 for (i = new_heap_size; i-- > heap->heap_size;) {
60 object_base_p obj = (object_base_p) calloc(1, heap->object_size);
61 heap->heap_index[i] = obj
[all...] |
| /external/compiler-rt/test/asan/TestCases/ |
| describe_address.cc | 9 int *heap = new int[100]; local
10 __asan_describe_address(heap);
17 delete[] heap;
|
| /external/v8/src/heap/ |
| incremental-marking-job.cc | 5 #include "src/heap/incremental-marking-job.h"
8 #include "src/heap/heap-inl.h"
9 #include "src/heap/heap.h"
10 #include "src/heap/incremental-marking.h"
17 void IncrementalMarkingJob::Start(Heap* heap) {
18 DCHECK(!heap->incremental_marking()->IsStopped());
19 ScheduleTask(heap);
45 Heap* heap = isolate()->heap(); local
[all...] |
| scavenge-job.cc | 5 #include "src/heap/scavenge-job.h"
8 #include "src/heap/heap-inl.h"
9 #include "src/heap/heap.h"
20 Heap* heap = isolate()->heap(); local
24 double start_ms = heap->MonotonicallyIncreasingTimeInMs();
27 heap->tracer()->ScavengeSpeedInBytesPerMillisecond()
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_heap.c | 29 nouveau_heap_init(struct nouveau_heap **heap,
40 *heap = r;
45 nouveau_heap_destroy(struct nouveau_heap **heap)
47 if (!*heap)
49 free(*heap);
50 *heap = NULL;
54 nouveau_heap_alloc(struct nouveau_heap *heap, unsigned size, void *priv,
59 if (!heap || !size || !res || *res)
62 while (heap) {
63 if (!heap->in_use && heap->size >= size)
[all...] |
| nouveau_heap.h | 26 /* This datastructure represents a memory allocation heap. Fundamentally, this
35 * The first node will remain with in_use == 0 even if the whole heap is
38 * free nodes, they are merged into one, and the relevant heap entries are
41 * The pattern to free the whole heap is to start with the first node and then
44 * full size of the heap.
59 nouveau_heap_init(struct nouveau_heap **heap, unsigned start,
63 nouveau_heap_destroy(struct nouveau_heap **heap);
66 nouveau_heap_alloc(struct nouveau_heap *heap, unsigned size, void *priv,
|
| /external/libevent/test/ |
| regress_minheap.c | 44 check_heap(struct min_heap *heap)
47 for (i = 1; i < heap->n; ++i) {
49 tt_want(evutil_timercmp(&heap->p[i]->ev_timeout,
50 &heap->p[parent_idx]->ev_timeout, >=));
57 struct min_heap heap; local
62 min_heap_ctor_(&heap);
67 min_heap_push_(&heap, inserted[i]);
69 check_heap(&heap);
71 tt_assert(min_heap_size_(&heap) == 1024);
74 min_heap_erase_(&heap, inserted[i])
[all...] |
| /external/python/cpython2/Modules/ |
| _heapqmodule.c | 36 _siftdown(PyListObject *heap, Py_ssize_t startpos, Py_ssize_t pos)
42 assert(PyList_Check(heap));
43 size = PyList_GET_SIZE(heap);
51 newitem = PyList_GET_ITEM(heap, pos);
54 parent = PyList_GET_ITEM(heap, parentpos);
58 if (size != PyList_GET_SIZE(heap)) {
65 parent = PyList_GET_ITEM(heap, parentpos);
66 newitem = PyList_GET_ITEM(heap, pos);
67 PyList_SET_ITEM(heap, parentpos, newitem);
68 PyList_SET_ITEM(heap, pos, parent)
123 PyObject *heap, *item; local
185 PyObject *heap, *item, *returnitem; local
223 PyObject *heap, *item, *returnitem; local
298 PyObject *heap=NULL, *elem, *iterable, *sol, *it, *oldelem; local
467 PyObject *heap=NULL, *elem, *iterable, *los, *it, *oldelem; local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/ |
| _heapqmodule.c | 36 _siftdown(PyListObject *heap, Py_ssize_t startpos, Py_ssize_t pos)
42 assert(PyList_Check(heap));
43 size = PyList_GET_SIZE(heap);
51 newitem = PyList_GET_ITEM(heap, pos);
54 parent = PyList_GET_ITEM(heap, parentpos);
58 if (size != PyList_GET_SIZE(heap)) {
65 parent = PyList_GET_ITEM(heap, parentpos);
66 newitem = PyList_GET_ITEM(heap, pos);
67 PyList_SET_ITEM(heap, parentpos, newitem);
68 PyList_SET_ITEM(heap, pos, parent);
123 PyObject *heap, *item; local
185 PyObject *heap, *item, *returnitem; local
223 PyObject *heap, *item, *returnitem; local
293 PyObject *heap=NULL, *elem, *iterable, *sol, *it, *oldelem; local
462 PyObject *heap=NULL, *elem, *iterable, *los, *it, *oldelem; local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/ |
| _heapqmodule.c | 36 _siftdown(PyListObject *heap, Py_ssize_t startpos, Py_ssize_t pos)
42 assert(PyList_Check(heap));
43 if (pos >= PyList_GET_SIZE(heap)) {
48 newitem = PyList_GET_ITEM(heap, pos);
54 parent = PyList_GET_ITEM(heap, parentpos);
63 Py_DECREF(PyList_GET_ITEM(heap, pos));
64 PyList_SET_ITEM(heap, pos, parent);
67 Py_DECREF(PyList_GET_ITEM(heap, pos));
68 PyList_SET_ITEM(heap, pos, newitem);
73 _siftup(PyListObject *heap, Py_ssize_t pos)
124 PyObject *heap, *item; local
186 PyObject *heap, *item, *returnitem; local
224 PyObject *heap, *item, *returnitem; local
294 PyObject *heap=NULL, *elem, *iterable, *sol, *it, *oldelem; local
463 PyObject *heap=NULL, *elem, *iterable, *los, *it, *oldelem; local
[all...] |
| /prebuilts/go/darwin-x86/test/ |
| escape_level.go | 14 i := 0 // ERROR "moved to heap: i"
15 p0 := &i // ERROR "moved to heap: p0" "&i escapes to heap"
16 p1 := &p0 // ERROR "moved to heap: p1" "&p0 escapes to heap"
17 p2 := &p1 // ERROR "moved to heap: p2" "&p1 escapes to heap"
18 sink = &p2 // ERROR "&p2 escapes to heap"
22 i := 0 // ERROR "moved to heap: i"
23 p0 := &i // ERROR "moved to heap: p0" "&i escapes to heap
[all...] |
| escape_map.go | 16 i := 0 // ERROR "moved to heap: i"
18 j := 0 // ERROR "moved to heap: j"
19 m[&i] = &j // ERROR "&i escapes to heap" "&j escapes to heap"
26 i := 0 // ERROR "moved to heap: i"
27 j := 0 // ERROR "moved to heap: j"
28 m[&i] = &j // ERROR "&i escapes to heap" "&j escapes to heap"
33 m := make(map[*int]*int) // ERROR "make\(map\[\*int\]\*int\) escapes to heap"
34 i := 0 // ERROR "moved to heap: i
[all...] |
| escape_param.go | 27 i := 0 // ERROR "moved to heap: i$"
28 sink = param0(&i) // ERROR "&i escapes to heap$" "param0\(&i\) escapes to heap"
37 i := 0 // ERROR "moved to heap: i$"
39 sink, _ = param1(&i, &j) // ERROR "&i escapes to heap$" "caller1 &j does not escape$"
48 i := 0 // ERROR "moved to heap: i$"
50 param2(&i, &p) // ERROR "&i escapes to heap$" "caller2a &p does not escape$"
55 i := 0 // ERROR "moved to heap: i$"
57 param2(&i, &p) // ERROR "&i escapes to heap$" "caller2b &p does not escape$"
58 sink = p // ERROR "p escapes to heap$
[all...] |
| /prebuilts/go/linux-x86/test/ |
| escape_level.go | 14 i := 0 // ERROR "moved to heap: i"
15 p0 := &i // ERROR "moved to heap: p0" "&i escapes to heap"
16 p1 := &p0 // ERROR "moved to heap: p1" "&p0 escapes to heap"
17 p2 := &p1 // ERROR "moved to heap: p2" "&p1 escapes to heap"
18 sink = &p2 // ERROR "&p2 escapes to heap"
22 i := 0 // ERROR "moved to heap: i"
23 p0 := &i // ERROR "moved to heap: p0" "&i escapes to heap
[all...] |
| escape_map.go | 16 i := 0 // ERROR "moved to heap: i"
18 j := 0 // ERROR "moved to heap: j"
19 m[&i] = &j // ERROR "&i escapes to heap" "&j escapes to heap"
26 i := 0 // ERROR "moved to heap: i"
27 j := 0 // ERROR "moved to heap: j"
28 m[&i] = &j // ERROR "&i escapes to heap" "&j escapes to heap"
33 m := make(map[*int]*int) // ERROR "make\(map\[\*int\]\*int\) escapes to heap"
34 i := 0 // ERROR "moved to heap: i
[all...] |
| escape_param.go | 27 i := 0 // ERROR "moved to heap: i$"
28 sink = param0(&i) // ERROR "&i escapes to heap$" "param0\(&i\) escapes to heap"
37 i := 0 // ERROR "moved to heap: i$"
39 sink, _ = param1(&i, &j) // ERROR "&i escapes to heap$" "caller1 &j does not escape$"
48 i := 0 // ERROR "moved to heap: i$"
50 param2(&i, &p) // ERROR "&i escapes to heap$" "caller2a &p does not escape$"
55 i := 0 // ERROR "moved to heap: i$"
57 param2(&i, &p) // ERROR "&i escapes to heap$" "caller2b &p does not escape$"
58 sink = p // ERROR "p escapes to heap$
[all...] |
| /external/valgrind/memcheck/tests/ |
| sbfragment.stdout.exp | 2 reasonable heap usage
|
| /system/libhidl/transport/allocator/1.0/utils/ |
| FrameworkUtils.cpp | 25 sp<HidlMemory> fromHeap(const sp<IMemoryHeap>& heap) {
26 int fd = dup(heap->getHeapID());
35 return HidlMemory::getInstance("ashmem", fd, heap->getSize());
|
| /external/deqp/framework/delibs/depool/ |
| dePoolHeap.c | 21 * \brief Memory pool heap class.
57 * \brief Test heap functionality.
62 TestHeap* heap = TestHeap_create(pool); local
65 TestHeap_push(heap, HeapItem_create(10, 10));
66 TestHeap_push(heap, HeapItem_create(0, 10));
67 TestHeap_push(heap, HeapItem_create(20, 10));
68 DE_TEST_ASSERT(TestHeap_getNumElements(heap) == 3);
70 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 0);
71 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 10);
72 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 20)
[all...] |
