blocklayoutdev.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395
  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. ssize_t bl_pipe_downcall(struct file *filp, const char __user *src,
  74. size_t mlen)
  75. {
  76. struct nfs_net *nn = net_generic(filp->f_dentry->d_sb->s_fs_info,
  77. nfs_net_id);
  78. if (mlen != sizeof (struct bl_dev_msg))
  79. return -EINVAL;
  80. if (copy_from_user(&nn->bl_mount_reply, src, mlen) != 0)
  81. return -EFAULT;
  82. wake_up(&bl_wq);
  83. return mlen;
  84. }
  85. void bl_pipe_destroy_msg(struct rpc_pipe_msg *msg)
  86. {
  87. if (msg->errno >= 0)
  88. return;
  89. wake_up(&bl_wq);
  90. }
  91. /*
  92. * Decodes pnfs_block_deviceaddr4 which is XDR encoded in dev->dev_addr_buf.
  93. */
  94. struct pnfs_block_dev *
  95. nfs4_blk_decode_device(struct nfs_server *server,
  96. struct pnfs_device *dev)
  97. {
  98. struct pnfs_block_dev *rv;
  99. struct block_device *bd = NULL;
  100. struct rpc_pipe_msg msg;
  101. struct bl_msg_hdr bl_msg = {
  102. .type = BL_DEVICE_MOUNT,
  103. .totallen = dev->mincount,
  104. };
  105. uint8_t *dataptr;
  106. DECLARE_WAITQUEUE(wq, current);
  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. struct bl_dev_msg *reply = &nn->bl_mount_reply;
  111. dprintk("%s CREATING PIPEFS MESSAGE\n", __func__);
  112. dprintk("%s: deviceid: %s, mincount: %d\n", __func__, dev->dev_id.data,
  113. dev->mincount);
  114. memset(&msg, 0, sizeof(msg));
  115. msg.data = kzalloc(sizeof(bl_msg) + dev->mincount, GFP_NOFS);
  116. if (!msg.data) {
  117. rv = ERR_PTR(-ENOMEM);
  118. goto out;
  119. }
  120. memcpy(msg.data, &bl_msg, sizeof(bl_msg));
  121. dataptr = (uint8_t *) msg.data;
  122. len = dev->mincount;
  123. offset = sizeof(bl_msg);
  124. for (i = 0; len > 0; i++) {
  125. memcpy(&dataptr[offset], page_address(dev->pages[i]),
  126. len < PAGE_CACHE_SIZE ? len : PAGE_CACHE_SIZE);
  127. len -= PAGE_CACHE_SIZE;
  128. offset += PAGE_CACHE_SIZE;
  129. }
  130. msg.len = sizeof(bl_msg) + dev->mincount;
  131. dprintk("%s CALLING USERSPACE DAEMON\n", __func__);
  132. add_wait_queue(&bl_wq, &wq);
  133. rc = rpc_queue_upcall(nn->bl_device_pipe, &msg);
  134. if (rc < 0) {
  135. remove_wait_queue(&bl_wq, &wq);
  136. rv = ERR_PTR(rc);
  137. goto out;
  138. }
  139. set_current_state(TASK_UNINTERRUPTIBLE);
  140. schedule();
  141. __set_current_state(TASK_RUNNING);
  142. remove_wait_queue(&bl_wq, &wq);
  143. if (reply->status != BL_DEVICE_REQUEST_PROC) {
  144. dprintk("%s failed to open device: %d\n",
  145. __func__, reply->status);
  146. rv = ERR_PTR(-EINVAL);
  147. goto out;
  148. }
  149. bd = nfs4_blkdev_get(MKDEV(reply->major, reply->minor));
  150. if (IS_ERR(bd)) {
  151. rc = PTR_ERR(bd);
  152. dprintk("%s failed to open device : %d\n", __func__, rc);
  153. rv = ERR_PTR(rc);
  154. goto out;
  155. }
  156. rv = kzalloc(sizeof(*rv), GFP_NOFS);
  157. if (!rv) {
  158. rv = ERR_PTR(-ENOMEM);
  159. goto out;
  160. }
  161. rv->bm_mdev = bd;
  162. memcpy(&rv->bm_mdevid, &dev->dev_id, sizeof(struct nfs4_deviceid));
  163. rv->net = net;
  164. dprintk("%s Created device %s with bd_block_size %u\n",
  165. __func__,
  166. bd->bd_disk->disk_name,
  167. bd->bd_block_size);
  168. out:
  169. kfree(msg.data);
  170. return rv;
  171. }
  172. /* Map deviceid returned by the server to constructed block_device */
  173. static struct block_device *translate_devid(struct pnfs_layout_hdr *lo,
  174. struct nfs4_deviceid *id)
  175. {
  176. struct block_device *rv = NULL;
  177. struct block_mount_id *mid;
  178. struct pnfs_block_dev *dev;
  179. dprintk("%s enter, lo=%p, id=%p\n", __func__, lo, id);
  180. mid = BLK_ID(lo);
  181. spin_lock(&mid->bm_lock);
  182. list_for_each_entry(dev, &mid->bm_devlist, bm_node) {
  183. if (memcmp(id->data, dev->bm_mdevid.data,
  184. NFS4_DEVICEID4_SIZE) == 0) {
  185. rv = dev->bm_mdev;
  186. goto out;
  187. }
  188. }
  189. out:
  190. spin_unlock(&mid->bm_lock);
  191. dprintk("%s returning %p\n", __func__, rv);
  192. return rv;
  193. }
  194. /* Tracks info needed to ensure extents in layout obey constraints of spec */
  195. struct layout_verification {
  196. u32 mode; /* R or RW */
  197. u64 start; /* Expected start of next non-COW extent */
  198. u64 inval; /* Start of INVAL coverage */
  199. u64 cowread; /* End of COW read coverage */
  200. };
  201. /* Verify the extent meets the layout requirements of the pnfs-block draft,
  202. * section 2.3.1.
  203. */
  204. static int verify_extent(struct pnfs_block_extent *be,
  205. struct layout_verification *lv)
  206. {
  207. if (lv->mode == IOMODE_READ) {
  208. if (be->be_state == PNFS_BLOCK_READWRITE_DATA ||
  209. be->be_state == PNFS_BLOCK_INVALID_DATA)
  210. return -EIO;
  211. if (be->be_f_offset != lv->start)
  212. return -EIO;
  213. lv->start += be->be_length;
  214. return 0;
  215. }
  216. /* lv->mode == IOMODE_RW */
  217. if (be->be_state == PNFS_BLOCK_READWRITE_DATA) {
  218. if (be->be_f_offset != lv->start)
  219. return -EIO;
  220. if (lv->cowread > lv->start)
  221. return -EIO;
  222. lv->start += be->be_length;
  223. lv->inval = lv->start;
  224. return 0;
  225. } else if (be->be_state == PNFS_BLOCK_INVALID_DATA) {
  226. if (be->be_f_offset != lv->start)
  227. return -EIO;
  228. lv->start += be->be_length;
  229. return 0;
  230. } else if (be->be_state == PNFS_BLOCK_READ_DATA) {
  231. if (be->be_f_offset > lv->start)
  232. return -EIO;
  233. if (be->be_f_offset < lv->inval)
  234. return -EIO;
  235. if (be->be_f_offset < lv->cowread)
  236. return -EIO;
  237. /* It looks like you might want to min this with lv->start,
  238. * but you really don't.
  239. */
  240. lv->inval = lv->inval + be->be_length;
  241. lv->cowread = be->be_f_offset + be->be_length;
  242. return 0;
  243. } else
  244. return -EIO;
  245. }
  246. /* XDR decode pnfs_block_layout4 structure */
  247. int
  248. nfs4_blk_process_layoutget(struct pnfs_layout_hdr *lo,
  249. struct nfs4_layoutget_res *lgr, gfp_t gfp_flags)
  250. {
  251. struct pnfs_block_layout *bl = BLK_LO2EXT(lo);
  252. int i, status = -EIO;
  253. uint32_t count;
  254. struct pnfs_block_extent *be = NULL, *save;
  255. struct xdr_stream stream;
  256. struct xdr_buf buf;
  257. struct page *scratch;
  258. __be32 *p;
  259. struct layout_verification lv = {
  260. .mode = lgr->range.iomode,
  261. .start = lgr->range.offset >> SECTOR_SHIFT,
  262. .inval = lgr->range.offset >> SECTOR_SHIFT,
  263. .cowread = lgr->range.offset >> SECTOR_SHIFT,
  264. };
  265. LIST_HEAD(extents);
  266. dprintk("---> %s\n", __func__);
  267. scratch = alloc_page(gfp_flags);
  268. if (!scratch)
  269. return -ENOMEM;
  270. xdr_init_decode_pages(&stream, &buf, lgr->layoutp->pages, lgr->layoutp->len);
  271. xdr_set_scratch_buffer(&stream, page_address(scratch), PAGE_SIZE);
  272. p = xdr_inline_decode(&stream, 4);
  273. if (unlikely(!p))
  274. goto out_err;
  275. count = be32_to_cpup(p++);
  276. dprintk("%s enter, number of extents %i\n", __func__, count);
  277. p = xdr_inline_decode(&stream, (28 + NFS4_DEVICEID4_SIZE) * count);
  278. if (unlikely(!p))
  279. goto out_err;
  280. /* Decode individual extents, putting them in temporary
  281. * staging area until whole layout is decoded to make error
  282. * recovery easier.
  283. */
  284. for (i = 0; i < count; i++) {
  285. be = bl_alloc_extent();
  286. if (!be) {
  287. status = -ENOMEM;
  288. goto out_err;
  289. }
  290. memcpy(&be->be_devid, p, NFS4_DEVICEID4_SIZE);
  291. p += XDR_QUADLEN(NFS4_DEVICEID4_SIZE);
  292. be->be_mdev = translate_devid(lo, &be->be_devid);
  293. if (!be->be_mdev)
  294. goto out_err;
  295. /* The next three values are read in as bytes,
  296. * but stored as 512-byte sector lengths
  297. */
  298. if (decode_sector_number(&p, &be->be_f_offset) < 0)
  299. goto out_err;
  300. if (decode_sector_number(&p, &be->be_length) < 0)
  301. goto out_err;
  302. if (decode_sector_number(&p, &be->be_v_offset) < 0)
  303. goto out_err;
  304. be->be_state = be32_to_cpup(p++);
  305. if (be->be_state == PNFS_BLOCK_INVALID_DATA)
  306. be->be_inval = &bl->bl_inval;
  307. if (verify_extent(be, &lv)) {
  308. dprintk("%s verify failed\n", __func__);
  309. goto out_err;
  310. }
  311. list_add_tail(&be->be_node, &extents);
  312. }
  313. if (lgr->range.offset + lgr->range.length !=
  314. lv.start << SECTOR_SHIFT) {
  315. dprintk("%s Final length mismatch\n", __func__);
  316. be = NULL;
  317. goto out_err;
  318. }
  319. if (lv.start < lv.cowread) {
  320. dprintk("%s Final uncovered COW extent\n", __func__);
  321. be = NULL;
  322. goto out_err;
  323. }
  324. /* Extents decoded properly, now try to merge them in to
  325. * existing layout extents.
  326. */
  327. spin_lock(&bl->bl_ext_lock);
  328. list_for_each_entry_safe(be, save, &extents, be_node) {
  329. list_del(&be->be_node);
  330. status = bl_add_merge_extent(bl, be);
  331. if (status) {
  332. spin_unlock(&bl->bl_ext_lock);
  333. /* This is a fairly catastrophic error, as the
  334. * entire layout extent lists are now corrupted.
  335. * We should have some way to distinguish this.
  336. */
  337. be = NULL;
  338. goto out_err;
  339. }
  340. }
  341. spin_unlock(&bl->bl_ext_lock);
  342. status = 0;
  343. out:
  344. __free_page(scratch);
  345. dprintk("%s returns %i\n", __func__, status);
  346. return status;
  347. out_err:
  348. bl_put_extent(be);
  349. while (!list_empty(&extents)) {
  350. be = list_first_entry(&extents, struct pnfs_block_extent,
  351. be_node);
  352. list_del(&be->be_node);
  353. bl_put_extent(be);
  354. }
  355. goto out;
  356. }