• Home
  • Raw
  • Download

Lines Matching refs:i

48 	int i, n, bits, per_leb_wastage, max_pnode_cnt;  in do_calc_lpt_geom()  local
65 for (i = 1; i < c->lpt_hght; i++) { in do_calc_lpt_geom()
165 int i, lebs_needed; in calc_dflt_lpt_geom() local
191 for (i = 0; i < 64 ; i++) { in calc_dflt_lpt_geom()
344 int i, pos = 0; in ubifs_pack_pnode() local
350 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in ubifs_pack_pnode()
351 pack_bits(c, &addr, &pos, pnode->lprops[i].free >> 3, in ubifs_pack_pnode()
353 pack_bits(c, &addr, &pos, pnode->lprops[i].dirty >> 3, in ubifs_pack_pnode()
355 if (pnode->lprops[i].flags & LPROPS_INDEX) in ubifs_pack_pnode()
377 int i, pos = 0; in ubifs_pack_nnode() local
383 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in ubifs_pack_nnode()
384 int lnum = nnode->nbranch[i].lnum; in ubifs_pack_nnode()
389 pack_bits(c, &addr, &pos, nnode->nbranch[i].offs, in ubifs_pack_nnode()
409 int i, pos = 0; in ubifs_pack_ltab() local
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()
433 int i, pos = 0; in ubifs_pack_lsave() local
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()
576 int i, n = c->lpt_hght - 1, pnum = parent->num, num = 0; in calc_pnode_num_from_parent() local
578 for (i = 0; i < n; i++) { in calc_pnode_num_from_parent()
602 int lnum, err = 0, node_sz, iopos, i, j, cnt, len, alen, row; in ubifs_create_dflt_lpt() local
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()
644 ltab[i].dirty = 0; in ubifs_create_dflt_lpt()
645 ltab[i].tgc = 0; in ubifs_create_dflt_lpt()
646 ltab[i].cmt = 0; in ubifs_create_dflt_lpt()
669 for (i = 2; i < UBIFS_LPT_FANOUT; i++) in ubifs_create_dflt_lpt()
670 pnode->lprops[i].free = c->leb_size; in ubifs_create_dflt_lpt()
700 for (i = 1; i < cnt; i++) { in ubifs_create_dflt_lpt()
727 for (i = UBIFS_LPT_FANOUT; cnt > i; i <<= UBIFS_LPT_FANOUT_SHIFT) in ubifs_create_dflt_lpt()
733 for (i = 0; i < cnt; i++) { in ubifs_create_dflt_lpt()
766 nnode->num = calc_nnode_num(row, i); 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()
881 int i; in update_cats() local
883 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in update_cats()
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()
906 int i; in replace_cats() local
908 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in replace_cats()
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()
978 int i, pos = 0, err; in unpack_pnode() local
985 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in unpack_pnode()
986 struct ubifs_lprops * const lprops = &pnode->lprops[i]; in unpack_pnode()
1015 int i, pos = 0, err; in ubifs_unpack_nnode() local
1022 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { 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()
1047 int i, pos = 0, err; in unpack_ltab() local
1052 for (i = 0; i < c->lpt_lebs; i++) { 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()
1079 int i, pos = 0, err; in unpack_lsave() local
1084 for (i = 0; i < c->lsave_cnt; i++) { in unpack_lsave()
1089 c->lsave[i] = lnum; in unpack_lsave()
1107 int i, lvl, max_offs; in validate_nnode() local
1122 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in validate_nnode()
1123 int lnum = nnode->nbranch[i].lnum; in validate_nnode()
1124 int offs = nnode->nbranch[i].offs; in validate_nnode()
1151 int i; in validate_pnode() local
1159 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in validate_pnode()
1160 int free = pnode->lprops[i].free; in validate_pnode()
1161 int dirty = pnode->lprops[i].dirty; in validate_pnode()
1185 int i, lnum; in set_pnode_lnum() local
1188 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in set_pnode_lnum()
1191 pnode->lprops[i].lnum = lnum++; in set_pnode_lnum()
1291 int i; in read_pnode() local
1295 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in read_pnode()
1296 struct ubifs_lprops * const lprops = &pnode->lprops[i]; in read_pnode()
1361 int err, i; in read_lsave() local
1374 for (i = 0; i < c->lsave_cnt; i++) { in read_lsave()
1375 int lnum = c->lsave[i]; in read_lsave()
1456 struct ubifs_pnode *ubifs_pnode_lookup(struct ubifs_info *c, int i) in ubifs_pnode_lookup() argument
1466 i <<= UBIFS_LPT_FANOUT_SHIFT; in ubifs_pnode_lookup()
1470 iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1)); in ubifs_pnode_lookup()
1476 iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1)); in ubifs_pnode_lookup()
1490 int i, iip; in ubifs_lpt_lookup() local
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()
1515 int i; in dirty_cow_nnode() local
1536 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in dirty_cow_nnode()
1537 struct ubifs_nbranch *branch = &n->nbranch[i]; in dirty_cow_nnode()
1605 int err, i, h, iip, shft; in ubifs_lpt_lookup_dirty() local
1618 i = lnum - c->main_first; in ubifs_lpt_lookup_dirty()
1621 iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1)); in ubifs_lpt_lookup_dirty()
1630 iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1)); in ubifs_lpt_lookup_dirty()
1637 iip = (i & (UBIFS_LPT_FANOUT - 1)); in ubifs_lpt_lookup_dirty()
1658 int iip = 0, i; in ubifs_lpt_calc_hash() local
1711 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { 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()
1778 int err, i; in lpt_init_rd() local
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()
1790 for (i = 0; i < LPROPS_HEAP_CNT; i++) { 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()
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()
1847 int err, i; in lpt_init_wr() local
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()
2035 int i; in scan_get_pnode() local
2039 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in scan_get_pnode()
2040 struct ubifs_lprops * const lprops = &pnode->lprops[i]; in scan_get_pnode()
2081 int err = 0, i, h, iip, shft; in ubifs_lpt_scan_nolock() local
2111 i = start_lnum - c->main_first; in ubifs_lpt_scan_nolock()
2114 iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1)); in ubifs_lpt_scan_nolock()
2122 iip = ((i >> shft) & (UBIFS_LPT_FANOUT - 1)); in ubifs_lpt_scan_nolock()
2128 iip = (i & (UBIFS_LPT_FANOUT - 1)); in ubifs_lpt_scan_nolock()
2253 int i; in dbg_chk_pnode() local
2260 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in dbg_chk_pnode()
2261 struct ubifs_lprops *lp, *lprops = &pnode->lprops[i]; in dbg_chk_pnode()
2262 int lnum = (pnode->num << UBIFS_LPT_FANOUT_SHIFT) + i + in dbg_chk_pnode()