mtdpart.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428
  1. /*
  2. * Simple MTD partitioning layer
  3. *
  4. * (C) 2000 Nicolas Pitre <nico@cam.org>
  5. *
  6. * This code is GPL
  7. *
  8. * 02-21-2002 Thomas Gleixner <gleixner@autronix.de>
  9. * added support for read_oob, write_oob
  10. */
  11. #include <common.h>
  12. #include <malloc.h>
  13. #include <asm/errno.h>
  14. #include <linux/types.h>
  15. #include <linux/list.h>
  16. #include <linux/mtd/mtd.h>
  17. #include <linux/mtd/partitions.h>
  18. #include <linux/compat.h>
  19. /* Our partition linked list */
  20. struct list_head mtd_partitions;
  21. /* Our partition node structure */
  22. struct mtd_part {
  23. struct mtd_info mtd;
  24. struct mtd_info *master;
  25. uint64_t offset;
  26. int index;
  27. struct list_head list;
  28. int registered;
  29. };
  30. /*
  31. * Given a pointer to the MTD object in the mtd_part structure, we can retrieve
  32. * the pointer to that structure with this macro.
  33. */
  34. #define PART(x) ((struct mtd_part *)(x))
  35. /*
  36. * MTD methods which simply translate the effective address and pass through
  37. * to the _real_ device.
  38. */
  39. static int part_read(struct mtd_info *mtd, loff_t from, size_t len,
  40. size_t *retlen, u_char *buf)
  41. {
  42. struct mtd_part *part = PART(mtd);
  43. struct mtd_ecc_stats stats;
  44. int res;
  45. stats = part->master->ecc_stats;
  46. res = mtd_read(part->master, from + part->offset, len, retlen, buf);
  47. if (unlikely(res)) {
  48. if (mtd_is_bitflip(res))
  49. mtd->ecc_stats.corrected += part->master->ecc_stats.corrected - stats.corrected;
  50. if (mtd_is_eccerr(res))
  51. mtd->ecc_stats.failed += part->master->ecc_stats.failed - stats.failed;
  52. }
  53. return res;
  54. }
  55. static int part_read_oob(struct mtd_info *mtd, loff_t from,
  56. struct mtd_oob_ops *ops)
  57. {
  58. struct mtd_part *part = PART(mtd);
  59. int res;
  60. if (from >= mtd->size)
  61. return -EINVAL;
  62. if (ops->datbuf && from + ops->len > mtd->size)
  63. return -EINVAL;
  64. res = mtd_read_oob(part->master, from + part->offset, ops);
  65. if (unlikely(res)) {
  66. if (mtd_is_bitflip(res))
  67. mtd->ecc_stats.corrected++;
  68. if (mtd_is_eccerr(res))
  69. mtd->ecc_stats.failed++;
  70. }
  71. return res;
  72. }
  73. static int part_read_user_prot_reg(struct mtd_info *mtd, loff_t from,
  74. size_t len, size_t *retlen, u_char *buf)
  75. {
  76. struct mtd_part *part = PART(mtd);
  77. return mtd_read_user_prot_reg(part->master, from, len, retlen, buf);
  78. }
  79. static int part_get_user_prot_info(struct mtd_info *mtd,
  80. struct otp_info *buf, size_t len)
  81. {
  82. struct mtd_part *part = PART(mtd);
  83. return mtd_get_user_prot_info(part->master, buf, len);
  84. }
  85. static int part_read_fact_prot_reg(struct mtd_info *mtd, loff_t from,
  86. size_t len, size_t *retlen, u_char *buf)
  87. {
  88. struct mtd_part *part = PART(mtd);
  89. return mtd_read_fact_prot_reg(part->master, from, len, retlen, buf);
  90. }
  91. static int part_get_fact_prot_info(struct mtd_info *mtd, struct otp_info *buf,
  92. size_t len)
  93. {
  94. struct mtd_part *part = PART(mtd);
  95. return mtd_get_fact_prot_info(part->master, buf, len);
  96. }
  97. static int part_write(struct mtd_info *mtd, loff_t to, size_t len,
  98. size_t *retlen, const u_char *buf)
  99. {
  100. struct mtd_part *part = PART(mtd);
  101. return mtd_write(part->master, to + part->offset, len, retlen, buf);
  102. }
  103. static int part_write_oob(struct mtd_info *mtd, loff_t to,
  104. struct mtd_oob_ops *ops)
  105. {
  106. struct mtd_part *part = PART(mtd);
  107. if (to >= mtd->size)
  108. return -EINVAL;
  109. if (ops->datbuf && to + ops->len > mtd->size)
  110. return -EINVAL;
  111. return mtd_write_oob(part->master, to + part->offset, ops);
  112. }
  113. static int part_write_user_prot_reg(struct mtd_info *mtd, loff_t from,
  114. size_t len, size_t *retlen, u_char *buf)
  115. {
  116. struct mtd_part *part = PART(mtd);
  117. return mtd_write_user_prot_reg(part->master, from, len, retlen, buf);
  118. }
  119. static int part_lock_user_prot_reg(struct mtd_info *mtd, loff_t from,
  120. size_t len)
  121. {
  122. struct mtd_part *part = PART(mtd);
  123. return mtd_lock_user_prot_reg(part->master, from, len);
  124. }
  125. static int part_erase(struct mtd_info *mtd, struct erase_info *instr)
  126. {
  127. struct mtd_part *part = PART(mtd);
  128. int ret;
  129. instr->addr += part->offset;
  130. ret = mtd_erase(part->master, instr);
  131. if (ret) {
  132. if (instr->fail_addr != MTD_FAIL_ADDR_UNKNOWN)
  133. instr->fail_addr -= part->offset;
  134. instr->addr -= part->offset;
  135. }
  136. return ret;
  137. }
  138. void mtd_erase_callback(struct erase_info *instr)
  139. {
  140. if (instr->mtd->_erase == part_erase) {
  141. struct mtd_part *part = PART(instr->mtd);
  142. if (instr->fail_addr != MTD_FAIL_ADDR_UNKNOWN)
  143. instr->fail_addr -= part->offset;
  144. instr->addr -= part->offset;
  145. }
  146. if (instr->callback)
  147. instr->callback(instr);
  148. }
  149. static int part_lock(struct mtd_info *mtd, loff_t ofs, uint64_t len)
  150. {
  151. struct mtd_part *part = PART(mtd);
  152. return mtd_lock(part->master, ofs + part->offset, len);
  153. }
  154. static int part_unlock(struct mtd_info *mtd, loff_t ofs, uint64_t len)
  155. {
  156. struct mtd_part *part = PART(mtd);
  157. return mtd_unlock(part->master, ofs + part->offset, len);
  158. }
  159. static void part_sync(struct mtd_info *mtd)
  160. {
  161. struct mtd_part *part = PART(mtd);
  162. mtd_sync(part->master);
  163. }
  164. static int part_block_isbad(struct mtd_info *mtd, loff_t ofs)
  165. {
  166. struct mtd_part *part = PART(mtd);
  167. ofs += part->offset;
  168. return mtd_block_isbad(part->master, ofs);
  169. }
  170. static int part_block_markbad(struct mtd_info *mtd, loff_t ofs)
  171. {
  172. struct mtd_part *part = PART(mtd);
  173. int res;
  174. ofs += part->offset;
  175. res = mtd_block_markbad(part->master, ofs);
  176. if (!res)
  177. mtd->ecc_stats.badblocks++;
  178. return res;
  179. }
  180. /*
  181. * This function unregisters and destroy all slave MTD objects which are
  182. * attached to the given master MTD object.
  183. */
  184. int del_mtd_partitions(struct mtd_info *master)
  185. {
  186. struct mtd_part *slave, *next;
  187. list_for_each_entry_safe(slave, next, &mtd_partitions, list)
  188. if (slave->master == master) {
  189. list_del(&slave->list);
  190. if (slave->registered)
  191. del_mtd_device(&slave->mtd);
  192. kfree(slave);
  193. }
  194. return 0;
  195. }
  196. static struct mtd_part *add_one_partition(struct mtd_info *master,
  197. const struct mtd_partition *part, int partno,
  198. uint64_t cur_offset)
  199. {
  200. struct mtd_part *slave;
  201. /* allocate the partition structure */
  202. slave = kzalloc(sizeof(*slave), GFP_KERNEL);
  203. if (!slave) {
  204. printk(KERN_ERR"memory allocation error while creating partitions for \"%s\"\n",
  205. master->name);
  206. del_mtd_partitions(master);
  207. return NULL;
  208. }
  209. list_add(&slave->list, &mtd_partitions);
  210. /* set up the MTD object for this partition */
  211. slave->mtd.type = master->type;
  212. slave->mtd.flags = master->flags & ~part->mask_flags;
  213. slave->mtd.size = part->size;
  214. slave->mtd.writesize = master->writesize;
  215. slave->mtd.oobsize = master->oobsize;
  216. slave->mtd.oobavail = master->oobavail;
  217. slave->mtd.subpage_sft = master->subpage_sft;
  218. slave->mtd.name = part->name;
  219. slave->mtd.owner = master->owner;
  220. slave->mtd._read = part_read;
  221. slave->mtd._write = part_write;
  222. if (master->_read_oob)
  223. slave->mtd._read_oob = part_read_oob;
  224. if (master->_write_oob)
  225. slave->mtd._write_oob = part_write_oob;
  226. if (master->_read_user_prot_reg)
  227. slave->mtd._read_user_prot_reg = part_read_user_prot_reg;
  228. if (master->_read_fact_prot_reg)
  229. slave->mtd._read_fact_prot_reg = part_read_fact_prot_reg;
  230. if (master->_write_user_prot_reg)
  231. slave->mtd._write_user_prot_reg = part_write_user_prot_reg;
  232. if (master->_lock_user_prot_reg)
  233. slave->mtd._lock_user_prot_reg = part_lock_user_prot_reg;
  234. if (master->_get_user_prot_info)
  235. slave->mtd._get_user_prot_info = part_get_user_prot_info;
  236. if (master->_get_fact_prot_info)
  237. slave->mtd._get_fact_prot_info = part_get_fact_prot_info;
  238. if (master->_sync)
  239. slave->mtd._sync = part_sync;
  240. if (master->_lock)
  241. slave->mtd._lock = part_lock;
  242. if (master->_unlock)
  243. slave->mtd._unlock = part_unlock;
  244. if (master->_block_isbad)
  245. slave->mtd._block_isbad = part_block_isbad;
  246. if (master->_block_markbad)
  247. slave->mtd._block_markbad = part_block_markbad;
  248. slave->mtd._erase = part_erase;
  249. slave->master = master;
  250. slave->offset = part->offset;
  251. slave->index = partno;
  252. if (slave->offset == MTDPART_OFS_APPEND)
  253. slave->offset = cur_offset;
  254. if (slave->offset == MTDPART_OFS_NXTBLK) {
  255. slave->offset = cur_offset;
  256. if (mtd_mod_by_eb(cur_offset, master) != 0) {
  257. /* Round up to next erasesize */
  258. slave->offset = (mtd_div_by_eb(cur_offset, master) + 1) * master->erasesize;
  259. debug("Moving partition %d: 0x%012llx -> 0x%012llx\n",
  260. partno, (unsigned long long)cur_offset,
  261. (unsigned long long)slave->offset);
  262. }
  263. }
  264. if (slave->mtd.size == MTDPART_SIZ_FULL)
  265. slave->mtd.size = master->size - slave->offset;
  266. debug("0x%012llx-0x%012llx : \"%s\"\n",
  267. (unsigned long long)slave->offset,
  268. (unsigned long long)(slave->offset + slave->mtd.size),
  269. slave->mtd.name);
  270. /* let's do some sanity checks */
  271. if (slave->offset >= master->size) {
  272. /* let's register it anyway to preserve ordering */
  273. slave->offset = 0;
  274. slave->mtd.size = 0;
  275. printk(KERN_ERR"mtd: partition \"%s\" is out of reach -- disabled\n",
  276. part->name);
  277. goto out_register;
  278. }
  279. if (slave->offset + slave->mtd.size > master->size) {
  280. slave->mtd.size = master->size - slave->offset;
  281. printk(KERN_WARNING"mtd: partition \"%s\" extends beyond the end of device \"%s\" -- size truncated to %#llx\n",
  282. part->name, master->name, (unsigned long long)slave->mtd.size);
  283. }
  284. if (master->numeraseregions > 1) {
  285. /* Deal with variable erase size stuff */
  286. int i, max = master->numeraseregions;
  287. u64 end = slave->offset + slave->mtd.size;
  288. struct mtd_erase_region_info *regions = master->eraseregions;
  289. /* Find the first erase regions which is part of this
  290. * partition. */
  291. for (i = 0; i < max && regions[i].offset <= slave->offset; i++)
  292. ;
  293. /* The loop searched for the region _behind_ the first one */
  294. i--;
  295. /* Pick biggest erasesize */
  296. for (; i < max && regions[i].offset < end; i++) {
  297. if (slave->mtd.erasesize < regions[i].erasesize) {
  298. slave->mtd.erasesize = regions[i].erasesize;
  299. }
  300. }
  301. BUG_ON(slave->mtd.erasesize == 0);
  302. } else {
  303. /* Single erase size */
  304. slave->mtd.erasesize = master->erasesize;
  305. }
  306. if ((slave->mtd.flags & MTD_WRITEABLE) &&
  307. mtd_mod_by_eb(slave->offset, &slave->mtd)) {
  308. /* Doesn't start on a boundary of major erase size */
  309. /* FIXME: Let it be writable if it is on a boundary of
  310. * _minor_ erase size though */
  311. slave->mtd.flags &= ~MTD_WRITEABLE;
  312. printk(KERN_WARNING"mtd: partition \"%s\" doesn't start on an erase block boundary -- force read-only\n",
  313. part->name);
  314. }
  315. if ((slave->mtd.flags & MTD_WRITEABLE) &&
  316. mtd_mod_by_eb(slave->mtd.size, &slave->mtd)) {
  317. slave->mtd.flags &= ~MTD_WRITEABLE;
  318. printk(KERN_WARNING"mtd: partition \"%s\" doesn't end on an erase block -- force read-only\n",
  319. part->name);
  320. }
  321. slave->mtd.ecclayout = master->ecclayout;
  322. if (master->_block_isbad) {
  323. uint64_t offs = 0;
  324. while (offs < slave->mtd.size) {
  325. if (mtd_block_isbad(master, offs + slave->offset))
  326. slave->mtd.ecc_stats.badblocks++;
  327. offs += slave->mtd.erasesize;
  328. }
  329. }
  330. out_register:
  331. if (part->mtdp) {
  332. /* store the object pointer (caller may or may not register it*/
  333. *part->mtdp = &slave->mtd;
  334. slave->registered = 0;
  335. } else {
  336. /* register our partition */
  337. add_mtd_device(&slave->mtd);
  338. slave->registered = 1;
  339. }
  340. return slave;
  341. }
  342. /*
  343. * This function, given a master MTD object and a partition table, creates
  344. * and registers slave MTD objects which are bound to the master according to
  345. * the partition definitions.
  346. *
  347. * We don't register the master, or expect the caller to have done so,
  348. * for reasons of data integrity.
  349. */
  350. int add_mtd_partitions(struct mtd_info *master,
  351. const struct mtd_partition *parts,
  352. int nbparts)
  353. {
  354. struct mtd_part *slave;
  355. uint64_t cur_offset = 0;
  356. int i;
  357. /*
  358. * Need to init the list here, since LIST_INIT() does not
  359. * work on platforms where relocation has problems (like MIPS
  360. * & PPC).
  361. */
  362. if (mtd_partitions.next == NULL)
  363. INIT_LIST_HEAD(&mtd_partitions);
  364. debug("Creating %d MTD partitions on \"%s\":\n", nbparts, master->name);
  365. for (i = 0; i < nbparts; i++) {
  366. slave = add_one_partition(master, parts + i, i, cur_offset);
  367. if (!slave)
  368. return -ENOMEM;
  369. cur_offset = slave->offset + slave->mtd.size;
  370. }
  371. return 0;
  372. }