140 static void upd_ltab(struct ubifs_info *c, int lnum, int free, int dirty)  in upd_ltab()  argument
143 	       lnum, c->ltab[lnum - c->lpt_first].free,  in upd_ltab()
144 	       c->ltab[lnum - c->lpt_first].dirty, free, dirty);  in upd_ltab()
145 	ubifs_assert(lnum >= c->lpt_first && lnum <= c->lpt_last);  in upd_ltab()
146 	c->ltab[lnum - c->lpt_first].free = free;  in upd_ltab()
147 	c->ltab[lnum - c->lpt_first].dirty += dirty;  in upd_ltab()
160 static int alloc_lpt_leb(struct ubifs_info *c, int *lnum)  in alloc_lpt_leb()  argument
164 	n = *lnum - c->lpt_first + 1;  in alloc_lpt_leb()
170 			*lnum = i + c->lpt_first;  in alloc_lpt_leb()
180 			*lnum = i + c->lpt_first;  in alloc_lpt_leb()
195 	int lnum, offs, len, alen, done_lsave, done_ltab, err;  in layout_cnodes()  local
204 	lnum = c->nhead_lnum;  in layout_cnodes()
211 		c->lsave_lnum = lnum;  in layout_cnodes()
219 		c->ltab_lnum = lnum;  in layout_cnodes()
235 			upd_ltab(c, lnum, c->leb_size - alen, alen - offs);  in layout_cnodes()
237 			err = alloc_lpt_leb(c, &lnum);  in layout_cnodes()
241 			ubifs_assert(lnum >= c->lpt_first &&  in layout_cnodes()
242 				     lnum <= c->lpt_last);  in layout_cnodes()
246 				c->lsave_lnum = lnum;  in layout_cnodes()
254 				c->ltab_lnum = lnum;  in layout_cnodes()
263 			cnode->parent->nbranch[cnode->iip].lnum = lnum;  in layout_cnodes()
266 			c->lpt_lnum = lnum;  in layout_cnodes()
278 			upd_ltab(c, lnum, c->leb_size - alen, alen - offs);  in layout_cnodes()
280 			err = alloc_lpt_leb(c, &lnum);  in layout_cnodes()
284 			ubifs_assert(lnum >= c->lpt_first &&  in layout_cnodes()
285 				     lnum <= c->lpt_last);  in layout_cnodes()
288 		c->lsave_lnum = lnum;  in layout_cnodes()
298 			upd_ltab(c, lnum, c->leb_size - alen, alen - offs);  in layout_cnodes()
300 			err = alloc_lpt_leb(c, &lnum);  in layout_cnodes()
304 			ubifs_assert(lnum >= c->lpt_first &&  in layout_cnodes()
305 				     lnum <= c->lpt_last);  in layout_cnodes()
307 		c->ltab_lnum = lnum;  in layout_cnodes()
314 	upd_ltab(c, lnum, c->leb_size - alen, alen - offs);  in layout_cnodes()
323 		  lnum, offs, len, done_ltab, done_lsave);  in layout_cnodes()
344 static int realloc_lpt_leb(struct ubifs_info *c, int *lnum)  in realloc_lpt_leb()  argument
348 	n = *lnum - c->lpt_first + 1;  in realloc_lpt_leb()
352 			*lnum = i + c->lpt_first;  in realloc_lpt_leb()
359 			*lnum = i + c->lpt_first;  in realloc_lpt_leb()
373 	int lnum, offs, len, from, err, wlen, alen, done_ltab, done_lsave;  in write_cnodes()  local
380 	lnum = c->nhead_lnum;  in write_cnodes()
385 		err = ubifs_leb_unmap(c, lnum);  in write_cnodes()
417 				err = ubifs_leb_write(c, lnum, buf + from, from,  in write_cnodes()
423 			err = realloc_lpt_leb(c, &lnum);  in write_cnodes()
427 			ubifs_assert(lnum >= c->lpt_first &&  in write_cnodes()
428 				     lnum <= c->lpt_last);  in write_cnodes()
429 			err = ubifs_leb_unmap(c, lnum);  in write_cnodes()
476 			err = ubifs_leb_write(c, lnum, buf + from, from, alen);  in write_cnodes()
480 			err = realloc_lpt_leb(c, &lnum);  in write_cnodes()
484 			ubifs_assert(lnum >= c->lpt_first &&  in write_cnodes()
485 				     lnum <= c->lpt_last);  in write_cnodes()
486 			err = ubifs_leb_unmap(c, lnum);  in write_cnodes()
502 			err = ubifs_leb_write(c, lnum, buf + from, from, alen);  in write_cnodes()
506 			err = realloc_lpt_leb(c, &lnum);  in write_cnodes()
510 			ubifs_assert(lnum >= c->lpt_first &&  in write_cnodes()
511 				     lnum <= c->lpt_last);  in write_cnodes()
512 			err = ubifs_leb_unmap(c, lnum);  in write_cnodes()
525 	err = ubifs_leb_write(c, lnum, buf + from, from, alen);  in write_cnodes()
534 	c->nhead_lnum = lnum;  in write_cnodes()
547 		  lnum, offs, len, done_ltab, done_lsave);  in write_cnodes()
572 		if (nnode->nbranch[iip].lnum)  in next_pnode_to_dirty()
583 			if (nnode->nbranch[iip].lnum)  in next_pnode_to_dirty()
596 			if (nnode->nbranch[iip].lnum)  in next_pnode_to_dirty()
612 		if (nnode->nbranch[iip].lnum)  in next_pnode_to_dirty()
659 	ubifs_add_lpt_dirt(c, pnode->parent->nbranch[pnode->iip].lnum,  in add_pnode_dirt()
820 		c->lsave[cnt++] = lprops->lnum;  in populate_lsave()
825 		c->lsave[cnt++] = lprops->lnum;  in populate_lsave()
830 		c->lsave[cnt++] = lprops->lnum;  in populate_lsave()
836 		c->lsave[cnt++] = heap->arr[i]->lnum;  in populate_lsave()
842 		c->lsave[cnt++] = heap->arr[i]->lnum;  in populate_lsave()
848 		c->lsave[cnt++] = heap->arr[i]->lnum;  in populate_lsave()
903 static int make_nnode_dirty(struct ubifs_info *c, int node_num, int lnum,  in make_nnode_dirty()  argument
915 		if (branch->lnum != lnum || branch->offs != offs)  in make_nnode_dirty()
917 	} else if (c->lpt_lnum != lnum || c->lpt_offs != offs)  in make_nnode_dirty()
952 static int make_pnode_dirty(struct ubifs_info *c, int node_num, int lnum,  in make_pnode_dirty()  argument
962 	if (branch->lnum != lnum || branch->offs != offs)  in make_pnode_dirty()
982 static int make_ltab_dirty(struct ubifs_info *c, int lnum, int offs)  in make_ltab_dirty()  argument
984 	if (lnum != c->ltab_lnum || offs != c->ltab_offs)  in make_ltab_dirty()
1007 static int make_lsave_dirty(struct ubifs_info *c, int lnum, int offs)  in make_lsave_dirty()  argument
1009 	if (lnum != c->lsave_lnum || offs != c->lsave_offs)  in make_lsave_dirty()
1035 			   int lnum, int offs)  in make_node_dirty()  argument
1039 		return make_nnode_dirty(c, node_num, lnum, offs);  in make_node_dirty()
1041 		return make_pnode_dirty(c, node_num, lnum, offs);  in make_node_dirty()
1043 		return make_ltab_dirty(c, lnum, offs);  in make_node_dirty()
1045 		return make_lsave_dirty(c, lnum, offs);  in make_node_dirty()
1148 static int lpt_gc_lnum(struct ubifs_info *c, int lnum)  in lpt_gc_lnum()  argument
1153 	dbg_lp("LEB %d", lnum);  in lpt_gc_lnum()
1155 	err = ubifs_leb_read(c, lnum, buf, 0, c->leb_size, 1);  in lpt_gc_lnum()
1176 		err = make_node_dirty(c, node_type, node_num, lnum, offs);  in lpt_gc_lnum()
1195 	int i, lnum = -1, dirty = 0;  in lpt_gc()  local
1205 			lnum = i + c->lpt_first;  in lpt_gc()
1209 	if (lnum == -1)  in lpt_gc()
1211 	return lpt_gc_lnum(c, lnum);  in lpt_gc()
1515 static int dbg_is_nnode_dirty(struct ubifs_info *c, int lnum, int offs)  in dbg_is_nnode_dirty()  argument
1528 			if (branch->lnum != lnum || branch->offs != offs)  in dbg_is_nnode_dirty()
1534 			if (c->lpt_lnum != lnum || c->lpt_offs != offs)  in dbg_is_nnode_dirty()
1550 static int dbg_is_pnode_dirty(struct ubifs_info *c, int lnum, int offs)  in dbg_is_pnode_dirty()  argument
1564 		if (branch->lnum != lnum || branch->offs != offs)  in dbg_is_pnode_dirty()
1579 static int dbg_is_ltab_dirty(struct ubifs_info *c, int lnum, int offs)  in dbg_is_ltab_dirty()  argument
1581 	if (lnum != c->ltab_lnum || offs != c->ltab_offs)  in dbg_is_ltab_dirty()
1592 static int dbg_is_lsave_dirty(struct ubifs_info *c, int lnum, int offs)  in dbg_is_lsave_dirty()  argument
1594 	if (lnum != c->lsave_lnum || offs != c->lsave_offs)  in dbg_is_lsave_dirty()
1606 static int dbg_is_node_dirty(struct ubifs_info *c, int node_type, int lnum,  in dbg_is_node_dirty()  argument
1611 		return dbg_is_nnode_dirty(c, lnum, offs);  in dbg_is_node_dirty()
1613 		return dbg_is_pnode_dirty(c, lnum, offs);  in dbg_is_node_dirty()
1615 		return dbg_is_ltab_dirty(c, lnum, offs);  in dbg_is_node_dirty()
1617 		return dbg_is_lsave_dirty(c, lnum, offs);  in dbg_is_node_dirty()
1630 static int dbg_check_ltab_lnum(struct ubifs_info *c, int lnum)  in dbg_check_ltab_lnum()  argument
1645 	dbg_lp("LEB %d", lnum);  in dbg_check_ltab_lnum()
1647 	err = ubifs_leb_read(c, lnum, buf, 0, c->leb_size, 1);  in dbg_check_ltab_lnum()
1664 					  lnum, c->leb_size - len);  in dbg_check_ltab_lnum()
1667 			i = lnum - c->lpt_first;  in dbg_check_ltab_lnum()
1670 					  lnum, len, c->ltab[i].free);  in dbg_check_ltab_lnum()
1675 					  lnum, dirty, c->ltab[i].dirty);  in dbg_check_ltab_lnum()
1682 		ret = dbg_is_node_dirty(c, node_type, lnum, c->leb_size - len);  in dbg_check_ltab_lnum()
1703 	int lnum, err, i, cnt;  in dbg_check_ltab()  local
1725 	for (lnum = c->lpt_first; lnum <= c->lpt_last; lnum++) {  in dbg_check_ltab()
1726 		err = dbg_check_ltab_lnum(c, lnum);  in dbg_check_ltab()
1728 			ubifs_err(c, "failed at LEB %d", lnum);  in dbg_check_ltab()
1882 static void dump_lpt_leb(const struct ubifs_info *c, int lnum)  in dump_lpt_leb()  argument
1887 	pr_err("(pid %d) start dumping LEB %d\n", current->pid, lnum);  in dump_lpt_leb()
1894 	err = ubifs_leb_read(c, lnum, buf, 0, c->leb_size, 1);  in dump_lpt_leb()
1906 				       lnum, offs, pad_len);  in dump_lpt_leb()
1913 				       lnum, offs, len);  in dump_lpt_leb()
1924 				       lnum, offs, node_num);  in dump_lpt_leb()
1926 				pr_err("LEB %d:%d, pnode\n", lnum, offs);  in dump_lpt_leb()
1937 				       lnum, offs, node_num);  in dump_lpt_leb()
1940 				       lnum, offs);  in dump_lpt_leb()
1948 				pr_cont("%d:%d", nnode.nbranch[i].lnum,  in dump_lpt_leb()
1958 			pr_err("LEB %d:%d, ltab\n", lnum, offs);  in dump_lpt_leb()
1962 			pr_err("LEB %d:%d, lsave len\n", lnum, offs);  in dump_lpt_leb()
1973 	pr_err("(pid %d) finish dumping LEB %d\n", current->pid, lnum);  in dump_lpt_leb()
2020 		c->lsave[prandom_u32() % c->lsave_cnt] = lprops->lnum;  in dbg_populate_lsave()
2022 		c->lsave[prandom_u32() % c->lsave_cnt] = lprops->lnum;  in dbg_populate_lsave()
2024 		c->lsave[prandom_u32() % c->lsave_cnt] = lprops->lnum;  in dbg_populate_lsave()
2028 		c->lsave[prandom_u32() % c->lsave_cnt] = heap->arr[i]->lnum;  in dbg_populate_lsave()
2031 		c->lsave[prandom_u32() % c->lsave_cnt] = heap->arr[i]->lnum;  in dbg_populate_lsave()
2034 		c->lsave[prandom_u32() % c->lsave_cnt] = heap->arr[i]->lnum;  in dbg_populate_lsave()