Searched refs:ltab (Results 1 - 5 of 5) sorted by relevance
/u-boot/fs/ubifs/ |
H A D | lpt_commit.c | 143 lnum, c->ltab[lnum - c->lpt_first].free, 144 c->ltab[lnum - c->lpt_first].dirty, free, dirty); 146 c->ltab[lnum - c->lpt_first].free = free; 147 c->ltab[lnum - c->lpt_first].dirty += dirty; 155 * This function finds the next empty LEB in the ltab starting from @lnum. If a 166 if (c->ltab[i].tgc || c->ltab[i].cmt) 168 if (c->ltab[i].free == c->leb_size) { 169 c->ltab[i].cmt = 1; 176 if (c->ltab[ [all...] |
H A D | lpt.c | 13 * contains the LEB properties tree, a table of LPT area eraseblocks (ltab), and 149 /* Verify that ltab fits in a single LEB (since ltab is a single node */ 151 ubifs_err(c, "LPT ltab too big"); 213 ubifs_err(c, "LPT ltab too big"); 410 * @ltab: LPT's own lprops table to pack 413 struct ubifs_lpt_lprops *ltab) 421 pack_bits(&addr, &pos, ltab[i].free, c->lpt_spc_bits); 422 pack_bits(&addr, &pos, ltab[i].dirty, c->lpt_spc_bits); 464 lnum, dirty, c->ltab[lnu 412 ubifs_pack_ltab(struct ubifs_info *c, void *buf, struct ubifs_lpt_lprops *ltab) argument 613 struct ubifs_lpt_lprops *ltab = NULL; local [all...] |
H A D | debug.c | 806 pr_err("\tLPT ltab is at %d:%d\n", c->ltab_lnum, c->ltab_offs); 812 i + c->lpt_first, c->ltab[i].free, c->ltab[i].dirty, 813 c->ltab[i].tgc, c->ltab[i].cmt);
|
H A D | ubifs.h | 848 * LTAB_DIRTY: ltab node is dirty 1780 * @lpt_drty_flgs: dirty flags for LPT special nodes e.g. ltab 1802 * @ltab: LPT's own lprops table 2034 struct ubifs_lpt_lprops *ltab; member in struct:ubifs_info 2300 struct ubifs_lpt_lprops *ltab);
|
H A D | sb.c | 743 int free = c->ltab[lnum - c->lpt_first].free;
|
Completed in 71 milliseconds