pagelist.c 12.6 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13
/*
 * linux/fs/nfs/pagelist.c
 *
 * A set of helper functions for managing NFS read and write requests.
 * The main purpose of these routines is to provide support for the
 * coalescing of several requests into a single RPC call.
 *
 * Copyright 2000, 2001 (c) Trond Myklebust <trond.myklebust@fys.uio.no>
 *
 */

#include <linux/slab.h>
#include <linux/file.h>
A
Alexey Dobriyan 已提交
14
#include <linux/sched.h>
L
Linus Torvalds 已提交
15
#include <linux/sunrpc/clnt.h>
16
#include <linux/nfs.h>
L
Linus Torvalds 已提交
17 18 19 20 21
#include <linux/nfs3.h>
#include <linux/nfs4.h>
#include <linux/nfs_page.h>
#include <linux/nfs_fs.h>
#include <linux/nfs_mount.h>
22
#include <linux/export.h>
L
Linus Torvalds 已提交
23

24
#include "internal.h"
25
#include "pnfs.h"
26

27
static struct kmem_cache *nfs_page_cachep;
L
Linus Torvalds 已提交
28 29 30 31

static inline struct nfs_page *
nfs_page_alloc(void)
{
32 33
	struct nfs_page	*p = kmem_cache_zalloc(nfs_page_cachep, GFP_KERNEL);
	if (p)
L
Linus Torvalds 已提交
34 35 36 37 38 39 40 41 42 43 44 45
		INIT_LIST_HEAD(&p->wb_list);
	return p;
}

static inline void
nfs_page_free(struct nfs_page *p)
{
	kmem_cache_free(nfs_page_cachep, p);
}

/**
 * nfs_create_request - Create an NFS read/write request.
46
 * @ctx: open context to use
L
Linus Torvalds 已提交
47 48 49 50 51 52
 * @inode: inode to which the request is attached
 * @page: page to write
 * @offset: starting offset within the page for the write
 * @count: number of bytes to read/write
 *
 * The page must be locked by the caller. This makes sure we never
53
 * create two different requests for the same page.
L
Linus Torvalds 已提交
54 55 56 57 58 59 60 61 62
 * User should ensure it is safe to sleep in this function.
 */
struct nfs_page *
nfs_create_request(struct nfs_open_context *ctx, struct inode *inode,
		   struct page *page,
		   unsigned int offset, unsigned int count)
{
	struct nfs_page		*req;

63 64 65 66
	/* try to allocate the request struct */
	req = nfs_page_alloc();
	if (req == NULL)
		return ERR_PTR(-ENOMEM);
L
Linus Torvalds 已提交
67

68 69 70 71 72 73 74
	/* get lock context early so we can deal with alloc failures */
	req->wb_lock_context = nfs_get_lock_context(ctx);
	if (req->wb_lock_context == NULL) {
		nfs_page_free(req);
		return ERR_PTR(-ENOMEM);
	}

L
Linus Torvalds 已提交
75 76 77 78 79 80 81
	/* Initialize the request struct. Initially, we assume a
	 * long write-back delay. This will be adjusted in
	 * update_nfs_request below if the region is not locked. */
	req->wb_page    = page;
	atomic_set(&req->wb_complete, 0);
	req->wb_index	= page->index;
	page_cache_get(page);
82 83 84
	BUG_ON(PagePrivate(page));
	BUG_ON(!PageLocked(page));
	BUG_ON(page->mapping->host != inode);
L
Linus Torvalds 已提交
85 86 87 88
	req->wb_offset  = offset;
	req->wb_pgbase	= offset;
	req->wb_bytes   = count;
	req->wb_context = get_nfs_open_context(ctx);
89
	kref_init(&req->wb_kref);
L
Linus Torvalds 已提交
90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105
	return req;
}

/**
 * nfs_unlock_request - Unlock request and wake up sleepers.
 * @req:
 */
