| /fs/ubifs/ |
| D | log.c | 42 struct ubifs_bud *ubifs_search_bud(struct ubifs_info *c, int lnum) in ubifs_search_bud() argument
51 if (lnum < bud->lnum) in ubifs_search_bud()
53 else if (lnum > bud->lnum) in ubifs_search_bud()
71 struct ubifs_wbuf *ubifs_get_wbuf(struct ubifs_info *c, int lnum) in ubifs_get_wbuf() argument
84 if (lnum < bud->lnum) in ubifs_get_wbuf()
86 else if (lnum > bud->lnum) in ubifs_get_wbuf()
135 ubifs_assert(bud->lnum != b->lnum); in ubifs_add_bud()
136 if (bud->lnum < b->lnum) in ubifs_add_bud()
158 dbg_log("LEB %d:%d, jhead %s, bud_bytes %lld", bud->lnum, in ubifs_add_bud()
176 int ubifs_add_bud_to_log(struct ubifs_info *c, int jhead, int lnum, int offs) in ubifs_add_bud_to_log() argument
[all …]
|
| D | tnc_commit.c | 38 struct ubifs_znode *znode, int lnum, int offs, int len) in make_idx_node() argument
52 br->lnum = cpu_to_le32(zbr->lnum); in make_idx_node()
55 if (!zbr->lnum || !zbr->len) { in make_idx_node()
64 znode->lnum = lnum; in make_idx_node()
76 zbr->lnum = lnum; in make_idx_node()
80 c->zroot.lnum = lnum; in make_idx_node()
111 static int fill_gap(struct ubifs_info *c, int lnum, int gap_start, int gap_end, in fill_gap() argument
134 lnum, gap_pos, len); in fill_gap()
154 lnum, gap_start, gap_end, gap_end - gap_start, written, pad_len); in fill_gap()
168 static int find_old_idx(struct ubifs_info *c, int lnum, int offs) in find_old_idx() argument
[all …]
|
| D | lpt_commit.c | 139 static void upd_ltab(struct ubifs_info *c, int lnum, int free, int dirty) in upd_ltab() argument
142 lnum, c->ltab[lnum - c->lpt_first].free, in upd_ltab()
143 c->ltab[lnum - c->lpt_first].dirty, free, dirty); in upd_ltab()
144 ubifs_assert(lnum >= c->lpt_first && lnum <= c->lpt_last); in upd_ltab()
145 c->ltab[lnum - c->lpt_first].free = free; in upd_ltab()
146 c->ltab[lnum - c->lpt_first].dirty += dirty; in upd_ltab()
159 static int alloc_lpt_leb(struct ubifs_info *c, int *lnum) in alloc_lpt_leb() argument
163 n = *lnum - c->lpt_first + 1; in alloc_lpt_leb()
169 *lnum = i + c->lpt_first; in alloc_lpt_leb()
179 *lnum = i + c->lpt_first; in alloc_lpt_leb()
[all …]
|
| D | find.c | 42 int lnum; member
121 data->lnum = lprops->lnum; in scan_for_dirty_cb()
179 data.lnum = -1; in scan_for_dirty()
186 ubifs_assert(data.lnum >= c->main_first && data.lnum < c->leb_cnt); in scan_for_dirty()
187 c->lscan_lnum = data.lnum; in scan_for_dirty()
188 lprops = ubifs_lpt_lookup_dirty(c, data.lnum); in scan_for_dirty()
191 ubifs_assert(lprops->lnum == data.lnum); in scan_for_dirty()
334 lp->lnum, lp->free, lp->dirty, lp->flags); in ubifs_find_dirty_leb()
392 data->lnum = lprops->lnum; in scan_for_free_cb()
459 data.lnum = -1; in do_find_free_space()
[all …]
|
| D | io.c | 99 int ubifs_leb_read(const struct ubifs_info *c, int lnum, void *buf, int offs, in ubifs_leb_read() argument
104 err = ubi_read(c->ubi, lnum, buf, offs, len); in ubifs_leb_read()
111 len, lnum, offs, err); in ubifs_leb_read()
117 int ubifs_leb_write(struct ubifs_info *c, int lnum, const void *buf, int offs, in ubifs_leb_write() argument
126 err = ubi_leb_write(c->ubi, lnum, buf, offs, len); in ubifs_leb_write()
128 err = dbg_leb_write(c, lnum, buf, offs, len); in ubifs_leb_write()
131 len, lnum, offs, err); in ubifs_leb_write()
138 int ubifs_leb_change(struct ubifs_info *c, int lnum, const void *buf, int len) in ubifs_leb_change() argument
146 err = ubi_leb_change(c->ubi, lnum, buf, len); in ubifs_leb_change()
148 err = dbg_leb_change(c, lnum, buf, len); in ubifs_leb_change()
[all …]
|
| D | scan.c | 69 int ubifs_scan_a_node(const struct ubifs_info *c, void *buf, int len, int lnum, in ubifs_scan_a_node() argument
78 dbg_scan("hit empty space at LEB %d:%d", lnum, offs); in ubifs_scan_a_node()
89 dbg_ntype(ch->node_type), lnum, offs); in ubifs_scan_a_node()
91 if (ubifs_check_node(c, buf, lnum, offs, quiet, 1)) in ubifs_scan_a_node()
104 lnum, offs); in ubifs_scan_a_node()
119 lnum, offs, ALIGN(offs + node_len + pad_len, 8)); in ubifs_scan_a_node()
137 struct ubifs_scan_leb *ubifs_start_scan(const struct ubifs_info *c, int lnum, in ubifs_start_scan() argument
143 dbg_scan("scan LEB %d:%d", lnum, offs); in ubifs_start_scan()
149 sleb->lnum = lnum; in ubifs_start_scan()
153 err = ubifs_leb_read(c, lnum, sbuf + offs, offs, c->leb_size - offs, 0); in ubifs_start_scan()
[all …]
|
| D | recovery.c | 109 static int get_master_node(const struct ubifs_info *c, int lnum, void **pbuf, in get_master_node() argument
120 err = ubifs_leb_read(c, lnum, sbuf, 0, c->leb_size, 0); in get_master_node()
144 ret = ubifs_scan_a_node(c, buf, len, lnum, offs, 1); in get_master_node()
150 ret = ubifs_scan_a_node(c, buf, len, lnum, offs, 1); in get_master_node()
164 dbg_rcvry("found a master node at %d:%d", lnum, offs); in get_master_node()
175 dbg_rcvry("found corruption at %d:%d", lnum, offs); in get_master_node()
207 int err = 0, lnum = UBIFS_MST_LNUM, sz = c->mst_node_alsz; in write_rcvrd_mst_node() local
216 err = ubifs_leb_change(c, lnum, mst, sz); in write_rcvrd_mst_node()
219 err = ubifs_leb_change(c, lnum + 1, mst, sz); in write_rcvrd_mst_node()
440 static void clean_buf(const struct ubifs_info *c, void **buf, int lnum, in clean_buf() argument
[all …]
|
| D | replay.c | 56 int lnum; member
104 lp = ubifs_lpt_lookup_dirty(c, b->bud->lnum); in set_bud_lprops()
131 dbg_mnt("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum, in set_bud_lprops()
133 dbg_gc("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum, in set_bud_lprops()
145 b->bud->lnum, lp->free, lp->dirty, b->free, in set_bud_lprops()
157 b->bud->lnum, c->leb_size - b->free); in set_bud_lprops()
224 r->lnum, r->offs, r->len, r->deletion, r->sqnum); in apply_replay_entry()
233 err = ubifs_tnc_add_nm(c, &r->key, r->lnum, r->offs, in apply_replay_entry()
253 err = ubifs_tnc_add(c, &r->key, r->lnum, r->offs, in apply_replay_entry()
356 static int insert_node(struct ubifs_info *c, int lnum, int offs, int len, in insert_node() argument
[all …]
|
| D | gc.c | 88 wbuf->lnum, wbuf->offs + wbuf->used, gc_lnum, in switch_gc_head()
274 err = ubifs_tnc_has_node(c, &snod->key, 0, sleb->lnum, in sort_nodes()
320 int err, new_lnum = wbuf->lnum, new_offs = wbuf->offs + wbuf->used; in move_node()
327 err = ubifs_tnc_replace(c, &snod->key, sleb->lnum, in move_node()
351 if (wbuf->lnum == -1) { in move_nodes()
470 int err = 0, lnum = lp->lnum; in ubifs_garbage_collect_leb() local
474 ubifs_assert(c->gc_lnum != lnum); in ubifs_garbage_collect_leb()
475 ubifs_assert(wbuf->lnum != lnum); in ubifs_garbage_collect_leb()
479 dbg_gc("LEB %d is free, return it", lp->lnum); in ubifs_garbage_collect_leb()
491 err = ubifs_change_one_lp(c, lp->lnum, c->leb_size, in ubifs_garbage_collect_leb()
[all …]
|
| D | tnc.c | 38 int len, int lnum, int offs);
82 static int insert_old_idx(struct ubifs_info *c, int lnum, int offs) in insert_old_idx() argument
90 old_idx->lnum = lnum; in insert_old_idx()
97 if (lnum < o->lnum) in insert_old_idx()
99 else if (lnum > o->lnum) in insert_old_idx()
130 return insert_old_idx(c, zbr->lnum, zbr->offs); in insert_old_idx_znode()
133 return insert_old_idx(c, c->zroot.lnum, in insert_old_idx_znode()
155 err = insert_old_idx(c, zbr->lnum, zbr->offs); in ins_clr_old_idx_znode()
158 zbr->lnum = 0; in ins_clr_old_idx_znode()
164 err = insert_old_idx(c, c->zroot.lnum, c->zroot.offs); in ins_clr_old_idx_znode()
[all …]
|
| D | lpt.c | 394 int lnum = nnode->nbranch[i].lnum; in ubifs_pack_nnode() local
396 if (lnum == 0) in ubifs_pack_nnode()
397 lnum = c->lpt_last + 1; in ubifs_pack_nnode()
398 pack_bits(&addr, &pos, lnum - c->lpt_first, c->lpt_lnum_bits); in ubifs_pack_nnode()
462 void ubifs_add_lpt_dirt(struct ubifs_info *c, int lnum, int dirty) in ubifs_add_lpt_dirt() argument
464 if (!dirty || !lnum) in ubifs_add_lpt_dirt()
467 lnum, dirty, c->ltab[lnum - c->lpt_first].dirty); in ubifs_add_lpt_dirt()
468 ubifs_assert(lnum >= c->lpt_first && lnum <= c->lpt_last); in ubifs_add_lpt_dirt()
469 c->ltab[lnum - c->lpt_first].dirty += dirty; in ubifs_add_lpt_dirt()
479 static void set_ltab(struct ubifs_info *c, int lnum, int free, int dirty) in set_ltab() argument
[all …]
|
| D | ubifs.h | 262 int lnum; member
303 int lnum; member
322 int lnum; member
417 int lnum; member
463 int lnum; member
570 int lnum; member
670 int lnum; member
676 int (*sync_callback)(struct ubifs_info *c, int lnum, int free, int pad);
697 int lnum; member
732 int lnum; member
[all …]
|
| D | journal.c | 117 int err = 0, err1, retries = 0, avail, lnum, offs, squeeze; in reserve_space() local
136 if (wbuf->lnum != -1 && avail >= len) in reserve_space()
143 lnum = ubifs_find_free_space(c, len, &offs, squeeze); in reserve_space()
144 if (lnum >= 0) in reserve_space()
147 err = lnum; in reserve_space()
159 lnum = ubifs_garbage_collect(c, 0); in reserve_space()
160 if (lnum < 0) { in reserve_space()
161 err = lnum; in reserve_space()
183 dbg_jnl("got LEB %d for jhead %s", lnum, dbg_jhead(jhead)); in reserve_space()
186 if (wbuf->lnum != -1 && avail >= len) { in reserve_space()
[all …]
|
| D | sb.c | 280 br->lnum = cpu_to_le32(main_first + DEFAULT_DATA_LEB); in create_default_filesystem()
669 static int fixup_leb(struct ubifs_info *c, int lnum, int len) in fixup_leb() argument
678 dbg_mnt("unmap empty LEB %d", lnum); in fixup_leb()
679 return ubifs_leb_unmap(c, lnum); in fixup_leb()
682 dbg_mnt("fixup LEB %d, data len %d", lnum, len); in fixup_leb()
683 err = ubifs_leb_read(c, lnum, c->sbuf, 0, len, 1); in fixup_leb()
687 return ubifs_leb_change(c, lnum, c->sbuf, len); in fixup_leb()
699 int lnum, err = 0; in fixup_free_space() local
705 for (lnum = UBIFS_MST_LNUM; lnum < UBIFS_LOG_LNUM; lnum++) { in fixup_free_space()
706 err = fixup_leb(c, lnum, c->mst_offs + c->mst_node_alsz); in fixup_free_space()
[all …]
|
| D | debug.c | 410 pr_err("\tlnum %u\n", le32_to_cpu(ref->lnum)); in ubifs_dump_node()
516 i, le32_to_cpu(br->lnum), le32_to_cpu(br->offs), in ubifs_dump_node()
621 c->jheads[i].wbuf.lnum); in ubifs_dump_budg()
624 pr_err("\tbud LEB %d\n", bud->lnum); in ubifs_dump_budg()
627 pr_err("\told bud LEB %d\n", bud->lnum); in ubifs_dump_budg()
630 idx_gc->lnum, idx_gc->unmap); in ubifs_dump_budg()
659 lp->lnum, lp->free, lp->dirty, c->leb_size - spc, spc, in ubifs_dump_lprop()
663 lp->lnum, lp->free, lp->dirty, c->leb_size - spc, spc, in ubifs_dump_lprop()
712 if (bud->lnum == lp->lnum) { in ubifs_dump_lprop()
721 lp->lnum == c->jheads[i].wbuf.lnum) { in ubifs_dump_lprop()
[all …]
|
| D | misc.h | 171 static inline int ubifs_add_dirt(struct ubifs_info *c, int lnum, int dirty) in ubifs_add_dirt() argument
173 return ubifs_update_one_lp(c, lnum, LPROPS_NC, dirty, 0, 0); in ubifs_add_dirt()
185 static inline int ubifs_return_leb(struct ubifs_info *c, int lnum) in ubifs_return_leb() argument
187 return ubifs_change_one_lp(c, lnum, LPROPS_NC, LPROPS_NC, 0, in ubifs_return_leb()
289 static inline int ubifs_next_log_lnum(const struct ubifs_info *c, int lnum) in ubifs_next_log_lnum() argument
291 lnum += 1; in ubifs_next_log_lnum()
292 if (lnum > c->log_last) in ubifs_next_log_lnum()
293 lnum = UBIFS_LOG_LNUM; in ubifs_next_log_lnum()
295 return lnum; in ubifs_next_log_lnum()
|
| D | orphan.c | 346 int lnum; in write_orph_nodes() local
349 for (lnum = c->ohead_lnum + 1; lnum <= c->orph_last; lnum++) { in write_orph_nodes()
350 err = ubifs_leb_unmap(c, lnum); in write_orph_nodes()
491 int lnum, err; in ubifs_clear_orphans() local
493 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) { in ubifs_clear_orphans()
494 err = ubifs_leb_unmap(c, lnum); in ubifs_clear_orphans()
573 snod->type, sleb->lnum, snod->offs); in do_kill_orphans()
600 cmt_no, sleb->lnum, snod->offs); in do_kill_orphans()
604 dbg_rcvry("out of date LEB %d", sleb->lnum); in do_kill_orphans()
628 cmt_no, sleb->lnum, snod->offs); in do_kill_orphans()
[all …]
|
| D | lprops.c | 509 pos = (lprops->lnum - c->main_first) & (UBIFS_LPT_FANOUT - 1); in is_lprops_dirty()
546 lprops->lnum, free, dirty, flags); in ubifs_change_lp()
562 lprops = ubifs_lpt_lookup_dirty(c, lprops->lnum); in ubifs_change_lp()
566 ubifs_assert(lprops == ubifs_lpt_lookup_dirty(c, lprops->lnum)); in ubifs_change_lp()
663 int ubifs_change_one_lp(struct ubifs_info *c, int lnum, int free, int dirty, in ubifs_change_one_lp() argument
671 lp = ubifs_lpt_lookup_dirty(c, lnum); in ubifs_change_one_lp()
686 lnum, err); in ubifs_change_one_lp()
702 int ubifs_update_one_lp(struct ubifs_info *c, int lnum, int free, int dirty, in ubifs_update_one_lp() argument
710 lp = ubifs_lpt_lookup_dirty(c, lnum); in ubifs_update_one_lp()
725 lnum, err); in ubifs_update_one_lp()
[all …]
|
| D | master.c | 40 int lnum, offs = 0, nodes_cnt; in scan_for_master() local
42 lnum = UBIFS_MST_LNUM; in scan_for_master()
44 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1); in scan_for_master()
58 lnum += 1; in scan_for_master()
60 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1); in scan_for_master()
86 snod->type, lnum, snod->offs); in scan_for_master()
126 if (c->zroot.lnum >= c->leb_cnt || c->zroot.lnum < c->main_first || in validate_master()
282 c->zroot.lnum = le32_to_cpu(c->mst_node->root_lnum); in ubifs_read_master()
361 int err, lnum, offs, len; in ubifs_write_master() local
367 lnum = UBIFS_MST_LNUM; in ubifs_write_master()
[all …]
|
| D | tnc_misc.c | 273 static int read_znode(struct ubifs_info *c, int lnum, int offs, int len, in read_znode() argument
283 err = ubifs_read_node(c, idx, UBIFS_IDX_NODE, len, lnum, offs); in read_znode()
293 lnum, offs, znode->level, znode->child_cnt); in read_znode()
309 zbr->lnum = le32_to_cpu(br->lnum); in read_znode()
316 if (zbr->lnum < c->main_first || in read_znode()
317 zbr->lnum >= c->leb_cnt || zbr->offs < 0 || in read_znode()
389 ubifs_err(c, "bad indexing node at LEB %d:%d, error %d", lnum, offs, err); in read_znode()
422 err = read_znode(c, zbr->lnum, zbr->offs, zbr->len, znode); in ubifs_load_znode()
469 wbuf = ubifs_get_wbuf(c, zbr->lnum); in ubifs_tnc_read_node()
472 zbr->lnum, zbr->offs); in ubifs_tnc_read_node()
[all …]
|
| D | commit.c | 175 c->mst_node->root_lnum = cpu_to_le32(zroot.lnum); in do_commit()
529 int lnum, offs, len, err = 0; in dbg_old_index_check_init() local
533 lnum = d->old_zroot.lnum; in dbg_old_index_check_init()
541 err = ubifs_read_node(c, idx, UBIFS_IDX_NODE, len, lnum, offs); in dbg_old_index_check_init()
567 int lnum, offs, len, err = 0, uninitialized_var(last_level), child_cnt; in dbg_check_old_index() local
586 lnum = d->old_zroot.lnum; in dbg_check_old_index()
609 err = ubifs_read_node(c, idx, UBIFS_IDX_NODE, len, lnum, offs); in dbg_check_old_index()
697 lnum = le32_to_cpu(br->lnum); in dbg_check_old_index()
|
| D | debug.h | 263 void ubifs_dump_leb(const struct ubifs_info *c, int lnum);
303 int dbg_leb_write(struct ubifs_info *c, int lnum, const void *buf, int offs,
305 int dbg_leb_change(struct ubifs_info *c, int lnum, const void *buf, int len);
306 int dbg_leb_unmap(struct ubifs_info *c, int lnum);
307 int dbg_leb_map(struct ubifs_info *c, int lnum);
|
| /fs/reiserfs/ |
| D | ibalance.c | 655 if (tb->lnum[h] == 0 && tb->rnum[h] == 0) { in balance_internal_when_delete()
697 if (tb->L[h] && tb->lnum[h] == -B_NR_ITEMS(tb->L[h]) - 1) { in balance_internal_when_delete()
711 RFALSE(tb->lnum[h] != 0, in balance_internal_when_delete()
713 h, tb->lnum[h]); in balance_internal_when_delete()
722 if (tb->lnum[h] < 0) { in balance_internal_when_delete()
727 -tb->lnum[h]); in balance_internal_when_delete()
733 RFALSE(tb->lnum[h] != 0, in balance_internal_when_delete()
735 h, tb->lnum[h]); in balance_internal_when_delete()
741 if (tb->lnum[h] > 0) { in balance_internal_when_delete()
742 RFALSE(tb->rnum[h] == 0 || tb->lnum[h] + tb->rnum[h] != n + 1, in balance_internal_when_delete()
[all …]
|
| D | fix_node.c | 205 tb->lnum[h] = cur_free / (DC_SIZE + KEY_SIZE); in check_left()
213 tb->lnum[h] = 0; in check_left()
230 tb->lnum[0] = vn->vn_nr_item; in check_left()
241 tb->lnum[0] = 0; in check_left()
248 tb->lnum[0]++; in check_left()
268 tb->lnum[0]++; in check_left()
623 static void set_parameters(struct tree_balance *tb, int h, int lnum, in set_parameters() argument
627 tb->lnum[h] = lnum; in set_parameters()
643 PROC_INFO_ADD(tb->tb_sb, lnum[h], lnum); in set_parameters()
665 to_left = tb->lnum[0] - ((tb->lbytes != -1) ? 1 : 0); in is_leaf_removable()
[all …]
|
| D | do_balan.c | 152 if (tb->lnum[0] == -1) { in balance_leaf_when_delete_left()
206 RFALSE((tb->lnum[0] + tb->rnum[0] < n) || in balance_leaf_when_delete_left()
207 (tb->lnum[0] + tb->rnum[0] > n + 1), in balance_leaf_when_delete_left()
210 tb->rnum[0], tb->lnum[0], n); in balance_leaf_when_delete_left()
211 RFALSE((tb->lnum[0] + tb->rnum[0] == n) && in balance_leaf_when_delete_left()
216 RFALSE((tb->lnum[0] + tb->rnum[0] == n + 1) && in balance_leaf_when_delete_left()
222 leaf_shift_left(tb, tb->lnum[0], tb->lbytes); in balance_leaf_when_delete_left()
274 if (tb->lnum[0]) in balance_leaf_when_delete()
298 if (tb->item_pos == tb->lnum[0] - 1 && tb->lbytes != -1) { in balance_leaf_insert_left()
303 ret = leaf_shift_left(tb, tb->lnum[0] - 1, -1); in balance_leaf_insert_left()
[all …]
|