Lines Matching +full:- +full:c
1 // SPDX-License-Identifier: GPL-2.0-only
5 * Copyright (C) 2006-2008 Nokia Corporation.
17 * The LPT area is like a miniature self-contained file system. It is required
40 * do_calc_lpt_geom - calculate sizes for the LPT area.
41 * @c: the UBIFS file-system description object
44 * properties of the flash and whether LPT is "big" (c->big_lpt).
46 static void do_calc_lpt_geom(struct ubifs_info *c) in do_calc_lpt_geom() argument
51 n = c->main_lebs + c->max_leb_cnt - c->leb_cnt; in do_calc_lpt_geom()
54 c->lpt_hght = 1; in do_calc_lpt_geom()
57 c->lpt_hght += 1; in do_calc_lpt_geom()
61 c->pnode_cnt = DIV_ROUND_UP(c->main_lebs, UBIFS_LPT_FANOUT); in do_calc_lpt_geom()
63 n = DIV_ROUND_UP(c->pnode_cnt, UBIFS_LPT_FANOUT); in do_calc_lpt_geom()
64 c->nnode_cnt = n; in do_calc_lpt_geom()
65 for (i = 1; i < c->lpt_hght; i++) { in do_calc_lpt_geom()
67 c->nnode_cnt += n; in do_calc_lpt_geom()
70 c->space_bits = fls(c->leb_size) - 3; in do_calc_lpt_geom()
71 c->lpt_lnum_bits = fls(c->lpt_lebs); in do_calc_lpt_geom()
72 c->lpt_offs_bits = fls(c->leb_size - 1); in do_calc_lpt_geom()
73 c->lpt_spc_bits = fls(c->leb_size); in do_calc_lpt_geom()
75 n = DIV_ROUND_UP(c->max_leb_cnt, UBIFS_LPT_FANOUT); in do_calc_lpt_geom()
76 c->pcnt_bits = fls(n - 1); in do_calc_lpt_geom()
78 c->lnum_bits = fls(c->max_leb_cnt - 1); in do_calc_lpt_geom()
81 (c->big_lpt ? c->pcnt_bits : 0) + in do_calc_lpt_geom()
82 (c->space_bits * 2 + 1) * UBIFS_LPT_FANOUT; in do_calc_lpt_geom()
83 c->pnode_sz = (bits + 7) / 8; in do_calc_lpt_geom()
86 (c->big_lpt ? c->pcnt_bits : 0) + in do_calc_lpt_geom()
87 (c->lpt_lnum_bits + c->lpt_offs_bits) * UBIFS_LPT_FANOUT; in do_calc_lpt_geom()
88 c->nnode_sz = (bits + 7) / 8; in do_calc_lpt_geom()
91 c->lpt_lebs * c->lpt_spc_bits * 2; in do_calc_lpt_geom()
92 c->ltab_sz = (bits + 7) / 8; in do_calc_lpt_geom()
95 c->lnum_bits * c->lsave_cnt; in do_calc_lpt_geom()
96 c->lsave_sz = (bits + 7) / 8; in do_calc_lpt_geom()
99 c->lpt_sz = (long long)c->pnode_cnt * c->pnode_sz; in do_calc_lpt_geom()
100 c->lpt_sz += (long long)c->nnode_cnt * c->nnode_sz; in do_calc_lpt_geom()
101 c->lpt_sz += c->ltab_sz; in do_calc_lpt_geom()
102 if (c->big_lpt) in do_calc_lpt_geom()
103 c->lpt_sz += c->lsave_sz; in do_calc_lpt_geom()
106 sz = c->lpt_sz; in do_calc_lpt_geom()
107 per_leb_wastage = max_t(int, c->pnode_sz, c->nnode_sz); in do_calc_lpt_geom()
110 while (sz > c->leb_size) { in do_calc_lpt_geom()
112 sz -= c->leb_size; in do_calc_lpt_geom()
115 tot_wastage += ALIGN(sz, c->min_io_size) - sz; in do_calc_lpt_geom()
116 c->lpt_sz += tot_wastage; in do_calc_lpt_geom()
120 * ubifs_calc_lpt_geom - calculate and check sizes for the LPT area.
121 * @c: the UBIFS file-system description object
125 int ubifs_calc_lpt_geom(struct ubifs_info *c) in ubifs_calc_lpt_geom() argument
130 do_calc_lpt_geom(c); in ubifs_calc_lpt_geom()
133 sz = c->lpt_sz * 2; /* Must have at least 2 times the size */ in ubifs_calc_lpt_geom()
134 lebs_needed = div_u64(sz + c->leb_size - 1, c->leb_size); in ubifs_calc_lpt_geom()
135 if (lebs_needed > c->lpt_lebs) { in ubifs_calc_lpt_geom()
136 ubifs_err(c, "too few LPT LEBs"); in ubifs_calc_lpt_geom()
137 return -EINVAL; in ubifs_calc_lpt_geom()
141 if (c->ltab_sz > c->leb_size) { in ubifs_calc_lpt_geom()
142 ubifs_err(c, "LPT ltab too big"); in ubifs_calc_lpt_geom()
143 return -EINVAL; in ubifs_calc_lpt_geom()
146 c->check_lpt_free = c->big_lpt; in ubifs_calc_lpt_geom()
151 * calc_dflt_lpt_geom - calculate default LPT geometry.
152 * @c: the UBIFS file-system description object
162 static int calc_dflt_lpt_geom(struct ubifs_info *c, int *main_lebs, in calc_dflt_lpt_geom() argument
169 c->lpt_lebs = UBIFS_MIN_LPT_LEBS; in calc_dflt_lpt_geom()
170 c->main_lebs = *main_lebs - c->lpt_lebs; in calc_dflt_lpt_geom()
171 if (c->main_lebs <= 0) in calc_dflt_lpt_geom()
172 return -EINVAL; in calc_dflt_lpt_geom()
175 c->big_lpt = 0; in calc_dflt_lpt_geom()
181 do_calc_lpt_geom(c); in calc_dflt_lpt_geom()
184 if (c->lpt_sz > c->leb_size) { in calc_dflt_lpt_geom()
186 c->big_lpt = 1; in calc_dflt_lpt_geom()
187 do_calc_lpt_geom(c); in calc_dflt_lpt_geom()
192 sz = c->lpt_sz * 4; /* Allow 4 times the size */ in calc_dflt_lpt_geom()
193 lebs_needed = div_u64(sz + c->leb_size - 1, c->leb_size); in calc_dflt_lpt_geom()
194 if (lebs_needed > c->lpt_lebs) { in calc_dflt_lpt_geom()
196 c->lpt_lebs = lebs_needed; in calc_dflt_lpt_geom()
197 c->main_lebs = *main_lebs - c->lpt_lebs; in calc_dflt_lpt_geom()
198 if (c->main_lebs <= 0) in calc_dflt_lpt_geom()
199 return -EINVAL; in calc_dflt_lpt_geom()
200 do_calc_lpt_geom(c); in calc_dflt_lpt_geom()
203 if (c->ltab_sz > c->leb_size) { in calc_dflt_lpt_geom()
204 ubifs_err(c, "LPT ltab too big"); in calc_dflt_lpt_geom()
205 return -EINVAL; in calc_dflt_lpt_geom()
207 *main_lebs = c->main_lebs; in calc_dflt_lpt_geom()
208 *big_lpt = c->big_lpt; in calc_dflt_lpt_geom()
211 return -EINVAL; in calc_dflt_lpt_geom()
215 * pack_bits - pack bit fields end-to-end.
216 * @c: UBIFS file-system description object
220 * @nrbits: number of bits of value to pack (1-32)
222 static void pack_bits(const struct ubifs_info *c, uint8_t **addr, int *pos, uint32_t val, int nrbit… in pack_bits() argument
227 ubifs_assert(c, nrbits > 0); in pack_bits()
228 ubifs_assert(c, nrbits <= 32); in pack_bits()
229 ubifs_assert(c, *pos >= 0); in pack_bits()
230 ubifs_assert(c, *pos < 8); in pack_bits()
231 ubifs_assert(c, (val >> nrbits) == 0 || nrbits == 32); in pack_bits()
236 *++p = (uint8_t)(val >>= (8 - b)); in pack_bits()
265 * ubifs_unpack_bits - unpack bit fields.
266 * @c: UBIFS file-system description object
269 * @nrbits: number of bits of value to unpack (1-32)
273 uint32_t ubifs_unpack_bits(const struct ubifs_info *c, uint8_t **addr, int *pos, int nrbits) in ubifs_unpack_bits() argument
275 const int k = 32 - nrbits; in ubifs_unpack_bits()
281 ubifs_assert(c, nrbits > 0); in ubifs_unpack_bits()
282 ubifs_assert(c, nrbits <= 32); in ubifs_unpack_bits()
283 ubifs_assert(c, *pos >= 0); in ubifs_unpack_bits()
284 ubifs_assert(c, *pos < 8); in ubifs_unpack_bits()
302 val <<= (8 - b); in ubifs_unpack_bits()
330 ubifs_assert(c, (val >> nrbits) == 0 || nrbits - b == 32); in ubifs_unpack_bits()
335 * ubifs_pack_pnode - pack all the bit fields of a pnode.
336 * @c: UBIFS file-system description object
340 void ubifs_pack_pnode(struct ubifs_info *c, void *buf, in ubifs_pack_pnode() argument
347 pack_bits(c, &addr, &pos, UBIFS_LPT_PNODE, UBIFS_LPT_TYPE_BITS); in ubifs_pack_pnode()
348 if (c->big_lpt) in ubifs_pack_pnode()
349 pack_bits(c, &addr, &pos, pnode->num, c->pcnt_bits); in ubifs_pack_pnode()
351 pack_bits(c, &addr, &pos, pnode->lprops[i].free >> 3, in ubifs_pack_pnode()
352 c->space_bits); in ubifs_pack_pnode()
353 pack_bits(c, &addr, &pos, pnode->lprops[i].dirty >> 3, in ubifs_pack_pnode()
354 c->space_bits); in ubifs_pack_pnode()
355 if (pnode->lprops[i].flags & LPROPS_INDEX) in ubifs_pack_pnode()
356 pack_bits(c, &addr, &pos, 1, 1); in ubifs_pack_pnode()
358 pack_bits(c, &addr, &pos, 0, 1); in ubifs_pack_pnode()
360 crc = crc16(-1, buf + UBIFS_LPT_CRC_BYTES, in ubifs_pack_pnode()
361 c->pnode_sz - UBIFS_LPT_CRC_BYTES); in ubifs_pack_pnode()
364 pack_bits(c, &addr, &pos, crc, UBIFS_LPT_CRC_BITS); in ubifs_pack_pnode()
368 * ubifs_pack_nnode - pack all the bit fields of a nnode.
369 * @c: UBIFS file-system description object
373 void ubifs_pack_nnode(struct ubifs_info *c, void *buf, in ubifs_pack_nnode() argument
380 pack_bits(c, &addr, &pos, UBIFS_LPT_NNODE, UBIFS_LPT_TYPE_BITS); in ubifs_pack_nnode()
381 if (c->big_lpt) in ubifs_pack_nnode()
382 pack_bits(c, &addr, &pos, nnode->num, c->pcnt_bits); in ubifs_pack_nnode()
384 int lnum = nnode->nbranch[i].lnum; in ubifs_pack_nnode()
387 lnum = c->lpt_last + 1; in ubifs_pack_nnode()
388 pack_bits(c, &addr, &pos, lnum - c->lpt_first, c->lpt_lnum_bits); in ubifs_pack_nnode()
389 pack_bits(c, &addr, &pos, nnode->nbranch[i].offs, in ubifs_pack_nnode()
390 c->lpt_offs_bits); in ubifs_pack_nnode()
392 crc = crc16(-1, buf + UBIFS_LPT_CRC_BYTES, in ubifs_pack_nnode()
393 c->nnode_sz - UBIFS_LPT_CRC_BYTES); in ubifs_pack_nnode()
396 pack_bits(c, &addr, &pos, crc, UBIFS_LPT_CRC_BITS); in ubifs_pack_nnode()
400 * ubifs_pack_ltab - pack the LPT's own lprops table.
401 * @c: UBIFS file-system description object
405 void ubifs_pack_ltab(struct ubifs_info *c, void *buf, in ubifs_pack_ltab() argument
412 pack_bits(c, &addr, &pos, UBIFS_LPT_LTAB, UBIFS_LPT_TYPE_BITS); in ubifs_pack_ltab()
413 for (i = 0; i < c->lpt_lebs; i++) { in ubifs_pack_ltab()
414 pack_bits(c, &addr, &pos, ltab[i].free, c->lpt_spc_bits); in ubifs_pack_ltab()
415 pack_bits(c, &addr, &pos, ltab[i].dirty, c->lpt_spc_bits); in ubifs_pack_ltab()
417 crc = crc16(-1, buf + UBIFS_LPT_CRC_BYTES, in ubifs_pack_ltab()
418 c->ltab_sz - UBIFS_LPT_CRC_BYTES); in ubifs_pack_ltab()
421 pack_bits(c, &addr, &pos, crc, UBIFS_LPT_CRC_BITS); in ubifs_pack_ltab()
425 * ubifs_pack_lsave - pack the LPT's save table.
426 * @c: UBIFS file-system description object
430 void ubifs_pack_lsave(struct ubifs_info *c, void *buf, int *lsave) in ubifs_pack_lsave() argument
436 pack_bits(c, &addr, &pos, UBIFS_LPT_LSAVE, UBIFS_LPT_TYPE_BITS); in ubifs_pack_lsave()
437 for (i = 0; i < c->lsave_cnt; i++) in ubifs_pack_lsave()
438 pack_bits(c, &addr, &pos, lsave[i], c->lnum_bits); in ubifs_pack_lsave()
439 crc = crc16(-1, buf + UBIFS_LPT_CRC_BYTES, in ubifs_pack_lsave()
440 c->lsave_sz - UBIFS_LPT_CRC_BYTES); in ubifs_pack_lsave()
443 pack_bits(c, &addr, &pos, crc, UBIFS_LPT_CRC_BITS); in ubifs_pack_lsave()
447 * ubifs_add_lpt_dirt - add dirty space to LPT LEB properties.
448 * @c: UBIFS file-system description object
452 void ubifs_add_lpt_dirt(struct ubifs_info *c, int lnum, int dirty) in ubifs_add_lpt_dirt() argument
457 lnum, dirty, c->ltab[lnum - c->lpt_first].dirty); in ubifs_add_lpt_dirt()
458 ubifs_assert(c, lnum >= c->lpt_first && lnum <= c->lpt_last); in ubifs_add_lpt_dirt()
459 c->ltab[lnum - c->lpt_first].dirty += dirty; in ubifs_add_lpt_dirt()
463 * set_ltab - set LPT LEB properties.
464 * @c: UBIFS file-system description object
469 static void set_ltab(struct ubifs_info *c, int lnum, int free, int dirty) in set_ltab() argument
472 lnum, c->ltab[lnum - c->lpt_first].free, in set_ltab()
473 c->ltab[lnum - c->lpt_first].dirty, free, dirty); in set_ltab()
474 ubifs_assert(c, lnum >= c->lpt_first && lnum <= c->lpt_last); in set_ltab()
475 c->ltab[lnum - c->lpt_first].free = free; in set_ltab()
476 c->ltab[lnum - c->lpt_first].dirty = dirty; in set_ltab()
480 * ubifs_add_nnode_dirt - add dirty space to LPT LEB properties.
481 * @c: UBIFS file-system description object
484 void ubifs_add_nnode_dirt(struct ubifs_info *c, struct ubifs_nnode *nnode) in ubifs_add_nnode_dirt() argument
486 struct ubifs_nnode *np = nnode->parent; in ubifs_add_nnode_dirt()
489 ubifs_add_lpt_dirt(c, np->nbranch[nnode->iip].lnum, in ubifs_add_nnode_dirt()
490 c->nnode_sz); in ubifs_add_nnode_dirt()
492 ubifs_add_lpt_dirt(c, c->lpt_lnum, c->nnode_sz); in ubifs_add_nnode_dirt()
493 if (!(c->lpt_drty_flgs & LTAB_DIRTY)) { in ubifs_add_nnode_dirt()
494 c->lpt_drty_flgs |= LTAB_DIRTY; in ubifs_add_nnode_dirt()
495 ubifs_add_lpt_dirt(c, c->ltab_lnum, c->ltab_sz); in ubifs_add_nnode_dirt()
501 * add_pnode_dirt - add dirty space to LPT LEB properties.
502 * @c: UBIFS file-system description object
505 static void add_pnode_dirt(struct ubifs_info *c, struct ubifs_pnode *pnode) in add_pnode_dirt() argument
507 ubifs_add_lpt_dirt(c, pnode->parent->nbranch[pnode->iip].lnum, in add_pnode_dirt()
508 c->pnode_sz); in add_pnode_dirt()
512 * calc_nnode_num - calculate nnode number.
527 while (row--) { in calc_nnode_num()
528 bits = (col & (UBIFS_LPT_FANOUT - 1)); in calc_nnode_num()
537 * calc_nnode_num_from_parent - calculate nnode number.
538 * @c: UBIFS file-system description object
548 static int calc_nnode_num_from_parent(const struct ubifs_info *c, in calc_nnode_num_from_parent() argument
555 shft = (c->lpt_hght - parent->level) * UBIFS_LPT_FANOUT_SHIFT; in calc_nnode_num_from_parent()
556 num = parent->num ^ (1 << shft); in calc_nnode_num_from_parent()
562 * calc_pnode_num_from_parent - calculate pnode number.
563 * @c: UBIFS file-system description object
573 static int calc_pnode_num_from_parent(const struct ubifs_info *c, in calc_pnode_num_from_parent() argument
576 int i, n = c->lpt_hght - 1, pnum = parent->num, num = 0; in calc_pnode_num_from_parent()
580 num |= pnum & (UBIFS_LPT_FANOUT - 1); in calc_pnode_num_from_parent()
589 * ubifs_create_dflt_lpt - create default LPT.
590 * @c: UBIFS file-system description object
599 int ubifs_create_dflt_lpt(struct ubifs_info *c, int *main_lebs, int lpt_first, in ubifs_create_dflt_lpt() argument
611 err = calc_dflt_lpt_geom(c, main_lebs, big_lpt); in ubifs_create_dflt_lpt()
614 *lpt_lebs = c->lpt_lebs; in ubifs_create_dflt_lpt()
617 c->lpt_first = lpt_first; in ubifs_create_dflt_lpt()
619 c->lpt_last = lpt_first + c->lpt_lebs - 1; in ubifs_create_dflt_lpt()
621 c->main_first = c->leb_cnt - *main_lebs; in ubifs_create_dflt_lpt()
623 desc = ubifs_hash_get_desc(c); in ubifs_create_dflt_lpt()
627 lsave = kmalloc_array(c->lsave_cnt, sizeof(int), GFP_KERNEL); in ubifs_create_dflt_lpt()
630 buf = vmalloc(c->leb_size); in ubifs_create_dflt_lpt()
632 c->lpt_lebs)); in ubifs_create_dflt_lpt()
634 err = -ENOMEM; in ubifs_create_dflt_lpt()
638 ubifs_assert(c, !c->ltab); in ubifs_create_dflt_lpt()
639 c->ltab = ltab; /* Needed by set_ltab */ in ubifs_create_dflt_lpt()
642 for (i = 0; i < c->lpt_lebs; i++) { in ubifs_create_dflt_lpt()
643 ltab[i].free = c->leb_size; in ubifs_create_dflt_lpt()
652 cnt = c->pnode_cnt; in ubifs_create_dflt_lpt()
658 node_sz = ALIGN(ubifs_idx_node_sz(c, 1), 8); in ubifs_create_dflt_lpt()
659 iopos = ALIGN(node_sz, c->min_io_size); in ubifs_create_dflt_lpt()
660 pnode->lprops[0].free = c->leb_size - iopos; in ubifs_create_dflt_lpt()
661 pnode->lprops[0].dirty = iopos - node_sz; in ubifs_create_dflt_lpt()
662 pnode->lprops[0].flags = LPROPS_INDEX; in ubifs_create_dflt_lpt()
665 iopos = ALIGN(node_sz, c->min_io_size); in ubifs_create_dflt_lpt()
666 pnode->lprops[1].free = c->leb_size - iopos; in ubifs_create_dflt_lpt()
667 pnode->lprops[1].dirty = iopos - node_sz; in ubifs_create_dflt_lpt()
670 pnode->lprops[i].free = c->leb_size; in ubifs_create_dflt_lpt()
673 ubifs_pack_pnode(c, p, pnode); in ubifs_create_dflt_lpt()
674 err = ubifs_shash_update(c, desc, p, c->pnode_sz); in ubifs_create_dflt_lpt()
678 p += c->pnode_sz; in ubifs_create_dflt_lpt()
679 len = c->pnode_sz; in ubifs_create_dflt_lpt()
680 pnode->num += 1; in ubifs_create_dflt_lpt()
683 pnode->lprops[0].free = c->leb_size; in ubifs_create_dflt_lpt()
684 pnode->lprops[0].dirty = 0; in ubifs_create_dflt_lpt()
685 pnode->lprops[0].flags = 0; in ubifs_create_dflt_lpt()
687 pnode->lprops[1].free = c->leb_size; in ubifs_create_dflt_lpt()
688 pnode->lprops[1].dirty = 0; in ubifs_create_dflt_lpt()
697 bsz = c->pnode_sz; /* Size of nodes in level below */ in ubifs_create_dflt_lpt()
701 if (len + c->pnode_sz > c->leb_size) { in ubifs_create_dflt_lpt()
702 alen = ALIGN(len, c->min_io_size); in ubifs_create_dflt_lpt()
703 set_ltab(c, lnum, c->leb_size - alen, alen - len); in ubifs_create_dflt_lpt()
704 memset(p, 0xff, alen - len); in ubifs_create_dflt_lpt()
705 err = ubifs_leb_change(c, lnum++, buf, alen); in ubifs_create_dflt_lpt()
711 ubifs_pack_pnode(c, p, pnode); in ubifs_create_dflt_lpt()
712 err = ubifs_shash_update(c, desc, p, c->pnode_sz); in ubifs_create_dflt_lpt()
716 p += c->pnode_sz; in ubifs_create_dflt_lpt()
717 len += c->pnode_sz; in ubifs_create_dflt_lpt()
723 pnode->num += 1; in ubifs_create_dflt_lpt()
734 if (len + c->nnode_sz > c->leb_size) { in ubifs_create_dflt_lpt()
735 alen = ALIGN(len, c->min_io_size); in ubifs_create_dflt_lpt()
736 set_ltab(c, lnum, c->leb_size - alen, in ubifs_create_dflt_lpt()
737 alen - len); in ubifs_create_dflt_lpt()
738 memset(p, 0xff, alen - len); in ubifs_create_dflt_lpt()
739 err = ubifs_leb_change(c, lnum++, buf, alen); in ubifs_create_dflt_lpt()
747 c->lpt_lnum = lnum; in ubifs_create_dflt_lpt()
748 c->lpt_offs = len; in ubifs_create_dflt_lpt()
753 if (boffs + bsz > c->leb_size) { in ubifs_create_dflt_lpt()
757 nnode->nbranch[j].lnum = blnum; in ubifs_create_dflt_lpt()
758 nnode->nbranch[j].offs = boffs; in ubifs_create_dflt_lpt()
760 bcnt--; in ubifs_create_dflt_lpt()
762 nnode->nbranch[j].lnum = 0; in ubifs_create_dflt_lpt()
763 nnode->nbranch[j].offs = 0; in ubifs_create_dflt_lpt()
766 nnode->num = calc_nnode_num(row, i); in ubifs_create_dflt_lpt()
767 ubifs_pack_nnode(c, p, nnode); in ubifs_create_dflt_lpt()
768 p += c->nnode_sz; in ubifs_create_dflt_lpt()
769 len += c->nnode_sz; in ubifs_create_dflt_lpt()
776 bsz = c->nnode_sz; in ubifs_create_dflt_lpt()
777 row -= 1; in ubifs_create_dflt_lpt()
782 if (len + c->lsave_sz > c->leb_size) { in ubifs_create_dflt_lpt()
783 alen = ALIGN(len, c->min_io_size); in ubifs_create_dflt_lpt()
784 set_ltab(c, lnum, c->leb_size - alen, alen - len); in ubifs_create_dflt_lpt()
785 memset(p, 0xff, alen - len); in ubifs_create_dflt_lpt()
786 err = ubifs_leb_change(c, lnum++, buf, alen); in ubifs_create_dflt_lpt()
793 c->lsave_lnum = lnum; in ubifs_create_dflt_lpt()
794 c->lsave_offs = len; in ubifs_create_dflt_lpt()
796 for (i = 0; i < c->lsave_cnt && i < *main_lebs; i++) in ubifs_create_dflt_lpt()
797 lsave[i] = c->main_first + i; in ubifs_create_dflt_lpt()
798 for (; i < c->lsave_cnt; i++) in ubifs_create_dflt_lpt()
799 lsave[i] = c->main_first; in ubifs_create_dflt_lpt()
801 ubifs_pack_lsave(c, p, lsave); in ubifs_create_dflt_lpt()
802 p += c->lsave_sz; in ubifs_create_dflt_lpt()
803 len += c->lsave_sz; in ubifs_create_dflt_lpt()
807 if (len + c->ltab_sz > c->leb_size) { in ubifs_create_dflt_lpt()
808 alen = ALIGN(len, c->min_io_size); in ubifs_create_dflt_lpt()
809 set_ltab(c, lnum, c->leb_size - alen, alen - len); in ubifs_create_dflt_lpt()
810 memset(p, 0xff, alen - len); in ubifs_create_dflt_lpt()
811 err = ubifs_leb_change(c, lnum++, buf, alen); in ubifs_create_dflt_lpt()
818 c->ltab_lnum = lnum; in ubifs_create_dflt_lpt()
819 c->ltab_offs = len; in ubifs_create_dflt_lpt()
822 len += c->ltab_sz; in ubifs_create_dflt_lpt()
823 alen = ALIGN(len, c->min_io_size); in ubifs_create_dflt_lpt()
824 set_ltab(c, lnum, c->leb_size - alen, alen - len); in ubifs_create_dflt_lpt()
826 ubifs_pack_ltab(c, p, ltab); in ubifs_create_dflt_lpt()
827 p += c->ltab_sz; in ubifs_create_dflt_lpt()
830 memset(p, 0xff, alen - len); in ubifs_create_dflt_lpt()
831 err = ubifs_leb_change(c, lnum, buf, alen); in ubifs_create_dflt_lpt()
835 err = ubifs_shash_final(c, desc, hash); in ubifs_create_dflt_lpt()
839 c->nhead_lnum = lnum; in ubifs_create_dflt_lpt()
840 c->nhead_offs = ALIGN(len, c->min_io_size); in ubifs_create_dflt_lpt()
842 dbg_lp("space_bits %d", c->space_bits); in ubifs_create_dflt_lpt()
843 dbg_lp("lpt_lnum_bits %d", c->lpt_lnum_bits); in ubifs_create_dflt_lpt()
844 dbg_lp("lpt_offs_bits %d", c->lpt_offs_bits); in ubifs_create_dflt_lpt()
845 dbg_lp("lpt_spc_bits %d", c->lpt_spc_bits); in ubifs_create_dflt_lpt()
846 dbg_lp("pcnt_bits %d", c->pcnt_bits); in ubifs_create_dflt_lpt()
847 dbg_lp("lnum_bits %d", c->lnum_bits); in ubifs_create_dflt_lpt()
848 dbg_lp("pnode_sz %d", c->pnode_sz); in ubifs_create_dflt_lpt()
849 dbg_lp("nnode_sz %d", c->nnode_sz); in ubifs_create_dflt_lpt()
850 dbg_lp("ltab_sz %d", c->ltab_sz); in ubifs_create_dflt_lpt()
851 dbg_lp("lsave_sz %d", c->lsave_sz); in ubifs_create_dflt_lpt()
852 dbg_lp("lsave_cnt %d", c->lsave_cnt); in ubifs_create_dflt_lpt()
853 dbg_lp("lpt_hght %d", c->lpt_hght); in ubifs_create_dflt_lpt()
854 dbg_lp("big_lpt %u", c->big_lpt); in ubifs_create_dflt_lpt()
855 dbg_lp("LPT root is at %d:%d", c->lpt_lnum, c->lpt_offs); in ubifs_create_dflt_lpt()
856 dbg_lp("LPT head is at %d:%d", c->nhead_lnum, c->nhead_offs); in ubifs_create_dflt_lpt()
857 dbg_lp("LPT ltab is at %d:%d", c->ltab_lnum, c->ltab_offs); in ubifs_create_dflt_lpt()
858 if (c->big_lpt) in ubifs_create_dflt_lpt()
859 dbg_lp("LPT lsave is at %d:%d", c->lsave_lnum, c->lsave_offs); in ubifs_create_dflt_lpt()
861 c->ltab = NULL; in ubifs_create_dflt_lpt()
872 * update_cats - add LEB properties of a pnode to LEB category lists and heaps.
873 * @c: UBIFS file-system description object
879 static void update_cats(struct ubifs_info *c, struct ubifs_pnode *pnode) in update_cats() argument
884 int cat = pnode->lprops[i].flags & LPROPS_CAT_MASK; in update_cats()
885 int lnum = pnode->lprops[i].lnum; in update_cats()
889 ubifs_add_to_cat(c, &pnode->lprops[i], cat); in update_cats()
894 * replace_cats - add LEB properties of a pnode to LEB category lists and heaps.
895 * @c: UBIFS file-system description object
903 static void replace_cats(struct ubifs_info *c, struct ubifs_pnode *old_pnode, in replace_cats() argument
909 if (!new_pnode->lprops[i].lnum) in replace_cats()
911 ubifs_replace_cat(c, &old_pnode->lprops[i], in replace_cats()
912 &new_pnode->lprops[i]); in replace_cats()
917 * check_lpt_crc - check LPT node crc is correct.
918 * @c: UBIFS file-system description object
924 static int check_lpt_crc(const struct ubifs_info *c, void *buf, int len) in check_lpt_crc() argument
930 crc = ubifs_unpack_bits(c, &addr, &pos, UBIFS_LPT_CRC_BITS); in check_lpt_crc()
931 calc_crc = crc16(-1, buf + UBIFS_LPT_CRC_BYTES, in check_lpt_crc()
932 len - UBIFS_LPT_CRC_BYTES); in check_lpt_crc()
934 ubifs_err(c, "invalid crc in LPT node: crc %hx calc %hx", in check_lpt_crc()
937 return -EINVAL; in check_lpt_crc()
943 * check_lpt_type - check LPT node type is correct.
944 * @c: UBIFS file-system description object
951 static int check_lpt_type(const struct ubifs_info *c, uint8_t **addr, in check_lpt_type() argument
956 node_type = ubifs_unpack_bits(c, addr, pos, UBIFS_LPT_TYPE_BITS); in check_lpt_type()
958 ubifs_err(c, "invalid type (%d) in LPT node type %d", in check_lpt_type()
961 return -EINVAL; in check_lpt_type()
967 * unpack_pnode - unpack a pnode.
968 * @c: UBIFS file-system description object
974 static int unpack_pnode(const struct ubifs_info *c, void *buf, in unpack_pnode() argument
980 err = check_lpt_type(c, &addr, &pos, UBIFS_LPT_PNODE); in unpack_pnode()
983 if (c->big_lpt) in unpack_pnode()
984 pnode->num = ubifs_unpack_bits(c, &addr, &pos, c->pcnt_bits); in unpack_pnode()
986 struct ubifs_lprops * const lprops = &pnode->lprops[i]; in unpack_pnode()
988 lprops->free = ubifs_unpack_bits(c, &addr, &pos, c->space_bits); in unpack_pnode()
989 lprops->free <<= 3; in unpack_pnode()
990 lprops->dirty = ubifs_unpack_bits(c, &addr, &pos, c->space_bits); in unpack_pnode()
991 lprops->dirty <<= 3; in unpack_pnode()
993 if (ubifs_unpack_bits(c, &addr, &pos, 1)) in unpack_pnode()
994 lprops->flags = LPROPS_INDEX; in unpack_pnode()
996 lprops->flags = 0; in unpack_pnode()
997 lprops->flags |= ubifs_categorize_lprops(c, lprops); in unpack_pnode()
999 err = check_lpt_crc(c, buf, c->pnode_sz); in unpack_pnode()
1004 * ubifs_unpack_nnode - unpack a nnode.
1005 * @c: UBIFS file-system description object
1011 int ubifs_unpack_nnode(const struct ubifs_info *c, void *buf, in ubifs_unpack_nnode() argument
1017 err = check_lpt_type(c, &addr, &pos, UBIFS_LPT_NNODE); in ubifs_unpack_nnode()
1020 if (c->big_lpt) in ubifs_unpack_nnode()
1021 nnode->num = ubifs_unpack_bits(c, &addr, &pos, c->pcnt_bits); in ubifs_unpack_nnode()
1025 lnum = ubifs_unpack_bits(c, &addr, &pos, c->lpt_lnum_bits) + in ubifs_unpack_nnode()
1026 c->lpt_first; in ubifs_unpack_nnode()
1027 if (lnum == c->lpt_last + 1) in ubifs_unpack_nnode()
1029 nnode->nbranch[i].lnum = lnum; in ubifs_unpack_nnode()
1030 nnode->nbranch[i].offs = ubifs_unpack_bits(c, &addr, &pos, in ubifs_unpack_nnode()
1031 c->lpt_offs_bits); in ubifs_unpack_nnode()
1033 err = check_lpt_crc(c, buf, c->nnode_sz); in ubifs_unpack_nnode()
1038 * unpack_ltab - unpack the LPT's own lprops table.
1039 * @c: UBIFS file-system description object
1044 static int unpack_ltab(const struct ubifs_info *c, void *buf) in unpack_ltab() argument
1049 err = check_lpt_type(c, &addr, &pos, UBIFS_LPT_LTAB); in unpack_ltab()
1052 for (i = 0; i < c->lpt_lebs; i++) { in unpack_ltab()
1053 int free = ubifs_unpack_bits(c, &addr, &pos, c->lpt_spc_bits); in unpack_ltab()
1054 int dirty = ubifs_unpack_bits(c, &addr, &pos, c->lpt_spc_bits); in unpack_ltab()
1056 if (free < 0 || free > c->leb_size || dirty < 0 || in unpack_ltab()
1057 dirty > c->leb_size || free + dirty > c->leb_size) in unpack_ltab()
1058 return -EINVAL; in unpack_ltab()
1060 c->ltab[i].free = free; in unpack_ltab()
1061 c->ltab[i].dirty = dirty; in unpack_ltab()
1062 c->ltab[i].tgc = 0; in unpack_ltab()
1063 c->ltab[i].cmt = 0; in unpack_ltab()
1065 err = check_lpt_crc(c, buf, c->ltab_sz); in unpack_ltab()
1070 * unpack_lsave - unpack the LPT's save table.
1071 * @c: UBIFS file-system description object
1076 static int unpack_lsave(const struct ubifs_info *c, void *buf) in unpack_lsave() argument
1081 err = check_lpt_type(c, &addr, &pos, UBIFS_LPT_LSAVE); in unpack_lsave()
1084 for (i = 0; i < c->lsave_cnt; i++) { in unpack_lsave()
1085 int lnum = ubifs_unpack_bits(c, &addr, &pos, c->lnum_bits); in unpack_lsave()
1087 if (lnum < c->main_first || lnum >= c->leb_cnt) in unpack_lsave()
1088 return -EINVAL; in unpack_lsave()
1089 c->lsave[i] = lnum; in unpack_lsave()
1091 err = check_lpt_crc(c, buf, c->lsave_sz); in unpack_lsave()
1096 * validate_nnode - validate a nnode.
1097 * @c: UBIFS file-system description object
1104 static int validate_nnode(const struct ubifs_info *c, struct ubifs_nnode *nnode, in validate_nnode() argument
1109 if (c->big_lpt) { in validate_nnode()
1110 int num = calc_nnode_num_from_parent(c, parent, iip); in validate_nnode()
1112 if (nnode->num != num) in validate_nnode()
1113 return -EINVAL; in validate_nnode()
1115 lvl = parent ? parent->level - 1 : c->lpt_hght; in validate_nnode()
1117 return -EINVAL; in validate_nnode()
1119 max_offs = c->leb_size - c->pnode_sz; in validate_nnode()
1121 max_offs = c->leb_size - c->nnode_sz; in validate_nnode()
1123 int lnum = nnode->nbranch[i].lnum; in validate_nnode()
1124 int offs = nnode->nbranch[i].offs; in validate_nnode()
1128 return -EINVAL; in validate_nnode()
1131 if (lnum < c->lpt_first || lnum > c->lpt_last) in validate_nnode()
1132 return -EINVAL; in validate_nnode()
1134 return -EINVAL; in validate_nnode()
1140 * validate_pnode - validate a pnode.
1141 * @c: UBIFS file-system description object
1148 static int validate_pnode(const struct ubifs_info *c, struct ubifs_pnode *pnode, in validate_pnode() argument
1153 if (c->big_lpt) { in validate_pnode()
1154 int num = calc_pnode_num_from_parent(c, parent, iip); in validate_pnode()
1156 if (pnode->num != num) in validate_pnode()
1157 return -EINVAL; in validate_pnode()
1160 int free = pnode->lprops[i].free; in validate_pnode()
1161 int dirty = pnode->lprops[i].dirty; in validate_pnode()
1163 if (free < 0 || free > c->leb_size || free % c->min_io_size || in validate_pnode()
1165 return -EINVAL; in validate_pnode()
1166 if (dirty < 0 || dirty > c->leb_size || (dirty & 7)) in validate_pnode()
1167 return -EINVAL; in validate_pnode()
1168 if (dirty + free > c->leb_size) in validate_pnode()
1169 return -EINVAL; in validate_pnode()
1175 * set_pnode_lnum - set LEB numbers on a pnode.
1176 * @c: UBIFS file-system description object
1182 static void set_pnode_lnum(const struct ubifs_info *c, in set_pnode_lnum() argument
1187 lnum = (pnode->num << UBIFS_LPT_FANOUT_SHIFT) + c->main_first; in set_pnode_lnum()
1189 if (lnum >= c->leb_cnt) in set_pnode_lnum()
1191 pnode->lprops[i].lnum = lnum++; in set_pnode_lnum()
1196 * ubifs_read_nnode - read a nnode from flash and link it to the tree in memory.
1197 * @c: UBIFS file-system description object
1203 int ubifs_read_nnode(struct ubifs_info *c, struct ubifs_nnode *parent, int iip) in ubifs_read_nnode() argument
1207 void *buf = c->lpt_nod_buf; in ubifs_read_nnode()
1211 branch = &parent->nbranch[iip]; in ubifs_read_nnode()
1212 lnum = branch->lnum; in ubifs_read_nnode()
1213 offs = branch->offs; in ubifs_read_nnode()
1215 lnum = c->lpt_lnum; in ubifs_read_nnode()
1216 offs = c->lpt_offs; in ubifs_read_nnode()
1220 err = -ENOMEM; in ubifs_read_nnode()
1230 if (c->big_lpt) in ubifs_read_nnode()
1231 nnode->num = calc_nnode_num_from_parent(c, parent, iip); in ubifs_read_nnode()
1233 err = ubifs_leb_read(c, lnum, buf, offs, c->nnode_sz, 1); in ubifs_read_nnode()
1236 err = ubifs_unpack_nnode(c, buf, nnode); in ubifs_read_nnode()
1240 err = validate_nnode(c, nnode, parent, iip); in ubifs_read_nnode()
1243 if (!c->big_lpt) in ubifs_read_nnode()
1244 nnode->num = calc_nnode_num_from_parent(c, parent, iip); in ubifs_read_nnode()
1246 branch->nnode = nnode; in ubifs_read_nnode()
1247 nnode->level = parent->level - 1; in ubifs_read_nnode()
1249 c->nroot = nnode; in ubifs_read_nnode()
1250 nnode->level = c->lpt_hght; in ubifs_read_nnode()
1252 nnode->parent = parent; in ubifs_read_nnode()
1253 nnode->iip = iip; in ubifs_read_nnode()
1257 ubifs_err(c, "error %d reading nnode at %d:%d", err, lnum, offs); in ubifs_read_nnode()
1264 * read_pnode - read a pnode from flash and link it to the tree in memory.
1265 * @c: UBIFS file-system description object
1271 static int read_pnode(struct ubifs_info *c, struct ubifs_nnode *parent, int iip) in read_pnode() argument
1275 void *buf = c->lpt_nod_buf; in read_pnode()
1278 branch = &parent->nbranch[iip]; in read_pnode()
1279 lnum = branch->lnum; in read_pnode()
1280 offs = branch->offs; in read_pnode()
1283 return -ENOMEM; in read_pnode()
1293 if (c->big_lpt) in read_pnode()
1294 pnode->num = calc_pnode_num_from_parent(c, parent, iip); in read_pnode()
1296 struct ubifs_lprops * const lprops = &pnode->lprops[i]; in read_pnode()
1298 lprops->free = c->leb_size; in read_pnode()
1299 lprops->flags = ubifs_categorize_lprops(c, lprops); in read_pnode()
1302 err = ubifs_leb_read(c, lnum, buf, offs, c->pnode_sz, 1); in read_pnode()
1305 err = unpack_pnode(c, buf, pnode); in read_pnode()
1309 err = validate_pnode(c, pnode, parent, iip); in read_pnode()
1312 if (!c->big_lpt) in read_pnode()
1313 pnode->num = calc_pnode_num_from_parent(c, parent, iip); in read_pnode()
1314 branch->pnode = pnode; in read_pnode()
1315 pnode->parent = parent; in read_pnode()
1316 pnode->iip = iip; in read_pnode()
1317 set_pnode_lnum(c, pnode); in read_pnode()
1318 c->pnodes_have += 1; in read_pnode()
1322 ubifs_err(c, "error %d reading pnode at %d:%d", err, lnum, offs); in read_pnode()
1323 ubifs_dump_pnode(c, pnode, parent, iip); in read_pnode()
1325 ubifs_err(c, "calc num: %d", calc_pnode_num_from_parent(c, parent, iip)); in read_pnode()
1331 * read_ltab - read LPT's own lprops table.
1332 * @c: UBIFS file-system description object
1336 static int read_ltab(struct ubifs_info *c) in read_ltab() argument
1341 buf = vmalloc(c->ltab_sz); in read_ltab()
1343 return -ENOMEM; in read_ltab()
1344 err = ubifs_leb_read(c, c->ltab_lnum, buf, c->ltab_offs, c->ltab_sz, 1); in read_ltab()
1347 err = unpack_ltab(c, buf); in read_ltab()
1354 * read_lsave - read LPT's save table.
1355 * @c: UBIFS file-system description object
1359 static int read_lsave(struct ubifs_info *c) in read_lsave() argument
1364 buf = vmalloc(c->lsave_sz); in read_lsave()
1366 return -ENOMEM; in read_lsave()
1367 err = ubifs_leb_read(c, c->lsave_lnum, buf, c->lsave_offs, in read_lsave()
1368 c->lsave_sz, 1); in read_lsave()
1371 err = unpack_lsave(c, buf); in read_lsave()
1374 for (i = 0; i < c->lsave_cnt; i++) { in read_lsave()
1375 int lnum = c->lsave[i]; in read_lsave()
1380 * could be beyond the volume size - just ignore them. in read_lsave()
1382 if (lnum >= c->leb_cnt) in read_lsave()
1384 lprops = ubifs_lpt_lookup(c, lnum); in read_lsave()
1396 * ubifs_get_nnode - get a nnode.
1397 * @c: UBIFS file-system description object
1404 struct ubifs_nnode *ubifs_get_nnode(struct ubifs_info *c, in ubifs_get_nnode() argument
1411 branch = &parent->nbranch[iip]; in ubifs_get_nnode()
1412 nnode = branch->nnode; in ubifs_get_nnode()
1415 err = ubifs_read_nnode(c, parent, iip); in ubifs_get_nnode()
1418 return branch->nnode; in ubifs_get_nnode()
1422 * ubifs_get_pnode - get a pnode.
1423 * @c: UBIFS file-system description object
1430 struct ubifs_pnode *ubifs_get_pnode(struct ubifs_info *c, in ubifs_get_pnode() argument
1437 branch = &parent->nbranch[iip]; in ubifs_get_pnode()
1438 pnode = branch->pnode; in ubifs_get_pnode()
1441 err = read_pnode(c, parent, iip); in ubifs_get_pnode()
1444 update_cats(c, branch->pnode); in ubifs_get_pnode()
1445 return branch->pnode; in ubifs_get_pnode()
1449 * ubifs_pnode_lookup - lookup a pnode in the LPT.
1450 * @c: UBIFS file-system description object
1451 * @i: pnode number (0 to (main_lebs - 1) / UBIFS_LPT_FANOUT)
1456 struct ubifs_pnode *ubifs_pnode_lookup(struct ubifs_info *c, int i) in ubifs_pnode_lookup() argument
1461 if (!c->nroot) { in ubifs_pnode_lookup()
1462 err = ubifs_read_nnode(c, NULL, 0); in ubifs_pnode_lookup()
1467 nnode = c->nroot; in ubifs_pnode_lookup()
1468 shft = c->lpt_hght * UBIFS_LPT_FANOUT_SHIFT; in ubifs_pnode_lookup()
1469 for (h = 1; h < c->lpt_hght; h++) { in ubifs_pnode_lookup()
1470 iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1)); in ubifs_pnode_lookup()
1471 shft -= UBIFS_LPT_FANOUT_SHIFT; in ubifs_pnode_lookup()
1472 nnode = ubifs_get_nnode(c, nnode, iip); in ubifs_pnode_lookup()
1476 iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1)); in ubifs_pnode_lookup()
1477 return ubifs_get_pnode(c, nnode, iip); in ubifs_pnode_lookup()
1481 * ubifs_lpt_lookup - lookup LEB properties in the LPT.
1482 * @c: UBIFS file-system description object
1488 struct ubifs_lprops *ubifs_lpt_lookup(struct ubifs_info *c, int lnum) in ubifs_lpt_lookup() argument
1493 i = lnum - c->main_first; in ubifs_lpt_lookup()
1494 pnode = ubifs_pnode_lookup(c, i >> UBIFS_LPT_FANOUT_SHIFT); in ubifs_lpt_lookup()
1497 iip = (i & (UBIFS_LPT_FANOUT - 1)); in ubifs_lpt_lookup()
1499 pnode->lprops[iip].free, pnode->lprops[iip].dirty, in ubifs_lpt_lookup()
1500 pnode->lprops[iip].flags); in ubifs_lpt_lookup()
1501 return &pnode->lprops[iip]; in ubifs_lpt_lookup()
1505 * dirty_cow_nnode - ensure a nnode is not being committed.
1506 * @c: UBIFS file-system description object
1511 static struct ubifs_nnode *dirty_cow_nnode(struct ubifs_info *c, in dirty_cow_nnode() argument
1517 if (!test_bit(COW_CNODE, &nnode->flags)) { in dirty_cow_nnode()
1519 if (!test_and_set_bit(DIRTY_CNODE, &nnode->flags)) { in dirty_cow_nnode()
1520 c->dirty_nn_cnt += 1; in dirty_cow_nnode()
1521 ubifs_add_nnode_dirt(c, nnode); in dirty_cow_nnode()
1529 return ERR_PTR(-ENOMEM); in dirty_cow_nnode()
1531 n->cnext = NULL; in dirty_cow_nnode()
1532 __set_bit(DIRTY_CNODE, &n->flags); in dirty_cow_nnode()
1533 __clear_bit(COW_CNODE, &n->flags); in dirty_cow_nnode()
1537 struct ubifs_nbranch *branch = &n->nbranch[i]; in dirty_cow_nnode()
1539 if (branch->cnode) in dirty_cow_nnode()
1540 branch->cnode->parent = n; in dirty_cow_nnode()
1543 ubifs_assert(c, !test_bit(OBSOLETE_CNODE, &nnode->flags)); in dirty_cow_nnode()
1544 __set_bit(OBSOLETE_CNODE, &nnode->flags); in dirty_cow_nnode()
1546 c->dirty_nn_cnt += 1; in dirty_cow_nnode()
1547 ubifs_add_nnode_dirt(c, nnode); in dirty_cow_nnode()
1548 if (nnode->parent) in dirty_cow_nnode()
1549 nnode->parent->nbranch[n->iip].nnode = n; in dirty_cow_nnode()
1551 c->nroot = n; in dirty_cow_nnode()
1556 * dirty_cow_pnode - ensure a pnode is not being committed.
1557 * @c: UBIFS file-system description object
1562 static struct ubifs_pnode *dirty_cow_pnode(struct ubifs_info *c, in dirty_cow_pnode() argument
1567 if (!test_bit(COW_CNODE, &pnode->flags)) { in dirty_cow_pnode()
1569 if (!test_and_set_bit(DIRTY_CNODE, &pnode->flags)) { in dirty_cow_pnode()
1570 c->dirty_pn_cnt += 1; in dirty_cow_pnode()
1571 add_pnode_dirt(c, pnode); in dirty_cow_pnode()
1579 return ERR_PTR(-ENOMEM); in dirty_cow_pnode()
1581 p->cnext = NULL; in dirty_cow_pnode()
1582 __set_bit(DIRTY_CNODE, &p->flags); in dirty_cow_pnode()
1583 __clear_bit(COW_CNODE, &p->flags); in dirty_cow_pnode()
1584 replace_cats(c, pnode, p); in dirty_cow_pnode()
1586 ubifs_assert(c, !test_bit(OBSOLETE_CNODE, &pnode->flags)); in dirty_cow_pnode()
1587 __set_bit(OBSOLETE_CNODE, &pnode->flags); in dirty_cow_pnode()
1589 c->dirty_pn_cnt += 1; in dirty_cow_pnode()
1590 add_pnode_dirt(c, pnode); in dirty_cow_pnode()
1591 pnode->parent->nbranch[p->iip].pnode = p; in dirty_cow_pnode()
1596 * ubifs_lpt_lookup_dirty - lookup LEB properties in the LPT.
1597 * @c: UBIFS file-system description object
1603 struct ubifs_lprops *ubifs_lpt_lookup_dirty(struct ubifs_info *c, int lnum) in ubifs_lpt_lookup_dirty() argument
1609 if (!c->nroot) { in ubifs_lpt_lookup_dirty()
1610 err = ubifs_read_nnode(c, NULL, 0); in ubifs_lpt_lookup_dirty()
1614 nnode = c->nroot; in ubifs_lpt_lookup_dirty()
1615 nnode = dirty_cow_nnode(c, nnode); in ubifs_lpt_lookup_dirty()
1618 i = lnum - c->main_first; in ubifs_lpt_lookup_dirty()
1619 shft = c->lpt_hght * UBIFS_LPT_FANOUT_SHIFT; in ubifs_lpt_lookup_dirty()
1620 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_lookup_dirty()
1621 iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1)); in ubifs_lpt_lookup_dirty()
1622 shft -= UBIFS_LPT_FANOUT_SHIFT; in ubifs_lpt_lookup_dirty()
1623 nnode = ubifs_get_nnode(c, nnode, iip); in ubifs_lpt_lookup_dirty()
1626 nnode = dirty_cow_nnode(c, nnode); in ubifs_lpt_lookup_dirty()
1630 iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1)); in ubifs_lpt_lookup_dirty()
1631 pnode = ubifs_get_pnode(c, nnode, iip); in ubifs_lpt_lookup_dirty()
1634 pnode = dirty_cow_pnode(c, pnode); in ubifs_lpt_lookup_dirty()
1637 iip = (i & (UBIFS_LPT_FANOUT - 1)); in ubifs_lpt_lookup_dirty()
1639 pnode->lprops[iip].free, pnode->lprops[iip].dirty, in ubifs_lpt_lookup_dirty()
1640 pnode->lprops[iip].flags); in ubifs_lpt_lookup_dirty()
1641 ubifs_assert(c, test_bit(DIRTY_CNODE, &pnode->flags)); in ubifs_lpt_lookup_dirty()
1642 return &pnode->lprops[iip]; in ubifs_lpt_lookup_dirty()
1646 * ubifs_lpt_calc_hash - Calculate hash of the LPT pnodes
1647 * @c: UBIFS file-system description object
1653 int ubifs_lpt_calc_hash(struct ubifs_info *c, u8 *hash) in ubifs_lpt_calc_hash() argument
1659 int bufsiz = max_t(int, c->nnode_sz, c->pnode_sz); in ubifs_lpt_calc_hash()
1663 if (!ubifs_authenticated(c)) in ubifs_lpt_calc_hash()
1666 if (!c->nroot) { in ubifs_lpt_calc_hash()
1667 err = ubifs_read_nnode(c, NULL, 0); in ubifs_lpt_calc_hash()
1672 desc = ubifs_hash_get_desc(c); in ubifs_lpt_calc_hash()
1678 err = -ENOMEM; in ubifs_lpt_calc_hash()
1682 cnode = (struct ubifs_cnode *)c->nroot; in ubifs_lpt_calc_hash()
1685 nnode = cnode->parent; in ubifs_lpt_calc_hash()
1687 if (cnode->level > 1) { in ubifs_lpt_calc_hash()
1689 if (nn->nbranch[iip].lnum == 0) { in ubifs_lpt_calc_hash()
1695 nnode = ubifs_get_nnode(c, nn, iip); in ubifs_lpt_calc_hash()
1712 if (nn->nbranch[i].lnum == 0) in ubifs_lpt_calc_hash()
1714 pnode = ubifs_get_pnode(c, nn, i); in ubifs_lpt_calc_hash()
1720 ubifs_pack_pnode(c, buf, pnode); in ubifs_lpt_calc_hash()
1721 err = ubifs_shash_update(c, desc, buf, in ubifs_lpt_calc_hash()
1722 c->pnode_sz); in ubifs_lpt_calc_hash()
1728 iip = cnode->iip + 1; in ubifs_lpt_calc_hash()
1732 err = ubifs_shash_final(c, desc, hash); in ubifs_lpt_calc_hash()
1741 * lpt_check_hash - check the hash of the LPT.
1742 * @c: UBIFS file-system description object
1748 static int lpt_check_hash(struct ubifs_info *c) in lpt_check_hash() argument
1753 if (!ubifs_authenticated(c)) in lpt_check_hash()
1756 err = ubifs_lpt_calc_hash(c, hash); in lpt_check_hash()
1760 if (ubifs_check_hash(c, c->mst_node->hash_lpt, hash)) { in lpt_check_hash()
1761 err = -EPERM; in lpt_check_hash()
1762 ubifs_err(c, "Failed to authenticate LPT"); in lpt_check_hash()
1771 * lpt_init_rd - initialize the LPT for reading.
1772 * @c: UBIFS file-system description object
1776 static int lpt_init_rd(struct ubifs_info *c) in lpt_init_rd() argument
1780 c->ltab = vmalloc(array_size(sizeof(struct ubifs_lpt_lprops), in lpt_init_rd()
1781 c->lpt_lebs)); in lpt_init_rd()
1782 if (!c->ltab) in lpt_init_rd()
1783 return -ENOMEM; in lpt_init_rd()
1785 i = max_t(int, c->nnode_sz, c->pnode_sz); in lpt_init_rd()
1786 c->lpt_nod_buf = kmalloc(i, GFP_KERNEL); in lpt_init_rd()
1787 if (!c->lpt_nod_buf) in lpt_init_rd()
1788 return -ENOMEM; in lpt_init_rd()
1791 c->lpt_heap[i].arr = kmalloc_array(LPT_HEAP_SZ, in lpt_init_rd()
1794 if (!c->lpt_heap[i].arr) in lpt_init_rd()
1795 return -ENOMEM; in lpt_init_rd()
1796 c->lpt_heap[i].cnt = 0; in lpt_init_rd()
1797 c->lpt_heap[i].max_cnt = LPT_HEAP_SZ; in lpt_init_rd()
1800 c->dirty_idx.arr = kmalloc_array(LPT_HEAP_SZ, sizeof(void *), in lpt_init_rd()
1802 if (!c->dirty_idx.arr) in lpt_init_rd()
1803 return -ENOMEM; in lpt_init_rd()
1804 c->dirty_idx.cnt = 0; in lpt_init_rd()
1805 c->dirty_idx.max_cnt = LPT_HEAP_SZ; in lpt_init_rd()
1807 err = read_ltab(c); in lpt_init_rd()
1811 err = lpt_check_hash(c); in lpt_init_rd()
1815 dbg_lp("space_bits %d", c->space_bits); in lpt_init_rd()
1816 dbg_lp("lpt_lnum_bits %d", c->lpt_lnum_bits); in lpt_init_rd()
1817 dbg_lp("lpt_offs_bits %d", c->lpt_offs_bits); in lpt_init_rd()
1818 dbg_lp("lpt_spc_bits %d", c->lpt_spc_bits); in lpt_init_rd()
1819 dbg_lp("pcnt_bits %d", c->pcnt_bits); in lpt_init_rd()
1820 dbg_lp("lnum_bits %d", c->lnum_bits); in lpt_init_rd()
1821 dbg_lp("pnode_sz %d", c->pnode_sz); in lpt_init_rd()
1822 dbg_lp("nnode_sz %d", c->nnode_sz); in lpt_init_rd()
1823 dbg_lp("ltab_sz %d", c->ltab_sz); in lpt_init_rd()
1824 dbg_lp("lsave_sz %d", c->lsave_sz); in lpt_init_rd()
1825 dbg_lp("lsave_cnt %d", c->lsave_cnt); in lpt_init_rd()
1826 dbg_lp("lpt_hght %d", c->lpt_hght); in lpt_init_rd()
1827 dbg_lp("big_lpt %u", c->big_lpt); in lpt_init_rd()
1828 dbg_lp("LPT root is at %d:%d", c->lpt_lnum, c->lpt_offs); in lpt_init_rd()
1829 dbg_lp("LPT head is at %d:%d", c->nhead_lnum, c->nhead_offs); in lpt_init_rd()
1830 dbg_lp("LPT ltab is at %d:%d", c->ltab_lnum, c->ltab_offs); in lpt_init_rd()
1831 if (c->big_lpt) in lpt_init_rd()
1832 dbg_lp("LPT lsave is at %d:%d", c->lsave_lnum, c->lsave_offs); in lpt_init_rd()
1838 * lpt_init_wr - initialize the LPT for writing.
1839 * @c: UBIFS file-system description object
1845 static int lpt_init_wr(struct ubifs_info *c) in lpt_init_wr() argument
1849 c->ltab_cmt = vmalloc(array_size(sizeof(struct ubifs_lpt_lprops), in lpt_init_wr()
1850 c->lpt_lebs)); in lpt_init_wr()
1851 if (!c->ltab_cmt) in lpt_init_wr()
1852 return -ENOMEM; in lpt_init_wr()
1854 c->lpt_buf = vmalloc(c->leb_size); in lpt_init_wr()
1855 if (!c->lpt_buf) in lpt_init_wr()
1856 return -ENOMEM; in lpt_init_wr()
1858 if (c->big_lpt) { in lpt_init_wr()
1859 c->lsave = kmalloc_array(c->lsave_cnt, sizeof(int), GFP_NOFS); in lpt_init_wr()
1860 if (!c->lsave) in lpt_init_wr()
1861 return -ENOMEM; in lpt_init_wr()
1862 err = read_lsave(c); in lpt_init_wr()
1867 for (i = 0; i < c->lpt_lebs; i++) in lpt_init_wr()
1868 if (c->ltab[i].free == c->leb_size) { in lpt_init_wr()
1869 err = ubifs_leb_unmap(c, i + c->lpt_first); in lpt_init_wr()
1878 * ubifs_lpt_init - initialize the LPT.
1879 * @c: UBIFS file-system description object
1889 int ubifs_lpt_init(struct ubifs_info *c, int rd, int wr) in ubifs_lpt_init() argument
1894 err = lpt_init_rd(c); in ubifs_lpt_init()
1900 err = lpt_init_wr(c); in ubifs_lpt_init()
1909 ubifs_lpt_free(c, 1); in ubifs_lpt_init()
1911 ubifs_lpt_free(c, 0); in ubifs_lpt_init()
1916 * struct lpt_scan_node - somewhere to put nodes while we scan LPT.
1942 * scan_get_nnode - for the scan, get a nnode from either the tree or flash.
1943 * @c: the UBIFS file-system description object
1951 static struct ubifs_nnode *scan_get_nnode(struct ubifs_info *c, in scan_get_nnode() argument
1957 void *buf = c->lpt_nod_buf; in scan_get_nnode()
1960 branch = &parent->nbranch[iip]; in scan_get_nnode()
1961 nnode = branch->nnode; in scan_get_nnode()
1963 path->in_tree = 1; in scan_get_nnode()
1964 path->ptr.nnode = nnode; in scan_get_nnode()
1967 nnode = &path->nnode; in scan_get_nnode()
1968 path->in_tree = 0; in scan_get_nnode()
1969 path->ptr.nnode = nnode; in scan_get_nnode()
1971 if (branch->lnum == 0) { in scan_get_nnode()
1978 if (c->big_lpt) in scan_get_nnode()
1979 nnode->num = calc_nnode_num_from_parent(c, parent, iip); in scan_get_nnode()
1981 err = ubifs_leb_read(c, branch->lnum, buf, branch->offs, in scan_get_nnode()
1982 c->nnode_sz, 1); in scan_get_nnode()
1985 err = ubifs_unpack_nnode(c, buf, nnode); in scan_get_nnode()
1989 err = validate_nnode(c, nnode, parent, iip); in scan_get_nnode()
1992 if (!c->big_lpt) in scan_get_nnode()
1993 nnode->num = calc_nnode_num_from_parent(c, parent, iip); in scan_get_nnode()
1994 nnode->level = parent->level - 1; in scan_get_nnode()
1995 nnode->parent = parent; in scan_get_nnode()
1996 nnode->iip = iip; in scan_get_nnode()
2001 * scan_get_pnode - for the scan, get a pnode from either the tree or flash.
2002 * @c: the UBIFS file-system description object
2010 static struct ubifs_pnode *scan_get_pnode(struct ubifs_info *c, in scan_get_pnode() argument
2016 void *buf = c->lpt_nod_buf; in scan_get_pnode()
2019 branch = &parent->nbranch[iip]; in scan_get_pnode()
2020 pnode = branch->pnode; in scan_get_pnode()
2022 path->in_tree = 1; in scan_get_pnode()
2023 path->ptr.pnode = pnode; in scan_get_pnode()
2026 pnode = &path->pnode; in scan_get_pnode()
2027 path->in_tree = 0; in scan_get_pnode()
2028 path->ptr.pnode = pnode; in scan_get_pnode()
2030 if (branch->lnum == 0) { in scan_get_pnode()
2038 if (c->big_lpt) in scan_get_pnode()
2039 pnode->num = calc_pnode_num_from_parent(c, parent, iip); in scan_get_pnode()
2041 struct ubifs_lprops * const lprops = &pnode->lprops[i]; in scan_get_pnode()
2043 lprops->free = c->leb_size; in scan_get_pnode()
2044 lprops->flags = ubifs_categorize_lprops(c, lprops); in scan_get_pnode()
2047 ubifs_assert(c, branch->lnum >= c->lpt_first && in scan_get_pnode()
2048 branch->lnum <= c->lpt_last); in scan_get_pnode()
2049 ubifs_assert(c, branch->offs >= 0 && branch->offs < c->leb_size); in scan_get_pnode()
2050 err = ubifs_leb_read(c, branch->lnum, buf, branch->offs, in scan_get_pnode()
2051 c->pnode_sz, 1); in scan_get_pnode()
2054 err = unpack_pnode(c, buf, pnode); in scan_get_pnode()
2058 err = validate_pnode(c, pnode, parent, iip); in scan_get_pnode()
2061 if (!c->big_lpt) in scan_get_pnode()
2062 pnode->num = calc_pnode_num_from_parent(c, parent, iip); in scan_get_pnode()
2063 pnode->parent = parent; in scan_get_pnode()
2064 pnode->iip = iip; in scan_get_pnode()
2065 set_pnode_lnum(c, pnode); in scan_get_pnode()
2070 * ubifs_lpt_scan_nolock - scan the LPT.
2071 * @c: the UBIFS file-system description object
2079 int ubifs_lpt_scan_nolock(struct ubifs_info *c, int start_lnum, int end_lnum, in ubifs_lpt_scan_nolock() argument
2087 if (start_lnum == -1) { in ubifs_lpt_scan_nolock()
2089 if (start_lnum >= c->leb_cnt) in ubifs_lpt_scan_nolock()
2090 start_lnum = c->main_first; in ubifs_lpt_scan_nolock()
2093 ubifs_assert(c, start_lnum >= c->main_first && start_lnum < c->leb_cnt); in ubifs_lpt_scan_nolock()
2094 ubifs_assert(c, end_lnum >= c->main_first && end_lnum < c->leb_cnt); in ubifs_lpt_scan_nolock()
2096 if (!c->nroot) { in ubifs_lpt_scan_nolock()
2097 err = ubifs_read_nnode(c, NULL, 0); in ubifs_lpt_scan_nolock()
2102 path = kmalloc_array(c->lpt_hght + 1, sizeof(struct lpt_scan_node), in ubifs_lpt_scan_nolock()
2105 return -ENOMEM; in ubifs_lpt_scan_nolock()
2107 path[0].ptr.nnode = c->nroot; in ubifs_lpt_scan_nolock()
2111 nnode = c->nroot; in ubifs_lpt_scan_nolock()
2112 i = start_lnum - c->main_first; in ubifs_lpt_scan_nolock()
2113 shft = c->lpt_hght * UBIFS_LPT_FANOUT_SHIFT; in ubifs_lpt_scan_nolock()
2114 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_scan_nolock()
2115 iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1)); in ubifs_lpt_scan_nolock()
2116 shft -= UBIFS_LPT_FANOUT_SHIFT; in ubifs_lpt_scan_nolock()
2117 nnode = scan_get_nnode(c, path + h, nnode, iip); in ubifs_lpt_scan_nolock()
2123 iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1)); in ubifs_lpt_scan_nolock()
2124 pnode = scan_get_pnode(c, path + h, nnode, iip); in ubifs_lpt_scan_nolock()
2129 iip = (i & (UBIFS_LPT_FANOUT - 1)); in ubifs_lpt_scan_nolock()
2133 struct ubifs_lprops *lprops = &pnode->lprops[iip]; in ubifs_lpt_scan_nolock()
2134 int ret, lnum = lprops->lnum; in ubifs_lpt_scan_nolock()
2136 ret = scan_cb(c, lprops, path[h].in_tree, data); in ubifs_lpt_scan_nolock()
2143 for (h = 1; h < c->lpt_hght; h++) { in ubifs_lpt_scan_nolock()
2151 err = -ENOMEM; in ubifs_lpt_scan_nolock()
2154 parent = nnode->parent; in ubifs_lpt_scan_nolock()
2155 parent->nbranch[nnode->iip].nnode = nnode; in ubifs_lpt_scan_nolock()
2161 ubifs_ensure_cat(c, lprops); in ubifs_lpt_scan_nolock()
2168 err = -ENOMEM; in ubifs_lpt_scan_nolock()
2171 parent = pnode->parent; in ubifs_lpt_scan_nolock()
2172 parent->nbranch[pnode->iip].pnode = pnode; in ubifs_lpt_scan_nolock()
2175 update_cats(c, pnode); in ubifs_lpt_scan_nolock()
2176 c->pnodes_have += 1; in ubifs_lpt_scan_nolock()
2178 err = dbg_check_lpt_nodes(c, (struct ubifs_cnode *) in ubifs_lpt_scan_nolock()
2179 c->nroot, 0, 0); in ubifs_lpt_scan_nolock()
2182 err = dbg_check_cats(c); in ubifs_lpt_scan_nolock()
2196 err = -ENOSPC; in ubifs_lpt_scan_nolock()
2199 if (lnum + 1 >= c->leb_cnt) { in ubifs_lpt_scan_nolock()
2200 /* Wrap-around to the beginning */ in ubifs_lpt_scan_nolock()
2201 start_lnum = c->main_first; in ubifs_lpt_scan_nolock()
2210 iip = pnode->iip; in ubifs_lpt_scan_nolock()
2212 h -= 1; in ubifs_lpt_scan_nolock()
2213 ubifs_assert(c, h >= 0); in ubifs_lpt_scan_nolock()
2217 iip = nnode->iip; in ubifs_lpt_scan_nolock()
2223 for (; h < c->lpt_hght; h++) { in ubifs_lpt_scan_nolock()
2224 nnode = scan_get_nnode(c, path + h, nnode, iip); in ubifs_lpt_scan_nolock()
2231 pnode = scan_get_pnode(c, path + h, nnode, iip); in ubifs_lpt_scan_nolock()
2244 * dbg_chk_pnode - check a pnode.
2245 * @c: the UBIFS file-system description object
2251 static int dbg_chk_pnode(struct ubifs_info *c, struct ubifs_pnode *pnode, in dbg_chk_pnode() argument
2256 if (pnode->num != col) { in dbg_chk_pnode()
2257 ubifs_err(c, "pnode num %d expected %d parent num %d iip %d", in dbg_chk_pnode()
2258 pnode->num, col, pnode->parent->num, pnode->iip); in dbg_chk_pnode()
2259 return -EINVAL; in dbg_chk_pnode()
2262 struct ubifs_lprops *lp, *lprops = &pnode->lprops[i]; in dbg_chk_pnode()
2263 int lnum = (pnode->num << UBIFS_LPT_FANOUT_SHIFT) + i + in dbg_chk_pnode()
2264 c->main_first; in dbg_chk_pnode()
2265 int found, cat = lprops->flags & LPROPS_CAT_MASK; in dbg_chk_pnode()
2269 if (lnum >= c->leb_cnt) in dbg_chk_pnode()
2271 if (lprops->lnum != lnum) { in dbg_chk_pnode()
2272 ubifs_err(c, "bad LEB number %d expected %d", in dbg_chk_pnode()
2273 lprops->lnum, lnum); in dbg_chk_pnode()
2274 return -EINVAL; in dbg_chk_pnode()
2276 if (lprops->flags & LPROPS_TAKEN) { in dbg_chk_pnode()
2278 ubifs_err(c, "LEB %d taken but not uncat %d", in dbg_chk_pnode()
2279 lprops->lnum, cat); in dbg_chk_pnode()
2280 return -EINVAL; in dbg_chk_pnode()
2284 if (lprops->flags & LPROPS_INDEX) { in dbg_chk_pnode()
2291 ubifs_err(c, "LEB %d index but cat %d", in dbg_chk_pnode()
2292 lprops->lnum, cat); in dbg_chk_pnode()
2293 return -EINVAL; in dbg_chk_pnode()
2304 ubifs_err(c, "LEB %d not index but cat %d", in dbg_chk_pnode()
2305 lprops->lnum, cat); in dbg_chk_pnode()
2306 return -EINVAL; in dbg_chk_pnode()
2311 list = &c->uncat_list; in dbg_chk_pnode()
2314 list = &c->empty_list; in dbg_chk_pnode()
2317 list = &c->freeable_list; in dbg_chk_pnode()
2320 list = &c->frdi_idx_list; in dbg_chk_pnode()
2328 heap = &c->lpt_heap[cat - 1]; in dbg_chk_pnode()
2329 if (lprops->hpos < heap->cnt && in dbg_chk_pnode()
2330 heap->arr[lprops->hpos] == lprops) in dbg_chk_pnode()
2345 ubifs_err(c, "LEB %d cat %d not found in cat heap/list", in dbg_chk_pnode()
2346 lprops->lnum, cat); in dbg_chk_pnode()
2347 return -EINVAL; in dbg_chk_pnode()
2351 if (lprops->free != c->leb_size) { in dbg_chk_pnode()
2352 ubifs_err(c, "LEB %d cat %d free %d dirty %d", in dbg_chk_pnode()
2353 lprops->lnum, cat, lprops->free, in dbg_chk_pnode()
2354 lprops->dirty); in dbg_chk_pnode()
2355 return -EINVAL; in dbg_chk_pnode()
2360 if (lprops->free + lprops->dirty != c->leb_size) { in dbg_chk_pnode()
2361 ubifs_err(c, "LEB %d cat %d free %d dirty %d", in dbg_chk_pnode()
2362 lprops->lnum, cat, lprops->free, in dbg_chk_pnode()
2363 lprops->dirty); in dbg_chk_pnode()
2364 return -EINVAL; in dbg_chk_pnode()
2373 * dbg_check_lpt_nodes - check nnodes and pnodes.
2374 * @c: the UBIFS file-system description object
2381 int dbg_check_lpt_nodes(struct ubifs_info *c, struct ubifs_cnode *cnode, in dbg_check_lpt_nodes() argument
2388 if (!dbg_is_chk_lprops(c)) in dbg_check_lpt_nodes()
2392 ubifs_assert(c, row >= 0); in dbg_check_lpt_nodes()
2393 nnode = cnode->parent; in dbg_check_lpt_nodes()
2394 if (cnode->level) { in dbg_check_lpt_nodes()
2397 if (cnode->num != num) { in dbg_check_lpt_nodes()
2398 ubifs_err(c, "nnode num %d expected %d parent num %d iip %d", in dbg_check_lpt_nodes()
2399 cnode->num, num, in dbg_check_lpt_nodes()
2400 (nnode ? nnode->num : 0), cnode->iip); in dbg_check_lpt_nodes()
2401 return -EINVAL; in dbg_check_lpt_nodes()
2405 cn = nn->nbranch[iip].cnode; in dbg_check_lpt_nodes()
2425 err = dbg_chk_pnode(c, pnode, col); in dbg_check_lpt_nodes()
2430 row -= 1; in dbg_check_lpt_nodes()
2432 iip = cnode->iip + 1; in dbg_check_lpt_nodes()