void nfs_unlock_request(struct nfs_page *req)
{
	if (!NFS_WBACK_BUSY(req)) {
		printk(KERN_ERR "NFS: Invalid unlock attempted\n");
		BUG();
	}
	smp_mb__before_clear_bit();
	clear_bit(PG_BUSY, &req->wb_flags);
	smp_mb__after_clear_bit();
106
	wake_up_bit(&req->wb_flags, PG_BUSY);
L
Linus Torvalds 已提交
107 108 109
	nfs_release_request(req);
}

110
/**
111
 * nfs_set_page_tag_locked - Tag a request as locked
112 113
 * @req:
 */
114
int nfs_set_page_tag_locked(struct nfs_page *req)
115
{
116
	if (!nfs_lock_request_dontget(req))
117
		return 0;
118
	if (test_bit(PG_MAPPED, &req->wb_flags))
119
		radix_tree_tag_set(&NFS_I(req->wb_context->dentry->d_inode)->nfs_page_tree, req->wb_index, NFS_PAGE_TAG_LOCKED);
120 121 122 123
	return 1;
}

/**
124
 * nfs_clear_page_tag_locked - Clear request tag and wake up sleepers
125
 */
126
void nfs_clear_page_tag_locked(struct nfs_page *req)
127
{
128
	if (test_bit(PG_MAPPED, &req->wb_flags)) {
129
		struct inode *inode = req->wb_context->dentry->d_inode;
130 131
		struct nfs_inode *nfsi = NFS_I(inode);

132
		spin_lock(&inode->i_lock);
133
		radix_tree_tag_clear(&nfsi->nfs_page_tree, req->wb_index, NFS_PAGE_TAG_LOCKED);
134
		nfs_unlock_request(req);
135
		spin_unlock(&inode->i_lock);
136 137
	} else
		nfs_unlock_request(req);
138 139
}

140
/*
L
Linus Torvalds 已提交
141 142 143
 * nfs_clear_request - Free up all resources allocated to the request
 * @req:
 *
144 145
 * Release page and open context resources associated with a read/write
 * request after it has completed.
L
Linus Torvalds 已提交
146
 */
147
static void nfs_clear_request(struct nfs_page *req)
L
Linus Torvalds 已提交
148
{
149
	struct page *page = req->wb_page;
150
	struct nfs_open_context *ctx = req->wb_context;
151
	struct nfs_lock_context *l_ctx = req->wb_lock_context;
152

153 154
	if (page != NULL) {
		page_cache_release(page);
L
Linus Torvalds 已提交
155 156
		req->wb_page = NULL;
	}
157 158 159 160
	if (l_ctx != NULL) {
		nfs_put_lock_context(l_ctx);
		req->wb_lock_context = NULL;
	}
161 162 163 164
	if (ctx != NULL) {
		put_nfs_open_context(ctx);
		req->wb_context = NULL;
	}
L
Linus Torvalds 已提交
165 166 167 168 169 170 171 172 173
}


/**
 * nfs_release_request - Release the count on an NFS read/write request
 * @req: request to release
 *
 * Note: Should never be called with the spinlock held!
 */
174
static void nfs_free_request(struct kref *kref)
L
Linus Torvalds 已提交
175
{
176
	struct nfs_page *req = container_of(kref, struct nfs_page, wb_kref);
L
Linus Torvalds 已提交
177

178
	/* Release struct file and open context */
L
Linus Torvalds 已提交
179 180 181 182
	nfs_clear_request(req);
	nfs_page_free(req);
}

183 184 185 186 187
void nfs_release_request(struct nfs_page *req)
{
	kref_put(&req->wb_kref, nfs_free_request);
}

188 189 190 191 192 193
static int nfs_wait_bit_uninterruptible(void *word)
{
	io_schedule();
	return 0;
}

L
Linus Torvalds 已提交
194 195 196 197
/**
 * nfs_wait_on_request - Wait for a request to complete.
 * @req: request to wait upon.
 *
198
 * Interruptible by fatal signals only.
L
Linus Torvalds 已提交
199 200 201 202 203
 * The user is responsible for holding a count on the request.
 */
