/external/skia/tests/ |
H A D | 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 [all...] |
H A D | 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 [all...] |
/external/skqp/tests/ |
H A D | 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 [all...] |
H A D | 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 [all...] |
/external/v8/src/snapshot/ |
H A D | natives-common.cc | 7 #include "src/heap/heap.h" 15 FixedArray* NativesCollection<CORE>::GetSourceCache(Heap* heap) { argument 16 return heap->natives_source_cache(); 21 FixedArray* NativesCollection<EXPERIMENTAL>::GetSourceCache(Heap* heap) { argument 22 return heap->experimental_natives_source_cache(); 27 FixedArray* NativesCollection<EXTRAS>::GetSourceCache(Heap* heap) { argument 28 return heap->extra_natives_source_cache(); 33 FixedArray* NativesCollection<EXPERIMENTAL_EXTRAS>::GetSourceCache(Heap* heap) { argument 34 return heap [all...] |
/external/valgrind/helgrind/tests/ |
H A D | shmem_abits.stderr.exp | 1 basic heap test 4 doing many heap blocks 5 random heap free and checks
|
/external/compiler-rt/test/asan/TestCases/ |
H A D | describe_address.cc | 9 int *heap = new int[100]; local 10 __asan_describe_address(heap); 17 delete[] heap;
|
/external/v8/src/heap/ |
H A D | 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) { argument 18 DCHECK(!heap->incremental_marking()->IsStopped()); 19 ScheduleTask(heap); 24 void IncrementalMarkingJob::ScheduleTask(Heap* heap) { argument 33 Step(Heap* heap) argument 45 Heap* heap = isolate()->heap(); local [all...] |
H A D | 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(); 28 size_t new_space_size = heap 80 RescheduleIdleTask(Heap* heap) argument 90 ScheduleIdleTaskIfNeeded(Heap* heap, int bytes_allocated) argument 101 ScheduleIdleTask(Heap* heap) argument [all...] |
/external/mesa3d/src/gallium/drivers/nouveau/ |
H A D | nouveau_heap.c | 29 nouveau_heap_init(struct nouveau_heap **heap, argument 40 *heap = r; 45 nouveau_heap_destroy(struct nouveau_heap **heap) argument 47 if (!*heap) 49 free(*heap); 50 *heap = NULL; 54 nouveau_heap_alloc(struct nouveau_heap *heap, unsigned size, void *priv, argument 59 if (!heap || !size || !res || *res) 62 while (heap) { 63 if (!heap [all...] |
H A D | 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/ |
H A D | regress_minheap.c | 44 check_heap(struct min_heap *heap) argument 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, inserte [all...] |
/external/python/cpython2/Modules/ |
H A D | _heapqmodule.c | 36 _siftdown(PyListObject *heap, Py_ssize_t startpos, Py_ssize_t pos) argument 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, po 75 _siftup(PyListObject *heap, Py_ssize_t pos) argument 123 PyObject *heap, *item; local 146 heappop(PyObject *self, PyObject *heap) argument 185 PyObject *heap, *item, *returnitem; local 223 PyObject *heap, *item, *returnitem; local 268 heapify(PyObject *self, PyObject *heap) argument 298 PyObject *heap=NULL, *elem, *iterable, *sol, *it, *oldelem; local 379 _siftdownmax(PyListObject *heap, Py_ssize_t startpos, Py_ssize_t pos) argument 416 _siftupmax(PyListObject *heap, Py_ssize_t pos) argument 467 PyObject *heap=NULL, *elem, *iterable, *los, *it, *oldelem; local [all...] |
/external/python/cpython2/Lib/ |
H A D | heapq.py | 8 property of a heap is that a[0] is always its smallest element. 12 heap = [] # creates an empty heap 13 heappush(heap, item) # pushes a new item on the heap 14 item = heappop(heap) # pops the smallest item from the heap 15 item = heap[0] # smallest item on the heap without popping it 16 heapify(x) # transforms list into a heap, i 475 heap = [] variable [all...] |
/external/valgrind/memcheck/tests/ |
H A D | sbfragment.stdout.exp | 2 reasonable heap usage
|
/external/deqp/framework/delibs/depool/ |
H A D | 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) [all...] |
H A D | dePoolHeap.h | 23 * \brief Memory pool heap class. 37 * \brief Declare a template pool heap class. 38 * \param TYPENAME Type name of the declared heap. 39 * \param VALUETYPE Type of the value contained in the heap. 42 * This macro declares a pool heap with all the necessary functions for 46 * The functions for operating the heap are: 50 * int Heap_getNumElements (const Heap* heap); 51 * deBool Heap_reserve (Heap* heap, int size); 52 * void Heap_reset (Heap* heap); 53 * deBool Heap_push (Heap* heap, Elemen [all...] |
/external/python/cpython3/Lib/ |
H A D | heapq.py | 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 it 14 heapify(x) # transforms list into a heap, i [all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_mm.c | 34 u_mmDumpMemInfo(const struct mem_block *heap) argument 36 debug_printf("Memory heap %p:\n", (void *) heap); 37 if (heap == NULL) { 38 debug_printf(" heap == 0\n"); 44 for (p = heap->next; p != heap; p = p->next) { 58 for (p = heap->next_free; p != heap; p = p->next_free) { 72 struct mem_block *heap, *bloc local 177 u_mmAllocMem(struct mem_block *heap, int size, int align2, int startSearch) argument 214 u_mmFindBlock(struct mem_block *heap, int start) argument 282 u_mmDestroy(struct mem_block *heap) argument [all...] |
H A D | u_mm.h | 40 struct mem_block *heap; member in struct:mem_block 50 * return: a heap pointer if OK, NULL if error 61 * startSearch = linear offset from start of heap to begin search 64 extern struct mem_block *u_mmAllocMem(struct mem_block *heap, int size, int align2, 76 * input: pointer to a heap, start offset 79 extern struct mem_block *u_mmFindBlock(struct mem_block *heap, int start);
|
/external/mesa3d/src/mesa/main/ |
H A D | mm.c | 34 mmDumpMemInfo(const struct mem_block *heap) argument 36 fprintf(stderr, "Memory heap %p:\n", (void *)heap); 37 if (heap == 0) { 38 fprintf(stderr, " heap == 0\n"); 42 for(p = heap->next; p != heap; p = p->next) { 50 for(p = heap->next_free; p != heap; p = p->next_free) { 63 struct mem_block *heap, *bloc local 168 mmAllocMem(struct mem_block *heap, unsigned size, unsigned align2, unsigned startSearch) argument 201 mmFindBlock(struct mem_block *heap, unsigned start) argument 269 mmDestroy(struct mem_block *heap) argument [all...] |
H A D | mm.h | 38 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 extern struct mem_block *mmAllocMem(struct mem_block *heap, unsigned size, 75 * input: pointer to a heap, start offset 78 extern struct mem_block *mmFindBlock(struct mem_block *heap, unsigned start);
|
/external/python/cpython3/Modules/ |
H A D | _heapqmodule.c | 12 siftdown(PyListObject *heap, Py_ssize_t startpos, Py_ssize_t pos) argument 18 assert(PyList_Check(heap)); 19 size = PyList_GET_SIZE(heap); 27 arr = _PyList_ITEMS(heap); 35 if (size != PyList_GET_SIZE(heap)) { 42 arr = _PyList_ITEMS(heap); 53 siftup(PyListObject *heap, Py_ssize_t pos) argument 59 assert(PyList_Check(heap)); 60 endpos = PyList_GET_SIZE(heap); 68 arr = _PyList_ITEMS(heap); 102 PyObject *heap, *item; local 124 heappop_internal(PyObject *heap, int siftup_func(PyListObject *, Py_ssize_t)) argument 161 heappop(PyObject *self, PyObject *heap) argument 172 PyObject *heap, *item, *returnitem; local 216 PyObject *heap, *item, *returnitem; local 293 cache_friendly_heapify(PyObject *heap, int siftup_func(PyListObject *, Py_ssize_t)) argument 326 heapify_internal(PyObject *heap, int siftup_func(PyListObject *, Py_ssize_t)) argument 357 heapify(PyObject *self, PyObject *heap) argument 366 siftdown_max(PyListObject *heap, Py_ssize_t startpos, Py_ssize_t pos) argument 407 siftup_max(PyListObject *heap, Py_ssize_t pos) argument 454 heappop_max(PyObject *self, PyObject *heap) argument 470 heapify_max(PyObject *self, PyObject *heap) argument [all...] |
/external/jemalloc/test/unit/ |
H A D | ph.c | 20 * Duplicates are not allowed in the heap, so force an 63 heap_print(const heap_t *heap) argument 67 malloc_printf("vvv heap %p vvv\n", heap); 68 if (heap->ph_root == NULL) 71 node_print(heap->ph_root, 0); 73 for (auxelm = phn_next_get(node_t, link, heap->ph_root); auxelm != NULL; 82 malloc_printf("^^^ heap %p ^^^\n", heap); 114 heap_validate(const heap_t *heap) argument 140 heap_t heap; local 149 node_remove(heap_t *heap, node_t *node) argument 158 node_remove_first(heap_t *heap) argument 172 heap_t heap; local [all...] |
/external/libdrm/intel/ |
H A D | mm.c | 36 drm_private void mmDumpMemInfo(const struct mem_block *heap) argument 38 drmMsg("Memory heap %p:\n", (void *)heap); 39 if (heap == 0) { 40 drmMsg(" heap == 0\n"); 44 for (p = heap->next; p != heap; p = p->next) { 52 for (p = heap->next_free; p != heap; p = p->next_free) { 64 struct mem_block *heap, *bloc local 167 mmAllocMem(struct mem_block *heap, int size, int align2, int startSearch) argument 250 mmDestroy(struct mem_block *heap) argument [all...] |