brd.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * Ram backed block device driver.
  4. *
  5. * Copyright (C) 2007 Nick Piggin
  6. * Copyright (C) 2007 Novell Inc.
  7. *
  8. * Parts derived from drivers/block/rd.c, and drivers/block/loop.c, copyright
  9. * of their respective owners.
  10. */
  11. #include <linux/init.h>
  12. #include <linux/initrd.h>
  13. #include <linux/module.h>
  14. #include <linux/moduleparam.h>
  15. #include <linux/major.h>
  16. #include <linux/blkdev.h>
  17. #include <linux/bio.h>
  18. #include <linux/highmem.h>
  19. #include <linux/mutex.h>
  20. #include <linux/pagemap.h>
  21. #include <linux/radix-tree.h>
  22. #include <linux/fs.h>
  23. #include <linux/slab.h>
  24. #include <linux/backing-dev.h>
  25. #include <linux/debugfs.h>
  26. #include <linux/uaccess.h>
  27. /*
  28. * Each block ramdisk device has a radix_tree brd_pages of pages that stores
  29. * the pages containing the block device's contents. A brd page's ->index is
  30. * its offset in PAGE_SIZE units. This is similar to, but in no way connected
  31. * with, the kernel's pagecache or buffer cache (which sit above our block
  32. * device).
  33. */
  34. struct brd_device {
  35. int brd_number;
  36. struct gendisk *brd_disk;
  37. struct list_head brd_list;
  38. /*
  39. * Backing store of pages and lock to protect it. This is the contents
  40. * of the block device.
  41. */
  42. spinlock_t brd_lock;
  43. struct radix_tree_root brd_pages;
  44. u64 brd_nr_pages;
  45. };
  46. /*
  47. * Look up and return a brd's page for a given sector.
  48. */
  49. static struct page *brd_lookup_page(struct brd_device *brd, sector_t sector)
  50. {
  51. pgoff_t idx;
  52. struct page *page;
  53. /*
  54. * The page lifetime is protected by the fact that we have opened the
  55. * device node -- brd pages will never be deleted under us, so we
  56. * don't need any further locking or refcounting.
  57. *
  58. * This is strictly true for the radix-tree nodes as well (ie. we
  59. * don't actually need the rcu_read_lock()), however that is not a
  60. * documented feature of the radix-tree API so it is better to be
  61. * safe here (we don't have total exclusion from radix tree updates
  62. * here, only deletes).
  63. */
  64. rcu_read_lock();
  65. idx = sector >> PAGE_SECTORS_SHIFT; /* sector to page index */
  66. page = radix_tree_lookup(&brd->brd_pages, idx);
  67. rcu_read_unlock();
  68. BUG_ON(page && page->index != idx);
  69. return page;
  70. }
  71. /*
  72. * Insert a new page for a given sector, if one does not already exist.
  73. */
  74. static int brd_insert_page(struct brd_device *brd, sector_t sector, gfp_t gfp)
  75. {
  76. pgoff_t idx;
  77. struct page *page;
  78. int ret = 0;
  79. page = brd_lookup_page(brd, sector);
  80. if (page)
  81. return 0;
  82. page = alloc_page(gfp | __GFP_ZERO | __GFP_HIGHMEM);
  83. if (!page)
  84. return -ENOMEM;
  85. if (radix_tree_maybe_preload(gfp)) {
  86. __free_page(page);
  87. return -ENOMEM;
  88. }
  89. spin_lock(&brd->brd_lock);
  90. idx = sector >> PAGE_SECTORS_SHIFT;
  91. page->index = idx;
  92. if (radix_tree_insert(&brd->brd_pages, idx, page)) {
  93. __free_page(page);
  94. page = radix_tree_lookup(&brd->brd_pages, idx);
  95. if (!page)
  96. ret = -ENOMEM;
  97. else if (page->index != idx)
  98. ret = -EIO;
  99. } else {
  100. brd->brd_nr_pages++;
  101. }
  102. spin_unlock(&brd->brd_lock);
  103. radix_tree_preload_end();
  104. return ret;
  105. }
  106. /*
  107. * Free all backing store pages and radix tree. This must only be called when
  108. * there are no other users of the device.
  109. */
  110. #define FREE_BATCH 16
  111. static void brd_free_pages(struct brd_device *brd)
  112. {
  113. unsigned long pos = 0;
  114. struct page *pages[FREE_BATCH];
  115. int nr_pages;
  116. do {
  117. int i;
  118. nr_pages = radix_tree_gang_lookup(&brd->brd_pages,
  119. (void **)pages, pos, FREE_BATCH);
  120. for (i = 0; i < nr_pages; i++) {
  121. void *ret;
  122. BUG_ON(pages[i]->index < pos);
  123. pos = pages[i]->index;
  124. ret = radix_tree_delete(&brd->brd_pages, pos);
  125. BUG_ON(!ret || ret != pages[i]);
  126. __free_page(pages[i]);
  127. }
  128. pos++;
  129. /*
  130. * It takes 3.4 seconds to remove 80GiB ramdisk.
  131. * So, we need cond_resched to avoid stalling the CPU.
  132. */
  133. cond_resched();
  134. /*
  135. * This assumes radix_tree_gang_lookup always returns as
  136. * many pages as possible. If the radix-tree code changes,
  137. * so will this have to.
  138. */
  139. } while (nr_pages == FREE_BATCH);
  140. }
  141. /*
  142. * copy_to_brd_setup must be called before copy_to_brd. It may sleep.
  143. */
  144. static int copy_to_brd_setup(struct brd_device *brd, sector_t sector, size_t n,
  145. gfp_t gfp)
  146. {
  147. unsigned int offset = (sector & (PAGE_SECTORS-1)) << SECTOR_SHIFT;
  148. size_t copy;
  149. int ret;
  150. copy = min_t(size_t, n, PAGE_SIZE - offset);
  151. ret = brd_insert_page(brd, sector, gfp);
  152. if (ret)
  153. return ret;
  154. if (copy < n) {
  155. sector += copy >> SECTOR_SHIFT;
  156. ret = brd_insert_page(brd, sector, gfp);
  157. }
  158. return ret;
  159. }
  160. /*
  161. * Copy n bytes from src to the brd starting at sector. Does not sleep.
  162. */
  163. static void copy_to_brd(struct brd_device *brd, const void *src,
  164. sector_t sector, size_t n)
  165. {
  166. struct page *page;
  167. void *dst;
  168. unsigned int offset = (sector & (PAGE_SECTORS-1)) << SECTOR_SHIFT;
  169. size_t copy;
  170. copy = min_t(size_t, n, PAGE_SIZE - offset);
  171. page = brd_lookup_page(brd, sector);
  172. BUG_ON(!page);
  173. dst = kmap_atomic(page);
  174. memcpy(dst + offset, src, copy);
  175. kunmap_atomic(dst);
  176. if (copy < n) {
  177. src += copy;
  178. sector += copy >> SECTOR_SHIFT;
  179. copy = n - copy;
  180. page = brd_lookup_page(brd, sector);
  181. BUG_ON(!page);
  182. dst = kmap_atomic(page);
  183. memcpy(dst, src, copy);
  184. kunmap_atomic(dst);
  185. }
  186. }
  187. /*
  188. * Copy n bytes to dst from the brd starting at sector. Does not sleep.
  189. */
  190. static void copy_from_brd(void *dst, struct brd_device *brd,
  191. sector_t sector, size_t n)
  192. {
  193. struct page *page;
  194. void *src;
  195. unsigned int offset = (sector & (PAGE_SECTORS-1)) << SECTOR_SHIFT;
  196. size_t copy;
  197. copy = min_t(size_t, n, PAGE_SIZE - offset);
  198. page = brd_lookup_page(brd, sector);
  199. if (page) {
  200. src = kmap_atomic(page);
  201. memcpy(dst, src + offset, copy);
  202. kunmap_atomic(src);
  203. } else
  204. memset(dst, 0, copy);
  205. if (copy < n) {
  206. dst += copy;
  207. sector += copy >> SECTOR_SHIFT;
  208. copy = n - copy;
  209. page = brd_lookup_page(brd, sector);
  210. if (page) {
  211. src = kmap_atomic(page);
  212. memcpy(dst, src, copy);
  213. kunmap_atomic(src);
  214. } else
  215. memset(dst, 0, copy);
  216. }
  217. }
  218. /*
  219. * Process a single bvec of a bio.
  220. */
  221. static int brd_do_bvec(struct brd_device *brd, struct page *page,
  222. unsigned int len, unsigned int off, blk_opf_t opf,
  223. sector_t sector)
  224. {
  225. void *mem;
  226. int err = 0;
  227. if (op_is_write(opf)) {
  228. /*
  229. * Must use NOIO because we don't want to recurse back into the
  230. * block or filesystem layers from page reclaim.
  231. */
  232. gfp_t gfp = opf & REQ_NOWAIT ? GFP_NOWAIT : GFP_NOIO;
  233. err = copy_to_brd_setup(brd, sector, len, gfp);
  234. if (err)
  235. goto out;
  236. }
  237. mem = kmap_atomic(page);
  238. if (!op_is_write(opf)) {
  239. copy_from_brd(mem + off, brd, sector, len);
  240. flush_dcache_page(page);
  241. } else {
  242. flush_dcache_page(page);
  243. copy_to_brd(brd, mem + off, sector, len);
  244. }
  245. kunmap_atomic(mem);
  246. out:
  247. return err;
  248. }
  249. static void brd_submit_bio(struct bio *bio)
  250. {
  251. struct brd_device *brd = bio->bi_bdev->bd_disk->private_data;
  252. sector_t sector = bio->bi_iter.bi_sector;
  253. struct bio_vec bvec;
  254. struct bvec_iter iter;
  255. bio_for_each_segment(bvec, bio, iter) {
  256. unsigned int len = bvec.bv_len;
  257. int err;
  258. /* Don't support un-aligned buffer */
  259. WARN_ON_ONCE((bvec.bv_offset & (SECTOR_SIZE - 1)) ||
  260. (len & (SECTOR_SIZE - 1)));
  261. err = brd_do_bvec(brd, bvec.bv_page, len, bvec.bv_offset,
  262. bio->bi_opf, sector);
  263. if (err) {
  264. if (err == -ENOMEM && bio->bi_opf & REQ_NOWAIT) {
  265. bio_wouldblock_error(bio);
  266. return;
  267. }
  268. bio_io_error(bio);
  269. return;
  270. }
  271. sector += len >> SECTOR_SHIFT;
  272. }
  273. bio_endio(bio);
  274. }
  275. static int brd_rw_page(struct block_device *bdev, sector_t sector,
  276. struct page *page, enum req_op op)
  277. {
  278. struct brd_device *brd = bdev->bd_disk->private_data;
  279. int err;
  280. if (PageTransHuge(page))
  281. return -ENOTSUPP;
  282. err = brd_do_bvec(brd, page, PAGE_SIZE, 0, op, sector);
  283. page_endio(page, op_is_write(op), err);
  284. return err;
  285. }
  286. static const struct block_device_operations brd_fops = {
  287. .owner = THIS_MODULE,
  288. .submit_bio = brd_submit_bio,
  289. .rw_page = brd_rw_page,
  290. };
  291. /*
  292. * And now the modules code and kernel interface.
  293. */
  294. static int rd_nr = CONFIG_BLK_DEV_RAM_COUNT;
  295. module_param(rd_nr, int, 0444);
  296. MODULE_PARM_DESC(rd_nr, "Maximum number of brd devices");
  297. unsigned long rd_size = CONFIG_BLK_DEV_RAM_SIZE;
  298. module_param(rd_size, ulong, 0444);
  299. MODULE_PARM_DESC(rd_size, "Size of each RAM disk in kbytes.");
  300. static int max_part = 1;
  301. module_param(max_part, int, 0444);
  302. MODULE_PARM_DESC(max_part, "Num Minors to reserve between devices");
  303. MODULE_LICENSE("GPL");
  304. MODULE_ALIAS_BLOCKDEV_MAJOR(RAMDISK_MAJOR);
  305. MODULE_ALIAS("rd");
  306. #ifndef MODULE
  307. /* Legacy boot options - nonmodular */
  308. static int __init ramdisk_size(char *str)
  309. {
  310. rd_size = simple_strtol(str, NULL, 0);
  311. return 1;
  312. }
  313. __setup("ramdisk_size=", ramdisk_size);
  314. #endif
  315. /*
  316. * The device scheme is derived from loop.c. Keep them in synch where possible
  317. * (should share code eventually).
  318. */
  319. static LIST_HEAD(brd_devices);
  320. static struct dentry *brd_debugfs_dir;
  321. static int brd_alloc(int i)
  322. {
  323. struct brd_device *brd;
  324. struct gendisk *disk;
  325. char buf[DISK_NAME_LEN];
  326. int err = -ENOMEM;
  327. list_for_each_entry(brd, &brd_devices, brd_list)
  328. if (brd->brd_number == i)
  329. return -EEXIST;
  330. brd = kzalloc(sizeof(*brd), GFP_KERNEL);
  331. if (!brd)
  332. return -ENOMEM;
  333. brd->brd_number = i;
  334. list_add_tail(&brd->brd_list, &brd_devices);
  335. spin_lock_init(&brd->brd_lock);
  336. INIT_RADIX_TREE(&brd->brd_pages, GFP_ATOMIC);
  337. snprintf(buf, DISK_NAME_LEN, "ram%d", i);
  338. if (!IS_ERR_OR_NULL(brd_debugfs_dir))
  339. debugfs_create_u64(buf, 0444, brd_debugfs_dir,
  340. &brd->brd_nr_pages);
  341. disk = brd->brd_disk = blk_alloc_disk(NUMA_NO_NODE);
  342. if (!disk)
  343. goto out_free_dev;
  344. disk->major = RAMDISK_MAJOR;
  345. disk->first_minor = i * max_part;
  346. disk->minors = max_part;
  347. disk->fops = &brd_fops;
  348. disk->private_data = brd;
  349. strscpy(disk->disk_name, buf, DISK_NAME_LEN);
  350. set_capacity(disk, rd_size * 2);
  351. /*
  352. * This is so fdisk will align partitions on 4k, because of
  353. * direct_access API needing 4k alignment, returning a PFN
  354. * (This is only a problem on very small devices <= 4M,
  355. * otherwise fdisk will align on 1M. Regardless this call
  356. * is harmless)
  357. */
  358. blk_queue_physical_block_size(disk->queue, PAGE_SIZE);
  359. /* Tell the block layer that this is not a rotational device */
  360. blk_queue_flag_set(QUEUE_FLAG_NONROT, disk->queue);
  361. blk_queue_flag_clear(QUEUE_FLAG_ADD_RANDOM, disk->queue);
  362. blk_queue_flag_set(QUEUE_FLAG_NOWAIT, disk->queue);
  363. err = add_disk(disk);
  364. if (err)
  365. goto out_cleanup_disk;
  366. return 0;
  367. out_cleanup_disk:
  368. put_disk(disk);
  369. out_free_dev:
  370. list_del(&brd->brd_list);
  371. kfree(brd);
  372. return err;
  373. }
  374. static void brd_probe(dev_t dev)
  375. {
  376. brd_alloc(MINOR(dev) / max_part);
  377. }
  378. static void brd_cleanup(void)
  379. {
  380. struct brd_device *brd, *next;
  381. debugfs_remove_recursive(brd_debugfs_dir);
  382. list_for_each_entry_safe(brd, next, &brd_devices, brd_list) {
  383. del_gendisk(brd->brd_disk);
  384. put_disk(brd->brd_disk);
  385. brd_free_pages(brd);
  386. list_del(&brd->brd_list);
  387. kfree(brd);
  388. }
  389. }
  390. static inline void brd_check_and_reset_par(void)
  391. {
  392. if (unlikely(!max_part))
  393. max_part = 1;
  394. /*
  395. * make sure 'max_part' can be divided exactly by (1U << MINORBITS),
  396. * otherwise, it is possiable to get same dev_t when adding partitions.
  397. */
  398. if ((1U << MINORBITS) % max_part != 0)
  399. max_part = 1UL << fls(max_part);
  400. if (max_part > DISK_MAX_PARTS) {
  401. pr_info("brd: max_part can't be larger than %d, reset max_part = %d.\n",
  402. DISK_MAX_PARTS, DISK_MAX_PARTS);
  403. max_part = DISK_MAX_PARTS;
  404. }
  405. }
  406. static int __init brd_init(void)
  407. {
  408. int err, i;
  409. brd_check_and_reset_par();
  410. brd_debugfs_dir = debugfs_create_dir("ramdisk_pages", NULL);
  411. for (i = 0; i < rd_nr; i++) {
  412. err = brd_alloc(i);
  413. if (err)
  414. goto out_free;
  415. }
  416. /*
  417. * brd module now has a feature to instantiate underlying device
  418. * structure on-demand, provided that there is an access dev node.
  419. *
  420. * (1) if rd_nr is specified, create that many upfront. else
  421. * it defaults to CONFIG_BLK_DEV_RAM_COUNT
  422. * (2) User can further extend brd devices by create dev node themselves
  423. * and have kernel automatically instantiate actual device
  424. * on-demand. Example:
  425. * mknod /path/devnod_name b 1 X # 1 is the rd major
  426. * fdisk -l /path/devnod_name
  427. * If (X / max_part) was not already created it will be created
  428. * dynamically.
  429. */
  430. if (__register_blkdev(RAMDISK_MAJOR, "ramdisk", brd_probe)) {
  431. err = -EIO;
  432. goto out_free;
  433. }
  434. pr_info("brd: module loaded\n");
  435. return 0;
  436. out_free:
  437. brd_cleanup();
  438. pr_info("brd: module NOT loaded !!!\n");
  439. return err;
  440. }
  441. static void __exit brd_exit(void)
  442. {
  443. unregister_blkdev(RAMDISK_MAJOR, "ramdisk");
  444. brd_cleanup();
  445. pr_info("brd: module unloaded\n");
  446. }
  447. module_init(brd_init);
  448. module_exit(brd_exit);