pnfs.c 33 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287
  1. /*
  2. * pNFS functions to call and manage layout drivers.
  3. *
  4. * Copyright (c) 2002 [year of first publication]
  5. * The Regents of the University of Michigan
  6. * All Rights Reserved
  7. *
  8. * Dean Hildebrand <dhildebz@umich.edu>
  9. *
  10. * Permission is granted to use, copy, create derivative works, and
  11. * redistribute this software and such derivative works for any purpose,
  12. * so long as the name of the University of Michigan is not used in
  13. * any advertising or publicity pertaining to the use or distribution
  14. * of this software without specific, written prior authorization. If
  15. * the above copyright notice or any other identification of the
  16. * University of Michigan is included in any copy of any portion of
  17. * this software, then the disclaimer below must also be included.
  18. *
  19. * This software is provided as is, without representation or warranty
  20. * of any kind either express or implied, including without limitation
  21. * the implied warranties of merchantability, fitness for a particular
  22. * purpose, or noninfringement. The Regents of the University of
  23. * Michigan shall not be liable for any damages, including special,
  24. * indirect, incidental, or consequential damages, with respect to any
  25. * claim arising out of or in connection with the use of the software,
  26. * even if it has been or is hereafter advised of the possibility of
  27. * such damages.
  28. */
  29. #include <linux/nfs_fs.h>
  30. #include "internal.h"
  31. #include "pnfs.h"
  32. #include "iostat.h"
  33. #define NFSDBG_FACILITY NFSDBG_PNFS
  34. /* Locking:
  35. *
  36. * pnfs_spinlock:
  37. * protects pnfs_modules_tbl.
  38. */
  39. static DEFINE_SPINLOCK(pnfs_spinlock);
  40. /*
  41. * pnfs_modules_tbl holds all pnfs modules
  42. */
  43. static LIST_HEAD(pnfs_modules_tbl);
  44. /* Return the registered pnfs layout driver module matching given id */
  45. static struct pnfs_layoutdriver_type *
  46. find_pnfs_driver_locked(u32 id)
  47. {
  48. struct pnfs_layoutdriver_type *local;
  49. list_for_each_entry(local, &pnfs_modules_tbl, pnfs_tblid)
  50. if (local->id == id)
  51. goto out;
  52. local = NULL;
  53. out:
  54. dprintk("%s: Searching for id %u, found %p\n", __func__, id, local);
  55. return local;
  56. }
  57. static struct pnfs_layoutdriver_type *
  58. find_pnfs_driver(u32 id)
  59. {
  60. struct pnfs_layoutdriver_type *local;
  61. spin_lock(&pnfs_spinlock);
  62. local = find_pnfs_driver_locked(id);
  63. spin_unlock(&pnfs_spinlock);
  64. return local;
  65. }
  66. void
  67. unset_pnfs_layoutdriver(struct nfs_server *nfss)
  68. {
  69. if (nfss->pnfs_curr_ld)
  70. module_put(nfss->pnfs_curr_ld->owner);
  71. nfss->pnfs_curr_ld = NULL;
  72. }
  73. /*
  74. * Try to set the server's pnfs module to the pnfs layout type specified by id.
  75. * Currently only one pNFS layout driver per filesystem is supported.
  76. *
  77. * @id layout type. Zero (illegal layout type) indicates pNFS not in use.
  78. */
  79. void
  80. set_pnfs_layoutdriver(struct nfs_server *server, u32 id)
  81. {
  82. struct pnfs_layoutdriver_type *ld_type = NULL;
  83. if (id == 0)
  84. goto out_no_driver;
  85. if (!(server->nfs_client->cl_exchange_flags &
  86. (EXCHGID4_FLAG_USE_NON_PNFS | EXCHGID4_FLAG_USE_PNFS_MDS))) {
  87. printk(KERN_ERR "%s: id %u cl_exchange_flags 0x%x\n", __func__,
  88. id, server->nfs_client->cl_exchange_flags);
  89. goto out_no_driver;
  90. }
  91. ld_type = find_pnfs_driver(id);
  92. if (!ld_type) {
  93. request_module("%s-%u", LAYOUT_NFSV4_1_MODULE_PREFIX, id);
  94. ld_type = find_pnfs_driver(id);
  95. if (!ld_type) {
  96. dprintk("%s: No pNFS module found for %u.\n",
  97. __func__, id);
  98. goto out_no_driver;
  99. }
  100. }
  101. if (!try_module_get(ld_type->owner)) {
  102. dprintk("%s: Could not grab reference on module\n", __func__);
  103. goto out_no_driver;
  104. }
  105. server->pnfs_curr_ld = ld_type;
  106. dprintk("%s: pNFS module for %u set\n", __func__, id);
  107. return;
  108. out_no_driver:
  109. dprintk("%s: Using NFSv4 I/O\n", __func__);
  110. server->pnfs_curr_ld = NULL;
  111. }
  112. int
  113. pnfs_register_layoutdriver(struct pnfs_layoutdriver_type *ld_type)
  114. {
  115. int status = -EINVAL;
  116. struct pnfs_layoutdriver_type *tmp;
  117. if (ld_type->id == 0) {
  118. printk(KERN_ERR "%s id 0 is reserved\n", __func__);
  119. return status;
  120. }
  121. if (!ld_type->alloc_lseg || !ld_type->free_lseg) {
  122. printk(KERN_ERR "%s Layout driver must provide "
  123. "alloc_lseg and free_lseg.\n", __func__);
  124. return status;
  125. }
  126. spin_lock(&pnfs_spinlock);
  127. tmp = find_pnfs_driver_locked(ld_type->id);
  128. if (!tmp) {
  129. list_add(&ld_type->pnfs_tblid, &pnfs_modules_tbl);
  130. status = 0;
  131. dprintk("%s Registering id:%u name:%s\n", __func__, ld_type->id,
  132. ld_type->name);
  133. } else {
  134. printk(KERN_ERR "%s Module with id %d already loaded!\n",
  135. __func__, ld_type->id);
  136. }
  137. spin_unlock(&pnfs_spinlock);
  138. return status;
  139. }
  140. EXPORT_SYMBOL_GPL(pnfs_register_layoutdriver);
  141. void
  142. pnfs_unregister_layoutdriver(struct pnfs_layoutdriver_type *ld_type)
  143. {
  144. dprintk("%s Deregistering id:%u\n", __func__, ld_type->id);
  145. spin_lock(&pnfs_spinlock);
  146. list_del(&ld_type->pnfs_tblid);
  147. spin_unlock(&pnfs_spinlock);
  148. }
  149. EXPORT_SYMBOL_GPL(pnfs_unregister_layoutdriver);
  150. /*
  151. * pNFS client layout cache
  152. */
  153. /* Need to hold i_lock if caller does not already hold reference */
  154. void
  155. get_layout_hdr(struct pnfs_layout_hdr *lo)
  156. {
  157. atomic_inc(&lo->plh_refcount);
  158. }
  159. static struct pnfs_layout_hdr *
  160. pnfs_alloc_layout_hdr(struct inode *ino, gfp_t gfp_flags)
  161. {
  162. struct pnfs_layoutdriver_type *ld = NFS_SERVER(ino)->pnfs_curr_ld;
  163. return ld->alloc_layout_hdr ? ld->alloc_layout_hdr(ino, gfp_flags) :
  164. kzalloc(sizeof(struct pnfs_layout_hdr), gfp_flags);
  165. }
  166. static void
  167. pnfs_free_layout_hdr(struct pnfs_layout_hdr *lo)
  168. {
  169. struct pnfs_layoutdriver_type *ld = NFS_SERVER(lo->plh_inode)->pnfs_curr_ld;
  170. return ld->alloc_layout_hdr ? ld->free_layout_hdr(lo) : kfree(lo);
  171. }
  172. static void
  173. destroy_layout_hdr(struct pnfs_layout_hdr *lo)
  174. {
  175. dprintk("%s: freeing layout cache %p\n", __func__, lo);
  176. BUG_ON(!list_empty(&lo->plh_layouts));
  177. NFS_I(lo->plh_inode)->layout = NULL;
  178. pnfs_free_layout_hdr(lo);
  179. }
  180. static void
  181. put_layout_hdr_locked(struct pnfs_layout_hdr *lo)
  182. {
  183. if (atomic_dec_and_test(&lo->plh_refcount))
  184. destroy_layout_hdr(lo);
  185. }
  186. void
  187. put_layout_hdr(struct pnfs_layout_hdr *lo)
  188. {
  189. struct inode *inode = lo->plh_inode;
  190. if (atomic_dec_and_lock(&lo->plh_refcount, &inode->i_lock)) {
  191. destroy_layout_hdr(lo);
  192. spin_unlock(&inode->i_lock);
  193. }
  194. }
  195. static void
  196. init_lseg(struct pnfs_layout_hdr *lo, struct pnfs_layout_segment *lseg)
  197. {
  198. INIT_LIST_HEAD(&lseg->pls_list);
  199. atomic_set(&lseg->pls_refcount, 1);
  200. smp_mb();
  201. set_bit(NFS_LSEG_VALID, &lseg->pls_flags);
  202. lseg->pls_layout = lo;
  203. }
  204. static void free_lseg(struct pnfs_layout_segment *lseg)
  205. {
  206. struct inode *ino = lseg->pls_layout->plh_inode;
  207. NFS_SERVER(ino)->pnfs_curr_ld->free_lseg(lseg);
  208. /* Matched by get_layout_hdr in pnfs_insert_layout */
  209. put_layout_hdr(NFS_I(ino)->layout);
  210. }
  211. static void
  212. put_lseg_common(struct pnfs_layout_segment *lseg)
  213. {
  214. struct inode *inode = lseg->pls_layout->plh_inode;
  215. WARN_ON(test_bit(NFS_LSEG_VALID, &lseg->pls_flags));
  216. list_del_init(&lseg->pls_list);
  217. if (list_empty(&lseg->pls_layout->plh_segs)) {
  218. set_bit(NFS_LAYOUT_DESTROYED, &lseg->pls_layout->plh_flags);
  219. /* Matched by initial refcount set in alloc_init_layout_hdr */
  220. put_layout_hdr_locked(lseg->pls_layout);
  221. }
  222. rpc_wake_up(&NFS_SERVER(inode)->roc_rpcwaitq);
  223. }
  224. void
  225. put_lseg(struct pnfs_layout_segment *lseg)
  226. {
  227. struct inode *inode;
  228. if (!lseg)
  229. return;
  230. dprintk("%s: lseg %p ref %d valid %d\n", __func__, lseg,
  231. atomic_read(&lseg->pls_refcount),
  232. test_bit(NFS_LSEG_VALID, &lseg->pls_flags));
  233. inode = lseg->pls_layout->plh_inode;
  234. if (atomic_dec_and_lock(&lseg->pls_refcount, &inode->i_lock)) {
  235. LIST_HEAD(free_me);
  236. put_lseg_common(lseg);
  237. list_add(&lseg->pls_list, &free_me);
  238. spin_unlock(&inode->i_lock);
  239. pnfs_free_lseg_list(&free_me);
  240. }
  241. }
  242. EXPORT_SYMBOL_GPL(put_lseg);
  243. static inline u64
  244. end_offset(u64 start, u64 len)
  245. {
  246. u64 end;
  247. end = start + len;
  248. return end >= start ? end : NFS4_MAX_UINT64;
  249. }
  250. /* last octet in a range */
  251. static inline u64
  252. last_byte_offset(u64 start, u64 len)
  253. {
  254. u64 end;
  255. BUG_ON(!len);
  256. end = start + len;
  257. return end > start ? end - 1 : NFS4_MAX_UINT64;
  258. }
  259. /*
  260. * is l2 fully contained in l1?
  261. * start1 end1
  262. * [----------------------------------)
  263. * start2 end2
  264. * [----------------)
  265. */
  266. static inline int
  267. lo_seg_contained(struct pnfs_layout_range *l1,
  268. struct pnfs_layout_range *l2)
  269. {
  270. u64 start1 = l1->offset;
  271. u64 end1 = end_offset(start1, l1->length);
  272. u64 start2 = l2->offset;
  273. u64 end2 = end_offset(start2, l2->length);
  274. return (start1 <= start2) && (end1 >= end2);
  275. }
  276. /*
  277. * is l1 and l2 intersecting?
  278. * start1 end1
  279. * [----------------------------------)
  280. * start2 end2
  281. * [----------------)
  282. */
  283. static inline int
  284. lo_seg_intersecting(struct pnfs_layout_range *l1,
  285. struct pnfs_layout_range *l2)
  286. {
  287. u64 start1 = l1->offset;
  288. u64 end1 = end_offset(start1, l1->length);
  289. u64 start2 = l2->offset;
  290. u64 end2 = end_offset(start2, l2->length);
  291. return (end1 == NFS4_MAX_UINT64 || end1 > start2) &&
  292. (end2 == NFS4_MAX_UINT64 || end2 > start1);
  293. }
  294. static bool
  295. should_free_lseg(struct pnfs_layout_range *lseg_range,
  296. struct pnfs_layout_range *recall_range)
  297. {
  298. return (recall_range->iomode == IOMODE_ANY ||
  299. lseg_range->iomode == recall_range->iomode) &&
  300. lo_seg_intersecting(lseg_range, recall_range);
  301. }
  302. /* Returns 1 if lseg is removed from list, 0 otherwise */
  303. static int mark_lseg_invalid(struct pnfs_layout_segment *lseg,
  304. struct list_head *tmp_list)
  305. {
  306. int rv = 0;
  307. if (test_and_clear_bit(NFS_LSEG_VALID, &lseg->pls_flags)) {
  308. /* Remove the reference keeping the lseg in the
  309. * list. It will now be removed when all
  310. * outstanding io is finished.
  311. */
  312. dprintk("%s: lseg %p ref %d\n", __func__, lseg,
  313. atomic_read(&lseg->pls_refcount));
  314. if (atomic_dec_and_test(&lseg->pls_refcount)) {
  315. put_lseg_common(lseg);
  316. list_add(&lseg->pls_list, tmp_list);
  317. rv = 1;
  318. }
  319. }
  320. return rv;
  321. }
  322. /* Returns count of number of matching invalid lsegs remaining in list
  323. * after call.
  324. */
  325. int
  326. mark_matching_lsegs_invalid(struct pnfs_layout_hdr *lo,
  327. struct list_head *tmp_list,
  328. struct pnfs_layout_range *recall_range)
  329. {
  330. struct pnfs_layout_segment *lseg, *next;
  331. int invalid = 0, removed = 0;
  332. dprintk("%s:Begin lo %p\n", __func__, lo);
  333. if (list_empty(&lo->plh_segs)) {
  334. if (!test_and_set_bit(NFS_LAYOUT_DESTROYED, &lo->plh_flags))
  335. put_layout_hdr_locked(lo);
  336. return 0;
  337. }
  338. list_for_each_entry_safe(lseg, next, &lo->plh_segs, pls_list)
  339. if (!recall_range ||
  340. should_free_lseg(&lseg->pls_range, recall_range)) {
  341. dprintk("%s: freeing lseg %p iomode %d "
  342. "offset %llu length %llu\n", __func__,
  343. lseg, lseg->pls_range.iomode, lseg->pls_range.offset,
  344. lseg->pls_range.length);
  345. invalid++;
  346. removed += mark_lseg_invalid(lseg, tmp_list);
  347. }
  348. dprintk("%s:Return %i\n", __func__, invalid - removed);
  349. return invalid - removed;
  350. }
  351. /* note free_me must contain lsegs from a single layout_hdr */
  352. void
  353. pnfs_free_lseg_list(struct list_head *free_me)
  354. {
  355. struct pnfs_layout_segment *lseg, *tmp;
  356. struct pnfs_layout_hdr *lo;
  357. if (list_empty(free_me))
  358. return;
  359. lo = list_first_entry(free_me, struct pnfs_layout_segment,
  360. pls_list)->pls_layout;
  361. if (test_bit(NFS_LAYOUT_DESTROYED, &lo->plh_flags)) {
  362. struct nfs_client *clp;
  363. clp = NFS_SERVER(lo->plh_inode)->nfs_client;
  364. spin_lock(&clp->cl_lock);
  365. list_del_init(&lo->plh_layouts);
  366. spin_unlock(&clp->cl_lock);
  367. }
  368. list_for_each_entry_safe(lseg, tmp, free_me, pls_list) {
  369. list_del(&lseg->pls_list);
  370. free_lseg(lseg);
  371. }
  372. }
  373. void
  374. pnfs_destroy_layout(struct nfs_inode *nfsi)
  375. {
  376. struct pnfs_layout_hdr *lo;
  377. LIST_HEAD(tmp_list);
  378. spin_lock(&nfsi->vfs_inode.i_lock);
  379. lo = nfsi->layout;
  380. if (lo) {
  381. lo->plh_block_lgets++; /* permanently block new LAYOUTGETs */
  382. mark_matching_lsegs_invalid(lo, &tmp_list, NULL);
  383. }
  384. spin_unlock(&nfsi->vfs_inode.i_lock);
  385. pnfs_free_lseg_list(&tmp_list);
  386. }
  387. /*
  388. * Called by the state manger to remove all layouts established under an
  389. * expired lease.
  390. */
  391. void
  392. pnfs_destroy_all_layouts(struct nfs_client *clp)
  393. {
  394. struct pnfs_layout_hdr *lo;
  395. LIST_HEAD(tmp_list);
  396. spin_lock(&clp->cl_lock);
  397. list_splice_init(&clp->cl_layouts, &tmp_list);
  398. spin_unlock(&clp->cl_lock);
  399. while (!list_empty(&tmp_list)) {
  400. lo = list_entry(tmp_list.next, struct pnfs_layout_hdr,
  401. plh_layouts);
  402. dprintk("%s freeing layout for inode %lu\n", __func__,
  403. lo->plh_inode->i_ino);
  404. list_del_init(&lo->plh_layouts);
  405. pnfs_destroy_layout(NFS_I(lo->plh_inode));
  406. }
  407. }
  408. /* update lo->plh_stateid with new if is more recent */
  409. void
  410. pnfs_set_layout_stateid(struct pnfs_layout_hdr *lo, const nfs4_stateid *new,
  411. bool update_barrier)
  412. {
  413. u32 oldseq, newseq;
  414. oldseq = be32_to_cpu(lo->plh_stateid.stateid.seqid);
  415. newseq = be32_to_cpu(new->stateid.seqid);
  416. if ((int)(newseq - oldseq) > 0) {
  417. memcpy(&lo->plh_stateid, &new->stateid, sizeof(new->stateid));
  418. if (update_barrier) {
  419. u32 new_barrier = be32_to_cpu(new->stateid.seqid);
  420. if ((int)(new_barrier - lo->plh_barrier))
  421. lo->plh_barrier = new_barrier;
  422. } else {
  423. /* Because of wraparound, we want to keep the barrier
  424. * "close" to the current seqids. It needs to be
  425. * within 2**31 to count as "behind", so if it
  426. * gets too near that limit, give us a litle leeway
  427. * and bring it to within 2**30.
  428. * NOTE - and yes, this is all unsigned arithmetic.
  429. */
  430. if (unlikely((newseq - lo->plh_barrier) > (3 << 29)))
  431. lo->plh_barrier = newseq - (1 << 30);
  432. }
  433. }
  434. }
  435. /* lget is set to 1 if called from inside send_layoutget call chain */
  436. static bool
  437. pnfs_layoutgets_blocked(struct pnfs_layout_hdr *lo, nfs4_stateid *stateid,
  438. int lget)
  439. {
  440. if ((stateid) &&
  441. (int)(lo->plh_barrier - be32_to_cpu(stateid->stateid.seqid)) >= 0)
  442. return true;
  443. return lo->plh_block_lgets ||
  444. test_bit(NFS_LAYOUT_DESTROYED, &lo->plh_flags) ||
  445. test_bit(NFS_LAYOUT_BULK_RECALL, &lo->plh_flags) ||
  446. (list_empty(&lo->plh_segs) &&
  447. (atomic_read(&lo->plh_outstanding) > lget));
  448. }
  449. int
  450. pnfs_choose_layoutget_stateid(nfs4_stateid *dst, struct pnfs_layout_hdr *lo,
  451. struct nfs4_state *open_state)
  452. {
  453. int status = 0;
  454. dprintk("--> %s\n", __func__);
  455. spin_lock(&lo->plh_inode->i_lock);
  456. if (pnfs_layoutgets_blocked(lo, NULL, 1)) {
  457. status = -EAGAIN;
  458. } else if (list_empty(&lo->plh_segs)) {
  459. int seq;
  460. do {
  461. seq = read_seqbegin(&open_state->seqlock);
  462. memcpy(dst->data, open_state->stateid.data,
  463. sizeof(open_state->stateid.data));
  464. } while (read_seqretry(&open_state->seqlock, seq));
  465. } else
  466. memcpy(dst->data, lo->plh_stateid.data, sizeof(lo->plh_stateid.data));
  467. spin_unlock(&lo->plh_inode->i_lock);
  468. dprintk("<-- %s\n", __func__);
  469. return status;
  470. }
  471. /*
  472. * Get layout from server.
  473. * for now, assume that whole file layouts are requested.
  474. * arg->offset: 0
  475. * arg->length: all ones
  476. */
  477. static struct pnfs_layout_segment *
  478. send_layoutget(struct pnfs_layout_hdr *lo,
  479. struct nfs_open_context *ctx,
  480. struct pnfs_layout_range *range,
  481. gfp_t gfp_flags)
  482. {
  483. struct inode *ino = lo->plh_inode;
  484. struct nfs_server *server = NFS_SERVER(ino);
  485. struct nfs4_layoutget *lgp;
  486. struct pnfs_layout_segment *lseg = NULL;
  487. struct page **pages = NULL;
  488. int i;
  489. u32 max_resp_sz, max_pages;
  490. dprintk("--> %s\n", __func__);
  491. BUG_ON(ctx == NULL);
  492. lgp = kzalloc(sizeof(*lgp), gfp_flags);
  493. if (lgp == NULL)
  494. return NULL;
  495. /* allocate pages for xdr post processing */
  496. max_resp_sz = server->nfs_client->cl_session->fc_attrs.max_resp_sz;
  497. max_pages = max_resp_sz >> PAGE_SHIFT;
  498. pages = kzalloc(max_pages * sizeof(struct page *), gfp_flags);
  499. if (!pages)
  500. goto out_err_free;
  501. for (i = 0; i < max_pages; i++) {
  502. pages[i] = alloc_page(gfp_flags);
  503. if (!pages[i])
  504. goto out_err_free;
  505. }
  506. lgp->args.minlength = PAGE_CACHE_SIZE;
  507. if (lgp->args.minlength > range->length)
  508. lgp->args.minlength = range->length;
  509. lgp->args.maxcount = PNFS_LAYOUT_MAXSIZE;
  510. lgp->args.range = *range;
  511. lgp->args.type = server->pnfs_curr_ld->id;
  512. lgp->args.inode = ino;
  513. lgp->args.ctx = get_nfs_open_context(ctx);
  514. lgp->args.layout.pages = pages;
  515. lgp->args.layout.pglen = max_pages * PAGE_SIZE;
  516. lgp->lsegpp = &lseg;
  517. lgp->gfp_flags = gfp_flags;
  518. /* Synchronously retrieve layout information from server and
  519. * store in lseg.
  520. */
  521. nfs4_proc_layoutget(lgp);
  522. if (!lseg) {
  523. /* remember that LAYOUTGET failed and suspend trying */
  524. set_bit(lo_fail_bit(range->iomode), &lo->plh_flags);
  525. }
  526. /* free xdr pages */
  527. for (i = 0; i < max_pages; i++)
  528. __free_page(pages[i]);
  529. kfree(pages);
  530. return lseg;
  531. out_err_free:
  532. /* free any allocated xdr pages, lgp as it's not used */
  533. if (pages) {
  534. for (i = 0; i < max_pages; i++) {
  535. if (!pages[i])
  536. break;
  537. __free_page(pages[i]);
  538. }
  539. kfree(pages);
  540. }
  541. kfree(lgp);
  542. return NULL;
  543. }
  544. /* Initiates a LAYOUTRETURN(FILE) */
  545. int
  546. _pnfs_return_layout(struct inode *ino)
  547. {
  548. struct pnfs_layout_hdr *lo = NULL;
  549. struct nfs_inode *nfsi = NFS_I(ino);
  550. LIST_HEAD(tmp_list);
  551. struct nfs4_layoutreturn *lrp;
  552. nfs4_stateid stateid;
  553. int status = 0;
  554. dprintk("--> %s\n", __func__);
  555. spin_lock(&ino->i_lock);
  556. lo = nfsi->layout;
  557. if (!lo) {
  558. spin_unlock(&ino->i_lock);
  559. dprintk("%s: no layout to return\n", __func__);
  560. return status;
  561. }
  562. stateid = nfsi->layout->plh_stateid;
  563. mark_matching_lsegs_invalid(lo, &tmp_list, NULL);
  564. lo->plh_block_lgets++;
  565. /* Reference matched in nfs4_layoutreturn_release */
  566. get_layout_hdr(lo);
  567. spin_unlock(&ino->i_lock);
  568. pnfs_free_lseg_list(&tmp_list);
  569. WARN_ON(test_bit(NFS_INO_LAYOUTCOMMIT, &nfsi->flags));
  570. lrp = kzalloc(sizeof(*lrp), GFP_KERNEL);
  571. if (unlikely(lrp == NULL)) {
  572. status = -ENOMEM;
  573. goto out;
  574. }
  575. lrp->args.stateid = stateid;
  576. lrp->args.layout_type = NFS_SERVER(ino)->pnfs_curr_ld->id;
  577. lrp->args.inode = ino;
  578. lrp->clp = NFS_SERVER(ino)->nfs_client;
  579. status = nfs4_proc_layoutreturn(lrp);
  580. out:
  581. dprintk("<-- %s status: %d\n", __func__, status);
  582. return status;
  583. }
  584. bool pnfs_roc(struct inode *ino)
  585. {
  586. struct pnfs_layout_hdr *lo;
  587. struct pnfs_layout_segment *lseg, *tmp;
  588. LIST_HEAD(tmp_list);
  589. bool found = false;
  590. spin_lock(&ino->i_lock);
  591. lo = NFS_I(ino)->layout;
  592. if (!lo || !test_and_clear_bit(NFS_LAYOUT_ROC, &lo->plh_flags) ||
  593. test_bit(NFS_LAYOUT_BULK_RECALL, &lo->plh_flags))
  594. goto out_nolayout;
  595. list_for_each_entry_safe(lseg, tmp, &lo->plh_segs, pls_list)
  596. if (test_bit(NFS_LSEG_ROC, &lseg->pls_flags)) {
  597. mark_lseg_invalid(lseg, &tmp_list);
  598. found = true;
  599. }
  600. if (!found)
  601. goto out_nolayout;
  602. lo->plh_block_lgets++;
  603. get_layout_hdr(lo); /* matched in pnfs_roc_release */
  604. spin_unlock(&ino->i_lock);
  605. pnfs_free_lseg_list(&tmp_list);
  606. return true;
  607. out_nolayout:
  608. spin_unlock(&ino->i_lock);
  609. return false;
  610. }
  611. void pnfs_roc_release(struct inode *ino)
  612. {
  613. struct pnfs_layout_hdr *lo;
  614. spin_lock(&ino->i_lock);
  615. lo = NFS_I(ino)->layout;
  616. lo->plh_block_lgets--;
  617. put_layout_hdr_locked(lo);
  618. spin_unlock(&ino->i_lock);
  619. }
  620. void pnfs_roc_set_barrier(struct inode *ino, u32 barrier)
  621. {
  622. struct pnfs_layout_hdr *lo;
  623. spin_lock(&ino->i_lock);
  624. lo = NFS_I(ino)->layout;
  625. if ((int)(barrier - lo->plh_barrier) > 0)
  626. lo->plh_barrier = barrier;
  627. spin_unlock(&ino->i_lock);
  628. }
  629. bool pnfs_roc_drain(struct inode *ino, u32 *barrier)
  630. {
  631. struct nfs_inode *nfsi = NFS_I(ino);
  632. struct pnfs_layout_segment *lseg;
  633. bool found = false;
  634. spin_lock(&ino->i_lock);
  635. list_for_each_entry(lseg, &nfsi->layout->plh_segs, pls_list)
  636. if (test_bit(NFS_LSEG_ROC, &lseg->pls_flags)) {
  637. found = true;
  638. break;
  639. }
  640. if (!found) {
  641. struct pnfs_layout_hdr *lo = nfsi->layout;
  642. u32 current_seqid = be32_to_cpu(lo->plh_stateid.stateid.seqid);
  643. /* Since close does not return a layout stateid for use as
  644. * a barrier, we choose the worst-case barrier.
  645. */
  646. *barrier = current_seqid + atomic_read(&lo->plh_outstanding);
  647. }
  648. spin_unlock(&ino->i_lock);
  649. return found;
  650. }
  651. /*
  652. * Compare two layout segments for sorting into layout cache.
  653. * We want to preferentially return RW over RO layouts, so ensure those
  654. * are seen first.
  655. */
  656. static s64
  657. cmp_layout(struct pnfs_layout_range *l1,
  658. struct pnfs_layout_range *l2)
  659. {
  660. s64 d;
  661. /* high offset > low offset */
  662. d = l1->offset - l2->offset;
  663. if (d)
  664. return d;
  665. /* short length > long length */
  666. d = l2->length - l1->length;
  667. if (d)
  668. return d;
  669. /* read > read/write */
  670. return (int)(l1->iomode == IOMODE_READ) - (int)(l2->iomode == IOMODE_READ);
  671. }
  672. static void
  673. pnfs_insert_layout(struct pnfs_layout_hdr *lo,
  674. struct pnfs_layout_segment *lseg)
  675. {
  676. struct pnfs_layout_segment *lp;
  677. dprintk("%s:Begin\n", __func__);
  678. assert_spin_locked(&lo->plh_inode->i_lock);
  679. list_for_each_entry(lp, &lo->plh_segs, pls_list) {
  680. if (cmp_layout(&lseg->pls_range, &lp->pls_range) > 0)
  681. continue;
  682. list_add_tail(&lseg->pls_list, &lp->pls_list);
  683. dprintk("%s: inserted lseg %p "
  684. "iomode %d offset %llu length %llu before "
  685. "lp %p iomode %d offset %llu length %llu\n",
  686. __func__, lseg, lseg->pls_range.iomode,
  687. lseg->pls_range.offset, lseg->pls_range.length,
  688. lp, lp->pls_range.iomode, lp->pls_range.offset,
  689. lp->pls_range.length);
  690. goto out;
  691. }
  692. list_add_tail(&lseg->pls_list, &lo->plh_segs);
  693. dprintk("%s: inserted lseg %p "
  694. "iomode %d offset %llu length %llu at tail\n",
  695. __func__, lseg, lseg->pls_range.iomode,
  696. lseg->pls_range.offset, lseg->pls_range.length);
  697. out:
  698. get_layout_hdr(lo);
  699. dprintk("%s:Return\n", __func__);
  700. }
  701. static struct pnfs_layout_hdr *
  702. alloc_init_layout_hdr(struct inode *ino, gfp_t gfp_flags)
  703. {
  704. struct pnfs_layout_hdr *lo;
  705. lo = pnfs_alloc_layout_hdr(ino, gfp_flags);
  706. if (!lo)
  707. return NULL;
  708. atomic_set(&lo->plh_refcount, 1);
  709. INIT_LIST_HEAD(&lo->plh_layouts);
  710. INIT_LIST_HEAD(&lo->plh_segs);
  711. INIT_LIST_HEAD(&lo->plh_bulk_recall);
  712. lo->plh_inode = ino;
  713. return lo;
  714. }
  715. static struct pnfs_layout_hdr *
  716. pnfs_find_alloc_layout(struct inode *ino, gfp_t gfp_flags)
  717. {
  718. struct nfs_inode *nfsi = NFS_I(ino);
  719. struct pnfs_layout_hdr *new = NULL;
  720. dprintk("%s Begin ino=%p layout=%p\n", __func__, ino, nfsi->layout);
  721. assert_spin_locked(&ino->i_lock);
  722. if (nfsi->layout) {
  723. if (test_bit(NFS_LAYOUT_DESTROYED, &nfsi->layout->plh_flags))
  724. return NULL;
  725. else
  726. return nfsi->layout;
  727. }
  728. spin_unlock(&ino->i_lock);
  729. new = alloc_init_layout_hdr(ino, gfp_flags);
  730. spin_lock(&ino->i_lock);
  731. if (likely(nfsi->layout == NULL)) /* Won the race? */
  732. nfsi->layout = new;
  733. else
  734. pnfs_free_layout_hdr(new);
  735. return nfsi->layout;
  736. }
  737. /*
  738. * iomode matching rules:
  739. * iomode lseg match
  740. * ----- ----- -----
  741. * ANY READ true
  742. * ANY RW true
  743. * RW READ false
  744. * RW RW true
  745. * READ READ true
  746. * READ RW true
  747. */
  748. static int
  749. is_matching_lseg(struct pnfs_layout_range *ls_range,
  750. struct pnfs_layout_range *range)
  751. {
  752. struct pnfs_layout_range range1;
  753. if ((range->iomode == IOMODE_RW &&
  754. ls_range->iomode != IOMODE_RW) ||
  755. !lo_seg_intersecting(ls_range, range))
  756. return 0;
  757. /* range1 covers only the first byte in the range */
  758. range1 = *range;
  759. range1.length = 1;
  760. return lo_seg_contained(ls_range, &range1);
  761. }
  762. /*
  763. * lookup range in layout
  764. */
  765. static struct pnfs_layout_segment *
  766. pnfs_find_lseg(struct pnfs_layout_hdr *lo,
  767. struct pnfs_layout_range *range)
  768. {
  769. struct pnfs_layout_segment *lseg, *ret = NULL;
  770. dprintk("%s:Begin\n", __func__);
  771. assert_spin_locked(&lo->plh_inode->i_lock);
  772. list_for_each_entry(lseg, &lo->plh_segs, pls_list) {
  773. if (test_bit(NFS_LSEG_VALID, &lseg->pls_flags) &&
  774. is_matching_lseg(&lseg->pls_range, range)) {
  775. ret = get_lseg(lseg);
  776. break;
  777. }
  778. if (lseg->pls_range.offset > range->offset)
  779. break;
  780. }
  781. dprintk("%s:Return lseg %p ref %d\n",
  782. __func__, ret, ret ? atomic_read(&ret->pls_refcount) : 0);
  783. return ret;
  784. }
  785. /*
  786. * Layout segment is retreived from the server if not cached.
  787. * The appropriate layout segment is referenced and returned to the caller.
  788. */
  789. struct pnfs_layout_segment *
  790. pnfs_update_layout(struct inode *ino,
  791. struct nfs_open_context *ctx,
  792. loff_t pos,
  793. u64 count,
  794. enum pnfs_iomode iomode,
  795. gfp_t gfp_flags)
  796. {
  797. struct pnfs_layout_range arg = {
  798. .iomode = iomode,
  799. .offset = pos,
  800. .length = count,
  801. };
  802. unsigned pg_offset;
  803. struct nfs_inode *nfsi = NFS_I(ino);
  804. struct nfs_client *clp = NFS_SERVER(ino)->nfs_client;
  805. struct pnfs_layout_hdr *lo;
  806. struct pnfs_layout_segment *lseg = NULL;
  807. bool first = false;
  808. if (!pnfs_enabled_sb(NFS_SERVER(ino)))
  809. return NULL;
  810. spin_lock(&ino->i_lock);
  811. lo = pnfs_find_alloc_layout(ino, gfp_flags);
  812. if (lo == NULL) {
  813. dprintk("%s ERROR: can't get pnfs_layout_hdr\n", __func__);
  814. goto out_unlock;
  815. }
  816. /* Do we even need to bother with this? */
  817. if (test_bit(NFS4CLNT_LAYOUTRECALL, &clp->cl_state) ||
  818. test_bit(NFS_LAYOUT_BULK_RECALL, &lo->plh_flags)) {
  819. dprintk("%s matches recall, use MDS\n", __func__);
  820. goto out_unlock;
  821. }
  822. /* if LAYOUTGET already failed once we don't try again */
  823. if (test_bit(lo_fail_bit(iomode), &nfsi->layout->plh_flags))
  824. goto out_unlock;
  825. /* Check to see if the layout for the given range already exists */
  826. lseg = pnfs_find_lseg(lo, &arg);
  827. if (lseg)
  828. goto out_unlock;
  829. if (pnfs_layoutgets_blocked(lo, NULL, 0))
  830. goto out_unlock;
  831. atomic_inc(&lo->plh_outstanding);
  832. get_layout_hdr(lo);
  833. if (list_empty(&lo->plh_segs))
  834. first = true;
  835. spin_unlock(&ino->i_lock);
  836. if (first) {
  837. /* The lo must be on the clp list if there is any
  838. * chance of a CB_LAYOUTRECALL(FILE) coming in.
  839. */
  840. spin_lock(&clp->cl_lock);
  841. BUG_ON(!list_empty(&lo->plh_layouts));
  842. list_add_tail(&lo->plh_layouts, &clp->cl_layouts);
  843. spin_unlock(&clp->cl_lock);
  844. }
  845. pg_offset = arg.offset & ~PAGE_CACHE_MASK;
  846. if (pg_offset) {
  847. arg.offset -= pg_offset;
  848. arg.length += pg_offset;
  849. }
  850. arg.length = PAGE_CACHE_ALIGN(arg.length);
  851. lseg = send_layoutget(lo, ctx, &arg, gfp_flags);
  852. if (!lseg && first) {
  853. spin_lock(&clp->cl_lock);
  854. list_del_init(&lo->plh_layouts);
  855. spin_unlock(&clp->cl_lock);
  856. }
  857. atomic_dec(&lo->plh_outstanding);
  858. put_layout_hdr(lo);
  859. out:
  860. dprintk("%s end, state 0x%lx lseg %p\n", __func__,
  861. nfsi->layout ? nfsi->layout->plh_flags : -1, lseg);
  862. return lseg;
  863. out_unlock:
  864. spin_unlock(&ino->i_lock);
  865. goto out;
  866. }
  867. int
  868. pnfs_layout_process(struct nfs4_layoutget *lgp)
  869. {
  870. struct pnfs_layout_hdr *lo = NFS_I(lgp->args.inode)->layout;
  871. struct nfs4_layoutget_res *res = &lgp->res;
  872. struct pnfs_layout_segment *lseg;
  873. struct inode *ino = lo->plh_inode;
  874. struct nfs_client *clp = NFS_SERVER(ino)->nfs_client;
  875. int status = 0;
  876. /* Inject layout blob into I/O device driver */
  877. lseg = NFS_SERVER(ino)->pnfs_curr_ld->alloc_lseg(lo, res, lgp->gfp_flags);
  878. if (!lseg || IS_ERR(lseg)) {
  879. if (!lseg)
  880. status = -ENOMEM;
  881. else
  882. status = PTR_ERR(lseg);
  883. dprintk("%s: Could not allocate layout: error %d\n",
  884. __func__, status);
  885. goto out;
  886. }
  887. spin_lock(&ino->i_lock);
  888. if (test_bit(NFS4CLNT_LAYOUTRECALL, &clp->cl_state) ||
  889. test_bit(NFS_LAYOUT_BULK_RECALL, &lo->plh_flags)) {
  890. dprintk("%s forget reply due to recall\n", __func__);
  891. goto out_forget_reply;
  892. }
  893. if (pnfs_layoutgets_blocked(lo, &res->stateid, 1)) {
  894. dprintk("%s forget reply due to state\n", __func__);
  895. goto out_forget_reply;
  896. }
  897. init_lseg(lo, lseg);
  898. lseg->pls_range = res->range;
  899. *lgp->lsegpp = get_lseg(lseg);
  900. pnfs_insert_layout(lo, lseg);
  901. if (res->return_on_close) {
  902. set_bit(NFS_LSEG_ROC, &lseg->pls_flags);
  903. set_bit(NFS_LAYOUT_ROC, &lo->plh_flags);
  904. }
  905. /* Done processing layoutget. Set the layout stateid */
  906. pnfs_set_layout_stateid(lo, &res->stateid, false);
  907. spin_unlock(&ino->i_lock);
  908. out:
  909. return status;
  910. out_forget_reply:
  911. spin_unlock(&ino->i_lock);
  912. lseg->pls_layout = lo;
  913. NFS_SERVER(ino)->pnfs_curr_ld->free_lseg(lseg);
  914. goto out;
  915. }
  916. bool
  917. pnfs_generic_pg_test(struct nfs_pageio_descriptor *pgio, struct nfs_page *prev,
  918. struct nfs_page *req)
  919. {
  920. enum pnfs_iomode access_type;
  921. gfp_t gfp_flags;
  922. /* We assume that pg_ioflags == 0 iff we're reading a page */
  923. if (pgio->pg_ioflags == 0) {
  924. access_type = IOMODE_READ;
  925. gfp_flags = GFP_KERNEL;
  926. } else {
  927. access_type = IOMODE_RW;
  928. gfp_flags = GFP_NOFS;
  929. }
  930. if (pgio->pg_count == prev->wb_bytes) {
  931. /* This is first coelesce call for a series of nfs_pages */
  932. pgio->pg_lseg = pnfs_update_layout(pgio->pg_inode,
  933. prev->wb_context,
  934. req_offset(req),
  935. pgio->pg_count,
  936. access_type,
  937. gfp_flags);
  938. return true;
  939. }
  940. if (pgio->pg_lseg &&
  941. req_offset(req) > end_offset(pgio->pg_lseg->pls_range.offset,
  942. pgio->pg_lseg->pls_range.length))
  943. return false;
  944. return true;
  945. }
  946. EXPORT_SYMBOL_GPL(pnfs_generic_pg_test);
  947. /*
  948. * Called by non rpc-based layout drivers
  949. */
  950. int
  951. pnfs_ld_write_done(struct nfs_write_data *data)
  952. {
  953. int status;
  954. if (!data->pnfs_error) {
  955. pnfs_set_layoutcommit(data);
  956. data->mds_ops->rpc_call_done(&data->task, data);
  957. data->mds_ops->rpc_release(data);
  958. return 0;
  959. }
  960. dprintk("%s: pnfs_error=%d, retry via MDS\n", __func__,
  961. data->pnfs_error);
  962. status = nfs_initiate_write(data, NFS_CLIENT(data->inode),
  963. data->mds_ops, NFS_FILE_SYNC);
  964. return status ? : -EAGAIN;
  965. }
  966. EXPORT_SYMBOL_GPL(pnfs_ld_write_done);
  967. enum pnfs_try_status
  968. pnfs_try_to_write_data(struct nfs_write_data *wdata,
  969. const struct rpc_call_ops *call_ops, int how)
  970. {
  971. struct inode *inode = wdata->inode;
  972. enum pnfs_try_status trypnfs;
  973. struct nfs_server *nfss = NFS_SERVER(inode);
  974. wdata->mds_ops = call_ops;
  975. dprintk("%s: Writing ino:%lu %u@%llu (how %d)\n", __func__,
  976. inode->i_ino, wdata->args.count, wdata->args.offset, how);
  977. trypnfs = nfss->pnfs_curr_ld->write_pagelist(wdata, how);
  978. if (trypnfs == PNFS_NOT_ATTEMPTED) {
  979. put_lseg(wdata->lseg);
  980. wdata->lseg = NULL;
  981. } else
  982. nfs_inc_stats(inode, NFSIOS_PNFS_WRITE);
  983. dprintk("%s End (trypnfs:%d)\n", __func__, trypnfs);
  984. return trypnfs;
  985. }
  986. /*
  987. * Called by non rpc-based layout drivers
  988. */
  989. int
  990. pnfs_ld_read_done(struct nfs_read_data *data)
  991. {
  992. int status;
  993. if (!data->pnfs_error) {
  994. __nfs4_read_done_cb(data);
  995. data->mds_ops->rpc_call_done(&data->task, data);
  996. data->mds_ops->rpc_release(data);
  997. return 0;
  998. }
  999. dprintk("%s: pnfs_error=%d, retry via MDS\n", __func__,
  1000. data->pnfs_error);
  1001. status = nfs_initiate_read(data, NFS_CLIENT(data->inode),
  1002. data->mds_ops);
  1003. return status ? : -EAGAIN;
  1004. }
  1005. EXPORT_SYMBOL_GPL(pnfs_ld_read_done);
  1006. /*
  1007. * Call the appropriate parallel I/O subsystem read function.
  1008. */
  1009. enum pnfs_try_status
  1010. pnfs_try_to_read_data(struct nfs_read_data *rdata,
  1011. const struct rpc_call_ops *call_ops)
  1012. {
  1013. struct inode *inode = rdata->inode;
  1014. struct nfs_server *nfss = NFS_SERVER(inode);
  1015. enum pnfs_try_status trypnfs;
  1016. rdata->mds_ops = call_ops;
  1017. dprintk("%s: Reading ino:%lu %u@%llu\n",
  1018. __func__, inode->i_ino, rdata->args.count, rdata->args.offset);
  1019. trypnfs = nfss->pnfs_curr_ld->read_pagelist(rdata);
  1020. if (trypnfs == PNFS_NOT_ATTEMPTED) {
  1021. put_lseg(rdata->lseg);
  1022. rdata->lseg = NULL;
  1023. } else {
  1024. nfs_inc_stats(inode, NFSIOS_PNFS_READ);
  1025. }
  1026. dprintk("%s End (trypnfs:%d)\n", __func__, trypnfs);
  1027. return trypnfs;
  1028. }
  1029. /*
  1030. * Currently there is only one (whole file) write lseg.
  1031. */
  1032. static struct pnfs_layout_segment *pnfs_list_write_lseg(struct inode *inode)
  1033. {
  1034. struct pnfs_layout_segment *lseg, *rv = NULL;
  1035. list_for_each_entry(lseg, &NFS_I(inode)->layout->plh_segs, pls_list)
  1036. if (lseg->pls_range.iomode == IOMODE_RW)
  1037. rv = lseg;
  1038. return rv;
  1039. }
  1040. void
  1041. pnfs_set_layoutcommit(struct nfs_write_data *wdata)
  1042. {
  1043. struct nfs_inode *nfsi = NFS_I(wdata->inode);
  1044. loff_t end_pos = wdata->mds_offset + wdata->res.count;
  1045. bool mark_as_dirty = false;
  1046. spin_lock(&nfsi->vfs_inode.i_lock);
  1047. if (!test_and_set_bit(NFS_INO_LAYOUTCOMMIT, &nfsi->flags)) {
  1048. /* references matched in nfs4_layoutcommit_release */
  1049. get_lseg(wdata->lseg);
  1050. wdata->lseg->pls_lc_cred =
  1051. get_rpccred(wdata->args.context->state->owner->so_cred);
  1052. mark_as_dirty = true;
  1053. dprintk("%s: Set layoutcommit for inode %lu ",
  1054. __func__, wdata->inode->i_ino);
  1055. }
  1056. if (end_pos > wdata->lseg->pls_end_pos)
  1057. wdata->lseg->pls_end_pos = end_pos;
  1058. spin_unlock(&nfsi->vfs_inode.i_lock);
  1059. /* if pnfs_layoutcommit_inode() runs between inode locks, the next one
  1060. * will be a noop because NFS_INO_LAYOUTCOMMIT will not be set */
  1061. if (mark_as_dirty)
  1062. mark_inode_dirty_sync(wdata->inode);
  1063. }
  1064. EXPORT_SYMBOL_GPL(pnfs_set_layoutcommit);
  1065. /*
  1066. * For the LAYOUT4_NFSV4_1_FILES layout type, NFS_DATA_SYNC WRITEs and
  1067. * NFS_UNSTABLE WRITEs with a COMMIT to data servers must store enough
  1068. * data to disk to allow the server to recover the data if it crashes.
  1069. * LAYOUTCOMMIT is only needed when the NFL4_UFLG_COMMIT_THRU_MDS flag
  1070. * is off, and a COMMIT is sent to a data server, or
  1071. * if WRITEs to a data server return NFS_DATA_SYNC.
  1072. */
  1073. int
  1074. pnfs_layoutcommit_inode(struct inode *inode, bool sync)
  1075. {
  1076. struct nfs4_layoutcommit_data *data;
  1077. struct nfs_inode *nfsi = NFS_I(inode);
  1078. struct pnfs_layout_segment *lseg;
  1079. struct rpc_cred *cred;
  1080. loff_t end_pos;
  1081. int status = 0;
  1082. dprintk("--> %s inode %lu\n", __func__, inode->i_ino);
  1083. if (!test_bit(NFS_INO_LAYOUTCOMMIT, &nfsi->flags))
  1084. return 0;
  1085. /* Note kzalloc ensures data->res.seq_res.sr_slot == NULL */
  1086. data = kzalloc(sizeof(*data), GFP_NOFS);
  1087. if (!data) {
  1088. mark_inode_dirty_sync(inode);
  1089. status = -ENOMEM;
  1090. goto out;
  1091. }
  1092. spin_lock(&inode->i_lock);
  1093. if (!test_and_clear_bit(NFS_INO_LAYOUTCOMMIT, &nfsi->flags)) {
  1094. spin_unlock(&inode->i_lock);
  1095. kfree(data);
  1096. goto out;
  1097. }
  1098. /*
  1099. * Currently only one (whole file) write lseg which is referenced
  1100. * in pnfs_set_layoutcommit and will be found.
  1101. */
  1102. lseg = pnfs_list_write_lseg(inode);
  1103. end_pos = lseg->pls_end_pos;
  1104. cred = lseg->pls_lc_cred;
  1105. lseg->pls_end_pos = 0;
  1106. lseg->pls_lc_cred = NULL;
  1107. memcpy(&data->args.stateid.data, nfsi->layout->plh_stateid.data,
  1108. sizeof(nfsi->layout->plh_stateid.data));
  1109. spin_unlock(&inode->i_lock);
  1110. data->args.inode = inode;
  1111. data->lseg = lseg;
  1112. data->cred = cred;
  1113. nfs_fattr_init(&data->fattr);
  1114. data->args.bitmask = NFS_SERVER(inode)->cache_consistency_bitmask;
  1115. data->res.fattr = &data->fattr;
  1116. data->args.lastbytewritten = end_pos - 1;
  1117. data->res.server = NFS_SERVER(inode);
  1118. status = nfs4_proc_layoutcommit(data, sync);
  1119. out:
  1120. dprintk("<-- %s status %d\n", __func__, status);
  1121. return status;
  1122. }