Home
last modified time | relevance | path

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

/fs/ubifs/
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 …]
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()
130 struct ubifs_lpt_heap *heap; in scan_for_dirty() local
137 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()
401 struct ubifs_lpt_heap *heap; in do_find_free_space() local
423 lprops = heap->arr[i]; in do_find_free_space()
820 struct ubifs_lpt_heap *heap; in find_dirty_idx_leb() local
[all …]
A Dlpt_commit.c764 struct ubifs_lpt_heap *heap; in populate_lsave() local
792 for (i = 0; i < heap->cnt; i++) { in populate_lsave()
793 c->lsave[cnt++] = heap->arr[i]->lnum; in populate_lsave()
797 heap = &c->lpt_heap[LPROPS_DIRTY - 1]; in populate_lsave()
798 for (i = 0; i < heap->cnt; i++) { in populate_lsave()
803 heap = &c->lpt_heap[LPROPS_FREE - 1]; in populate_lsave()
804 for (i = 0; i < heap->cnt; i++) { in populate_lsave()
1966 struct ubifs_lpt_heap *heap; in dbg_populate_lsave() local
1985 for (i = 0; i < heap->cnt; i++) in dbg_populate_lsave()
1988 for (i = 0; i < heap->cnt; i++) in dbg_populate_lsave()
[all …]
A Ddebug.h258 void ubifs_dump_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap,
284 void dbg_check_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, int cat,
A Dlpt.c2266 struct ubifs_lpt_heap *heap; in dbg_chk_pnode() local
2328 heap = &c->lpt_heap[cat - 1]; in dbg_chk_pnode()
2329 if (lprops->hpos < heap->cnt && in dbg_chk_pnode()
2330 heap->arr[lprops->hpos] == lprops) in dbg_chk_pnode()
A Ddebug.c907 void ubifs_dump_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, int cat) in ubifs_dump_heap() argument
912 current->pid, cat, heap->cnt); in ubifs_dump_heap()
913 for (i = 0; i < heap->cnt; i++) { in ubifs_dump_heap()
914 struct ubifs_lprops *lprops = heap->arr[i]; in ubifs_dump_heap()
/fs/bcachefs/
A Dutil.h71 #define init_heap(heap, _size, gfp) \ argument
73 (heap)->nr = 0; \
74 (heap)->size = (_size); \
75 (heap)->data = kvmalloc((heap)->size * sizeof((heap)->data[0]),\
79 #define free_heap(heap) \ argument
81 kvfree((heap)->data); \
82 (heap)->data = NULL; \

Completed in 29 milliseconds