pnfs.c 32 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214
  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. BUG_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. bool pnfs_roc(struct inode *ino)
  545. {
  546. struct pnfs_layout_hdr *lo;
  547. struct pnfs_layout_segment *lseg, *tmp;
  548. LIST_HEAD(tmp_list);
  549. bool found = false;
  550. spin_lock(&ino->i_lock);
  551. lo = NFS_I(ino)->layout;
  552. if (!lo || !test_and_clear_bit(NFS_LAYOUT_ROC, &lo->plh_flags) ||
  553. test_bit(NFS_LAYOUT_BULK_RECALL, &lo->plh_flags))
  554. goto out_nolayout;
  555. list_for_each_entry_safe(lseg, tmp, &lo->plh_segs, pls_list)
  556. if (test_bit(NFS_LSEG_ROC, &lseg->pls_flags)) {
  557. mark_lseg_invalid(lseg, &tmp_list);
  558. found = true;
  559. }
  560. if (!found)
  561. goto out_nolayout;
  562. lo->plh_block_lgets++;
  563. get_layout_hdr(lo); /* matched in pnfs_roc_release */
  564. spin_unlock(&ino->i_lock);
  565. pnfs_free_lseg_list(&tmp_list);
  566. return true;
  567. out_nolayout:
  568. spin_unlock(&ino->i_lock);
  569. return false;
  570. }
  571. void pnfs_roc_release(struct inode *ino)
  572. {
  573. struct pnfs_layout_hdr *lo;
  574. spin_lock(&ino->i_lock);
  575. lo = NFS_I(ino)->layout;
  576. lo->plh_block_lgets--;
  577. put_layout_hdr_locked(lo);
  578. spin_unlock(&ino->i_lock);
  579. }
  580. void pnfs_roc_set_barrier(struct inode *ino, u32 barrier)
  581. {
  582. struct pnfs_layout_hdr *lo;
  583. spin_lock(&ino->i_lock);
  584. lo = NFS_I(ino)->layout;
  585. if ((int)(barrier - lo->plh_barrier) > 0)
  586. lo->plh_barrier = barrier;
  587. spin_unlock(&ino->i_lock);
  588. }
  589. bool pnfs_roc_drain(struct inode *ino, u32 *barrier)
  590. {
  591. struct nfs_inode *nfsi = NFS_I(ino);
  592. struct pnfs_layout_segment *lseg;
  593. bool found = false;
  594. spin_lock(&ino->i_lock);
  595. list_for_each_entry(lseg, &nfsi->layout->plh_segs, pls_list)
  596. if (test_bit(NFS_LSEG_ROC, &lseg->pls_flags)) {
  597. found = true;
  598. break;
  599. }
  600. if (!found) {
  601. struct pnfs_layout_hdr *lo = nfsi->layout;
  602. u32 current_seqid = be32_to_cpu(lo->plh_stateid.stateid.seqid);
  603. /* Since close does not return a layout stateid for use as
  604. * a barrier, we choose the worst-case barrier.
  605. */
  606. *barrier = current_seqid + atomic_read(&lo->plh_outstanding);
  607. }
  608. spin_unlock(&ino->i_lock);
  609. return found;
  610. }
  611. /*
  612. * Compare two layout segments for sorting into layout cache.
  613. * We want to preferentially return RW over RO layouts, so ensure those
  614. * are seen first.
  615. */
  616. static s64
  617. cmp_layout(struct pnfs_layout_range *l1,
  618. struct pnfs_layout_range *l2)
  619. {
  620. s64 d;
  621. /* high offset > low offset */
  622. d = l1->offset - l2->offset;
  623. if (d)
  624. return d;
  625. /* short length > long length */
  626. d = l2->length - l1->length;
  627. if (d)
  628. return d;
  629. /* read > read/write */
  630. return (int)(l1->iomode == IOMODE_READ) - (int)(l2->iomode == IOMODE_READ);
  631. }
  632. static void
  633. pnfs_insert_layout(struct pnfs_layout_hdr *lo,
  634. struct pnfs_layout_segment *lseg)
  635. {
  636. struct pnfs_layout_segment *lp;
  637. dprintk("%s:Begin\n", __func__);
  638. assert_spin_locked(&lo->plh_inode->i_lock);
  639. list_for_each_entry(lp, &lo->plh_segs, pls_list) {
  640. if (cmp_layout(&lseg->pls_range, &lp->pls_range) > 0)
  641. continue;
  642. list_add_tail(&lseg->pls_list, &lp->pls_list);
  643. dprintk("%s: inserted lseg %p "
  644. "iomode %d offset %llu length %llu before "
  645. "lp %p iomode %d offset %llu length %llu\n",
  646. __func__, lseg, lseg->pls_range.iomode,
  647. lseg->pls_range.offset, lseg->pls_range.length,
  648. lp, lp->pls_range.iomode, lp->pls_range.offset,
  649. lp->pls_range.length);
  650. goto out;
  651. }
  652. list_add_tail(&lseg->pls_list, &lo->plh_segs);
  653. dprintk("%s: inserted lseg %p "
  654. "iomode %d offset %llu length %llu at tail\n",
  655. __func__, lseg, lseg->pls_range.iomode,
  656. lseg->pls_range.offset, lseg->pls_range.length);
  657. out:
  658. get_layout_hdr(lo);
  659. dprintk("%s:Return\n", __func__);
  660. }
  661. static struct pnfs_layout_hdr *
  662. alloc_init_layout_hdr(struct inode *ino, gfp_t gfp_flags)
  663. {
  664. struct pnfs_layout_hdr *lo;
  665. lo = pnfs_alloc_layout_hdr(ino, gfp_flags);
  666. if (!lo)
  667. return NULL;
  668. atomic_set(&lo->plh_refcount, 1);
  669. INIT_LIST_HEAD(&lo->plh_layouts);
  670. INIT_LIST_HEAD(&lo->plh_segs);
  671. INIT_LIST_HEAD(&lo->plh_bulk_recall);
  672. lo->plh_inode = ino;
  673. return lo;
  674. }
  675. static struct pnfs_layout_hdr *
  676. pnfs_find_alloc_layout(struct inode *ino, gfp_t gfp_flags)
  677. {
  678. struct nfs_inode *nfsi = NFS_I(ino);
  679. struct pnfs_layout_hdr *new = NULL;
  680. dprintk("%s Begin ino=%p layout=%p\n", __func__, ino, nfsi->layout);
  681. assert_spin_locked(&ino->i_lock);
  682. if (nfsi->layout) {
  683. if (test_bit(NFS_LAYOUT_DESTROYED, &nfsi->layout->plh_flags))
  684. return NULL;
  685. else
  686. return nfsi->layout;
  687. }
  688. spin_unlock(&ino->i_lock);
  689. new = alloc_init_layout_hdr(ino, gfp_flags);
  690. spin_lock(&ino->i_lock);
  691. if (likely(nfsi->layout == NULL)) /* Won the race? */
  692. nfsi->layout = new;
  693. else
  694. pnfs_free_layout_hdr(new);
  695. return nfsi->layout;
  696. }
  697. /*
  698. * iomode matching rules:
  699. * iomode lseg match
  700. * ----- ----- -----
  701. * ANY READ true
  702. * ANY RW true
  703. * RW READ false
  704. * RW RW true
  705. * READ READ true
  706. * READ RW true
  707. */
  708. static int
  709. is_matching_lseg(struct pnfs_layout_range *ls_range,
  710. struct pnfs_layout_range *range)
  711. {
  712. struct pnfs_layout_range range1;
  713. if ((range->iomode == IOMODE_RW &&
  714. ls_range->iomode != IOMODE_RW) ||
  715. !lo_seg_intersecting(ls_range, range))
  716. return 0;
  717. /* range1 covers only the first byte in the range */
  718. range1 = *range;
  719. range1.length = 1;
  720. return lo_seg_contained(ls_range, &range1);
  721. }
  722. /*
  723. * lookup range in layout
  724. */
  725. static struct pnfs_layout_segment *
  726. pnfs_find_lseg(struct pnfs_layout_hdr *lo,
  727. struct pnfs_layout_range *range)
  728. {
  729. struct pnfs_layout_segment *lseg, *ret = NULL;
  730. dprintk("%s:Begin\n", __func__);
  731. assert_spin_locked(&lo->plh_inode->i_lock);
  732. list_for_each_entry(lseg, &lo->plh_segs, pls_list) {
  733. if (test_bit(NFS_LSEG_VALID, &lseg->pls_flags) &&
  734. is_matching_lseg(&lseg->pls_range, range)) {
  735. ret = get_lseg(lseg);
  736. break;
  737. }
  738. if (cmp_layout(range, &lseg->pls_range) > 0)
  739. break;
  740. }
  741. dprintk("%s:Return lseg %p ref %d\n",
  742. __func__, ret, ret ? atomic_read(&ret->pls_refcount) : 0);
  743. return ret;
  744. }
  745. /*
  746. * Layout segment is retreived from the server if not cached.
  747. * The appropriate layout segment is referenced and returned to the caller.
  748. */
  749. struct pnfs_layout_segment *
  750. pnfs_update_layout(struct inode *ino,
  751. struct nfs_open_context *ctx,
  752. loff_t pos,
  753. u64 count,
  754. enum pnfs_iomode iomode,
  755. gfp_t gfp_flags)
  756. {
  757. struct pnfs_layout_range arg = {
  758. .iomode = iomode,
  759. .offset = pos,
  760. .length = count,
  761. };
  762. unsigned pg_offset;
  763. struct nfs_inode *nfsi = NFS_I(ino);
  764. struct nfs_client *clp = NFS_SERVER(ino)->nfs_client;
  765. struct pnfs_layout_hdr *lo;
  766. struct pnfs_layout_segment *lseg = NULL;
  767. bool first = false;
  768. if (!pnfs_enabled_sb(NFS_SERVER(ino)))
  769. return NULL;
  770. spin_lock(&ino->i_lock);
  771. lo = pnfs_find_alloc_layout(ino, gfp_flags);
  772. if (lo == NULL) {
  773. dprintk("%s ERROR: can't get pnfs_layout_hdr\n", __func__);
  774. goto out_unlock;
  775. }
  776. /* Do we even need to bother with this? */
  777. if (test_bit(NFS4CLNT_LAYOUTRECALL, &clp->cl_state) ||
  778. test_bit(NFS_LAYOUT_BULK_RECALL, &lo->plh_flags)) {
  779. dprintk("%s matches recall, use MDS\n", __func__);
  780. goto out_unlock;
  781. }
  782. /* if LAYOUTGET already failed once we don't try again */
  783. if (test_bit(lo_fail_bit(iomode), &nfsi->layout->plh_flags))
  784. goto out_unlock;
  785. /* Check to see if the layout for the given range already exists */
  786. lseg = pnfs_find_lseg(lo, &arg);
  787. if (lseg)
  788. goto out_unlock;
  789. if (pnfs_layoutgets_blocked(lo, NULL, 0))
  790. goto out_unlock;
  791. atomic_inc(&lo->plh_outstanding);
  792. get_layout_hdr(lo);
  793. if (list_empty(&lo->plh_segs))
  794. first = true;
  795. spin_unlock(&ino->i_lock);
  796. if (first) {
  797. /* The lo must be on the clp list if there is any
  798. * chance of a CB_LAYOUTRECALL(FILE) coming in.
  799. */
  800. spin_lock(&clp->cl_lock);
  801. BUG_ON(!list_empty(&lo->plh_layouts));
  802. list_add_tail(&lo->plh_layouts, &clp->cl_layouts);
  803. spin_unlock(&clp->cl_lock);
  804. }
  805. pg_offset = arg.offset & ~PAGE_CACHE_MASK;
  806. if (pg_offset) {
  807. arg.offset -= pg_offset;
  808. arg.length += pg_offset;
  809. }
  810. arg.length = PAGE_CACHE_ALIGN(arg.length);
  811. lseg = send_layoutget(lo, ctx, &arg, gfp_flags);
  812. if (!lseg && first) {
  813. spin_lock(&clp->cl_lock);
  814. list_del_init(&lo->plh_layouts);
  815. spin_unlock(&clp->cl_lock);
  816. }
  817. atomic_dec(&lo->plh_outstanding);
  818. put_layout_hdr(lo);
  819. out:
  820. dprintk("%s end, state 0x%lx lseg %p\n", __func__,
  821. nfsi->layout ? nfsi->layout->plh_flags : -1, lseg);
  822. return lseg;
  823. out_unlock:
  824. spin_unlock(&ino->i_lock);
  825. goto out;
  826. }
  827. int
  828. pnfs_layout_process(struct nfs4_layoutget *lgp)
  829. {
  830. struct pnfs_layout_hdr *lo = NFS_I(lgp->args.inode)->layout;
  831. struct nfs4_layoutget_res *res = &lgp->res;
  832. struct pnfs_layout_segment *lseg;
  833. struct inode *ino = lo->plh_inode;
  834. struct nfs_client *clp = NFS_SERVER(ino)->nfs_client;
  835. int status = 0;
  836. /* Inject layout blob into I/O device driver */
  837. lseg = NFS_SERVER(ino)->pnfs_curr_ld->alloc_lseg(lo, res, lgp->gfp_flags);
  838. if (!lseg || IS_ERR(lseg)) {
  839. if (!lseg)
  840. status = -ENOMEM;
  841. else
  842. status = PTR_ERR(lseg);
  843. dprintk("%s: Could not allocate layout: error %d\n",
  844. __func__, status);
  845. goto out;
  846. }
  847. spin_lock(&ino->i_lock);
  848. if (test_bit(NFS4CLNT_LAYOUTRECALL, &clp->cl_state) ||
  849. test_bit(NFS_LAYOUT_BULK_RECALL, &lo->plh_flags)) {
  850. dprintk("%s forget reply due to recall\n", __func__);
  851. goto out_forget_reply;
  852. }
  853. if (pnfs_layoutgets_blocked(lo, &res->stateid, 1)) {
  854. dprintk("%s forget reply due to state\n", __func__);
  855. goto out_forget_reply;
  856. }
  857. init_lseg(lo, lseg);
  858. lseg->pls_range = res->range;
  859. *lgp->lsegpp = get_lseg(lseg);
  860. pnfs_insert_layout(lo, lseg);
  861. if (res->return_on_close) {
  862. set_bit(NFS_LSEG_ROC, &lseg->pls_flags);
  863. set_bit(NFS_LAYOUT_ROC, &lo->plh_flags);
  864. }
  865. /* Done processing layoutget. Set the layout stateid */
  866. pnfs_set_layout_stateid(lo, &res->stateid, false);
  867. spin_unlock(&ino->i_lock);
  868. out:
  869. return status;
  870. out_forget_reply:
  871. spin_unlock(&ino->i_lock);
  872. lseg->pls_layout = lo;
  873. NFS_SERVER(ino)->pnfs_curr_ld->free_lseg(lseg);
  874. goto out;
  875. }
  876. static int pnfs_read_pg_test(struct nfs_pageio_descriptor *pgio,
  877. struct nfs_page *prev,
  878. struct nfs_page *req)
  879. {
  880. if (pgio->pg_count == prev->wb_bytes) {
  881. /* This is first coelesce call for a series of nfs_pages */
  882. pgio->pg_lseg = pnfs_update_layout(pgio->pg_inode,
  883. prev->wb_context,
  884. req_offset(req),
  885. pgio->pg_count,
  886. IOMODE_READ,
  887. GFP_KERNEL);
  888. } else if (pgio->pg_lseg &&
  889. req_offset(req) > end_offset(pgio->pg_lseg->pls_range.offset,
  890. pgio->pg_lseg->pls_range.length))
  891. return 0;
  892. return NFS_SERVER(pgio->pg_inode)->pnfs_curr_ld->pg_test(pgio, prev, req);
  893. }
  894. void
  895. pnfs_pageio_init_read(struct nfs_pageio_descriptor *pgio, struct inode *inode)
  896. {
  897. struct pnfs_layoutdriver_type *ld;
  898. ld = NFS_SERVER(inode)->pnfs_curr_ld;
  899. pgio->pg_test = (ld && ld->pg_test) ? pnfs_read_pg_test : NULL;
  900. }
  901. static int pnfs_write_pg_test(struct nfs_pageio_descriptor *pgio,
  902. struct nfs_page *prev,
  903. struct nfs_page *req)
  904. {
  905. if (pgio->pg_count == prev->wb_bytes) {
  906. /* This is first coelesce call for a series of nfs_pages */
  907. pgio->pg_lseg = pnfs_update_layout(pgio->pg_inode,
  908. prev->wb_context,
  909. req_offset(req),
  910. pgio->pg_count,
  911. IOMODE_RW,
  912. GFP_NOFS);
  913. } else if (pgio->pg_lseg &&
  914. req_offset(req) > end_offset(pgio->pg_lseg->pls_range.offset,
  915. pgio->pg_lseg->pls_range.length))
  916. return 0;
  917. return NFS_SERVER(pgio->pg_inode)->pnfs_curr_ld->pg_test(pgio, prev, req);
  918. }
  919. void
  920. pnfs_pageio_init_write(struct nfs_pageio_descriptor *pgio, struct inode *inode)
  921. {
  922. struct pnfs_layoutdriver_type *ld;
  923. ld = NFS_SERVER(inode)->pnfs_curr_ld;
  924. pgio->pg_test = (ld && ld->pg_test) ? pnfs_write_pg_test : NULL;
  925. }
  926. enum pnfs_try_status
  927. pnfs_try_to_write_data(struct nfs_write_data *wdata,
  928. const struct rpc_call_ops *call_ops, int how)
  929. {
  930. struct inode *inode = wdata->inode;
  931. enum pnfs_try_status trypnfs;
  932. struct nfs_server *nfss = NFS_SERVER(inode);
  933. wdata->mds_ops = call_ops;
  934. dprintk("%s: Writing ino:%lu %u@%llu (how %d)\n", __func__,
  935. inode->i_ino, wdata->args.count, wdata->args.offset, how);
  936. trypnfs = nfss->pnfs_curr_ld->write_pagelist(wdata, how);
  937. if (trypnfs == PNFS_NOT_ATTEMPTED) {
  938. put_lseg(wdata->lseg);
  939. wdata->lseg = NULL;
  940. } else
  941. nfs_inc_stats(inode, NFSIOS_PNFS_WRITE);
  942. dprintk("%s End (trypnfs:%d)\n", __func__, trypnfs);
  943. return trypnfs;
  944. }
  945. /*
  946. * Call the appropriate parallel I/O subsystem read function.
  947. */
  948. enum pnfs_try_status
  949. pnfs_try_to_read_data(struct nfs_read_data *rdata,
  950. const struct rpc_call_ops *call_ops)
  951. {
  952. struct inode *inode = rdata->inode;
  953. struct nfs_server *nfss = NFS_SERVER(inode);
  954. enum pnfs_try_status trypnfs;
  955. rdata->mds_ops = call_ops;
  956. dprintk("%s: Reading ino:%lu %u@%llu\n",
  957. __func__, inode->i_ino, rdata->args.count, rdata->args.offset);
  958. trypnfs = nfss->pnfs_curr_ld->read_pagelist(rdata);
  959. if (trypnfs == PNFS_NOT_ATTEMPTED) {
  960. put_lseg(rdata->lseg);
  961. rdata->lseg = NULL;
  962. } else {
  963. nfs_inc_stats(inode, NFSIOS_PNFS_READ);
  964. }
  965. dprintk("%s End (trypnfs:%d)\n", __func__, trypnfs);
  966. return trypnfs;
  967. }
  968. /*
  969. * Currently there is only one (whole file) write lseg.
  970. */
  971. static struct pnfs_layout_segment *pnfs_list_write_lseg(struct inode *inode)
  972. {
  973. struct pnfs_layout_segment *lseg, *rv = NULL;
  974. list_for_each_entry(lseg, &NFS_I(inode)->layout->plh_segs, pls_list)
  975. if (lseg->pls_range.iomode == IOMODE_RW)
  976. rv = lseg;
  977. return rv;
  978. }
  979. void
  980. pnfs_set_layoutcommit(struct nfs_write_data *wdata)
  981. {
  982. struct nfs_inode *nfsi = NFS_I(wdata->inode);
  983. loff_t end_pos = wdata->args.offset + wdata->res.count;
  984. bool mark_as_dirty = false;
  985. spin_lock(&nfsi->vfs_inode.i_lock);
  986. if (!test_and_set_bit(NFS_INO_LAYOUTCOMMIT, &nfsi->flags)) {
  987. /* references matched in nfs4_layoutcommit_release */
  988. get_lseg(wdata->lseg);
  989. wdata->lseg->pls_lc_cred =
  990. get_rpccred(wdata->args.context->state->owner->so_cred);
  991. mark_as_dirty = true;
  992. dprintk("%s: Set layoutcommit for inode %lu ",
  993. __func__, wdata->inode->i_ino);
  994. }
  995. if (end_pos > wdata->lseg->pls_end_pos)
  996. wdata->lseg->pls_end_pos = end_pos;
  997. spin_unlock(&nfsi->vfs_inode.i_lock);
  998. /* if pnfs_layoutcommit_inode() runs between inode locks, the next one
  999. * will be a noop because NFS_INO_LAYOUTCOMMIT will not be set */
  1000. if (mark_as_dirty)
  1001. mark_inode_dirty_sync(wdata->inode);
  1002. }
  1003. EXPORT_SYMBOL_GPL(pnfs_set_layoutcommit);
  1004. /*
  1005. * For the LAYOUT4_NFSV4_1_FILES layout type, NFS_DATA_SYNC WRITEs and
  1006. * NFS_UNSTABLE WRITEs with a COMMIT to data servers must store enough
  1007. * data to disk to allow the server to recover the data if it crashes.
  1008. * LAYOUTCOMMIT is only needed when the NFL4_UFLG_COMMIT_THRU_MDS flag
  1009. * is off, and a COMMIT is sent to a data server, or
  1010. * if WRITEs to a data server return NFS_DATA_SYNC.
  1011. */
  1012. int
  1013. pnfs_layoutcommit_inode(struct inode *inode, bool sync)
  1014. {
  1015. struct nfs4_layoutcommit_data *data;
  1016. struct nfs_inode *nfsi = NFS_I(inode);
  1017. struct pnfs_layout_segment *lseg;
  1018. struct rpc_cred *cred;
  1019. loff_t end_pos;
  1020. int status = 0;
  1021. dprintk("--> %s inode %lu\n", __func__, inode->i_ino);
  1022. if (!test_bit(NFS_INO_LAYOUTCOMMIT, &nfsi->flags))
  1023. return 0;
  1024. /* Note kzalloc ensures data->res.seq_res.sr_slot == NULL */
  1025. data = kzalloc(sizeof(*data), GFP_NOFS);
  1026. if (!data) {
  1027. mark_inode_dirty_sync(inode);
  1028. status = -ENOMEM;
  1029. goto out;
  1030. }
  1031. spin_lock(&inode->i_lock);
  1032. if (!test_and_clear_bit(NFS_INO_LAYOUTCOMMIT, &nfsi->flags)) {
  1033. spin_unlock(&inode->i_lock);
  1034. kfree(data);
  1035. goto out;
  1036. }
  1037. /*
  1038. * Currently only one (whole file) write lseg which is referenced
  1039. * in pnfs_set_layoutcommit and will be found.
  1040. */
  1041. lseg = pnfs_list_write_lseg(inode);
  1042. end_pos = lseg->pls_end_pos;
  1043. cred = lseg->pls_lc_cred;
  1044. lseg->pls_end_pos = 0;
  1045. lseg->pls_lc_cred = NULL;
  1046. memcpy(&data->args.stateid.data, nfsi->layout->plh_stateid.data,
  1047. sizeof(nfsi->layout->plh_stateid.data));
  1048. spin_unlock(&inode->i_lock);
  1049. data->args.inode = inode;
  1050. data->lseg = lseg;
  1051. data->cred = cred;
  1052. nfs_fattr_init(&data->fattr);
  1053. data->args.bitmask = NFS_SERVER(inode)->cache_consistency_bitmask;
  1054. data->res.fattr = &data->fattr;
  1055. data->args.lastbytewritten = end_pos - 1;
  1056. data->res.server = NFS_SERVER(inode);
  1057. status = nfs4_proc_layoutcommit(data, sync);
  1058. out:
  1059. dprintk("<-- %s status %d\n", __func__, status);
  1060. return status;
  1061. }