Home
last modified time | relevance | path

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

/linux-5.19.10/fs/ubifs/
Dfind.c42 static int valuable(struct ubifs_info *c, const struct ubifs_lprops *lprops) in valuable() argument
44 int n, cat = lprops->flags & LPROPS_CAT_MASK; in valuable()
54 if (lprops->free + lprops->dirty >= c->dark_wm) in valuable()
84 const struct ubifs_lprops *lprops, int in_tree, in scan_for_dirty_cb() argument
90 if (lprops->flags & LPROPS_TAKEN) in scan_for_dirty_cb()
93 if (!in_tree && valuable(c, lprops)) in scan_for_dirty_cb()
96 if (lprops->free + lprops->dirty < data->min_space) in scan_for_dirty_cb()
99 if (data->exclude_index && lprops->flags & LPROPS_INDEX) in scan_for_dirty_cb()
102 if (lprops->free + lprops->dirty == c->leb_size) { in scan_for_dirty_cb()
106 } else if (lprops->dirty < c->dead_wm) in scan_for_dirty_cb()
[all …]
Dlprops.c26 static int get_heap_comp_val(struct ubifs_lprops *lprops, int cat) in get_heap_comp_val() argument
30 return lprops->free; in get_heap_comp_val()
32 return lprops->free + lprops->dirty; in get_heap_comp_val()
34 return lprops->dirty; in get_heap_comp_val()
51 struct ubifs_lprops *lprops, int cat) in move_up_lpt_heap() argument
55 hpos = lprops->hpos; in move_up_lpt_heap()
58 val1 = get_heap_comp_val(lprops, cat); in move_up_lpt_heap()
69 heap->arr[ppos] = lprops; in move_up_lpt_heap()
70 lprops->hpos = ppos; in move_up_lpt_heap()
88 struct ubifs_lprops *lprops, int hpos, int cat) in adjust_lpt_heap() argument
[all …]
Dlpt.c351 pack_bits(c, &addr, &pos, pnode->lprops[i].free >> 3, in ubifs_pack_pnode()
353 pack_bits(c, &addr, &pos, pnode->lprops[i].dirty >> 3, in ubifs_pack_pnode()
355 if (pnode->lprops[i].flags & LPROPS_INDEX) in ubifs_pack_pnode()
660 pnode->lprops[0].free = c->leb_size - iopos; in ubifs_create_dflt_lpt()
661 pnode->lprops[0].dirty = iopos - node_sz; in ubifs_create_dflt_lpt()
662 pnode->lprops[0].flags = LPROPS_INDEX; in ubifs_create_dflt_lpt()
666 pnode->lprops[1].free = c->leb_size - iopos; in ubifs_create_dflt_lpt()
667 pnode->lprops[1].dirty = iopos - node_sz; in ubifs_create_dflt_lpt()
670 pnode->lprops[i].free = c->leb_size; in ubifs_create_dflt_lpt()
683 pnode->lprops[0].free = c->leb_size; in ubifs_create_dflt_lpt()
[all …]
Dlpt_commit.c763 struct ubifs_lprops *lprops; in populate_lsave() local
776 list_for_each_entry(lprops, &c->empty_list, list) { in populate_lsave()
777 c->lsave[cnt++] = lprops->lnum; in populate_lsave()
781 list_for_each_entry(lprops, &c->freeable_list, list) { in populate_lsave()
782 c->lsave[cnt++] = lprops->lnum; in populate_lsave()
786 list_for_each_entry(lprops, &c->frdi_idx_list, list) { in populate_lsave()
787 c->lsave[cnt++] = lprops->lnum; in populate_lsave()
1967 struct ubifs_lprops *lprops; in dbg_populate_lsave() local
1979 list_for_each_entry(lprops, &c->empty_list, list) in dbg_populate_lsave()
1980 c->lsave[prandom_u32() % c->lsave_cnt] = lprops->lnum; in dbg_populate_lsave()
[all …]
Dsb.c826 struct ubifs_lprops *lprops; in fixup_free_space() local
875 lprops = ubifs_lpt_lookup(c, lnum); in fixup_free_space()
876 if (IS_ERR(lprops)) { in fixup_free_space()
877 err = PTR_ERR(lprops); in fixup_free_space()
881 if (lprops->free > 0) { in fixup_free_space()
882 err = fixup_leb(c, lnum, c->leb_size - lprops->free); in fixup_free_space()
DMakefile6 ubifs-y += budget.o find.o tnc_commit.o compress.o lpt.o lprops.o
Dubifs.h586 struct ubifs_lprops lprops[UBIFS_LPT_FANOUT]; member
658 const struct ubifs_lprops *lprops,
2003 void ubifs_add_to_cat(struct ubifs_info *c, struct ubifs_lprops *lprops,
2007 void ubifs_ensure_cat(struct ubifs_info *c, struct ubifs_lprops *lprops);
2009 const struct ubifs_lprops *lprops);
Ddebug.c915 struct ubifs_lprops *lprops = heap->arr[i]; in ubifs_dump_heap() local
918 i, lprops->lnum, lprops->hpos, lprops->free, in ubifs_dump_heap()
919 lprops->dirty, lprops->flags); in ubifs_dump_heap()
935 struct ubifs_lprops *lp = &pnode->lprops[i]; in ubifs_dump_pnode()