Home
last modified time | relevance | path

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

12

/f-stack/app/redis-5.0.5/deps/jemalloc/test/unit/
H A Dph.c65 heap_print(const heap_t *heap) { in heap_print() argument
69 if (heap->ph_root == NULL) { in heap_print()
73 node_print(heap->ph_root, 0); in heap_print()
120 if (heap->ph_root == NULL) { in heap_validate()
136 heap_print(heap); in heap_validate()
142 heap_t heap; in TEST_BEGIN() local
144 heap_new(&heap); in TEST_BEGIN()
153 heap_remove(heap, node); in node_remove()
178 heap_t heap; in TEST_BEGIN() local
205 heap_new(&heap); in TEST_BEGIN()
[all …]
/f-stack/dpdk/lib/librte_eal/common/
H A Dmalloc_heap.c140 heap->total_size += len; in malloc_add_seg()
252 heap->alloc_count++; in heap_alloc()
272 heap->alloc_count++; in heap_alloc_biggest()
476 req.alloc_req.heap = heap; /* it's in shared memory */ in try_expand_heap_secondary()
844 heap = elem->heap; in malloc_heap_free()
1075 elem = heap->first; in malloc_heap_dump()
1087 struct malloc_heap *heap = elem->heap; in destroy_elem() local
1288 heap->first = NULL; in malloc_heap_create()
1289 heap->last = NULL; in malloc_heap_create()
1311 if (heap->first != NULL || heap->last != NULL) { in malloc_heap_destroy()
[all …]
H A Drte_malloc.c276 heap = tmp; in rte_malloc_heap_get_socket()
281 if (heap != NULL) { in rte_malloc_heap_get_socket()
282 ret = heap->socket_id; in rte_malloc_heap_get_socket()
391 return heap; in find_named_heap()
420 if (heap == NULL) { in rte_malloc_heap_memory_add()
434 heap_name, heap->socket_id); in rte_malloc_heap_memory_add()
468 if (heap == NULL) { in rte_malloc_heap_memory_remove()
518 if (heap == NULL) { in sync_memory()
610 heap = tmp; in rte_malloc_heap_create()
614 if (heap == NULL) { in rte_malloc_heap_create()
[all …]
H A Dmalloc_elem.c134 elem->heap = heap; in malloc_elem_init()
152 struct malloc_heap *heap = elem->heap; in malloc_elem_insert() local
155 if ((heap->first == NULL) != (heap->last == NULL)) { in malloc_elem_insert()
160 if (heap->first == NULL && heap->last == NULL) { in malloc_elem_insert()
162 heap->first = elem; in malloc_elem_insert()
163 heap->last = elem; in malloc_elem_insert()
169 next_elem = heap->first; in malloc_elem_insert()
170 heap->first = elem; in malloc_elem_insert()
173 prev_elem = heap->last; in malloc_elem_insert()
175 heap->last = elem; in malloc_elem_insert()
[all …]
H A Dmalloc_heap.h60 malloc_heap_create(struct malloc_heap *heap, const char *heap_name);
63 malloc_heap_destroy(struct malloc_heap *heap);
77 malloc_heap_add_external_memory(struct malloc_heap *heap,
81 malloc_heap_remove_external_memory(struct malloc_heap *heap, void *va_addr,
91 malloc_heap_get_stats(struct malloc_heap *heap,
95 malloc_heap_dump(struct malloc_heap *heap, FILE *f);
H A Dmalloc_mp.c45 struct malloc_heap *heap; member
183 struct malloc_heap *heap; in handle_alloc_request() local
194 heap = ar->heap; in handle_alloc_request()
204 elem = alloc_pages_on_heap(heap, ar->page_sz, ar->elt_size, ar->socket, in handle_alloc_request()
225 req->alloc_state.heap = heap; in handle_alloc_request()
409 struct malloc_heap *heap = entry->alloc_state.heap; in handle_sync_response() local
416 heap->total_size += entry->alloc_state.map_len; in handle_sync_response()
H A Dmalloc_mp.h33 struct malloc_heap *heap; member
78 alloc_pages_on_heap(struct malloc_heap *heap, uint64_t pg_sz, size_t elt_size,
H A Dmalloc_elem.h22 struct malloc_heap *heap; member
117 struct malloc_heap *heap,
H A Deal_private.h279 uint64_t page_sz, int n_segs, int socket_id, bool heap);
292 int n_segs, int socket_id, int type_msl_idx, bool heap);
H A Deal_common_memory.c190 uint64_t page_sz, int n_segs, int socket_id, bool heap) in eal_memseg_list_init_named() argument
202 msl->heap = heap; in eal_memseg_list_init_named()
213 int n_segs, int socket_id, int type_msl_idx, bool heap) in eal_memseg_list_init() argument
221 msl, name, page_sz, n_segs, socket_id, heap); in eal_memseg_list_init()
/f-stack/freebsd/contrib/octeon-sdk/cvmx-malloc/
H A Darena.c172 dump_heap(heap_info *heap) in dump_heap() argument
174 dump_heap(heap) heap_info *heap; in dump_heap()
180 fprintf(stderr, "Heap %p, size %10lx:\n", heap, (long)heap->size);
181 ptr = (heap->ar_ptr != (mstate)(heap+1)) ?
182 (char*)(heap + 1) : (char*)(heap + 1) + sizeof(struct malloc_state);
187 if(p == top(heap->ar_ptr)) {
/f-stack/freebsd/contrib/zlib/
H A Dtrees.c432 top = s->heap[SMALLEST]; \
433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
456 int v = s->heap[k];
461 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
468 s->heap[k] = s->heap[j]; k = j;
473 s->heap[k] = v;
511 n = s->heap[h];
552 m = s->heap[--h];
669 s->heap[--(s->heap_max)] = m;
683 s->heap[SMALLEST] = node++;
[all …]
H A Ddeflate.h209 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member
/f-stack/dpdk/doc/guides/prog_guide/
H A Denv_abstraction_layer.rst250 + Using heap API's for externally allocated memory
262 to a DPDK malloc heap.
274 * Create a named heap
275 * Add memory area(s) to the heap
279 * Get socket ID used for the heap
283 * If heap is no longer needed, remove it
806 this malloc heap.
810 * last - this points to the last element in the heap.
848 * heap - this pointer is a reference back to the heap structure from which
851 newly-freed block to the heap's free-list.
[all …]
H A Dgeneric_receive_offload_lib.rst67 structures in the heap and stores their pointers in the GRO context.
H A Dwriting_efficient_code.rst38 managing a fragmented heap can be costly and the allocator may not be optimized for parallel alloca…
/f-stack/app/redis-5.0.5/deps/jemalloc/
H A DChangeLog549 + Add raw heap profile support. (@jasone)
617 This bugfix release addresses a few bugs specific to heap profiling.
633 optional extra space. Note that a couple of minor heap profiling
657 - Fix heap profiling bugs:
711 - Implement per thread heap profiling, as well as the ability to
794 - Change the heap profile dump format to support per thread heap profiling,
864 filesystem being mounted during heap profile dumping.
1118 growth-triggered heap profile dumps.
1129 interval- and growth-triggered heap profiles.
1158 This version fixes numerous bugs related to heap profiling.
[all …]
H A DREADME6 such as heap profiling and extensive monitoring/tuning hooks. Modern jemalloc
H A DINSTALL.md133 Enable heap profiling and leak detection functionality. See the "opt.prof"
/f-stack/freebsd/contrib/openzfs/tests/zfs-tests/tests/functional/channel_program/lua_core/
H A Dtst.recursive.zcp18 -- heap, up to the specified memory limit.
/f-stack/dpdk/lib/librte_eal/include/
H A Drte_memory.h77 unsigned int heap; /**< 1 if this list points to a heap */ member
/f-stack/dpdk/drivers/net/virtio/virtio_user/
H A Dvhost_vdpa.c145 if (msl->external && !msl->heap) in vhost_vdpa_map()
/f-stack/freebsd/netpfil/ipfw/
H A Ddummynet.txt196 such objects, we keep them in a priority heap (system_heap).
217 - dn_heap.[ch] implement a binary heap and a generic hash table
331 the current time and the key of the heap. Two types of object (really the
332 heap contains pointer to objects) are in the
337 the scheduler instance is inserted in the heap with a new key depending of
340 instance is no longer inserted in the heap.
342 If the scheduler instance extracted from the heap has the DELETE flag set,
/f-stack/dpdk/lib/librte_eal/linux/
H A Deal_vfio.c1332 if (msl->external && !msl->heap) in type1_map()
1500 if (msl->external && !msl->heap) in vfio_spapr_map_walk()
1528 if (msl->external && !msl->heap) { in vfio_spapr_size_walk()
/f-stack/freebsd/contrib/libsodium/
H A DChangeLog168 Changes have been made to produce smaller code, and the default heap
387 - The _easy API does not require any heap allocations any more and
390 allocate and will not allocate heap memory ever.

12