blk-integrity.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483
  1. /*
  2. * blk-integrity.c - Block layer data integrity extensions
  3. *
  4. * Copyright (C) 2007, 2008 Oracle Corporation
  5. * Written by: Martin K. Petersen <martin.petersen@oracle.com>
  6. *
  7. * This program is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU General Public License version
  9. * 2 as published by the Free Software Foundation.
  10. *
  11. * This program is distributed in the hope that it will be useful, but
  12. * WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program; see the file COPYING. If not, write to
  18. * the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139,
  19. * USA.
  20. *
  21. */
  22. #include <linux/blkdev.h>
  23. #include <linux/mempool.h>
  24. #include <linux/bio.h>
  25. #include <linux/scatterlist.h>
  26. #include <linux/export.h>
  27. #include <linux/slab.h>
  28. #include "blk.h"
  29. static struct kmem_cache *integrity_cachep;
  30. static const char *bi_unsupported_name = "unsupported";
  31. /**
  32. * blk_rq_count_integrity_sg - Count number of integrity scatterlist elements
  33. * @q: request queue
  34. * @bio: bio with integrity metadata attached
  35. *
  36. * Description: Returns the number of elements required in a
  37. * scatterlist corresponding to the integrity metadata in a bio.
  38. */
  39. int blk_rq_count_integrity_sg(struct request_queue *q, struct bio *bio)
  40. {
  41. struct bio_vec iv, ivprv = { NULL };
  42. unsigned int segments = 0;
  43. unsigned int seg_size = 0;
  44. struct bvec_iter iter;
  45. int prev = 0;
  46. bio_for_each_integrity_vec(iv, bio, iter) {
  47. if (prev) {
  48. if (!BIOVEC_PHYS_MERGEABLE(&ivprv, &iv))
  49. goto new_segment;
  50. if (!BIOVEC_SEG_BOUNDARY(q, &ivprv, &iv))
  51. goto new_segment;
  52. if (seg_size + iv.bv_len > queue_max_segment_size(q))
  53. goto new_segment;
  54. seg_size += iv.bv_len;
  55. } else {
  56. new_segment:
  57. segments++;
  58. seg_size = iv.bv_len;
  59. }
  60. prev = 1;
  61. ivprv = iv;
  62. }
  63. return segments;
  64. }
  65. EXPORT_SYMBOL(blk_rq_count_integrity_sg);
  66. /**
  67. * blk_rq_map_integrity_sg - Map integrity metadata into a scatterlist
  68. * @q: request queue
  69. * @bio: bio with integrity metadata attached
  70. * @sglist: target scatterlist
  71. *
  72. * Description: Map the integrity vectors in request into a
  73. * scatterlist. The scatterlist must be big enough to hold all
  74. * elements. I.e. sized using blk_rq_count_integrity_sg().
  75. */
  76. int blk_rq_map_integrity_sg(struct request_queue *q, struct bio *bio,
  77. struct scatterlist *sglist)
  78. {
  79. struct bio_vec iv, ivprv = { NULL };
  80. struct scatterlist *sg = NULL;
  81. unsigned int segments = 0;
  82. struct bvec_iter iter;
  83. int prev = 0;
  84. bio_for_each_integrity_vec(iv, bio, iter) {
  85. if (prev) {
  86. if (!BIOVEC_PHYS_MERGEABLE(&ivprv, &iv))
  87. goto new_segment;
  88. if (!BIOVEC_SEG_BOUNDARY(q, &ivprv, &iv))
  89. goto new_segment;
  90. if (sg->length + iv.bv_len > queue_max_segment_size(q))
  91. goto new_segment;
  92. sg->length += iv.bv_len;
  93. } else {
  94. new_segment:
  95. if (!sg)
  96. sg = sglist;
  97. else {
  98. sg_unmark_end(sg);
  99. sg = sg_next(sg);
  100. }
  101. sg_set_page(sg, iv.bv_page, iv.bv_len, iv.bv_offset);
  102. segments++;
  103. }
  104. prev = 1;
  105. ivprv = iv;
  106. }
  107. if (sg)
  108. sg_mark_end(sg);
  109. return segments;
  110. }
  111. EXPORT_SYMBOL(blk_rq_map_integrity_sg);
  112. /**
  113. * blk_integrity_compare - Compare integrity profile of two disks
  114. * @gd1: Disk to compare
  115. * @gd2: Disk to compare
  116. *
  117. * Description: Meta-devices like DM and MD need to verify that all
  118. * sub-devices use the same integrity format before advertising to
  119. * upper layers that they can send/receive integrity metadata. This
  120. * function can be used to check whether two gendisk devices have
  121. * compatible integrity formats.
  122. */
  123. int blk_integrity_compare(struct gendisk *gd1, struct gendisk *gd2)
  124. {
  125. struct blk_integrity *b1 = gd1->integrity;
  126. struct blk_integrity *b2 = gd2->integrity;
  127. if (!b1 && !b2)
  128. return 0;
  129. if (!b1 || !b2)
  130. return -1;
  131. if (b1->interval != b2->interval) {
  132. pr_err("%s: %s/%s protection interval %u != %u\n",
  133. __func__, gd1->disk_name, gd2->disk_name,
  134. b1->interval, b2->interval);
  135. return -1;
  136. }
  137. if (b1->tuple_size != b2->tuple_size) {
  138. printk(KERN_ERR "%s: %s/%s tuple sz %u != %u\n", __func__,
  139. gd1->disk_name, gd2->disk_name,
  140. b1->tuple_size, b2->tuple_size);
  141. return -1;
  142. }
  143. if (b1->tag_size && b2->tag_size && (b1->tag_size != b2->tag_size)) {
  144. printk(KERN_ERR "%s: %s/%s tag sz %u != %u\n", __func__,
  145. gd1->disk_name, gd2->disk_name,
  146. b1->tag_size, b2->tag_size);
  147. return -1;
  148. }
  149. if (strcmp(b1->name, b2->name)) {
  150. printk(KERN_ERR "%s: %s/%s type %s != %s\n", __func__,
  151. gd1->disk_name, gd2->disk_name,
  152. b1->name, b2->name);
  153. return -1;
  154. }
  155. return 0;
  156. }
  157. EXPORT_SYMBOL(blk_integrity_compare);
  158. bool blk_integrity_merge_rq(struct request_queue *q, struct request *req,
  159. struct request *next)
  160. {
  161. if (blk_integrity_rq(req) == 0 && blk_integrity_rq(next) == 0)
  162. return true;
  163. if (blk_integrity_rq(req) == 0 || blk_integrity_rq(next) == 0)
  164. return false;
  165. if (bio_integrity(req->bio)->bip_flags !=
  166. bio_integrity(next->bio)->bip_flags)
  167. return false;
  168. if (req->nr_integrity_segments + next->nr_integrity_segments >
  169. q->limits.max_integrity_segments)
  170. return false;
  171. return true;
  172. }
  173. EXPORT_SYMBOL(blk_integrity_merge_rq);
  174. bool blk_integrity_merge_bio(struct request_queue *q, struct request *req,
  175. struct bio *bio)
  176. {
  177. int nr_integrity_segs;
  178. struct bio *next = bio->bi_next;
  179. if (blk_integrity_rq(req) == 0 && bio_integrity(bio) == NULL)
  180. return true;
  181. if (blk_integrity_rq(req) == 0 || bio_integrity(bio) == NULL)
  182. return false;
  183. if (bio_integrity(req->bio)->bip_flags != bio_integrity(bio)->bip_flags)
  184. return false;
  185. bio->bi_next = NULL;
  186. nr_integrity_segs = blk_rq_count_integrity_sg(q, bio);
  187. bio->bi_next = next;
  188. if (req->nr_integrity_segments + nr_integrity_segs >
  189. q->limits.max_integrity_segments)
  190. return false;
  191. req->nr_integrity_segments += nr_integrity_segs;
  192. return true;
  193. }
  194. EXPORT_SYMBOL(blk_integrity_merge_bio);
  195. struct integrity_sysfs_entry {
  196. struct attribute attr;
  197. ssize_t (*show)(struct blk_integrity *, char *);
  198. ssize_t (*store)(struct blk_integrity *, const char *, size_t);
  199. };
  200. static ssize_t integrity_attr_show(struct kobject *kobj, struct attribute *attr,
  201. char *page)
  202. {
  203. struct blk_integrity *bi =
  204. container_of(kobj, struct blk_integrity, kobj);
  205. struct integrity_sysfs_entry *entry =
  206. container_of(attr, struct integrity_sysfs_entry, attr);
  207. return entry->show(bi, page);
  208. }
  209. static ssize_t integrity_attr_store(struct kobject *kobj,
  210. struct attribute *attr, const char *page,
  211. size_t count)
  212. {
  213. struct blk_integrity *bi =
  214. container_of(kobj, struct blk_integrity, kobj);
  215. struct integrity_sysfs_entry *entry =
  216. container_of(attr, struct integrity_sysfs_entry, attr);
  217. ssize_t ret = 0;
  218. if (entry->store)
  219. ret = entry->store(bi, page, count);
  220. return ret;
  221. }
  222. static ssize_t integrity_format_show(struct blk_integrity *bi, char *page)
  223. {
  224. if (bi != NULL && bi->name != NULL)
  225. return sprintf(page, "%s\n", bi->name);
  226. else
  227. return sprintf(page, "none\n");
  228. }
  229. static ssize_t integrity_tag_size_show(struct blk_integrity *bi, char *page)
  230. {
  231. if (bi != NULL)
  232. return sprintf(page, "%u\n", bi->tag_size);
  233. else
  234. return sprintf(page, "0\n");
  235. }
  236. static ssize_t integrity_verify_store(struct blk_integrity *bi,
  237. const char *page, size_t count)
  238. {
  239. char *p = (char *) page;
  240. unsigned long val = simple_strtoul(p, &p, 10);
  241. if (val)
  242. bi->flags |= BLK_INTEGRITY_VERIFY;
  243. else
  244. bi->flags &= ~BLK_INTEGRITY_VERIFY;
  245. return count;
  246. }
  247. static ssize_t integrity_verify_show(struct blk_integrity *bi, char *page)
  248. {
  249. return sprintf(page, "%d\n", (bi->flags & BLK_INTEGRITY_VERIFY) != 0);
  250. }
  251. static ssize_t integrity_generate_store(struct blk_integrity *bi,
  252. const char *page, size_t count)
  253. {
  254. char *p = (char *) page;
  255. unsigned long val = simple_strtoul(p, &p, 10);
  256. if (val)
  257. bi->flags |= BLK_INTEGRITY_GENERATE;
  258. else
  259. bi->flags &= ~BLK_INTEGRITY_GENERATE;
  260. return count;
  261. }
  262. static ssize_t integrity_generate_show(struct blk_integrity *bi, char *page)
  263. {
  264. return sprintf(page, "%d\n", (bi->flags & BLK_INTEGRITY_GENERATE) != 0);
  265. }
  266. static ssize_t integrity_device_show(struct blk_integrity *bi, char *page)
  267. {
  268. return sprintf(page, "%u\n",
  269. (bi->flags & BLK_INTEGRITY_DEVICE_CAPABLE) != 0);
  270. }
  271. static struct integrity_sysfs_entry integrity_format_entry = {
  272. .attr = { .name = "format", .mode = S_IRUGO },
  273. .show = integrity_format_show,
  274. };
  275. static struct integrity_sysfs_entry integrity_tag_size_entry = {
  276. .attr = { .name = "tag_size", .mode = S_IRUGO },
  277. .show = integrity_tag_size_show,
  278. };
  279. static struct integrity_sysfs_entry integrity_verify_entry = {
  280. .attr = { .name = "read_verify", .mode = S_IRUGO | S_IWUSR },
  281. .show = integrity_verify_show,
  282. .store = integrity_verify_store,
  283. };
  284. static struct integrity_sysfs_entry integrity_generate_entry = {
  285. .attr = { .name = "write_generate", .mode = S_IRUGO | S_IWUSR },
  286. .show = integrity_generate_show,
  287. .store = integrity_generate_store,
  288. };
  289. static struct integrity_sysfs_entry integrity_device_entry = {
  290. .attr = { .name = "device_is_integrity_capable", .mode = S_IRUGO },
  291. .show = integrity_device_show,
  292. };
  293. static struct attribute *integrity_attrs[] = {
  294. &integrity_format_entry.attr,
  295. &integrity_tag_size_entry.attr,
  296. &integrity_verify_entry.attr,
  297. &integrity_generate_entry.attr,
  298. &integrity_device_entry.attr,
  299. NULL,
  300. };
  301. static const struct sysfs_ops integrity_ops = {
  302. .show = &integrity_attr_show,
  303. .store = &integrity_attr_store,
  304. };
  305. static int __init blk_dev_integrity_init(void)
  306. {
  307. integrity_cachep = kmem_cache_create("blkdev_integrity",
  308. sizeof(struct blk_integrity),
  309. 0, SLAB_PANIC, NULL);
  310. return 0;
  311. }
  312. subsys_initcall(blk_dev_integrity_init);
  313. static void blk_integrity_release(struct kobject *kobj)
  314. {
  315. struct blk_integrity *bi =
  316. container_of(kobj, struct blk_integrity, kobj);
  317. kmem_cache_free(integrity_cachep, bi);
  318. }
  319. static struct kobj_type integrity_ktype = {
  320. .default_attrs = integrity_attrs,
  321. .sysfs_ops = &integrity_ops,
  322. .release = blk_integrity_release,
  323. };
  324. bool blk_integrity_is_initialized(struct gendisk *disk)
  325. {
  326. struct blk_integrity *bi = blk_get_integrity(disk);
  327. return (bi && bi->name && strcmp(bi->name, bi_unsupported_name) != 0);
  328. }
  329. EXPORT_SYMBOL(blk_integrity_is_initialized);
  330. /**
  331. * blk_integrity_register - Register a gendisk as being integrity-capable
  332. * @disk: struct gendisk pointer to make integrity-aware
  333. * @template: optional integrity profile to register
  334. *
  335. * Description: When a device needs to advertise itself as being able
  336. * to send/receive integrity metadata it must use this function to
  337. * register the capability with the block layer. The template is a
  338. * blk_integrity struct with values appropriate for the underlying
  339. * hardware. If template is NULL the new profile is allocated but
  340. * not filled out. See Documentation/block/data-integrity.txt.
  341. */
  342. int blk_integrity_register(struct gendisk *disk, struct blk_integrity *template)
  343. {
  344. struct blk_integrity *bi;
  345. BUG_ON(disk == NULL);
  346. if (disk->integrity == NULL) {
  347. bi = kmem_cache_alloc(integrity_cachep,
  348. GFP_KERNEL | __GFP_ZERO);
  349. if (!bi)
  350. return -1;
  351. if (kobject_init_and_add(&bi->kobj, &integrity_ktype,
  352. &disk_to_dev(disk)->kobj,
  353. "%s", "integrity")) {
  354. kmem_cache_free(integrity_cachep, bi);
  355. return -1;
  356. }
  357. kobject_uevent(&bi->kobj, KOBJ_ADD);
  358. bi->flags |= BLK_INTEGRITY_VERIFY | BLK_INTEGRITY_GENERATE;
  359. bi->interval = queue_logical_block_size(disk->queue);
  360. disk->integrity = bi;
  361. } else
  362. bi = disk->integrity;
  363. /* Use the provided profile as template */
  364. if (template != NULL) {
  365. bi->name = template->name;
  366. bi->generate_fn = template->generate_fn;
  367. bi->verify_fn = template->verify_fn;
  368. bi->tuple_size = template->tuple_size;
  369. bi->tag_size = template->tag_size;
  370. bi->flags |= template->flags;
  371. } else
  372. bi->name = bi_unsupported_name;
  373. disk->queue->backing_dev_info.capabilities |= BDI_CAP_STABLE_WRITES;
  374. return 0;
  375. }
  376. EXPORT_SYMBOL(blk_integrity_register);
  377. /**
  378. * blk_integrity_unregister - Remove block integrity profile
  379. * @disk: disk whose integrity profile to deallocate
  380. *
  381. * Description: This function frees all memory used by the block
  382. * integrity profile. To be called at device teardown.
  383. */
  384. void blk_integrity_unregister(struct gendisk *disk)
  385. {
  386. struct blk_integrity *bi;
  387. if (!disk || !disk->integrity)
  388. return;
  389. disk->queue->backing_dev_info.capabilities &= ~BDI_CAP_STABLE_WRITES;
  390. bi = disk->integrity;
  391. kobject_uevent(&bi->kobj, KOBJ_REMOVE);
  392. kobject_del(&bi->kobj);
  393. kobject_put(&bi->kobj);
  394. disk->integrity = NULL;
  395. }
  396. EXPORT_SYMBOL(blk_integrity_unregister);