blocklayoutdev.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394
  1. /*
  2. * linux/fs/nfs/blocklayout/blocklayoutdev.c
  3. *
  4. * Device operations for the pnfs nfs4 file layout driver.
  5. *
  6. * Copyright (c) 2006 The Regents of the University of Michigan.
  7. * All rights reserved.
  8. *
  9. * Andy Adamson <andros@citi.umich.edu>
  10. * Fred Isaman <iisaman@umich.edu>
  11. *
  12. * permission is granted to use, copy, create derivative works and
  13. * redistribute this software and such derivative works for any purpose,
  14. * so long as the name of the university of michigan is not used in
  15. * any advertising or publicity pertaining to the use or distribution
  16. * of this software without specific, written prior authorization. if
  17. * the above copyright notice or any other identification of the
  18. * university of michigan is included in any copy of any portion of
  19. * this software, then the disclaimer below must also be included.
  20. *
  21. * this software is provided as is, without representation from the
  22. * university of michigan as to its fitness for any purpose, and without
  23. * warranty by the university of michigan of any kind, either express
  24. * or implied, including without limitation the implied warranties of
  25. * merchantability and fitness for a particular purpose. the regents
  26. * of the university of michigan shall not be liable for any damages,
  27. * including special, indirect, incidental, or consequential damages,
  28. * with respect to any claim arising out or in connection with the use
  29. * of the software, even if it has been or is hereafter advised of the
  30. * possibility of such damages.
  31. */
  32. #include <linux/module.h>
  33. #include <linux/buffer_head.h> /* __bread */
  34. #include <linux/genhd.h>
  35. #include <linux/blkdev.h>
  36. #include <linux/hash.h>
  37. #include "blocklayout.h"
  38. #define NFSDBG_FACILITY NFSDBG_PNFS_LD
  39. static int decode_sector_number(__be32 **rp, sector_t *sp)
  40. {
  41. uint64_t s;
  42. *rp = xdr_decode_hyper(*rp, &s);
  43. if (s & 0x1ff) {
  44. printk(KERN_WARNING "NFS: %s: sector not aligned\n", __func__);
  45. return -1;
  46. }
  47. *sp = s >> SECTOR_SHIFT;
  48. return 0;
  49. }
  50. /* Open a block_device by device number. */
  51. struct block_device *nfs4_blkdev_get(dev_t dev)
  52. {
  53. struct block_device *bd;
  54. dprintk("%s enter\n", __func__);
  55. bd = blkdev_get_by_dev(dev, FMODE_READ, NULL);
  56. if (IS_ERR(bd))
  57. goto fail;
  58. return bd;
  59. fail:
  60. dprintk("%s failed to open device : %ld\n",
  61. __func__, PTR_ERR(bd));
  62. return NULL;
  63. }
  64. /*
  65. * Release the block device
  66. */
  67. int nfs4_blkdev_put(struct block_device *bdev)
  68. {
  69. dprintk("%s for device %d:%d\n", __func__, MAJOR(bdev->bd_dev),
  70. MINOR(bdev->bd_dev));
  71. return blkdev_put(bdev, FMODE_READ);
  72. }
  73. static struct bl_dev_msg bl_mount_reply;
  74. ssize_t bl_pipe_downcall(struct file *filp, const char __user *src,
  75. size_t mlen)
  76. {
  77. if (mlen != sizeof (struct bl_dev_msg))
  78. return -EINVAL;
  79. if (copy_from_user(&bl_mount_reply, src, mlen) != 0)
  80. return -EFAULT;
  81. wake_up(&bl_wq);
  82. return mlen;
  83. }
  84. void bl_pipe_destroy_msg(struct rpc_pipe_msg *msg)
  85. {
  86. if (msg->errno >= 0)
  87. return;
  88. wake_up(&bl_wq);
  89. }
  90. /*
  91. * Decodes pnfs_block_deviceaddr4 which is XDR encoded in dev->dev_addr_buf.
  92. */
  93. struct pnfs_block_dev *
  94. nfs4_blk_decode_device(struct nfs_server *server,
  95. struct pnfs_device *dev)
  96. {
  97. struct pnfs_block_dev *rv;
  98. struct block_device *bd = NULL;
  99. struct rpc_pipe_msg msg;
  100. struct bl_msg_hdr bl_msg = {
  101. .type = BL_DEVICE_MOUNT,
  102. .totallen = dev->mincount,
  103. };
  104. uint8_t *dataptr;
  105. DECLARE_WAITQUEUE(wq, current);
  106. struct bl_dev_msg *reply = &bl_mount_reply;
  107. int offset, len, i, rc;
  108. struct net *net = server->nfs_client->net;
  109. struct nfs_net *nn = net_generic(net, nfs_net_id);
  110. dprintk("%s CREATING PIPEFS MESSAGE\n", __func__);
  111. dprintk("%s: deviceid: %s, mincount: %d\n", __func__, dev->dev_id.data,
  112. dev->mincount);
  113. memset(&msg, 0, sizeof(msg));
  114. msg.data = kzalloc(sizeof(bl_msg) + dev->mincount, GFP_NOFS);
  115. if (!msg.data) {
  116. rv = ERR_PTR(-ENOMEM);
  117. goto out;
  118. }
  119. memcpy(msg.data, &bl_msg, sizeof(bl_msg));
  120. dataptr = (uint8_t *) msg.data;
  121. len = dev->mincount;
  122. offset = sizeof(bl_msg);
  123. for (i = 0; len > 0; i++) {
  124. memcpy(&dataptr[offset], page_address(dev->pages[i]),
  125. len < PAGE_CACHE_SIZE ? len : PAGE_CACHE_SIZE);
  126. len -= PAGE_CACHE_SIZE;
  127. offset += PAGE_CACHE_SIZE;
  128. }
  129. msg.len = sizeof(bl_msg) + dev->mincount;
  130. dprintk("%s CALLING USERSPACE DAEMON\n", __func__);
  131. add_wait_queue(&bl_wq, &wq);
  132. rc = rpc_queue_upcall(nn->bl_device_pipe, &msg);
  133. if (rc < 0) {
  134. remove_wait_queue(&bl_wq, &wq);
  135. rv = ERR_PTR(rc);
  136. goto out;
  137. }
  138. set_current_state(TASK_UNINTERRUPTIBLE);
  139. schedule();
  140. __set_current_state(TASK_RUNNING);
  141. remove_wait_queue(&bl_wq, &wq);
  142. if (reply->status != BL_DEVICE_REQUEST_PROC) {
  143. dprintk("%s failed to open device: %d\n",
  144. __func__, reply->status);
  145. rv = ERR_PTR(-EINVAL);
  146. goto out;
  147. }
  148. bd = nfs4_blkdev_get(MKDEV(reply->major, reply->minor));
  149. if (IS_ERR(bd)) {
  150. rc = PTR_ERR(bd);
  151. dprintk("%s failed to open device : %d\n", __func__, rc);
  152. rv = ERR_PTR(rc);
  153. goto out;
  154. }
  155. rv = kzalloc(sizeof(*rv), GFP_NOFS);
  156. if (!rv) {
  157. rv = ERR_PTR(-ENOMEM);
  158. goto out;
  159. }
  160. rv->bm_mdev = bd;
  161. memcpy(&rv->bm_mdevid, &dev->dev_id, sizeof(struct nfs4_deviceid));
  162. rv->net = net;
  163. dprintk("%s Created device %s with bd_block_size %u\n",
  164. __func__,
  165. bd->bd_disk->disk_name,
  166. bd->bd_block_size);
  167. out:
  168. kfree(msg.data);
  169. return rv;
  170. }
  171. /* Map deviceid returned by the server to constructed block_device */
  172. static struct block_device *translate_devid(struct pnfs_layout_hdr *lo,
  173. struct nfs4_deviceid *id)
  174. {
  175. struct block_device *rv = NULL;
  176. struct block_mount_id *mid;
  177. struct pnfs_block_dev *dev;
  178. dprintk("%s enter, lo=%p, id=%p\n", __func__, lo, id);
  179. mid = BLK_ID(lo);
  180. spin_lock(&mid->bm_lock);
  181. list_for_each_entry(dev, &mid->bm_devlist, bm_node) {
  182. if (memcmp(id->data, dev->bm_mdevid.data,
  183. NFS4_DEVICEID4_SIZE) == 0) {
  184. rv = dev->bm_mdev;
  185. goto out;
  186. }
  187. }
  188. out:
  189. spin_unlock(&mid->bm_lock);
  190. dprintk("%s returning %p\n", __func__, rv);
  191. return rv;
  192. }
  193. /* Tracks info needed to ensure extents in layout obey constraints of spec */
  194. struct layout_verification {
  195. u32 mode; /* R or RW */
  196. u64 start; /* Expected start of next non-COW extent */
  197. u64 inval; /* Start of INVAL coverage */
  198. u64 cowread; /* End of COW read coverage */
  199. };
  200. /* Verify the extent meets the layout requirements of the pnfs-block draft,
  201. * section 2.3.1.
  202. */
  203. static int verify_extent(struct pnfs_block_extent *be,
  204. struct layout_verification *lv)
  205. {
  206. if (lv->mode == IOMODE_READ) {
  207. if (be->be_state == PNFS_BLOCK_READWRITE_DATA ||
  208. be->be_state == PNFS_BLOCK_INVALID_DATA)
  209. return -EIO;
  210. if (be->be_f_offset != lv->start)
  211. return -EIO;
  212. lv->start += be->be_length;
  213. return 0;
  214. }
  215. /* lv->mode == IOMODE_RW */
  216. if (be->be_state == PNFS_BLOCK_READWRITE_DATA) {
  217. if (be->be_f_offset != lv->start)
  218. return -EIO;
  219. if (lv->cowread > lv->start)
  220. return -EIO;
  221. lv->start += be->be_length;
  222. lv->inval = lv->start;
  223. return 0;
  224. } else if (be->be_state == PNFS_BLOCK_INVALID_DATA) {
  225. if (be->be_f_offset != lv->start)
  226. return -EIO;
  227. lv->start += be->be_length;
  228. return 0;
  229. } else if (be->be_state == PNFS_BLOCK_READ_DATA) {
  230. if (be->be_f_offset > lv->start)
  231. return -EIO;
  232. if (be->be_f_offset < lv->inval)
  233. return -EIO;
  234. if (be->be_f_offset < lv->cowread)
  235. return -EIO;
  236. /* It looks like you might want to min this with lv->start,
  237. * but you really don't.
  238. */
  239. lv->inval = lv->inval + be->be_length;
  240. lv->cowread = be->be_f_offset + be->be_length;
  241. return 0;
  242. } else
  243. return -EIO;
  244. }
  245. /* XDR decode pnfs_block_layout4 structure */
  246. int
  247. nfs4_blk_process_layoutget(struct pnfs_layout_hdr *lo,
  248. struct nfs4_layoutget_res *lgr, gfp_t gfp_flags)
  249. {
  250. struct pnfs_block_layout *bl = BLK_LO2EXT(lo);
  251. int i, status = -EIO;
  252. uint32_t count;
  253. struct pnfs_block_extent *be = NULL, *save;
  254. struct xdr_stream stream;
  255. struct xdr_buf buf;
  256. struct page *scratch;
  257. __be32 *p;
  258. struct layout_verification lv = {
  259. .mode = lgr->range.iomode,
  260. .start = lgr->range.offset >> SECTOR_SHIFT,
  261. .inval = lgr->range.offset >> SECTOR_SHIFT,
  262. .cowread = lgr->range.offset >> SECTOR_SHIFT,
  263. };
  264. LIST_HEAD(extents);
  265. dprintk("---> %s\n", __func__);
  266. scratch = alloc_page(gfp_flags);
  267. if (!scratch)
  268. return -ENOMEM;
  269. xdr_init_decode_pages(&stream, &buf, lgr->layoutp->pages, lgr->layoutp->len);
  270. xdr_set_scratch_buffer(&stream, page_address(scratch), PAGE_SIZE);
  271. p = xdr_inline_decode(&stream, 4);
  272. if (unlikely(!p))
  273. goto out_err;
  274. count = be32_to_cpup(p++);
  275. dprintk("%s enter, number of extents %i\n", __func__, count);
  276. p = xdr_inline_decode(&stream, (28 + NFS4_DEVICEID4_SIZE) * count);
  277. if (unlikely(!p))
  278. goto out_err;
  279. /* Decode individual extents, putting them in temporary
  280. * staging area until whole layout is decoded to make error
  281. * recovery easier.
  282. */
  283. for (i = 0; i < count; i++) {
  284. be = bl_alloc_extent();
  285. if (!be) {
  286. status = -ENOMEM;
  287. goto out_err;
  288. }
  289. memcpy(&be->be_devid, p, NFS4_DEVICEID4_SIZE);
  290. p += XDR_QUADLEN(NFS4_DEVICEID4_SIZE);
  291. be->be_mdev = translate_devid(lo, &be->be_devid);
  292. if (!be->be_mdev)
  293. goto out_err;
  294. /* The next three values are read in as bytes,
  295. * but stored as 512-byte sector lengths
  296. */
  297. if (decode_sector_number(&p, &be->be_f_offset) < 0)
  298. goto out_err;
  299. if (decode_sector_number(&p, &be->be_length) < 0)
  300. goto out_err;
  301. if (decode_sector_number(&p, &be->be_v_offset) < 0)
  302. goto out_err;
  303. be->be_state = be32_to_cpup(p++);
  304. if (be->be_state == PNFS_BLOCK_INVALID_DATA)
  305. be->be_inval = &bl->bl_inval;
  306. if (verify_extent(be, &lv)) {
  307. dprintk("%s verify failed\n", __func__);
  308. goto out_err;
  309. }
  310. list_add_tail(&be->be_node, &extents);
  311. }
  312. if (lgr->range.offset + lgr->range.length !=
  313. lv.start << SECTOR_SHIFT) {
  314. dprintk("%s Final length mismatch\n", __func__);
  315. be = NULL;
  316. goto out_err;
  317. }
  318. if (lv.start < lv.cowread) {
  319. dprintk("%s Final uncovered COW extent\n", __func__);
  320. be = NULL;
  321. goto out_err;
  322. }
  323. /* Extents decoded properly, now try to merge them in to
  324. * existing layout extents.
  325. */
  326. spin_lock(&bl->bl_ext_lock);
  327. list_for_each_entry_safe(be, save, &extents, be_node) {
  328. list_del(&be->be_node);
  329. status = bl_add_merge_extent(bl, be);
  330. if (status) {
  331. spin_unlock(&bl->bl_ext_lock);
  332. /* This is a fairly catastrophic error, as the
  333. * entire layout extent lists are now corrupted.
  334. * We should have some way to distinguish this.
  335. */
  336. be = NULL;
  337. goto out_err;
  338. }
  339. }
  340. spin_unlock(&bl->bl_ext_lock);
  341. status = 0;
  342. out:
  343. __free_page(scratch);
  344. dprintk("%s returns %i\n", __func__, status);
  345. return status;
  346. out_err:
  347. bl_put_extent(be);
  348. while (!list_empty(&extents)) {
  349. be = list_first_entry(&extents, struct pnfs_block_extent,
  350. be_node);
  351. list_del(&be->be_node);
  352. bl_put_extent(be);
  353. }
  354. goto out;
  355. }