genhd.c 18 KB

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