| /src/sys/arch/evbarm/stand/board/ |
| gemini_mem.c | 55 * "bad" things can happen if the gzboot heap is in
63 uint32_t heap, size; local
68 heap = size - BOARD_HEAP_SIZE;
70 printf(">> RAM 0x%x - 0x%x, heap at 0x%x\n", 0, size - 1, heap);
71 setheap((void *)heap, (void *)(size - 1));
|
| ts7200.c | 42 void *heap = (void *)(0x800000 - BOARD_HEAP_SIZE); local
43 setheap(heap, (void *)(0x800000 - 1));
|
| integrator_mem.c | 54 uint32_t heap, size; local
86 heap = size - BOARD_HEAP_SIZE;
88 printf(">> RAM 0x%x - 0x%x, heap at 0x%x\n", 0, size - 1, heap);
89 setheap((void *)heap, (void *)(size - 1));
|
| smdk2410.c | 55 uint32_t start, size, heap; local
60 heap = (start + size) - BOARD_HEAP_SIZE;
62 printf(">> RAM 0x%x - 0x%x, heap at 0x%x\n",
63 start, (start + size) - 1, heap);
64 setheap((void *)heap, (void *)(heap + BOARD_HEAP_SIZE - 1));
|
| becc_mem.c | 65 uint32_t start, size, reg, save, heap; local
93 heap = (start + size) - BOARD_HEAP_SIZE;
95 printf(">> RAM 0x%x - 0x%x, heap at 0x%x\n",
96 start, (start + size) - 1, heap);
97 setheap((void *)heap, (void *)(start + size - 1));
|
| i80312_mem.c | 58 uint32_t start, size, heap; local
76 heap = (start + size) - BOARD_HEAP_SIZE;
78 printf(">> RAM 0x%x - 0x%x, heap at 0x%x\n",
79 start, (start + size) - 1, heap);
80 setheap((void *)heap, (void *)(start + size - 1));
|
| i80321_mem.c | 58 uint32_t start, size, heap; local
76 heap = (start + size) - BOARD_HEAP_SIZE;
78 printf(">> RAM 0x%x - 0x%x, heap at 0x%x\n",
79 start, (start + size) - 1, heap);
80 setheap((void *)heap, (void *)(start + size - 1));
|
| ixp425_mem.c | 74 uint32_t start, size, heap; local
90 heap = (start + size) - BOARD_HEAP_SIZE;
92 printf(">> RAM 0x%x - 0x%x, heap at 0x%x\n",
93 start, (start + size) - 1, heap);
94 setheap((void *)heap, (void *)(start + size - 1));
|
| smdk2800.c | 64 uint32_t start, size, heap; local
71 heap = ROMMONITOR_PAGETABLE - BOARD_HEAP_SIZE;
73 printf(">> RAM 0x%x - 0x%x, heap at 0x%x\n",
74 start, (start + size) - 1, heap);
75 setheap((void *)heap, (void *)(heap + BOARD_HEAP_SIZE - 1));
|
| /src/sys/external/bsd/compiler_rt/dist/lib/tsan/tests/unit/ |
| tsan_shadow_test.cc | 52 void *heap = malloc(0); local
53 free(heap);
57 CHECK(IsAppMem((uptr)heap));
61 CHECK(IsShadowMem(MemToShadow((uptr)heap)));
|
| /src/external/bsd/libevent/dist/test/ |
| regress_minheap.c | 45 check_heap(struct min_heap *heap)
48 for (i = 1; i < heap->n; ++i) {
50 tt_want(evutil_timercmp(&heap->p[i]->ev_timeout,
51 &heap->p[parent_idx]->ev_timeout, >=));
58 struct min_heap heap; local
63 min_heap_ctor_(&heap);
68 min_heap_push_(&heap, inserted[i]);
70 check_heap(&heap);
72 tt_assert(min_heap_size_(&heap) == 1024);
75 min_heap_erase_(&heap, inserted[i])
[all...] |
| /src/external/bsd/ntp/dist/sntp/libevent/test/ |
| regress_minheap.c | 46 check_heap(struct min_heap *heap)
49 for (i = 1; i < heap->n; ++i) {
51 tt_want(evutil_timercmp(&heap->p[i]->ev_timeout,
52 &heap->p[parent_idx]->ev_timeout, >=));
59 struct min_heap heap; local
64 min_heap_ctor_(&heap);
69 min_heap_push_(&heap, inserted[i]);
71 check_heap(&heap);
73 tt_assert(min_heap_size_(&heap) == 1024);
76 min_heap_erase_(&heap, inserted[i])
[all...] |
| /src/external/mpl/bind/dist/tests/isc/ |
| heap_test.c | 29 #include <isc/heap.h>
57 isc_heap_t *heap = NULL; local
62 isc_heap_create(mctx, compare, idx, 0, &heap);
63 assert_non_null(heap);
65 isc_heap_insert(heap, &e1);
68 isc_heap_delete(heap, e1.index);
71 isc_heap_destroy(&heap);
72 assert_null(heap);
|
| /src/lib/libc/include/isc/ |
| heap.h | 1 /* $NetBSD: heap.h,v 1.1.1.4 2009/04/12 16:35:44 christos Exp $ */
28 void **heap; member in struct:heap_context
|
| /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvkm/core/ |
| gpuobj.h | 28 struct nvkm_mm heap; member in struct:nvkm_gpuobj
|
| /src/external/bsd/jemalloc/dist/include/jemalloc/internal/ |
| eset.h | 20 edata_heap_t heap; member in struct:eset_bin_s
23 * the min element in each heap directly, we'd take a cache miss per
|
| /src/external/bsd/jemalloc/include/jemalloc/internal/ |
| eset.h | 20 edata_heap_t heap; member in struct:eset_bin_s
23 * the min element in each heap directly, we'd take a cache miss per
|
| /src/external/bsd/libbind/dist/include/isc/ |
| heap.h | 1 /* $NetBSD: heap.h,v 1.1.1.1 2009/04/12 15:33:33 christos Exp $ */
28 void **heap; member in struct:heap_context
|
| /src/external/gpl3/gdb/dist/sim/aarch64/ |
| memory.c | 156 /* We implement a combined stack and heap. That way the sbrk()
158 an out-of-memory condition by noticing a stack/heap collision.
160 The heap starts at the end of loaded memory and carries on up
166 uint64_t heap = trace_sym_value (CPU_STATE (cpu), "end"); local
168 if (heap == 0)
169 heap = trace_sym_value (CPU_STATE (cpu), "_end");
170 if (heap == 0)
172 heap = STACK_TOP - 0x100000;
176 heap); local
178 return heap;
[all...] |
| /src/external/gpl3/gdb.old/dist/sim/aarch64/ |
| memory.c | 156 /* We implement a combined stack and heap. That way the sbrk()
158 an out-of-memory condition by noticing a stack/heap collision.
160 The heap starts at the end of loaded memory and carries on up
166 uint64_t heap = trace_sym_value (CPU_STATE (cpu), "end"); local
168 if (heap == 0)
169 heap = trace_sym_value (CPU_STATE (cpu), "_end");
170 if (heap == 0)
172 heap = STACK_TOP - 0x100000;
176 heap); local
178 return heap;
[all...] |
| /src/external/mit/libuv/dist/src/ |
| heap-inl.h | 33 /* A binary min heap. The usual properties hold: the root is the lowest
37 * The heap function try hard to detect corrupted tree nodes at the cost
40 struct heap { struct
50 HEAP_EXPORT(void heap_init(struct heap* heap));
51 HEAP_EXPORT(struct heap_node* heap_min(const struct heap* heap));
52 HEAP_EXPORT(void heap_insert(struct heap* heap,
55 HEAP_EXPORT(void heap_remove(struct heap* heap
[all...] |
| /src/sys/arch/ia64/stand/efi/libefi/ |
| efi.c | 44 static EFI_PHYSICAL_ADDRESS heap; variable
82 BS->FreePages(heap, EFI_SIZE_TO_PAGES(heapsize));
102 EFI_SIZE_TO_PAGES(heapsize), &heap);
106 setheap((void *)heap, (void *)(heap + heapsize));
|
| /src/sys/external/bsd/drm/dist/shared-core/ |
| radeon_mem.c | 83 static struct mem_block *alloc_block(struct mem_block *heap, int size,
89 list_for_each(p, heap) {
98 static struct mem_block *find_block(struct mem_block *heap, int start)
102 list_for_each(p, heap)
114 * 'heap' to stop it being subsumed.
133 /* Initialize. How to check for an uninitialized heap?
135 static int init_heap(struct mem_block **heap, int start, int size)
142 *heap = drm_alloc(sizeof(**heap), DRM_MEM_BUFS);
143 if (!*heap) {
224 struct mem_block *block, **heap; local
259 struct mem_block *block, **heap; local
285 struct mem_block **heap; local
[all...] |
| sis_ds.h | 86 struct mem_block_t *heap; member in struct:mem_block_t
95 /* a heap is just the first block in a chain */
115 * return: a heap pointer if OK, NULL if error
126 * startSearch = linear offset from start of heap to begin search
129 PMemBlock mmAllocMem(memHeap_t * heap, int size, int align2, int startSearch);
132 * Returns 1 if the block 'b' is part of the heap 'heap'
134 int mmBlockInHeap(PMemBlock heap, PMemBlock b);
|
| /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvif/ |
| if0008.h | 27 __u8 heap; member in struct:nvif_mmu_type_v0
|
