Lines Matching refs:ltab
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 */
142 ubifs_err(c, "LPT ltab too big");
204 ubifs_err(c, "LPT ltab too big");
403 * @ltab: LPT's own lprops table to pack
406 struct ubifs_lpt_lprops *ltab)
414 pack_bits(c, &addr, &pos, ltab[i].free, c->lpt_spc_bits);
415 pack_bits(c, &addr, &pos, ltab[i].dirty, c->lpt_spc_bits);
457 lnum, dirty, c->ltab[lnum - c->lpt_first].dirty);
459 c->ltab[lnum - c->lpt_first].dirty += dirty;
472 lnum, c->ltab[lnum - c->lpt_first].free,
473 c->ltab[lnum - c->lpt_first].dirty, free, dirty);
475 c->ltab[lnum - c->lpt_first].free = free;
476 c->ltab[lnum - c->lpt_first].dirty = dirty;
607 struct ubifs_lpt_lprops *ltab = NULL;
631 ltab = vmalloc(array_size(sizeof(struct ubifs_lpt_lprops),
633 if (!pnode || !nnode || !buf || !ltab || !lsave) {
638 ubifs_assert(c, !c->ltab);
639 c->ltab = ltab; /* Needed by set_ltab */
643 ltab[i].free = c->leb_size;
644 ltab[i].dirty = 0;
645 ltab[i].tgc = 0;
646 ltab[i].cmt = 0;
821 /* Update ltab before packing it */
826 ubifs_pack_ltab(c, p, ltab);
857 dbg_lp("LPT ltab is at %d:%d", c->ltab_lnum, c->ltab_offs);
861 c->ltab = NULL;
864 vfree(ltab);
1060 c->ltab[i].free = free;
1061 c->ltab[i].dirty = dirty;
1062 c->ltab[i].tgc = 0;
1063 c->ltab[i].cmt = 0;
1780 c->ltab = vmalloc(array_size(sizeof(struct ubifs_lpt_lprops),
1782 if (!c->ltab)
1830 dbg_lp("LPT ltab is at %d:%d", c->ltab_lnum, c->ltab_offs);
1868 if (c->ltab[i].free == c->leb_size) {