pagelist.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443
  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/nfs3.h>
  16. #include <linux/nfs4.h>
  17. #include <linux/nfs_page.h>
  18. #include <linux/nfs_fs.h>
  19. #include <linux/nfs_mount.h>
  20. #include "internal.h"
  21. static struct kmem_cache *nfs_page_cachep;
  22. static inline struct nfs_page *
  23. nfs_page_alloc(void)
  24. {
  25. struct nfs_page *p;
  26. p = kmem_cache_alloc(nfs_page_cachep, GFP_KERNEL);
  27. if (p) {
  28. memset(p, 0, sizeof(*p));
  29. INIT_LIST_HEAD(&p->wb_list);
  30. }
  31. return p;
  32. }
  33. static inline void
  34. nfs_page_free(struct nfs_page *p)
  35. {
  36. kmem_cache_free(nfs_page_cachep, p);
  37. }
  38. /**
  39. * nfs_create_request - Create an NFS read/write request.
  40. * @file: file descriptor to use
  41. * @inode: inode to which the request is attached
  42. * @page: page to write
  43. * @offset: starting offset within the page for the write
  44. * @count: number of bytes to read/write
  45. *
  46. * The page must be locked by the caller. This makes sure we never
  47. * create two different requests for the same page.
  48. * User should ensure it is safe to sleep in this function.
  49. */
  50. struct nfs_page *
  51. nfs_create_request(struct nfs_open_context *ctx, struct inode *inode,
  52. struct page *page,
  53. unsigned int offset, unsigned int count)
  54. {
  55. struct nfs_page *req;
  56. /* try to allocate the request struct */
  57. req = nfs_page_alloc();
  58. if (req == NULL)
  59. return ERR_PTR(-ENOMEM);
  60. /* Initialize the request struct. Initially, we assume a
  61. * long write-back delay. This will be adjusted in
  62. * update_nfs_request below if the region is not locked. */
  63. req->wb_page = page;
  64. atomic_set(&req->wb_complete, 0);
  65. req->wb_index = page->index;
  66. page_cache_get(page);
  67. BUG_ON(PagePrivate(page));
  68. BUG_ON(!PageLocked(page));
  69. BUG_ON(page->mapping->host != inode);
  70. req->wb_offset = offset;
  71. req->wb_pgbase = offset;
  72. req->wb_bytes = count;
  73. req->wb_context = get_nfs_open_context(ctx);
  74. req->wb_lock_context = nfs_get_lock_context(ctx);
  75. kref_init(&req->wb_kref);
  76. return req;
  77. }
  78. /**
  79. * nfs_unlock_request - Unlock request and wake up sleepers.
  80. * @req:
  81. */
  82. void nfs_unlock_request(struct nfs_page *req)
  83. {
  84. if (!NFS_WBACK_BUSY(req)) {
  85. printk(KERN_ERR "NFS: Invalid unlock attempted\n");
  86. BUG();
  87. }
  88. smp_mb__before_clear_bit();
  89. clear_bit(PG_BUSY, &req->wb_flags);
  90. smp_mb__after_clear_bit();
  91. wake_up_bit(&req->wb_flags, PG_BUSY);
  92. nfs_release_request(req);
  93. }
  94. /**
  95. * nfs_set_page_tag_locked - Tag a request as locked
  96. * @req:
  97. */
  98. int nfs_set_page_tag_locked(struct nfs_page *req)
  99. {
  100. if (!nfs_lock_request_dontget(req))
  101. return 0;
  102. if (req->wb_page != NULL)
  103. radix_tree_tag_set(&NFS_I(req->wb_context->path.dentry->d_inode)->nfs_page_tree, req->wb_index, NFS_PAGE_TAG_LOCKED);
  104. return 1;
  105. }
  106. /**
  107. * nfs_clear_page_tag_locked - Clear request tag and wake up sleepers
  108. */
  109. void nfs_clear_page_tag_locked(struct nfs_page *req)
  110. {
  111. if (req->wb_page != NULL) {
  112. struct inode *inode = req->wb_context->path.dentry->d_inode;
  113. struct nfs_inode *nfsi = NFS_I(inode);
  114. spin_lock(&inode->i_lock);
  115. radix_tree_tag_clear(&nfsi->nfs_page_tree, req->wb_index, NFS_PAGE_TAG_LOCKED);
  116. nfs_unlock_request(req);
  117. spin_unlock(&inode->i_lock);
  118. } else
  119. nfs_unlock_request(req);
  120. }
  121. /**
  122. * nfs_clear_request - Free up all resources allocated to the request
  123. * @req:
  124. *
  125. * Release page and open context resources associated with a read/write
  126. * request after it has completed.
  127. */
  128. void nfs_clear_request(struct nfs_page *req)
  129. {
  130. struct page *page = req->wb_page;
  131. struct nfs_open_context *ctx = req->wb_context;
  132. struct nfs_lock_context *l_ctx = req->wb_lock_context;
  133. if (page != NULL) {
  134. page_cache_release(page);
  135. req->wb_page = NULL;
  136. }
  137. if (l_ctx != NULL) {
  138. nfs_put_lock_context(l_ctx);
  139. req->wb_lock_context = NULL;
  140. }
  141. if (ctx != NULL) {
  142. put_nfs_open_context(ctx);
  143. req->wb_context = NULL;
  144. }
  145. }
  146. /**
  147. * nfs_release_request - Release the count on an NFS read/write request
  148. * @req: request to release
  149. *
  150. * Note: Should never be called with the spinlock held!
  151. */
  152. static void nfs_free_request(struct kref *kref)
  153. {
  154. struct nfs_page *req = container_of(kref, struct nfs_page, wb_kref);
  155. /* Release struct file and open context */
  156. nfs_clear_request(req);
  157. nfs_page_free(req);
  158. }
  159. void nfs_release_request(struct nfs_page *req)
  160. {
  161. kref_put(&req->wb_kref, nfs_free_request);
  162. }
  163. static int nfs_wait_bit_uninterruptible(void *word)
  164. {
  165. io_schedule();
  166. return 0;
  167. }
  168. /**
  169. * nfs_wait_on_request - Wait for a request to complete.
  170. * @req: request to wait upon.
  171. *
  172. * Interruptible by fatal signals only.
  173. * The user is responsible for holding a count on the request.
  174. */
  175. int
  176. nfs_wait_on_request(struct nfs_page *req)
  177. {
  178. return wait_on_bit(&req->wb_flags, PG_BUSY,
  179. nfs_wait_bit_uninterruptible,
  180. TASK_UNINTERRUPTIBLE);
  181. }
  182. /**
  183. * nfs_pageio_init - initialise a page io descriptor
  184. * @desc: pointer to descriptor
  185. * @inode: pointer to inode
  186. * @doio: pointer to io function
  187. * @bsize: io block size
  188. * @io_flags: extra parameters for the io function
  189. */
  190. void nfs_pageio_init(struct nfs_pageio_descriptor *desc,
  191. struct inode *inode,
  192. int (*doio)(struct inode *, struct list_head *, unsigned int, size_t, int),
  193. size_t bsize,
  194. int io_flags)
  195. {
  196. INIT_LIST_HEAD(&desc->pg_list);
  197. desc->pg_bytes_written = 0;
  198. desc->pg_count = 0;
  199. desc->pg_bsize = bsize;
  200. desc->pg_base = 0;
  201. desc->pg_inode = inode;
  202. desc->pg_doio = doio;
  203. desc->pg_ioflags = io_flags;
  204. desc->pg_error = 0;
  205. }
  206. /**
  207. * nfs_can_coalesce_requests - test two requests for compatibility
  208. * @prev: pointer to nfs_page
  209. * @req: pointer to nfs_page
  210. *
  211. * The nfs_page structures 'prev' and 'req' are compared to ensure that the
  212. * page data area they describe is contiguous, and that their RPC
  213. * credentials, NFSv4 open state, and lockowners are the same.
  214. *
  215. * Return 'true' if this is the case, else return 'false'.
  216. */
  217. static int nfs_can_coalesce_requests(struct nfs_page *prev,
  218. struct nfs_page *req)
  219. {
  220. if (req->wb_context->cred != prev->wb_context->cred)
  221. return 0;
  222. if (req->wb_lock_context->lockowner != prev->wb_lock_context->lockowner)
  223. return 0;
  224. if (req->wb_context->state != prev->wb_context->state)
  225. return 0;
  226. if (req->wb_index != (prev->wb_index + 1))
  227. return 0;
  228. if (req->wb_pgbase != 0)
  229. return 0;
  230. if (prev->wb_pgbase + prev->wb_bytes != PAGE_CACHE_SIZE)
  231. return 0;
  232. return 1;
  233. }
  234. /**
  235. * nfs_pageio_do_add_request - Attempt to coalesce a request into a page list.
  236. * @desc: destination io descriptor
  237. * @req: request
  238. *
  239. * Returns true if the request 'req' was successfully coalesced into the
  240. * existing list of pages 'desc'.
  241. */
  242. static int nfs_pageio_do_add_request(struct nfs_pageio_descriptor *desc,
  243. struct nfs_page *req)
  244. {
  245. size_t newlen = req->wb_bytes;
  246. if (desc->pg_count != 0) {
  247. struct nfs_page *prev;
  248. /*
  249. * FIXME: ideally we should be able to coalesce all requests
  250. * that are not block boundary aligned, but currently this
  251. * is problematic for the case of bsize < PAGE_CACHE_SIZE,
  252. * since nfs_flush_multi and nfs_pagein_multi assume you
  253. * can have only one struct nfs_page.
  254. */
  255. if (desc->pg_bsize < PAGE_SIZE)
  256. return 0;
  257. newlen += desc->pg_count;
  258. if (newlen > desc->pg_bsize)
  259. return 0;
  260. prev = nfs_list_entry(desc->pg_list.prev);
  261. if (!nfs_can_coalesce_requests(prev, req))
  262. return 0;
  263. } else
  264. desc->pg_base = req->wb_pgbase;
  265. nfs_list_remove_request(req);
  266. nfs_list_add_request(req, &desc->pg_list);
  267. desc->pg_count = newlen;
  268. return 1;
  269. }
  270. /*
  271. * Helper for nfs_pageio_add_request and nfs_pageio_complete
  272. */
  273. static void nfs_pageio_doio(struct nfs_pageio_descriptor *desc)
  274. {
  275. if (!list_empty(&desc->pg_list)) {
  276. int error = desc->pg_doio(desc->pg_inode,
  277. &desc->pg_list,
  278. nfs_page_array_len(desc->pg_base,
  279. desc->pg_count),
  280. desc->pg_count,
  281. desc->pg_ioflags);
  282. if (error < 0)
  283. desc->pg_error = error;
  284. else
  285. desc->pg_bytes_written += desc->pg_count;
  286. }
  287. if (list_empty(&desc->pg_list)) {
  288. desc->pg_count = 0;
  289. desc->pg_base = 0;
  290. }
  291. }
  292. /**
  293. * nfs_pageio_add_request - Attempt to coalesce a request into a page list.
  294. * @desc: destination io descriptor
  295. * @req: request
  296. *
  297. * Returns true if the request 'req' was successfully coalesced into the
  298. * existing list of pages 'desc'.
  299. */
  300. int nfs_pageio_add_request(struct nfs_pageio_descriptor *desc,
  301. struct nfs_page *req)
  302. {
  303. while (!nfs_pageio_do_add_request(desc, req)) {
  304. nfs_pageio_doio(desc);
  305. if (desc->pg_error < 0)
  306. return 0;
  307. }
  308. return 1;
  309. }
  310. /**
  311. * nfs_pageio_complete - Complete I/O on an nfs_pageio_descriptor
  312. * @desc: pointer to io descriptor
  313. */
  314. void nfs_pageio_complete(struct nfs_pageio_descriptor *desc)
  315. {
  316. nfs_pageio_doio(desc);
  317. }
  318. /**
  319. * nfs_pageio_cond_complete - Conditional I/O completion
  320. * @desc: pointer to io descriptor
  321. * @index: page index
  322. *
  323. * It is important to ensure that processes don't try to take locks
  324. * on non-contiguous ranges of pages as that might deadlock. This
  325. * function should be called before attempting to wait on a locked
  326. * nfs_page. It will complete the I/O if the page index 'index'
  327. * is not contiguous with the existing list of pages in 'desc'.
  328. */
  329. void nfs_pageio_cond_complete(struct nfs_pageio_descriptor *desc, pgoff_t index)
  330. {
  331. if (!list_empty(&desc->pg_list)) {
  332. struct nfs_page *prev = nfs_list_entry(desc->pg_list.prev);
  333. if (index != prev->wb_index + 1)
  334. nfs_pageio_doio(desc);
  335. }
  336. }
  337. #define NFS_SCAN_MAXENTRIES 16
  338. /**
  339. * nfs_scan_list - Scan a list for matching requests
  340. * @nfsi: NFS inode
  341. * @dst: Destination list
  342. * @idx_start: lower bound of page->index to scan
  343. * @npages: idx_start + npages sets the upper bound to scan.
  344. * @tag: tag to scan for
  345. *
  346. * Moves elements from one of the inode request lists.
  347. * If the number of requests is set to 0, the entire address_space
  348. * starting at index idx_start, is scanned.
  349. * The requests are *not* checked to ensure that they form a contiguous set.
  350. * You must be holding the inode's i_lock when calling this function
  351. */
  352. int nfs_scan_list(struct nfs_inode *nfsi,
  353. struct list_head *dst, pgoff_t idx_start,
  354. unsigned int npages, int tag)
  355. {
  356. struct nfs_page *pgvec[NFS_SCAN_MAXENTRIES];
  357. struct nfs_page *req;
  358. pgoff_t idx_end;
  359. int found, i;
  360. int res;
  361. res = 0;
  362. if (npages == 0)
  363. idx_end = ~0;
  364. else
  365. idx_end = idx_start + npages - 1;
  366. for (;;) {
  367. found = radix_tree_gang_lookup_tag(&nfsi->nfs_page_tree,
  368. (void **)&pgvec[0], idx_start,
  369. NFS_SCAN_MAXENTRIES, tag);
  370. if (found <= 0)
  371. break;
  372. for (i = 0; i < found; i++) {
  373. req = pgvec[i];
  374. if (req->wb_index > idx_end)
  375. goto out;
  376. idx_start = req->wb_index + 1;
  377. if (nfs_set_page_tag_locked(req)) {
  378. kref_get(&req->wb_kref);
  379. nfs_list_remove_request(req);
  380. radix_tree_tag_clear(&nfsi->nfs_page_tree,
  381. req->wb_index, tag);
  382. nfs_list_add_request(req, dst);
  383. res++;
  384. if (res == INT_MAX)
  385. goto out;
  386. }
  387. }
  388. /* for latency reduction */
  389. cond_resched_lock(&nfsi->vfs_inode.i_lock);
  390. }
  391. out:
  392. return res;
  393. }
  394. int __init nfs_init_nfspagecache(void)
  395. {
  396. nfs_page_cachep = kmem_cache_create("nfs_page",
  397. sizeof(struct nfs_page),
  398. 0, SLAB_HWCACHE_ALIGN,
  399. NULL);
  400. if (nfs_page_cachep == NULL)
  401. return -ENOMEM;
  402. return 0;
  403. }
  404. void nfs_destroy_nfspagecache(void)
  405. {
  406. kmem_cache_destroy(nfs_page_cachep);
  407. }