Home
last modified time | relevance | path

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

123456

/openbmc/linux/include/linux/
H A Dmin_heap.h39 void *data = heap->data; in min_heapify()
42 if (pos * 2 + 1 >= heap->nr) in min_heapify()
74 min_heapify(heap, i, func); in min_heapify_all()
82 void *data = heap->data; in min_heap_pop()
88 heap->nr--; in min_heap_pop()
90 min_heapify(heap, 0, func); in min_heap_pop()
104 min_heapify(heap, 0, func); in min_heap_pop_push()
112 void *data = heap->data; in min_heap_push()
116 if (WARN_ONCE(heap->nr >= heap->size, "Pushing on a full heap")) in min_heap_push()
120 pos = heap->nr; in min_heap_push()
[all …]
H A Ddma-heap.h24 struct dma_buf *(*allocate)(struct dma_heap *heap,
51 void *dma_heap_get_drvdata(struct dma_heap *heap);
60 const char *dma_heap_get_name(struct dma_heap *heap);
/openbmc/linux/lib/
H A Dtest_min_heap.c33 struct min_heap *heap, in pop_verify_heap() argument
36 int *values = heap->data; in pop_verify_heap()
41 min_heap_pop(heap, funcs); in pop_verify_heap()
42 while (heap->nr > 0) { in pop_verify_heap()
57 min_heap_pop(heap, funcs); in pop_verify_heap()
66 struct min_heap heap = { in test_heapify_all() local
84 heap.nr = ARRAY_SIZE(values); in test_heapify_all()
99 struct min_heap heap = { in test_heap_push() local
118 while (heap.nr < heap.size) { in test_heap_push()
132 struct min_heap heap = { in test_heap_pop_push() local
[all …]
/openbmc/linux/drivers/dma-buf/
H A Ddma-heap.c67 dmabuf = heap->ops->allocate(heap, len, fd_flags, heap_flags); in dma_heap_buffer_alloc()
84 if (!heap) { in dma_heap_open()
204 return heap->priv; in dma_heap_get_drvdata()
216 return heap->name; in dma_heap_get_name()
236 heap = kzalloc(sizeof(*heap), GFP_KERNEL); in dma_heap_add()
237 if (!heap) in dma_heap_add()
257 ret = cdev_add(&heap->heap_cdev, heap->heap_devt, 1); in dma_heap_add()
266 heap->heap_devt, in dma_heap_add()
268 heap->name); in dma_heap_add()
291 return heap; in dma_heap_add()
[all …]
/openbmc/u-boot/lib/bzip2/
H A Dbzlib_huffman.c77 zz = z; tmp = heap[zz]; \
78 while (weight[tmp] < weight[heap[zz >> 1]]) { \
79 heap[zz] = heap[zz >> 1]; \
93 weight[heap[yy+1]] < weight[heap[yy]]) \
96 heap[zz] = heap[yy]; \
116 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; in BZ2_hbMakeCodeLengths() local
128 heap[0] = 0; in BZ2_hbMakeCodeLengths()
135 heap[nHeap] = i; in BZ2_hbMakeCodeLengths()
142 n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1); in BZ2_hbMakeCodeLengths()
143 n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1); in BZ2_hbMakeCodeLengths()
[all …]
/openbmc/u-boot/fs/ubifs/
H A Dlprops.c71 heap->arr[hpos] = heap->arr[ppos]; in move_up_lpt_heap()
105 heap->arr[hpos] = heap->arr[ppos]; in adjust_lpt_heap()
124 if (cpos >= heap->cnt) in adjust_lpt_heap()
136 heap->arr[hpos] = heap->arr[cpos]; in adjust_lpt_heap()
144 if (cpos >= heap->cnt) in adjust_lpt_heap()
150 heap->arr[hpos] = heap->arr[cpos]; in adjust_lpt_heap()
174 if (heap->cnt >= heap->max_cnt) { in add_to_lpt_heap()
226 heap->cnt -= 1; in remove_from_lpt_heap()
228 heap->arr[hpos] = heap->arr[heap->cnt]; in remove_from_lpt_heap()
230 adjust_lpt_heap(c, heap, heap->arr[hpos], hpos, cat); in remove_from_lpt_heap()
[all …]
/openbmc/linux/fs/ubifs/
H A Dlprops.c68 heap->arr[hpos] = heap->arr[ppos]; in move_up_lpt_heap()
102 heap->arr[hpos] = heap->arr[ppos]; in adjust_lpt_heap()
121 if (cpos >= heap->cnt) in adjust_lpt_heap()
133 heap->arr[hpos] = heap->arr[cpos]; in adjust_lpt_heap()
141 if (cpos >= heap->cnt) in adjust_lpt_heap()
147 heap->arr[hpos] = heap->arr[cpos]; in adjust_lpt_heap()
171 if (heap->cnt >= heap->max_cnt) { in add_to_lpt_heap()
223 heap->cnt -= 1; in remove_from_lpt_heap()
225 heap->arr[hpos] = heap->arr[heap->cnt]; in remove_from_lpt_heap()
227 adjust_lpt_heap(c, heap, heap->arr[hpos], hpos, cat); in remove_from_lpt_heap()
[all …]
H A Dfind.c45 struct ubifs_lpt_heap *heap; in valuable() local
51 heap = &c->lpt_heap[cat - 1]; in valuable()
52 if (heap->cnt < heap->max_cnt) in valuable()
129 struct ubifs_lpt_heap *heap; in scan_for_dirty() local
136 lprops = heap->arr[i]; in scan_for_dirty()
292 if (heap->cnt) { in ubifs_find_dirty_leb()
293 lp = heap->arr[0]; in ubifs_find_dirty_leb()
400 struct ubifs_lpt_heap *heap; in do_find_free_space() local
422 lprops = heap->arr[i]; in do_find_free_space()
819 struct ubifs_lpt_heap *heap; in find_dirty_idx_leb() local
[all …]
/openbmc/linux/tools/include/nolibc/
H A Dstdlib.h72 struct nolibc_heap *heap; in free() local
78 munmap(heap, heap->len); in free()
133 struct nolibc_heap *heap; in malloc() local
136 len = sizeof(*heap) + len; in malloc()
140 if (__builtin_expect(heap == MAP_FAILED, 0)) in malloc()
143 heap->len = len; in malloc()
144 return heap->user_p; in malloc()
167 struct nolibc_heap *heap; in realloc() local
175 user_p_len = heap->len - sizeof(*heap); in realloc()
188 memcpy(ret, heap->user_p, user_p_len); in realloc()
[all …]
/openbmc/linux/drivers/gpu/drm/nouveau/nvkm/subdev/mmu/
H A Dbase.c258 mmu->type[mmu->type_nr].type = type | mmu->heap[heap].type; in nvkm_mmu_type()
259 mmu->type[mmu->type_nr].heap = heap; in nvkm_mmu_type()
269 mmu->heap[mmu->heap_nr].type = type; in nvkm_mmu_heap()
270 mmu->heap[mmu->heap_nr].size = size; in nvkm_mmu_heap()
282 int heap; in nvkm_mmu_host() local
285 heap = nvkm_mmu_heap(mmu, NVKM_MEM_HOST, ~0ULL); in nvkm_mmu_host()
286 nvkm_mmu_type(mmu, heap, type); in nvkm_mmu_host()
298 nvkm_mmu_type(mmu, heap, type); in nvkm_mmu_host()
323 u8 heap = NVKM_MEM_VRAM; in nvkm_mmu_vram() local
329 heap |= NVKM_MEM_COMP; in nvkm_mmu_vram()
[all …]
/openbmc/linux/drivers/gpu/drm/nouveau/include/nvkm/core/
H A Dmm.h12 u8 heap; member
34 int nvkm_mm_init(struct nvkm_mm *, u8 heap, u32 offset, u32 length, u32 block);
36 int nvkm_mm_head(struct nvkm_mm *, u8 heap, u8 type, u32 size_max,
38 int nvkm_mm_tail(struct nvkm_mm *, u8 heap, u8 type, u32 size_max,
44 nvkm_mm_heap_size(struct nvkm_mm *mm, u8 heap) in nvkm_mm_heap_size() argument
49 if (node->heap == heap) in nvkm_mm_heap_size()
/openbmc/linux/drivers/gpu/drm/nouveau/nvkm/core/
H A Dmm.c99 b->heap = a->heap; in region_head()
111 nvkm_mm_head(struct nvkm_mm *mm, u8 heap, u8 type, u32 size_max, u32 size_min, in nvkm_mm_head() argument
122 if (unlikely(heap != NVKM_MM_HEAP_ANY)) { in nvkm_mm_head()
123 if (this->heap != heap) in nvkm_mm_head()
175 b->heap = a->heap; in region_tail()
186 nvkm_mm_tail(struct nvkm_mm *mm, u8 heap, u8 type, u32 size_max, u32 size_min, in nvkm_mm_tail() argument
198 if (unlikely(heap != NVKM_MM_HEAP_ANY)) { in nvkm_mm_tail()
199 if (this->heap != heap) in nvkm_mm_tail()
240 nvkm_mm_init(struct nvkm_mm *mm, u8 heap, u32 offset, u32 length, u32 block) in nvkm_mm_init() argument
277 node->heap = heap; in nvkm_mm_init()
H A Dgpuobj.c180 ret = nvkm_mm_head(&parent->heap, 0, 1, size, size, in nvkm_gpuobj_ctor()
183 ret = nvkm_mm_tail(&parent->heap, 0, 1, size, size, in nvkm_gpuobj_ctor()
211 return nvkm_mm_init(&gpuobj->heap, 0, 0, gpuobj->size, 1); in nvkm_gpuobj_ctor()
220 nvkm_mm_free(&gpuobj->parent->heap, &gpuobj->node); in nvkm_gpuobj_del()
221 nvkm_mm_fini(&gpuobj->heap); in nvkm_gpuobj_del()
/openbmc/linux/drivers/gpu/drm/nouveau/nvif/
H A Dmmu.c35 kfree(mmu->heap); in nvif_mmu_dtor()
53 mmu->heap = NULL; in nvif_mmu_ctor()
72 mmu->heap = kmalloc_array(mmu->heap_nr, sizeof(*mmu->heap), in nvif_mmu_ctor()
76 if (ret = -ENOMEM, !mmu->heap || !mmu->type) in nvif_mmu_ctor()
92 mmu->heap[i].size = args.size; in nvif_mmu_ctor()
112 mmu->type[i].heap = args.heap; in nvif_mmu_ctor()
/openbmc/linux/Documentation/ABI/testing/
H A Dsysfs-kernel-mm-cma6 heap name (also sometimes called CMA areas).
8 Each CMA heap subdirectory (that is, each
9 /sys/kernel/mm/cma/<cma-heap-name> directory) contains the
15 What: /sys/kernel/mm/cma/<cma-heap-name>/alloc_pages_success
21 What: /sys/kernel/mm/cma/<cma-heap-name>/alloc_pages_fail
/openbmc/linux/drivers/dma-buf/heaps/
H A DKconfig5 Choose this option to enable the system dmabuf heap. The system heap
12 Choose this option to enable dma-buf CMA heap. This heap is backed
H A Dcma_heap.c27 struct dma_heap *heap; member
32 struct cma_heap *heap; member
248 struct cma_heap *cma_heap = buffer->heap; in cma_heap_dma_buf_release()
276 static struct dma_buf *cma_heap_allocate(struct dma_heap *heap, in cma_heap_allocate() argument
281 struct cma_heap *cma_heap = dma_heap_get_drvdata(heap); in cma_heap_allocate()
340 buffer->heap = cma_heap; in cma_heap_allocate()
344 exp_info.exp_name = dma_heap_get_name(heap); in cma_heap_allocate()
384 cma_heap->heap = dma_heap_add(&exp_info); in __add_cma_heap()
385 if (IS_ERR(cma_heap->heap)) { in __add_cma_heap()
386 int ret = PTR_ERR(cma_heap->heap); in __add_cma_heap()
/openbmc/linux/drivers/md/bcache/
H A Dmovinggc.c194 return (b = heap_peek(&ca->heap)) ? GC_SECTORS_USED(b) : 0; in bucket_heap_top()
212 ca->heap.used = 0; in bch_moving_gc()
221 if (!heap_full(&ca->heap)) { in bch_moving_gc()
223 heap_add(&ca->heap, b, bucket_cmp); in bch_moving_gc()
224 } else if (bucket_cmp(b, heap_peek(&ca->heap))) { in bch_moving_gc()
228 ca->heap.data[0] = b; in bch_moving_gc()
229 heap_sift(&ca->heap, 0, bucket_cmp); in bch_moving_gc()
234 heap_pop(&ca->heap, b, bucket_cmp); in bch_moving_gc()
238 while (heap_pop(&ca->heap, b, bucket_cmp)) in bch_moving_gc()
H A Dutil.h40 #define init_heap(heap, _size, gfp) \ argument
43 (heap)->used = 0; \
44 (heap)->size = (_size); \
45 _bytes = (heap)->size * sizeof(*(heap)->data); \
46 (heap)->data = kvmalloc(_bytes, (gfp) & GFP_KERNEL); \
47 (heap)->data; \
50 #define free_heap(heap) \ argument
52 kvfree((heap)->data); \
53 (heap)->data = NULL; \
/openbmc/linux/lib/zlib_deflate/
H A Ddeftree.c298 top = s->heap[SMALLEST]; \
299 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
323 int v = s->heap[k]; in pqdownheap()
328 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { in pqdownheap()
335 s->heap[k] = s->heap[j]; k = j; in pqdownheap()
340 s->heap[k] = v; in pqdownheap()
379 n = s->heap[h]; in gen_bitlen()
420 m = s->heap[--h]; in gen_bitlen()
539 s->heap[--(s->heap_max)] = m; in build_tree()
552 s->heap[SMALLEST] = node++; in build_tree()
[all …]
/openbmc/u-boot/lib/zlib/
H A Dtrees.c440 top = s->heap[SMALLEST]; \
441 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
464 int v = s->heap[k];
469 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
476 s->heap[k] = s->heap[j]; k = j;
481 s->heap[k] = v;
519 n = s->heap[h];
560 m = s->heap[--h];
677 s->heap[--(s->heap_max)] = m;
691 s->heap[SMALLEST] = node++;
[all …]
/openbmc/openbmc/meta-openembedded/meta-oe/recipes-devtools/dmalloc/dmalloc/
H A D02-Makefile.in.patch215 error_val.h heap.h
218 + error_val.h heap.h
249 error_val.h heap.h
252 + error_val.h heap.h
273 heap.o: heap.c conf.h settings.h dmalloc.h chunk.h compat.h debug_tok.h \
274 dmalloc_loc.h error.h error_val.h heap.h
276 + dmalloc_loc.h error.h error_val.h heap.h
288 heap.h protect.h
290 + heap.h protect.h
295 error_val.h heap.h
[all …]
/openbmc/linux/drivers/gpu/drm/nouveau/nvkm/subdev/instmem/
H A Dnv04.c31 struct nvkm_mm heap; member
103 nvkm_mm_free(&iobj->imem->heap, &iobj->node); in nv04_instobj_dtor()
136 ret = nvkm_mm_head(&imem->heap, 0, 1, size, size, align ? align : 1, &iobj->node); in nv04_instobj_new()
167 ret = nvkm_mm_init(&imem->heap, 0, 0, imem->base.reserved, 1); in nv04_instmem_oneinit()
205 nvkm_mm_fini(&imem->heap); in nv04_instmem_dtor()
H A Dnv40.c32 struct nvkm_mm heap; member
103 nvkm_mm_free(&iobj->imem->heap, &iobj->node); in nv40_instobj_dtor()
136 ret = nvkm_mm_head(&imem->heap, 0, 1, size, size, align ? align : 1, &iobj->node); in nv40_instobj_new()
179 ret = nvkm_mm_init(&imem->heap, 0, 0, imem->base.reserved, 1); in nv40_instmem_oneinit()
221 nvkm_mm_fini(&imem->heap); in nv40_instmem_dtor()
/openbmc/linux/arch/mips/boot/compressed/
H A Dhead.S32 PTR_LA a0, (.heap) /* heap address */
51 .comm .heap,BOOT_HEAP_SIZE,4

123456