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

1234567

/external/v8/src/snapshot/
H A Dnatives-common.cc7 #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/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/syslinux/efi/
H A Dmem.c9 void *efi_malloc(size_t size, enum heap heap, malloc_tag_t tag) argument
/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/libdrm/intel/
H A Dmm.h41 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 drm_private extern struct mem_block *mmAllocMem(struct mem_block *heap,
H A Dmm.c36 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...]
/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 == 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...]
/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/heap/
H A Darray-buffer-tracker-inl.h6 #include "src/heap/array-buffer-tracker.h"
7 #include "src/heap/heap.h"
13 void ArrayBufferTracker::RegisterNew(Heap* heap, JSArrayBuffer* buffer) { argument
31 reinterpret_cast<v8::Isolate*>(heap->isolate())
35 void ArrayBufferTracker::Unregister(Heap* heap, JSArrayBuffer* buffer) { argument
47 heap->update_external_memory(-static_cast<intptr_t>(length));
H A Dincremental-marking-job.cc5 #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 Dscavenger-inl.h8 #include "src/heap/scavenger.h"
14 DCHECK(object->GetIsolate()->heap()->InFromSpace(object));
16 // We use the first word (where the map pointer usually is) of a heap
26 DCHECK(object->GetIsolate()->heap()->InFromSpace(*p));
40 SlotCallbackResult Scavenger::CheckAndScavengeObject(Heap* heap, argument
44 if (heap->InFromSpace(object)) {
55 if (heap->InToSpace(object)) {
65 void StaticScavengeVisitor::VisitPointer(Heap* heap, HeapObject* obj, argument
68 if (!heap->InNewSpace(object)) return;
H A Dscavenger.h8 #include "src/heap/objects-visiting.h"
9 #include "src/heap/slot-set.h"
19 explicit Scavenger(Heap* heap) : heap_(heap) {} argument
26 // ensure the precondition that the object is (a) a heap object and (b) in
27 // the heap's from space.
29 static inline SlotCallbackResult CheckAndScavengeObject(Heap* heap,
36 // of the heap (i.e. incremental marking, logging and profiling).
40 Heap* heap() { return heap_; } function in class:v8::internal::Scavenger
52 explicit ScavengeVisitor(Heap* heap) argument
[all...]
H A Dstore-buffer.cc5 #include "src/heap/store-buffer.h"
10 #include "src/heap/incremental-marking.h"
18 StoreBuffer::StoreBuffer(Heap* heap) argument
19 : heap_(heap),
82 isolate->heap()->store_buffer()->FlipStoreBuffers();
H A Darray-buffer-tracker.cc5 #include "src/heap/array-buffer-tracker.h"
6 #include "src/heap/array-buffer-tracker-inl.h"
7 #include "src/heap/heap.h"
78 void ArrayBufferTracker::FreeDeadInNewSpace(Heap* heap) { argument
79 DCHECK_EQ(heap->gc_state(), Heap::HeapState::SCAVENGE);
80 for (Page* page : PageRange(heap->new_space()->FromSpaceStart(),
81 heap->new_space()->FromSpaceEnd())) {
85 heap->account_external_memory_concurrently_freed();
H A Darray-buffer-tracker.h33 inline static void RegisterNew(Heap* heap, JSArrayBuffer* buffer);
34 inline static void Unregister(Heap* heap, JSArrayBuffer* buffer);
38 static void FreeDeadInNewSpace(Heap* heap);
68 explicit LocalArrayBufferTracker(Heap* heap) : heap_(heap) {} argument
/external/v8/src/
H A Dobjects-body-descriptors.h43 static inline void IteratePointers(Heap* heap, HeapObject* obj,
51 static inline void IteratePointer(Heap* heap, HeapObject* obj, int offset);
64 static inline void IterateBodyImpl(Heap* heap, HeapObject* obj,
96 Heap* heap = obj->GetHeap(); local
97 IterateBodyImpl<StaticVisitor>(heap, obj, start_offset, end_offset);
128 Heap* heap = obj->GetHeap(); local
129 IterateBodyImpl<StaticVisitor>(heap, obj, start_offset, object_size);
/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/v8/src/runtime/
H A Druntime-liveedit.cc18 // For a script finds all SharedFunctionInfo's in the heap that points
31 Heap* heap = isolate->heap(); local
33 HeapIterator iterator(heap);
99 return isolate->heap()->null_value();
116 return isolate->heap()->undefined_value();
128 return isolate->heap()->undefined_value();
142 return isolate->heap()->undefined_value();
168 return isolate->heap()->undefined_value();
188 return isolate->heap()
280 Heap* heap = isolate->heap(); local
[all...]
/external/mesa3d/src/gallium/auxiliary/pipebuffer/
H A Dpb_slab.c33 /* All slab allocations from the same heap and with the same size belong
88 /* Allocate a slab entry of the given size from the given heap.
98 pb_slab_alloc(struct pb_slabs *slabs, unsigned size, unsigned heap) argument
107 assert(heap < slabs->num_heaps);
109 group_index = heap * slabs->num_orders + (order - slabs->min_order);
139 slab = slabs->slab_alloc(slabs->priv, heap, 1 << order, group_index);
/external/mesa3d/src/gallium/drivers/nouveau/nv30/
H A Dnv30_vertprog.c89 struct nouveau_heap *heap = nv30->screen->vp_exec_heap; local
94 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) {
95 while (heap->next && heap->size < vp->nr_insns) {
96 struct nouveau_heap **evict = heap->next->priv;
100 if (nouveau_heap_alloc(heap, vp->nr_insns, &vp->exec, &vp->exec)) {
132 struct nouveau_heap *heap = nv30->screen->vp_data_heap; local
137 if (nouveau_heap_alloc(heap, vp->nr_consts, vp, &vp->data)) {
138 while (heap->next && heap
[all...]
/external/syslinux/core/mem/
H A Dmalloc.c25 unsigned int heap = ARENA_HEAP_GET(fp->a.attrs); local
36 ARENA_HEAP_SET(nfp->a.attrs, heap);
70 void *bios_malloc(size_t size, enum heap heap, malloc_tag_t tag) argument
73 struct free_arena_header *head = &__core_malloc_head[heap];
92 static void *_malloc(size_t size, enum heap heap, malloc_tag_t tag) argument
97 size, heap, tag, __builtin_return_address(0));
100 p = firmware->mem->malloc(size, heap, tag);

Completed in 3108 milliseconds

1234567