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