Home
last modified time | relevance | path

Searched refs:lprops (Results 1 – 8 of 8) sorted by relevance

/linux-4.1.27/fs/ubifs/
Dfind.c54 static int valuable(struct ubifs_info *c, const struct ubifs_lprops *lprops) in valuable() argument
56 int n, cat = lprops->flags & LPROPS_CAT_MASK; in valuable()
66 if (lprops->free + lprops->dirty >= c->dark_wm) in valuable()
96 const struct ubifs_lprops *lprops, int in_tree, in scan_for_dirty_cb() argument
102 if (lprops->flags & LPROPS_TAKEN) in scan_for_dirty_cb()
105 if (!in_tree && valuable(c, lprops)) in scan_for_dirty_cb()
108 if (lprops->free + lprops->dirty < data->min_space) in scan_for_dirty_cb()
111 if (data->exclude_index && lprops->flags & LPROPS_INDEX) in scan_for_dirty_cb()
114 if (lprops->free + lprops->dirty == c->leb_size) { in scan_for_dirty_cb()
118 } else if (lprops->dirty < c->dead_wm) in scan_for_dirty_cb()
[all …]
Dlprops.c38 static int get_heap_comp_val(struct ubifs_lprops *lprops, int cat) in get_heap_comp_val() argument
42 return lprops->free; in get_heap_comp_val()
44 return lprops->free + lprops->dirty; in get_heap_comp_val()
46 return lprops->dirty; in get_heap_comp_val()
63 struct ubifs_lprops *lprops, int cat) in move_up_lpt_heap() argument
67 hpos = lprops->hpos; in move_up_lpt_heap()
70 val1 = get_heap_comp_val(lprops, cat); in move_up_lpt_heap()
81 heap->arr[ppos] = lprops; in move_up_lpt_heap()
82 lprops->hpos = ppos; in move_up_lpt_heap()
100 struct ubifs_lprops *lprops, int hpos, int cat) in adjust_lpt_heap() argument
[all …]
Dlpt.c361 pack_bits(&addr, &pos, pnode->lprops[i].free >> 3, in ubifs_pack_pnode()
363 pack_bits(&addr, &pos, pnode->lprops[i].dirty >> 3, in ubifs_pack_pnode()
365 if (pnode->lprops[i].flags & LPROPS_INDEX) in ubifs_pack_pnode()
663 pnode->lprops[0].free = c->leb_size - iopos; in ubifs_create_dflt_lpt()
664 pnode->lprops[0].dirty = iopos - node_sz; in ubifs_create_dflt_lpt()
665 pnode->lprops[0].flags = LPROPS_INDEX; in ubifs_create_dflt_lpt()
669 pnode->lprops[1].free = c->leb_size - iopos; in ubifs_create_dflt_lpt()
670 pnode->lprops[1].dirty = iopos - node_sz; in ubifs_create_dflt_lpt()
673 pnode->lprops[i].free = c->leb_size; in ubifs_create_dflt_lpt()
682 pnode->lprops[0].free = c->leb_size; in ubifs_create_dflt_lpt()
[all …]
Dlpt_commit.c806 struct ubifs_lprops *lprops; in populate_lsave() local
819 list_for_each_entry(lprops, &c->empty_list, list) { in populate_lsave()
820 c->lsave[cnt++] = lprops->lnum; in populate_lsave()
824 list_for_each_entry(lprops, &c->freeable_list, list) { in populate_lsave()
825 c->lsave[cnt++] = lprops->lnum; in populate_lsave()
829 list_for_each_entry(lprops, &c->frdi_idx_list, list) { in populate_lsave()
830 c->lsave[cnt++] = lprops->lnum; in populate_lsave()
2007 struct ubifs_lprops *lprops; in dbg_populate_lsave() local
2019 list_for_each_entry(lprops, &c->empty_list, list) in dbg_populate_lsave()
2020 c->lsave[prandom_u32() % c->lsave_cnt] = lprops->lnum; in dbg_populate_lsave()
[all …]
Dsb.c700 struct ubifs_lprops *lprops; in fixup_free_space() local
749 lprops = ubifs_lpt_lookup(c, lnum); in fixup_free_space()
750 if (IS_ERR(lprops)) { in fixup_free_space()
751 err = PTR_ERR(lprops); in fixup_free_space()
755 if (lprops->free > 0) { in fixup_free_space()
756 err = fixup_leb(c, lnum, c->leb_size - lprops->free); in fixup_free_space()
DMakefile5 ubifs-y += budget.o find.o tnc_commit.o compress.o lpt.o lprops.o
Dubifs.h580 struct ubifs_lprops lprops[UBIFS_LPT_FANOUT]; member
652 const struct ubifs_lprops *lprops,
1728 void ubifs_add_to_cat(struct ubifs_info *c, struct ubifs_lprops *lprops,
1732 void ubifs_ensure_cat(struct ubifs_info *c, struct ubifs_lprops *lprops);
1734 const struct ubifs_lprops *lprops);
Ddebug.c896 struct ubifs_lprops *lprops = heap->arr[i]; in ubifs_dump_heap() local
899 i, lprops->lnum, lprops->hpos, lprops->free, in ubifs_dump_heap()
900 lprops->dirty, lprops->flags); in ubifs_dump_heap()
916 struct ubifs_lprops *lp = &pnode->lprops[i]; in ubifs_dump_pnode()