Lines Matching refs:lnum
137 static void upd_ltab(struct ubifs_info *c, int lnum, int free, int dirty) in upd_ltab() argument
140 lnum, c->ltab[lnum - c->lpt_first].free, in upd_ltab()
141 c->ltab[lnum - c->lpt_first].dirty, free, dirty); in upd_ltab()
142 ubifs_assert(lnum >= c->lpt_first && lnum <= c->lpt_last); in upd_ltab()
143 c->ltab[lnum - c->lpt_first].free = free; in upd_ltab()
144 c->ltab[lnum - c->lpt_first].dirty += dirty; in upd_ltab()
157 static int alloc_lpt_leb(struct ubifs_info *c, int *lnum) in alloc_lpt_leb() argument
161 n = *lnum - c->lpt_first + 1; in alloc_lpt_leb()
167 *lnum = i + c->lpt_first; in alloc_lpt_leb()
177 *lnum = i + c->lpt_first; in alloc_lpt_leb()
192 int lnum, offs, len, alen, done_lsave, done_ltab, err; in layout_cnodes() local
201 lnum = c->nhead_lnum; in layout_cnodes()
208 c->lsave_lnum = lnum; in layout_cnodes()
216 c->ltab_lnum = lnum; in layout_cnodes()
232 upd_ltab(c, lnum, c->leb_size - alen, alen - offs); in layout_cnodes()
234 err = alloc_lpt_leb(c, &lnum); in layout_cnodes()
238 ubifs_assert(lnum >= c->lpt_first && in layout_cnodes()
239 lnum <= c->lpt_last); in layout_cnodes()
243 c->lsave_lnum = lnum; in layout_cnodes()
251 c->ltab_lnum = lnum; in layout_cnodes()
260 cnode->parent->nbranch[cnode->iip].lnum = lnum; in layout_cnodes()
263 c->lpt_lnum = lnum; in layout_cnodes()
275 upd_ltab(c, lnum, c->leb_size - alen, alen - offs); in layout_cnodes()
277 err = alloc_lpt_leb(c, &lnum); in layout_cnodes()
281 ubifs_assert(lnum >= c->lpt_first && in layout_cnodes()
282 lnum <= c->lpt_last); in layout_cnodes()
285 c->lsave_lnum = lnum; in layout_cnodes()
295 upd_ltab(c, lnum, c->leb_size - alen, alen - offs); in layout_cnodes()
297 err = alloc_lpt_leb(c, &lnum); in layout_cnodes()
301 ubifs_assert(lnum >= c->lpt_first && in layout_cnodes()
302 lnum <= c->lpt_last); in layout_cnodes()
304 c->ltab_lnum = lnum; in layout_cnodes()
311 upd_ltab(c, lnum, c->leb_size - alen, alen - offs); in layout_cnodes()
320 lnum, offs, len, done_ltab, done_lsave); in layout_cnodes()
342 static int realloc_lpt_leb(struct ubifs_info *c, int *lnum) in realloc_lpt_leb() argument
346 n = *lnum - c->lpt_first + 1; in realloc_lpt_leb()
350 *lnum = i + c->lpt_first; in realloc_lpt_leb()
357 *lnum = i + c->lpt_first; in realloc_lpt_leb()
371 int lnum, offs, len, from, err, wlen, alen, done_ltab, done_lsave; in write_cnodes() local
378 lnum = c->nhead_lnum; in write_cnodes()
383 err = ubifs_leb_unmap(c, lnum); in write_cnodes()
415 err = ubifs_leb_write(c, lnum, buf + from, from, in write_cnodes()
421 err = realloc_lpt_leb(c, &lnum); in write_cnodes()
425 ubifs_assert(lnum >= c->lpt_first && in write_cnodes()
426 lnum <= c->lpt_last); in write_cnodes()
427 err = ubifs_leb_unmap(c, lnum); in write_cnodes()
474 err = ubifs_leb_write(c, lnum, buf + from, from, alen); in write_cnodes()
478 err = realloc_lpt_leb(c, &lnum); in write_cnodes()
482 ubifs_assert(lnum >= c->lpt_first && in write_cnodes()
483 lnum <= c->lpt_last); in write_cnodes()
484 err = ubifs_leb_unmap(c, lnum); in write_cnodes()
500 err = ubifs_leb_write(c, lnum, buf + from, from, alen); in write_cnodes()
504 err = realloc_lpt_leb(c, &lnum); in write_cnodes()
508 ubifs_assert(lnum >= c->lpt_first && in write_cnodes()
509 lnum <= c->lpt_last); in write_cnodes()
510 err = ubifs_leb_unmap(c, lnum); in write_cnodes()
523 err = ubifs_leb_write(c, lnum, buf + from, from, alen); in write_cnodes()
532 c->nhead_lnum = lnum; in write_cnodes()
545 lnum, offs, len, done_ltab, done_lsave); in write_cnodes()
571 if (nnode->nbranch[iip].lnum) in next_pnode_to_dirty()
582 if (nnode->nbranch[iip].lnum) in next_pnode_to_dirty()
595 if (nnode->nbranch[iip].lnum) in next_pnode_to_dirty()
611 if (nnode->nbranch[iip].lnum) in next_pnode_to_dirty()
658 ubifs_add_lpt_dirt(c, pnode->parent->nbranch[pnode->iip].lnum, in add_pnode_dirt()
821 c->lsave[cnt++] = lprops->lnum; in populate_lsave()
826 c->lsave[cnt++] = lprops->lnum; in populate_lsave()
831 c->lsave[cnt++] = lprops->lnum; in populate_lsave()
837 c->lsave[cnt++] = heap->arr[i]->lnum; in populate_lsave()
843 c->lsave[cnt++] = heap->arr[i]->lnum; in populate_lsave()
849 c->lsave[cnt++] = heap->arr[i]->lnum; in populate_lsave()
904 static int make_nnode_dirty(struct ubifs_info *c, int node_num, int lnum, in make_nnode_dirty() argument
916 if (branch->lnum != lnum || branch->offs != offs) in make_nnode_dirty()
918 } else if (c->lpt_lnum != lnum || c->lpt_offs != offs) in make_nnode_dirty()
953 static int make_pnode_dirty(struct ubifs_info *c, int node_num, int lnum, in make_pnode_dirty() argument
963 if (branch->lnum != lnum || branch->offs != offs) in make_pnode_dirty()
983 static int make_ltab_dirty(struct ubifs_info *c, int lnum, int offs) in make_ltab_dirty() argument
985 if (lnum != c->ltab_lnum || offs != c->ltab_offs) in make_ltab_dirty()
1008 static int make_lsave_dirty(struct ubifs_info *c, int lnum, int offs) in make_lsave_dirty() argument
1010 if (lnum != c->lsave_lnum || offs != c->lsave_offs) in make_lsave_dirty()
1036 int lnum, int offs) in make_node_dirty() argument
1040 return make_nnode_dirty(c, node_num, lnum, offs); in make_node_dirty()
1042 return make_pnode_dirty(c, node_num, lnum, offs); in make_node_dirty()
1044 return make_ltab_dirty(c, lnum, offs); in make_node_dirty()
1046 return make_lsave_dirty(c, lnum, offs); in make_node_dirty()
1149 static int lpt_gc_lnum(struct ubifs_info *c, int lnum) in lpt_gc_lnum() argument
1154 dbg_lp("LEB %d", lnum); in lpt_gc_lnum()
1156 err = ubifs_leb_read(c, lnum, buf, 0, c->leb_size, 1); in lpt_gc_lnum()
1177 err = make_node_dirty(c, node_type, node_num, lnum, offs); in lpt_gc_lnum()
1196 int i, lnum = -1, dirty = 0; in lpt_gc() local
1206 lnum = i + c->lpt_first; in lpt_gc()
1210 if (lnum == -1) in lpt_gc()
1212 return lpt_gc_lnum(c, lnum); in lpt_gc()
1519 static int dbg_is_nnode_dirty(struct ubifs_info *c, int lnum, int offs) in dbg_is_nnode_dirty() argument
1532 if (branch->lnum != lnum || branch->offs != offs) in dbg_is_nnode_dirty()
1538 if (c->lpt_lnum != lnum || c->lpt_offs != offs) in dbg_is_nnode_dirty()
1554 static int dbg_is_pnode_dirty(struct ubifs_info *c, int lnum, int offs) in dbg_is_pnode_dirty() argument
1568 if (branch->lnum != lnum || branch->offs != offs) in dbg_is_pnode_dirty()
1583 static int dbg_is_ltab_dirty(struct ubifs_info *c, int lnum, int offs) in dbg_is_ltab_dirty() argument
1585 if (lnum != c->ltab_lnum || offs != c->ltab_offs) in dbg_is_ltab_dirty()
1596 static int dbg_is_lsave_dirty(struct ubifs_info *c, int lnum, int offs) in dbg_is_lsave_dirty() argument
1598 if (lnum != c->lsave_lnum || offs != c->lsave_offs) in dbg_is_lsave_dirty()
1610 static int dbg_is_node_dirty(struct ubifs_info *c, int node_type, int lnum, in dbg_is_node_dirty() argument
1615 return dbg_is_nnode_dirty(c, lnum, offs); in dbg_is_node_dirty()
1617 return dbg_is_pnode_dirty(c, lnum, offs); in dbg_is_node_dirty()
1619 return dbg_is_ltab_dirty(c, lnum, offs); in dbg_is_node_dirty()
1621 return dbg_is_lsave_dirty(c, lnum, offs); in dbg_is_node_dirty()
1634 static int dbg_check_ltab_lnum(struct ubifs_info *c, int lnum) in dbg_check_ltab_lnum() argument
1649 dbg_lp("LEB %d", lnum); in dbg_check_ltab_lnum()
1651 err = ubifs_leb_read(c, lnum, buf, 0, c->leb_size, 1); in dbg_check_ltab_lnum()
1668 lnum, c->leb_size - len); in dbg_check_ltab_lnum()
1671 i = lnum - c->lpt_first; in dbg_check_ltab_lnum()
1674 lnum, len, c->ltab[i].free); in dbg_check_ltab_lnum()
1679 lnum, dirty, c->ltab[i].dirty); in dbg_check_ltab_lnum()
1686 ret = dbg_is_node_dirty(c, node_type, lnum, c->leb_size - len); in dbg_check_ltab_lnum()
1707 int lnum, err, i, cnt; in dbg_check_ltab() local
1729 for (lnum = c->lpt_first; lnum <= c->lpt_last; lnum++) { in dbg_check_ltab()
1730 err = dbg_check_ltab_lnum(c, lnum); in dbg_check_ltab()
1732 ubifs_err(c, "failed at LEB %d", lnum); in dbg_check_ltab()
1886 static void dump_lpt_leb(const struct ubifs_info *c, int lnum) in dump_lpt_leb() argument
1891 pr_err("(pid %d) start dumping LEB %d\n", current->pid, lnum); in dump_lpt_leb()
1898 err = ubifs_leb_read(c, lnum, buf, 0, c->leb_size, 1); in dump_lpt_leb()
1910 lnum, offs, pad_len); in dump_lpt_leb()
1917 lnum, offs, len); in dump_lpt_leb()
1928 lnum, offs, node_num); in dump_lpt_leb()
1930 pr_err("LEB %d:%d, pnode\n", lnum, offs); in dump_lpt_leb()
1941 lnum, offs, node_num); in dump_lpt_leb()
1944 lnum, offs); in dump_lpt_leb()
1952 pr_cont("%d:%d", nnode.nbranch[i].lnum, in dump_lpt_leb()
1962 pr_err("LEB %d:%d, ltab\n", lnum, offs); in dump_lpt_leb()
1966 pr_err("LEB %d:%d, lsave len\n", lnum, offs); in dump_lpt_leb()
1977 pr_err("(pid %d) finish dumping LEB %d\n", current->pid, lnum); in dump_lpt_leb()
2024 c->lsave[prandom_u32() % c->lsave_cnt] = lprops->lnum; in dbg_populate_lsave()
2026 c->lsave[prandom_u32() % c->lsave_cnt] = lprops->lnum; in dbg_populate_lsave()
2028 c->lsave[prandom_u32() % c->lsave_cnt] = lprops->lnum; in dbg_populate_lsave()
2032 c->lsave[prandom_u32() % c->lsave_cnt] = heap->arr[i]->lnum; in dbg_populate_lsave()
2035 c->lsave[prandom_u32() % c->lsave_cnt] = heap->arr[i]->lnum; in dbg_populate_lsave()
2038 c->lsave[prandom_u32() % c->lsave_cnt] = heap->arr[i]->lnum; in dbg_populate_lsave()