blocklayout.c 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029
  1. /*
  2. * linux/fs/nfs/blocklayout/blocklayout.c
  3. *
  4. * Module for the NFSv4.1 pNFS block layout driver.
  5. *
  6. * Copyright (c) 2006 The Regents of the University of Michigan.
  7. * All rights reserved.
  8. *
  9. * Andy Adamson <[email protected]>
  10. * Fred Isaman <[email protected]>
  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/init.h>
  34. #include <linux/mount.h>
  35. #include <linux/namei.h>
  36. #include <linux/bio.h> /* struct bio */
  37. #include <linux/prefetch.h>
  38. #include <linux/pagevec.h>
  39. #include "../pnfs.h"
  40. #include "../nfs4session.h"
  41. #include "../internal.h"
  42. #include "blocklayout.h"
  43. #define NFSDBG_FACILITY NFSDBG_PNFS_LD
  44. MODULE_LICENSE("GPL");
  45. MODULE_AUTHOR("Andy Adamson <[email protected]>");
  46. MODULE_DESCRIPTION("The NFSv4.1 pNFS Block layout driver");
  47. static bool is_hole(struct pnfs_block_extent *be)
  48. {
  49. switch (be->be_state) {
  50. case PNFS_BLOCK_NONE_DATA:
  51. return true;
  52. case PNFS_BLOCK_INVALID_DATA:
  53. return be->be_tag ? false : true;
  54. default:
  55. return false;
  56. }
  57. }
  58. /* The data we are handed might be spread across several bios. We need
  59. * to track when the last one is finished.
  60. */
  61. struct parallel_io {
  62. struct kref refcnt;
  63. void (*pnfs_callback) (void *data);
  64. void *data;
  65. };
  66. static inline struct parallel_io *alloc_parallel(void *data)
  67. {
  68. struct parallel_io *rv;
  69. rv = kmalloc(sizeof(*rv), GFP_NOFS);
  70. if (rv) {
  71. rv->data = data;
  72. kref_init(&rv->refcnt);
  73. }
  74. return rv;
  75. }
  76. static inline void get_parallel(struct parallel_io *p)
  77. {
  78. kref_get(&p->refcnt);
  79. }
  80. static void destroy_parallel(struct kref *kref)
  81. {
  82. struct parallel_io *p = container_of(kref, struct parallel_io, refcnt);
  83. dprintk("%s enter\n", __func__);
  84. p->pnfs_callback(p->data);
  85. kfree(p);
  86. }
  87. static inline void put_parallel(struct parallel_io *p)
  88. {
  89. kref_put(&p->refcnt, destroy_parallel);
  90. }
  91. static struct bio *
  92. bl_submit_bio(struct bio *bio)
  93. {
  94. if (bio) {
  95. get_parallel(bio->bi_private);
  96. dprintk("%s submitting %s bio %u@%llu\n", __func__,
  97. bio_op(bio) == READ ? "read" : "write",
  98. bio->bi_iter.bi_size,
  99. (unsigned long long)bio->bi_iter.bi_sector);
  100. submit_bio(bio);
  101. }
  102. return NULL;
  103. }
  104. static bool offset_in_map(u64 offset, struct pnfs_block_dev_map *map)
  105. {
  106. return offset >= map->start && offset < map->start + map->len;
  107. }
  108. static struct bio *
  109. do_add_page_to_bio(struct bio *bio, int npg, enum req_op op, sector_t isect,
  110. struct page *page, struct pnfs_block_dev_map *map,
  111. struct pnfs_block_extent *be, bio_end_io_t end_io,
  112. struct parallel_io *par, unsigned int offset, int *len)
  113. {
  114. struct pnfs_block_dev *dev =
  115. container_of(be->be_device, struct pnfs_block_dev, node);
  116. u64 disk_addr, end;
  117. dprintk("%s: npg %d rw %d isect %llu offset %u len %d\n", __func__,
  118. npg, (__force u32)op, (unsigned long long)isect, offset, *len);
  119. /* translate to device offset */
  120. isect += be->be_v_offset;
  121. isect -= be->be_f_offset;
  122. /* translate to physical disk offset */
  123. disk_addr = (u64)isect << SECTOR_SHIFT;
  124. if (!offset_in_map(disk_addr, map)) {
  125. if (!dev->map(dev, disk_addr, map) || !offset_in_map(disk_addr, map))
  126. return ERR_PTR(-EIO);
  127. bio = bl_submit_bio(bio);
  128. }
  129. disk_addr += map->disk_offset;
  130. disk_addr -= map->start;
  131. /* limit length to what the device mapping allows */
  132. end = disk_addr + *len;
  133. if (end >= map->start + map->len)
  134. *len = map->start + map->len - disk_addr;
  135. retry:
  136. if (!bio) {
  137. bio = bio_alloc(map->bdev, bio_max_segs(npg), op, GFP_NOIO);
  138. bio->bi_iter.bi_sector = disk_addr >> SECTOR_SHIFT;
  139. bio->bi_end_io = end_io;
  140. bio->bi_private = par;
  141. }
  142. if (bio_add_page(bio, page, *len, offset) < *len) {
  143. bio = bl_submit_bio(bio);
  144. goto retry;
  145. }
  146. return bio;
  147. }
  148. static void bl_mark_devices_unavailable(struct nfs_pgio_header *header, bool rw)
  149. {
  150. struct pnfs_block_layout *bl = BLK_LSEG2EXT(header->lseg);
  151. size_t bytes_left = header->args.count;
  152. sector_t isect, extent_length = 0;
  153. struct pnfs_block_extent be;
  154. isect = header->args.offset >> SECTOR_SHIFT;
  155. bytes_left += header->args.offset - (isect << SECTOR_SHIFT);
  156. while (bytes_left > 0) {
  157. if (!ext_tree_lookup(bl, isect, &be, rw))
  158. return;
  159. extent_length = be.be_length - (isect - be.be_f_offset);
  160. nfs4_mark_deviceid_unavailable(be.be_device);
  161. isect += extent_length;
  162. if (bytes_left > extent_length << SECTOR_SHIFT)
  163. bytes_left -= extent_length << SECTOR_SHIFT;
  164. else
  165. bytes_left = 0;
  166. }
  167. }
  168. static void bl_end_io_read(struct bio *bio)
  169. {
  170. struct parallel_io *par = bio->bi_private;
  171. if (bio->bi_status) {
  172. struct nfs_pgio_header *header = par->data;
  173. if (!header->pnfs_error)
  174. header->pnfs_error = -EIO;
  175. pnfs_set_lo_fail(header->lseg);
  176. bl_mark_devices_unavailable(header, false);
  177. }
  178. bio_put(bio);
  179. put_parallel(par);
  180. }
  181. static void bl_read_cleanup(struct work_struct *work)
  182. {
  183. struct rpc_task *task;
  184. struct nfs_pgio_header *hdr;
  185. dprintk("%s enter\n", __func__);
  186. task = container_of(work, struct rpc_task, u.tk_work);
  187. hdr = container_of(task, struct nfs_pgio_header, task);
  188. pnfs_ld_read_done(hdr);
  189. }
  190. static void
  191. bl_end_par_io_read(void *data)
  192. {
  193. struct nfs_pgio_header *hdr = data;
  194. hdr->task.tk_status = hdr->pnfs_error;
  195. INIT_WORK(&hdr->task.u.tk_work, bl_read_cleanup);
  196. schedule_work(&hdr->task.u.tk_work);
  197. }
  198. static enum pnfs_try_status
  199. bl_read_pagelist(struct nfs_pgio_header *header)
  200. {
  201. struct pnfs_block_layout *bl = BLK_LSEG2EXT(header->lseg);
  202. struct pnfs_block_dev_map map = { .start = NFS4_MAX_UINT64 };
  203. struct bio *bio = NULL;
  204. struct pnfs_block_extent be;
  205. sector_t isect, extent_length = 0;
  206. struct parallel_io *par;
  207. loff_t f_offset = header->args.offset;
  208. size_t bytes_left = header->args.count;
  209. unsigned int pg_offset = header->args.pgbase, pg_len;
  210. struct page **pages = header->args.pages;
  211. int pg_index = header->args.pgbase >> PAGE_SHIFT;
  212. const bool is_dio = (header->dreq != NULL);
  213. struct blk_plug plug;
  214. int i;
  215. dprintk("%s enter nr_pages %u offset %lld count %u\n", __func__,
  216. header->page_array.npages, f_offset,
  217. (unsigned int)header->args.count);
  218. par = alloc_parallel(header);
  219. if (!par)
  220. return PNFS_NOT_ATTEMPTED;
  221. par->pnfs_callback = bl_end_par_io_read;
  222. blk_start_plug(&plug);
  223. isect = (sector_t) (f_offset >> SECTOR_SHIFT);
  224. /* Code assumes extents are page-aligned */
  225. for (i = pg_index; i < header->page_array.npages; i++) {
  226. if (extent_length <= 0) {
  227. /* We've used up the previous extent */
  228. bio = bl_submit_bio(bio);
  229. /* Get the next one */
  230. if (!ext_tree_lookup(bl, isect, &be, false)) {
  231. header->pnfs_error = -EIO;
  232. goto out;
  233. }
  234. extent_length = be.be_length - (isect - be.be_f_offset);
  235. }
  236. if (is_dio) {
  237. if (pg_offset + bytes_left > PAGE_SIZE)
  238. pg_len = PAGE_SIZE - pg_offset;
  239. else
  240. pg_len = bytes_left;
  241. } else {
  242. BUG_ON(pg_offset != 0);
  243. pg_len = PAGE_SIZE;
  244. }
  245. if (is_hole(&be)) {
  246. bio = bl_submit_bio(bio);
  247. /* Fill hole w/ zeroes w/o accessing device */
  248. dprintk("%s Zeroing page for hole\n", __func__);
  249. zero_user_segment(pages[i], pg_offset, pg_len);
  250. /* invalidate map */
  251. map.start = NFS4_MAX_UINT64;
  252. } else {
  253. bio = do_add_page_to_bio(bio,
  254. header->page_array.npages - i,
  255. REQ_OP_READ,
  256. isect, pages[i], &map, &be,
  257. bl_end_io_read, par,
  258. pg_offset, &pg_len);
  259. if (IS_ERR(bio)) {
  260. header->pnfs_error = PTR_ERR(bio);
  261. bio = NULL;
  262. goto out;
  263. }
  264. }
  265. isect += (pg_len >> SECTOR_SHIFT);
  266. extent_length -= (pg_len >> SECTOR_SHIFT);
  267. f_offset += pg_len;
  268. bytes_left -= pg_len;
  269. pg_offset = 0;
  270. }
  271. if ((isect << SECTOR_SHIFT) >= header->inode->i_size) {
  272. header->res.eof = 1;
  273. header->res.count = header->inode->i_size - header->args.offset;
  274. } else {
  275. header->res.count = (isect << SECTOR_SHIFT) - header->args.offset;
  276. }
  277. out:
  278. bl_submit_bio(bio);
  279. blk_finish_plug(&plug);
  280. put_parallel(par);
  281. return PNFS_ATTEMPTED;
  282. }
  283. static void bl_end_io_write(struct bio *bio)
  284. {
  285. struct parallel_io *par = bio->bi_private;
  286. struct nfs_pgio_header *header = par->data;
  287. if (bio->bi_status) {
  288. if (!header->pnfs_error)
  289. header->pnfs_error = -EIO;
  290. pnfs_set_lo_fail(header->lseg);
  291. bl_mark_devices_unavailable(header, true);
  292. }
  293. bio_put(bio);
  294. put_parallel(par);
  295. }
  296. /* Function scheduled for call during bl_end_par_io_write,
  297. * it marks sectors as written and extends the commitlist.
  298. */
  299. static void bl_write_cleanup(struct work_struct *work)
  300. {
  301. struct rpc_task *task = container_of(work, struct rpc_task, u.tk_work);
  302. struct nfs_pgio_header *hdr =
  303. container_of(task, struct nfs_pgio_header, task);
  304. dprintk("%s enter\n", __func__);
  305. if (likely(!hdr->pnfs_error)) {
  306. struct pnfs_block_layout *bl = BLK_LSEG2EXT(hdr->lseg);
  307. u64 start = hdr->args.offset & (loff_t)PAGE_MASK;
  308. u64 end = (hdr->args.offset + hdr->args.count +
  309. PAGE_SIZE - 1) & (loff_t)PAGE_MASK;
  310. u64 lwb = hdr->args.offset + hdr->args.count;
  311. ext_tree_mark_written(bl, start >> SECTOR_SHIFT,
  312. (end - start) >> SECTOR_SHIFT, lwb);
  313. }
  314. pnfs_ld_write_done(hdr);
  315. }
  316. /* Called when last of bios associated with a bl_write_pagelist call finishes */
  317. static void bl_end_par_io_write(void *data)
  318. {
  319. struct nfs_pgio_header *hdr = data;
  320. hdr->task.tk_status = hdr->pnfs_error;
  321. hdr->verf.committed = NFS_FILE_SYNC;
  322. INIT_WORK(&hdr->task.u.tk_work, bl_write_cleanup);
  323. schedule_work(&hdr->task.u.tk_work);
  324. }
  325. static enum pnfs_try_status
  326. bl_write_pagelist(struct nfs_pgio_header *header, int sync)
  327. {
  328. struct pnfs_block_layout *bl = BLK_LSEG2EXT(header->lseg);
  329. struct pnfs_block_dev_map map = { .start = NFS4_MAX_UINT64 };
  330. struct bio *bio = NULL;
  331. struct pnfs_block_extent be;
  332. sector_t isect, extent_length = 0;
  333. struct parallel_io *par = NULL;
  334. loff_t offset = header->args.offset;
  335. size_t count = header->args.count;
  336. struct page **pages = header->args.pages;
  337. int pg_index = header->args.pgbase >> PAGE_SHIFT;
  338. unsigned int pg_len;
  339. struct blk_plug plug;
  340. int i;
  341. dprintk("%s enter, %zu@%lld\n", __func__, count, offset);
  342. /* At this point, header->page_aray is a (sequential) list of nfs_pages.
  343. * We want to write each, and if there is an error set pnfs_error
  344. * to have it redone using nfs.
  345. */
  346. par = alloc_parallel(header);
  347. if (!par)
  348. return PNFS_NOT_ATTEMPTED;
  349. par->pnfs_callback = bl_end_par_io_write;
  350. blk_start_plug(&plug);
  351. /* we always write out the whole page */
  352. offset = offset & (loff_t)PAGE_MASK;
  353. isect = offset >> SECTOR_SHIFT;
  354. for (i = pg_index; i < header->page_array.npages; i++) {
  355. if (extent_length <= 0) {
  356. /* We've used up the previous extent */
  357. bio = bl_submit_bio(bio);
  358. /* Get the next one */
  359. if (!ext_tree_lookup(bl, isect, &be, true)) {
  360. header->pnfs_error = -EINVAL;
  361. goto out;
  362. }
  363. extent_length = be.be_length - (isect - be.be_f_offset);
  364. }
  365. pg_len = PAGE_SIZE;
  366. bio = do_add_page_to_bio(bio, header->page_array.npages - i,
  367. REQ_OP_WRITE, isect, pages[i], &map,
  368. &be, bl_end_io_write, par, 0, &pg_len);
  369. if (IS_ERR(bio)) {
  370. header->pnfs_error = PTR_ERR(bio);
  371. bio = NULL;
  372. goto out;
  373. }
  374. offset += pg_len;
  375. count -= pg_len;
  376. isect += (pg_len >> SECTOR_SHIFT);
  377. extent_length -= (pg_len >> SECTOR_SHIFT);
  378. }
  379. header->res.count = header->args.count;
  380. out:
  381. bl_submit_bio(bio);
  382. blk_finish_plug(&plug);
  383. put_parallel(par);
  384. return PNFS_ATTEMPTED;
  385. }
  386. static void bl_free_layout_hdr(struct pnfs_layout_hdr *lo)
  387. {
  388. struct pnfs_block_layout *bl = BLK_LO2EXT(lo);
  389. int err;
  390. dprintk("%s enter\n", __func__);
  391. err = ext_tree_remove(bl, true, 0, LLONG_MAX);
  392. WARN_ON(err);
  393. kfree_rcu(bl, bl_layout.plh_rcu);
  394. }
  395. static struct pnfs_layout_hdr *__bl_alloc_layout_hdr(struct inode *inode,
  396. gfp_t gfp_flags, bool is_scsi_layout)
  397. {
  398. struct pnfs_block_layout *bl;
  399. dprintk("%s enter\n", __func__);
  400. bl = kzalloc(sizeof(*bl), gfp_flags);
  401. if (!bl)
  402. return NULL;
  403. bl->bl_ext_rw = RB_ROOT;
  404. bl->bl_ext_ro = RB_ROOT;
  405. spin_lock_init(&bl->bl_ext_lock);
  406. bl->bl_scsi_layout = is_scsi_layout;
  407. return &bl->bl_layout;
  408. }
  409. static struct pnfs_layout_hdr *bl_alloc_layout_hdr(struct inode *inode,
  410. gfp_t gfp_flags)
  411. {
  412. return __bl_alloc_layout_hdr(inode, gfp_flags, false);
  413. }
  414. static struct pnfs_layout_hdr *sl_alloc_layout_hdr(struct inode *inode,
  415. gfp_t gfp_flags)
  416. {
  417. return __bl_alloc_layout_hdr(inode, gfp_flags, true);
  418. }
  419. static void bl_free_lseg(struct pnfs_layout_segment *lseg)
  420. {
  421. dprintk("%s enter\n", __func__);
  422. kfree(lseg);
  423. }
  424. /* Tracks info needed to ensure extents in layout obey constraints of spec */
  425. struct layout_verification {
  426. u32 mode; /* R or RW */
  427. u64 start; /* Expected start of next non-COW extent */
  428. u64 inval; /* Start of INVAL coverage */
  429. u64 cowread; /* End of COW read coverage */
  430. };
  431. /* Verify the extent meets the layout requirements of the pnfs-block draft,
  432. * section 2.3.1.
  433. */
  434. static int verify_extent(struct pnfs_block_extent *be,
  435. struct layout_verification *lv)
  436. {
  437. if (lv->mode == IOMODE_READ) {
  438. if (be->be_state == PNFS_BLOCK_READWRITE_DATA ||
  439. be->be_state == PNFS_BLOCK_INVALID_DATA)
  440. return -EIO;
  441. if (be->be_f_offset != lv->start)
  442. return -EIO;
  443. lv->start += be->be_length;
  444. return 0;
  445. }
  446. /* lv->mode == IOMODE_RW */
  447. if (be->be_state == PNFS_BLOCK_READWRITE_DATA) {
  448. if (be->be_f_offset != lv->start)
  449. return -EIO;
  450. if (lv->cowread > lv->start)
  451. return -EIO;
  452. lv->start += be->be_length;
  453. lv->inval = lv->start;
  454. return 0;
  455. } else if (be->be_state == PNFS_BLOCK_INVALID_DATA) {
  456. if (be->be_f_offset != lv->start)
  457. return -EIO;
  458. lv->start += be->be_length;
  459. return 0;
  460. } else if (be->be_state == PNFS_BLOCK_READ_DATA) {
  461. if (be->be_f_offset > lv->start)
  462. return -EIO;
  463. if (be->be_f_offset < lv->inval)
  464. return -EIO;
  465. if (be->be_f_offset < lv->cowread)
  466. return -EIO;
  467. /* It looks like you might want to min this with lv->start,
  468. * but you really don't.
  469. */
  470. lv->inval = lv->inval + be->be_length;
  471. lv->cowread = be->be_f_offset + be->be_length;
  472. return 0;
  473. } else
  474. return -EIO;
  475. }
  476. static int decode_sector_number(__be32 **rp, sector_t *sp)
  477. {
  478. uint64_t s;
  479. *rp = xdr_decode_hyper(*rp, &s);
  480. if (s & 0x1ff) {
  481. printk(KERN_WARNING "NFS: %s: sector not aligned\n", __func__);
  482. return -1;
  483. }
  484. *sp = s >> SECTOR_SHIFT;
  485. return 0;
  486. }
  487. static struct nfs4_deviceid_node *
  488. bl_find_get_deviceid(struct nfs_server *server,
  489. const struct nfs4_deviceid *id, const struct cred *cred,
  490. gfp_t gfp_mask)
  491. {
  492. struct nfs4_deviceid_node *node;
  493. unsigned long start, end;
  494. retry:
  495. node = nfs4_find_get_deviceid(server, id, cred, gfp_mask);
  496. if (!node)
  497. return ERR_PTR(-ENODEV);
  498. if (test_bit(NFS_DEVICEID_UNAVAILABLE, &node->flags) == 0)
  499. return node;
  500. end = jiffies;
  501. start = end - PNFS_DEVICE_RETRY_TIMEOUT;
  502. if (!time_in_range(node->timestamp_unavailable, start, end)) {
  503. nfs4_delete_deviceid(node->ld, node->nfs_client, id);
  504. goto retry;
  505. }
  506. return ERR_PTR(-ENODEV);
  507. }
  508. static int
  509. bl_alloc_extent(struct xdr_stream *xdr, struct pnfs_layout_hdr *lo,
  510. struct layout_verification *lv, struct list_head *extents,
  511. gfp_t gfp_mask)
  512. {
  513. struct pnfs_block_extent *be;
  514. struct nfs4_deviceid id;
  515. int error;
  516. __be32 *p;
  517. p = xdr_inline_decode(xdr, 28 + NFS4_DEVICEID4_SIZE);
  518. if (!p)
  519. return -EIO;
  520. be = kzalloc(sizeof(*be), GFP_NOFS);
  521. if (!be)
  522. return -ENOMEM;
  523. memcpy(&id, p, NFS4_DEVICEID4_SIZE);
  524. p += XDR_QUADLEN(NFS4_DEVICEID4_SIZE);
  525. be->be_device = bl_find_get_deviceid(NFS_SERVER(lo->plh_inode), &id,
  526. lo->plh_lc_cred, gfp_mask);
  527. if (IS_ERR(be->be_device)) {
  528. error = PTR_ERR(be->be_device);
  529. goto out_free_be;
  530. }
  531. /*
  532. * The next three values are read in as bytes, but stored in the
  533. * extent structure in 512-byte granularity.
  534. */
  535. error = -EIO;
  536. if (decode_sector_number(&p, &be->be_f_offset) < 0)
  537. goto out_put_deviceid;
  538. if (decode_sector_number(&p, &be->be_length) < 0)
  539. goto out_put_deviceid;
  540. if (decode_sector_number(&p, &be->be_v_offset) < 0)
  541. goto out_put_deviceid;
  542. be->be_state = be32_to_cpup(p++);
  543. error = verify_extent(be, lv);
  544. if (error) {
  545. dprintk("%s: extent verification failed\n", __func__);
  546. goto out_put_deviceid;
  547. }
  548. list_add_tail(&be->be_list, extents);
  549. return 0;
  550. out_put_deviceid:
  551. nfs4_put_deviceid_node(be->be_device);
  552. out_free_be:
  553. kfree(be);
  554. return error;
  555. }
  556. static struct pnfs_layout_segment *
  557. bl_alloc_lseg(struct pnfs_layout_hdr *lo, struct nfs4_layoutget_res *lgr,
  558. gfp_t gfp_mask)
  559. {
  560. struct layout_verification lv = {
  561. .mode = lgr->range.iomode,
  562. .start = lgr->range.offset >> SECTOR_SHIFT,
  563. .inval = lgr->range.offset >> SECTOR_SHIFT,
  564. .cowread = lgr->range.offset >> SECTOR_SHIFT,
  565. };
  566. struct pnfs_block_layout *bl = BLK_LO2EXT(lo);
  567. struct pnfs_layout_segment *lseg;
  568. struct xdr_buf buf;
  569. struct xdr_stream xdr;
  570. struct page *scratch;
  571. int status, i;
  572. uint32_t count;
  573. __be32 *p;
  574. LIST_HEAD(extents);
  575. dprintk("---> %s\n", __func__);
  576. lseg = kzalloc(sizeof(*lseg), gfp_mask);
  577. if (!lseg)
  578. return ERR_PTR(-ENOMEM);
  579. status = -ENOMEM;
  580. scratch = alloc_page(gfp_mask);
  581. if (!scratch)
  582. goto out;
  583. xdr_init_decode_pages(&xdr, &buf,
  584. lgr->layoutp->pages, lgr->layoutp->len);
  585. xdr_set_scratch_page(&xdr, scratch);
  586. status = -EIO;
  587. p = xdr_inline_decode(&xdr, 4);
  588. if (unlikely(!p))
  589. goto out_free_scratch;
  590. count = be32_to_cpup(p++);
  591. dprintk("%s: number of extents %d\n", __func__, count);
  592. /*
  593. * Decode individual extents, putting them in temporary staging area
  594. * until whole layout is decoded to make error recovery easier.
  595. */
  596. for (i = 0; i < count; i++) {
  597. status = bl_alloc_extent(&xdr, lo, &lv, &extents, gfp_mask);
  598. if (status)
  599. goto process_extents;
  600. }
  601. if (lgr->range.offset + lgr->range.length !=
  602. lv.start << SECTOR_SHIFT) {
  603. dprintk("%s Final length mismatch\n", __func__);
  604. status = -EIO;
  605. goto process_extents;
  606. }
  607. if (lv.start < lv.cowread) {
  608. dprintk("%s Final uncovered COW extent\n", __func__);
  609. status = -EIO;
  610. }
  611. process_extents:
  612. while (!list_empty(&extents)) {
  613. struct pnfs_block_extent *be =
  614. list_first_entry(&extents, struct pnfs_block_extent,
  615. be_list);
  616. list_del(&be->be_list);
  617. if (!status)
  618. status = ext_tree_insert(bl, be);
  619. if (status) {
  620. nfs4_put_deviceid_node(be->be_device);
  621. kfree(be);
  622. }
  623. }
  624. out_free_scratch:
  625. __free_page(scratch);
  626. out:
  627. dprintk("%s returns %d\n", __func__, status);
  628. switch (status) {
  629. case -ENODEV:
  630. /* Our extent block devices are unavailable */
  631. set_bit(NFS_LSEG_UNAVAILABLE, &lseg->pls_flags);
  632. fallthrough;
  633. case 0:
  634. return lseg;
  635. default:
  636. kfree(lseg);
  637. return ERR_PTR(status);
  638. }
  639. }
  640. static void
  641. bl_return_range(struct pnfs_layout_hdr *lo,
  642. struct pnfs_layout_range *range)
  643. {
  644. struct pnfs_block_layout *bl = BLK_LO2EXT(lo);
  645. sector_t offset = range->offset >> SECTOR_SHIFT, end;
  646. if (range->offset % 8) {
  647. dprintk("%s: offset %lld not block size aligned\n",
  648. __func__, range->offset);
  649. return;
  650. }
  651. if (range->length != NFS4_MAX_UINT64) {
  652. if (range->length % 8) {
  653. dprintk("%s: length %lld not block size aligned\n",
  654. __func__, range->length);
  655. return;
  656. }
  657. end = offset + (range->length >> SECTOR_SHIFT);
  658. } else {
  659. end = round_down(NFS4_MAX_UINT64, PAGE_SIZE);
  660. }
  661. ext_tree_remove(bl, range->iomode & IOMODE_RW, offset, end);
  662. }
  663. static int
  664. bl_prepare_layoutcommit(struct nfs4_layoutcommit_args *arg)
  665. {
  666. return ext_tree_prepare_commit(arg);
  667. }
  668. static void
  669. bl_cleanup_layoutcommit(struct nfs4_layoutcommit_data *lcdata)
  670. {
  671. ext_tree_mark_committed(&lcdata->args, lcdata->res.status);
  672. }
  673. static int
  674. bl_set_layoutdriver(struct nfs_server *server, const struct nfs_fh *fh)
  675. {
  676. dprintk("%s enter\n", __func__);
  677. if (server->pnfs_blksize == 0) {
  678. dprintk("%s Server did not return blksize\n", __func__);
  679. return -EINVAL;
  680. }
  681. if (server->pnfs_blksize > PAGE_SIZE) {
  682. printk(KERN_ERR "%s: pNFS blksize %d not supported.\n",
  683. __func__, server->pnfs_blksize);
  684. return -EINVAL;
  685. }
  686. return 0;
  687. }
  688. static bool
  689. is_aligned_req(struct nfs_pageio_descriptor *pgio,
  690. struct nfs_page *req, unsigned int alignment, bool is_write)
  691. {
  692. /*
  693. * Always accept buffered writes, higher layers take care of the
  694. * right alignment.
  695. */
  696. if (pgio->pg_dreq == NULL)
  697. return true;
  698. if (!IS_ALIGNED(req->wb_offset, alignment))
  699. return false;
  700. if (IS_ALIGNED(req->wb_bytes, alignment))
  701. return true;
  702. if (is_write &&
  703. (req_offset(req) + req->wb_bytes == i_size_read(pgio->pg_inode))) {
  704. /*
  705. * If the write goes up to the inode size, just write
  706. * the full page. Data past the inode size is
  707. * guaranteed to be zeroed by the higher level client
  708. * code, and this behaviour is mandated by RFC 5663
  709. * section 2.3.2.
  710. */
  711. return true;
  712. }
  713. return false;
  714. }
  715. static void
  716. bl_pg_init_read(struct nfs_pageio_descriptor *pgio, struct nfs_page *req)
  717. {
  718. if (!is_aligned_req(pgio, req, SECTOR_SIZE, false)) {
  719. nfs_pageio_reset_read_mds(pgio);
  720. return;
  721. }
  722. pnfs_generic_pg_init_read(pgio, req);
  723. if (pgio->pg_lseg &&
  724. test_bit(NFS_LSEG_UNAVAILABLE, &pgio->pg_lseg->pls_flags)) {
  725. pnfs_error_mark_layout_for_return(pgio->pg_inode, pgio->pg_lseg);
  726. pnfs_set_lo_fail(pgio->pg_lseg);
  727. nfs_pageio_reset_read_mds(pgio);
  728. }
  729. }
  730. /*
  731. * Return 0 if @req cannot be coalesced into @pgio, otherwise return the number
  732. * of bytes (maximum @req->wb_bytes) that can be coalesced.
  733. */
  734. static size_t
  735. bl_pg_test_read(struct nfs_pageio_descriptor *pgio, struct nfs_page *prev,
  736. struct nfs_page *req)
  737. {
  738. if (!is_aligned_req(pgio, req, SECTOR_SIZE, false))
  739. return 0;
  740. return pnfs_generic_pg_test(pgio, prev, req);
  741. }
  742. /*
  743. * Return the number of contiguous bytes for a given inode
  744. * starting at page frame idx.
  745. */
  746. static u64 pnfs_num_cont_bytes(struct inode *inode, pgoff_t idx)
  747. {
  748. struct address_space *mapping = inode->i_mapping;
  749. pgoff_t end;
  750. /* Optimize common case that writes from 0 to end of file */
  751. end = DIV_ROUND_UP(i_size_read(inode), PAGE_SIZE);
  752. if (end != inode->i_mapping->nrpages) {
  753. rcu_read_lock();
  754. end = page_cache_next_miss(mapping, idx + 1, ULONG_MAX);
  755. rcu_read_unlock();
  756. }
  757. if (!end)
  758. return i_size_read(inode) - (idx << PAGE_SHIFT);
  759. else
  760. return (end - idx) << PAGE_SHIFT;
  761. }
  762. static void
  763. bl_pg_init_write(struct nfs_pageio_descriptor *pgio, struct nfs_page *req)
  764. {
  765. u64 wb_size;
  766. if (!is_aligned_req(pgio, req, PAGE_SIZE, true)) {
  767. nfs_pageio_reset_write_mds(pgio);
  768. return;
  769. }
  770. if (pgio->pg_dreq == NULL)
  771. wb_size = pnfs_num_cont_bytes(pgio->pg_inode,
  772. req->wb_index);
  773. else
  774. wb_size = nfs_dreq_bytes_left(pgio->pg_dreq);
  775. pnfs_generic_pg_init_write(pgio, req, wb_size);
  776. if (pgio->pg_lseg &&
  777. test_bit(NFS_LSEG_UNAVAILABLE, &pgio->pg_lseg->pls_flags)) {
  778. pnfs_error_mark_layout_for_return(pgio->pg_inode, pgio->pg_lseg);
  779. pnfs_set_lo_fail(pgio->pg_lseg);
  780. nfs_pageio_reset_write_mds(pgio);
  781. }
  782. }
  783. /*
  784. * Return 0 if @req cannot be coalesced into @pgio, otherwise return the number
  785. * of bytes (maximum @req->wb_bytes) that can be coalesced.
  786. */
  787. static size_t
  788. bl_pg_test_write(struct nfs_pageio_descriptor *pgio, struct nfs_page *prev,
  789. struct nfs_page *req)
  790. {
  791. if (!is_aligned_req(pgio, req, PAGE_SIZE, true))
  792. return 0;
  793. return pnfs_generic_pg_test(pgio, prev, req);
  794. }
  795. static const struct nfs_pageio_ops bl_pg_read_ops = {
  796. .pg_init = bl_pg_init_read,
  797. .pg_test = bl_pg_test_read,
  798. .pg_doio = pnfs_generic_pg_readpages,
  799. .pg_cleanup = pnfs_generic_pg_cleanup,
  800. };
  801. static const struct nfs_pageio_ops bl_pg_write_ops = {
  802. .pg_init = bl_pg_init_write,
  803. .pg_test = bl_pg_test_write,
  804. .pg_doio = pnfs_generic_pg_writepages,
  805. .pg_cleanup = pnfs_generic_pg_cleanup,
  806. };
  807. static struct pnfs_layoutdriver_type blocklayout_type = {
  808. .id = LAYOUT_BLOCK_VOLUME,
  809. .name = "LAYOUT_BLOCK_VOLUME",
  810. .owner = THIS_MODULE,
  811. .flags = PNFS_LAYOUTRET_ON_SETATTR |
  812. PNFS_LAYOUTRET_ON_ERROR |
  813. PNFS_READ_WHOLE_PAGE,
  814. .read_pagelist = bl_read_pagelist,
  815. .write_pagelist = bl_write_pagelist,
  816. .alloc_layout_hdr = bl_alloc_layout_hdr,
  817. .free_layout_hdr = bl_free_layout_hdr,
  818. .alloc_lseg = bl_alloc_lseg,
  819. .free_lseg = bl_free_lseg,
  820. .return_range = bl_return_range,
  821. .prepare_layoutcommit = bl_prepare_layoutcommit,
  822. .cleanup_layoutcommit = bl_cleanup_layoutcommit,
  823. .set_layoutdriver = bl_set_layoutdriver,
  824. .alloc_deviceid_node = bl_alloc_deviceid_node,
  825. .free_deviceid_node = bl_free_deviceid_node,
  826. .pg_read_ops = &bl_pg_read_ops,
  827. .pg_write_ops = &bl_pg_write_ops,
  828. .sync = pnfs_generic_sync,
  829. };
  830. static struct pnfs_layoutdriver_type scsilayout_type = {
  831. .id = LAYOUT_SCSI,
  832. .name = "LAYOUT_SCSI",
  833. .owner = THIS_MODULE,
  834. .flags = PNFS_LAYOUTRET_ON_SETATTR |
  835. PNFS_LAYOUTRET_ON_ERROR |
  836. PNFS_READ_WHOLE_PAGE,
  837. .read_pagelist = bl_read_pagelist,
  838. .write_pagelist = bl_write_pagelist,
  839. .alloc_layout_hdr = sl_alloc_layout_hdr,
  840. .free_layout_hdr = bl_free_layout_hdr,
  841. .alloc_lseg = bl_alloc_lseg,
  842. .free_lseg = bl_free_lseg,
  843. .return_range = bl_return_range,
  844. .prepare_layoutcommit = bl_prepare_layoutcommit,
  845. .cleanup_layoutcommit = bl_cleanup_layoutcommit,
  846. .set_layoutdriver = bl_set_layoutdriver,
  847. .alloc_deviceid_node = bl_alloc_deviceid_node,
  848. .free_deviceid_node = bl_free_deviceid_node,
  849. .pg_read_ops = &bl_pg_read_ops,
  850. .pg_write_ops = &bl_pg_write_ops,
  851. .sync = pnfs_generic_sync,
  852. };
  853. static int __init nfs4blocklayout_init(void)
  854. {
  855. int ret;
  856. dprintk("%s: NFSv4 Block Layout Driver Registering...\n", __func__);
  857. ret = bl_init_pipefs();
  858. if (ret)
  859. goto out;
  860. ret = pnfs_register_layoutdriver(&blocklayout_type);
  861. if (ret)
  862. goto out_cleanup_pipe;
  863. ret = pnfs_register_layoutdriver(&scsilayout_type);
  864. if (ret)
  865. goto out_unregister_block;
  866. return 0;
  867. out_unregister_block:
  868. pnfs_unregister_layoutdriver(&blocklayout_type);
  869. out_cleanup_pipe:
  870. bl_cleanup_pipefs();
  871. out:
  872. return ret;
  873. }
  874. static void __exit nfs4blocklayout_exit(void)
  875. {
  876. dprintk("%s: NFSv4 Block Layout Driver Unregistering...\n",
  877. __func__);
  878. pnfs_unregister_layoutdriver(&scsilayout_type);
  879. pnfs_unregister_layoutdriver(&blocklayout_type);
  880. bl_cleanup_pipefs();
  881. }
  882. MODULE_ALIAS("nfs-layouttype4-3");
  883. MODULE_ALIAS("nfs-layouttype4-5");
  884. module_init(nfs4blocklayout_init);
  885. module_exit(nfs4blocklayout_exit);