blob: 2fb25c348d531bf5bcf2508cff78fe9e27aa6705 [file] [log] [blame]
Thomas Gleixner09c434b2019-05-19 13:08:20 +01001// SPDX-License-Identifier: GPL-2.0-only
Nick Piggin9db55792008-02-08 04:19:49 -08002/*
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
12#include <linux/init.h>
Bart Van Assche287f3ca2017-07-10 15:51:10 -070013#include <linux/initrd.h>
Nick Piggin9db55792008-02-08 04:19:49 -080014#include <linux/module.h>
15#include <linux/moduleparam.h>
16#include <linux/major.h>
17#include <linux/blkdev.h>
18#include <linux/bio.h>
19#include <linux/highmem.h>
Arnd Bergmann2a48fc02010-06-02 14:28:52 +020020#include <linux/mutex.h>
Nick Piggin9db55792008-02-08 04:19:49 -080021#include <linux/radix-tree.h>
Al Viroff01bb42011-09-16 02:31:11 -040022#include <linux/fs.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090023#include <linux/slab.h>
Minchan Kim23c47d22017-11-15 17:33:00 -080024#include <linux/backing-dev.h>
Nick Piggin9db55792008-02-08 04:19:49 -080025
Linus Torvalds7c0f6ba2016-12-24 11:46:01 -080026#include <linux/uaccess.h>
Nick Piggin9db55792008-02-08 04:19:49 -080027
Nick Piggin9db55792008-02-08 04:19:49 -080028#define PAGE_SECTORS_SHIFT (PAGE_SHIFT - SECTOR_SHIFT)
29#define PAGE_SECTORS (1 << PAGE_SECTORS_SHIFT)
30
31/*
32 * Each block ramdisk device has a radix_tree brd_pages of pages that stores
33 * the pages containing the block device's contents. A brd page's ->index is
34 * its offset in PAGE_SIZE units. This is similar to, but in no way connected
35 * with, the kernel's pagecache or buffer cache (which sit above our block
36 * device).
37 */
38struct brd_device {
39 int brd_number;
Nick Piggin9db55792008-02-08 04:19:49 -080040
41 struct request_queue *brd_queue;
42 struct gendisk *brd_disk;
43 struct list_head brd_list;
44
45 /*
46 * Backing store of pages and lock to protect it. This is the contents
47 * of the block device.
48 */
49 spinlock_t brd_lock;
50 struct radix_tree_root brd_pages;
51};
52
53/*
54 * Look up and return a brd's page for a given sector.
55 */
56static struct page *brd_lookup_page(struct brd_device *brd, sector_t sector)
57{
58 pgoff_t idx;
59 struct page *page;
60
61 /*
62 * The page lifetime is protected by the fact that we have opened the
63 * device node -- brd pages will never be deleted under us, so we
64 * don't need any further locking or refcounting.
65 *
66 * This is strictly true for the radix-tree nodes as well (ie. we
67 * don't actually need the rcu_read_lock()), however that is not a
68 * documented feature of the radix-tree API so it is better to be
69 * safe here (we don't have total exclusion from radix tree updates
70 * here, only deletes).
71 */
72 rcu_read_lock();
73 idx = sector >> PAGE_SECTORS_SHIFT; /* sector to page index */
74 page = radix_tree_lookup(&brd->brd_pages, idx);
75 rcu_read_unlock();
76
77 BUG_ON(page && page->index != idx);
78
79 return page;
80}
81
82/*
83 * Look up and return a brd's page for a given sector.
84 * If one does not exist, allocate an empty page, and insert that. Then
85 * return it.
86 */
87static struct page *brd_insert_page(struct brd_device *brd, sector_t sector)
88{
89 pgoff_t idx;
90 struct page *page;
Nick Piggin75acb9c2008-02-08 04:19:50 -080091 gfp_t gfp_flags;
Nick Piggin9db55792008-02-08 04:19:49 -080092
93 page = brd_lookup_page(brd, sector);
94 if (page)
95 return page;
96
97 /*
98 * Must use NOIO because we don't want to recurse back into the
99 * block or filesystem layers from page reclaim.
100 */
Hou Taof6b50162019-04-22 21:23:21 +0800101 gfp_flags = GFP_NOIO | __GFP_ZERO | __GFP_HIGHMEM;
Petr Tesarik26defe32008-04-22 05:36:52 +0200102 page = alloc_page(gfp_flags);
Nick Piggin9db55792008-02-08 04:19:49 -0800103 if (!page)
104 return NULL;
105
106 if (radix_tree_preload(GFP_NOIO)) {
107 __free_page(page);
108 return NULL;
109 }
110
111 spin_lock(&brd->brd_lock);
112 idx = sector >> PAGE_SECTORS_SHIFT;
Brian Behlendorfdfd20b22013-05-24 15:55:28 -0700113 page->index = idx;
Nick Piggin9db55792008-02-08 04:19:49 -0800114 if (radix_tree_insert(&brd->brd_pages, idx, page)) {
115 __free_page(page);
116 page = radix_tree_lookup(&brd->brd_pages, idx);
117 BUG_ON(!page);
118 BUG_ON(page->index != idx);
Brian Behlendorfdfd20b22013-05-24 15:55:28 -0700119 }
Nick Piggin9db55792008-02-08 04:19:49 -0800120 spin_unlock(&brd->brd_lock);
121
122 radix_tree_preload_end();
123
124 return page;
125}
126
127/*
128 * Free all backing store pages and radix tree. This must only be called when
129 * there are no other users of the device.
130 */
131#define FREE_BATCH 16
132static void brd_free_pages(struct brd_device *brd)
133{
134 unsigned long pos = 0;
135 struct page *pages[FREE_BATCH];
136 int nr_pages;
137
138 do {
139 int i;
140
141 nr_pages = radix_tree_gang_lookup(&brd->brd_pages,
142 (void **)pages, pos, FREE_BATCH);
143
144 for (i = 0; i < nr_pages; i++) {
145 void *ret;
146
147 BUG_ON(pages[i]->index < pos);
148 pos = pages[i]->index;
149 ret = radix_tree_delete(&brd->brd_pages, pos);
150 BUG_ON(!ret || ret != pages[i]);
151 __free_page(pages[i]);
152 }
153
154 pos++;
155
156 /*
Mikulas Patocka936b33f2019-05-09 12:51:27 -0600157 * It takes 3.4 seconds to remove 80GiB ramdisk.
158 * So, we need cond_resched to avoid stalling the CPU.
159 */
160 cond_resched();
161
162 /*
Nick Piggin9db55792008-02-08 04:19:49 -0800163 * This assumes radix_tree_gang_lookup always returns as
164 * many pages as possible. If the radix-tree code changes,
165 * so will this have to.
166 */
167 } while (nr_pages == FREE_BATCH);
168}
169
170/*
171 * copy_to_brd_setup must be called before copy_to_brd. It may sleep.
172 */
173static int copy_to_brd_setup(struct brd_device *brd, sector_t sector, size_t n)
174{
175 unsigned int offset = (sector & (PAGE_SECTORS-1)) << SECTOR_SHIFT;
176 size_t copy;
177
178 copy = min_t(size_t, n, PAGE_SIZE - offset);
179 if (!brd_insert_page(brd, sector))
Matthew Wilcox96f8d8e2014-06-04 16:07:50 -0700180 return -ENOSPC;
Nick Piggin9db55792008-02-08 04:19:49 -0800181 if (copy < n) {
182 sector += copy >> SECTOR_SHIFT;
183 if (!brd_insert_page(brd, sector))
Matthew Wilcox96f8d8e2014-06-04 16:07:50 -0700184 return -ENOSPC;
Nick Piggin9db55792008-02-08 04:19:49 -0800185 }
186 return 0;
187}
188
189/*
190 * Copy n bytes from src to the brd starting at sector. Does not sleep.
191 */
192static void copy_to_brd(struct brd_device *brd, const void *src,
193 sector_t sector, size_t n)
194{
195 struct page *page;
196 void *dst;
197 unsigned int offset = (sector & (PAGE_SECTORS-1)) << SECTOR_SHIFT;
198 size_t copy;
199
200 copy = min_t(size_t, n, PAGE_SIZE - offset);
201 page = brd_lookup_page(brd, sector);
202 BUG_ON(!page);
203
Cong Wangcfd80052011-11-25 23:14:18 +0800204 dst = kmap_atomic(page);
Nick Piggin9db55792008-02-08 04:19:49 -0800205 memcpy(dst + offset, src, copy);
Cong Wangcfd80052011-11-25 23:14:18 +0800206 kunmap_atomic(dst);
Nick Piggin9db55792008-02-08 04:19:49 -0800207
208 if (copy < n) {
209 src += copy;
210 sector += copy >> SECTOR_SHIFT;
211 copy = n - copy;
212 page = brd_lookup_page(brd, sector);
213 BUG_ON(!page);
214
Cong Wangcfd80052011-11-25 23:14:18 +0800215 dst = kmap_atomic(page);
Nick Piggin9db55792008-02-08 04:19:49 -0800216 memcpy(dst, src, copy);
Cong Wangcfd80052011-11-25 23:14:18 +0800217 kunmap_atomic(dst);
Nick Piggin9db55792008-02-08 04:19:49 -0800218 }
219}
220
221/*
222 * Copy n bytes to dst from the brd starting at sector. Does not sleep.
223 */
224static void copy_from_brd(void *dst, struct brd_device *brd,
225 sector_t sector, size_t n)
226{
227 struct page *page;
228 void *src;
229 unsigned int offset = (sector & (PAGE_SECTORS-1)) << SECTOR_SHIFT;
230 size_t copy;
231
232 copy = min_t(size_t, n, PAGE_SIZE - offset);
233 page = brd_lookup_page(brd, sector);
234 if (page) {
Cong Wangcfd80052011-11-25 23:14:18 +0800235 src = kmap_atomic(page);
Nick Piggin9db55792008-02-08 04:19:49 -0800236 memcpy(dst, src + offset, copy);
Cong Wangcfd80052011-11-25 23:14:18 +0800237 kunmap_atomic(src);
Nick Piggin9db55792008-02-08 04:19:49 -0800238 } else
239 memset(dst, 0, copy);
240
241 if (copy < n) {
242 dst += copy;
243 sector += copy >> SECTOR_SHIFT;
244 copy = n - copy;
245 page = brd_lookup_page(brd, sector);
246 if (page) {
Cong Wangcfd80052011-11-25 23:14:18 +0800247 src = kmap_atomic(page);
Nick Piggin9db55792008-02-08 04:19:49 -0800248 memcpy(dst, src, copy);
Cong Wangcfd80052011-11-25 23:14:18 +0800249 kunmap_atomic(src);
Nick Piggin9db55792008-02-08 04:19:49 -0800250 } else
251 memset(dst, 0, copy);
252 }
253}
254
255/*
256 * Process a single bvec of a bio.
257 */
258static int brd_do_bvec(struct brd_device *brd, struct page *page,
Tejun Heo3f289dc2018-07-18 04:47:36 -0700259 unsigned int len, unsigned int off, unsigned int op,
Nick Piggin9db55792008-02-08 04:19:49 -0800260 sector_t sector)
261{
262 void *mem;
263 int err = 0;
264
Tejun Heo3f289dc2018-07-18 04:47:36 -0700265 if (op_is_write(op)) {
Nick Piggin9db55792008-02-08 04:19:49 -0800266 err = copy_to_brd_setup(brd, sector, len);
267 if (err)
268 goto out;
269 }
270
Cong Wangcfd80052011-11-25 23:14:18 +0800271 mem = kmap_atomic(page);
Tejun Heo3f289dc2018-07-18 04:47:36 -0700272 if (!op_is_write(op)) {
Nick Piggin9db55792008-02-08 04:19:49 -0800273 copy_from_brd(mem + off, brd, sector, len);
274 flush_dcache_page(page);
Nick Pigginc2572f22009-04-15 10:32:07 +0200275 } else {
276 flush_dcache_page(page);
Nick Piggin9db55792008-02-08 04:19:49 -0800277 copy_to_brd(brd, mem + off, sector, len);
Nick Pigginc2572f22009-04-15 10:32:07 +0200278 }
Cong Wangcfd80052011-11-25 23:14:18 +0800279 kunmap_atomic(mem);
Nick Piggin9db55792008-02-08 04:19:49 -0800280
281out:
282 return err;
283}
284
Jens Axboedece1632015-11-05 10:41:16 -0700285static blk_qc_t brd_make_request(struct request_queue *q, struct bio *bio)
Nick Piggin9db55792008-02-08 04:19:49 -0800286{
Christoph Hellwig74d46992017-08-23 19:10:32 +0200287 struct brd_device *brd = bio->bi_disk->private_data;
Kent Overstreet79886132013-11-23 17:19:00 -0800288 struct bio_vec bvec;
Nick Piggin9db55792008-02-08 04:19:49 -0800289 sector_t sector;
Kent Overstreet79886132013-11-23 17:19:00 -0800290 struct bvec_iter iter;
Nick Piggin9db55792008-02-08 04:19:49 -0800291
Kent Overstreet4f024f32013-10-11 15:44:27 -0700292 sector = bio->bi_iter.bi_sector;
Christoph Hellwig74d46992017-08-23 19:10:32 +0200293 if (bio_end_sector(bio) > get_capacity(bio->bi_disk))
Christoph Hellwig4246a0b2015-07-20 15:29:37 +0200294 goto io_error;
Nick Piggin9db55792008-02-08 04:19:49 -0800295
Kent Overstreet79886132013-11-23 17:19:00 -0800296 bio_for_each_segment(bvec, bio, iter) {
297 unsigned int len = bvec.bv_len;
Christoph Hellwig4246a0b2015-07-20 15:29:37 +0200298 int err;
299
Ming Leif1acbf22019-12-04 19:31:15 +0800300 /* Don't support un-aligned buffer */
301 WARN_ON_ONCE((bvec.bv_offset & (SECTOR_SIZE - 1)) ||
302 (len & (SECTOR_SIZE - 1)));
303
Jens Axboec11f0c02016-08-05 08:11:04 -0600304 err = brd_do_bvec(brd, bvec.bv_page, len, bvec.bv_offset,
Tejun Heo3f289dc2018-07-18 04:47:36 -0700305 bio_op(bio), sector);
Nick Piggin9db55792008-02-08 04:19:49 -0800306 if (err)
Christoph Hellwig4246a0b2015-07-20 15:29:37 +0200307 goto io_error;
Nick Piggin9db55792008-02-08 04:19:49 -0800308 sector += len >> SECTOR_SHIFT;
309 }
310
Christoph Hellwig4246a0b2015-07-20 15:29:37 +0200311 bio_endio(bio);
Jens Axboedece1632015-11-05 10:41:16 -0700312 return BLK_QC_T_NONE;
Christoph Hellwig4246a0b2015-07-20 15:29:37 +0200313io_error:
314 bio_io_error(bio);
Jens Axboedece1632015-11-05 10:41:16 -0700315 return BLK_QC_T_NONE;
Nick Piggin9db55792008-02-08 04:19:49 -0800316}
317
Matthew Wilcoxa72132c2014-06-04 16:07:49 -0700318static int brd_rw_page(struct block_device *bdev, sector_t sector,
Tejun Heo3f289dc2018-07-18 04:47:36 -0700319 struct page *page, unsigned int op)
Matthew Wilcoxa72132c2014-06-04 16:07:49 -0700320{
321 struct brd_device *brd = bdev->bd_disk->private_data;
Huang Ying98cc0932017-09-06 16:22:27 -0700322 int err;
323
324 if (PageTransHuge(page))
325 return -ENOTSUPP;
Tejun Heo3f289dc2018-07-18 04:47:36 -0700326 err = brd_do_bvec(brd, page, PAGE_SIZE, 0, op, sector);
327 page_endio(page, op_is_write(op), err);
Matthew Wilcoxa72132c2014-06-04 16:07:49 -0700328 return err;
329}
330
Alexey Dobriyan83d5cde2009-09-21 17:01:13 -0700331static const struct block_device_operations brd_fops = {
Nick Piggin75acb9c2008-02-08 04:19:50 -0800332 .owner = THIS_MODULE,
Matthew Wilcoxa72132c2014-06-04 16:07:49 -0700333 .rw_page = brd_rw_page,
Nick Piggin9db55792008-02-08 04:19:49 -0800334};
335
336/*
337 * And now the modules code and kernel interface.
338 */
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200339static int rd_nr = CONFIG_BLK_DEV_RAM_COUNT;
Joe Perches5657a812018-05-24 13:38:59 -0600340module_param(rd_nr, int, 0444);
Nick Piggin9db55792008-02-08 04:19:49 -0800341MODULE_PARM_DESC(rd_nr, "Maximum number of brd devices");
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200342
Jan Kara366f4ae2016-10-25 13:53:27 +0200343unsigned long rd_size = CONFIG_BLK_DEV_RAM_SIZE;
Joe Perches5657a812018-05-24 13:38:59 -0600344module_param(rd_size, ulong, 0444);
Nick Piggin9db55792008-02-08 04:19:49 -0800345MODULE_PARM_DESC(rd_size, "Size of each RAM disk in kbytes.");
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200346
347static int max_part = 1;
Joe Perches5657a812018-05-24 13:38:59 -0600348module_param(max_part, int, 0444);
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200349MODULE_PARM_DESC(max_part, "Num Minors to reserve between devices");
350
Nick Piggin9db55792008-02-08 04:19:49 -0800351MODULE_LICENSE("GPL");
352MODULE_ALIAS_BLOCKDEV_MAJOR(RAMDISK_MAJOR);
Nick Pigginefedf512008-06-04 17:18:42 +0200353MODULE_ALIAS("rd");
Nick Piggin9db55792008-02-08 04:19:49 -0800354
355#ifndef MODULE
356/* Legacy boot options - nonmodular */
357static int __init ramdisk_size(char *str)
358{
359 rd_size = simple_strtol(str, NULL, 0);
360 return 1;
361}
Robert P. J. Day1adbee52009-06-10 12:57:08 -0700362__setup("ramdisk_size=", ramdisk_size);
Nick Piggin9db55792008-02-08 04:19:49 -0800363#endif
364
365/*
366 * The device scheme is derived from loop.c. Keep them in synch where possible
367 * (should share code eventually).
368 */
369static LIST_HEAD(brd_devices);
370static DEFINE_MUTEX(brd_devices_mutex);
371
372static struct brd_device *brd_alloc(int i)
373{
374 struct brd_device *brd;
375 struct gendisk *disk;
376
377 brd = kzalloc(sizeof(*brd), GFP_KERNEL);
378 if (!brd)
379 goto out;
380 brd->brd_number = i;
381 spin_lock_init(&brd->brd_lock);
382 INIT_RADIX_TREE(&brd->brd_pages, GFP_ATOMIC);
383
Christoph Hellwig3d745ea2020-03-27 09:30:11 +0100384 brd->brd_queue = blk_alloc_queue(brd_make_request, NUMA_NO_NODE);
Nick Piggin9db55792008-02-08 04:19:49 -0800385 if (!brd->brd_queue)
386 goto out_free_dev;
Boaz Harroshc8fa3172015-01-07 18:09:38 +0200387
Boaz Harroshc8fa3172015-01-07 18:09:38 +0200388 /* This is so fdisk will align partitions on 4k, because of
389 * direct_access API needing 4k alignment, returning a PFN
390 * (This is only a problem on very small devices <= 4M,
391 * otherwise fdisk will align on 1M. Regardless this call
392 * is harmless)
393 */
394 blk_queue_physical_block_size(brd->brd_queue, PAGE_SIZE);
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200395 disk = brd->brd_disk = alloc_disk(max_part);
Nick Piggin9db55792008-02-08 04:19:49 -0800396 if (!disk)
397 goto out_free_queue;
398 disk->major = RAMDISK_MAJOR;
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200399 disk->first_minor = i * max_part;
Nick Piggin9db55792008-02-08 04:19:49 -0800400 disk->fops = &brd_fops;
401 disk->private_data = brd;
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200402 disk->flags = GENHD_FL_EXT_DEVT;
Nick Piggin9db55792008-02-08 04:19:49 -0800403 sprintf(disk->disk_name, "ram%d", i);
404 set_capacity(disk, rd_size * 2);
Ming Lei153fcd52018-11-02 08:50:51 +0800405 brd->brd_queue->backing_dev_info->capabilities |= BDI_CAP_SYNCHRONOUS_IO;
Nick Piggin9db55792008-02-08 04:19:49 -0800406
SeongJae Park316ba572018-05-03 18:53:26 +0900407 /* Tell the block layer that this is not a rotational device */
Ming Lei153fcd52018-11-02 08:50:51 +0800408 blk_queue_flag_set(QUEUE_FLAG_NONROT, brd->brd_queue);
409 blk_queue_flag_clear(QUEUE_FLAG_ADD_RANDOM, brd->brd_queue);
SeongJae Park316ba572018-05-03 18:53:26 +0900410
Nick Piggin9db55792008-02-08 04:19:49 -0800411 return brd;
412
413out_free_queue:
414 blk_cleanup_queue(brd->brd_queue);
415out_free_dev:
416 kfree(brd);
417out:
418 return NULL;
419}
420
421static void brd_free(struct brd_device *brd)
422{
423 put_disk(brd->brd_disk);
424 blk_cleanup_queue(brd->brd_queue);
425 brd_free_pages(brd);
426 kfree(brd);
427}
428
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200429static struct brd_device *brd_init_one(int i, bool *new)
Nick Piggin9db55792008-02-08 04:19:49 -0800430{
431 struct brd_device *brd;
432
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200433 *new = false;
Nick Piggin9db55792008-02-08 04:19:49 -0800434 list_for_each_entry(brd, &brd_devices, brd_list) {
435 if (brd->brd_number == i)
436 goto out;
437 }
438
439 brd = brd_alloc(i);
440 if (brd) {
Ming Lei153fcd52018-11-02 08:50:51 +0800441 brd->brd_disk->queue = brd->brd_queue;
Nick Piggin9db55792008-02-08 04:19:49 -0800442 add_disk(brd->brd_disk);
443 list_add_tail(&brd->brd_list, &brd_devices);
444 }
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200445 *new = true;
Nick Piggin9db55792008-02-08 04:19:49 -0800446out:
447 return brd;
448}
449
450static void brd_del_one(struct brd_device *brd)
451{
452 list_del(&brd->brd_list);
453 del_gendisk(brd->brd_disk);
454 brd_free(brd);
455}
456
457static struct kobject *brd_probe(dev_t dev, int *part, void *data)
458{
459 struct brd_device *brd;
460 struct kobject *kobj;
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200461 bool new;
Nick Piggin9db55792008-02-08 04:19:49 -0800462
463 mutex_lock(&brd_devices_mutex);
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200464 brd = brd_init_one(MINOR(dev) / max_part, &new);
Jan Kara3079c222018-02-26 13:01:38 +0100465 kobj = brd ? get_disk_and_module(brd->brd_disk) : NULL;
Nick Piggin9db55792008-02-08 04:19:49 -0800466 mutex_unlock(&brd_devices_mutex);
467
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200468 if (new)
469 *part = 0;
470
Nick Piggin9db55792008-02-08 04:19:49 -0800471 return kobj;
472}
473
Zhiqiang Liuc8ab4222020-02-04 19:30:20 +0800474static inline void brd_check_and_reset_par(void)
475{
476 if (unlikely(!max_part))
477 max_part = 1;
478
479 /*
480 * make sure 'max_part' can be divided exactly by (1U << MINORBITS),
481 * otherwise, it is possiable to get same dev_t when adding partitions.
482 */
483 if ((1U << MINORBITS) % max_part != 0)
484 max_part = 1UL << fls(max_part);
485
486 if (max_part > DISK_MAX_PARTS) {
487 pr_info("brd: max_part can't be larger than %d, reset max_part = %d.\n",
488 DISK_MAX_PARTS, DISK_MAX_PARTS);
489 max_part = DISK_MAX_PARTS;
490 }
491}
492
Nick Piggin9db55792008-02-08 04:19:49 -0800493static int __init brd_init(void)
494{
Nick Piggin9db55792008-02-08 04:19:49 -0800495 struct brd_device *brd, *next;
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200496 int i;
Nick Piggin9db55792008-02-08 04:19:49 -0800497
498 /*
499 * brd module now has a feature to instantiate underlying device
500 * structure on-demand, provided that there is an access dev node.
Nick Piggin9db55792008-02-08 04:19:49 -0800501 *
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200502 * (1) if rd_nr is specified, create that many upfront. else
503 * it defaults to CONFIG_BLK_DEV_RAM_COUNT
504 * (2) User can further extend brd devices by create dev node themselves
505 * and have kernel automatically instantiate actual device
506 * on-demand. Example:
507 * mknod /path/devnod_name b 1 X # 1 is the rd major
508 * fdisk -l /path/devnod_name
509 * If (X / max_part) was not already created it will be created
510 * dynamically.
Nick Piggin9db55792008-02-08 04:19:49 -0800511 */
Laurent Vivierd7853d12008-04-30 00:55:06 -0700512
Nick Piggin9db55792008-02-08 04:19:49 -0800513 if (register_blkdev(RAMDISK_MAJOR, "ramdisk"))
514 return -EIO;
515
Zhiqiang Liuc8ab4222020-02-04 19:30:20 +0800516 brd_check_and_reset_par();
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200517
518 for (i = 0; i < rd_nr; i++) {
Nick Piggin9db55792008-02-08 04:19:49 -0800519 brd = brd_alloc(i);
520 if (!brd)
521 goto out_free;
522 list_add_tail(&brd->brd_list, &brd_devices);
523 }
524
525 /* point of no return */
526
Ming Lei153fcd52018-11-02 08:50:51 +0800527 list_for_each_entry(brd, &brd_devices, brd_list) {
528 /*
529 * associate with queue just before adding disk for
530 * avoiding to mess up failure path
531 */
532 brd->brd_disk->queue = brd->brd_queue;
Nick Piggin9db55792008-02-08 04:19:49 -0800533 add_disk(brd->brd_disk);
Ming Lei153fcd52018-11-02 08:50:51 +0800534 }
Nick Piggin9db55792008-02-08 04:19:49 -0800535
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200536 blk_register_region(MKDEV(RAMDISK_MAJOR, 0), 1UL << MINORBITS,
Nick Piggin9db55792008-02-08 04:19:49 -0800537 THIS_MODULE, brd_probe, NULL, NULL);
538
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200539 pr_info("brd: module loaded\n");
Nick Piggin9db55792008-02-08 04:19:49 -0800540 return 0;
541
542out_free:
543 list_for_each_entry_safe(brd, next, &brd_devices, brd_list) {
544 list_del(&brd->brd_list);
545 brd_free(brd);
546 }
Akinobu Mitac82f2962008-08-20 14:09:09 -0700547 unregister_blkdev(RAMDISK_MAJOR, "ramdisk");
Nick Piggin9db55792008-02-08 04:19:49 -0800548
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200549 pr_info("brd: module NOT loaded !!!\n");
Nick Piggin9db55792008-02-08 04:19:49 -0800550 return -ENOMEM;
551}
552
553static void __exit brd_exit(void)
554{
Nick Piggin9db55792008-02-08 04:19:49 -0800555 struct brd_device *brd, *next;
556
Nick Piggin9db55792008-02-08 04:19:49 -0800557 list_for_each_entry_safe(brd, next, &brd_devices, brd_list)
558 brd_del_one(brd);
559
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200560 blk_unregister_region(MKDEV(RAMDISK_MAJOR, 0), 1UL << MINORBITS);
Nick Piggin9db55792008-02-08 04:19:49 -0800561 unregister_blkdev(RAMDISK_MAJOR, "ramdisk");
Boaz Harrosh937af5e2015-01-07 18:07:56 +0200562
563 pr_info("brd: module unloaded\n");
Nick Piggin9db55792008-02-08 04:19:49 -0800564}
565
566module_init(brd_init);
567module_exit(brd_exit);
568