| /kernel/linux/linux-5.10/fs/ubifs/ |
| H A D | lpt_commit.c | 132 lnum, c->ltab[lnum - c->lpt_first].free, in upd_ltab()
133 c->ltab[lnum - c->lpt_first].dirty, free, dirty); in upd_ltab()
135 c->ltab[lnum - c->lpt_first].free = free; in upd_ltab()
136 c->ltab[lnum - c->lpt_first].dirty += dirty; in upd_ltab()
144 * This function finds the next empty LEB in the ltab starting from @lnum. If a
155 if (c->ltab[i].tgc || c->ltab[i].cmt) in alloc_lpt_leb()
157 if (c->ltab[i].free == c->leb_size) { in alloc_lpt_leb()
158 c->ltab[i].cmt = 1; in alloc_lpt_leb()
165 if (c->ltab[ in alloc_lpt_leb()
[all...] |
| H A D | lpt.c | 13 * contains the LEB properties tree, a table of LPT area eraseblocks (ltab), and
140 /* Verify that ltab fits in a single LEB (since ltab is a single node */ in ubifs_calc_lpt_geom()
142 ubifs_err(c, "LPT ltab too big"); in ubifs_calc_lpt_geom()
204 ubifs_err(c, "LPT ltab too big"); in calc_dflt_lpt_geom()
403 * @ltab: LPT's own lprops table to pack
406 struct ubifs_lpt_lprops *ltab) in ubifs_pack_ltab()
414 pack_bits(c, &addr, &pos, ltab[i].free, c->lpt_spc_bits); in ubifs_pack_ltab()
415 pack_bits(c, &addr, &pos, ltab[i].dirty, c->lpt_spc_bits); in ubifs_pack_ltab()
457 lnum, dirty, c->ltab[lnu in ubifs_add_lpt_dirt()
405 ubifs_pack_ltab(struct ubifs_info *c, void *buf, struct ubifs_lpt_lprops *ltab) ubifs_pack_ltab() argument
607 struct ubifs_lpt_lprops *ltab = NULL; ubifs_create_dflt_lpt() local
[all...] |
| H A D | debug.c | 820 pr_err("\tLPT ltab is at %d:%d\n", c->ltab_lnum, c->ltab_offs); in ubifs_dump_lpt_info()
826 i + c->lpt_first, c->ltab[i].free, c->ltab[i].dirty, in ubifs_dump_lpt_info()
827 c->ltab[i].tgc, c->ltab[i].cmt); in ubifs_dump_lpt_info()
|
| H A D | ubifs.h | 239 * LTAB_DIRTY: ltab node is dirty
1193 * @lpt_drty_flgs: dirty flags for LPT special nodes e.g. ltab
1215 * @ltab: LPT's own lprops table
1458 struct ubifs_lpt_lprops *ltab; member
1947 struct ubifs_lpt_lprops *ltab);
|
| H A D | sb.c | 854 int free = c->ltab[lnum - c->lpt_first].free; in fixup_free_space()
|
| /kernel/linux/linux-6.6/fs/ubifs/ |
| H A D | lpt_commit.c | 132 lnum, c->ltab[lnum - c->lpt_first].free, in upd_ltab()
133 c->ltab[lnum - c->lpt_first].dirty, free, dirty); in upd_ltab()
135 c->ltab[lnum - c->lpt_first].free = free; in upd_ltab()
136 c->ltab[lnum - c->lpt_first].dirty += dirty; in upd_ltab()
144 * This function finds the next empty LEB in the ltab starting from @lnum. If a
155 if (c->ltab[i].tgc || c->ltab[i].cmt) in alloc_lpt_leb()
157 if (c->ltab[i].free == c->leb_size) { in alloc_lpt_leb()
158 c->ltab[i].cmt = 1; in alloc_lpt_leb()
165 if (c->ltab[ in alloc_lpt_leb()
[all...] |
| H A D | lpt.c | 13 * contains the LEB properties tree, a table of LPT area eraseblocks (ltab), and
140 /* Verify that ltab fits in a single LEB (since ltab is a single node */ in ubifs_calc_lpt_geom()
142 ubifs_err(c, "LPT ltab too big"); in ubifs_calc_lpt_geom()
204 ubifs_err(c, "LPT ltab too big"); in calc_dflt_lpt_geom()
403 * @ltab: LPT's own lprops table to pack
406 struct ubifs_lpt_lprops *ltab) in ubifs_pack_ltab()
414 pack_bits(c, &addr, &pos, ltab[i].free, c->lpt_spc_bits); in ubifs_pack_ltab()
415 pack_bits(c, &addr, &pos, ltab[i].dirty, c->lpt_spc_bits); in ubifs_pack_ltab()
457 lnum, dirty, c->ltab[lnu in ubifs_add_lpt_dirt()
405 ubifs_pack_ltab(struct ubifs_info *c, void *buf, struct ubifs_lpt_lprops *ltab) ubifs_pack_ltab() argument
607 struct ubifs_lpt_lprops *ltab = NULL; ubifs_create_dflt_lpt() local
[all...] |
| H A D | debug.c | 820 pr_err("\tLPT ltab is at %d:%d\n", c->ltab_lnum, c->ltab_offs); in ubifs_dump_lpt_info()
826 i + c->lpt_first, c->ltab[i].free, c->ltab[i].dirty, in ubifs_dump_lpt_info()
827 c->ltab[i].tgc, c->ltab[i].cmt); in ubifs_dump_lpt_info()
|
| H A D | ubifs.h | 248 * LTAB_DIRTY: ltab node is dirty
1214 * @lpt_drty_flgs: dirty flags for LPT special nodes e.g. ltab
1236 * @ltab: LPT's own lprops table
1486 struct ubifs_lpt_lprops *ltab; member
1976 struct ubifs_lpt_lprops *ltab);
|
| H A D | sb.c | 857 int free = c->ltab[lnum - c->lpt_first].free; in fixup_free_space()
|