pnfs.c 31 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196
  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 void
  160. destroy_layout_hdr(struct pnfs_layout_hdr *lo)
  161. {
  162. dprintk("%s: freeing layout cache %p\n", __func__, lo);
  163. BUG_ON(!list_empty(&lo->plh_layouts));
  164. NFS_I(lo->plh_inode)->layout = NULL;
  165. kfree(lo);
  166. }
  167. static void
  168. put_layout_hdr_locked(struct pnfs_layout_hdr *lo)
  169. {
  170. if (atomic_dec_and_test(&lo->plh_refcount))
  171. destroy_layout_hdr(lo);
  172. }
  173. void
  174. put_layout_hdr(struct pnfs_layout_hdr *lo)
  175. {
  176. struct inode *inode = lo->plh_inode;
  177. if (atomic_dec_and_lock(&lo->plh_refcount, &inode->i_lock)) {
  178. destroy_layout_hdr(lo);
  179. spin_unlock(&inode->i_lock);
  180. }
  181. }
  182. static void
  183. init_lseg(struct pnfs_layout_hdr *lo, struct pnfs_layout_segment *lseg)
  184. {
  185. INIT_LIST_HEAD(&lseg->pls_list);
  186. atomic_set(&lseg->pls_refcount, 1);
  187. smp_mb();
  188. set_bit(NFS_LSEG_VALID, &lseg->pls_flags);
  189. lseg->pls_layout = lo;
  190. }
  191. static void free_lseg(struct pnfs_layout_segment *lseg)
  192. {
  193. struct inode *ino = lseg->pls_layout->plh_inode;
  194. NFS_SERVER(ino)->pnfs_curr_ld->free_lseg(lseg);
  195. /* Matched by get_layout_hdr in pnfs_insert_layout */
  196. put_layout_hdr(NFS_I(ino)->layout);
  197. }
  198. static void
  199. put_lseg_common(struct pnfs_layout_segment *lseg)
  200. {
  201. struct inode *inode = lseg->pls_layout->plh_inode;
  202. BUG_ON(test_bit(NFS_LSEG_VALID, &lseg->pls_flags));
  203. list_del_init(&lseg->pls_list);
  204. if (list_empty(&lseg->pls_layout->plh_segs)) {
  205. set_bit(NFS_LAYOUT_DESTROYED, &lseg->pls_layout->plh_flags);
  206. /* Matched by initial refcount set in alloc_init_layout_hdr */
  207. put_layout_hdr_locked(lseg->pls_layout);
  208. }
  209. rpc_wake_up(&NFS_SERVER(inode)->roc_rpcwaitq);
  210. }
  211. void
  212. put_lseg(struct pnfs_layout_segment *lseg)
  213. {
  214. struct inode *inode;
  215. if (!lseg)
  216. return;
  217. dprintk("%s: lseg %p ref %d valid %d\n", __func__, lseg,
  218. atomic_read(&lseg->pls_refcount),
  219. test_bit(NFS_LSEG_VALID, &lseg->pls_flags));
  220. inode = lseg->pls_layout->plh_inode;
  221. if (atomic_dec_and_lock(&lseg->pls_refcount, &inode->i_lock)) {
  222. LIST_HEAD(free_me);
  223. put_lseg_common(lseg);
  224. list_add(&lseg->pls_list, &free_me);
  225. spin_unlock(&inode->i_lock);
  226. pnfs_free_lseg_list(&free_me);
  227. }
  228. }
  229. EXPORT_SYMBOL_GPL(put_lseg);
  230. static inline u64
  231. end_offset(u64 start, u64 len)
  232. {
  233. u64 end;
  234. end = start + len;
  235. return end >= start ? end : NFS4_MAX_UINT64;
  236. }
  237. /* last octet in a range */
  238. static inline u64
  239. last_byte_offset(u64 start, u64 len)
  240. {
  241. u64 end;
  242. BUG_ON(!len);
  243. end = start + len;
  244. return end > start ? end - 1 : NFS4_MAX_UINT64;
  245. }
  246. /*
  247. * is l2 fully contained in l1?
  248. * start1 end1
  249. * [----------------------------------)
  250. * start2 end2
  251. * [----------------)
  252. */
  253. static inline int
  254. lo_seg_contained(struct pnfs_layout_range *l1,
  255. struct pnfs_layout_range *l2)
  256. {
  257. u64 start1 = l1->offset;
  258. u64 end1 = end_offset(start1, l1->length);
  259. u64 start2 = l2->offset;
  260. u64 end2 = end_offset(start2, l2->length);
  261. return (start1 <= start2) && (end1 >= end2);
  262. }
  263. /*
  264. * is l1 and l2 intersecting?
  265. * start1 end1
  266. * [----------------------------------)
  267. * start2 end2
  268. * [----------------)
  269. */
  270. static inline int
  271. lo_seg_intersecting(struct pnfs_layout_range *l1,
  272. struct pnfs_layout_range *l2)
  273. {
  274. u64 start1 = l1->offset;
  275. u64 end1 = end_offset(start1, l1->length);
  276. u64 start2 = l2->offset;
  277. u64 end2 = end_offset(start2, l2->length);
  278. return (end1 == NFS4_MAX_UINT64 || end1 > start2) &&
  279. (end2 == NFS4_MAX_UINT64 || end2 > start1);
  280. }
  281. static bool
  282. should_free_lseg(u32 lseg_iomode, u32 recall_iomode)
  283. {
  284. return (recall_iomode == IOMODE_ANY ||
  285. lseg_iomode == recall_iomode);
  286. }
  287. /* Returns 1 if lseg is removed from list, 0 otherwise */
  288. static int mark_lseg_invalid(struct pnfs_layout_segment *lseg,
  289. struct list_head *tmp_list)
  290. {
  291. int rv = 0;
  292. if (test_and_clear_bit(NFS_LSEG_VALID, &lseg->pls_flags)) {
  293. /* Remove the reference keeping the lseg in the
  294. * list. It will now be removed when all
  295. * outstanding io is finished.
  296. */
  297. dprintk("%s: lseg %p ref %d\n", __func__, lseg,
  298. atomic_read(&lseg->pls_refcount));
  299. if (atomic_dec_and_test(&lseg->pls_refcount)) {
  300. put_lseg_common(lseg);
  301. list_add(&lseg->pls_list, tmp_list);
  302. rv = 1;
  303. }
  304. }
  305. return rv;
  306. }
  307. /* Returns count of number of matching invalid lsegs remaining in list
  308. * after call.
  309. */
  310. int
  311. mark_matching_lsegs_invalid(struct pnfs_layout_hdr *lo,
  312. struct list_head *tmp_list,
  313. u32 iomode)
  314. {
  315. struct pnfs_layout_segment *lseg, *next;
  316. int invalid = 0, removed = 0;
  317. dprintk("%s:Begin lo %p\n", __func__, lo);
  318. if (list_empty(&lo->plh_segs)) {
  319. if (!test_and_set_bit(NFS_LAYOUT_DESTROYED, &lo->plh_flags))
  320. put_layout_hdr_locked(lo);
  321. return 0;
  322. }
  323. list_for_each_entry_safe(lseg, next, &lo->plh_segs, pls_list)
  324. if (should_free_lseg(lseg->pls_range.iomode, iomode)) {
  325. dprintk("%s: freeing lseg %p iomode %d "
  326. "offset %llu length %llu\n", __func__,
  327. lseg, lseg->pls_range.iomode, lseg->pls_range.offset,
  328. lseg->pls_range.length);
  329. invalid++;
  330. removed += mark_lseg_invalid(lseg, tmp_list);
  331. }
  332. dprintk("%s:Return %i\n", __func__, invalid - removed);
  333. return invalid - removed;
  334. }
  335. /* note free_me must contain lsegs from a single layout_hdr */
  336. void
  337. pnfs_free_lseg_list(struct list_head *free_me)
  338. {
  339. struct pnfs_layout_segment *lseg, *tmp;
  340. struct pnfs_layout_hdr *lo;
  341. if (list_empty(free_me))
  342. return;
  343. lo = list_first_entry(free_me, struct pnfs_layout_segment,
  344. pls_list)->pls_layout;
  345. if (test_bit(NFS_LAYOUT_DESTROYED, &lo->plh_flags)) {
  346. struct nfs_client *clp;
  347. clp = NFS_SERVER(lo->plh_inode)->nfs_client;
  348. spin_lock(&clp->cl_lock);
  349. list_del_init(&lo->plh_layouts);
  350. spin_unlock(&clp->cl_lock);
  351. }
  352. list_for_each_entry_safe(lseg, tmp, free_me, pls_list) {
  353. list_del(&lseg->pls_list);
  354. free_lseg(lseg);
  355. }
  356. }
  357. void
  358. pnfs_destroy_layout(struct nfs_inode *nfsi)
  359. {
  360. struct pnfs_layout_hdr *lo;
  361. LIST_HEAD(tmp_list);
  362. spin_lock(&nfsi->vfs_inode.i_lock);
  363. lo = nfsi->layout;
  364. if (lo) {
  365. lo->plh_block_lgets++; /* permanently block new LAYOUTGETs */
  366. mark_matching_lsegs_invalid(lo, &tmp_list, IOMODE_ANY);
  367. }
  368. spin_unlock(&nfsi->vfs_inode.i_lock);
  369. pnfs_free_lseg_list(&tmp_list);
  370. }
  371. /*
  372. * Called by the state manger to remove all layouts established under an
  373. * expired lease.
  374. */
  375. void
  376. pnfs_destroy_all_layouts(struct nfs_client *clp)
  377. {
  378. struct pnfs_layout_hdr *lo;
  379. LIST_HEAD(tmp_list);
  380. spin_lock(&clp->cl_lock);
  381. list_splice_init(&clp->cl_layouts, &tmp_list);
  382. spin_unlock(&clp->cl_lock);
  383. while (!list_empty(&tmp_list)) {
  384. lo = list_entry(tmp_list.next, struct pnfs_layout_hdr,
  385. plh_layouts);
  386. dprintk("%s freeing layout for inode %lu\n", __func__,
  387. lo->plh_inode->i_ino);
  388. list_del_init(&lo->plh_layouts);
  389. pnfs_destroy_layout(NFS_I(lo->plh_inode));
  390. }
  391. }
  392. /* update lo->plh_stateid with new if is more recent */
  393. void
  394. pnfs_set_layout_stateid(struct pnfs_layout_hdr *lo, const nfs4_stateid *new,
  395. bool update_barrier)
  396. {
  397. u32 oldseq, newseq;
  398. oldseq = be32_to_cpu(lo->plh_stateid.stateid.seqid);
  399. newseq = be32_to_cpu(new->stateid.seqid);
  400. if ((int)(newseq - oldseq) > 0) {
  401. memcpy(&lo->plh_stateid, &new->stateid, sizeof(new->stateid));
  402. if (update_barrier) {
  403. u32 new_barrier = be32_to_cpu(new->stateid.seqid);
  404. if ((int)(new_barrier - lo->plh_barrier))
  405. lo->plh_barrier = new_barrier;
  406. } else {
  407. /* Because of wraparound, we want to keep the barrier
  408. * "close" to the current seqids. It needs to be
  409. * within 2**31 to count as "behind", so if it
  410. * gets too near that limit, give us a litle leeway
  411. * and bring it to within 2**30.
  412. * NOTE - and yes, this is all unsigned arithmetic.
  413. */
  414. if (unlikely((newseq - lo->plh_barrier) > (3 << 29)))
  415. lo->plh_barrier = newseq - (1 << 30);
  416. }
  417. }
  418. }
  419. /* lget is set to 1 if called from inside send_layoutget call chain */
  420. static bool
  421. pnfs_layoutgets_blocked(struct pnfs_layout_hdr *lo, nfs4_stateid *stateid,
  422. int lget)
  423. {
  424. if ((stateid) &&
  425. (int)(lo->plh_barrier - be32_to_cpu(stateid->stateid.seqid)) >= 0)
  426. return true;
  427. return lo->plh_block_lgets ||
  428. test_bit(NFS_LAYOUT_DESTROYED, &lo->plh_flags) ||
  429. test_bit(NFS_LAYOUT_BULK_RECALL, &lo->plh_flags) ||
  430. (list_empty(&lo->plh_segs) &&
  431. (atomic_read(&lo->plh_outstanding) > lget));
  432. }
  433. int
  434. pnfs_choose_layoutget_stateid(nfs4_stateid *dst, struct pnfs_layout_hdr *lo,
  435. struct nfs4_state *open_state)
  436. {
  437. int status = 0;
  438. dprintk("--> %s\n", __func__);
  439. spin_lock(&lo->plh_inode->i_lock);
  440. if (pnfs_layoutgets_blocked(lo, NULL, 1)) {
  441. status = -EAGAIN;
  442. } else if (list_empty(&lo->plh_segs)) {
  443. int seq;
  444. do {
  445. seq = read_seqbegin(&open_state->seqlock);
  446. memcpy(dst->data, open_state->stateid.data,
  447. sizeof(open_state->stateid.data));
  448. } while (read_seqretry(&open_state->seqlock, seq));
  449. } else
  450. memcpy(dst->data, lo->plh_stateid.data, sizeof(lo->plh_stateid.data));
  451. spin_unlock(&lo->plh_inode->i_lock);
  452. dprintk("<-- %s\n", __func__);
  453. return status;
  454. }
  455. /*
  456. * Get layout from server.
  457. * for now, assume that whole file layouts are requested.
  458. * arg->offset: 0
  459. * arg->length: all ones
  460. */
  461. static struct pnfs_layout_segment *
  462. send_layoutget(struct pnfs_layout_hdr *lo,
  463. struct nfs_open_context *ctx,
  464. struct pnfs_layout_range *range,
  465. gfp_t gfp_flags)
  466. {
  467. struct inode *ino = lo->plh_inode;
  468. struct nfs_server *server = NFS_SERVER(ino);
  469. struct nfs4_layoutget *lgp;
  470. struct pnfs_layout_segment *lseg = NULL;
  471. struct page **pages = NULL;
  472. int i;
  473. u32 max_resp_sz, max_pages;
  474. dprintk("--> %s\n", __func__);
  475. BUG_ON(ctx == NULL);
  476. lgp = kzalloc(sizeof(*lgp), gfp_flags);
  477. if (lgp == NULL)
  478. return NULL;
  479. /* allocate pages for xdr post processing */
  480. max_resp_sz = server->nfs_client->cl_session->fc_attrs.max_resp_sz;
  481. max_pages = max_resp_sz >> PAGE_SHIFT;
  482. pages = kzalloc(max_pages * sizeof(struct page *), gfp_flags);
  483. if (!pages)
  484. goto out_err_free;
  485. for (i = 0; i < max_pages; i++) {
  486. pages[i] = alloc_page(gfp_flags);
  487. if (!pages[i])
  488. goto out_err_free;
  489. }
  490. lgp->args.minlength = PAGE_CACHE_SIZE;
  491. if (lgp->args.minlength > range->length)
  492. lgp->args.minlength = range->length;
  493. lgp->args.maxcount = PNFS_LAYOUT_MAXSIZE;
  494. lgp->args.range = *range;
  495. lgp->args.type = server->pnfs_curr_ld->id;
  496. lgp->args.inode = ino;
  497. lgp->args.ctx = get_nfs_open_context(ctx);
  498. lgp->args.layout.pages = pages;
  499. lgp->args.layout.pglen = max_pages * PAGE_SIZE;
  500. lgp->lsegpp = &lseg;
  501. lgp->gfp_flags = gfp_flags;
  502. /* Synchronously retrieve layout information from server and
  503. * store in lseg.
  504. */
  505. nfs4_proc_layoutget(lgp);
  506. if (!lseg) {
  507. /* remember that LAYOUTGET failed and suspend trying */
  508. set_bit(lo_fail_bit(range->iomode), &lo->plh_flags);
  509. }
  510. /* free xdr pages */
  511. for (i = 0; i < max_pages; i++)
  512. __free_page(pages[i]);
  513. kfree(pages);
  514. return lseg;
  515. out_err_free:
  516. /* free any allocated xdr pages, lgp as it's not used */
  517. if (pages) {
  518. for (i = 0; i < max_pages; i++) {
  519. if (!pages[i])
  520. break;
  521. __free_page(pages[i]);
  522. }
  523. kfree(pages);
  524. }
  525. kfree(lgp);
  526. return NULL;
  527. }
  528. bool pnfs_roc(struct inode *ino)
  529. {
  530. struct pnfs_layout_hdr *lo;
  531. struct pnfs_layout_segment *lseg, *tmp;
  532. LIST_HEAD(tmp_list);
  533. bool found = false;
  534. spin_lock(&ino->i_lock);
  535. lo = NFS_I(ino)->layout;
  536. if (!lo || !test_and_clear_bit(NFS_LAYOUT_ROC, &lo->plh_flags) ||
  537. test_bit(NFS_LAYOUT_BULK_RECALL, &lo->plh_flags))
  538. goto out_nolayout;
  539. list_for_each_entry_safe(lseg, tmp, &lo->plh_segs, pls_list)
  540. if (test_bit(NFS_LSEG_ROC, &lseg->pls_flags)) {
  541. mark_lseg_invalid(lseg, &tmp_list);
  542. found = true;
  543. }
  544. if (!found)
  545. goto out_nolayout;
  546. lo->plh_block_lgets++;
  547. get_layout_hdr(lo); /* matched in pnfs_roc_release */
  548. spin_unlock(&ino->i_lock);
  549. pnfs_free_lseg_list(&tmp_list);
  550. return true;
  551. out_nolayout:
  552. spin_unlock(&ino->i_lock);
  553. return false;
  554. }
  555. void pnfs_roc_release(struct inode *ino)
  556. {
  557. struct pnfs_layout_hdr *lo;
  558. spin_lock(&ino->i_lock);
  559. lo = NFS_I(ino)->layout;
  560. lo->plh_block_lgets--;
  561. put_layout_hdr_locked(lo);
  562. spin_unlock(&ino->i_lock);
  563. }
  564. void pnfs_roc_set_barrier(struct inode *ino, u32 barrier)
  565. {
  566. struct pnfs_layout_hdr *lo;
  567. spin_lock(&ino->i_lock);
  568. lo = NFS_I(ino)->layout;
  569. if ((int)(barrier - lo->plh_barrier) > 0)
  570. lo->plh_barrier = barrier;
  571. spin_unlock(&ino->i_lock);
  572. }
  573. bool pnfs_roc_drain(struct inode *ino, u32 *barrier)
  574. {
  575. struct nfs_inode *nfsi = NFS_I(ino);
  576. struct pnfs_layout_segment *lseg;
  577. bool found = false;
  578. spin_lock(&ino->i_lock);
  579. list_for_each_entry(lseg, &nfsi->layout->plh_segs, pls_list)
  580. if (test_bit(NFS_LSEG_ROC, &lseg->pls_flags)) {
  581. found = true;
  582. break;
  583. }
  584. if (!found) {
  585. struct pnfs_layout_hdr *lo = nfsi->layout;
  586. u32 current_seqid = be32_to_cpu(lo->plh_stateid.stateid.seqid);
  587. /* Since close does not return a layout stateid for use as
  588. * a barrier, we choose the worst-case barrier.
  589. */
  590. *barrier = current_seqid + atomic_read(&lo->plh_outstanding);
  591. }
  592. spin_unlock(&ino->i_lock);
  593. return found;
  594. }
  595. /*
  596. * Compare two layout segments for sorting into layout cache.
  597. * We want to preferentially return RW over RO layouts, so ensure those
  598. * are seen first.
  599. */
  600. static s64
  601. cmp_layout(struct pnfs_layout_range *l1,
  602. struct pnfs_layout_range *l2)
  603. {
  604. s64 d;
  605. /* high offset > low offset */
  606. d = l1->offset - l2->offset;
  607. if (d)
  608. return d;
  609. /* short length > long length */
  610. d = l2->length - l1->length;
  611. if (d)
  612. return d;
  613. /* read > read/write */
  614. return (int)(l1->iomode == IOMODE_READ) - (int)(l2->iomode == IOMODE_READ);
  615. }
  616. static void
  617. pnfs_insert_layout(struct pnfs_layout_hdr *lo,
  618. struct pnfs_layout_segment *lseg)
  619. {
  620. struct pnfs_layout_segment *lp;
  621. dprintk("%s:Begin\n", __func__);
  622. assert_spin_locked(&lo->plh_inode->i_lock);
  623. list_for_each_entry(lp, &lo->plh_segs, pls_list) {
  624. if (cmp_layout(&lseg->pls_range, &lp->pls_range) > 0)
  625. continue;
  626. list_add_tail(&lseg->pls_list, &lp->pls_list);
  627. dprintk("%s: inserted lseg %p "
  628. "iomode %d offset %llu length %llu before "
  629. "lp %p iomode %d offset %llu length %llu\n",
  630. __func__, lseg, lseg->pls_range.iomode,
  631. lseg->pls_range.offset, lseg->pls_range.length,
  632. lp, lp->pls_range.iomode, lp->pls_range.offset,
  633. lp->pls_range.length);
  634. goto out;
  635. }
  636. list_add_tail(&lseg->pls_list, &lo->plh_segs);
  637. dprintk("%s: inserted lseg %p "
  638. "iomode %d offset %llu length %llu at tail\n",
  639. __func__, lseg, lseg->pls_range.iomode,
  640. lseg->pls_range.offset, lseg->pls_range.length);
  641. out:
  642. get_layout_hdr(lo);
  643. dprintk("%s:Return\n", __func__);
  644. }
  645. static struct pnfs_layout_hdr *
  646. alloc_init_layout_hdr(struct inode *ino, gfp_t gfp_flags)
  647. {
  648. struct pnfs_layout_hdr *lo;
  649. lo = kzalloc(sizeof(struct pnfs_layout_hdr), gfp_flags);
  650. if (!lo)
  651. return NULL;
  652. atomic_set(&lo->plh_refcount, 1);
  653. INIT_LIST_HEAD(&lo->plh_layouts);
  654. INIT_LIST_HEAD(&lo->plh_segs);
  655. INIT_LIST_HEAD(&lo->plh_bulk_recall);
  656. lo->plh_inode = ino;
  657. return lo;
  658. }
  659. static struct pnfs_layout_hdr *
  660. pnfs_find_alloc_layout(struct inode *ino, gfp_t gfp_flags)
  661. {
  662. struct nfs_inode *nfsi = NFS_I(ino);
  663. struct pnfs_layout_hdr *new = NULL;
  664. dprintk("%s Begin ino=%p layout=%p\n", __func__, ino, nfsi->layout);
  665. assert_spin_locked(&ino->i_lock);
  666. if (nfsi->layout) {
  667. if (test_bit(NFS_LAYOUT_DESTROYED, &nfsi->layout->plh_flags))
  668. return NULL;
  669. else
  670. return nfsi->layout;
  671. }
  672. spin_unlock(&ino->i_lock);
  673. new = alloc_init_layout_hdr(ino, gfp_flags);
  674. spin_lock(&ino->i_lock);
  675. if (likely(nfsi->layout == NULL)) /* Won the race? */
  676. nfsi->layout = new;
  677. else
  678. kfree(new);
  679. return nfsi->layout;
  680. }
  681. /*
  682. * iomode matching rules:
  683. * iomode lseg match
  684. * ----- ----- -----
  685. * ANY READ true
  686. * ANY RW true
  687. * RW READ false
  688. * RW RW true
  689. * READ READ true
  690. * READ RW true
  691. */
  692. static int
  693. is_matching_lseg(struct pnfs_layout_range *ls_range,
  694. struct pnfs_layout_range *range)
  695. {
  696. struct pnfs_layout_range range1;
  697. if ((range->iomode == IOMODE_RW &&
  698. ls_range->iomode != IOMODE_RW) ||
  699. !lo_seg_intersecting(ls_range, range))
  700. return 0;
  701. /* range1 covers only the first byte in the range */
  702. range1 = *range;
  703. range1.length = 1;
  704. return lo_seg_contained(ls_range, &range1);
  705. }
  706. /*
  707. * lookup range in layout
  708. */
  709. static struct pnfs_layout_segment *
  710. pnfs_find_lseg(struct pnfs_layout_hdr *lo,
  711. struct pnfs_layout_range *range)
  712. {
  713. struct pnfs_layout_segment *lseg, *ret = NULL;
  714. dprintk("%s:Begin\n", __func__);
  715. assert_spin_locked(&lo->plh_inode->i_lock);
  716. list_for_each_entry(lseg, &lo->plh_segs, pls_list) {
  717. if (test_bit(NFS_LSEG_VALID, &lseg->pls_flags) &&
  718. is_matching_lseg(&lseg->pls_range, range)) {
  719. ret = get_lseg(lseg);
  720. break;
  721. }
  722. if (cmp_layout(range, &lseg->pls_range) > 0)
  723. break;
  724. }
  725. dprintk("%s:Return lseg %p ref %d\n",
  726. __func__, ret, ret ? atomic_read(&ret->pls_refcount) : 0);
  727. return ret;
  728. }
  729. /*
  730. * Layout segment is retreived from the server if not cached.
  731. * The appropriate layout segment is referenced and returned to the caller.
  732. */
  733. struct pnfs_layout_segment *
  734. pnfs_update_layout(struct inode *ino,
  735. struct nfs_open_context *ctx,
  736. loff_t pos,
  737. u64 count,
  738. enum pnfs_iomode iomode,
  739. gfp_t gfp_flags)
  740. {
  741. struct pnfs_layout_range arg = {
  742. .iomode = iomode,
  743. .offset = pos,
  744. .length = count,
  745. };
  746. unsigned pg_offset;
  747. struct nfs_inode *nfsi = NFS_I(ino);
  748. struct nfs_client *clp = NFS_SERVER(ino)->nfs_client;
  749. struct pnfs_layout_hdr *lo;
  750. struct pnfs_layout_segment *lseg = NULL;
  751. bool first = false;
  752. if (!pnfs_enabled_sb(NFS_SERVER(ino)))
  753. return NULL;
  754. spin_lock(&ino->i_lock);
  755. lo = pnfs_find_alloc_layout(ino, gfp_flags);
  756. if (lo == NULL) {
  757. dprintk("%s ERROR: can't get pnfs_layout_hdr\n", __func__);
  758. goto out_unlock;
  759. }
  760. /* Do we even need to bother with this? */
  761. if (test_bit(NFS4CLNT_LAYOUTRECALL, &clp->cl_state) ||
  762. test_bit(NFS_LAYOUT_BULK_RECALL, &lo->plh_flags)) {
  763. dprintk("%s matches recall, use MDS\n", __func__);
  764. goto out_unlock;
  765. }
  766. /* if LAYOUTGET already failed once we don't try again */
  767. if (test_bit(lo_fail_bit(iomode), &nfsi->layout->plh_flags))
  768. goto out_unlock;
  769. /* Check to see if the layout for the given range already exists */
  770. lseg = pnfs_find_lseg(lo, &arg);
  771. if (lseg)
  772. goto out_unlock;
  773. if (pnfs_layoutgets_blocked(lo, NULL, 0))
  774. goto out_unlock;
  775. atomic_inc(&lo->plh_outstanding);
  776. get_layout_hdr(lo);
  777. if (list_empty(&lo->plh_segs))
  778. first = true;
  779. spin_unlock(&ino->i_lock);
  780. if (first) {
  781. /* The lo must be on the clp list if there is any
  782. * chance of a CB_LAYOUTRECALL(FILE) coming in.
  783. */
  784. spin_lock(&clp->cl_lock);
  785. BUG_ON(!list_empty(&lo->plh_layouts));
  786. list_add_tail(&lo->plh_layouts, &clp->cl_layouts);
  787. spin_unlock(&clp->cl_lock);
  788. }
  789. pg_offset = arg.offset & ~PAGE_CACHE_MASK;
  790. if (pg_offset) {
  791. arg.offset -= pg_offset;
  792. arg.length += pg_offset;
  793. }
  794. arg.length = PAGE_CACHE_ALIGN(arg.length);
  795. lseg = send_layoutget(lo, ctx, &arg, gfp_flags);
  796. if (!lseg && first) {
  797. spin_lock(&clp->cl_lock);
  798. list_del_init(&lo->plh_layouts);
  799. spin_unlock(&clp->cl_lock);
  800. }
  801. atomic_dec(&lo->plh_outstanding);
  802. put_layout_hdr(lo);
  803. out:
  804. dprintk("%s end, state 0x%lx lseg %p\n", __func__,
  805. nfsi->layout ? nfsi->layout->plh_flags : -1, lseg);
  806. return lseg;
  807. out_unlock:
  808. spin_unlock(&ino->i_lock);
  809. goto out;
  810. }
  811. int
  812. pnfs_layout_process(struct nfs4_layoutget *lgp)
  813. {
  814. struct pnfs_layout_hdr *lo = NFS_I(lgp->args.inode)->layout;
  815. struct nfs4_layoutget_res *res = &lgp->res;
  816. struct pnfs_layout_segment *lseg;
  817. struct inode *ino = lo->plh_inode;
  818. struct nfs_client *clp = NFS_SERVER(ino)->nfs_client;
  819. int status = 0;
  820. /* Inject layout blob into I/O device driver */
  821. lseg = NFS_SERVER(ino)->pnfs_curr_ld->alloc_lseg(lo, res, lgp->gfp_flags);
  822. if (!lseg || IS_ERR(lseg)) {
  823. if (!lseg)
  824. status = -ENOMEM;
  825. else
  826. status = PTR_ERR(lseg);
  827. dprintk("%s: Could not allocate layout: error %d\n",
  828. __func__, status);
  829. goto out;
  830. }
  831. spin_lock(&ino->i_lock);
  832. if (test_bit(NFS4CLNT_LAYOUTRECALL, &clp->cl_state) ||
  833. test_bit(NFS_LAYOUT_BULK_RECALL, &lo->plh_flags)) {
  834. dprintk("%s forget reply due to recall\n", __func__);
  835. goto out_forget_reply;
  836. }
  837. if (pnfs_layoutgets_blocked(lo, &res->stateid, 1)) {
  838. dprintk("%s forget reply due to state\n", __func__);
  839. goto out_forget_reply;
  840. }
  841. init_lseg(lo, lseg);
  842. lseg->pls_range = res->range;
  843. *lgp->lsegpp = get_lseg(lseg);
  844. pnfs_insert_layout(lo, lseg);
  845. if (res->return_on_close) {
  846. set_bit(NFS_LSEG_ROC, &lseg->pls_flags);
  847. set_bit(NFS_LAYOUT_ROC, &lo->plh_flags);
  848. }
  849. /* Done processing layoutget. Set the layout stateid */
  850. pnfs_set_layout_stateid(lo, &res->stateid, false);
  851. spin_unlock(&ino->i_lock);
  852. out:
  853. return status;
  854. out_forget_reply:
  855. spin_unlock(&ino->i_lock);
  856. lseg->pls_layout = lo;
  857. NFS_SERVER(ino)->pnfs_curr_ld->free_lseg(lseg);
  858. goto out;
  859. }
  860. static int pnfs_read_pg_test(struct nfs_pageio_descriptor *pgio,
  861. struct nfs_page *prev,
  862. struct nfs_page *req)
  863. {
  864. if (pgio->pg_count == prev->wb_bytes) {
  865. /* This is first coelesce call for a series of nfs_pages */
  866. pgio->pg_lseg = pnfs_update_layout(pgio->pg_inode,
  867. prev->wb_context,
  868. req_offset(req),
  869. pgio->pg_count,
  870. IOMODE_READ,
  871. GFP_KERNEL);
  872. } else if (pgio->pg_lseg &&
  873. req_offset(req) > end_offset(pgio->pg_lseg->pls_range.offset,
  874. pgio->pg_lseg->pls_range.length))
  875. return 0;
  876. return NFS_SERVER(pgio->pg_inode)->pnfs_curr_ld->pg_test(pgio, prev, req);
  877. }
  878. void
  879. pnfs_pageio_init_read(struct nfs_pageio_descriptor *pgio, struct inode *inode)
  880. {
  881. struct pnfs_layoutdriver_type *ld;
  882. ld = NFS_SERVER(inode)->pnfs_curr_ld;
  883. pgio->pg_test = (ld && ld->pg_test) ? pnfs_read_pg_test : NULL;
  884. }
  885. static int pnfs_write_pg_test(struct nfs_pageio_descriptor *pgio,
  886. struct nfs_page *prev,
  887. struct nfs_page *req)
  888. {
  889. if (pgio->pg_count == prev->wb_bytes) {
  890. /* This is first coelesce call for a series of nfs_pages */
  891. pgio->pg_lseg = pnfs_update_layout(pgio->pg_inode,
  892. prev->wb_context,
  893. req_offset(req),
  894. pgio->pg_count,
  895. IOMODE_RW,
  896. GFP_NOFS);
  897. } else if (pgio->pg_lseg &&
  898. req_offset(req) > end_offset(pgio->pg_lseg->pls_range.offset,
  899. pgio->pg_lseg->pls_range.length))
  900. return 0;
  901. return NFS_SERVER(pgio->pg_inode)->pnfs_curr_ld->pg_test(pgio, prev, req);
  902. }
  903. void
  904. pnfs_pageio_init_write(struct nfs_pageio_descriptor *pgio, struct inode *inode)
  905. {
  906. struct pnfs_layoutdriver_type *ld;
  907. ld = NFS_SERVER(inode)->pnfs_curr_ld;
  908. pgio->pg_test = (ld && ld->pg_test) ? pnfs_write_pg_test : NULL;
  909. }
  910. enum pnfs_try_status
  911. pnfs_try_to_write_data(struct nfs_write_data *wdata,
  912. const struct rpc_call_ops *call_ops, int how)
  913. {
  914. struct inode *inode = wdata->inode;
  915. enum pnfs_try_status trypnfs;
  916. struct nfs_server *nfss = NFS_SERVER(inode);
  917. wdata->mds_ops = call_ops;
  918. dprintk("%s: Writing ino:%lu %u@%llu (how %d)\n", __func__,
  919. inode->i_ino, wdata->args.count, wdata->args.offset, how);
  920. trypnfs = nfss->pnfs_curr_ld->write_pagelist(wdata, how);
  921. if (trypnfs == PNFS_NOT_ATTEMPTED) {
  922. put_lseg(wdata->lseg);
  923. wdata->lseg = NULL;
  924. } else
  925. nfs_inc_stats(inode, NFSIOS_PNFS_WRITE);
  926. dprintk("%s End (trypnfs:%d)\n", __func__, trypnfs);
  927. return trypnfs;
  928. }
  929. /*
  930. * Call the appropriate parallel I/O subsystem read function.
  931. */
  932. enum pnfs_try_status
  933. pnfs_try_to_read_data(struct nfs_read_data *rdata,
  934. const struct rpc_call_ops *call_ops)
  935. {
  936. struct inode *inode = rdata->inode;
  937. struct nfs_server *nfss = NFS_SERVER(inode);
  938. enum pnfs_try_status trypnfs;
  939. rdata->mds_ops = call_ops;
  940. dprintk("%s: Reading ino:%lu %u@%llu\n",
  941. __func__, inode->i_ino, rdata->args.count, rdata->args.offset);
  942. trypnfs = nfss->pnfs_curr_ld->read_pagelist(rdata);
  943. if (trypnfs == PNFS_NOT_ATTEMPTED) {
  944. put_lseg(rdata->lseg);
  945. rdata->lseg = NULL;
  946. } else {
  947. nfs_inc_stats(inode, NFSIOS_PNFS_READ);
  948. }
  949. dprintk("%s End (trypnfs:%d)\n", __func__, trypnfs);
  950. return trypnfs;
  951. }
  952. /*
  953. * Currently there is only one (whole file) write lseg.
  954. */
  955. static struct pnfs_layout_segment *pnfs_list_write_lseg(struct inode *inode)
  956. {
  957. struct pnfs_layout_segment *lseg, *rv = NULL;
  958. list_for_each_entry(lseg, &NFS_I(inode)->layout->plh_segs, pls_list)
  959. if (lseg->pls_range.iomode == IOMODE_RW)
  960. rv = lseg;
  961. return rv;
  962. }
  963. void
  964. pnfs_set_layoutcommit(struct nfs_write_data *wdata)
  965. {
  966. struct nfs_inode *nfsi = NFS_I(wdata->inode);
  967. loff_t end_pos = wdata->args.offset + wdata->res.count;
  968. bool mark_as_dirty = false;
  969. spin_lock(&nfsi->vfs_inode.i_lock);
  970. if (!test_and_set_bit(NFS_INO_LAYOUTCOMMIT, &nfsi->flags)) {
  971. /* references matched in nfs4_layoutcommit_release */
  972. get_lseg(wdata->lseg);
  973. wdata->lseg->pls_lc_cred =
  974. get_rpccred(wdata->args.context->state->owner->so_cred);
  975. mark_as_dirty = true;
  976. dprintk("%s: Set layoutcommit for inode %lu ",
  977. __func__, wdata->inode->i_ino);
  978. }
  979. if (end_pos > wdata->lseg->pls_end_pos)
  980. wdata->lseg->pls_end_pos = end_pos;
  981. spin_unlock(&nfsi->vfs_inode.i_lock);
  982. /* if pnfs_layoutcommit_inode() runs between inode locks, the next one
  983. * will be a noop because NFS_INO_LAYOUTCOMMIT will not be set */
  984. if (mark_as_dirty)
  985. mark_inode_dirty_sync(wdata->inode);
  986. }
  987. EXPORT_SYMBOL_GPL(pnfs_set_layoutcommit);
  988. /*
  989. * For the LAYOUT4_NFSV4_1_FILES layout type, NFS_DATA_SYNC WRITEs and
  990. * NFS_UNSTABLE WRITEs with a COMMIT to data servers must store enough
  991. * data to disk to allow the server to recover the data if it crashes.
  992. * LAYOUTCOMMIT is only needed when the NFL4_UFLG_COMMIT_THRU_MDS flag
  993. * is off, and a COMMIT is sent to a data server, or
  994. * if WRITEs to a data server return NFS_DATA_SYNC.
  995. */
  996. int
  997. pnfs_layoutcommit_inode(struct inode *inode, bool sync)
  998. {
  999. struct nfs4_layoutcommit_data *data;
  1000. struct nfs_inode *nfsi = NFS_I(inode);
  1001. struct pnfs_layout_segment *lseg;
  1002. struct rpc_cred *cred;
  1003. loff_t end_pos;
  1004. int status = 0;
  1005. dprintk("--> %s inode %lu\n", __func__, inode->i_ino);
  1006. if (!test_bit(NFS_INO_LAYOUTCOMMIT, &nfsi->flags))
  1007. return 0;
  1008. /* Note kzalloc ensures data->res.seq_res.sr_slot == NULL */
  1009. data = kzalloc(sizeof(*data), GFP_NOFS);
  1010. if (!data) {
  1011. mark_inode_dirty_sync(inode);
  1012. status = -ENOMEM;
  1013. goto out;
  1014. }
  1015. spin_lock(&inode->i_lock);
  1016. if (!test_and_clear_bit(NFS_INO_LAYOUTCOMMIT, &nfsi->flags)) {
  1017. spin_unlock(&inode->i_lock);
  1018. kfree(data);
  1019. goto out;
  1020. }
  1021. /*
  1022. * Currently only one (whole file) write lseg which is referenced
  1023. * in pnfs_set_layoutcommit and will be found.
  1024. */
  1025. lseg = pnfs_list_write_lseg(inode);
  1026. end_pos = lseg->pls_end_pos;
  1027. cred = lseg->pls_lc_cred;
  1028. lseg->pls_end_pos = 0;
  1029. lseg->pls_lc_cred = NULL;
  1030. memcpy(&data->args.stateid.data, nfsi->layout->plh_stateid.data,
  1031. sizeof(nfsi->layout->plh_stateid.data));
  1032. spin_unlock(&inode->i_lock);
  1033. data->args.inode = inode;
  1034. data->lseg = lseg;
  1035. data->cred = cred;
  1036. nfs_fattr_init(&data->fattr);
  1037. data->args.bitmask = NFS_SERVER(inode)->cache_consistency_bitmask;
  1038. data->res.fattr = &data->fattr;
  1039. data->args.lastbytewritten = end_pos - 1;
  1040. data->res.server = NFS_SERVER(inode);
  1041. status = nfs4_proc_layoutcommit(data, sync);
  1042. out:
  1043. dprintk("<-- %s status %d\n", __func__, status);
  1044. return status;
  1045. }