Searched refs:heap (Results 1 – 9 of 9) sorted by relevance
| /linux-4.19.296/fs/ubifs/ |
| D | lprops.c | 62 static void move_up_lpt_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, in move_up_lpt_heap() argument
75 val2 = get_heap_comp_val(heap->arr[ppos], cat); in move_up_lpt_heap()
79 heap->arr[ppos]->hpos = hpos; in move_up_lpt_heap()
80 heap->arr[hpos] = heap->arr[ppos]; in move_up_lpt_heap()
81 heap->arr[ppos] = lprops; in move_up_lpt_heap()
99 static void adjust_lpt_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, in adjust_lpt_heap() argument
109 val2 = get_heap_comp_val(heap->arr[ppos], cat); in adjust_lpt_heap()
113 heap->arr[ppos]->hpos = hpos; in adjust_lpt_heap()
114 heap->arr[hpos] = heap->arr[ppos]; in adjust_lpt_heap()
115 heap->arr[ppos] = lprops; in adjust_lpt_heap()
[all …]
|
| D | find.c | 57 struct ubifs_lpt_heap *heap; in valuable() local
63 heap = &c->lpt_heap[cat - 1]; in valuable()
64 if (heap->cnt < heap->max_cnt) in valuable()
141 struct ubifs_lpt_heap *heap; in scan_for_dirty() local
146 heap = &c->lpt_heap[LPROPS_FREE - 1]; in scan_for_dirty()
147 for (i = 0; i < heap->cnt; i++) { in scan_for_dirty()
148 lprops = heap->arr[i]; in scan_for_dirty()
238 struct ubifs_lpt_heap *heap, *idx_heap; in ubifs_find_dirty_leb() local
284 heap = &c->lpt_heap[LPROPS_DIRTY - 1]; in ubifs_find_dirty_leb()
304 if (heap->cnt) { in ubifs_find_dirty_leb()
[all …]
|
| D | lpt_commit.c | 808 struct ubifs_lpt_heap *heap; in populate_lsave() local
835 heap = &c->lpt_heap[LPROPS_DIRTY_IDX - 1]; in populate_lsave()
836 for (i = 0; i < heap->cnt; i++) { in populate_lsave()
837 c->lsave[cnt++] = heap->arr[i]->lnum; in populate_lsave()
841 heap = &c->lpt_heap[LPROPS_DIRTY - 1]; in populate_lsave()
842 for (i = 0; i < heap->cnt; i++) { in populate_lsave()
843 c->lsave[cnt++] = heap->arr[i]->lnum; in populate_lsave()
847 heap = &c->lpt_heap[LPROPS_FREE - 1]; in populate_lsave()
848 for (i = 0; i < heap->cnt; i++) { in populate_lsave()
849 c->lsave[cnt++] = heap->arr[i]->lnum; in populate_lsave()
[all …]
|
| D | debug.h | 270 void ubifs_dump_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap,
296 void dbg_check_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, int cat,
|
| D | lpt.c | 2113 struct ubifs_lpt_heap *heap; in dbg_chk_pnode() local
2175 heap = &c->lpt_heap[cat - 1]; in dbg_chk_pnode()
2176 if (lprops->hpos < heap->cnt && in dbg_chk_pnode()
2177 heap->arr[lprops->hpos] == lprops) in dbg_chk_pnode()
|
| D | debug.c | 893 void ubifs_dump_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, int cat) in ubifs_dump_heap() argument
898 current->pid, cat, heap->cnt); in ubifs_dump_heap()
899 for (i = 0; i < heap->cnt; i++) { in ubifs_dump_heap()
900 struct ubifs_lprops *lprops = heap->arr[i]; in ubifs_dump_heap()
|
| /linux-4.19.296/lib/zlib_deflate/ |
| D | deftree.c | 352 top = s->heap[SMALLEST]; \
353 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
377 int v = s->heap[k]; in pqdownheap()
382 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { in pqdownheap()
386 if (smaller(tree, v, s->heap[j], s->depth)) break; in pqdownheap()
389 s->heap[k] = s->heap[j]; k = j; in pqdownheap()
394 s->heap[k] = v; in pqdownheap()
430 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ in gen_bitlen()
433 n = s->heap[h]; in gen_bitlen()
474 m = s->heap[--h]; in gen_bitlen()
[all …]
|
| D | defutil.h | 179 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member
|
| /linux-4.19.296/drivers/misc/lkdtm/ |
| D | Makefile | 6 lkdtm-$(CONFIG_LKDTM) += heap.o
|