Searched refs:heap (Results 1 - 25 of 488) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/tcmalloc/chromium/src/google/
H A Dheap-checker.h33 #include <gperftools/heap-checker.h>
H A Dheap-profiler.h34 #include <gperftools/heap-profiler.h>
/external/chromium_org/third_party/tcmalloc/vendor/src/google/
H A Dheap-checker.h33 #include <gperftools/heap-checker.h>
H A Dheap-profiler.h34 #include <gperftools/heap-profiler.h>
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/
H A Dnouveau_heap.c29 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 Dnouveau_heap.h39 nouveau_heap_init(struct nouveau_heap **heap, unsigned start,
43 nouveau_heap_destroy(struct nouveau_heap **heap);
46 nouveau_heap_alloc(struct nouveau_heap *heap, unsigned size, void *priv,
/external/mesa3d/src/gallium/drivers/nouveau/
H A Dnouveau_heap.c29 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 Dnouveau_heap.h39 nouveau_heap_init(struct nouveau_heap **heap, unsigned start,
43 nouveau_heap_destroy(struct nouveau_heap **heap);
46 nouveau_heap_alloc(struct nouveau_heap *heap, unsigned size, void *priv,
/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-2646.js28 // Flags: --heap-stats
32 heap = new ArrayBuffer(expectedItemsCount * itemSize * 8),
36 storage.push(new Float64Array(heap, 0, itemSize));
/external/valgrind/main/memcheck/tests/
H A Dsbfragment.stdout.exp2 reasonable heap usage
/external/chromium-trace/trace-viewer/src/tcmalloc/
H A Dheap_instance_track.css6 .heap-instance-track {
10 .heap-instance-track ul {
/external/deqp/framework/delibs/depool/
H A DdePoolHeap.c21 * \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 DdePoolHeap.h23 * \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/chromium_org/third_party/WebKit/Source/devtools/front_end/
H A DheapProfiler.css32 .heap-snapshot-sidebar-tree-item .icon {
36 .heap-snapshot-sidebar-tree-item.small .icon {
40 .heap-snapshot-view {
50 .heap-snapshot-view .pie-chart {
54 .heap-snapshot-view .data-grid {
58 .heap-snapshot-view .data-grid tr:empty {
63 .heap-snapshot-view .data-grid span.percent-column {
67 .heap-snapshot-view .console-formatted-object,
77 .heap-snapshot-view .console-formatted-string {
81 .heap
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_mm.c34 u_mmDumpMemInfo(const struct mem_block *heap) argument
36 debug_printf("Memory heap %p:\n", (void *) heap);
37 if (heap == 0) {
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...]
/external/chromium_org/third_party/mesa/src/src/mesa/main/
H A Dmm.c34 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...]
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_mm.c34 u_mmDumpMemInfo(const struct mem_block *heap) argument
36 debug_printf("Memory heap %p:\n", (void *) heap);
37 if (heap == 0) {
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...]
/external/mesa3d/src/mesa/main/
H A Dmm.c34 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...]
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
H A DAndroid.mk17 test_makefile := external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/Android.mk
19 test_name := algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until
23 test_name := algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_comp
27 test_name := algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap
31 test_name := algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until_com
[all...]
/external/chromium_org/third_party/skia/tests/
H A DBitmapHeapTest.cpp45 // Flatten, storing it in the bitmap heap.
46 SkBitmapHeap heap(1, 1);
48 controller.setBitmapStorage(&heap);
51 // Dictionary and heap start off empty.
52 REPORTER_ASSERT(reporter, heap.count() == 0);
55 heap.deferAddingOwners();
57 heap.endAddingOwnersDeferral(true);
59 // The dictionary and heap should now each have one entry.
61 REPORTER_ASSERT(reporter, heap.count() == 1);
65 SkBitmapHeapEntry* entry = heap
[all...]
/external/skia/tests/
H A DBitmapHeapTest.cpp45 // Flatten, storing it in the bitmap heap.
46 SkBitmapHeap heap(1, 1);
48 controller.setBitmapStorage(&heap);
51 // Dictionary and heap start off empty.
52 REPORTER_ASSERT(reporter, heap.count() == 0);
55 heap.deferAddingOwners();
57 heap.endAddingOwnersDeferral(true);
59 // The dictionary and heap should now each have one entry.
61 REPORTER_ASSERT(reporter, heap.count() == 1);
65 SkBitmapHeapEntry* entry = heap
[all...]
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/
H A DAndroid.mk17 test_makefile := external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/Android.mk
19 test_name := algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap
23 test_name := algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap_comp
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/
H A DAndroid.mk17 test_makefile := external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/Android.mk
19 test_name := algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap
23 test_name := algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap_comp
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/
H A DAndroid.mk17 test_makefile := external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/Android.mk
19 test_name := algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap_comp
23 test_name := algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/
H A DAndroid.mk17 test_makefile := external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/Android.mk
19 test_name := algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap
23 test_name := algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap_comp

Completed in 2404 milliseconds

1234567891011>>