pagelist.c 12 KB

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