int
nfs_wait_on_request(struct nfs_page *req)
{
204 205 206
	return wait_on_bit(&req->wb_flags, PG_BUSY,
			nfs_wait_bit_uninterruptible,
			TASK_UNINTERRUPTIBLE);
L
Linus Torvalds 已提交
207 208
}

209
bool nfs_generic_pg_test(struct nfs_pageio_descriptor *desc, struct nfs_page *prev, struct nfs_page *req)
210 211 212 213 214 215 216 217 218 219 220 221 222
{
	/*
	 * FIXME: ideally we should be able to coalesce all requests
	 * that are not block boundary aligned, but currently this
	 * is problematic for the case of bsize < PAGE_CACHE_SIZE,
	 * since nfs_flush_multi and nfs_pagein_multi assume you
	 * can have only one struct nfs_page.
	 */
	if (desc->pg_bsize < PAGE_SIZE)
		return 0;

	return desc->pg_count + req->wb_bytes <= desc->pg_bsize;
}
223
EXPORT_SYMBOL_GPL(nfs_generic_pg_test);
224

L
Linus Torvalds 已提交
225
/**
226 227
 * nfs_pageio_init - initialise a page io descriptor
 * @desc: pointer to descriptor
228 229 230 231
 * @inode: pointer to inode
 * @doio: pointer to io function
 * @bsize: io block size
 * @io_flags: extra parameters for the io function
232
 */
233 234
void nfs_pageio_init(struct nfs_pageio_descriptor *desc,
		     struct inode *inode,
235
		     const struct nfs_pageio_ops *pg_ops,
236
		     size_t bsize,
237
		     int io_flags)
238 239
{
	INIT_LIST_HEAD(&desc->pg_list);
240
	desc->pg_bytes_written = 0;
241 242 243
	desc->pg_count = 0;
	desc->pg_bsize = bsize;
	desc->pg_base = 0;
244
	desc->pg_moreio = 0;
245
	desc->pg_recoalesce = 0;
246
	desc->pg_inode = inode;
247
	desc->pg_ops = pg_ops;
248 249
	desc->pg_ioflags = io_flags;
	desc->pg_error = 0;
250
	desc->pg_lseg = NULL;
251 252 253 254 255 256 257 258 259 260 261 262 263
}

/**
 * nfs_can_coalesce_requests - test two requests for compatibility
 * @prev: pointer to nfs_page
 * @req: pointer to nfs_page
 *
 * The nfs_page structures 'prev' and 'req' are compared to ensure that the
 * page data area they describe is contiguous, and that their RPC
 * credentials, NFSv4 open state, and lockowners are the same.
 *
 * Return 'true' if this is the case, else return 'false'.
 */
264 265 266
static bool nfs_can_coalesce_requests(struct nfs_page *prev,
				      struct nfs_page *req,
				      struct nfs_pageio_descriptor *pgio)
267 268
{
	if (req->wb_context->cred != prev->wb_context->cred)
269
		return false;
270
	if (req->wb_lock_context->lockowner != prev->wb_lock_context->lockowner)
271
		return false;
272
	if (req->wb_context->state != prev->wb_context->state)
273
		return false;
274
	if (req->wb_index != (prev->wb_index + 1))
275
		return false;
276
	if (req->wb_pgbase != 0)
277
		return false;
278
	if (prev->wb_pgbase + prev->wb_bytes != PAGE_CACHE_SIZE)
279
		return false;
280
	return pgio->pg_ops->pg_test(pgio, prev, req);
281 282 283
}

/**
284
 * nfs_pageio_do_add_request - Attempt to coalesce a request into a page list.
285 286 287 288 289 290
 * @desc: destination io descriptor
 * @req: request
 *
 * Returns true if the request 'req' was successfully coalesced into the
 * existing list of pages 'desc'.
 */
