pagelist.c 12 KB

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