Home
last modified time | relevance | path

Searched refs:heap (Results 1 – 25 of 687) sorted by relevance

12345678910>>...28

/external/mesa3d/src/mesa/main/
Dmm.c34 mmDumpMemInfo(const struct mem_block *heap) in mmDumpMemInfo() argument
36 fprintf(stderr, "Memory heap %p:\n", (void *)heap); in mmDumpMemInfo()
37 if (heap == 0) { in mmDumpMemInfo()
42 for(p = heap->next; p != heap; p = p->next) { in mmDumpMemInfo()
50 for(p = heap->next_free; p != heap; p = p->next_free) { in mmDumpMemInfo()
63 struct mem_block *heap, *block; in mmInit() local
68 heap = (struct mem_block *) calloc(1, sizeof(struct mem_block)); in mmInit()
69 if (!heap) in mmInit()
74 free(heap); in mmInit()
78 heap->next = block; in mmInit()
[all …]
/external/chromium_org/third_party/mesa/src/src/mesa/main/
Dmm.c34 mmDumpMemInfo(const struct mem_block *heap) in mmDumpMemInfo() argument
36 fprintf(stderr, "Memory heap %p:\n", (void *)heap); in mmDumpMemInfo()
37 if (heap == 0) { in mmDumpMemInfo()
42 for(p = heap->next; p != heap; p = p->next) { in mmDumpMemInfo()
50 for(p = heap->next_free; p != heap; p = p->next_free) { in mmDumpMemInfo()
63 struct mem_block *heap, *block; in mmInit() local
68 heap = (struct mem_block *) calloc(1, sizeof(struct mem_block)); in mmInit()
69 if (!heap) in mmInit()
74 free(heap); in mmInit()
78 heap->next = block; in mmInit()
[all …]
/external/mesa3d/src/gallium/auxiliary/util/
Du_mm.c34 u_mmDumpMemInfo(const struct mem_block *heap) in u_mmDumpMemInfo() argument
36 debug_printf("Memory heap %p:\n", (void *) heap); in u_mmDumpMemInfo()
37 if (heap == 0) { in u_mmDumpMemInfo()
44 for (p = heap->next; p != heap; p = p->next) { in u_mmDumpMemInfo()
58 for (p = heap->next_free; p != heap; p = p->next_free) { in u_mmDumpMemInfo()
72 struct mem_block *heap, *block; in u_mmInit() local
77 heap = CALLOC_STRUCT(mem_block); in u_mmInit()
78 if (!heap) in u_mmInit()
83 FREE(heap); in u_mmInit()
87 heap->next = block; in u_mmInit()
[all …]
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
Du_mm.c34 u_mmDumpMemInfo(const struct mem_block *heap) in u_mmDumpMemInfo() argument
36 debug_printf("Memory heap %p:\n", (void *) heap); in u_mmDumpMemInfo()
37 if (heap == 0) { in u_mmDumpMemInfo()
44 for (p = heap->next; p != heap; p = p->next) { in u_mmDumpMemInfo()
58 for (p = heap->next_free; p != heap; p = p->next_free) { in u_mmDumpMemInfo()
72 struct mem_block *heap, *block; in u_mmInit() local
77 heap = CALLOC_STRUCT(mem_block); in u_mmInit()
78 if (!heap) in u_mmInit()
83 FREE(heap); in u_mmInit()
87 heap->next = block; in u_mmInit()
[all …]
/external/deqp/framework/delibs/depool/
DdePoolHeap.c62 TestHeap* heap = TestHeap_create(pool); in dePoolHeap_selfTest() local
65 TestHeap_push(heap, HeapItem_create(10, 10)); in dePoolHeap_selfTest()
66 TestHeap_push(heap, HeapItem_create(0, 10)); in dePoolHeap_selfTest()
67 TestHeap_push(heap, HeapItem_create(20, 10)); in dePoolHeap_selfTest()
68 DE_TEST_ASSERT(TestHeap_getNumElements(heap) == 3); in dePoolHeap_selfTest()
70 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 0); in dePoolHeap_selfTest()
71 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 10); in dePoolHeap_selfTest()
72 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 20); in dePoolHeap_selfTest()
73 DE_TEST_ASSERT(TestHeap_getNumElements(heap) == 0); in dePoolHeap_selfTest()
80 TestHeap_push(heap, HeapItem_create(i, -i)); in dePoolHeap_selfTest()
[all …]
DdePoolHeap.h67 DE_INLINE int TYPENAME##_getNumElements (const TYPENAME* heap) DE_UNUSED_FUNCTION; \
68 DE_INLINE deBool TYPENAME##_reserve (TYPENAME* heap, int capacity) DE_UNUSED_FUNCTION; \
69 DE_INLINE void TYPENAME##_reset (TYPENAME* heap) DE_UNUSED_FUNCTION; \
70 DE_INLINE void TYPENAME##_moveDown (TYPENAME* heap, int ndx) DE_UNUSED_FUNCTION; \
71 DE_INLINE void TYPENAME##_moveUp (TYPENAME* heap, int ndx) DE_UNUSED_FUNCTION; \
72 DE_INLINE deBool TYPENAME##_push (TYPENAME* heap, VALUETYPE elem) DE_UNUSED_FUNCTION; \
73 DE_INLINE VALUETYPE TYPENAME##_popMin (TYPENAME* heap) DE_UNUSED_FUNCTION; \
77 TYPENAME* heap = DE_POOL_NEW(pool, TYPENAME); \
78 if (!heap) \
80 heap->array = TYPENAME##Array_create(pool); \
[all …]
/external/mesa3d/src/gallium/drivers/nouveau/
Dnouveau_heap.c29 nouveau_heap_init(struct nouveau_heap **heap, in nouveau_heap_init() argument
40 *heap = r; in nouveau_heap_init()
45 nouveau_heap_destroy(struct nouveau_heap **heap) in nouveau_heap_destroy() argument
47 if (!*heap) in nouveau_heap_destroy()
49 free(*heap); in nouveau_heap_destroy()
50 *heap = NULL; in nouveau_heap_destroy()
54 nouveau_heap_alloc(struct nouveau_heap *heap, unsigned size, void *priv, in nouveau_heap_alloc() argument
59 if (!heap || !size || !res || *res) in nouveau_heap_alloc()
62 while (heap) { in nouveau_heap_alloc()
63 if (!heap->in_use && heap->size >= size) { in nouveau_heap_alloc()
[all …]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/
Dnouveau_heap.c29 nouveau_heap_init(struct nouveau_heap **heap, in nouveau_heap_init() argument
40 *heap = r; in nouveau_heap_init()
45 nouveau_heap_destroy(struct nouveau_heap **heap) in nouveau_heap_destroy() argument
47 if (!*heap) in nouveau_heap_destroy()
49 free(*heap); in nouveau_heap_destroy()
50 *heap = NULL; in nouveau_heap_destroy()
54 nouveau_heap_alloc(struct nouveau_heap *heap, unsigned size, void *priv, in nouveau_heap_alloc() argument
59 if (!heap || !size || !res || *res) in nouveau_heap_alloc()
62 while (heap) { in nouveau_heap_alloc()
63 if (!heap->in_use && heap->size >= size) { in nouveau_heap_alloc()
[all …]
/external/chromium_org/v8/src/heap/
Dobjects-visiting-inl.h81 Heap* heap = map->GetHeap(); in VisitJSArrayBuffer() local
85 VisitPointers(heap, HeapObject::RawField( in VisitJSArrayBuffer()
89 heap, HeapObject::RawField( in VisitJSArrayBuffer()
207 Heap* heap, Address entry_address) { in VisitCodeEntry() argument
209 heap->mark_compact_collector()->RecordCodeEntrySlot(entry_address, code); in VisitCodeEntry()
210 StaticVisitor::MarkObject(heap, code); in VisitCodeEntry()
216 Heap* heap, RelocInfo* rinfo) { in VisitEmbeddedPointer() argument
219 heap->mark_compact_collector()->RecordRelocSlot(rinfo, object); in VisitEmbeddedPointer()
224 StaticVisitor::MarkObject(heap, object); in VisitEmbeddedPointer()
230 void StaticMarkingVisitor<StaticVisitor>::VisitCell(Heap* heap, in VisitCell() argument
[all …]
Dobjects-visiting.cc180 static bool MustRecordSlots(Heap* heap) { in MustRecordSlots() argument
181 return heap->gc_state() == Heap::MARK_COMPACT && in MustRecordSlots()
182 heap->mark_compact_collector()->is_compacting(); in MustRecordSlots()
191 Object* VisitWeakList(Heap* heap, Object* list, WeakObjectRetainer* retainer) { in VisitWeakList() argument
192 Object* undefined = heap->undefined_value(); in VisitWeakList()
195 MarkCompactCollector* collector = heap->mark_compact_collector(); in VisitWeakList()
196 bool record_slots = MustRecordSlots(heap); in VisitWeakList()
222 WeakListVisitor<T>::VisitLiveObject(heap, tail, retainer); in VisitWeakList()
224 WeakListVisitor<T>::VisitPhantomObject(heap, candidate); in VisitWeakList()
240 static void ClearWeakList(Heap* heap, Object* list) { in ClearWeakList() argument
[all …]
Dmark-compact.cc39 MarkCompactCollector::MarkCompactCollector(Heap* heap) in MarkCompactCollector() argument
53 heap_(heap), in MarkCompactCollector()
61 explicit VerifyMarkingVisitor(Heap* heap) : heap_(heap) {} in VerifyMarkingVisitor() argument
93 static void VerifyMarking(Heap* heap, Address bottom, Address top) { in VerifyMarking() argument
94 VerifyMarkingVisitor visitor(heap); in VerifyMarking()
120 VerifyMarking(space->heap(), page->area_start(), limit); in VerifyMarking()
130 VerifyMarking(space->heap(), p->area_start(), p->area_end()); in VerifyMarking()
135 static void VerifyMarking(Heap* heap) { in VerifyMarking() argument
136 VerifyMarking(heap->old_pointer_space()); in VerifyMarking()
137 VerifyMarking(heap->old_data_space()); in VerifyMarking()
[all …]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/
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-snapshot-view tr:not(.selected) .console-formatted-id {
[all …]
/external/chromium_org/third_party/tcmalloc/vendor/src/
Dthread_cache.cc339 ThreadCache* heap = NULL; in CreateCacheIfNecessary() local
365 heap = h; in CreateCacheIfNecessary()
370 if (heap == NULL) heap = NewHeap(me); in CreateCacheIfNecessary()
377 if (!heap->in_setspecific_ && tsd_inited_) { in CreateCacheIfNecessary()
378 heap->in_setspecific_ = true; in CreateCacheIfNecessary()
379 perftools_pthread_setspecific(heap_key_, heap); in CreateCacheIfNecessary()
382 threadlocal_heap_ = heap; in CreateCacheIfNecessary()
384 heap->in_setspecific_ = false; in CreateCacheIfNecessary()
386 return heap; in CreateCacheIfNecessary()
391 ThreadCache *heap = threadcache_allocator.New(); in NewHeap() local
[all …]
/external/chromium_org/third_party/tcmalloc/chromium/src/
Dthread_cache.cc350 ThreadCache* heap = NULL; in CreateCacheIfNecessary() local
376 heap = h; in CreateCacheIfNecessary()
381 if (heap == NULL) heap = NewHeap(me); in CreateCacheIfNecessary()
388 if (!heap->in_setspecific_ && tsd_inited_) { in CreateCacheIfNecessary()
389 heap->in_setspecific_ = true; in CreateCacheIfNecessary()
390 perftools_pthread_setspecific(heap_key_, heap); in CreateCacheIfNecessary()
393 threadlocal_heap_ = heap; in CreateCacheIfNecessary()
395 heap->in_setspecific_ = false; in CreateCacheIfNecessary()
397 return heap; in CreateCacheIfNecessary()
402 ThreadCache *heap = threadcache_allocator.New(); in NewHeap() local
[all …]
/external/chromium_org/v8/src/extensions/
Dstatistics-extension.cc53 Heap* heap = isolate->heap(); in GetCounters() local
57 heap->CollectAllGarbage(Heap::kNoGCFlags, "counters extension"); in GetCounters()
99 AddNumber(args.GetIsolate(), result, heap->new_space()->Size(), in GetCounters()
101 AddNumber(args.GetIsolate(), result, heap->new_space()->Available(), in GetCounters()
103 AddNumber(args.GetIsolate(), result, heap->new_space()->CommittedMemory(), in GetCounters()
105 AddNumber(args.GetIsolate(), result, heap->old_pointer_space()->Size(), in GetCounters()
107 AddNumber(args.GetIsolate(), result, heap->old_pointer_space()->Available(), in GetCounters()
110 heap->old_pointer_space()->CommittedMemory(), in GetCounters()
112 AddNumber(args.GetIsolate(), result, heap->old_data_space()->Size(), in GetCounters()
114 AddNumber(args.GetIsolate(), result, heap->old_data_space()->Available(), in GetCounters()
[all …]
/external/bzip2/
Dhuffman.c36 zz = z; tmp = heap[zz]; \
37 while (weight[tmp] < weight[heap[zz >> 1]]) { \
38 heap[zz] = heap[zz >> 1]; \
41 heap[zz] = tmp; \
47 zz = z; tmp = heap[zz]; \
52 weight[heap[yy+1]] < weight[heap[yy]]) \
54 if (weight[tmp] < weight[heap[yy]]) break; \
55 heap[zz] = heap[yy]; \
58 heap[zz] = tmp; \
75 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; in BZ2_hbMakeCodeLengths() local
[all …]
/external/chromium_org/third_party/skia/tests/
DBitmapHeapTest.cpp46 SkBitmapHeap heap(1, 1); in DEF_TEST() local
48 controller.setBitmapStorage(&heap); in DEF_TEST()
52 REPORTER_ASSERT(reporter, heap.count() == 0); in DEF_TEST()
55 heap.deferAddingOwners(); in DEF_TEST()
57 heap.endAddingOwnersDeferral(true); in DEF_TEST()
61 REPORTER_ASSERT(reporter, heap.count() == 1); in DEF_TEST()
65 SkBitmapHeapEntry* entry = heap.getEntry(0); in DEF_TEST()
72 heap.freeMemoryIfPossible(~0U); in DEF_TEST()
73 REPORTER_ASSERT(reporter, heap.count() == 0); in DEF_TEST()
76 heap.deferAddingOwners(); in DEF_TEST()
[all …]
/external/skia/tests/
DBitmapHeapTest.cpp46 SkBitmapHeap heap(1, 1); in DEF_TEST() local
48 controller.setBitmapStorage(&heap); in DEF_TEST()
52 REPORTER_ASSERT(reporter, heap.count() == 0); in DEF_TEST()
55 heap.deferAddingOwners(); in DEF_TEST()
57 heap.endAddingOwnersDeferral(true); in DEF_TEST()
61 REPORTER_ASSERT(reporter, heap.count() == 1); in DEF_TEST()
65 SkBitmapHeapEntry* entry = heap.getEntry(0); in DEF_TEST()
72 heap.freeMemoryIfPossible(~0U); in DEF_TEST()
73 REPORTER_ASSERT(reporter, heap.count() == 0); in DEF_TEST()
76 heap.deferAddingOwners(); in DEF_TEST()
[all …]
/external/chromium_org/v8/test/cctest/
Dtest-heap.cc46 CHECK(CcTest::heap()->Contains(map)); in CheckMap()
48 CHECK_EQ(CcTest::heap()->meta_map(), map->map()); in CheckMap()
56 Heap* heap = CcTest::heap(); in TEST() local
57 CheckMap(heap->meta_map(), MAP_TYPE, Map::kSize); in TEST()
58 CheckMap(heap->heap_number_map(), HEAP_NUMBER_TYPE, HeapNumber::kSize); in TEST()
59 CheckMap(heap->fixed_array_map(), FIXED_ARRAY_TYPE, kVariableSizeSentinel); in TEST()
60 CheckMap(heap->string_map(), STRING_TYPE, kVariableSizeSentinel); in TEST()
135 Heap* heap = isolate->heap(); in TEST() local
199 CheckOddball(isolate, heap->true_value(), "true"); in TEST()
200 CheckOddball(isolate, heap->false_value(), "false"); in TEST()
[all …]
Dtest-spaces.cc77 p->heap_ = CcTest::heap();
151 Heap* heap, in VerifyMemoryChunk() argument
158 CHECK(memory_allocator->SetUp(heap->MaxReserved(), in VerifyMemoryChunk()
159 heap->MaxExecutableSize())); in VerifyMemoryChunk()
208 Heap* heap = isolate->heap(); in TEST() local
211 memory_allocator->SetUp(heap->MaxReserved(), heap->MaxExecutableSize())); in TEST()
242 Heap* heap = isolate->heap(); in TEST() local
257 heap, in TEST()
265 heap, in TEST()
276 heap, in TEST()
[all …]
Dtest-alloc.cc42 TestHeap* heap = CcTest::test_heap(); in AllocateAfterFailures() local
45 SimulateFullSpace(heap->new_space()); in AllocateAfterFailures()
46 heap->AllocateByteArray(100).ToObjectChecked(); in AllocateAfterFailures()
47 heap->AllocateFixedArray(100, NOT_TENURED).ToObjectChecked(); in AllocateAfterFailures()
51 heap->AllocateFixedArray(100).ToObjectChecked(); in AllocateAfterFailures()
52 heap->AllocateHeapNumber(0.42).ToObjectChecked(); in AllocateAfterFailures()
53 Object* object = heap->AllocateJSObject( in AllocateAfterFailures()
55 heap->CopyJSObject(JSObject::cast(object)).ToObjectChecked(); in AllocateAfterFailures()
58 SimulateFullSpace(heap->old_data_space()); in AllocateAfterFailures()
59 heap->AllocateByteArray(100, TENURED).ToObjectChecked(); in AllocateAfterFailures()
[all …]
Dtest-weaktypedarrays.cc44 static int CountArrayBuffersInWeakList(Heap* heap) { in CountArrayBuffersInWeakList() argument
46 for (Object* o = heap->array_buffers_list(); in CountArrayBuffersInWeakList()
55 static bool HasArrayBufferInWeakList(Heap* heap, JSArrayBuffer* ab) { in HasArrayBufferInWeakList() argument
56 for (Object* o = heap->array_buffers_list(); in HasArrayBufferInWeakList()
92 int start = CountArrayBuffersInWeakList(isolate->heap()); in TEST()
104 CHECK_EQ(2, CountArrayBuffersInWeakList(isolate->heap()) - start); in TEST()
105 CHECK(HasArrayBufferInWeakList(isolate->heap(), *iab1)); in TEST()
106 CHECK(HasArrayBufferInWeakList(isolate->heap(), *iab2)); in TEST()
108 isolate->heap()->CollectAllGarbage(Heap::kAbortIncrementalMarkingMask); in TEST()
109 CHECK_EQ(1, CountArrayBuffersInWeakList(isolate->heap()) - start); in TEST()
[all …]
Dtest-weakmaps.cc85 Heap* heap = isolate->heap(); in TEST() local
110 heap->CollectAllGarbage(false); in TEST()
129 heap->CollectAllGarbage(false); in TEST()
134 heap->CollectAllGarbage(false); in TEST()
146 Heap* heap = isolate->heap(); in TEST() local
170 heap->CollectAllGarbage(false); in TEST()
188 Heap* heap = isolate->heap(); in TEST() local
196 Page* first_page = heap->old_pointer_space()->anchor()->next_page(); in TEST()
204 CHECK(!heap->InNewSpace(object->address())); in TEST()
212 heap->CollectAllGarbage(Heap::kNoGCFlags); in TEST()
[all …]
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
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_comp
/external/chromium_org/tools/telemetry/telemetry/core/heap/
Dchrome_js_heap_snapshot_parser.py7 from telemetry.core.heap import live_heap_object
8 from telemetry.core.heap import retaining_edge
45 heap = json.loads(raw_data)
49 self._node_list = heap['nodes']
50 self._edge_list = heap['edges']
51 self._strings = heap['strings']
53 self._node_types = heap['snapshot']['meta']['node_types'][0]
54 self._edge_types = heap['snapshot']['meta']['edge_types'][0]
55 node_fields = heap['snapshot']['meta']['node_fields']
56 edge_fields = heap['snapshot']['meta']['edge_fields']
[all …]

12345678910>>...28