291 292
static int nfs_pageio_do_add_request(struct nfs_pageio_descriptor *desc,
				     struct nfs_page *req)
293 294 295 296 297
{
	if (desc->pg_count != 0) {
		struct nfs_page *prev;

		prev = nfs_list_entry(desc->pg_list.prev);
298
		if (!nfs_can_coalesce_requests(prev, req, desc))
299
			return 0;
300
	} else {
301 302
		if (desc->pg_ops->pg_init)
			desc->pg_ops->pg_init(desc, req);
303
		desc->pg_base = req->wb_pgbase;
304
	}
305 306
	nfs_list_remove_request(req);
	nfs_list_add_request(req, &desc->pg_list);
307
	desc->pg_count += req->wb_bytes;
308 309 310
	return 1;
}

311 312 313 314 315 316
/*
 * Helper for nfs_pageio_add_request and nfs_pageio_complete
 */
static void nfs_pageio_doio(struct nfs_pageio_descriptor *desc)
{
	if (!list_empty(&desc->pg_list)) {
317
		int error = desc->pg_ops->pg_doio(desc);
318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336
		if (error < 0)
			desc->pg_error = error;
		else
			desc->pg_bytes_written += desc->pg_count;
	}
	if (list_empty(&desc->pg_list)) {
		desc->pg_count = 0;
		desc->pg_base = 0;
	}
}

/**
 * nfs_pageio_add_request - Attempt to coalesce a request into a page list.
 * @desc: destination io descriptor
 * @req: request
 *
 * Returns true if the request 'req' was successfully coalesced into the
 * existing list of pages 'desc'.
 */
337
static int __nfs_pageio_add_request(struct nfs_pageio_descriptor *desc,
338
			   struct nfs_page *req)
339 340
{
	while (!nfs_pageio_do_add_request(desc, req)) {
341
		desc->pg_moreio = 1;
342 343 344
		nfs_pageio_doio(desc);
		if (desc->pg_error < 0)
			return 0;
345
		desc->pg_moreio = 0;
346 347
		if (desc->pg_recoalesce)
			return 0;
348 349 350 351
	}
	return 1;
}

352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393
static int nfs_do_recoalesce(struct nfs_pageio_descriptor *desc)
{
	LIST_HEAD(head);

	do {
		list_splice_init(&desc->pg_list, &head);
		desc->pg_bytes_written -= desc->pg_count;
		desc->pg_count = 0;
		desc->pg_base = 0;
		desc->pg_recoalesce = 0;

		while (!list_empty(&head)) {
			struct nfs_page *req;

			req = list_first_entry(&head, struct nfs_page, wb_list);
			nfs_list_remove_request(req);
			if (__nfs_pageio_add_request(desc, req))
				continue;
			if (desc->pg_error < 0)
				return 0;
			break;
		}
	} while (desc->pg_recoalesce);
	return 1;
}

int nfs_pageio_add_request(struct nfs_pageio_descriptor *desc,
		struct nfs_page *req)
{
	int ret;

	do {
		ret = __nfs_pageio_add_request(desc, req);
		if (ret)
			break;
		if (desc->pg_error < 0)
			break;
		ret = nfs_do_recoalesce(desc);
	} while (ret);
	return ret;
}

394 395 396 397 398 399
/**
 * nfs_pageio_complete - Complete I/O on an nfs_pageio_descriptor
 * @desc: pointer to io descriptor
 */
void nfs_pageio_complete(struct nfs_pageio_descriptor *desc)
{
400 401 402 403 404 405 406
	for (;;) {
		nfs_pageio_doio(desc);
		if (!desc->pg_recoalesce)
			break;
		if (!nfs_do_recoalesce(desc))
			break;
	}
407 408
}

409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424
/**
 * nfs_pageio_cond_complete - Conditional I/O completion
 * @desc: pointer to io descriptor
 * @index: page index
 *
 * It is important to ensure that processes don't try to take locks
 * on non-contiguous ranges of pages as that might deadlock. This
 * function should be called before attempting to wait on a locked
 * nfs_page. It will complete the I/O if the page index 'index'
 * is not contiguous with the existing list of pages in 'desc'.
 */
