Lines Matching refs:ltab
25 * contains the LEB properties tree, a table of LPT area eraseblocks (ltab), and
152 /* Verify that ltab fits in a single LEB (since ltab is a single node */
154 ubifs_err("LPT ltab too big");
216 ubifs_err("LPT ltab too big");
413 * @ltab: LPT's own lprops table to pack
416 struct ubifs_lpt_lprops *ltab)
424 pack_bits(&addr, &pos, ltab[i].free, c->lpt_spc_bits);
425 pack_bits(&addr, &pos, ltab[i].dirty, c->lpt_spc_bits);
467 lnum, dirty, c->ltab[lnum - c->lpt_first].dirty);
469 c->ltab[lnum - c->lpt_first].dirty += dirty;
482 lnum, c->ltab[lnum - c->lpt_first].free,
483 c->ltab[lnum - c->lpt_first].dirty, free, dirty);
485 c->ltab[lnum - c->lpt_first].free = free;
486 c->ltab[lnum - c->lpt_first].dirty = dirty;
616 struct ubifs_lpt_lprops *ltab = NULL;
635 ltab = vmalloc(sizeof(struct ubifs_lpt_lprops) * c->lpt_lebs);
636 if (!pnode || !nnode || !buf || !ltab || !lsave) {
641 ubifs_assert(!c->ltab);
642 c->ltab = ltab; /* Needed by set_ltab */
646 ltab[i].free = c->leb_size;
647 ltab[i].dirty = 0;
648 ltab[i].tgc = 0;
649 ltab[i].cmt = 0;
819 /* Update ltab before packing it */
824 ubifs_pack_ltab(c, p, ltab);
851 dbg_lp("LPT ltab is at %d:%d", c->ltab_lnum, c->ltab_offs);
855 c->ltab = NULL;
857 vfree(ltab);
1052 c->ltab[i].free = free;
1053 c->ltab[i].dirty = dirty;
1054 c->ltab[i].tgc = 0;
1055 c->ltab[i].cmt = 0;
1628 c->ltab = vmalloc(sizeof(struct ubifs_lpt_lprops) * c->lpt_lebs);
1629 if (!c->ltab)
1671 dbg_lp("LPT ltab is at %d:%d", c->ltab_lnum, c->ltab_offs);
1708 if (c->ltab[i].free == c->leb_size) {