Searched defs:heap (Results 1 - 5 of 5) sorted by relevance
/fs/ubifs/ |
H A D | find.c | 57 struct ubifs_lpt_heap *heap; local 63 heap = &c->lpt_heap[cat - 1]; 64 if (heap->cnt < heap->max_cnt) 141 struct ubifs_lpt_heap *heap; local 145 /* There may be an LEB with enough dirty space on the free heap */ 146 heap = &c->lpt_heap[LPROPS_FREE - 1]; 147 for (i = 0; i < heap->cnt; i++) { 148 lprops = heap->arr[i]; 156 * A LEB may have fallen off of the bottom of the dirty heap, an 238 struct ubifs_lpt_heap *heap, *idx_heap; local 412 struct ubifs_lpt_heap *heap; local 841 struct ubifs_lpt_heap *heap; local [all...] |
H A D | lprops.c | 34 * get_heap_comp_val - get the LEB properties value for heap comparisons. 51 * move_up_lpt_heap - move a new heap entry up as far as possible. 53 * @heap: LEB category heap 57 * New entries to a heap are added at the bottom and then moved up until the 62 static void move_up_lpt_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, argument 69 return; /* Already top of the heap */ 71 /* Compare to parent and, if greater, move up the heap */ 75 val2 = get_heap_comp_val(heap->arr[ppos], cat); 79 heap 99 adjust_lpt_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, struct ubifs_lprops *lprops, int hpos, int cat) argument 181 struct ubifs_lpt_heap *heap = &c->lpt_heap[cat - 1]; local 229 struct ubifs_lpt_heap *heap; local 260 struct ubifs_lpt_heap *heap; local 456 struct ubifs_lpt_heap *heap; local 771 struct ubifs_lpt_heap *heap; local 942 struct ubifs_lpt_heap *heap = &c->lpt_heap[cat - 1]; local 964 dbg_check_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, int cat, int add_pos) argument 1085 struct ubifs_lpt_heap *heap = &c->lpt_heap[cat - 1]; local [all...] |
H A D | lpt_commit.c | 807 struct ubifs_lpt_heap *heap; local 834 heap = &c->lpt_heap[LPROPS_DIRTY_IDX - 1]; 835 for (i = 0; i < heap->cnt; i++) { 836 c->lsave[cnt++] = heap->arr[i]->lnum; 840 heap = &c->lpt_heap[LPROPS_DIRTY - 1]; 841 for (i = 0; i < heap->cnt; i++) { 842 c->lsave[cnt++] = heap->arr[i]->lnum; 846 heap = &c->lpt_heap[LPROPS_FREE - 1]; 847 for (i = 0; i < heap->cnt; i++) { 848 c->lsave[cnt++] = heap 2008 struct ubifs_lpt_heap *heap; local [all...] |
H A D | lpt.c | 2107 struct ubifs_lpt_heap *heap; local 2169 heap = &c->lpt_heap[cat - 1]; 2170 if (lprops->hpos < heap->cnt && 2171 heap->arr[lprops->hpos] == lprops) 2186 ubifs_err("LEB %d cat %d not found in cat heap/list",
|
H A D | debug.c | 889 void ubifs_dump_heap(struct ubifs_info *c, struct ubifs_lpt_heap *heap, int cat) argument 893 pr_err("(pid %d) start dumping heap cat %d (%d elements)\n", 894 current->pid, cat, heap->cnt); 895 for (i = 0; i < heap->cnt; i++) { 896 struct ubifs_lprops *lprops = heap->arr[i]; 902 pr_err("(pid %d) finish dumping heap\n", current->pid);
|
Completed in 59 milliseconds