void nfs_pageio_cond_complete(struct nfs_pageio_descriptor *desc, pgoff_t index)
{
	if (!list_empty(&desc->pg_list)) {
		struct nfs_page *prev = nfs_list_entry(desc->pg_list.prev);
		if (index != prev->wb_index + 1)
425
			nfs_pageio_complete(desc);
426 427 428
	}
}

429
#define NFS_SCAN_MAXENTRIES 16
L
Linus Torvalds 已提交
430 431
/**
 * nfs_scan_list - Scan a list for matching requests
432
 * @nfsi: NFS inode
L
Linus Torvalds 已提交
433 434 435
 * @dst: Destination list
 * @idx_start: lower bound of page->index to scan
 * @npages: idx_start + npages sets the upper bound to scan.
436
 * @tag: tag to scan for
L
Linus Torvalds 已提交
437 438 439 440 441
 *
 * Moves elements from one of the inode request lists.
 * If the number of requests is set to 0, the entire address_space
 * starting at index idx_start, is scanned.
 * The requests are *not* checked to ensure that they form a contiguous set.
442
 * You must be holding the inode's i_lock when calling this function
L
Linus Torvalds 已提交
443
 */
444
int nfs_scan_list(struct nfs_inode *nfsi,
445
		struct list_head *dst, pgoff_t idx_start,
446
		unsigned int npages, int tag)
L
Linus Torvalds 已提交
447
{
448 449
	struct nfs_page *pgvec[NFS_SCAN_MAXENTRIES];
	struct nfs_page *req;
450
	pgoff_t idx_end;
451 452
	int found, i;
	int res;
453
	struct list_head *list;
L
Linus Torvalds 已提交
454 455 456 457 458 459 460

	res = 0;
	if (npages == 0)
		idx_end = ~0;
	else
		idx_end = idx_start + npages - 1;

461
	for (;;) {
462
		found = radix_tree_gang_lookup_tag(&nfsi->nfs_page_tree,
463
				(void **)&pgvec[0], idx_start,
464
				NFS_SCAN_MAXENTRIES, tag);
465
		if (found <= 0)
L
Linus Torvalds 已提交
466
			break;
467 468 469 470 471
		for (i = 0; i < found; i++) {
			req = pgvec[i];
			if (req->wb_index > idx_end)
				goto out;
			idx_start = req->wb_index + 1;
472
			if (nfs_set_page_tag_locked(req)) {
473
				kref_get(&req->wb_kref);
474 475
				radix_tree_tag_clear(&nfsi->nfs_page_tree,
						req->wb_index, tag);
476 477
				list = pnfs_choose_commit_list(req, dst);
				nfs_list_add_request(req, list);
478
				res++;
479 480
				if (res == INT_MAX)
					goto out;
481 482
			}
		}
483
		/* for latency reduction */
484
		cond_resched_lock(&nfsi->vfs_inode.i_lock);
L
Linus Torvalds 已提交
485
	}
486
out:
L
Linus Torvalds 已提交
487 488 489
	return res;
}

D
David Howells 已提交
490
int __init nfs_init_nfspagecache(void)
L
Linus Torvalds 已提交
491 492 493 494
{
	nfs_page_cachep = kmem_cache_create("nfs_page",
					    sizeof(struct nfs_page),
					    0, SLAB_HWCACHE_ALIGN,
495
					    NULL);
L
Linus Torvalds 已提交
496 497 498 499 500 501
	if (nfs_page_cachep == NULL)
		return -ENOMEM;

	return 0;
}

502
void nfs_destroy_nfspagecache(void)
L
Linus Torvalds 已提交
503
{
504
	kmem_cache_destroy(nfs_page_cachep);
L
Linus Torvalds 已提交
505 506
}