pagelist.c 11 KB

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