dm-linear.c 3.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183
  1. /*
  2. * Copyright (C) 2001-2003 Sistina Software (UK) Limited.
  3. *
  4. * This file is released under the GPL.
  5. */
  6. #include "dm.h"
  7. #include <linux/module.h>
  8. #include <linux/init.h>
  9. #include <linux/blkdev.h>
  10. #include <linux/bio.h>
  11. #include <linux/slab.h>
  12. #include <linux/device-mapper.h>
  13. #define DM_MSG_PREFIX "linear"
  14. /*
  15. * Linear: maps a linear range of a device.
  16. */
  17. struct linear_c {
  18. struct dm_dev *dev;
  19. sector_t start;
  20. };
  21. /*
  22. * Construct a linear mapping: <dev_path> <offset>
  23. */
  24. static int linear_ctr(struct dm_target *ti, unsigned int argc, char **argv)
  25. {
  26. struct linear_c *lc;
  27. unsigned long long tmp;
  28. char dummy;
  29. if (argc != 2) {
  30. ti->error = "Invalid argument count";
  31. return -EINVAL;
  32. }
  33. lc = kmalloc(sizeof(*lc), GFP_KERNEL);
  34. if (lc == NULL) {
  35. ti->error = "dm-linear: Cannot allocate linear context";
  36. return -ENOMEM;
  37. }
  38. if (sscanf(argv[1], "%llu%c", &tmp, &dummy) != 1) {
  39. ti->error = "dm-linear: Invalid device sector";
  40. goto bad;
  41. }
  42. lc->start = tmp;
  43. if (dm_get_device(ti, argv[0], dm_table_get_mode(ti->table), &lc->dev)) {
  44. ti->error = "dm-linear: Device lookup failed";
  45. goto bad;
  46. }
  47. ti->num_flush_requests = 1;
  48. ti->num_discard_requests = 1;
  49. ti->num_write_same_requests = 1;
  50. ti->private = lc;
  51. return 0;
  52. bad:
  53. kfree(lc);
  54. return -EINVAL;
  55. }
  56. static void linear_dtr(struct dm_target *ti)
  57. {
  58. struct linear_c *lc = (struct linear_c *) ti->private;
  59. dm_put_device(ti, lc->dev);
  60. kfree(lc);
  61. }
  62. static sector_t linear_map_sector(struct dm_target *ti, sector_t bi_sector)
  63. {
  64. struct linear_c *lc = ti->private;
  65. return lc->start + dm_target_offset(ti, bi_sector);
  66. }
  67. static void linear_map_bio(struct dm_target *ti, struct bio *bio)
  68. {
  69. struct linear_c *lc = ti->private;
  70. bio->bi_bdev = lc->dev->bdev;
  71. if (bio_sectors(bio))
  72. bio->bi_sector = linear_map_sector(ti, bio->bi_sector);
  73. }
  74. static int linear_map(struct dm_target *ti, struct bio *bio,
  75. union map_info *map_context)
  76. {
  77. linear_map_bio(ti, bio);
  78. return DM_MAPIO_REMAPPED;
  79. }
  80. static int linear_status(struct dm_target *ti, status_type_t type,
  81. unsigned status_flags, char *result, unsigned maxlen)
  82. {
  83. struct linear_c *lc = (struct linear_c *) ti->private;
  84. switch (type) {
  85. case STATUSTYPE_INFO:
  86. result[0] = '\0';
  87. break;
  88. case STATUSTYPE_TABLE:
  89. snprintf(result, maxlen, "%s %llu", lc->dev->name,
  90. (unsigned long long)lc->start);
  91. break;
  92. }
  93. return 0;
  94. }
  95. static int linear_ioctl(struct dm_target *ti, unsigned int cmd,
  96. unsigned long arg)
  97. {
  98. struct linear_c *lc = (struct linear_c *) ti->private;
  99. struct dm_dev *dev = lc->dev;
  100. int r = 0;
  101. /*
  102. * Only pass ioctls through if the device sizes match exactly.
  103. */
  104. if (lc->start ||
  105. ti->len != i_size_read(dev->bdev->bd_inode) >> SECTOR_SHIFT)
  106. r = scsi_verify_blk_ioctl(NULL, cmd);
  107. return r ? : __blkdev_driver_ioctl(dev->bdev, dev->mode, cmd, arg);
  108. }
  109. static int linear_merge(struct dm_target *ti, struct bvec_merge_data *bvm,
  110. struct bio_vec *biovec, int max_size)
  111. {
  112. struct linear_c *lc = ti->private;
  113. struct request_queue *q = bdev_get_queue(lc->dev->bdev);
  114. if (!q->merge_bvec_fn)
  115. return max_size;
  116. bvm->bi_bdev = lc->dev->bdev;
  117. bvm->bi_sector = linear_map_sector(ti, bvm->bi_sector);
  118. return min(max_size, q->merge_bvec_fn(q, bvm, biovec));
  119. }
  120. static int linear_iterate_devices(struct dm_target *ti,
  121. iterate_devices_callout_fn fn, void *data)
  122. {
  123. struct linear_c *lc = ti->private;
  124. return fn(ti, lc->dev, lc->start, ti->len, data);
  125. }
  126. static struct target_type linear_target = {
  127. .name = "linear",
  128. .version = {1, 2, 0},
  129. .module = THIS_MODULE,
  130. .ctr = linear_ctr,
  131. .dtr = linear_dtr,
  132. .map = linear_map,
  133. .status = linear_status,
  134. .ioctl = linear_ioctl,
  135. .merge = linear_merge,
  136. .iterate_devices = linear_iterate_devices,
  137. };
  138. int __init dm_linear_init(void)
  139. {
  140. int r = dm_register_target(&linear_target);
  141. if (r < 0)
  142. DMERR("register failed %d", r);
  143. return r;
  144. }
  145. void dm_linear_exit(void)
  146. {
  147. dm_unregister_target(&linear_target);
  148. }