ubi.h 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594
  1. /*
  2. * Copyright (c) International Business Machines Corp., 2006
  3. * Copyright (c) Nokia Corporation, 2006, 2007
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation; either version 2 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
  13. * the GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, write to the Free Software
  17. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  18. *
  19. * Author: Artem Bityutskiy (Битюцкий Артём)
  20. */
  21. #ifndef __UBI_UBI_H__
  22. #define __UBI_UBI_H__
  23. #include <linux/init.h>
  24. #include <linux/types.h>
  25. #include <linux/list.h>
  26. #include <linux/rbtree.h>
  27. #include <linux/sched.h>
  28. #include <linux/wait.h>
  29. #include <linux/mutex.h>
  30. #include <linux/rwsem.h>
  31. #include <linux/spinlock.h>
  32. #include <linux/fs.h>
  33. #include <linux/cdev.h>
  34. #include <linux/device.h>
  35. #include <linux/string.h>
  36. #include <linux/vmalloc.h>
  37. #include <linux/mtd/mtd.h>
  38. #include <mtd/ubi-header.h>
  39. #include <linux/mtd/ubi.h>
  40. #include "scan.h"
  41. #include "debug.h"
  42. /* Maximum number of supported UBI devices */
  43. #define UBI_MAX_DEVICES 32
  44. /* UBI name used for character devices, sysfs, etc */
  45. #define UBI_NAME_STR "ubi"
  46. /* Normal UBI messages */
  47. #define ubi_msg(fmt, ...) printk(KERN_NOTICE "UBI: " fmt "\n", ##__VA_ARGS__)
  48. /* UBI warning messages */
  49. #define ubi_warn(fmt, ...) printk(KERN_WARNING "UBI warning: %s: " fmt "\n", \
  50. __FUNCTION__, ##__VA_ARGS__)
  51. /* UBI error messages */
  52. #define ubi_err(fmt, ...) printk(KERN_ERR "UBI error: %s: " fmt "\n", \
  53. __FUNCTION__, ##__VA_ARGS__)
  54. /* Lowest number PEBs reserved for bad PEB handling */
  55. #define MIN_RESEVED_PEBS 2
  56. /* Background thread name pattern */
  57. #define UBI_BGT_NAME_PATTERN "ubi_bgt%dd"
  58. /* This marker in the EBA table means that the LEB is um-mapped */
  59. #define UBI_LEB_UNMAPPED -1
  60. /*
  61. * In case of errors, UBI tries to repeat the operation several times before
  62. * returning error. The below constant defines how many times UBI re-tries.
  63. */
  64. #define UBI_IO_RETRIES 3
  65. /*
  66. * Error codes returned by the I/O unit.
  67. *
  68. * UBI_IO_PEB_EMPTY: the physical eraseblock is empty, i.e. it contains only
  69. * 0xFF bytes
  70. * UBI_IO_PEB_FREE: the physical eraseblock is free, i.e. it contains only a
  71. * valid erase counter header, and the rest are %0xFF bytes
  72. * UBI_IO_BAD_EC_HDR: the erase counter header is corrupted (bad magic or CRC)
  73. * UBI_IO_BAD_VID_HDR: the volume identifier header is corrupted (bad magic or
  74. * CRC)
  75. * UBI_IO_BITFLIPS: bit-flips were detected and corrected
  76. */
  77. enum {
  78. UBI_IO_PEB_EMPTY = 1,
  79. UBI_IO_PEB_FREE,
  80. UBI_IO_BAD_EC_HDR,
  81. UBI_IO_BAD_VID_HDR,
  82. UBI_IO_BITFLIPS
  83. };
  84. /**
  85. * struct ubi_wl_entry - wear-leveling entry.
  86. * @rb: link in the corresponding RB-tree
  87. * @ec: erase counter
  88. * @pnum: physical eraseblock number
  89. *
  90. * This data structure is used in the WL unit. Each physical eraseblock has a
  91. * corresponding &struct wl_entry object which may be kept in different
  92. * RB-trees. See WL unit for details.
  93. */
  94. struct ubi_wl_entry {
  95. struct rb_node rb;
  96. int ec;
  97. int pnum;
  98. };
  99. /**
  100. * struct ubi_ltree_entry - an entry in the lock tree.
  101. * @rb: links RB-tree nodes
  102. * @vol_id: volume ID of the locked logical eraseblock
  103. * @lnum: locked logical eraseblock number
  104. * @users: how many tasks are using this logical eraseblock or wait for it
  105. * @mutex: read/write mutex to implement read/write access serialization to
  106. * the (@vol_id, @lnum) logical eraseblock
  107. *
  108. * This data structure is used in the EBA unit to implement per-LEB locking.
  109. * When a logical eraseblock is being locked - corresponding
  110. * &struct ubi_ltree_entry object is inserted to the lock tree (@ubi->ltree).
  111. * See EBA unit for details.
  112. */
  113. struct ubi_ltree_entry {
  114. struct rb_node rb;
  115. int vol_id;
  116. int lnum;
  117. int users;
  118. struct rw_semaphore mutex;
  119. };
  120. struct ubi_volume_desc;
  121. /**
  122. * struct ubi_volume - UBI volume description data structure.
  123. * @dev: device object to make use of the the Linux device model
  124. * @cdev: character device object to create character device
  125. * @ubi: reference to the UBI device description object
  126. * @vol_id: volume ID
  127. * @readers: number of users holding this volume in read-only mode
  128. * @writers: number of users holding this volume in read-write mode
  129. * @exclusive: whether somebody holds this volume in exclusive mode
  130. * @removed: if the volume was removed
  131. * @checked: if this static volume was checked
  132. *
  133. * @reserved_pebs: how many physical eraseblocks are reserved for this volume
  134. * @vol_type: volume type (%UBI_DYNAMIC_VOLUME or %UBI_STATIC_VOLUME)
  135. * @usable_leb_size: logical eraseblock size without padding
  136. * @used_ebs: how many logical eraseblocks in this volume contain data
  137. * @last_eb_bytes: how many bytes are stored in the last logical eraseblock
  138. * @used_bytes: how many bytes of data this volume contains
  139. * @upd_marker: non-zero if the update marker is set for this volume
  140. * @corrupted: non-zero if the volume is corrupted (static volumes only)
  141. * @alignment: volume alignment
  142. * @data_pad: how many bytes are not used at the end of physical eraseblocks to
  143. * satisfy the requested alignment
  144. * @name_len: volume name length
  145. * @name: volume name
  146. *
  147. * @updating: whether the volume is being updated
  148. * @upd_ebs: how many eraseblocks are expected to be updated
  149. * @upd_bytes: how many bytes are expected to be received
  150. * @upd_received: how many update bytes were already received
  151. * @upd_buf: update buffer which is used to collect update data
  152. *
  153. * @eba_tbl: EBA table of this volume (LEB->PEB mapping)
  154. *
  155. * @gluebi_desc: gluebi UBI volume descriptor
  156. * @gluebi_refcount: reference count of the gluebi MTD device
  157. * @gluebi_mtd: MTD device description object of the gluebi MTD device
  158. *
  159. * The @corrupted field indicates that the volume's contents is corrupted.
  160. * Since UBI protects only static volumes, this field is not relevant to
  161. * dynamic volumes - it is user's responsibility to assure their data
  162. * integrity.
  163. *
  164. * The @upd_marker flag indicates that this volume is either being updated at
  165. * the moment or is damaged because of an unclean reboot.
  166. */
  167. struct ubi_volume {
  168. struct device dev;
  169. struct cdev cdev;
  170. struct ubi_device *ubi;
  171. int vol_id;
  172. int readers;
  173. int writers;
  174. int exclusive;
  175. int removed;
  176. int checked;
  177. int reserved_pebs;
  178. int vol_type;
  179. int usable_leb_size;
  180. int used_ebs;
  181. int last_eb_bytes;
  182. long long used_bytes;
  183. int upd_marker;
  184. int corrupted;
  185. int alignment;
  186. int data_pad;
  187. int name_len;
  188. char name[UBI_VOL_NAME_MAX+1];
  189. int updating;
  190. int upd_ebs;
  191. long long upd_bytes;
  192. long long upd_received;
  193. void *upd_buf;
  194. int *eba_tbl;
  195. #ifdef CONFIG_MTD_UBI_GLUEBI
  196. /* Gluebi-related stuff may be compiled out */
  197. struct ubi_volume_desc *gluebi_desc;
  198. int gluebi_refcount;
  199. struct mtd_info gluebi_mtd;
  200. #endif
  201. };
  202. /**
  203. * struct ubi_volume_desc - descriptor of the UBI volume returned when it is
  204. * opened.
  205. * @vol: reference to the corresponding volume description object
  206. * @mode: open mode (%UBI_READONLY, %UBI_READWRITE, or %UBI_EXCLUSIVE)
  207. */
  208. struct ubi_volume_desc {
  209. struct ubi_volume *vol;
  210. int mode;
  211. };
  212. struct ubi_wl_entry;
  213. /**
  214. * struct ubi_device - UBI device description structure
  215. * @dev: class device object to use the the Linux device model
  216. * @cdev: character device object to create character device
  217. * @ubi_num: UBI device number
  218. * @ubi_name: UBI device name
  219. * @vol_count: number of volumes in this UBI device
  220. * @volumes: volumes of this UBI device
  221. * @volumes_lock: protects @volumes, @rsvd_pebs, @avail_pebs, beb_rsvd_pebs,
  222. * @beb_rsvd_level, @bad_peb_count, @good_peb_count, @vol_count, @vol->readers,
  223. * @vol->writers, @vol->exclusive, @vol->removed, @vol->mapping and
  224. * @vol->eba_tbl.
  225. *
  226. * @rsvd_pebs: count of reserved physical eraseblocks
  227. * @avail_pebs: count of available physical eraseblocks
  228. * @beb_rsvd_pebs: how many physical eraseblocks are reserved for bad PEB
  229. * handling
  230. * @beb_rsvd_level: normal level of PEBs reserved for bad PEB handling
  231. *
  232. * @vtbl_slots: how many slots are available in the volume table
  233. * @vtbl_size: size of the volume table in bytes
  234. * @vtbl: in-RAM volume table copy
  235. * @volumes_mutex: protects on-flash volume table and serializes volume
  236. * changes, like creation, deletion, update, resize
  237. *
  238. * @max_ec: current highest erase counter value
  239. * @mean_ec: current mean erase counter value
  240. *
  241. * @global_sqnum: global sequence number
  242. * @ltree_lock: protects the lock tree and @global_sqnum
  243. * @ltree: the lock tree
  244. * @alc_mutex: serializes "atomic LEB change" operations
  245. *
  246. * @used: RB-tree of used physical eraseblocks
  247. * @free: RB-tree of free physical eraseblocks
  248. * @scrub: RB-tree of physical eraseblocks which need scrubbing
  249. * @prot: protection trees
  250. * @prot.pnum: protection tree indexed by physical eraseblock numbers
  251. * @prot.aec: protection tree indexed by absolute erase counter value
  252. * @wl_lock: protects the @used, @free, @prot, @lookuptbl, @abs_ec, @move_from,
  253. * @move_to, @move_to_put @erase_pending, @wl_scheduled, and @works
  254. * fields
  255. * @wl_scheduled: non-zero if the wear-leveling was scheduled
  256. * @lookuptbl: a table to quickly find a &struct ubi_wl_entry object for any
  257. * physical eraseblock
  258. * @abs_ec: absolute erase counter
  259. * @move_from: physical eraseblock from where the data is being moved
  260. * @move_to: physical eraseblock where the data is being moved to
  261. * @move_from_put: if the "from" PEB was put
  262. * @move_to_put: if the "to" PEB was put
  263. * @works: list of pending works
  264. * @works_count: count of pending works
  265. * @bgt_thread: background thread description object
  266. * @thread_enabled: if the background thread is enabled
  267. * @bgt_name: background thread name
  268. *
  269. * @flash_size: underlying MTD device size (in bytes)
  270. * @peb_count: count of physical eraseblocks on the MTD device
  271. * @peb_size: physical eraseblock size
  272. * @bad_peb_count: count of bad physical eraseblocks
  273. * @good_peb_count: count of good physical eraseblocks
  274. * @min_io_size: minimal input/output unit size of the underlying MTD device
  275. * @hdrs_min_io_size: minimal I/O unit size used for VID and EC headers
  276. * @ro_mode: if the UBI device is in read-only mode
  277. * @leb_size: logical eraseblock size
  278. * @leb_start: starting offset of logical eraseblocks within physical
  279. * eraseblocks
  280. * @ec_hdr_alsize: size of the EC header aligned to @hdrs_min_io_size
  281. * @vid_hdr_alsize: size of the VID header aligned to @hdrs_min_io_size
  282. * @vid_hdr_offset: starting offset of the volume identifier header (might be
  283. * unaligned)
  284. * @vid_hdr_aloffset: starting offset of the VID header aligned to
  285. * @hdrs_min_io_size
  286. * @vid_hdr_shift: contains @vid_hdr_offset - @vid_hdr_aloffset
  287. * @bad_allowed: whether the MTD device admits of bad physical eraseblocks or
  288. * not
  289. * @mtd: MTD device descriptor
  290. *
  291. * @peb_buf1: a buffer of PEB size used for different purposes
  292. * @peb_buf2: another buffer of PEB size used for different purposes
  293. * @buf_mutex: proptects @peb_buf1 and @peb_buf2
  294. * @dbg_peb_buf: buffer of PEB size used for debugging
  295. * @dbg_buf_mutex: proptects @dbg_peb_buf
  296. */
  297. struct ubi_device {
  298. struct cdev cdev;
  299. struct device dev;
  300. int ubi_num;
  301. char ubi_name[sizeof(UBI_NAME_STR)+5];
  302. int vol_count;
  303. struct ubi_volume *volumes[UBI_MAX_VOLUMES+UBI_INT_VOL_COUNT];
  304. spinlock_t volumes_lock;
  305. int rsvd_pebs;
  306. int avail_pebs;
  307. int beb_rsvd_pebs;
  308. int beb_rsvd_level;
  309. int vtbl_slots;
  310. int vtbl_size;
  311. struct ubi_vtbl_record *vtbl;
  312. struct mutex volumes_mutex;
  313. int max_ec;
  314. int mean_ec;
  315. /* EBA unit's stuff */
  316. unsigned long long global_sqnum;
  317. spinlock_t ltree_lock;
  318. struct rb_root ltree;
  319. struct mutex alc_mutex;
  320. /* Wear-leveling unit's stuff */
  321. struct rb_root used;
  322. struct rb_root free;
  323. struct rb_root scrub;
  324. struct {
  325. struct rb_root pnum;
  326. struct rb_root aec;
  327. } prot;
  328. spinlock_t wl_lock;
  329. int wl_scheduled;
  330. struct ubi_wl_entry **lookuptbl;
  331. unsigned long long abs_ec;
  332. struct ubi_wl_entry *move_from;
  333. struct ubi_wl_entry *move_to;
  334. int move_from_put;
  335. int move_to_put;
  336. struct list_head works;
  337. int works_count;
  338. struct task_struct *bgt_thread;
  339. int thread_enabled;
  340. char bgt_name[sizeof(UBI_BGT_NAME_PATTERN)+2];
  341. /* I/O unit's stuff */
  342. long long flash_size;
  343. int peb_count;
  344. int peb_size;
  345. int bad_peb_count;
  346. int good_peb_count;
  347. int min_io_size;
  348. int hdrs_min_io_size;
  349. int ro_mode;
  350. int leb_size;
  351. int leb_start;
  352. int ec_hdr_alsize;
  353. int vid_hdr_alsize;
  354. int vid_hdr_offset;
  355. int vid_hdr_aloffset;
  356. int vid_hdr_shift;
  357. int bad_allowed;
  358. struct mtd_info *mtd;
  359. void *peb_buf1;
  360. void *peb_buf2;
  361. struct mutex buf_mutex;
  362. #ifdef CONFIG_MTD_UBI_DEBUG
  363. void *dbg_peb_buf;
  364. struct mutex dbg_buf_mutex;
  365. #endif
  366. };
  367. extern struct kmem_cache *ubi_ltree_slab;
  368. extern struct kmem_cache *ubi_wl_entry_slab;
  369. extern struct file_operations ubi_cdev_operations;
  370. extern struct file_operations ubi_vol_cdev_operations;
  371. extern struct ubi_device *ubi_devices[];
  372. extern struct class *ubi_class;
  373. /* vtbl.c */
  374. int ubi_change_vtbl_record(struct ubi_device *ubi, int idx,
  375. struct ubi_vtbl_record *vtbl_rec);
  376. int ubi_read_volume_table(struct ubi_device *ubi, struct ubi_scan_info *si);
  377. /* vmt.c */
  378. int ubi_create_volume(struct ubi_device *ubi, struct ubi_mkvol_req *req);
  379. int ubi_remove_volume(struct ubi_volume_desc *desc);
  380. int ubi_resize_volume(struct ubi_volume_desc *desc, int reserved_pebs);
  381. int ubi_add_volume(struct ubi_device *ubi, struct ubi_volume *vol);
  382. void ubi_free_volume(struct ubi_device *ubi, struct ubi_volume *vol);
  383. /* upd.c */
  384. int ubi_start_update(struct ubi_device *ubi, int vol_id, long long bytes);
  385. int ubi_more_update_data(struct ubi_device *ubi, int vol_id,
  386. const void __user *buf, int count);
  387. /* misc.c */
  388. int ubi_calc_data_len(const struct ubi_device *ubi, const void *buf, int length);
  389. int ubi_check_volume(struct ubi_device *ubi, int vol_id);
  390. void ubi_calculate_reserved(struct ubi_device *ubi);
  391. /* gluebi.c */
  392. #ifdef CONFIG_MTD_UBI_GLUEBI
  393. int ubi_create_gluebi(struct ubi_device *ubi, struct ubi_volume *vol);
  394. int ubi_destroy_gluebi(struct ubi_volume *vol);
  395. void ubi_gluebi_updated(struct ubi_volume *vol);
  396. #else
  397. #define ubi_create_gluebi(ubi, vol) 0
  398. #define ubi_destroy_gluebi(vol) 0
  399. #define ubi_gluebi_updated(vol)
  400. #endif
  401. /* eba.c */
  402. int ubi_eba_unmap_leb(struct ubi_device *ubi, struct ubi_volume *vol,
  403. int lnum);
  404. int ubi_eba_read_leb(struct ubi_device *ubi, struct ubi_volume *vol, int lnum,
  405. void *buf, int offset, int len, int check);
  406. int ubi_eba_write_leb(struct ubi_device *ubi, struct ubi_volume *vol, int lnum,
  407. const void *buf, int offset, int len, int dtype);
  408. int ubi_eba_write_leb_st(struct ubi_device *ubi, struct ubi_volume *vol,
  409. int lnum, const void *buf, int len, int dtype,
  410. int used_ebs);
  411. int ubi_eba_atomic_leb_change(struct ubi_device *ubi, struct ubi_volume *vol,
  412. int lnum, const void *buf, int len, int dtype);
  413. int ubi_eba_copy_leb(struct ubi_device *ubi, int from, int to,
  414. struct ubi_vid_hdr *vid_hdr);
  415. int ubi_eba_init_scan(struct ubi_device *ubi, struct ubi_scan_info *si);
  416. void ubi_eba_close(const struct ubi_device *ubi);
  417. /* wl.c */
  418. int ubi_wl_get_peb(struct ubi_device *ubi, int dtype);
  419. int ubi_wl_put_peb(struct ubi_device *ubi, int pnum, int torture);
  420. int ubi_wl_flush(struct ubi_device *ubi);
  421. int ubi_wl_scrub_peb(struct ubi_device *ubi, int pnum);
  422. int ubi_wl_init_scan(struct ubi_device *ubi, struct ubi_scan_info *si);
  423. void ubi_wl_close(struct ubi_device *ubi);
  424. /* io.c */
  425. int ubi_io_read(const struct ubi_device *ubi, void *buf, int pnum, int offset,
  426. int len);
  427. int ubi_io_write(struct ubi_device *ubi, const void *buf, int pnum, int offset,
  428. int len);
  429. int ubi_io_sync_erase(struct ubi_device *ubi, int pnum, int torture);
  430. int ubi_io_is_bad(const struct ubi_device *ubi, int pnum);
  431. int ubi_io_mark_bad(const struct ubi_device *ubi, int pnum);
  432. int ubi_io_read_ec_hdr(struct ubi_device *ubi, int pnum,
  433. struct ubi_ec_hdr *ec_hdr, int verbose);
  434. int ubi_io_write_ec_hdr(struct ubi_device *ubi, int pnum,
  435. struct ubi_ec_hdr *ec_hdr);
  436. int ubi_io_read_vid_hdr(struct ubi_device *ubi, int pnum,
  437. struct ubi_vid_hdr *vid_hdr, int verbose);
  438. int ubi_io_write_vid_hdr(struct ubi_device *ubi, int pnum,
  439. struct ubi_vid_hdr *vid_hdr);
  440. /*
  441. * ubi_rb_for_each_entry - walk an RB-tree.
  442. * @rb: a pointer to type 'struct rb_node' to to use as a loop counter
  443. * @pos: a pointer to RB-tree entry type to use as a loop counter
  444. * @root: RB-tree's root
  445. * @member: the name of the 'struct rb_node' within the RB-tree entry
  446. */
  447. #define ubi_rb_for_each_entry(rb, pos, root, member) \
  448. for (rb = rb_first(root), \
  449. pos = (rb ? container_of(rb, typeof(*pos), member) : NULL); \
  450. rb; \
  451. rb = rb_next(rb), pos = container_of(rb, typeof(*pos), member))
  452. /**
  453. * ubi_zalloc_vid_hdr - allocate a volume identifier header object.
  454. * @ubi: UBI device description object
  455. * @gfp_flags: GFP flags to allocate with
  456. *
  457. * This function returns a pointer to the newly allocated and zero-filled
  458. * volume identifier header object in case of success and %NULL in case of
  459. * failure.
  460. */
  461. static inline struct ubi_vid_hdr *
  462. ubi_zalloc_vid_hdr(const struct ubi_device *ubi, gfp_t gfp_flags)
  463. {
  464. void *vid_hdr;
  465. vid_hdr = kzalloc(ubi->vid_hdr_alsize, gfp_flags);
  466. if (!vid_hdr)
  467. return NULL;
  468. /*
  469. * VID headers may be stored at un-aligned flash offsets, so we shift
  470. * the pointer.
  471. */
  472. return vid_hdr + ubi->vid_hdr_shift;
  473. }
  474. /**
  475. * ubi_free_vid_hdr - free a volume identifier header object.
  476. * @ubi: UBI device description object
  477. * @vid_hdr: the object to free
  478. */
  479. static inline void ubi_free_vid_hdr(const struct ubi_device *ubi,
  480. struct ubi_vid_hdr *vid_hdr)
  481. {
  482. void *p = vid_hdr;
  483. if (!p)
  484. return;
  485. kfree(p - ubi->vid_hdr_shift);
  486. }
  487. /*
  488. * This function is equivalent to 'ubi_io_read()', but @offset is relative to
  489. * the beginning of the logical eraseblock, not to the beginning of the
  490. * physical eraseblock.
  491. */
  492. static inline int ubi_io_read_data(const struct ubi_device *ubi, void *buf,
  493. int pnum, int offset, int len)
  494. {
  495. ubi_assert(offset >= 0);
  496. return ubi_io_read(ubi, buf, pnum, offset + ubi->leb_start, len);
  497. }
  498. /*
  499. * This function is equivalent to 'ubi_io_write()', but @offset is relative to
  500. * the beginning of the logical eraseblock, not to the beginning of the
  501. * physical eraseblock.
  502. */
  503. static inline int ubi_io_write_data(struct ubi_device *ubi, const void *buf,
  504. int pnum, int offset, int len)
  505. {
  506. ubi_assert(offset >= 0);
  507. return ubi_io_write(ubi, buf, pnum, offset + ubi->leb_start, len);
  508. }
  509. /**
  510. * ubi_ro_mode - switch to read-only mode.
  511. * @ubi: UBI device description object
  512. */
  513. static inline void ubi_ro_mode(struct ubi_device *ubi)
  514. {
  515. ubi->ro_mode = 1;
  516. ubi_warn("switch to read-only mode");
  517. }
  518. /**
  519. * vol_id2idx - get table index by volume ID.
  520. * @ubi: UBI device description object
  521. * @vol_id: volume ID
  522. */
  523. static inline int vol_id2idx(const struct ubi_device *ubi, int vol_id)
  524. {
  525. if (vol_id >= UBI_INTERNAL_VOL_START)
  526. return vol_id - UBI_INTERNAL_VOL_START + ubi->vtbl_slots;
  527. else
  528. return vol_id;
  529. }
  530. /**
  531. * idx2vol_id - get volume ID by table index.
  532. * @ubi: UBI device description object
  533. * @idx: table index
  534. */
  535. static inline int idx2vol_id(const struct ubi_device *ubi, int idx)
  536. {
  537. if (idx >= ubi->vtbl_slots)
  538. return idx - ubi->vtbl_slots + UBI_INTERNAL_VOL_START;
  539. else
  540. return idx;
  541. }
  542. #endif /* !__UBI_UBI_H__ */