2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * The Mach Operating System project at Carnegie-Mellon University.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * from: @(#)vm_pager.c 8.6 (Berkeley) 1/12/94
39 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
40 * All rights reserved.
42 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
44 * Permission to use, copy, modify and distribute this software and
45 * its documentation is hereby granted, provided that both the copyright
46 * notice and this permission notice appear in all copies of the
47 * software, derivative works or modified versions, and any portions
48 * thereof, and that both notices appear in supporting documentation.
50 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
51 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
52 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
54 * Carnegie Mellon requests users of this software to return to
56 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
57 * School of Computer Science
58 * Carnegie Mellon University
59 * Pittsburgh PA 15213-3890
61 * any improvements or extensions that they make and grant Carnegie the
62 * rights to redistribute these changes.
64 * $FreeBSD: src/sys/vm/vm_pager.c,v 1.54.2.2 2001/11/18 07:11:00 dillon Exp $
65 * $DragonFly: src/sys/vm/vm_pager.c,v 1.7 2003/07/26 22:10:03 rob Exp $
69 * Paging space routine stubs. Emulates a matchmaker-like interface
73 #include <sys/param.h>
74 #include <sys/systm.h>
75 #include <sys/kernel.h>
76 #include <sys/vnode.h>
78 #include <sys/ucred.h>
79 #include <sys/malloc.h>
83 #include <vm/vm_param.h>
84 #include <vm/vm_object.h>
85 #include <vm/vm_page.h>
86 #include <vm/vm_pager.h>
87 #include <vm/vm_extern.h>
91 MALLOC_DEFINE(M_VMPGDATA, "VM pgdata", "XXX: VM pager private data");
93 extern struct pagerops defaultpagerops;
94 extern struct pagerops swappagerops;
95 extern struct pagerops vnodepagerops;
96 extern struct pagerops devicepagerops;
97 extern struct pagerops physpagerops;
99 int cluster_pbuf_freecnt = -1; /* unlimited to begin with */
101 static int dead_pager_getpages __P((vm_object_t, vm_page_t *, int, int));
102 static vm_object_t dead_pager_alloc __P((void *, vm_ooffset_t, vm_prot_t,
104 static void dead_pager_putpages __P((vm_object_t, vm_page_t *, int, int, int *));
105 static boolean_t dead_pager_haspage __P((vm_object_t, vm_pindex_t, int *, int *));
106 static void dead_pager_dealloc __P((vm_object_t));
109 dead_pager_getpages(obj, ma, count, req)
115 return VM_PAGER_FAIL;
119 dead_pager_alloc(handle, size, prot, off)
129 dead_pager_putpages(object, m, count, flags, rtvals)
138 for (i = 0; i < count; i++) {
139 rtvals[i] = VM_PAGER_AGAIN;
144 dead_pager_haspage(object, pindex, prev, next)
158 dead_pager_dealloc(object)
164 static struct pagerops deadpagerops = {
174 struct pagerops *pagertab[] = {
175 &defaultpagerops, /* OBJT_DEFAULT */
176 &swappagerops, /* OBJT_SWAP */
177 &vnodepagerops, /* OBJT_VNODE */
178 &devicepagerops, /* OBJT_DEVICE */
179 &physpagerops, /* OBJT_PHYS */
180 &deadpagerops /* OBJT_DEAD */
183 int npagers = sizeof(pagertab) / sizeof(pagertab[0]);
186 * Kernel address space for mapping pages.
187 * Used by pagers where KVAs are needed for IO.
189 * XXX needs to be large enough to support the number of pending async
190 * cleaning requests (NPENDINGIO == 64) * the maximum swap cluster size
191 * (MAXPHYS == 64k) if you want to get the most efficiency.
193 #define PAGER_MAP_SIZE (8 * 1024 * 1024)
195 int pager_map_size = PAGER_MAP_SIZE;
197 static int bswneeded;
198 static vm_offset_t swapbkva; /* swap buffers kva */
203 struct pagerops **pgops;
206 * Initialize known pagers
208 for (pgops = pagertab; pgops < &pagertab[npagers]; pgops++)
209 if (pgops && ((*pgops)->pgo_init != NULL))
210 (*(*pgops)->pgo_init) ();
214 vm_pager_bufferinit()
221 * Now set up swap and physical I/O buffer headers.
223 for (i = 0; i < nswbuf; i++, bp++) {
224 TAILQ_INSERT_HEAD(&bswlist, bp, b_freelist);
226 LIST_INIT(&bp->b_dep);
230 cluster_pbuf_freecnt = nswbuf / 2;
232 swapbkva = kmem_alloc_pageable(pager_map, nswbuf * MAXPHYS);
234 panic("Not enough pager_map VM space for physical buffers");
238 * Allocate an instance of a pager of the given type.
239 * Size, protection and offset parameters are passed in for pagers that
240 * need to perform page-level validation (e.g. the device pager).
243 vm_pager_allocate(objtype_t type, void *handle, vm_ooffset_t size, vm_prot_t prot,
246 struct pagerops *ops;
248 ops = pagertab[type];
250 return ((*ops->pgo_alloc) (handle, size, prot, off));
255 vm_pager_deallocate(object)
258 (*pagertab[object->type]->pgo_dealloc) (object);
264 * called with no specific spl
265 * Execute strategy routine directly to pager.
269 vm_pager_strategy(vm_object_t object, struct buf *bp)
271 if (pagertab[object->type]->pgo_strategy) {
272 (*pagertab[object->type]->pgo_strategy)(object, bp);
274 bp->b_flags |= B_ERROR;
281 * vm_pager_get_pages() - inline, see vm/vm_pager.h
282 * vm_pager_put_pages() - inline, see vm/vm_pager.h
283 * vm_pager_has_page() - inline, see vm/vm_pager.h
284 * vm_pager_page_inserted() - inline, see vm/vm_pager.h
285 * vm_pager_page_removed() - inline, see vm/vm_pager.h
292 * Called by pageout daemon before going back to sleep.
293 * Gives pagers a chance to clean up any completed async pageing
299 struct pagerops **pgops;
301 for (pgops = pagertab; pgops < &pagertab[npagers]; pgops++)
302 if (pgops && ((*pgops)->pgo_sync != NULL))
303 (*(*pgops)->pgo_sync) ();
314 kva = kmem_alloc_wait(pager_map, PAGE_SIZE);
315 pmap_kenter(kva, VM_PAGE_TO_PHYS(m));
320 vm_pager_unmap_page(kva)
324 kmem_free_wakeup(pager_map, kva, PAGE_SIZE);
328 vm_pager_object_lookup(pg_list, handle)
329 struct pagerlst *pg_list;
334 for (object = TAILQ_FIRST(pg_list); object != NULL; object = TAILQ_NEXT(object,pager_object_list))
335 if (object->handle == handle)
341 * initialize a physical buffer
345 initpbuf(struct buf *bp)
347 bp->b_qindex = QUEUE_NONE;
348 bp->b_data = (caddr_t) (MAXPHYS * (bp - swbuf)) + swapbkva;
349 bp->b_kvabase = bp->b_data;
350 bp->b_kvasize = MAXPHYS;
354 BUF_LOCK(bp, LK_EXCLUSIVE);
358 * allocate a physical buffer
360 * There are a limited number (nswbuf) of physical buffers. We need
361 * to make sure that no single subsystem is able to hog all of them,
362 * so each subsystem implements a counter which is typically initialized
363 * to 1/2 nswbuf. getpbuf() decrements this counter in allocation and
364 * increments it on release, and blocks if the counter hits zero. A
365 * subsystem may initialize the counter to -1 to disable the feature,
366 * but it must still be sure to match up all uses of getpbuf() with
367 * relpbuf() using the same variable.
369 * NOTE: pfreecnt can be NULL, but this 'feature' will be removed
370 * relatively soon when the rest of the subsystems get smart about it. XXX
383 while (*pfreecnt == 0) {
384 tsleep(pfreecnt, 0, "wswbuf0", 0);
388 /* get a bp from the swap buffer header pool */
389 if ((bp = TAILQ_FIRST(&bswlist)) != NULL)
393 tsleep(&bswneeded, 0, "wswbuf1", 0);
394 /* loop in case someone else grabbed one */
396 TAILQ_REMOVE(&bswlist, bp, b_freelist);
406 * allocate a physical buffer, if one is available.
408 * Note that there is no NULL hack here - all subsystems using this
409 * call understand how to use pfreecnt.
419 if (*pfreecnt == 0 || (bp = TAILQ_FIRST(&bswlist)) == NULL) {
423 TAILQ_REMOVE(&bswlist, bp, b_freelist);
435 * release a physical buffer
437 * NOTE: pfreecnt can be NULL, but this 'feature' will be removed
438 * relatively soon when the rest of the subsystems get smart about it. XXX
441 relpbuf(bp, pfreecnt)
454 TAILQ_INSERT_HEAD(&bswlist, bp, b_freelist);
461 if (++*pfreecnt == 1)
467 /********************************************************
468 * CHAINING FUNCTIONS *
469 ********************************************************
471 * These functions support recursion of I/O operations
472 * on bp's, typically by chaining one or more 'child' bp's
473 * to the parent. Synchronous, asynchronous, and semi-synchronous
474 * chaining is possible.
478 * vm_pager_chain_iodone:
480 * io completion routine for child bp. Currently we fudge a bit
481 * on dealing with b_resid. Since users of these routines may issue
482 * multiple children simultaniously, sequencing of the error can be lost.
486 vm_pager_chain_iodone(struct buf *nbp)
490 if ((bp = nbp->b_chain.parent) != NULL) {
491 if (nbp->b_flags & B_ERROR) {
492 bp->b_flags |= B_ERROR;
493 bp->b_error = nbp->b_error;
494 } else if (nbp->b_resid != 0) {
495 bp->b_flags |= B_ERROR;
496 bp->b_error = EINVAL;
498 bp->b_resid -= nbp->b_bcount;
500 nbp->b_chain.parent = NULL;
502 if (bp->b_flags & B_WANT) {
503 bp->b_flags &= ~B_WANT;
506 if (!bp->b_chain.count && (bp->b_xflags & BX_AUTOCHAINDONE)) {
507 bp->b_xflags &= ~BX_AUTOCHAINDONE;
508 if (bp->b_resid != 0 && !(bp->b_flags & B_ERROR)) {
509 bp->b_flags |= B_ERROR;
510 bp->b_error = EINVAL;
515 nbp->b_flags |= B_DONE;
516 nbp->b_flags &= ~B_ASYNC;
523 * Obtain a physical buffer and chain it to its parent buffer. When
524 * I/O completes, the parent buffer will be B_SIGNAL'd. Errors are
525 * automatically propogated to the parent
527 * Since these are brand new buffers, we do not have to clear B_INVAL
528 * and B_ERROR because they are already clear.
532 getchainbuf(struct buf *bp, struct vnode *vp, int flags)
534 struct buf *nbp = getpbuf(NULL);
536 nbp->b_chain.parent = bp;
539 if (bp->b_chain.count > 4)
540 waitchainbuf(bp, 4, 0);
542 nbp->b_flags = B_CALL | (bp->b_flags & B_ORDERED) | flags;
543 nbp->b_iodone = vm_pager_chain_iodone;
551 flushchainbuf(struct buf *nbp)
554 nbp->b_bufsize = nbp->b_bcount;
555 if ((nbp->b_flags & B_READ) == 0)
556 nbp->b_dirtyend = nbp->b_bcount;
558 VOP_STRATEGY(nbp->b_vp, nbp);
565 waitchainbuf(struct buf *bp, int count, int done)
570 while (bp->b_chain.count > count) {
571 bp->b_flags |= B_WANT;
572 tsleep(bp, 0, "bpchain", 0);
575 if (bp->b_resid != 0 && !(bp->b_flags & B_ERROR)) {
576 bp->b_flags |= B_ERROR;
577 bp->b_error = EINVAL;
585 autochaindone(struct buf *bp)
590 if (bp->b_chain.count == 0)
593 bp->b_xflags |= BX_AUTOCHAINDONE;