pagelist.c 12 KB

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