Lines Matching refs:i
34 int i, cont = 0; in first_dirty_cnode() local
36 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in first_dirty_cnode()
39 cnode = nnode->nbranch[i].cnode; in first_dirty_cnode()
64 int i; in next_dirty_cnode() local
70 for (i = cnode->iip + 1; i < UBIFS_LPT_FANOUT; i++) { in next_dirty_cnode()
71 cnode = nnode->nbranch[i].cnode; in next_dirty_cnode()
151 int i, n; in alloc_lpt_leb() local
154 for (i = n; i < c->lpt_lebs; i++) { in alloc_lpt_leb()
155 if (c->ltab[i].tgc || c->ltab[i].cmt) in alloc_lpt_leb()
157 if (c->ltab[i].free == c->leb_size) { in alloc_lpt_leb()
158 c->ltab[i].cmt = 1; in alloc_lpt_leb()
159 *lnum = i + c->lpt_first; in alloc_lpt_leb()
164 for (i = 0; i < n; i++) { in alloc_lpt_leb()
165 if (c->ltab[i].tgc || c->ltab[i].cmt) in alloc_lpt_leb()
167 if (c->ltab[i].free == c->leb_size) { in alloc_lpt_leb()
168 c->ltab[i].cmt = 1; in alloc_lpt_leb()
169 *lnum = i + c->lpt_first; in alloc_lpt_leb()
335 int i, n; in realloc_lpt_leb() local
338 for (i = n; i < c->lpt_lebs; i++) in realloc_lpt_leb()
339 if (c->ltab[i].cmt) { in realloc_lpt_leb()
340 c->ltab[i].cmt = 0; in realloc_lpt_leb()
341 *lnum = i + c->lpt_first; in realloc_lpt_leb()
345 for (i = 0; i < n; i++) in realloc_lpt_leb()
346 if (c->ltab[i].cmt) { in realloc_lpt_leb()
347 c->ltab[i].cmt = 0; in realloc_lpt_leb()
348 *lnum = i + c->lpt_first; in realloc_lpt_leb()
684 int i; in need_write_all() local
686 for (i = 0; i < c->lpt_lebs; i++) { in need_write_all()
687 if (i + c->lpt_first == c->nhead_lnum) in need_write_all()
689 else if (c->ltab[i].free == c->leb_size) in need_write_all()
691 else if (c->ltab[i].free + c->ltab[i].dirty == c->leb_size) in need_write_all()
710 int i; in lpt_tgc_start() local
712 for (i = 0; i < c->lpt_lebs; i++) { in lpt_tgc_start()
713 if (i + c->lpt_first == c->nhead_lnum) in lpt_tgc_start()
715 if (c->ltab[i].dirty > 0 && in lpt_tgc_start()
716 c->ltab[i].free + c->ltab[i].dirty == c->leb_size) { in lpt_tgc_start()
717 c->ltab[i].tgc = 1; in lpt_tgc_start()
718 c->ltab[i].free = c->leb_size; in lpt_tgc_start()
719 c->ltab[i].dirty = 0; in lpt_tgc_start()
720 dbg_lp("LEB %d", i + c->lpt_first); in lpt_tgc_start()
736 int i, err; in lpt_tgc_end() local
738 for (i = 0; i < c->lpt_lebs; i++) in lpt_tgc_end()
739 if (c->ltab[i].tgc) { in lpt_tgc_end()
740 err = ubifs_leb_unmap(c, i + c->lpt_first); in lpt_tgc_end()
743 c->ltab[i].tgc = 0; in lpt_tgc_end()
744 dbg_lp("LEB %d", i + c->lpt_first); in lpt_tgc_end()
765 int i, cnt = 0; in populate_lsave() local
792 for (i = 0; i < heap->cnt; i++) { in populate_lsave()
793 c->lsave[cnt++] = heap->arr[i]->lnum; in populate_lsave()
798 for (i = 0; i < heap->cnt; i++) { in populate_lsave()
799 c->lsave[cnt++] = heap->arr[i]->lnum; in populate_lsave()
804 for (i = 0; i < heap->cnt; i++) { in populate_lsave()
805 c->lsave[cnt++] = heap->arr[i]->lnum; in populate_lsave()
822 static struct ubifs_nnode *nnode_lookup(struct ubifs_info *c, int i) in nnode_lookup() argument
834 iip = i & (UBIFS_LPT_FANOUT - 1); in nnode_lookup()
835 i >>= UBIFS_LPT_FANOUT_SHIFT; in nnode_lookup()
836 if (!i) in nnode_lookup()
1152 int i, lnum = -1, dirty = 0; in lpt_gc() local
1155 for (i = 0; i < c->lpt_lebs; i++) { in lpt_gc()
1156 ubifs_assert(c, !c->ltab[i].tgc); in lpt_gc()
1157 if (i + c->lpt_first == c->nhead_lnum || in lpt_gc()
1158 c->ltab[i].free + c->ltab[i].dirty == c->leb_size) in lpt_gc()
1160 if (c->ltab[i].dirty > dirty) { in lpt_gc()
1161 dirty = c->ltab[i].dirty; in lpt_gc()
1162 lnum = i + c->lpt_first; in lpt_gc()
1342 int h, i, found; in first_nnode() local
1350 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in first_nnode()
1351 if (nnode->nbranch[i].nnode) { in first_nnode()
1353 nnode = nnode->nbranch[i].nnode; in first_nnode()
1377 int iip, h, i, found; in next_nnode() local
1397 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in next_nnode()
1398 if (nnode->nbranch[i].nnode) { in next_nnode()
1400 nnode = nnode->nbranch[i].nnode; in next_nnode()
1419 int i, hght; in ubifs_lpt_free() local
1439 for (i = 0; i < UBIFS_LPT_FANOUT; i++) in ubifs_lpt_free()
1440 kfree(nnode->nbranch[i].nnode); in ubifs_lpt_free()
1443 for (i = 0; i < LPROPS_HEAP_CNT; i++) in ubifs_lpt_free()
1444 kfree(c->lpt_heap[i].arr); in ubifs_lpt_free()
1462 int i; in dbg_is_all_ff() local
1464 for (i = 0; i < len; i++) in dbg_is_all_ff()
1465 if (buf[i] != 0xff) in dbg_is_all_ff()
1513 int i, cnt; in dbg_is_pnode_dirty() local
1516 for (i = 0; i < cnt; i++) { in dbg_is_pnode_dirty()
1521 pnode = ubifs_pnode_lookup(c, i); in dbg_is_pnode_dirty()
1613 int i, pad_len; in dbg_check_ltab_lnum() local
1627 i = lnum - c->lpt_first; in dbg_check_ltab_lnum()
1628 if (len != c->ltab[i].free) { in dbg_check_ltab_lnum()
1630 lnum, len, c->ltab[i].free); in dbg_check_ltab_lnum()
1633 if (dirty != c->ltab[i].dirty) { in dbg_check_ltab_lnum()
1635 lnum, dirty, c->ltab[i].dirty); in dbg_check_ltab_lnum()
1662 int lnum, err, i, cnt; in dbg_check_ltab() local
1669 for (i = 0; i < cnt; i++) { in dbg_check_ltab()
1672 pnode = ubifs_pnode_lookup(c, i); in dbg_check_ltab()
1705 int i; in dbg_chk_lpt_free_spc() local
1710 for (i = 0; i < c->lpt_lebs; i++) { in dbg_chk_lpt_free_spc()
1711 if (c->ltab[i].tgc || c->ltab[i].cmt) in dbg_chk_lpt_free_spc()
1713 if (i + c->lpt_first == c->nhead_lnum) in dbg_chk_lpt_free_spc()
1715 else if (c->ltab[i].free == c->leb_size) in dbg_chk_lpt_free_spc()
1890 int i; in dump_lpt_leb() local
1906 for (i = 0; i < UBIFS_LPT_FANOUT; i++) { in dump_lpt_leb()
1907 pr_cont("%d:%d", nnode.nbranch[i].lnum, in dump_lpt_leb()
1908 nnode.nbranch[i].offs); in dump_lpt_leb()
1909 if (i != UBIFS_LPT_FANOUT - 1) in dump_lpt_leb()
1946 int i; in ubifs_dump_lpt_lebs() local
1949 for (i = 0; i < c->lpt_lebs; i++) in ubifs_dump_lpt_lebs()
1950 dump_lpt_leb(c, i + c->lpt_first); in ubifs_dump_lpt_lebs()
1967 int i; in dbg_populate_lsave() local
1974 for (i = 0; i < c->lsave_cnt; i++) in dbg_populate_lsave()
1975 c->lsave[i] = c->main_first; in dbg_populate_lsave()
1985 for (i = 0; i < heap->cnt; i++) in dbg_populate_lsave()
1986 c->lsave[get_random_u32_below(c->lsave_cnt)] = heap->arr[i]->lnum; in dbg_populate_lsave()
1988 for (i = 0; i < heap->cnt; i++) in dbg_populate_lsave()
1989 c->lsave[get_random_u32_below(c->lsave_cnt)] = heap->arr[i]->lnum; in dbg_populate_lsave()
1991 for (i = 0; i < heap->cnt; i++) in dbg_populate_lsave()
1992 c->lsave[get_random_u32_below(c->lsave_cnt)] = heap->arr[i]->lnum; in dbg_populate_lsave()