Searched refs:lnum (Results 1 - 25 of 38) sorted by relevance

12

/u-boot/include/linux/mtd/
H A Dubi.h255 int ubi_leb_read(struct ubi_volume_desc *desc, int lnum, char *buf, int offset,
257 int ubi_leb_read_sg(struct ubi_volume_desc *desc, int lnum, struct ubi_sgl *sgl,
259 int ubi_leb_write(struct ubi_volume_desc *desc, int lnum, const void *buf,
261 int ubi_leb_change(struct ubi_volume_desc *desc, int lnum, const void *buf,
263 int ubi_leb_erase(struct ubi_volume_desc *desc, int lnum);
264 int ubi_leb_unmap(struct ubi_volume_desc *desc, int lnum);
265 int ubi_leb_map(struct ubi_volume_desc *desc, int lnum);
266 int ubi_is_mapped(struct ubi_volume_desc *desc, int lnum);
268 int ubi_flush(int ubi_num, int vol_id, int lnum);
274 static inline int ubi_read(struct ubi_volume_desc *desc, int lnum, cha argument
284 ubi_read_sg(struct ubi_volume_desc *desc, int lnum, struct ubi_sgl *sgl, int offset, int len) argument
[all...]
/u-boot/fs/ubifs/
H A Dscan.c57 * @lnum: logical eraseblock number
63 int ubifs_scan_a_node(const struct ubifs_info *c, void *buf, int len, int lnum, argument
72 dbg_scan("hit empty space at LEB %d:%d", lnum, offs);
83 dbg_ntype(ch->node_type), lnum, offs);
85 if (ubifs_check_node(c, buf, lnum, offs, quiet, 1))
98 lnum, offs);
113 lnum, offs, ALIGN(offs + node_len + pad_len, 8));
124 * @lnum: logical eraseblock number
131 struct ubifs_scan_leb *ubifs_start_scan(const struct ubifs_info *c, int lnum, argument
137 dbg_scan("scan LEB %d:%d", lnum, off
169 ubifs_end_scan(const struct ubifs_info *c, struct ubifs_scan_leb *sleb, int lnum, int offs) argument
232 ubifs_scanned_corruption(const struct ubifs_info *c, int lnum, int offs, void *buf) argument
261 ubifs_scan(const struct ubifs_info *c, int lnum, int offs, void *sbuf, int quiet) argument
[all...]
H A Dlog.c30 * @lnum: logical eraseblock number to search
32 * This function searches bud LEB @lnum. Returns bud description object in case
35 struct ubifs_bud *ubifs_search_bud(struct ubifs_info *c, int lnum) argument
44 if (lnum < bud->lnum)
46 else if (lnum > bud->lnum)
60 * @lnum: logical eraseblock number to search
62 * This functions returns the wbuf for @lnum or %NULL if there is not one.
64 struct ubifs_wbuf *ubifs_get_wbuf(struct ubifs_info *c, int lnum) argument
169 ubifs_add_bud_to_log(struct ubifs_info *c, int jhead, int lnum, int offs) argument
382 int lnum = c->jheads[i].wbuf.lnum; local
502 int lnum, err = 0; local
534 int lnum; member in struct:done_ref
545 done_already(struct rb_root *done_tree, int lnum) argument
595 add_node(struct ubifs_info *c, void *buf, int *lnum, int *offs, void *node) argument
631 int lnum, err, first = 1, write_lnum, offs = 0; local
[all...]
H A Drecovery.c90 * @lnum: LEB number
104 static int get_master_node(const struct ubifs_info *c, int lnum, void **pbuf, argument
115 err = ubifs_leb_read(c, lnum, sbuf, 0, c->leb_size, 0);
139 ret = ubifs_scan_a_node(c, buf, len, lnum, offs, 1);
145 ret = ubifs_scan_a_node(c, buf, len, lnum, offs, 1);
159 dbg_rcvry("found a master node at %d:%d", lnum, offs);
170 dbg_rcvry("found corruption at %d:%d", lnum, offs);
202 int err = 0, lnum = UBIFS_MST_LNUM, sz = c->mst_node_alsz; local
211 err = ubifs_leb_change(c, lnum, mst, sz);
214 err = ubifs_leb_change(c, lnum
437 clean_buf(const struct ubifs_info *c, void **buf, int lnum, int *offs, int *len) argument
467 no_more_nodes(const struct ubifs_info *c, void *buf, int len, int lnum, int offs) argument
503 int lnum = sleb->lnum, endpt = start; local
633 ubifs_recover_leb(struct ubifs_info *c, int lnum, int offs, void *sbuf, int jhead) argument
810 get_cs_sqnum(struct ubifs_info *c, int lnum, int offs, unsigned long long *cs_sqnum) argument
867 ubifs_recover_log_leb(struct ubifs_info *c, int lnum, int offs, void *sbuf) argument
923 recover_head(struct ubifs_info *c, int lnum, int offs, void *sbuf) argument
996 int err, lnum = ucleb->lnum, offs = 0, len = ucleb->endpt, quiet = 1; local
1115 int lnum, err; local
1427 int err, lnum, offs, len; local
[all...]
H A Dlpt_commit.c136 * @lnum: LEB number
140 static void upd_ltab(struct ubifs_info *c, int lnum, int free, int dirty) argument
143 lnum, c->ltab[lnum - c->lpt_first].free,
144 c->ltab[lnum - c->lpt_first].dirty, free, dirty);
145 ubifs_assert(lnum >= c->lpt_first && lnum <= c->lpt_last);
146 c->ltab[lnum - c->lpt_first].free = free;
147 c->ltab[lnum - c->lpt_first].dirty += dirty;
153 * @lnum
160 alloc_lpt_leb(struct ubifs_info *c, int *lnum) argument
195 int lnum, offs, len, alen, done_lsave, done_ltab, err; local
345 realloc_lpt_leb(struct ubifs_info *c, int *lnum) argument
374 int lnum, offs, len, from, err, wlen, alen, done_ltab, done_lsave; local
907 make_nnode_dirty(struct ubifs_info *c, int node_num, int lnum, int offs) argument
956 make_pnode_dirty(struct ubifs_info *c, int node_num, int lnum, int offs) argument
986 make_ltab_dirty(struct ubifs_info *c, int lnum, int offs) argument
1011 make_lsave_dirty(struct ubifs_info *c, int lnum, int offs) argument
1038 make_node_dirty(struct ubifs_info *c, int node_type, int node_num, int lnum, int offs) argument
1152 lpt_gc_lnum(struct ubifs_info *c, int lnum) argument
1199 int i, lnum = -1, dirty = 0; local
1522 dbg_is_nnode_dirty(struct ubifs_info *c, int lnum, int offs) argument
1557 dbg_is_pnode_dirty(struct ubifs_info *c, int lnum, int offs) argument
1586 dbg_is_ltab_dirty(struct ubifs_info *c, int lnum, int offs) argument
1599 dbg_is_lsave_dirty(struct ubifs_info *c, int lnum, int offs) argument
1613 dbg_is_node_dirty(struct ubifs_info *c, int node_type, int lnum, int offs) argument
1637 dbg_check_ltab_lnum(struct ubifs_info *c, int lnum) argument
1710 int lnum, err, i, cnt; local
1889 dump_lpt_leb(const struct ubifs_info *c, int lnum) argument
[all...]
H A Dio.c96 int ubifs_leb_read(const struct ubifs_info *c, int lnum, void *buf, int offs, argument
101 err = ubi_read(c->ubi, lnum, buf, offs, len);
108 len, lnum, offs, err);
114 int ubifs_leb_write(struct ubifs_info *c, int lnum, const void *buf, int offs, argument
123 err = ubi_leb_write(c->ubi, lnum, buf, offs, len);
126 err = dbg_leb_write(c, lnum, buf, offs, len);
130 len, lnum, offs, err);
137 int ubifs_leb_change(struct ubifs_info *c, int lnum, const void *buf, int len) argument
145 err = ubi_leb_change(c->ubi, lnum, buf, len);
148 err = dbg_leb_change(c, lnum, bu
159 ubifs_leb_unmap(struct ubifs_info *c, int lnum) argument
180 ubifs_leb_map(struct ubifs_info *c, int lnum) argument
201 ubifs_is_mapped(const struct ubifs_info *c, int lnum) argument
242 ubifs_check_node(const struct ubifs_info *c, const void *buf, int lnum, int offs, int quiet, int must_chk_crc) argument
577 ubifs_wbuf_seek_nolock(struct ubifs_wbuf *wbuf, int lnum, int offs) argument
868 ubifs_write_node(struct ubifs_info *c, void *buf, int len, int lnum, int offs) argument
908 ubifs_read_node_wbuf(struct ubifs_wbuf *wbuf, void *buf, int type, int len, int lnum, int offs) argument
985 ubifs_read_node(const struct ubifs_info *c, void *buf, int type, int len, int lnum, int offs) argument
[all...]
H A Dgc.c66 * @lnum: LEB number written is returned here
80 wbuf->lnum, wbuf->offs + wbuf->used, gc_lnum,
270 err = ubifs_tnc_has_node(c, &snod->key, 0, sleb->lnum,
316 int err, new_lnum = wbuf->lnum, new_offs = wbuf->offs + wbuf->used;
323 err = ubifs_tnc_replace(c, &snod->key, sleb->lnum,
347 if (wbuf->lnum == -1) {
466 int err = 0, lnum = lp->lnum; local
470 ubifs_assert(c->gc_lnum != lnum);
471 ubifs_assert(wbuf->lnum !
966 int lnum; local
[all...]
H A Dreplay.c35 * @lnum: logical eraseblock number of the node
51 int lnum; member in struct:replay_entry
99 lp = ubifs_lpt_lookup_dirty(c, b->bud->lnum);
126 dbg_mnt("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum,
128 dbg_gc("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum,
140 b->bud->lnum, lp->free, lp->dirty, b->free,
152 b->bud->lnum, c->leb_size - b->free);
219 r->lnum, r->offs, r->len, r->deletion, r->sqnum);
228 err = ubifs_tnc_add_nm(c, &r->key, r->lnum, r->offs,
248 err = ubifs_tnc_add(c, &r->key, r->lnum,
351 insert_node(struct ubifs_info *c, int lnum, int offs, int len, union ubifs_key *key, unsigned long long sqnum, int deletion, int *used, loff_t old_size, loff_t new_size) argument
399 insert_dent(struct ubifs_info *c, int lnum, int offs, int len, union ubifs_key *key, const char *name, int nlen, unsigned long long sqnum, int deletion, int *used) argument
539 int err = 0, used = 0, lnum = b->bud->lnum, offs = b->bud->start; local
740 add_replay_bud(struct ubifs_info *c, int lnum, int offs, int jhead, unsigned long long sqnum) argument
784 int lnum = le32_to_cpu(ref->lnum); local
821 replay_log_leb(struct ubifs_info *c, int lnum, int offs, void *sbuf) argument
1005 int err, lnum, free; local
[all...]
H A Dmisc.h160 * @lnum: LEB to add dirty space for
166 static inline int ubifs_add_dirt(struct ubifs_info *c, int lnum, int dirty) argument
168 return ubifs_update_one_lp(c, lnum, LPROPS_NC, dirty, 0, 0);
174 * @lnum: LEB to return
180 static inline int ubifs_return_leb(struct ubifs_info *c, int lnum) argument
182 return ubifs_change_one_lp(c, lnum, LPROPS_NC, LPROPS_NC, 0,
286 * @lnum: current log LEB
289 * 'lnum'.
291 static inline int ubifs_next_log_lnum(const struct ubifs_info *c, int lnum) argument
293 lnum
[all...]
H A Dtnc.c54 int len, int lnum, int offs);
61 * @lnum: LEB number of obsoleted index node
81 static int insert_old_idx(struct ubifs_info *c, int lnum, int offs) argument
89 old_idx->lnum = lnum;
96 if (lnum < o->lnum)
98 else if (lnum > o->lnum)
129 return insert_old_idx(c, zbr->lnum, zb
242 add_idx_dirt(struct ubifs_info *c, int lnum, int dirt) argument
455 try_read_node(const struct ubifs_info *c, void *buf, int type, int len, int lnum, int offs) argument
1014 matches_position(struct ubifs_zbranch *zbr, int lnum, int offs) argument
1039 resolve_collision_directly(struct ubifs_info *c, const union ubifs_key *key, struct ubifs_znode **zn, int *n, int lnum, int offs) argument
1407 maybe_leb_gced(struct ubifs_info *c, int lnum, int gc_seq1) argument
1450 ubifs_tnc_locate(struct ubifs_info *c, const union ubifs_key *key, void *node, int *lnum, int *offs) argument
1526 int n, err = 0, lnum = -1, uninitialized_var(offs); local
1656 read_wbuf(struct ubifs_wbuf *wbuf, void *buf, int len, int lnum, int offs) argument
1757 int lnum = bu->zbranch[0].lnum, offs = bu->zbranch[0].offs, len, err, i; local
2170 ubifs_tnc_add(struct ubifs_info *c, const union ubifs_key *key, int lnum, int offs, int len) argument
2219 ubifs_tnc_replace(struct ubifs_info *c, const union ubifs_key *key, int old_lnum, int old_offs, int lnum, int offs, int len) argument
2302 ubifs_tnc_add_nm(struct ubifs_info *c, const union ubifs_key *key, int lnum, int offs, int len, const struct qstr *nm) argument
2996 lookup_znode(struct ubifs_info *c, union ubifs_key *key, int level, int lnum, int offs) argument
3125 is_idx_node_in_tnc(struct ubifs_info *c, union ubifs_key *key, int level, int lnum, int offs) argument
3152 is_leaf_node_in_tnc(struct ubifs_info *c, union ubifs_key *key, int lnum, int offs) argument
3222 ubifs_tnc_has_node(struct ubifs_info *c, union ubifs_key *key, int level, int lnum, int offs, int is_idx) argument
3262 ubifs_dirty_idx_node(struct ubifs_info *c, union ubifs_key *key, int level, int lnum, int offs) argument
[all...]
H A Dlpt.c391 int lnum = nnode->nbranch[i].lnum; local
393 if (lnum == 0)
394 lnum = c->lpt_last + 1;
395 pack_bits(&addr, &pos, lnum - c->lpt_first, c->lpt_lnum_bits);
456 * @lnum: LEB number to which to add dirty space
459 void ubifs_add_lpt_dirt(struct ubifs_info *c, int lnum, int dirty) argument
461 if (!dirty || !lnum)
464 lnum, dirty, c->ltab[lnum
476 set_ltab(struct ubifs_info *c, int lnum, int free, int dirty) argument
608 int lnum, err = 0, node_sz, iopos, i, j, cnt, len, alen, row; local
872 int lnum = pnode->lprops[i].lnum; local
1010 int lnum; local
1073 int lnum = ubifs_unpack_bits(&addr, &pos, c->lnum_bits); local
1112 int lnum = nnode->nbranch[i].lnum; local
1174 int i, lnum; local
1197 int err, lnum, offs; local
1265 int err, lnum, offs; local
1365 int lnum = c->lsave[i]; local
1447 ubifs_lpt_lookup(struct ubifs_info *c, int lnum) argument
1580 ubifs_lpt_lookup_dirty(struct ubifs_info *c, int lnum) argument
1983 int ret, lnum = lprops->lnum; local
2112 int lnum = (pnode->num << UBIFS_LPT_FANOUT_SHIFT) + i + local
[all...]
H A Dtnc_misc.c255 * @lnum: LEB of the indexing node to read
266 static int read_znode(struct ubifs_info *c, int lnum, int offs, int len, argument
276 err = ubifs_read_node(c, idx, UBIFS_IDX_NODE, len, lnum, offs);
286 lnum, offs, znode->level, znode->child_cnt);
302 zbr->lnum = le32_to_cpu(br->lnum);
309 if (zbr->lnum < c->main_first ||
310 zbr->lnum >= c->leb_cnt || zbr->offs < 0 ||
382 ubifs_err(c, "bad indexing node at LEB %d:%d, error %d", lnum, offs, err);
415 err = read_znode(c, zbr->lnum, zb
[all...]
H A Dmaster.c35 int lnum, offs = 0, nodes_cnt; local
37 lnum = UBIFS_MST_LNUM;
39 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1);
53 lnum += 1;
55 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1);
81 snod->type, lnum, snod->offs);
121 if (c->zroot.lnum >= c->leb_cnt || c->zroot.lnum < c->main_first ||
277 c->zroot.lnum = le32_to_cpu(c->mst_node->root_lnum);
359 int err, lnum, off local
[all...]
H A Dlprops.c502 pos = (lprops->lnum - c->main_first) & (UBIFS_LPT_FANOUT - 1);
539 lprops->lnum, free, dirty, flags);
555 lprops = ubifs_lpt_lookup_dirty(c, lprops->lnum);
559 ubifs_assert(lprops == ubifs_lpt_lookup_dirty(c, lprops->lnum));
644 * @lnum: LEB to change properties for
651 * This function changes properties of LEB @lnum. It is a helper wrapper over
656 int ubifs_change_one_lp(struct ubifs_info *c, int lnum, int free, int dirty, argument
664 lp = ubifs_lpt_lookup_dirty(c, lnum);
679 lnum, err);
686 * @lnum
695 ubifs_update_one_lp(struct ubifs_info *c, int lnum, int free, int dirty, int flags_set, int flags_clean) argument
732 ubifs_read_one_lp(struct ubifs_info *c, int lnum, struct ubifs_lprops *lp) argument
1028 int cat, lnum = lp->lnum, is_idx = 0, used = 0, free, dirty, ret; local
[all...]
H A Ddebug.c417 pr_err("\tlnum %u\n", le32_to_cpu(ref->lnum));
523 i, le32_to_cpu(br->lnum), le32_to_cpu(br->offs),
634 c->jheads[i].wbuf.lnum);
637 pr_err("\tbud LEB %d\n", bud->lnum);
640 pr_err("\told bud LEB %d\n", bud->lnum);
643 idx_gc->lnum, idx_gc->unmap);
678 lp->lnum, lp->free, lp->dirty, c->leb_size - spc, spc,
682 lp->lnum, lp->free, lp->dirty, c->leb_size - spc, spc,
731 if (bud->lnum == lp->lnum) {
758 int lnum, err; local
836 ubifs_dump_leb(const struct ubifs_info *c, int lnum) argument
2531 power_cut_emulated(struct ubifs_info *c, int lnum, int write) argument
2646 dbg_leb_write(struct ubifs_info *c, int lnum, const void *buf, int offs, int len) argument
2668 dbg_leb_change(struct ubifs_info *c, int lnum, const void *buf, int len) argument
2685 dbg_leb_unmap(struct ubifs_info *c, int lnum) argument
2701 dbg_leb_map(struct ubifs_info *c, int lnum) argument
[all...]
H A Dubifs.h871 * @lnum: LEB number of obsoleted index node
876 int lnum; member in struct:ubifs_old_idx
910 * @lnum: logical eraseblock number
917 int lnum; member in struct:ubifs_scan_leb
927 * @lnum: LEB number
936 int lnum; member in struct:ubifs_gced_idx_leb
1022 * @lnum: LEB number of recovered LEB
1031 int lnum; member in struct:ubifs_unclean_leb
1069 * @lnum: LEB number
1077 int lnum; member in struct:ubifs_lprops
1184 int lnum; member in struct:ubifs_nbranch
1284 int lnum; member in struct:ubifs_wbuf
1311 int lnum; member in struct:ubifs_bud
1346 int lnum; member in struct:ubifs_zbranch
1378 int lnum; member in struct:ubifs_znode
[all...]
H A Dsb.c279 br->lnum = cpu_to_le32(main_first + DEFAULT_DATA_LEB);
673 * @lnum: the LEB number to fix up
676 * This function reads the contents of the given LEB number @lnum, then fixes
681 static int fixup_leb(struct ubifs_info *c, int lnum, int len) argument
690 dbg_mnt("unmap empty LEB %d", lnum);
691 return ubifs_leb_unmap(c, lnum);
694 dbg_mnt("fixup LEB %d, data len %d", lnum, len);
695 err = ubifs_leb_read(c, lnum, c->sbuf, 0, len, 1);
699 return ubifs_leb_change(c, lnum, c->sbuf, len);
711 int lnum, er local
[all...]
H A Dorphan.c337 int lnum; local
340 for (lnum = c->ohead_lnum + 1; lnum <= c->orph_last; lnum++) {
341 err = ubifs_leb_unmap(c, lnum);
482 int lnum, err; local
484 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
485 err = ubifs_leb_unmap(c, lnum);
641 int lnum, err = 0, outofdate = 0, last_flagged = 0; local
872 int lnum, err = 0; local
[all...]
/u-boot/drivers/mtd/ubi/
H A Deba.c22 * They are indexed by (@vol_id, @lnum) pairs.
85 * @lnum: logical eraseblock number
92 int lnum)
107 if (lnum < le->lnum)
109 else if (lnum > le->lnum)
123 * @lnum: logical eraseblock number
125 * This function adds new entry for logical eraseblock (@vol_id, @lnum) to the
131 int vol_id, int lnum)
91 ltree_lookup(struct ubi_device *ubi, int vol_id, int lnum) argument
130 ltree_add_entry(struct ubi_device *ubi, int vol_id, int lnum) argument
200 leb_read_lock(struct ubi_device *ubi, int vol_id, int lnum) argument
217 leb_read_unlock(struct ubi_device *ubi, int vol_id, int lnum) argument
242 leb_write_lock(struct ubi_device *ubi, int vol_id, int lnum) argument
264 leb_write_trylock(struct ubi_device *ubi, int vol_id, int lnum) argument
293 leb_write_unlock(struct ubi_device *ubi, int vol_id, int lnum) argument
319 ubi_eba_unmap_leb(struct ubi_device *ubi, struct ubi_volume *vol, int lnum) argument
367 ubi_eba_read_leb(struct ubi_device *ubi, struct ubi_volume *vol, int lnum, void *buf, int offset, int len, int check) argument
494 ubi_eba_read_leb_sg(struct ubi_device *ubi, struct ubi_volume *vol, struct ubi_sgl *sgl, int lnum, int offset, int len, int check) argument
552 recover_peb(struct ubi_device *ubi, int pnum, int vol_id, int lnum, const void *buf, int offset, int len) argument
657 ubi_eba_write_leb(struct ubi_device *ubi, struct ubi_volume *vol, int lnum, const void *buf, int offset, int len) argument
790 ubi_eba_write_leb_st(struct ubi_device *ubi, struct ubi_volume *vol, int lnum, const void *buf, int len, int used_ebs) argument
907 ubi_eba_atomic_leb_change(struct ubi_device *ubi, struct ubi_volume *vol, int lnum, const void *buf, int len) argument
1059 int err, vol_id, lnum, data_size, aldata_size, idx; local
[all...]
H A Dkapi.c368 * @lnum: logical eraseblock number to read from
375 static int leb_read_sanity_check(struct ubi_volume_desc *desc, int lnum, argument
382 if (vol_id < 0 || vol_id >= ubi->vtbl_slots || lnum < 0 ||
383 lnum >= vol->used_ebs || offset < 0 || len < 0 ||
391 if (lnum == vol->used_ebs - 1 &&
405 * @lnum: logical eraseblock number to read from
411 * This function reads data from offset @offset of logical eraseblock @lnum and
429 int ubi_leb_read(struct ubi_volume_desc *desc, int lnum, char *buf, int offset, argument
436 dbg_gen("read %d bytes from LEB %d:%d:%d", len, vol_id, lnum, offset);
438 err = leb_read_sanity_check(desc, lnum, offse
469 ubi_leb_read_sg(struct ubi_volume_desc *desc, int lnum, struct ubi_sgl *sgl, int offset, int len, int check) argument
521 ubi_leb_write(struct ubi_volume_desc *desc, int lnum, const void *buf, int offset, int len) argument
566 ubi_leb_change(struct ubi_volume_desc *desc, int lnum, const void *buf, int len) argument
607 ubi_leb_erase(struct ubi_volume_desc *desc, int lnum) argument
668 ubi_leb_unmap(struct ubi_volume_desc *desc, int lnum) argument
704 ubi_leb_map(struct ubi_volume_desc *desc, int lnum) argument
743 ubi_is_mapped(struct ubi_volume_desc *desc, int lnum) argument
793 ubi_flush(int ubi_num, int vol_id, int lnum) argument
[all...]
H A Dupd.c182 vol->vol_id, req->lnum, req->bytes);
184 return ubi_eba_atomic_leb_change(ubi, vol, req->lnum, NULL, 0);
189 vol->ch_lnum = req->lnum;
202 * @lnum: logical eraseblock number
227 static int write_leb(struct ubi_device *ubi, struct ubi_volume *vol, int lnum, argument
242 err = ubi_eba_write_leb(ubi, vol, lnum, buf, 0, len);
254 err = ubi_eba_write_leb_st(ubi, vol, lnum, buf, len, used_ebs);
277 int lnum, offs, err = 0, len, to_write = count; local
279 int lnum, err = 0, len, to_write = count;
289 lnum
[all...]
H A Dattach.c103 * @lnum: the last used LEB number for the PEB
110 * It stores the @lnum and @vol_id alongside, which can both be
120 int lnum, int ec, int to_head, struct list_head *list)
140 aeb->lnum = lnum;
452 int err, vol_id, lnum; local
459 lnum = be32_to_cpu(vid_hdr->lnum);
463 pnum, vol_id, lnum, ec, sqnum, bitflips);
482 if (lnum !
119 add_to_list(struct ubi_attach_info *ai, int pnum, int vol_id, int lnum, int ec, int to_head, struct list_head *list) argument
999 int lnum = be32_to_cpu(vidh->lnum); local
[all...]
H A Dwl.c599 * @lnum: the last used logical eraseblock number for the PEB
606 int vol_id, int lnum, int torture)
622 wl_wrk->lnum = lnum;
638 * @lnum: the last used logical eraseblock number for the PEB
643 int vol_id, int lnum, int torture)
655 wl_wrk->lnum = lnum;
676 int vol_id = -1, lnum = -1; local
818 lnum
605 schedule_erase(struct ubi_device *ubi, struct ubi_wl_entry *e, int vol_id, int lnum, int torture) argument
642 do_sync_erase(struct ubi_device *ubi, struct ubi_wl_entry *e, int vol_id, int lnum, int torture) argument
1068 int lnum = wl_wrk->lnum; local
1200 ubi_wl_put_peb(struct ubi_device *ubi, int vol_id, int lnum, int pnum, int torture) argument
1357 ubi_wl_flush(struct ubi_device *ubi, int vol_id, int lnum) argument
[all...]
/u-boot/drivers/mtd/ubispl/
H A Dubispl.c293 /* Check volume id, volume type and lnum */
296 be32_to_cpu(vh->lnum) == fm_lnum)
298 ubi_dbg("RS: PEB %u vol: %u : %u typ %u lnum %u %u",
301 fm_lnum, be32_to_cpu(vh->lnum));
309 u32 pnum, u32 lnum)
317 if (lnum >= UBI_MAX_VOL_LEBS) {
318 ubi_warn("Vol: %u LEB %d > %d", vol_id, lnum, UBI_MAX_VOL_LEBS);
323 pnum, vol_id, lnum, !!test_bit(lnum, vi->found),
327 ltp = vi->lebs_to_pebs + lnum;
307 ubi_add_peb_to_vol(struct ubi_scan_info *ubi, struct ubi_vid_hdr *vh, u32 vol_id, u32 pnum, u32 lnum) argument
380 u32 vol_id, lnum; local
418 assign_aeb_to_av(struct ubi_scan_info *ubi, u32 pnum, u32 lnum, u32 vol_id, u32 vol_type, u32 used) argument
911 ubi_load_block(struct ubi_scan_info *ubi, uint8_t *laddr, struct ubi_vol_info *vi, u32 vol_id, u32 lnum, u32 last) argument
1042 u32 lnum, last, len; local
[all...]
/u-boot/include/mtd/
H A Dubi-user.h391 * @lnum: logical eraseblock number to change
406 __s32 lnum; member in struct:ubi_leb_change_req
415 * @lnum: logical eraseblock number to unmap
419 __s32 lnum; member in struct:ubi_map_req

Completed in 128 milliseconds

12