/linux-master/include/linux/mtd/ |
H A D | ubi.h | 240 int ubi_leb_read(struct ubi_volume_desc *desc, int lnum, char *buf, int offset, 242 int ubi_leb_read_sg(struct ubi_volume_desc *desc, int lnum, struct ubi_sgl *sgl, 244 int ubi_leb_write(struct ubi_volume_desc *desc, int lnum, const void *buf, 246 int ubi_leb_change(struct ubi_volume_desc *desc, int lnum, const void *buf, 248 int ubi_leb_erase(struct ubi_volume_desc *desc, int lnum); 249 int ubi_leb_unmap(struct ubi_volume_desc *desc, int lnum); 250 int ubi_leb_map(struct ubi_volume_desc *desc, int lnum); 251 int ubi_is_mapped(struct ubi_volume_desc *desc, int lnum); 253 int ubi_flush(int ubi_num, int vol_id, int lnum); 259 static inline int ubi_read(struct ubi_volume_desc *desc, int lnum, cha argument 269 ubi_read_sg(struct ubi_volume_desc *desc, int lnum, struct ubi_sgl *sgl, int offset, int len) argument [all...] |
/linux-master/fs/ubifs/ |
H A D | scan.c | 51 * @lnum: logical eraseblock number 57 int ubifs_scan_a_node(const struct ubifs_info *c, void *buf, int len, int lnum, argument 66 dbg_scan("hit empty space at LEB %d:%d", lnum, offs); 77 dbg_ntype(ch->node_type), lnum, offs); 79 if (ubifs_check_node(c, buf, len, lnum, offs, quiet, 1)) 92 lnum, offs); 107 lnum, offs, ALIGN(offs + node_len + pad_len, 8)); 118 * @lnum: logical eraseblock number 125 struct ubifs_scan_leb *ubifs_start_scan(const struct ubifs_info *c, int lnum, argument 131 dbg_scan("scan LEB %d:%d", lnum, off 163 ubifs_end_scan(const struct ubifs_info *c, struct ubifs_scan_leb *sleb, int lnum, int offs) argument 225 ubifs_scanned_corruption(const struct ubifs_info *c, int lnum, int offs, void *buf) argument 254 ubifs_scan(const struct ubifs_info *c, int lnum, int offs, void *sbuf, int quiet) argument [all...] |
H A D | log.c | 25 * @lnum: logical eraseblock number to search 27 * This function searches bud LEB @lnum. Returns bud description object in case 30 struct ubifs_bud *ubifs_search_bud(struct ubifs_info *c, int lnum) argument 39 if (lnum < bud->lnum) 41 else if (lnum > bud->lnum) 55 * @lnum: logical eraseblock number to search 57 * This functions returns the wbuf for @lnum or %NULL if there is not one. 59 struct ubifs_wbuf *ubifs_get_wbuf(struct ubifs_info *c, int lnum) argument 164 ubifs_add_bud_to_log(struct ubifs_info *c, int jhead, int lnum, int offs) argument 394 int lnum = c->jheads[i].wbuf.lnum; local 517 int lnum, err = 0; local 550 int lnum; member in struct:done_ref 561 done_already(struct rb_root *done_tree, int lnum) argument 611 add_node(struct ubifs_info *c, void *buf, int *lnum, int *offs, void *node) argument 647 int lnum, err, first = 1, write_lnum, offs = 0; local [all...] |
H A D | lpt_commit.c | 125 * @lnum: LEB number 129 static void upd_ltab(struct ubifs_info *c, int lnum, int free, int dirty) argument 132 lnum, c->ltab[lnum - c->lpt_first].free, 133 c->ltab[lnum - c->lpt_first].dirty, free, dirty); 134 ubifs_assert(c, lnum >= c->lpt_first && lnum <= c->lpt_last); 135 c->ltab[lnum - c->lpt_first].free = free; 136 c->ltab[lnum - c->lpt_first].dirty += dirty; 142 * @lnum 149 alloc_lpt_leb(struct ubifs_info *c, int *lnum) argument 184 int lnum, offs, len, alen, done_lsave, done_ltab, err; local 333 realloc_lpt_leb(struct ubifs_info *c, int *lnum) argument 362 int lnum, offs, len, from, err, wlen, alen, done_ltab, done_lsave; local 860 make_nnode_dirty(struct ubifs_info *c, int node_num, int lnum, int offs) argument 909 make_pnode_dirty(struct ubifs_info *c, int node_num, int lnum, int offs) argument 939 make_ltab_dirty(struct ubifs_info *c, int lnum, int offs) argument 964 make_lsave_dirty(struct ubifs_info *c, int lnum, int offs) argument 991 make_node_dirty(struct ubifs_info *c, int node_type, int node_num, int lnum, int offs) argument 1105 lpt_gc_lnum(struct ubifs_info *c, int lnum) argument 1152 int i, lnum = -1, dirty = 0; local 1476 dbg_is_nnode_dirty(struct ubifs_info *c, int lnum, int offs) argument 1511 dbg_is_pnode_dirty(struct ubifs_info *c, int lnum, int offs) argument 1540 dbg_is_ltab_dirty(struct ubifs_info *c, int lnum, int offs) argument 1553 dbg_is_lsave_dirty(struct ubifs_info *c, int lnum, int offs) argument 1567 dbg_is_node_dirty(struct ubifs_info *c, int node_type, int lnum, int offs) argument 1590 dbg_check_ltab_lnum(struct ubifs_info *c, int lnum) argument 1662 int lnum, err, i, cnt; local 1841 dump_lpt_leb(const struct ubifs_info *c, int lnum) argument [all...] |
H A D | recovery.c | 83 * @lnum: LEB number 97 static int get_master_node(const struct ubifs_info *c, int lnum, void **pbuf, argument 108 err = ubifs_leb_read(c, lnum, sbuf, 0, c->leb_size, 0); 132 ret = ubifs_scan_a_node(c, buf, len, lnum, offs, 1); 138 ret = ubifs_scan_a_node(c, buf, len, lnum, offs, 1); 152 dbg_rcvry("found a master node at %d:%d", lnum, offs); 163 dbg_rcvry("found corruption at %d:%d", lnum, offs); 195 int err = 0, lnum = UBIFS_MST_LNUM, sz = c->mst_node_alsz; local 207 err = ubifs_leb_change(c, lnum, mst, sz); 210 err = ubifs_leb_change(c, lnum 429 clean_buf(const struct ubifs_info *c, void **buf, int lnum, int *offs, int *len) argument 458 no_more_nodes(const struct ubifs_info *c, void *buf, int len, int lnum, int offs) argument 494 int lnum = sleb->lnum, endpt = start; local 622 ubifs_recover_leb(struct ubifs_info *c, int lnum, int offs, void *sbuf, int jhead) argument 799 get_cs_sqnum(struct ubifs_info *c, int lnum, int offs, unsigned long long *cs_sqnum) argument 856 ubifs_recover_log_leb(struct ubifs_info *c, int lnum, int offs, void *sbuf) argument 912 recover_head(struct ubifs_info *c, int lnum, int offs, void *sbuf) argument 985 int err, lnum = ucleb->lnum, offs = 0, len = ucleb->endpt, quiet = 1; local 1103 int lnum, err; local 1407 int err, lnum, offs, len; local [all...] |
H A D | io.c | 87 int ubifs_leb_read(const struct ubifs_info *c, int lnum, void *buf, int offs, argument 92 err = ubi_read(c->ubi, lnum, buf, offs, len); 99 len, lnum, offs, err); 105 int ubifs_leb_write(struct ubifs_info *c, int lnum, const void *buf, int offs, argument 114 err = ubi_leb_write(c->ubi, lnum, buf, offs, len); 116 err = dbg_leb_write(c, lnum, buf, offs, len); 119 len, lnum, offs, err); 126 int ubifs_leb_change(struct ubifs_info *c, int lnum, const void *buf, int len) argument 134 err = ubi_leb_change(c->ubi, lnum, buf, len); 136 err = dbg_leb_change(c, lnum, bu 146 ubifs_leb_unmap(struct ubifs_info *c, int lnum) argument 165 ubifs_leb_map(struct ubifs_info *c, int lnum) argument 184 ubifs_is_mapped(const struct ubifs_info *c, int lnum) argument 244 ubifs_check_node(const struct ubifs_info *c, const void *buf, int len, int lnum, int offs, int quiet, int must_chk_crc) argument 633 ubifs_wbuf_seek_nolock(struct ubifs_wbuf *wbuf, int lnum, int offs) argument 957 ubifs_write_node_hmac(struct ubifs_info *c, void *buf, int len, int lnum, int offs, int hmac_offs) argument 998 ubifs_write_node(struct ubifs_info *c, void *buf, int len, int lnum, int offs) argument 1019 ubifs_read_node_wbuf(struct ubifs_wbuf *wbuf, void *buf, int type, int len, int lnum, int offs) argument 1096 ubifs_read_node(const struct ubifs_info *c, void *buf, int type, int len, int lnum, int offs) argument [all...] |
H A D | tnc_commit.c | 21 * @lnum: LEB number where new index node will be written 26 struct ubifs_znode *znode, int lnum, int offs, int len) 41 br->lnum = cpu_to_le32(zbr->lnum); 45 if (!zbr->lnum || !zbr->len) { 57 znode->lnum = lnum; 69 zbr->lnum = lnum; 74 c->zroot.lnum 25 make_idx_node(struct ubifs_info *c, struct ubifs_idx_node *idx, struct ubifs_znode *znode, int lnum, int offs, int len) argument 106 fill_gap(struct ubifs_info *c, int lnum, int gap_start, int gap_end, int *dirt) argument 163 find_old_idx(struct ubifs_info *c, int lnum, int offs) argument 198 is_idx_node_in_use(struct ubifs_info *c, union ubifs_key *key, int level, int lnum, int offs) argument 228 int lnum, dirt = 0, gap_start, gap_end, err, written, tot_written; local 432 int lnum, offs, len, next_len, buf_len, buf_offs, used, avail; local 685 int i, leb_cnt, lnum; local 719 int i, err = 0, lnum, er; local 828 int i, lnum, offs, len, next_len, buf_len, buf_offs, used; local [all...] |
H A D | find.c | 24 * @lnum: LEB number found is returned here 30 int lnum; member in struct:scan_data 110 data->lnum = lprops->lnum; 168 data.lnum = -1; 174 ubifs_assert(c, data.lnum >= c->main_first && data.lnum < c->leb_cnt); 175 c->lscan_lnum = data.lnum; 176 lprops = ubifs_lpt_lookup_dirty(c, data.lnum); 179 ubifs_assert(c, lprops->lnum 486 int lebs, rsvd_idx_lebs, pick_free = 0, err, lnum, flags; local 665 int lnum = -1, err, flags; local 879 int err, lnum; local 908 int lnum; local [all...] |
H A D | replay.c | 29 * @lnum: logical eraseblock number of the node 45 int lnum; member in struct:replay_entry 94 lp = ubifs_lpt_lookup_dirty(c, b->bud->lnum); 121 dbg_mnt("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum, 123 dbg_gc("bud LEB %d was GC'd (%d free, %d dirty)", b->bud->lnum, 135 b->bud->lnum, lp->free, lp->dirty, b->free, 147 b->bud->lnum, c->leb_size - b->free); 247 r->lnum, r->offs, r->len, r->deletion, r->sqnum); 253 err = ubifs_tnc_add_nm(c, &r->key, r->lnum, r->offs, 278 err = ubifs_tnc_add(c, &r->key, r->lnum, 383 insert_node(struct ubifs_info *c, int lnum, int offs, int len, const u8 *hash, union ubifs_key *key, unsigned long long sqnum, int deletion, int *used, loff_t old_size, loff_t new_size) argument 433 insert_dent(struct ubifs_info *c, int lnum, int offs, int len, const u8 *hash, union ubifs_key *key, const char *name, int nlen, unsigned long long sqnum, int deletion, int *used) argument 670 int err = 0, used = 0, lnum = b->bud->lnum, offs = b->bud->start; local 890 add_replay_bud(struct ubifs_info *c, int lnum, int offs, int jhead, unsigned long long sqnum) argument 946 int lnum = le32_to_cpu(ref->lnum); local 983 replay_log_leb(struct ubifs_info *c, int lnum, int offs, void *sbuf) argument 1180 int err, lnum, free; local [all...] |
H A D | misc.h | 155 * @lnum: LEB to add dirty space for 161 static inline int ubifs_add_dirt(struct ubifs_info *c, int lnum, int dirty) argument 163 return ubifs_update_one_lp(c, lnum, LPROPS_NC, dirty, 0, 0); 169 * @lnum: LEB to return 175 static inline int ubifs_return_leb(struct ubifs_info *c, int lnum) argument 177 return ubifs_change_one_lp(c, lnum, LPROPS_NC, LPROPS_NC, 0, 265 * @lnum: current log LEB 268 * 'lnum'. 270 static inline int ubifs_next_log_lnum(const struct ubifs_info *c, int lnum) argument 272 lnum [all...] |
H A D | tnc.c | 57 if (old_idx->lnum < o->lnum) 59 else if (old_idx->lnum > o->lnum) 78 * @lnum: LEB number of obsoleted index node 98 static int insert_old_idx(struct ubifs_info *c, int lnum, int offs) argument 105 old_idx->lnum = lnum; 126 return insert_old_idx(c, zbr->lnum, zbr->offs); 129 return insert_old_idx(c, c->zroot.lnum, 221 add_idx_dirt(struct ubifs_info *c, int lnum, int dirt) argument 482 int lnum = zbr->lnum; local 1045 matches_position(struct ubifs_zbranch *zbr, int lnum, int offs) argument 1070 resolve_collision_directly(struct ubifs_info *c, const union ubifs_key *key, struct ubifs_znode **zn, int *n, int lnum, int offs) argument 1439 maybe_leb_gced(struct ubifs_info *c, int lnum, int gc_seq1) argument 1478 ubifs_tnc_locate(struct ubifs_info *c, const union ubifs_key *key, void *node, int *lnum, int *offs) argument 1554 int n, err = 0, lnum = -1, offs; local 1684 read_wbuf(struct ubifs_wbuf *wbuf, void *buf, int len, int lnum, int offs) argument 1791 int lnum = bu->zbranch[0].lnum, offs = bu->zbranch[0].offs, len, err, i; local 2311 ubifs_tnc_add(struct ubifs_info *c, const union ubifs_key *key, int lnum, int offs, int len, const u8 *hash) argument 2362 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 2446 ubifs_tnc_add_nm(struct ubifs_info *c, const union ubifs_key *key, int lnum, int offs, int len, const u8 *hash, const struct fscrypt_name *nm) argument 3223 lookup_znode(struct ubifs_info *c, union ubifs_key *key, int level, int lnum, int offs) argument 3352 is_idx_node_in_tnc(struct ubifs_info *c, union ubifs_key *key, int level, int lnum, int offs) argument 3379 is_leaf_node_in_tnc(struct ubifs_info *c, union ubifs_key *key, int lnum, int offs) argument 3449 ubifs_tnc_has_node(struct ubifs_info *c, union ubifs_key *key, int level, int lnum, int offs, int is_idx) argument 3489 ubifs_dirty_idx_node(struct ubifs_info *c, union ubifs_key *key, int level, int lnum, int offs) argument [all...] |
H A D | gc.c | 72 wbuf->lnum, wbuf->offs + wbuf->used, gc_lnum, 260 err = ubifs_tnc_has_node(c, &snod->key, 0, sleb->lnum, 306 int err, new_lnum = wbuf->lnum, new_offs = wbuf->offs + wbuf->used; 313 err = ubifs_tnc_replace(c, &snod->key, sleb->lnum, 337 if (wbuf->lnum == -1) { 433 ubifs_add_dirt(c, wbuf->lnum, ubifs_auth_node_sz(c)); 496 int err = 0, lnum = lp->lnum; local 500 ubifs_assert(c, c->gc_lnum != lnum); 501 ubifs_assert(c, wbuf->lnum ! 1007 int lnum; local [all...] |
H A D | lpt.c | 384 int lnum = nnode->nbranch[i].lnum; local 386 if (lnum == 0) 387 lnum = c->lpt_last + 1; 388 pack_bits(c, &addr, &pos, lnum - c->lpt_first, c->lpt_lnum_bits); 449 * @lnum: LEB number to which to add dirty space 452 void ubifs_add_lpt_dirt(struct ubifs_info *c, int lnum, int dirty) argument 454 if (!dirty || !lnum) 457 lnum, dirty, c->ltab[lnum 469 set_ltab(struct ubifs_info *c, int lnum, int free, int dirty) argument 602 int lnum, err = 0, node_sz, iopos, i, j, cnt, len, alen, row; local 885 int lnum = pnode->lprops[i].lnum; local 1023 int lnum; local 1085 int lnum = ubifs_unpack_bits(c, &addr, &pos, c->lnum_bits); local 1123 int lnum = nnode->nbranch[i].lnum; local 1185 int i, lnum; local 1208 int err, lnum, offs; local 1276 int err, lnum, offs; local 1375 int lnum = c->lsave[i]; local 1488 ubifs_lpt_lookup(struct ubifs_info *c, int lnum) argument 1603 ubifs_lpt_lookup_dirty(struct ubifs_info *c, int lnum) argument 2133 int ret, lnum = lprops->lnum; local 2262 int lnum = (pnode->num << UBIFS_LPT_FANOUT_SHIFT) + i + local [all...] |
H A D | journal.c | 81 static void ubifs_add_auth_dirt(struct ubifs_info *c, int lnum) argument 84 ubifs_add_dirt(c, lnum, ubifs_auth_node_sz(c)); 100 int err = 0, err1, retries = 0, avail, lnum, offs, squeeze; local 119 if (wbuf->lnum != -1 && avail >= len) 126 lnum = ubifs_find_free_space(c, len, &offs, squeeze); 127 if (lnum >= 0) 130 err = lnum; 142 lnum = ubifs_garbage_collect(c, 0); 143 if (lnum < 0) { 144 err = lnum; 268 write_head(struct ubifs_info *c, int jhead, void *buf, int len, int *lnum, int *offs, int sync) argument 669 int err, dlen, ilen, len, lnum, ino_offs, dent_offs, orphan_added = 0; local 854 int err, lnum, offs, compr_type, out_len, compr_len, auth_len; local 970 int err, lnum, offs; local 1187 int err, dlen1, dlen2, lnum, offs, len, plen = UBIFS_INO_NODE_SZ; local 1356 int err, dlen1, dlen2, ilen, wlen, lnum, offs, len, orphan_added = 0; local 1685 int err, dlen, len, lnum, offs, bit, sz, sync = IS_SYNC(inode); local 1849 int err, xlen, hlen, len, lnum, xent_offs, aligned_xlen, write_len; local 1970 int err, len1, len2, aligned_len, aligned_len1, lnum, offs; local [all...] |
H A D | ubifs.h | 283 * @lnum: LEB number of obsoleted index node 288 int lnum; member in struct:ubifs_old_idx 322 * @lnum: logical eraseblock number 329 int lnum; member in struct:ubifs_scan_leb 339 * @lnum: LEB number 348 int lnum; member in struct:ubifs_gced_idx_leb 436 * @lnum: LEB number of recovered LEB 445 int lnum; member in struct:ubifs_unclean_leb 483 * @lnum: LEB number 491 int lnum; member in struct:ubifs_lprops 598 int lnum; member in struct:ubifs_nbranch 695 int lnum; member in struct:ubifs_wbuf 721 int lnum; member in struct:ubifs_bud 760 int lnum; member in struct:ubifs_zbranch 797 int lnum; member in struct:ubifs_znode 1634 ubifs_bad_hash(const struct ubifs_info *c, const void *node, const u8 *hash, int lnum, int offs) argument [all...] |
H A D | debug.c | 433 pr_err("\tlnum %u\n", le32_to_cpu(ref->lnum)); 546 i, le32_to_cpu(br->lnum), le32_to_cpu(br->offs), 656 c->jheads[i].wbuf.lnum); 659 pr_err("\tbud LEB %d\n", bud->lnum); 662 pr_err("\told bud LEB %d\n", bud->lnum); 665 idx_gc->lnum, idx_gc->unmap); 694 lp->lnum, lp->free, lp->dirty, c->leb_size - spc, spc, 698 lp->lnum, lp->free, lp->dirty, c->leb_size - spc, spc, 747 if (bud->lnum == lp->lnum) { 773 int lnum, err; local 831 ubifs_dump_leb(const struct ubifs_info *c, int lnum) argument 2479 power_cut_emulated(struct ubifs_info *c, int lnum, int write) argument 2594 dbg_leb_write(struct ubifs_info *c, int lnum, const void *buf, int offs, int len) argument 2616 dbg_leb_change(struct ubifs_info *c, int lnum, const void *buf, int len) argument 2633 dbg_leb_unmap(struct ubifs_info *c, int lnum) argument 2649 dbg_leb_map(struct ubifs_info *c, int lnum) argument [all...] |
H A D | tnc_misc.c | 290 int lnum = zzbr->lnum; local 300 err = ubifs_read_node(c, idx, UBIFS_IDX_NODE, len, lnum, offs); 308 ubifs_bad_hash(c, idx, zzbr->hash, lnum, offs); 317 lnum, offs, znode->level, znode->child_cnt); 333 zbr->lnum = le32_to_cpu(br->lnum); 341 if (zbr->lnum < c->main_first || 342 zbr->lnum >= c->leb_cnt || zbr->offs < 0 || 414 ubifs_err(c, "bad indexing node at LEB %d:%d, error %d", lnum, off [all...] |
H A D | sb.c | 284 br->lnum = cpu_to_le32(main_first + DEFAULT_DATA_LEB); 787 * @lnum: the LEB number to fix up 790 * This function reads the contents of the given LEB number @lnum, then fixes 795 static int fixup_leb(struct ubifs_info *c, int lnum, int len) argument 804 dbg_mnt("unmap empty LEB %d", lnum); 805 return ubifs_leb_unmap(c, lnum); 808 dbg_mnt("fixup LEB %d, data len %d", lnum, len); 809 err = ubifs_leb_read(c, lnum, c->sbuf, 0, len, 1); 813 return ubifs_leb_change(c, lnum, c->sbuf, len); 825 int lnum, er local [all...] |
/linux-master/drivers/mtd/ubi/ |
H A D | eba.c | 22 * They are indexed by (@vol_id, @lnum) pairs. 97 * @lnum: logical eraseblock number 104 void ubi_eba_get_ldesc(struct ubi_volume *vol, int lnum, argument 107 ldesc->lnum = lnum; 108 ldesc->pnum = vol->eba_tbl->entries[lnum].pnum; 201 * @lnum: logical eraseblock number 208 int lnum) 223 if (lnum < le->lnum) 207 ltree_lookup(struct ubi_device *ubi, int vol_id, int lnum) argument 246 ltree_add_entry(struct ubi_device *ubi, int vol_id, int lnum) argument 316 leb_read_lock(struct ubi_device *ubi, int vol_id, int lnum) argument 333 leb_read_unlock(struct ubi_device *ubi, int vol_id, int lnum) argument 358 leb_write_lock(struct ubi_device *ubi, int vol_id, int lnum) argument 380 leb_write_trylock(struct ubi_device *ubi, int vol_id, int lnum) argument 409 leb_write_unlock(struct ubi_device *ubi, int vol_id, int lnum) argument 432 ubi_eba_is_mapped(struct ubi_volume *vol, int lnum) argument 447 ubi_eba_unmap_leb(struct ubi_device *ubi, struct ubi_volume *vol, int lnum) argument 494 check_mapping(struct ubi_device *ubi, struct ubi_volume *vol, int lnum, int *pnum) argument 566 check_mapping(struct ubi_device *ubi, struct ubi_volume *vol, int lnum, int *pnum) argument 592 ubi_eba_read_leb(struct ubi_device *ubi, struct ubi_volume *vol, int lnum, void *buf, int offset, int len, int check) argument 744 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 803 try_recover_peb(struct ubi_volume *vol, int pnum, int lnum, const void *buf, int offset, int len, struct ubi_vid_io_buf *vidb, bool *retry) argument 899 recover_peb(struct ubi_device *ubi, int pnum, int vol_id, int lnum, const void *buf, int offset, int len) argument 941 try_write_vid_and_data(struct ubi_volume *vol, int lnum, struct ubi_vid_io_buf *vidb, const void *buf, int offset, int len) argument 1013 ubi_eba_write_leb(struct ubi_device *ubi, struct ubi_volume *vol, int lnum, const void *buf, int offset, int len) argument 1116 ubi_eba_write_leb_st(struct ubi_device *ubi, struct ubi_volume *vol, int lnum, const void *buf, int len, int used_ebs) argument 1194 ubi_eba_atomic_leb_change(struct ubi_device *ubi, struct ubi_volume *vol, int lnum, const void *buf, int len) argument 1310 int err, vol_id, lnum, data_size, aldata_size, idx; local [all...] |
H A D | kapi.c | 382 * @lnum: logical eraseblock number to read from 389 static int leb_read_sanity_check(struct ubi_volume_desc *desc, int lnum, argument 396 if (vol_id < 0 || vol_id >= ubi->vtbl_slots || lnum < 0 || 397 lnum >= vol->used_ebs || offset < 0 || len < 0 || 405 if (lnum == vol->used_ebs - 1 && 419 * @lnum: logical eraseblock number to read from 425 * This function reads data from offset @offset of logical eraseblock @lnum and 443 int ubi_leb_read(struct ubi_volume_desc *desc, int lnum, char *buf, int offset, argument 450 dbg_gen("read %d bytes from LEB %d:%d:%d", len, vol_id, lnum, offset); 452 err = leb_read_sanity_check(desc, lnum, offse 483 ubi_leb_read_sg(struct ubi_volume_desc *desc, int lnum, struct ubi_sgl *sgl, int offset, int len, int check) argument 534 ubi_leb_write(struct ubi_volume_desc *desc, int lnum, const void *buf, int offset, int len) argument 579 ubi_leb_change(struct ubi_volume_desc *desc, int lnum, const void *buf, int len) argument 620 ubi_leb_erase(struct ubi_volume_desc *desc, int lnum) argument 681 ubi_leb_unmap(struct ubi_volume_desc *desc, int lnum) argument 717 ubi_leb_map(struct ubi_volume_desc *desc, int lnum) argument 756 ubi_is_mapped(struct ubi_volume_desc *desc, int lnum) argument 806 ubi_flush(int ubi_num, int vol_id, int lnum) argument [all...] |
H A D | gluebi.c | 156 int err = 0, lnum, offs, bytes_left; local 160 lnum = div_u64_rem(from, mtd->erasesize, &offs); 168 err = ubi_read(gluebi->desc, lnum, buf, offs, to_read); 172 lnum += 1; 196 int err = 0, lnum, offs, bytes_left; local 200 lnum = div_u64_rem(to, mtd->erasesize, &offs); 212 err = ubi_leb_write(gluebi->desc, lnum, buf, offs, to_write); 216 lnum += 1; 236 int err, i, lnum, count; local 242 lnum [all...] |
H A D | upd.c | 174 vol->vol_id, req->lnum, req->bytes); 176 return ubi_eba_atomic_leb_change(ubi, vol, req->lnum, NULL, 0); 181 vol->ch_lnum = req->lnum; 194 * @lnum: logical eraseblock number 219 static int write_leb(struct ubi_device *ubi, struct ubi_volume *vol, int lnum, argument 234 err = ubi_eba_write_leb(ubi, vol, lnum, buf, 0, len); 246 err = ubi_eba_write_leb_st(ubi, vol, lnum, buf, len, used_ebs); 268 int lnum, offs, err = 0, len, to_write = count; local 276 lnum = div_u64_rem(vol->upd_received, vol->usable_leb_size, &offs); 309 err = write_leb(ubi, vol, lnum, vo [all...] |
H A D | attach.c | 174 * vol_id and lnum are set to UBI_UNKNOWN, and the other fields are 190 aeb->lnum = UBI_UNKNOWN; 213 * @lnum: the last used LEB number for the PEB 220 * It stores the @lnum and @vol_id alongside, which can both be 230 int lnum, int ec, int to_head, struct list_head *list) 249 aeb->lnum = lnum; 566 int err, vol_id, lnum; local 573 lnum = be32_to_cpu(vid_hdr->lnum); 229 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 1135 int lnum = be32_to_cpu(vidh->lnum); local [all...] |
H A D | ubi.h | 183 * @lnum: locked logical eraseblock number 186 * the (@vol_id, @lnum) logical eraseblock 196 int lnum; member in struct:ubi_ltree_entry 261 * @lnum: the logical eraseblock number 270 int lnum; member in struct:ubi_eba_leb_desc 663 * @lnum: logical eraseblock number 673 * volume, the @vol_id and @lnum fields are initialized to %UBI_UNKNOWN. 679 int lnum; member in struct:ubi_ainf_peb 792 * @lnum: the logical eraseblock number 807 int lnum; member in struct:ubi_work 869 ubi_leb_valid(struct ubi_volume *vol, int lnum) argument [all...] |
/linux-master/Documentation/trace/ |
H A D | function-graph-fold.vim | 14 function! FunctionGraphFoldExpr(lnum) 15 let line = getline(a:lnum) 39 setlocal foldexpr=FunctionGraphFoldExpr(v:lnum)
|