pnfs.c 31 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188
  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. struct nfs_inode *nfsi = NFS_I(ino);
  747. struct nfs_client *clp = NFS_SERVER(ino)->nfs_client;
  748. struct pnfs_layout_hdr *lo;
  749. struct pnfs_layout_segment *lseg = NULL;
  750. bool first = false;
  751. if (!pnfs_enabled_sb(NFS_SERVER(ino)))
  752. return NULL;
  753. spin_lock(&ino->i_lock);
  754. lo = pnfs_find_alloc_layout(ino, gfp_flags);
  755. if (lo == NULL) {
  756. dprintk("%s ERROR: can't get pnfs_layout_hdr\n", __func__);
  757. goto out_unlock;
  758. }
  759. /* Do we even need to bother with this? */
  760. if (test_bit(NFS4CLNT_LAYOUTRECALL, &clp->cl_state) ||
  761. test_bit(NFS_LAYOUT_BULK_RECALL, &lo->plh_flags)) {
  762. dprintk("%s matches recall, use MDS\n", __func__);
  763. goto out_unlock;
  764. }
  765. /* if LAYOUTGET already failed once we don't try again */
  766. if (test_bit(lo_fail_bit(iomode), &nfsi->layout->plh_flags))
  767. goto out_unlock;
  768. /* Check to see if the layout for the given range already exists */
  769. lseg = pnfs_find_lseg(lo, &arg);
  770. if (lseg)
  771. goto out_unlock;
  772. if (pnfs_layoutgets_blocked(lo, NULL, 0))
  773. goto out_unlock;
  774. atomic_inc(&lo->plh_outstanding);
  775. get_layout_hdr(lo);
  776. if (list_empty(&lo->plh_segs))
  777. first = true;
  778. spin_unlock(&ino->i_lock);
  779. if (first) {
  780. /* The lo must be on the clp list if there is any
  781. * chance of a CB_LAYOUTRECALL(FILE) coming in.
  782. */
  783. spin_lock(&clp->cl_lock);
  784. BUG_ON(!list_empty(&lo->plh_layouts));
  785. list_add_tail(&lo->plh_layouts, &clp->cl_layouts);
  786. spin_unlock(&clp->cl_lock);
  787. }
  788. lseg = send_layoutget(lo, ctx, &arg, gfp_flags);
  789. if (!lseg && first) {
  790. spin_lock(&clp->cl_lock);
  791. list_del_init(&lo->plh_layouts);
  792. spin_unlock(&clp->cl_lock);
  793. }
  794. atomic_dec(&lo->plh_outstanding);
  795. put_layout_hdr(lo);
  796. out:
  797. dprintk("%s end, state 0x%lx lseg %p\n", __func__,
  798. nfsi->layout ? nfsi->layout->plh_flags : -1, lseg);
  799. return lseg;
  800. out_unlock:
  801. spin_unlock(&ino->i_lock);
  802. goto out;
  803. }
  804. int
  805. pnfs_layout_process(struct nfs4_layoutget *lgp)
  806. {
  807. struct pnfs_layout_hdr *lo = NFS_I(lgp->args.inode)->layout;
  808. struct nfs4_layoutget_res *res = &lgp->res;
  809. struct pnfs_layout_segment *lseg;
  810. struct inode *ino = lo->plh_inode;
  811. struct nfs_client *clp = NFS_SERVER(ino)->nfs_client;
  812. int status = 0;
  813. /* Inject layout blob into I/O device driver */
  814. lseg = NFS_SERVER(ino)->pnfs_curr_ld->alloc_lseg(lo, res, lgp->gfp_flags);
  815. if (!lseg || IS_ERR(lseg)) {
  816. if (!lseg)
  817. status = -ENOMEM;
  818. else
  819. status = PTR_ERR(lseg);
  820. dprintk("%s: Could not allocate layout: error %d\n",
  821. __func__, status);
  822. goto out;
  823. }
  824. spin_lock(&ino->i_lock);
  825. if (test_bit(NFS4CLNT_LAYOUTRECALL, &clp->cl_state) ||
  826. test_bit(NFS_LAYOUT_BULK_RECALL, &lo->plh_flags)) {
  827. dprintk("%s forget reply due to recall\n", __func__);
  828. goto out_forget_reply;
  829. }
  830. if (pnfs_layoutgets_blocked(lo, &res->stateid, 1)) {
  831. dprintk("%s forget reply due to state\n", __func__);
  832. goto out_forget_reply;
  833. }
  834. init_lseg(lo, lseg);
  835. lseg->pls_range = res->range;
  836. *lgp->lsegpp = get_lseg(lseg);
  837. pnfs_insert_layout(lo, lseg);
  838. if (res->return_on_close) {
  839. set_bit(NFS_LSEG_ROC, &lseg->pls_flags);
  840. set_bit(NFS_LAYOUT_ROC, &lo->plh_flags);
  841. }
  842. /* Done processing layoutget. Set the layout stateid */
  843. pnfs_set_layout_stateid(lo, &res->stateid, false);
  844. spin_unlock(&ino->i_lock);
  845. out:
  846. return status;
  847. out_forget_reply:
  848. spin_unlock(&ino->i_lock);
  849. lseg->pls_layout = lo;
  850. NFS_SERVER(ino)->pnfs_curr_ld->free_lseg(lseg);
  851. goto out;
  852. }
  853. static int pnfs_read_pg_test(struct nfs_pageio_descriptor *pgio,
  854. struct nfs_page *prev,
  855. struct nfs_page *req)
  856. {
  857. if (pgio->pg_count == prev->wb_bytes) {
  858. /* This is first coelesce call for a series of nfs_pages */
  859. pgio->pg_lseg = pnfs_update_layout(pgio->pg_inode,
  860. prev->wb_context,
  861. req_offset(req),
  862. pgio->pg_count,
  863. IOMODE_READ,
  864. GFP_KERNEL);
  865. } else if (pgio->pg_lseg &&
  866. req_offset(req) > end_offset(pgio->pg_lseg->pls_range.offset,
  867. pgio->pg_lseg->pls_range.length))
  868. return 0;
  869. return NFS_SERVER(pgio->pg_inode)->pnfs_curr_ld->pg_test(pgio, prev, req);
  870. }
  871. void
  872. pnfs_pageio_init_read(struct nfs_pageio_descriptor *pgio, struct inode *inode)
  873. {
  874. struct pnfs_layoutdriver_type *ld;
  875. ld = NFS_SERVER(inode)->pnfs_curr_ld;
  876. pgio->pg_test = (ld && ld->pg_test) ? pnfs_read_pg_test : NULL;
  877. }
  878. static int pnfs_write_pg_test(struct nfs_pageio_descriptor *pgio,
  879. struct nfs_page *prev,
  880. struct nfs_page *req)
  881. {
  882. if (pgio->pg_count == prev->wb_bytes) {
  883. /* This is first coelesce call for a series of nfs_pages */
  884. pgio->pg_lseg = pnfs_update_layout(pgio->pg_inode,
  885. prev->wb_context,
  886. req_offset(req),
  887. pgio->pg_count,
  888. IOMODE_RW,
  889. GFP_NOFS);
  890. } else if (pgio->pg_lseg &&
  891. req_offset(req) > end_offset(pgio->pg_lseg->pls_range.offset,
  892. pgio->pg_lseg->pls_range.length))
  893. return 0;
  894. return NFS_SERVER(pgio->pg_inode)->pnfs_curr_ld->pg_test(pgio, prev, req);
  895. }
  896. void
  897. pnfs_pageio_init_write(struct nfs_pageio_descriptor *pgio, struct inode *inode)
  898. {
  899. struct pnfs_layoutdriver_type *ld;
  900. ld = NFS_SERVER(inode)->pnfs_curr_ld;
  901. pgio->pg_test = (ld && ld->pg_test) ? pnfs_write_pg_test : NULL;
  902. }
  903. enum pnfs_try_status
  904. pnfs_try_to_write_data(struct nfs_write_data *wdata,
  905. const struct rpc_call_ops *call_ops, int how)
  906. {
  907. struct inode *inode = wdata->inode;
  908. enum pnfs_try_status trypnfs;
  909. struct nfs_server *nfss = NFS_SERVER(inode);
  910. wdata->mds_ops = call_ops;
  911. dprintk("%s: Writing ino:%lu %u@%llu (how %d)\n", __func__,
  912. inode->i_ino, wdata->args.count, wdata->args.offset, how);
  913. trypnfs = nfss->pnfs_curr_ld->write_pagelist(wdata, how);
  914. if (trypnfs == PNFS_NOT_ATTEMPTED) {
  915. put_lseg(wdata->lseg);
  916. wdata->lseg = NULL;
  917. } else
  918. nfs_inc_stats(inode, NFSIOS_PNFS_WRITE);
  919. dprintk("%s End (trypnfs:%d)\n", __func__, trypnfs);
  920. return trypnfs;
  921. }
  922. /*
  923. * Call the appropriate parallel I/O subsystem read function.
  924. */
  925. enum pnfs_try_status
  926. pnfs_try_to_read_data(struct nfs_read_data *rdata,
  927. const struct rpc_call_ops *call_ops)
  928. {
  929. struct inode *inode = rdata->inode;
  930. struct nfs_server *nfss = NFS_SERVER(inode);
  931. enum pnfs_try_status trypnfs;
  932. rdata->mds_ops = call_ops;
  933. dprintk("%s: Reading ino:%lu %u@%llu\n",
  934. __func__, inode->i_ino, rdata->args.count, rdata->args.offset);
  935. trypnfs = nfss->pnfs_curr_ld->read_pagelist(rdata);
  936. if (trypnfs == PNFS_NOT_ATTEMPTED) {
  937. put_lseg(rdata->lseg);
  938. rdata->lseg = NULL;
  939. } else {
  940. nfs_inc_stats(inode, NFSIOS_PNFS_READ);
  941. }
  942. dprintk("%s End (trypnfs:%d)\n", __func__, trypnfs);
  943. return trypnfs;
  944. }
  945. /*
  946. * Currently there is only one (whole file) write lseg.
  947. */
  948. static struct pnfs_layout_segment *pnfs_list_write_lseg(struct inode *inode)
  949. {
  950. struct pnfs_layout_segment *lseg, *rv = NULL;
  951. list_for_each_entry(lseg, &NFS_I(inode)->layout->plh_segs, pls_list)
  952. if (lseg->pls_range.iomode == IOMODE_RW)
  953. rv = lseg;
  954. return rv;
  955. }
  956. void
  957. pnfs_set_layoutcommit(struct nfs_write_data *wdata)
  958. {
  959. struct nfs_inode *nfsi = NFS_I(wdata->inode);
  960. loff_t end_pos = wdata->args.offset + wdata->res.count;
  961. bool mark_as_dirty = false;
  962. spin_lock(&nfsi->vfs_inode.i_lock);
  963. if (!test_and_set_bit(NFS_INO_LAYOUTCOMMIT, &nfsi->flags)) {
  964. /* references matched in nfs4_layoutcommit_release */
  965. get_lseg(wdata->lseg);
  966. wdata->lseg->pls_lc_cred =
  967. get_rpccred(wdata->args.context->state->owner->so_cred);
  968. mark_as_dirty = true;
  969. dprintk("%s: Set layoutcommit for inode %lu ",
  970. __func__, wdata->inode->i_ino);
  971. }
  972. if (end_pos > wdata->lseg->pls_end_pos)
  973. wdata->lseg->pls_end_pos = end_pos;
  974. spin_unlock(&nfsi->vfs_inode.i_lock);
  975. /* if pnfs_layoutcommit_inode() runs between inode locks, the next one
  976. * will be a noop because NFS_INO_LAYOUTCOMMIT will not be set */
  977. if (mark_as_dirty)
  978. mark_inode_dirty_sync(wdata->inode);
  979. }
  980. EXPORT_SYMBOL_GPL(pnfs_set_layoutcommit);
  981. /*
  982. * For the LAYOUT4_NFSV4_1_FILES layout type, NFS_DATA_SYNC WRITEs and
  983. * NFS_UNSTABLE WRITEs with a COMMIT to data servers must store enough
  984. * data to disk to allow the server to recover the data if it crashes.
  985. * LAYOUTCOMMIT is only needed when the NFL4_UFLG_COMMIT_THRU_MDS flag
  986. * is off, and a COMMIT is sent to a data server, or
  987. * if WRITEs to a data server return NFS_DATA_SYNC.
  988. */
  989. int
  990. pnfs_layoutcommit_inode(struct inode *inode, bool sync)
  991. {
  992. struct nfs4_layoutcommit_data *data;
  993. struct nfs_inode *nfsi = NFS_I(inode);
  994. struct pnfs_layout_segment *lseg;
  995. struct rpc_cred *cred;
  996. loff_t end_pos;
  997. int status = 0;
  998. dprintk("--> %s inode %lu\n", __func__, inode->i_ino);
  999. if (!test_bit(NFS_INO_LAYOUTCOMMIT, &nfsi->flags))
  1000. return 0;
  1001. /* Note kzalloc ensures data->res.seq_res.sr_slot == NULL */
  1002. data = kzalloc(sizeof(*data), GFP_NOFS);
  1003. if (!data) {
  1004. mark_inode_dirty_sync(inode);
  1005. status = -ENOMEM;
  1006. goto out;
  1007. }
  1008. spin_lock(&inode->i_lock);
  1009. if (!test_and_clear_bit(NFS_INO_LAYOUTCOMMIT, &nfsi->flags)) {
  1010. spin_unlock(&inode->i_lock);
  1011. kfree(data);
  1012. goto out;
  1013. }
  1014. /*
  1015. * Currently only one (whole file) write lseg which is referenced
  1016. * in pnfs_set_layoutcommit and will be found.
  1017. */
  1018. lseg = pnfs_list_write_lseg(inode);
  1019. end_pos = lseg->pls_end_pos;
  1020. cred = lseg->pls_lc_cred;
  1021. lseg->pls_end_pos = 0;
  1022. lseg->pls_lc_cred = NULL;
  1023. memcpy(&data->args.stateid.data, nfsi->layout->plh_stateid.data,
  1024. sizeof(nfsi->layout->plh_stateid.data));
  1025. spin_unlock(&inode->i_lock);
  1026. data->args.inode = inode;
  1027. data->lseg = lseg;
  1028. data->cred = cred;
  1029. nfs_fattr_init(&data->fattr);
  1030. data->args.bitmask = NFS_SERVER(inode)->cache_consistency_bitmask;
  1031. data->res.fattr = &data->fattr;
  1032. data->args.lastbytewritten = end_pos - 1;
  1033. data->res.server = NFS_SERVER(inode);
  1034. status = nfs4_proc_layoutcommit(data, sync);
  1035. out:
  1036. dprintk("<-- %s status %d\n", __func__, status);
  1037. return status;
  1038. }