pagelist.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474
  1. /*
  2. * linux/fs/nfs/pagelist.c
  3. *
  4. * A set of helper functions for managing NFS read and write requests.
  5. * The main purpose of these routines is to provide support for the
  6. * coalescing of several requests into a single RPC call.
  7. *
  8. * Copyright 2000, 2001 (c) Trond Myklebust <trond.myklebust@fys.uio.no>
  9. *
  10. */
  11. #include <linux/slab.h>
  12. #include <linux/file.h>
  13. #include <linux/sched.h>
  14. #include <linux/sunrpc/clnt.h>
  15. #include <linux/nfs.h>
  16. #include <linux/nfs3.h>
  17. #include <linux/nfs4.h>
  18. #include <linux/nfs_page.h>
  19. #include <linux/nfs_fs.h>
  20. #include <linux/nfs_mount.h>
  21. #include <linux/export.h>
  22. #include "internal.h"
  23. #include "pnfs.h"
  24. static struct kmem_cache *nfs_page_cachep;
  25. bool nfs_pgarray_set(struct nfs_page_array *p, unsigned int pagecount)
  26. {
  27. p->npages = pagecount;
  28. if (pagecount <= ARRAY_SIZE(p->page_array))
  29. p->pagevec = p->page_array;
  30. else {
  31. p->pagevec = kcalloc(pagecount, sizeof(struct page *), GFP_KERNEL);
  32. if (!p->pagevec)
  33. p->npages = 0;
  34. }
  35. return p->pagevec != NULL;
  36. }
  37. void nfs_pgheader_init(struct nfs_pageio_descriptor *desc,
  38. struct nfs_pgio_header *hdr,
  39. void (*release)(struct nfs_pgio_header *hdr))
  40. {
  41. hdr->req = nfs_list_entry(desc->pg_list.next);
  42. hdr->inode = desc->pg_inode;
  43. hdr->cred = hdr->req->wb_context->cred;
  44. hdr->io_start = req_offset(hdr->req);
  45. hdr->good_bytes = desc->pg_count;
  46. hdr->dreq = desc->pg_dreq;
  47. hdr->layout_private = desc->pg_layout_private;
  48. hdr->release = release;
  49. hdr->completion_ops = desc->pg_completion_ops;
  50. if (hdr->completion_ops->init_hdr)
  51. hdr->completion_ops->init_hdr(hdr);
  52. }
  53. EXPORT_SYMBOL_GPL(nfs_pgheader_init);
  54. void nfs_set_pgio_error(struct nfs_pgio_header *hdr, int error, loff_t pos)
  55. {
  56. spin_lock(&hdr->lock);
  57. if (pos < hdr->io_start + hdr->good_bytes) {
  58. set_bit(NFS_IOHDR_ERROR, &hdr->flags);
  59. clear_bit(NFS_IOHDR_EOF, &hdr->flags);
  60. hdr->good_bytes = pos - hdr->io_start;
  61. hdr->error = error;
  62. }
  63. spin_unlock(&hdr->lock);
  64. }
  65. static inline struct nfs_page *
  66. nfs_page_alloc(void)
  67. {
  68. struct nfs_page *p = kmem_cache_zalloc(nfs_page_cachep, GFP_NOIO);
  69. if (p)
  70. INIT_LIST_HEAD(&p->wb_list);
  71. return p;
  72. }
  73. static inline void
  74. nfs_page_free(struct nfs_page *p)
  75. {
  76. kmem_cache_free(nfs_page_cachep, p);
  77. }
  78. /**
  79. * nfs_create_request - Create an NFS read/write request.
  80. * @ctx: open context to use
  81. * @inode: inode to which the request is attached
  82. * @page: page to write
  83. * @offset: starting offset within the page for the write
  84. * @count: number of bytes to read/write
  85. *
  86. * The page must be locked by the caller. This makes sure we never
  87. * create two different requests for the same page.
  88. * User should ensure it is safe to sleep in this function.
  89. */
  90. struct nfs_page *
  91. nfs_create_request(struct nfs_open_context *ctx, struct inode *inode,
  92. struct page *page,
  93. unsigned int offset, unsigned int count)
  94. {
  95. struct nfs_page *req;
  96. struct nfs_lock_context *l_ctx;
  97. /* try to allocate the request struct */
  98. req = nfs_page_alloc();
  99. if (req == NULL)
  100. return ERR_PTR(-ENOMEM);
  101. /* get lock context early so we can deal with alloc failures */
  102. l_ctx = nfs_get_lock_context(ctx);
  103. if (IS_ERR(l_ctx)) {
  104. nfs_page_free(req);
  105. return ERR_CAST(l_ctx);
  106. }
  107. req->wb_lock_context = l_ctx;
  108. /* Initialize the request struct. Initially, we assume a
  109. * long write-back delay. This will be adjusted in
  110. * update_nfs_request below if the region is not locked. */
  111. req->wb_page = page;
  112. req->wb_index = page_file_index(page);
  113. page_cache_get(page);
  114. req->wb_offset = offset;
  115. req->wb_pgbase = offset;
  116. req->wb_bytes = count;
  117. req->wb_context = get_nfs_open_context(ctx);
  118. kref_init(&req->wb_kref);
  119. return req;
  120. }
  121. /**
  122. * nfs_unlock_request - Unlock request and wake up sleepers.
  123. * @req:
  124. */
  125. void nfs_unlock_request(struct nfs_page *req)
  126. {
  127. if (!NFS_WBACK_BUSY(req)) {
  128. printk(KERN_ERR "NFS: Invalid unlock attempted\n");
  129. BUG();
  130. }
  131. smp_mb__before_clear_bit();
  132. clear_bit(PG_BUSY, &req->wb_flags);
  133. smp_mb__after_clear_bit();
  134. wake_up_bit(&req->wb_flags, PG_BUSY);
  135. }
  136. /**
  137. * nfs_unlock_and_release_request - Unlock request and release the nfs_page
  138. * @req:
  139. */
  140. void nfs_unlock_and_release_request(struct nfs_page *req)
  141. {
  142. nfs_unlock_request(req);
  143. nfs_release_request(req);
  144. }
  145. /*
  146. * nfs_clear_request - Free up all resources allocated to the request
  147. * @req:
  148. *
  149. * Release page and open context resources associated with a read/write
  150. * request after it has completed.
  151. */
  152. static void nfs_clear_request(struct nfs_page *req)
  153. {
  154. struct page *page = req->wb_page;
  155. struct nfs_open_context *ctx = req->wb_context;
  156. struct nfs_lock_context *l_ctx = req->wb_lock_context;
  157. if (page != NULL) {
  158. page_cache_release(page);
  159. req->wb_page = NULL;
  160. }
  161. if (l_ctx != NULL) {
  162. nfs_put_lock_context(l_ctx);
  163. req->wb_lock_context = NULL;
  164. }
  165. if (ctx != NULL) {
  166. put_nfs_open_context(ctx);
  167. req->wb_context = NULL;
  168. }
  169. }
  170. /**
  171. * nfs_release_request - Release the count on an NFS read/write request
  172. * @req: request to release
  173. *
  174. * Note: Should never be called with the spinlock held!
  175. */
  176. static void nfs_free_request(struct kref *kref)
  177. {
  178. struct nfs_page *req = container_of(kref, struct nfs_page, wb_kref);
  179. /* Release struct file and open context */
  180. nfs_clear_request(req);
  181. nfs_page_free(req);
  182. }
  183. void nfs_release_request(struct nfs_page *req)
  184. {
  185. kref_put(&req->wb_kref, nfs_free_request);
  186. }
  187. static int nfs_wait_bit_uninterruptible(void *word)
  188. {
  189. io_schedule();
  190. return 0;
  191. }
  192. /**
  193. * nfs_wait_on_request - Wait for a request to complete.
  194. * @req: request to wait upon.
  195. *
  196. * Interruptible by fatal signals only.
  197. * The user is responsible for holding a count on the request.
  198. */
  199. int
  200. nfs_wait_on_request(struct nfs_page *req)
  201. {
  202. return wait_on_bit(&req->wb_flags, PG_BUSY,
  203. nfs_wait_bit_uninterruptible,
  204. TASK_UNINTERRUPTIBLE);
  205. }
  206. bool nfs_generic_pg_test(struct nfs_pageio_descriptor *desc, struct nfs_page *prev, struct nfs_page *req)
  207. {
  208. /*
  209. * FIXME: ideally we should be able to coalesce all requests
  210. * that are not block boundary aligned, but currently this
  211. * is problematic for the case of bsize < PAGE_CACHE_SIZE,
  212. * since nfs_flush_multi and nfs_pagein_multi assume you
  213. * can have only one struct nfs_page.
  214. */
  215. if (desc->pg_bsize < PAGE_SIZE)
  216. return 0;
  217. return desc->pg_count + req->wb_bytes <= desc->pg_bsize;
  218. }
  219. EXPORT_SYMBOL_GPL(nfs_generic_pg_test);
  220. /**
  221. * nfs_pageio_init - initialise a page io descriptor
  222. * @desc: pointer to descriptor
  223. * @inode: pointer to inode
  224. * @doio: pointer to io function
  225. * @bsize: io block size
  226. * @io_flags: extra parameters for the io function
  227. */
  228. void nfs_pageio_init(struct nfs_pageio_descriptor *desc,
  229. struct inode *inode,
  230. const struct nfs_pageio_ops *pg_ops,
  231. const struct nfs_pgio_completion_ops *compl_ops,
  232. size_t bsize,
  233. int io_flags)
  234. {
  235. INIT_LIST_HEAD(&desc->pg_list);
  236. desc->pg_bytes_written = 0;
  237. desc->pg_count = 0;
  238. desc->pg_bsize = bsize;
  239. desc->pg_base = 0;
  240. desc->pg_moreio = 0;
  241. desc->pg_recoalesce = 0;
  242. desc->pg_inode = inode;
  243. desc->pg_ops = pg_ops;
  244. desc->pg_completion_ops = compl_ops;
  245. desc->pg_ioflags = io_flags;
  246. desc->pg_error = 0;
  247. desc->pg_lseg = NULL;
  248. desc->pg_dreq = NULL;
  249. desc->pg_layout_private = NULL;
  250. }
  251. EXPORT_SYMBOL_GPL(nfs_pageio_init);
  252. /**
  253. * nfs_can_coalesce_requests - test two requests for compatibility
  254. * @prev: pointer to nfs_page
  255. * @req: pointer to nfs_page
  256. *
  257. * The nfs_page structures 'prev' and 'req' are compared to ensure that the
  258. * page data area they describe is contiguous, and that their RPC
  259. * credentials, NFSv4 open state, and lockowners are the same.
  260. *
  261. * Return 'true' if this is the case, else return 'false'.
  262. */
  263. static bool nfs_can_coalesce_requests(struct nfs_page *prev,
  264. struct nfs_page *req,
  265. struct nfs_pageio_descriptor *pgio)
  266. {
  267. if (req->wb_context->cred != prev->wb_context->cred)
  268. return false;
  269. if (req->wb_lock_context->lockowner.l_owner != prev->wb_lock_context->lockowner.l_owner)
  270. return false;
  271. if (req->wb_lock_context->lockowner.l_pid != prev->wb_lock_context->lockowner.l_pid)
  272. return false;
  273. if (req->wb_context->state != prev->wb_context->state)
  274. return false;
  275. if (req->wb_pgbase != 0)
  276. return false;
  277. if (prev->wb_pgbase + prev->wb_bytes != PAGE_CACHE_SIZE)
  278. return false;
  279. if (req_offset(req) != req_offset(prev) + prev->wb_bytes)
  280. return false;
  281. return pgio->pg_ops->pg_test(pgio, prev, req);
  282. }
  283. /**
  284. * nfs_pageio_do_add_request - Attempt to coalesce a request into a page list.
  285. * @desc: destination io descriptor
  286. * @req: request
  287. *
  288. * Returns true if the request 'req' was successfully coalesced into the
  289. * existing list of pages 'desc'.
  290. */
  291. static int nfs_pageio_do_add_request(struct nfs_pageio_descriptor *desc,
  292. struct nfs_page *req)
  293. {
  294. if (desc->pg_count != 0) {
  295. struct nfs_page *prev;
  296. prev = nfs_list_entry(desc->pg_list.prev);
  297. if (!nfs_can_coalesce_requests(prev, req, desc))
  298. return 0;
  299. } else {
  300. if (desc->pg_ops->pg_init)
  301. desc->pg_ops->pg_init(desc, req);
  302. desc->pg_base = req->wb_pgbase;
  303. }
  304. nfs_list_remove_request(req);
  305. nfs_list_add_request(req, &desc->pg_list);
  306. desc->pg_count += req->wb_bytes;
  307. return 1;
  308. }
  309. /*
  310. * Helper for nfs_pageio_add_request and nfs_pageio_complete
  311. */
  312. static void nfs_pageio_doio(struct nfs_pageio_descriptor *desc)
  313. {
  314. if (!list_empty(&desc->pg_list)) {
  315. int error = desc->pg_ops->pg_doio(desc);
  316. if (error < 0)
  317. desc->pg_error = error;
  318. else
  319. desc->pg_bytes_written += desc->pg_count;
  320. }
  321. if (list_empty(&desc->pg_list)) {
  322. desc->pg_count = 0;
  323. desc->pg_base = 0;
  324. }
  325. }
  326. /**
  327. * nfs_pageio_add_request - Attempt to coalesce a request into a page list.
  328. * @desc: destination io descriptor
  329. * @req: request
  330. *
  331. * Returns true if the request 'req' was successfully coalesced into the
  332. * existing list of pages 'desc'.
  333. */
  334. static int __nfs_pageio_add_request(struct nfs_pageio_descriptor *desc,
  335. struct nfs_page *req)
  336. {
  337. while (!nfs_pageio_do_add_request(desc, req)) {
  338. desc->pg_moreio = 1;
  339. nfs_pageio_doio(desc);
  340. if (desc->pg_error < 0)
  341. return 0;
  342. desc->pg_moreio = 0;
  343. if (desc->pg_recoalesce)
  344. return 0;
  345. }
  346. return 1;
  347. }
  348. static int nfs_do_recoalesce(struct nfs_pageio_descriptor *desc)
  349. {
  350. LIST_HEAD(head);
  351. do {
  352. list_splice_init(&desc->pg_list, &head);
  353. desc->pg_bytes_written -= desc->pg_count;
  354. desc->pg_count = 0;
  355. desc->pg_base = 0;
  356. desc->pg_recoalesce = 0;
  357. while (!list_empty(&head)) {
  358. struct nfs_page *req;
  359. req = list_first_entry(&head, struct nfs_page, wb_list);
  360. nfs_list_remove_request(req);
  361. if (__nfs_pageio_add_request(desc, req))
  362. continue;
  363. if (desc->pg_error < 0)
  364. return 0;
  365. break;
  366. }
  367. } while (desc->pg_recoalesce);
  368. return 1;
  369. }
  370. int nfs_pageio_add_request(struct nfs_pageio_descriptor *desc,
  371. struct nfs_page *req)
  372. {
  373. int ret;
  374. do {
  375. ret = __nfs_pageio_add_request(desc, req);
  376. if (ret)
  377. break;
  378. if (desc->pg_error < 0)
  379. break;
  380. ret = nfs_do_recoalesce(desc);
  381. } while (ret);
  382. return ret;
  383. }
  384. EXPORT_SYMBOL_GPL(nfs_pageio_add_request);
  385. /**
  386. * nfs_pageio_complete - Complete I/O on an nfs_pageio_descriptor
  387. * @desc: pointer to io descriptor
  388. */
  389. void nfs_pageio_complete(struct nfs_pageio_descriptor *desc)
  390. {
  391. for (;;) {
  392. nfs_pageio_doio(desc);
  393. if (!desc->pg_recoalesce)
  394. break;
  395. if (!nfs_do_recoalesce(desc))
  396. break;
  397. }
  398. }
  399. EXPORT_SYMBOL_GPL(nfs_pageio_complete);
  400. /**
  401. * nfs_pageio_cond_complete - Conditional I/O completion
  402. * @desc: pointer to io descriptor
  403. * @index: page index
  404. *
  405. * It is important to ensure that processes don't try to take locks
  406. * on non-contiguous ranges of pages as that might deadlock. This
  407. * function should be called before attempting to wait on a locked
  408. * nfs_page. It will complete the I/O if the page index 'index'
  409. * is not contiguous with the existing list of pages in 'desc'.
  410. */
  411. void nfs_pageio_cond_complete(struct nfs_pageio_descriptor *desc, pgoff_t index)
  412. {
  413. if (!list_empty(&desc->pg_list)) {
  414. struct nfs_page *prev = nfs_list_entry(desc->pg_list.prev);
  415. if (index != prev->wb_index + 1)
  416. nfs_pageio_complete(desc);
  417. }
  418. }
  419. int __init nfs_init_nfspagecache(void)
  420. {
  421. nfs_page_cachep = kmem_cache_create("nfs_page",
  422. sizeof(struct nfs_page),
  423. 0, SLAB_HWCACHE_ALIGN,
  424. NULL);
  425. if (nfs_page_cachep == NULL)
  426. return -ENOMEM;
  427. return 0;
  428. }
  429. void nfs_destroy_nfspagecache(void)
  430. {
  431. kmem_cache_destroy(nfs_page_cachep);
  432. }