genhd.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794
  1. /*
  2. * gendisk handling
  3. */
  4. #include <linux/config.h>
  5. #include <linux/module.h>
  6. #include <linux/fs.h>
  7. #include <linux/genhd.h>
  8. #include <linux/kernel.h>
  9. #include <linux/blkdev.h>
  10. #include <linux/init.h>
  11. #include <linux/spinlock.h>
  12. #include <linux/seq_file.h>
  13. #include <linux/slab.h>
  14. #include <linux/kmod.h>
  15. #include <linux/kobj_map.h>
  16. #include <linux/buffer_head.h>
  17. #define MAX_PROBE_HASH 255 /* random */
  18. static struct subsystem block_subsys;
  19. static DECLARE_MUTEX(block_subsys_sem);
  20. /*
  21. * Can be deleted altogether. Later.
  22. *
  23. */
  24. static struct blk_major_name {
  25. struct blk_major_name *next;
  26. int major;
  27. char name[16];
  28. } *major_names[MAX_PROBE_HASH];
  29. /* index in the above - for now: assume no multimajor ranges */
  30. static inline int major_to_index(int major)
  31. {
  32. return major % MAX_PROBE_HASH;
  33. }
  34. struct blkdev_info {
  35. int index;
  36. struct blk_major_name *bd;
  37. };
  38. /*
  39. * iterate over a list of blkdev_info structures. allows
  40. * the major_names array to be iterated over from outside this file
  41. * must be called with the block_subsys_sem held
  42. */
  43. void *get_next_blkdev(void *dev)
  44. {
  45. struct blkdev_info *info;
  46. if (dev == NULL) {
  47. info = kmalloc(sizeof(*info), GFP_KERNEL);
  48. if (!info)
  49. goto out;
  50. info->index=0;
  51. info->bd = major_names[info->index];
  52. if (info->bd)
  53. goto out;
  54. } else {
  55. info = dev;
  56. }
  57. while (info->index < ARRAY_SIZE(major_names)) {
  58. if (info->bd)
  59. info->bd = info->bd->next;
  60. if (info->bd)
  61. goto out;
  62. /*
  63. * No devices on this chain, move to the next
  64. */
  65. info->index++;
  66. info->bd = (info->index < ARRAY_SIZE(major_names)) ?
  67. major_names[info->index] : NULL;
  68. if (info->bd)
  69. goto out;
  70. }
  71. out:
  72. return info;
  73. }
  74. void *acquire_blkdev_list(void)
  75. {
  76. down(&block_subsys_sem);
  77. return get_next_blkdev(NULL);
  78. }
  79. void release_blkdev_list(void *dev)
  80. {
  81. up(&block_subsys_sem);
  82. kfree(dev);
  83. }
  84. /*
  85. * Count the number of records in the blkdev_list.
  86. * must be called with the block_subsys_sem held
  87. */
  88. int count_blkdev_list(void)
  89. {
  90. struct blk_major_name *n;
  91. int i, count;
  92. count = 0;
  93. for (i = 0; i < ARRAY_SIZE(major_names); i++) {
  94. for (n = major_names[i]; n; n = n->next)
  95. count++;
  96. }
  97. return count;
  98. }
  99. /*
  100. * extract the major and name values from a blkdev_info struct
  101. * passed in as a void to *dev. Must be called with
  102. * block_subsys_sem held
  103. */
  104. int get_blkdev_info(void *dev, int *major, char **name)
  105. {
  106. struct blkdev_info *info = dev;
  107. if (info->bd == NULL)
  108. return 1;
  109. *major = info->bd->major;
  110. *name = info->bd->name;
  111. return 0;
  112. }
  113. int register_blkdev(unsigned int major, const char *name)
  114. {
  115. struct blk_major_name **n, *p;
  116. int index, ret = 0;
  117. down(&block_subsys_sem);
  118. /* temporary */
  119. if (major == 0) {
  120. for (index = ARRAY_SIZE(major_names)-1; index > 0; index--) {
  121. if (major_names[index] == NULL)
  122. break;
  123. }
  124. if (index == 0) {
  125. printk("register_blkdev: failed to get major for %s\n",
  126. name);
  127. ret = -EBUSY;
  128. goto out;
  129. }
  130. major = index;
  131. ret = major;
  132. }
  133. p = kmalloc(sizeof(struct blk_major_name), GFP_KERNEL);
  134. if (p == NULL) {
  135. ret = -ENOMEM;
  136. goto out;
  137. }
  138. p->major = major;
  139. strlcpy(p->name, name, sizeof(p->name));
  140. p->next = NULL;
  141. index = major_to_index(major);
  142. for (n = &major_names[index]; *n; n = &(*n)->next) {
  143. if ((*n)->major == major)
  144. break;
  145. }
  146. if (!*n)
  147. *n = p;
  148. else
  149. ret = -EBUSY;
  150. if (ret < 0) {
  151. printk("register_blkdev: cannot get major %d for %s\n",
  152. major, name);
  153. kfree(p);
  154. }
  155. out:
  156. up(&block_subsys_sem);
  157. return ret;
  158. }
  159. EXPORT_SYMBOL(register_blkdev);
  160. /* todo: make void - error printk here */
  161. int unregister_blkdev(unsigned int major, const char *name)
  162. {
  163. struct blk_major_name **n;
  164. struct blk_major_name *p = NULL;
  165. int index = major_to_index(major);
  166. int ret = 0;
  167. down(&block_subsys_sem);
  168. for (n = &major_names[index]; *n; n = &(*n)->next)
  169. if ((*n)->major == major)
  170. break;
  171. if (!*n || strcmp((*n)->name, name))
  172. ret = -EINVAL;
  173. else {
  174. p = *n;
  175. *n = p->next;
  176. }
  177. up(&block_subsys_sem);
  178. kfree(p);
  179. return ret;
  180. }
  181. EXPORT_SYMBOL(unregister_blkdev);
  182. static struct kobj_map *bdev_map;
  183. /*
  184. * Register device numbers dev..(dev+range-1)
  185. * range must be nonzero
  186. * The hash chain is sorted on range, so that subranges can override.
  187. */
  188. void blk_register_region(dev_t dev, unsigned long range, struct module *module,
  189. struct kobject *(*probe)(dev_t, int *, void *),
  190. int (*lock)(dev_t, void *), void *data)
  191. {
  192. kobj_map(bdev_map, dev, range, module, probe, lock, data);
  193. }
  194. EXPORT_SYMBOL(blk_register_region);
  195. void blk_unregister_region(dev_t dev, unsigned long range)
  196. {
  197. kobj_unmap(bdev_map, dev, range);
  198. }
  199. EXPORT_SYMBOL(blk_unregister_region);
  200. static struct kobject *exact_match(dev_t dev, int *part, void *data)
  201. {
  202. struct gendisk *p = data;
  203. return &p->kobj;
  204. }
  205. static int exact_lock(dev_t dev, void *data)
  206. {
  207. struct gendisk *p = data;
  208. if (!get_disk(p))
  209. return -1;
  210. return 0;
  211. }
  212. /**
  213. * add_disk - add partitioning information to kernel list
  214. * @disk: per-device partitioning information
  215. *
  216. * This function registers the partitioning information in @disk
  217. * with the kernel.
  218. */
  219. void add_disk(struct gendisk *disk)
  220. {
  221. disk->flags |= GENHD_FL_UP;
  222. blk_register_region(MKDEV(disk->major, disk->first_minor),
  223. disk->minors, NULL, exact_match, exact_lock, disk);
  224. register_disk(disk);
  225. blk_register_queue(disk);
  226. }
  227. EXPORT_SYMBOL(add_disk);
  228. EXPORT_SYMBOL(del_gendisk); /* in partitions/check.c */
  229. void unlink_gendisk(struct gendisk *disk)
  230. {
  231. blk_unregister_queue(disk);
  232. blk_unregister_region(MKDEV(disk->major, disk->first_minor),
  233. disk->minors);
  234. }
  235. #define to_disk(obj) container_of(obj,struct gendisk,kobj)
  236. /**
  237. * get_gendisk - get partitioning information for a given device
  238. * @dev: device to get partitioning information for
  239. *
  240. * This function gets the structure containing partitioning
  241. * information for the given device @dev.
  242. */
  243. struct gendisk *get_gendisk(dev_t dev, int *part)
  244. {
  245. struct kobject *kobj = kobj_lookup(bdev_map, dev, part);
  246. return kobj ? to_disk(kobj) : NULL;
  247. }
  248. #ifdef CONFIG_PROC_FS
  249. /* iterator */
  250. static void *part_start(struct seq_file *part, loff_t *pos)
  251. {
  252. struct list_head *p;
  253. loff_t l = *pos;
  254. down(&block_subsys_sem);
  255. list_for_each(p, &block_subsys.kset.list)
  256. if (!l--)
  257. return list_entry(p, struct gendisk, kobj.entry);
  258. return NULL;
  259. }
  260. static void *part_next(struct seq_file *part, void *v, loff_t *pos)
  261. {
  262. struct list_head *p = ((struct gendisk *)v)->kobj.entry.next;
  263. ++*pos;
  264. return p==&block_subsys.kset.list ? NULL :
  265. list_entry(p, struct gendisk, kobj.entry);
  266. }
  267. static void part_stop(struct seq_file *part, void *v)
  268. {
  269. up(&block_subsys_sem);
  270. }
  271. static int show_partition(struct seq_file *part, void *v)
  272. {
  273. struct gendisk *sgp = v;
  274. int n;
  275. char buf[BDEVNAME_SIZE];
  276. if (&sgp->kobj.entry == block_subsys.kset.list.next)
  277. seq_puts(part, "major minor #blocks name\n\n");
  278. /* Don't show non-partitionable removeable devices or empty devices */
  279. if (!get_capacity(sgp) ||
  280. (sgp->minors == 1 && (sgp->flags & GENHD_FL_REMOVABLE)))
  281. return 0;
  282. if (sgp->flags & GENHD_FL_SUPPRESS_PARTITION_INFO)
  283. return 0;
  284. /* show the full disk and all non-0 size partitions of it */
  285. seq_printf(part, "%4d %4d %10llu %s\n",
  286. sgp->major, sgp->first_minor,
  287. (unsigned long long)get_capacity(sgp) >> 1,
  288. disk_name(sgp, 0, buf));
  289. for (n = 0; n < sgp->minors - 1; n++) {
  290. if (!sgp->part[n])
  291. continue;
  292. if (sgp->part[n]->nr_sects == 0)
  293. continue;
  294. seq_printf(part, "%4d %4d %10llu %s\n",
  295. sgp->major, n + 1 + sgp->first_minor,
  296. (unsigned long long)sgp->part[n]->nr_sects >> 1 ,
  297. disk_name(sgp, n + 1, buf));
  298. }
  299. return 0;
  300. }
  301. struct seq_operations partitions_op = {
  302. .start =part_start,
  303. .next = part_next,
  304. .stop = part_stop,
  305. .show = show_partition
  306. };
  307. #endif
  308. extern int blk_dev_init(void);
  309. static struct kobject *base_probe(dev_t dev, int *part, void *data)
  310. {
  311. if (request_module("block-major-%d-%d", MAJOR(dev), MINOR(dev)) > 0)
  312. /* Make old-style 2.4 aliases work */
  313. request_module("block-major-%d", MAJOR(dev));
  314. return NULL;
  315. }
  316. static int __init genhd_device_init(void)
  317. {
  318. bdev_map = kobj_map_init(base_probe, &block_subsys_sem);
  319. blk_dev_init();
  320. subsystem_register(&block_subsys);
  321. return 0;
  322. }
  323. subsys_initcall(genhd_device_init);
  324. /*
  325. * kobject & sysfs bindings for block devices
  326. */
  327. static ssize_t disk_attr_show(struct kobject *kobj, struct attribute *attr,
  328. char *page)
  329. {
  330. struct gendisk *disk = to_disk(kobj);
  331. struct disk_attribute *disk_attr =
  332. container_of(attr,struct disk_attribute,attr);
  333. ssize_t ret = -EIO;
  334. if (disk_attr->show)
  335. ret = disk_attr->show(disk,page);
  336. return ret;
  337. }
  338. static ssize_t disk_attr_store(struct kobject * kobj, struct attribute * attr,
  339. const char *page, size_t count)
  340. {
  341. struct gendisk *disk = to_disk(kobj);
  342. struct disk_attribute *disk_attr =
  343. container_of(attr,struct disk_attribute,attr);
  344. ssize_t ret = 0;
  345. if (disk_attr->store)
  346. ret = disk_attr->store(disk, page, count);
  347. return ret;
  348. }
  349. static struct sysfs_ops disk_sysfs_ops = {
  350. .show = &disk_attr_show,
  351. .store = &disk_attr_store,
  352. };
  353. static ssize_t disk_uevent_store(struct gendisk * disk,
  354. const char *buf, size_t count)
  355. {
  356. kobject_uevent(&disk->kobj, KOBJ_ADD);
  357. return count;
  358. }
  359. static ssize_t disk_dev_read(struct gendisk * disk, char *page)
  360. {
  361. dev_t base = MKDEV(disk->major, disk->first_minor);
  362. return print_dev_t(page, base);
  363. }
  364. static ssize_t disk_range_read(struct gendisk * disk, char *page)
  365. {
  366. return sprintf(page, "%d\n", disk->minors);
  367. }
  368. static ssize_t disk_removable_read(struct gendisk * disk, char *page)
  369. {
  370. return sprintf(page, "%d\n",
  371. (disk->flags & GENHD_FL_REMOVABLE ? 1 : 0));
  372. }
  373. static ssize_t disk_size_read(struct gendisk * disk, char *page)
  374. {
  375. return sprintf(page, "%llu\n", (unsigned long long)get_capacity(disk));
  376. }
  377. static ssize_t disk_stats_read(struct gendisk * disk, char *page)
  378. {
  379. preempt_disable();
  380. disk_round_stats(disk);
  381. preempt_enable();
  382. return sprintf(page,
  383. "%8u %8u %8llu %8u "
  384. "%8u %8u %8llu %8u "
  385. "%8u %8u %8u"
  386. "\n",
  387. disk_stat_read(disk, ios[READ]),
  388. disk_stat_read(disk, merges[READ]),
  389. (unsigned long long)disk_stat_read(disk, sectors[READ]),
  390. jiffies_to_msecs(disk_stat_read(disk, ticks[READ])),
  391. disk_stat_read(disk, ios[WRITE]),
  392. disk_stat_read(disk, merges[WRITE]),
  393. (unsigned long long)disk_stat_read(disk, sectors[WRITE]),
  394. jiffies_to_msecs(disk_stat_read(disk, ticks[WRITE])),
  395. disk->in_flight,
  396. jiffies_to_msecs(disk_stat_read(disk, io_ticks)),
  397. jiffies_to_msecs(disk_stat_read(disk, time_in_queue)));
  398. }
  399. static struct disk_attribute disk_attr_uevent = {
  400. .attr = {.name = "uevent", .mode = S_IWUSR },
  401. .store = disk_uevent_store
  402. };
  403. static struct disk_attribute disk_attr_dev = {
  404. .attr = {.name = "dev", .mode = S_IRUGO },
  405. .show = disk_dev_read
  406. };
  407. static struct disk_attribute disk_attr_range = {
  408. .attr = {.name = "range", .mode = S_IRUGO },
  409. .show = disk_range_read
  410. };
  411. static struct disk_attribute disk_attr_removable = {
  412. .attr = {.name = "removable", .mode = S_IRUGO },
  413. .show = disk_removable_read
  414. };
  415. static struct disk_attribute disk_attr_size = {
  416. .attr = {.name = "size", .mode = S_IRUGO },
  417. .show = disk_size_read
  418. };
  419. static struct disk_attribute disk_attr_stat = {
  420. .attr = {.name = "stat", .mode = S_IRUGO },
  421. .show = disk_stats_read
  422. };
  423. static struct attribute * default_attrs[] = {
  424. &disk_attr_uevent.attr,
  425. &disk_attr_dev.attr,
  426. &disk_attr_range.attr,
  427. &disk_attr_removable.attr,
  428. &disk_attr_size.attr,
  429. &disk_attr_stat.attr,
  430. NULL,
  431. };
  432. static void disk_release(struct kobject * kobj)
  433. {
  434. struct gendisk *disk = to_disk(kobj);
  435. kfree(disk->random);
  436. kfree(disk->part);
  437. free_disk_stats(disk);
  438. kfree(disk);
  439. }
  440. static struct kobj_type ktype_block = {
  441. .release = disk_release,
  442. .sysfs_ops = &disk_sysfs_ops,
  443. .default_attrs = default_attrs,
  444. };
  445. extern struct kobj_type ktype_part;
  446. static int block_uevent_filter(struct kset *kset, struct kobject *kobj)
  447. {
  448. struct kobj_type *ktype = get_ktype(kobj);
  449. return ((ktype == &ktype_block) || (ktype == &ktype_part));
  450. }
  451. static int block_uevent(struct kset *kset, struct kobject *kobj, char **envp,
  452. int num_envp, char *buffer, int buffer_size)
  453. {
  454. struct kobj_type *ktype = get_ktype(kobj);
  455. struct device *physdev;
  456. struct gendisk *disk;
  457. struct hd_struct *part;
  458. int length = 0;
  459. int i = 0;
  460. if (ktype == &ktype_block) {
  461. disk = container_of(kobj, struct gendisk, kobj);
  462. add_uevent_var(envp, num_envp, &i, buffer, buffer_size,
  463. &length, "MINOR=%u", disk->first_minor);
  464. } else if (ktype == &ktype_part) {
  465. disk = container_of(kobj->parent, struct gendisk, kobj);
  466. part = container_of(kobj, struct hd_struct, kobj);
  467. add_uevent_var(envp, num_envp, &i, buffer, buffer_size,
  468. &length, "MINOR=%u",
  469. disk->first_minor + part->partno);
  470. } else
  471. return 0;
  472. add_uevent_var(envp, num_envp, &i, buffer, buffer_size, &length,
  473. "MAJOR=%u", disk->major);
  474. /* add physical device, backing this device */
  475. physdev = disk->driverfs_dev;
  476. if (physdev) {
  477. char *path = kobject_get_path(&physdev->kobj, GFP_KERNEL);
  478. add_uevent_var(envp, num_envp, &i, buffer, buffer_size,
  479. &length, "PHYSDEVPATH=%s", path);
  480. kfree(path);
  481. if (physdev->bus)
  482. add_uevent_var(envp, num_envp, &i,
  483. buffer, buffer_size, &length,
  484. "PHYSDEVBUS=%s",
  485. physdev->bus->name);
  486. if (physdev->driver)
  487. add_uevent_var(envp, num_envp, &i,
  488. buffer, buffer_size, &length,
  489. "PHYSDEVDRIVER=%s",
  490. physdev->driver->name);
  491. }
  492. /* terminate, set to next free slot, shrink available space */
  493. envp[i] = NULL;
  494. envp = &envp[i];
  495. num_envp -= i;
  496. buffer = &buffer[length];
  497. buffer_size -= length;
  498. return 0;
  499. }
  500. static struct kset_uevent_ops block_uevent_ops = {
  501. .filter = block_uevent_filter,
  502. .uevent = block_uevent,
  503. };
  504. /* declare block_subsys. */
  505. static decl_subsys(block, &ktype_block, &block_uevent_ops);
  506. /*
  507. * aggregate disk stat collector. Uses the same stats that the sysfs
  508. * entries do, above, but makes them available through one seq_file.
  509. * Watching a few disks may be efficient through sysfs, but watching
  510. * all of them will be more efficient through this interface.
  511. *
  512. * The output looks suspiciously like /proc/partitions with a bunch of
  513. * extra fields.
  514. */
  515. /* iterator */
  516. static void *diskstats_start(struct seq_file *part, loff_t *pos)
  517. {
  518. loff_t k = *pos;
  519. struct list_head *p;
  520. down(&block_subsys_sem);
  521. list_for_each(p, &block_subsys.kset.list)
  522. if (!k--)
  523. return list_entry(p, struct gendisk, kobj.entry);
  524. return NULL;
  525. }
  526. static void *diskstats_next(struct seq_file *part, void *v, loff_t *pos)
  527. {
  528. struct list_head *p = ((struct gendisk *)v)->kobj.entry.next;
  529. ++*pos;
  530. return p==&block_subsys.kset.list ? NULL :
  531. list_entry(p, struct gendisk, kobj.entry);
  532. }
  533. static void diskstats_stop(struct seq_file *part, void *v)
  534. {
  535. up(&block_subsys_sem);
  536. }
  537. static int diskstats_show(struct seq_file *s, void *v)
  538. {
  539. struct gendisk *gp = v;
  540. char buf[BDEVNAME_SIZE];
  541. int n = 0;
  542. /*
  543. if (&sgp->kobj.entry == block_subsys.kset.list.next)
  544. seq_puts(s, "major minor name"
  545. " rio rmerge rsect ruse wio wmerge "
  546. "wsect wuse running use aveq"
  547. "\n\n");
  548. */
  549. preempt_disable();
  550. disk_round_stats(gp);
  551. preempt_enable();
  552. seq_printf(s, "%4d %4d %s %u %u %llu %u %u %u %llu %u %u %u %u\n",
  553. gp->major, n + gp->first_minor, disk_name(gp, n, buf),
  554. disk_stat_read(gp, ios[0]), disk_stat_read(gp, merges[0]),
  555. (unsigned long long)disk_stat_read(gp, sectors[0]),
  556. jiffies_to_msecs(disk_stat_read(gp, ticks[0])),
  557. disk_stat_read(gp, ios[1]), disk_stat_read(gp, merges[1]),
  558. (unsigned long long)disk_stat_read(gp, sectors[1]),
  559. jiffies_to_msecs(disk_stat_read(gp, ticks[1])),
  560. gp->in_flight,
  561. jiffies_to_msecs(disk_stat_read(gp, io_ticks)),
  562. jiffies_to_msecs(disk_stat_read(gp, time_in_queue)));
  563. /* now show all non-0 size partitions of it */
  564. for (n = 0; n < gp->minors - 1; n++) {
  565. struct hd_struct *hd = gp->part[n];
  566. if (hd && hd->nr_sects)
  567. seq_printf(s, "%4d %4d %s %u %u %u %u\n",
  568. gp->major, n + gp->first_minor + 1,
  569. disk_name(gp, n + 1, buf),
  570. hd->ios[0], hd->sectors[0],
  571. hd->ios[1], hd->sectors[1]);
  572. }
  573. return 0;
  574. }
  575. struct seq_operations diskstats_op = {
  576. .start = diskstats_start,
  577. .next = diskstats_next,
  578. .stop = diskstats_stop,
  579. .show = diskstats_show
  580. };
  581. struct gendisk *alloc_disk(int minors)
  582. {
  583. return alloc_disk_node(minors, -1);
  584. }
  585. struct gendisk *alloc_disk_node(int minors, int node_id)
  586. {
  587. struct gendisk *disk;
  588. disk = kmalloc_node(sizeof(struct gendisk), GFP_KERNEL, node_id);
  589. if (disk) {
  590. memset(disk, 0, sizeof(struct gendisk));
  591. if (!init_disk_stats(disk)) {
  592. kfree(disk);
  593. return NULL;
  594. }
  595. if (minors > 1) {
  596. int size = (minors - 1) * sizeof(struct hd_struct *);
  597. disk->part = kmalloc_node(size, GFP_KERNEL, node_id);
  598. if (!disk->part) {
  599. kfree(disk);
  600. return NULL;
  601. }
  602. memset(disk->part, 0, size);
  603. }
  604. disk->minors = minors;
  605. kobj_set_kset_s(disk,block_subsys);
  606. kobject_init(&disk->kobj);
  607. rand_initialize_disk(disk);
  608. }
  609. return disk;
  610. }
  611. EXPORT_SYMBOL(alloc_disk);
  612. EXPORT_SYMBOL(alloc_disk_node);
  613. struct kobject *get_disk(struct gendisk *disk)
  614. {
  615. struct module *owner;
  616. struct kobject *kobj;
  617. if (!disk->fops)
  618. return NULL;
  619. owner = disk->fops->owner;
  620. if (owner && !try_module_get(owner))
  621. return NULL;
  622. kobj = kobject_get(&disk->kobj);
  623. if (kobj == NULL) {
  624. module_put(owner);
  625. return NULL;
  626. }
  627. return kobj;
  628. }
  629. EXPORT_SYMBOL(get_disk);
  630. void put_disk(struct gendisk *disk)
  631. {
  632. if (disk)
  633. kobject_put(&disk->kobj);
  634. }
  635. EXPORT_SYMBOL(put_disk);
  636. void set_device_ro(struct block_device *bdev, int flag)
  637. {
  638. if (bdev->bd_contains != bdev)
  639. bdev->bd_part->policy = flag;
  640. else
  641. bdev->bd_disk->policy = flag;
  642. }
  643. EXPORT_SYMBOL(set_device_ro);
  644. void set_disk_ro(struct gendisk *disk, int flag)
  645. {
  646. int i;
  647. disk->policy = flag;
  648. for (i = 0; i < disk->minors - 1; i++)
  649. if (disk->part[i]) disk->part[i]->policy = flag;
  650. }
  651. EXPORT_SYMBOL(set_disk_ro);
  652. int bdev_read_only(struct block_device *bdev)
  653. {
  654. if (!bdev)
  655. return 0;
  656. else if (bdev->bd_contains != bdev)
  657. return bdev->bd_part->policy;
  658. else
  659. return bdev->bd_disk->policy;
  660. }
  661. EXPORT_SYMBOL(bdev_read_only);
  662. int invalidate_partition(struct gendisk *disk, int index)
  663. {
  664. int res = 0;
  665. struct block_device *bdev = bdget_disk(disk, index);
  666. if (bdev) {
  667. fsync_bdev(bdev);
  668. res = __invalidate_device(bdev);
  669. bdput(bdev);
  670. }
  671. return res;
  672. }
  673. EXPORT_SYMBOL(invalidate_partition);