Searched defs:heap (Results 1 - 25 of 127) sorted by relevance

123456

/external/compiler-rt/test/asan/TestCases/
H A Ddescribe_address.cc9 int *heap = new int[100]; local
10 __asan_describe_address(heap);
17 delete[] heap;
/external/compiler-rt/lib/tsan/tests/unit/
H A Dtsan_shadow_test.cc52 void *heap = malloc(0); local
53 free(heap);
57 CHECK(IsAppMem((uptr)heap));
61 CHECK(IsShadowMem(MemToShadow((uptr)heap)));
/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...]
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_mm.h40 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);
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/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...]
/external/mesa3d/src/mesa/main/
H A Dmm.h38 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);
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/v8/src/
H A Dtype-feedback-vector-inl.h39 Object* TypeFeedbackVector::RawUninitializedSentinel(Heap* heap) { argument
40 return heap->uninitialized_symbol();
H A Dheap-profiler.h8 #include "src/heap-snapshot-generator-inl.h"
19 explicit HeapProfiler(Heap* heap);
70 Heap* heap() const { return ids_->heap(); } function in class:v8::internal::HeapProfiler
H A Dtransitions-inl.h20 #define CONDITIONAL_WRITE_BARRIER(heap, object, offset, value, mode) \
22 heap->incremental_marking()->RecordWrite( \
24 if (heap->InNewSpace(value)) { \
25 heap->RecordWrite(object->address(), offset); \
48 Heap* heap = GetHeap(); local
51 heap, this, kBackPointerStorageOffset, back_pointer, mode);
72 Heap* heap = GetHeap(); local
75 heap, this, kPrototypeTransitionsOffset, transitions, mode);
/external/v8/test/cctest/
H A Dtest-mementos.cc35 Heap* heap = isolate->heap(); local
36 NewSpace* new_space = heap->new_space();
39 heap->CollectAllGarbage(Heap::kAbortIncrementalMarkingMask);
50 memento->set_map_no_write_barrier(heap->allocation_memento_map());
66 CcTest::i_isolate()->heap()->CollectAllGarbage(
79 CcTest::i_isolate()->heap()->CollectGarbage(i::NEW_SPACE);
90 Heap* heap = isolate->heap(); local
114 CHECK_EQ(memento->map(), heap
[all...]
H A Dtest-weakmaps.cc85 Heap* heap = isolate->heap(); local
110 heap->CollectAllGarbage(false);
129 heap->CollectAllGarbage(false);
134 heap->CollectAllGarbage(false);
146 Heap* heap = isolate->heap(); local
170 heap->CollectAllGarbage(false);
188 Heap* heap = isolate->heap(); local
228 Heap* heap = isolate->heap(); local
264 Heap* heap = isolate->heap(); local
[all...]
H A Dtest-weaksets.cc85 Heap* heap = isolate->heap(); local
110 heap->CollectAllGarbage(false);
129 heap->CollectAllGarbage(false);
134 heap->CollectAllGarbage(false);
146 Heap* heap = isolate->heap(); local
170 heap->CollectAllGarbage(false);
188 Heap* heap = isolate->heap(); local
228 Heap* heap = isolate->heap(); local
[all...]
H A Dtest-weaktypedarrays.cc34 #include "src/heap/heap.h"
44 static int CountArrayBuffersInWeakList(Heap* heap) { argument
46 for (Object* o = heap->array_buffers_list();
55 static bool HasArrayBufferInWeakList(Heap* heap, JSArrayBuffer* ab) { argument
56 for (Object* o = heap->array_buffers_list();
92 int start = CountArrayBuffersInWeakList(isolate->heap());
104 CHECK_EQ(2, CountArrayBuffersInWeakList(isolate->heap()) - start);
105 CHECK(HasArrayBufferInWeakList(isolate->heap(), *iab1));
106 CHECK(HasArrayBufferInWeakList(isolate->heap(), *iab
[all...]
/external/compiler-rt/test/asan/TestCases/Linux/
H A Dswapcontext_test.cc80 char *heap = new char[kStackSize + 1]; local
81 ret += Run(argc - 1, 0, heap);
84 ret += Run(argc - 1, 1, heap);
88 delete [] heap;
/external/libdrm/intel/
H A Dmm.h35 struct mem_block *heap; member in struct:mem_block
53 * return: a heap pointer if OK, NULL if error
64 * startSearch = linear offset from start of heap to begin search
67 extern struct mem_block *mmAllocMem(struct mem_block *heap, int size,
79 * input: pointer to a heap, start offset
82 extern struct mem_block *mmFindBlock(struct mem_block *heap, int start);
H A Dmm.c31 void mmDumpMemInfo(const struct mem_block *heap) argument
33 drmMsg("Memory heap %p:\n", (void *)heap);
34 if (heap == 0) {
35 drmMsg(" heap == 0\n");
39 for (p = heap->next; p != heap; p = p->next) {
47 for (p = heap->next_free; p != heap; p = p->next_free) {
59 struct mem_block *heap, *bloc local
162 mmAllocMem(struct mem_block *heap, int size, int align2, int startSearch) argument
194 mmFindBlock(struct mem_block *heap, int start) argument
257 mmDestroy(struct mem_block *heap) argument
[all...]
/external/skia/src/core/
H A DSkPictureFlat.cpp76 void SkFlatController::setBitmapHeap(SkBitmapHeap* heap) { argument
77 SkRefCnt_SafeAssign(fBitmapHeap, heap);
/external/v8/src/extensions/
H A Dstatistics-extension.cc53 Heap* heap = isolate->heap(); local
57 heap->CollectAllGarbage(Heap::kNoGCFlags, "counters extension");
99 AddNumber(args.GetIsolate(), result, heap->new_space()->Size(),
101 AddNumber(args.GetIsolate(), result, heap->new_space()->Available(),
103 AddNumber(args.GetIsolate(), result, heap->new_space()->CommittedMemory(),
105 AddNumber(args.GetIsolate(), result, heap->old_pointer_space()->Size(),
107 AddNumber(args.GetIsolate(), result, heap->old_pointer_space()->Available(),
110 heap->old_pointer_space()->CommittedMemory(),
112 AddNumber(args.GetIsolate(), result, heap
[all...]
/external/mesa3d/src/gallium/drivers/nv30/
H A Dnv30_vertprog.c87 struct nouveau_heap *heap = nv30->screen->vp_exec_heap; local
92 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) {
93 while (heap->next && heap->size < vp->nr_insns) {
94 struct nouveau_heap **evict = heap->next->priv;
98 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) {
130 struct nouveau_heap *heap = nv30->screen->vp_data_heap; local
135 if (nouveau_heap_alloc(heap, vp->nr_consts, vp, &vp->data)) {
136 while (heap->next && heap
[all...]
/external/skia/tests/
H A DTDPQueueTest.cpp15 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/ic/
H A Daccess-compiler.h49 Heap* heap() const { return isolate()->heap(); } function in class:v8::internal::BASE_EMBEDDED
/external/v8/test/cctest/compiler/
H A Dtest-js-constant-cache.cc241 Handle<HeapNumber> heap = T.factory()->NewHeapNumber(value); local
244 Node* node3 = T.Constant(heap);
/external/valgrind/helgrind/tests/
H A Dshmem_abits.c19 If heap, check that one byte before and after is unaccessible */
20 static void check (int testline, void *p, int len, unsigned char access, int heap) argument
37 if (heap) {
77 /* Basic test for an heap object */
78 fprintf(stderr, "basic heap test\n");
94 /* Now shake the heap, to verify various sizes */
95 fprintf(stderr, "doing many heap blocks\n");
115 fprintf(stderr, "random heap free and checks\n");

Completed in 1557 milliseconds

123456