block2mtd.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493
  1. /*
  2. * $Id: block2mtd.c,v 1.28 2005/03/19 22:40:44 gleixner Exp $
  3. *
  4. * block2mtd.c - create an mtd from a block device
  5. *
  6. * Copyright (C) 2001,2002 Simon Evans <spse@secret.org.uk>
  7. * Copyright (C) 2004,2005 Jörn Engel <joern@wh.fh-wedel.de>
  8. *
  9. * Licence: GPL
  10. */
  11. #include <linux/config.h>
  12. #include <linux/module.h>
  13. #include <linux/fs.h>
  14. #include <linux/blkdev.h>
  15. #include <linux/bio.h>
  16. #include <linux/pagemap.h>
  17. #include <linux/list.h>
  18. #include <linux/init.h>
  19. #include <linux/mtd/mtd.h>
  20. #include <linux/buffer_head.h>
  21. #define VERSION "$Revision: 1.28 $"
  22. #define ERROR(fmt, args...) printk(KERN_ERR "block2mtd: " fmt "\n" , ## args)
  23. #define INFO(fmt, args...) printk(KERN_INFO "block2mtd: " fmt "\n" , ## args)
  24. /* Info for the block device */
  25. struct block2mtd_dev {
  26. struct list_head list;
  27. struct block_device *blkdev;
  28. struct mtd_info mtd;
  29. struct semaphore write_mutex;
  30. };
  31. /* Static info about the MTD, used in cleanup_module */
  32. static LIST_HEAD(blkmtd_device_list);
  33. #define PAGE_READAHEAD 64
  34. void cache_readahead(struct address_space *mapping, int index)
  35. {
  36. filler_t *filler = (filler_t*)mapping->a_ops->readpage;
  37. int i, pagei;
  38. unsigned ret = 0;
  39. unsigned long end_index;
  40. struct page *page;
  41. LIST_HEAD(page_pool);
  42. struct inode *inode = mapping->host;
  43. loff_t isize = i_size_read(inode);
  44. if (!isize) {
  45. INFO("iSize=0 in cache_readahead\n");
  46. return;
  47. }
  48. end_index = ((isize - 1) >> PAGE_CACHE_SHIFT);
  49. read_lock_irq(&mapping->tree_lock);
  50. for (i = 0; i < PAGE_READAHEAD; i++) {
  51. pagei = index + i;
  52. if (pagei > end_index) {
  53. INFO("Overrun end of disk in cache readahead\n");
  54. break;
  55. }
  56. page = radix_tree_lookup(&mapping->page_tree, pagei);
  57. if (page && (!i))
  58. break;
  59. if (page)
  60. continue;
  61. read_unlock_irq(&mapping->tree_lock);
  62. page = page_cache_alloc_cold(mapping);
  63. read_lock_irq(&mapping->tree_lock);
  64. if (!page)
  65. break;
  66. page->index = pagei;
  67. list_add(&page->lru, &page_pool);
  68. ret++;
  69. }
  70. read_unlock_irq(&mapping->tree_lock);
  71. if (ret)
  72. read_cache_pages(mapping, &page_pool, filler, NULL);
  73. }
  74. static struct page* page_readahead(struct address_space *mapping, int index)
  75. {
  76. filler_t *filler = (filler_t*)mapping->a_ops->readpage;
  77. cache_readahead(mapping, index);
  78. return read_cache_page(mapping, index, filler, NULL);
  79. }
  80. /* erase a specified part of the device */
  81. static int _block2mtd_erase(struct block2mtd_dev *dev, loff_t to, size_t len)
  82. {
  83. struct address_space *mapping = dev->blkdev->bd_inode->i_mapping;
  84. struct page *page;
  85. int index = to >> PAGE_SHIFT; // page index
  86. int pages = len >> PAGE_SHIFT;
  87. u_long *p;
  88. u_long *max;
  89. while (pages) {
  90. page = page_readahead(mapping, index);
  91. if (!page)
  92. return -ENOMEM;
  93. if (IS_ERR(page))
  94. return PTR_ERR(page);
  95. max = (u_long*)page_address(page) + PAGE_SIZE;
  96. for (p=(u_long*)page_address(page); p<max; p++)
  97. if (*p != -1UL) {
  98. lock_page(page);
  99. memset(page_address(page), 0xff, PAGE_SIZE);
  100. set_page_dirty(page);
  101. unlock_page(page);
  102. break;
  103. }
  104. page_cache_release(page);
  105. pages--;
  106. index++;
  107. }
  108. return 0;
  109. }
  110. static int block2mtd_erase(struct mtd_info *mtd, struct erase_info *instr)
  111. {
  112. struct block2mtd_dev *dev = mtd->priv;
  113. size_t from = instr->addr;
  114. size_t len = instr->len;
  115. int err;
  116. instr->state = MTD_ERASING;
  117. down(&dev->write_mutex);
  118. err = _block2mtd_erase(dev, from, len);
  119. up(&dev->write_mutex);
  120. if (err) {
  121. ERROR("erase failed err = %d", err);
  122. instr->state = MTD_ERASE_FAILED;
  123. } else
  124. instr->state = MTD_ERASE_DONE;
  125. instr->state = MTD_ERASE_DONE;
  126. mtd_erase_callback(instr);
  127. return err;
  128. }
  129. static int block2mtd_read(struct mtd_info *mtd, loff_t from, size_t len,
  130. size_t *retlen, u_char *buf)
  131. {
  132. struct block2mtd_dev *dev = mtd->priv;
  133. struct page *page;
  134. int index = from >> PAGE_SHIFT;
  135. int offset = from & (PAGE_SIZE-1);
  136. int cpylen;
  137. if (from > mtd->size)
  138. return -EINVAL;
  139. if (from + len > mtd->size)
  140. len = mtd->size - from;
  141. if (retlen)
  142. *retlen = 0;
  143. while (len) {
  144. if ((offset + len) > PAGE_SIZE)
  145. cpylen = PAGE_SIZE - offset; // multiple pages
  146. else
  147. cpylen = len; // this page
  148. len = len - cpylen;
  149. // Get page
  150. page = page_readahead(dev->blkdev->bd_inode->i_mapping, index);
  151. if (!page)
  152. return -ENOMEM;
  153. if (IS_ERR(page))
  154. return PTR_ERR(page);
  155. memcpy(buf, page_address(page) + offset, cpylen);
  156. page_cache_release(page);
  157. if (retlen)
  158. *retlen += cpylen;
  159. buf += cpylen;
  160. offset = 0;
  161. index++;
  162. }
  163. return 0;
  164. }
  165. /* write data to the underlying device */
  166. static int _block2mtd_write(struct block2mtd_dev *dev, const u_char *buf,
  167. loff_t to, size_t len, size_t *retlen)
  168. {
  169. struct page *page;
  170. struct address_space *mapping = dev->blkdev->bd_inode->i_mapping;
  171. int index = to >> PAGE_SHIFT; // page index
  172. int offset = to & ~PAGE_MASK; // page offset
  173. int cpylen;
  174. if (retlen)
  175. *retlen = 0;
  176. while (len) {
  177. if ((offset+len) > PAGE_SIZE)
  178. cpylen = PAGE_SIZE - offset; // multiple pages
  179. else
  180. cpylen = len; // this page
  181. len = len - cpylen;
  182. // Get page
  183. page = page_readahead(mapping, index);
  184. if (!page)
  185. return -ENOMEM;
  186. if (IS_ERR(page))
  187. return PTR_ERR(page);
  188. if (memcmp(page_address(page)+offset, buf, cpylen)) {
  189. lock_page(page);
  190. memcpy(page_address(page) + offset, buf, cpylen);
  191. set_page_dirty(page);
  192. unlock_page(page);
  193. }
  194. page_cache_release(page);
  195. if (retlen)
  196. *retlen += cpylen;
  197. buf += cpylen;
  198. offset = 0;
  199. index++;
  200. }
  201. return 0;
  202. }
  203. static int block2mtd_write(struct mtd_info *mtd, loff_t to, size_t len,
  204. size_t *retlen, const u_char *buf)
  205. {
  206. struct block2mtd_dev *dev = mtd->priv;
  207. int err;
  208. if (!len)
  209. return 0;
  210. if (to >= mtd->size)
  211. return -ENOSPC;
  212. if (to + len > mtd->size)
  213. len = mtd->size - to;
  214. down(&dev->write_mutex);
  215. err = _block2mtd_write(dev, buf, to, len, retlen);
  216. up(&dev->write_mutex);
  217. if (err > 0)
  218. err = 0;
  219. return err;
  220. }
  221. /* sync the device - wait until the write queue is empty */
  222. static void block2mtd_sync(struct mtd_info *mtd)
  223. {
  224. struct block2mtd_dev *dev = mtd->priv;
  225. sync_blockdev(dev->blkdev);
  226. return;
  227. }
  228. static void block2mtd_free_device(struct block2mtd_dev *dev)
  229. {
  230. if (!dev)
  231. return;
  232. kfree(dev->mtd.name);
  233. if (dev->blkdev) {
  234. invalidate_inode_pages(dev->blkdev->bd_inode->i_mapping);
  235. close_bdev_excl(dev->blkdev);
  236. }
  237. kfree(dev);
  238. }
  239. /* FIXME: ensure that mtd->size % erase_size == 0 */
  240. static struct block2mtd_dev *add_device(char *devname, int erase_size)
  241. {
  242. struct block_device *bdev;
  243. struct block2mtd_dev *dev;
  244. if (!devname)
  245. return NULL;
  246. dev = kmalloc(sizeof(struct block2mtd_dev), GFP_KERNEL);
  247. if (!dev)
  248. return NULL;
  249. memset(dev, 0, sizeof(*dev));
  250. /* Get a handle on the device */
  251. bdev = open_bdev_excl(devname, O_RDWR, NULL);
  252. if (IS_ERR(bdev)) {
  253. ERROR("error: cannot open device %s", devname);
  254. goto devinit_err;
  255. }
  256. dev->blkdev = bdev;
  257. if (MAJOR(bdev->bd_dev) == MTD_BLOCK_MAJOR) {
  258. ERROR("attempting to use an MTD device as a block device");
  259. goto devinit_err;
  260. }
  261. init_MUTEX(&dev->write_mutex);
  262. /* Setup the MTD structure */
  263. /* make the name contain the block device in */
  264. dev->mtd.name = kmalloc(sizeof("block2mtd: ") + strlen(devname),
  265. GFP_KERNEL);
  266. if (!dev->mtd.name)
  267. goto devinit_err;
  268. sprintf(dev->mtd.name, "block2mtd: %s", devname);
  269. dev->mtd.size = dev->blkdev->bd_inode->i_size & PAGE_MASK;
  270. dev->mtd.erasesize = erase_size;
  271. dev->mtd.type = MTD_RAM;
  272. dev->mtd.flags = MTD_CAP_RAM;
  273. dev->mtd.erase = block2mtd_erase;
  274. dev->mtd.write = block2mtd_write;
  275. dev->mtd.writev = default_mtd_writev;
  276. dev->mtd.sync = block2mtd_sync;
  277. dev->mtd.read = block2mtd_read;
  278. dev->mtd.readv = default_mtd_readv;
  279. dev->mtd.priv = dev;
  280. dev->mtd.owner = THIS_MODULE;
  281. if (add_mtd_device(&dev->mtd)) {
  282. /* Device didnt get added, so free the entry */
  283. goto devinit_err;
  284. }
  285. list_add(&dev->list, &blkmtd_device_list);
  286. INFO("mtd%d: [%s] erase_size = %dKiB [%d]", dev->mtd.index,
  287. dev->mtd.name + strlen("blkmtd: "),
  288. dev->mtd.erasesize >> 10, dev->mtd.erasesize);
  289. return dev;
  290. devinit_err:
  291. block2mtd_free_device(dev);
  292. return NULL;
  293. }
  294. static int ustrtoul(const char *cp, char **endp, unsigned int base)
  295. {
  296. unsigned long result = simple_strtoul(cp, endp, base);
  297. switch (**endp) {
  298. case 'G' :
  299. result *= 1024;
  300. case 'M':
  301. result *= 1024;
  302. case 'k':
  303. result *= 1024;
  304. /* By dwmw2 editorial decree, "ki", "Mi" or "Gi" are to be used. */
  305. if ((*endp)[1] == 'i')
  306. (*endp) += 2;
  307. }
  308. return result;
  309. }
  310. static int parse_num(size_t *num, const char *token)
  311. {
  312. char *endp;
  313. size_t n;
  314. n = (size_t) ustrtoul(token, &endp, 0);
  315. if (*endp)
  316. return -EINVAL;
  317. *num = n;
  318. return 0;
  319. }
  320. static int parse_name(char **pname, const char *token, size_t limit)
  321. {
  322. size_t len;
  323. char *name;
  324. len = strlen(token) + 1;
  325. if (len > limit)
  326. return -ENOSPC;
  327. name = kmalloc(len, GFP_KERNEL);
  328. if (!name)
  329. return -ENOMEM;
  330. strcpy(name, token);
  331. *pname = name;
  332. return 0;
  333. }
  334. static inline void kill_final_newline(char *str)
  335. {
  336. char *newline = strrchr(str, '\n');
  337. if (newline && !newline[1])
  338. *newline = 0;
  339. }
  340. #define parse_err(fmt, args...) do { \
  341. ERROR("block2mtd: " fmt "\n", ## args); \
  342. return 0; \
  343. } while (0)
  344. static int block2mtd_setup(const char *val, struct kernel_param *kp)
  345. {
  346. char buf[80+12], *str=buf; /* 80 for device, 12 for erase size */
  347. char *token[2];
  348. char *name;
  349. size_t erase_size = PAGE_SIZE;
  350. int i, ret;
  351. if (strnlen(val, sizeof(buf)) >= sizeof(buf))
  352. parse_err("parameter too long");
  353. strcpy(str, val);
  354. kill_final_newline(str);
  355. for (i=0; i<2; i++)
  356. token[i] = strsep(&str, ",");
  357. if (str)
  358. parse_err("too many arguments");
  359. if (!token[0])
  360. parse_err("no argument");
  361. ret = parse_name(&name, token[0], 80);
  362. if (ret == -ENOMEM)
  363. parse_err("out of memory");
  364. if (ret == -ENOSPC)
  365. parse_err("name too long");
  366. if (ret)
  367. return 0;
  368. if (token[1]) {
  369. ret = parse_num(&erase_size, token[1]);
  370. if (ret)
  371. parse_err("illegal erase size");
  372. }
  373. add_device(name, erase_size);
  374. return 0;
  375. }
  376. module_param_call(block2mtd, block2mtd_setup, NULL, NULL, 0200);
  377. MODULE_PARM_DESC(block2mtd, "Device to use. \"block2mtd=<dev>[,<erasesize>]\"");
  378. static int __init block2mtd_init(void)
  379. {
  380. INFO("version " VERSION);
  381. return 0;
  382. }
  383. static void __devexit block2mtd_exit(void)
  384. {
  385. struct list_head *pos, *next;
  386. /* Remove the MTD devices */
  387. list_for_each_safe(pos, next, &blkmtd_device_list) {
  388. struct block2mtd_dev *dev = list_entry(pos, typeof(*dev), list);
  389. block2mtd_sync(&dev->mtd);
  390. del_mtd_device(&dev->mtd);
  391. INFO("mtd%d: [%s] removed", dev->mtd.index,
  392. dev->mtd.name + strlen("blkmtd: "));
  393. list_del(&dev->list);
  394. block2mtd_free_device(dev);
  395. }
  396. }
  397. module_init(block2mtd_init);
  398. module_exit(block2mtd_exit);
  399. MODULE_LICENSE("GPL");
  400. MODULE_AUTHOR("Simon Evans <spse@secret.org.uk> and others");
  401. MODULE_DESCRIPTION("Emulate an MTD using a block device");