Home
last modified time | relevance | path

Searched refs:lnum (Results 1 – 25 of 92) sorted by relevance

1234

/OK3568_Linux_fs/kernel/drivers/mtd/ubi/
H A Deba.c107 void ubi_eba_get_ldesc(struct ubi_volume *vol, int lnum, in ubi_eba_get_ldesc() argument
110 ldesc->lnum = lnum; in ubi_eba_get_ldesc()
111 ldesc->pnum = vol->eba_tbl->entries[lnum].pnum; in ubi_eba_get_ldesc()
212 int lnum) in ltree_lookup() argument
227 if (lnum < le->lnum) in ltree_lookup()
229 else if (lnum > le->lnum) in ltree_lookup()
251 int vol_id, int lnum) in ltree_add_entry() argument
262 le->lnum = lnum; in ltree_add_entry()
265 le1 = ltree_lookup(ubi, vol_id, lnum); in ltree_add_entry()
293 ubi_assert(lnum != le1->lnum); in ltree_add_entry()
[all …]
H A Dkapi.c368 static int leb_read_sanity_check(struct ubi_volume_desc *desc, int lnum, in leb_read_sanity_check() argument
375 if (vol_id < 0 || vol_id >= ubi->vtbl_slots || lnum < 0 || in leb_read_sanity_check()
376 lnum >= vol->used_ebs || offset < 0 || len < 0 || in leb_read_sanity_check()
384 if (lnum == vol->used_ebs - 1 && in leb_read_sanity_check()
422 int ubi_leb_read(struct ubi_volume_desc *desc, int lnum, char *buf, int offset, in ubi_leb_read() argument
429 dbg_gen("read %d bytes from LEB %d:%d:%d", len, vol_id, lnum, offset); in ubi_leb_read()
431 err = leb_read_sanity_check(desc, lnum, offset, len); in ubi_leb_read()
438 err = ubi_eba_read_leb(ubi, vol, lnum, buf, offset, len, check); in ubi_leb_read()
462 int ubi_leb_read_sg(struct ubi_volume_desc *desc, int lnum, struct ubi_sgl *sgl, in ubi_leb_read_sg() argument
469 dbg_gen("read %d bytes from LEB %d:%d:%d", len, vol_id, lnum, offset); in ubi_leb_read_sg()
[all …]
/OK3568_Linux_fs/u-boot/drivers/mtd/ubi/
H A Deba.c90 int lnum) in ltree_lookup() argument
105 if (lnum < le->lnum) in ltree_lookup()
107 else if (lnum > le->lnum) in ltree_lookup()
129 int vol_id, int lnum) in ltree_add_entry() argument
140 le->lnum = lnum; in ltree_add_entry()
143 le1 = ltree_lookup(ubi, vol_id, lnum); in ltree_add_entry()
171 ubi_assert(lnum != le1->lnum); in ltree_add_entry()
172 if (lnum < le1->lnum) in ltree_add_entry()
198 static int leb_read_lock(struct ubi_device *ubi, int vol_id, int lnum) in leb_read_lock() argument
202 le = ltree_add_entry(ubi, vol_id, lnum); in leb_read_lock()
[all …]
H A Dkapi.c375 static int leb_read_sanity_check(struct ubi_volume_desc *desc, int lnum, in leb_read_sanity_check() argument
382 if (vol_id < 0 || vol_id >= ubi->vtbl_slots || lnum < 0 || in leb_read_sanity_check()
383 lnum >= vol->used_ebs || offset < 0 || len < 0 || in leb_read_sanity_check()
391 if (lnum == vol->used_ebs - 1 && in leb_read_sanity_check()
429 int ubi_leb_read(struct ubi_volume_desc *desc, int lnum, char *buf, int offset, in ubi_leb_read() argument
436 dbg_gen("read %d bytes from LEB %d:%d:%d", len, vol_id, lnum, offset); in ubi_leb_read()
438 err = leb_read_sanity_check(desc, lnum, offset, len); in ubi_leb_read()
445 err = ubi_eba_read_leb(ubi, vol, lnum, buf, offset, len, check); in ubi_leb_read()
469 int ubi_leb_read_sg(struct ubi_volume_desc *desc, int lnum, struct ubi_sgl *sgl, in ubi_leb_read_sg() argument
476 dbg_gen("read %d bytes from LEB %d:%d:%d", len, vol_id, lnum, offset); in ubi_leb_read_sg()
[all …]
/OK3568_Linux_fs/u-boot/fs/ubifs/
H A Dlog.c34 struct ubifs_bud *ubifs_search_bud(struct ubifs_info *c, int lnum) in ubifs_search_bud() argument
43 if (lnum < bud->lnum) in ubifs_search_bud()
45 else if (lnum > bud->lnum) in ubifs_search_bud()
63 struct ubifs_wbuf *ubifs_get_wbuf(struct ubifs_info *c, int lnum) in ubifs_get_wbuf() argument
76 if (lnum < bud->lnum) in ubifs_get_wbuf()
78 else if (lnum > bud->lnum) in ubifs_get_wbuf()
127 ubifs_assert(bud->lnum != b->lnum); in ubifs_add_bud()
128 if (bud->lnum < b->lnum) in ubifs_add_bud()
150 dbg_log("LEB %d:%d, jhead %s, bud_bytes %lld", bud->lnum, in ubifs_add_bud()
168 int ubifs_add_bud_to_log(struct ubifs_info *c, int jhead, int lnum, int offs) in ubifs_add_bud_to_log() argument
[all …]
H A Dlpt_commit.c137 static void upd_ltab(struct ubifs_info *c, int lnum, int free, int dirty) in upd_ltab() argument
140 lnum, c->ltab[lnum - c->lpt_first].free, in upd_ltab()
141 c->ltab[lnum - c->lpt_first].dirty, free, dirty); in upd_ltab()
142 ubifs_assert(lnum >= c->lpt_first && lnum <= c->lpt_last); in upd_ltab()
143 c->ltab[lnum - c->lpt_first].free = free; in upd_ltab()
144 c->ltab[lnum - c->lpt_first].dirty += dirty; in upd_ltab()
157 static int alloc_lpt_leb(struct ubifs_info *c, int *lnum) in alloc_lpt_leb() argument
161 n = *lnum - c->lpt_first + 1; in alloc_lpt_leb()
167 *lnum = i + c->lpt_first; in alloc_lpt_leb()
177 *lnum = i + c->lpt_first; in alloc_lpt_leb()
[all …]
H A Dscan.c62 int ubifs_scan_a_node(const struct ubifs_info *c, void *buf, int len, int lnum, in ubifs_scan_a_node() argument
71 dbg_scan("hit empty space at LEB %d:%d", lnum, offs); in ubifs_scan_a_node()
82 dbg_ntype(ch->node_type), lnum, offs); in ubifs_scan_a_node()
84 if (ubifs_check_node(c, buf, lnum, offs, quiet, 1)) in ubifs_scan_a_node()
97 lnum, offs); in ubifs_scan_a_node()
112 lnum, offs, ALIGN(offs + node_len + pad_len, 8)); in ubifs_scan_a_node()
130 struct ubifs_scan_leb *ubifs_start_scan(const struct ubifs_info *c, int lnum, in ubifs_start_scan() argument
136 dbg_scan("scan LEB %d:%d", lnum, offs); in ubifs_start_scan()
142 sleb->lnum = lnum; in ubifs_start_scan()
146 err = ubifs_leb_read(c, lnum, sbuf + offs, offs, c->leb_size - offs, 0); in ubifs_start_scan()
[all …]
H A Drecovery.c102 static int get_master_node(const struct ubifs_info *c, int lnum, void **pbuf, in get_master_node() argument
113 err = ubifs_leb_read(c, lnum, sbuf, 0, c->leb_size, 0); in get_master_node()
137 ret = ubifs_scan_a_node(c, buf, len, lnum, offs, 1); in get_master_node()
143 ret = ubifs_scan_a_node(c, buf, len, lnum, offs, 1); in get_master_node()
157 dbg_rcvry("found a master node at %d:%d", lnum, offs); in get_master_node()
168 dbg_rcvry("found corruption at %d:%d", lnum, offs); in get_master_node()
200 int err = 0, lnum = UBIFS_MST_LNUM, sz = c->mst_node_alsz; in write_rcvrd_mst_node() local
209 err = ubifs_leb_change(c, lnum, mst, sz); in write_rcvrd_mst_node()
212 err = ubifs_leb_change(c, lnum + 1, mst, sz); in write_rcvrd_mst_node()
435 static void clean_buf(const struct ubifs_info *c, void **buf, int lnum, in clean_buf() argument
[all …]
H A Dreplay.c50 int lnum; member
98 lp = ubifs_lpt_lookup_dirty(c, b->bud->lnum); in set_bud_lprops()
125 dbg_mnt("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum, in set_bud_lprops()
127 dbg_gc("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum, in set_bud_lprops()
139 b->bud->lnum, lp->free, lp->dirty, b->free, in set_bud_lprops()
151 b->bud->lnum, c->leb_size - b->free); in set_bud_lprops()
218 r->lnum, r->offs, r->len, r->deletion, r->sqnum); in apply_replay_entry()
227 err = ubifs_tnc_add_nm(c, &r->key, r->lnum, r->offs, in apply_replay_entry()
247 err = ubifs_tnc_add(c, &r->key, r->lnum, r->offs, in apply_replay_entry()
350 static int insert_node(struct ubifs_info *c, int lnum, int offs, int len, in insert_node() argument
[all …]
H A Dio.c93 int ubifs_leb_read(const struct ubifs_info *c, int lnum, void *buf, int offs, in ubifs_leb_read() argument
98 err = ubi_read(c->ubi, lnum, buf, offs, len); in ubifs_leb_read()
105 len, lnum, offs, err); in ubifs_leb_read()
111 int ubifs_leb_write(struct ubifs_info *c, int lnum, const void *buf, int offs, in ubifs_leb_write() argument
120 err = ubi_leb_write(c->ubi, lnum, buf, offs, len); in ubifs_leb_write()
123 err = dbg_leb_write(c, lnum, buf, offs, len); in ubifs_leb_write()
127 len, lnum, offs, err); in ubifs_leb_write()
134 int ubifs_leb_change(struct ubifs_info *c, int lnum, const void *buf, int len) in ubifs_leb_change() argument
142 err = ubi_leb_change(c->ubi, lnum, buf, len); in ubifs_leb_change()
145 err = dbg_leb_change(c, lnum, buf, len); in ubifs_leb_change()
[all …]
H A Dgc.c79 wbuf->lnum, wbuf->offs + wbuf->used, gc_lnum, in switch_gc_head()
269 err = ubifs_tnc_has_node(c, &snod->key, 0, sleb->lnum, in sort_nodes()
315 int err, new_lnum = wbuf->lnum, new_offs = wbuf->offs + wbuf->used; in move_node()
322 err = ubifs_tnc_replace(c, &snod->key, sleb->lnum, in move_node()
346 if (wbuf->lnum == -1) { in move_nodes()
465 int err = 0, lnum = lp->lnum; in ubifs_garbage_collect_leb() local
469 ubifs_assert(c->gc_lnum != lnum); in ubifs_garbage_collect_leb()
470 ubifs_assert(wbuf->lnum != lnum); in ubifs_garbage_collect_leb()
474 dbg_gc("LEB %d is free, return it", lp->lnum); in ubifs_garbage_collect_leb()
486 err = ubifs_change_one_lp(c, lp->lnum, c->leb_size, in ubifs_garbage_collect_leb()
[all …]
H A Dtnc.c50 int len, int lnum, int offs);
77 static int insert_old_idx(struct ubifs_info *c, int lnum, int offs) in insert_old_idx() argument
85 old_idx->lnum = lnum; in insert_old_idx()
92 if (lnum < o->lnum) in insert_old_idx()
94 else if (lnum > o->lnum) in insert_old_idx()
125 return insert_old_idx(c, zbr->lnum, zbr->offs); in insert_old_idx_znode()
128 return insert_old_idx(c, c->zroot.lnum, in insert_old_idx_znode()
150 err = insert_old_idx(c, zbr->lnum, zbr->offs); in ins_clr_old_idx_znode()
153 zbr->lnum = 0; in ins_clr_old_idx_znode()
159 err = insert_old_idx(c, c->zroot.lnum, c->zroot.offs); in ins_clr_old_idx_znode()
[all …]
H A Dlpt.c390 int lnum = nnode->nbranch[i].lnum; in ubifs_pack_nnode() local
392 if (lnum == 0) in ubifs_pack_nnode()
393 lnum = c->lpt_last + 1; in ubifs_pack_nnode()
394 pack_bits(&addr, &pos, lnum - c->lpt_first, c->lpt_lnum_bits); in ubifs_pack_nnode()
458 void ubifs_add_lpt_dirt(struct ubifs_info *c, int lnum, int dirty) in ubifs_add_lpt_dirt() argument
460 if (!dirty || !lnum) in ubifs_add_lpt_dirt()
463 lnum, dirty, c->ltab[lnum - c->lpt_first].dirty); in ubifs_add_lpt_dirt()
464 ubifs_assert(lnum >= c->lpt_first && lnum <= c->lpt_last); in ubifs_add_lpt_dirt()
465 c->ltab[lnum - c->lpt_first].dirty += dirty; in ubifs_add_lpt_dirt()
475 static void set_ltab(struct ubifs_info *c, int lnum, int free, int dirty) in set_ltab() argument
[all …]
/OK3568_Linux_fs/kernel/fs/ubifs/
H A Dlog.c30 struct ubifs_bud *ubifs_search_bud(struct ubifs_info *c, int lnum) in ubifs_search_bud() argument
39 if (lnum < bud->lnum) in ubifs_search_bud()
41 else if (lnum > bud->lnum) in ubifs_search_bud()
59 struct ubifs_wbuf *ubifs_get_wbuf(struct ubifs_info *c, int lnum) in ubifs_get_wbuf() argument
72 if (lnum < bud->lnum) in ubifs_get_wbuf()
74 else if (lnum > bud->lnum) in ubifs_get_wbuf()
123 ubifs_assert(c, bud->lnum != b->lnum); in ubifs_add_bud()
124 if (bud->lnum < b->lnum) in ubifs_add_bud()
146 dbg_log("LEB %d:%d, jhead %s, bud_bytes %lld", bud->lnum, in ubifs_add_bud()
164 int ubifs_add_bud_to_log(struct ubifs_info *c, int jhead, int lnum, int offs) in ubifs_add_bud_to_log() argument
[all …]
H A Dlpt_commit.c129 static void upd_ltab(struct ubifs_info *c, int lnum, int free, int dirty) in upd_ltab() argument
132 lnum, c->ltab[lnum - c->lpt_first].free, in upd_ltab()
133 c->ltab[lnum - c->lpt_first].dirty, free, dirty); in upd_ltab()
134 ubifs_assert(c, lnum >= c->lpt_first && lnum <= c->lpt_last); in upd_ltab()
135 c->ltab[lnum - c->lpt_first].free = free; in upd_ltab()
136 c->ltab[lnum - c->lpt_first].dirty += dirty; in upd_ltab()
149 static int alloc_lpt_leb(struct ubifs_info *c, int *lnum) in alloc_lpt_leb() argument
153 n = *lnum - c->lpt_first + 1; in alloc_lpt_leb()
159 *lnum = i + c->lpt_first; in alloc_lpt_leb()
169 *lnum = i + c->lpt_first; in alloc_lpt_leb()
[all …]
H A Dtnc_commit.c26 struct ubifs_znode *znode, int lnum, int offs, int len) in make_idx_node() argument
41 br->lnum = cpu_to_le32(zbr->lnum); in make_idx_node()
45 if (!zbr->lnum || !zbr->len) { in make_idx_node()
57 znode->lnum = lnum; in make_idx_node()
69 zbr->lnum = lnum; in make_idx_node()
74 c->zroot.lnum = lnum; in make_idx_node()
106 static int fill_gap(struct ubifs_info *c, int lnum, int gap_start, int gap_end, in fill_gap() argument
129 lnum, gap_pos, len); in fill_gap()
149 lnum, gap_start, gap_end, gap_end - gap_start, written, pad_len); in fill_gap()
163 static int find_old_idx(struct ubifs_info *c, int lnum, int offs) in find_old_idx() argument
[all …]
H A Dfind.c30 int lnum; member
109 data->lnum = lprops->lnum; in scan_for_dirty_cb()
167 data.lnum = -1; in scan_for_dirty()
174 ubifs_assert(c, data.lnum >= c->main_first && data.lnum < c->leb_cnt); in scan_for_dirty()
175 c->lscan_lnum = data.lnum; in scan_for_dirty()
176 lprops = ubifs_lpt_lookup_dirty(c, data.lnum); in scan_for_dirty()
179 ubifs_assert(c, lprops->lnum == data.lnum); in scan_for_dirty()
322 lp->lnum, lp->free, lp->dirty, lp->flags); in ubifs_find_dirty_leb()
380 data->lnum = lprops->lnum; in scan_for_free_cb()
447 data.lnum = -1; in do_find_free_space()
[all …]
H A Drecovery.c97 static int get_master_node(const struct ubifs_info *c, int lnum, void **pbuf, in get_master_node() argument
108 err = ubifs_leb_read(c, lnum, sbuf, 0, c->leb_size, 0); in get_master_node()
132 ret = ubifs_scan_a_node(c, buf, len, lnum, offs, 1); in get_master_node()
138 ret = ubifs_scan_a_node(c, buf, len, lnum, offs, 1); in get_master_node()
152 dbg_rcvry("found a master node at %d:%d", lnum, offs); in get_master_node()
163 dbg_rcvry("found corruption at %d:%d", lnum, offs); in get_master_node()
195 int err = 0, lnum = UBIFS_MST_LNUM, sz = c->mst_node_alsz; in write_rcvrd_mst_node() local
207 err = ubifs_leb_change(c, lnum, mst, sz); in write_rcvrd_mst_node()
210 err = ubifs_leb_change(c, lnum + 1, mst, sz); in write_rcvrd_mst_node()
429 static void clean_buf(const struct ubifs_info *c, void **buf, int lnum, in clean_buf() argument
[all …]
H A Dio.c87 int ubifs_leb_read(const struct ubifs_info *c, int lnum, void *buf, int offs, in ubifs_leb_read() argument
92 err = ubi_read(c->ubi, lnum, buf, offs, len); in ubifs_leb_read()
99 len, lnum, offs, err); in ubifs_leb_read()
105 int ubifs_leb_write(struct ubifs_info *c, int lnum, const void *buf, int offs, in ubifs_leb_write() argument
114 err = ubi_leb_write(c->ubi, lnum, buf, offs, len); in ubifs_leb_write()
116 err = dbg_leb_write(c, lnum, buf, offs, len); in ubifs_leb_write()
119 len, lnum, offs, err); in ubifs_leb_write()
126 int ubifs_leb_change(struct ubifs_info *c, int lnum, const void *buf, int len) in ubifs_leb_change() argument
134 err = ubi_leb_change(c->ubi, lnum, buf, len); in ubifs_leb_change()
136 err = dbg_leb_change(c, lnum, buf, len); in ubifs_leb_change()
[all …]
H A Dscan.c57 int ubifs_scan_a_node(const struct ubifs_info *c, void *buf, int len, int lnum, in ubifs_scan_a_node() argument
66 dbg_scan("hit empty space at LEB %d:%d", lnum, offs); in ubifs_scan_a_node()
77 dbg_ntype(ch->node_type), lnum, offs); in ubifs_scan_a_node()
79 if (ubifs_check_node(c, buf, lnum, offs, quiet, 1)) in ubifs_scan_a_node()
92 lnum, offs); in ubifs_scan_a_node()
107 lnum, offs, ALIGN(offs + node_len + pad_len, 8)); in ubifs_scan_a_node()
125 struct ubifs_scan_leb *ubifs_start_scan(const struct ubifs_info *c, int lnum, in ubifs_start_scan() argument
131 dbg_scan("scan LEB %d:%d", lnum, offs); in ubifs_start_scan()
137 sleb->lnum = lnum; in ubifs_start_scan()
141 err = ubifs_leb_read(c, lnum, sbuf + offs, offs, c->leb_size - offs, 0); in ubifs_start_scan()
[all …]
H A Dreplay.c46 int lnum; member
95 lp = ubifs_lpt_lookup_dirty(c, b->bud->lnum); in set_bud_lprops()
122 dbg_mnt("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum, in set_bud_lprops()
124 dbg_gc("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum, in set_bud_lprops()
136 b->bud->lnum, lp->free, lp->dirty, b->free, in set_bud_lprops()
148 b->bud->lnum, c->leb_size - b->free); in set_bud_lprops()
248 r->lnum, r->offs, r->len, r->deletion, r->sqnum); in apply_replay_entry()
254 err = ubifs_tnc_add_nm(c, &r->key, r->lnum, r->offs, in apply_replay_entry()
279 err = ubifs_tnc_add(c, &r->key, r->lnum, r->offs, in apply_replay_entry()
383 static int insert_node(struct ubifs_info *c, int lnum, int offs, int len, in insert_node() argument
[all …]
H A Dgc.c72 wbuf->lnum, wbuf->offs + wbuf->used, gc_lnum, in switch_gc_head()
259 err = ubifs_tnc_has_node(c, &snod->key, 0, sleb->lnum, in sort_nodes()
305 int err, new_lnum = wbuf->lnum, new_offs = wbuf->offs + wbuf->used; in move_node()
312 err = ubifs_tnc_replace(c, &snod->key, sleb->lnum, in move_node()
336 if (wbuf->lnum == -1) { in move_nodes()
432 ubifs_add_dirt(c, wbuf->lnum, ubifs_auth_node_sz(c)); in move_nodes()
495 int err = 0, lnum = lp->lnum; in ubifs_garbage_collect_leb() local
499 ubifs_assert(c, c->gc_lnum != lnum); in ubifs_garbage_collect_leb()
500 ubifs_assert(c, wbuf->lnum != lnum); in ubifs_garbage_collect_leb()
504 dbg_gc("LEB %d is free, return it", lp->lnum); in ubifs_garbage_collect_leb()
[all …]
/OK3568_Linux_fs/u-boot/include/linux/mtd/
H A Dubi.h256 int ubi_leb_read(struct ubi_volume_desc *desc, int lnum, char *buf, int offset,
258 int ubi_leb_read_sg(struct ubi_volume_desc *desc, int lnum, struct ubi_sgl *sgl,
260 int ubi_leb_write(struct ubi_volume_desc *desc, int lnum, const void *buf,
262 int ubi_leb_change(struct ubi_volume_desc *desc, int lnum, const void *buf,
264 int ubi_leb_erase(struct ubi_volume_desc *desc, int lnum);
265 int ubi_leb_unmap(struct ubi_volume_desc *desc, int lnum);
266 int ubi_leb_map(struct ubi_volume_desc *desc, int lnum);
267 int ubi_is_mapped(struct ubi_volume_desc *desc, int lnum);
269 int ubi_flush(int ubi_num, int vol_id, int lnum);
275 static inline int ubi_read(struct ubi_volume_desc *desc, int lnum, char *buf, in ubi_read() argument
[all …]
/OK3568_Linux_fs/kernel/include/linux/mtd/
H A Dubi.h237 int ubi_leb_read(struct ubi_volume_desc *desc, int lnum, char *buf, int offset,
239 int ubi_leb_read_sg(struct ubi_volume_desc *desc, int lnum, struct ubi_sgl *sgl,
241 int ubi_leb_write(struct ubi_volume_desc *desc, int lnum, const void *buf,
243 int ubi_leb_change(struct ubi_volume_desc *desc, int lnum, const void *buf,
245 int ubi_leb_erase(struct ubi_volume_desc *desc, int lnum);
246 int ubi_leb_unmap(struct ubi_volume_desc *desc, int lnum);
247 int ubi_leb_map(struct ubi_volume_desc *desc, int lnum);
248 int ubi_is_mapped(struct ubi_volume_desc *desc, int lnum);
250 int ubi_flush(int ubi_num, int vol_id, int lnum);
256 static inline int ubi_read(struct ubi_volume_desc *desc, int lnum, char *buf, in ubi_read() argument
[all …]
/OK3568_Linux_fs/u-boot/drivers/mtd/ubispl/
H A Dubispl.c113 be32_to_cpu(vh->lnum) == fm_lnum) in ubi_rescan_fm_vid_hdr()
118 fm_lnum, be32_to_cpu(vh->lnum)); in ubi_rescan_fm_vid_hdr()
126 u32 pnum, u32 lnum) in ubi_add_peb_to_vol() argument
134 if (lnum >= UBI_MAX_VOL_LEBS) { in ubi_add_peb_to_vol()
135 ubi_warn("Vol: %u LEB %d > %d", vol_id, lnum, UBI_MAX_VOL_LEBS); in ubi_add_peb_to_vol()
140 pnum, vol_id, lnum, !!test_bit(lnum, vi->found), in ubi_add_peb_to_vol()
144 ltp = vi->lebs_to_pebs + lnum; in ubi_add_peb_to_vol()
147 if (__test_and_set_bit(lnum, vi->found)) { in ubi_add_peb_to_vol()
162 lnum)) { in ubi_add_peb_to_vol()
177 vol_id, lnum, cur_pnum, be64_to_cpu(cur->sqnum), pnum, in ubi_add_peb_to_vol()
[all …]

1234