24a1cce34f
proc or any VM system structure will have to be rebuilt!!!
Much needed overhaul of the VM system. Included in this first round of
changes:
1) Improved pager interfaces: init, alloc, dealloc, getpages, putpages,
haspage, and sync operations are supported. The haspage interface now
provides information about clusterability. All pager routines now take
struct vm_object's instead of "pagers".
2) Improved data structures. In the previous paradigm, there is constant
confusion caused by pagers being both a data structure ("allocate a
pager") and a collection of routines. The idea of a pager structure has
escentially been eliminated. Objects now have types, and this type is
used to index the appropriate pager. In most cases, items in the pager
structure were duplicated in the object data structure and thus were
unnecessary. In the few cases that remained, a un_pager structure union
was created in the object to contain these items.
3) Because of the cleanup of #1 & #2, a lot of unnecessary layering can now
be removed. For instance, vm_object_enter(), vm_object_lookup(),
vm_object_remove(), and the associated object hash list were some of the
things that were removed.
4) simple_lock's removed. Discussion with several people reveals that the
SMP locking primitives used in the VM system aren't likely the mechanism
that we'll be adopting. Even if it were, the locking that was in the code
was very inadequate and would have to be mostly re-done anyway. The
locking in a uni-processor kernel was a no-op but went a long way toward
making the code difficult to read and debug.
5) Places that attempted to kludge-up the fact that we don't have kernel
thread support have been fixed to reflect the reality that we are really
dealing with processes, not threads. The VM system didn't have complete
thread support, so the comments and mis-named routines were just wrong.
We now use tsleep and wakeup directly in the lock routines, for instance.
6) Where appropriate, the pagers have been improved, especially in the
pager_alloc routines. Most of the pager_allocs have been rewritten and
are now faster and easier to maintain.
7) The pagedaemon pageout clustering algorithm has been rewritten and
now tries harder to output an even number of pages before and after
the requested page. This is sort of the reverse of the ideal pagein
algorithm and should provide better overall performance.
8) Unnecessary (incorrect) casts to caddr_t in calls to tsleep & wakeup
have been removed. Some other unnecessary casts have also been removed.
9) Some almost useless debugging code removed.
10) Terminology of shadow objects vs. backing objects straightened out.
The fact that the vm_object data structure escentially had this
backwards really confused things. The use of "shadow" and "backing
object" throughout the code is now internally consistent and correct
in the Mach terminology.
11) Several minor bug fixes, including one in the vm daemon that caused
0 RSS objects to not get purged as intended.
12) A "default pager" has now been created which cleans up the transition
of objects to the "swap" type. The previous checks throughout the code
for swp->pg_data != NULL were really ugly. This change also provides
the rudiments for future backing of "anonymous" memory by something
other than the swap pager (via the vnode pager, for example), and it
allows the decision about which of these pagers to use to be made
dynamically (although will need some additional decision code to do
this, of course).
13) (dyson) MAP_COPY has been deprecated and the corresponding "copy
object" code has been removed. MAP_COPY was undocumented and non-
standard. It was furthermore broken in several ways which caused its
behavior to degrade to MAP_PRIVATE. Binaries that use MAP_COPY will
continue to work correctly, but via the slightly different semantics
of MAP_PRIVATE.
14) (dyson) Sharing maps have been removed. It's marginal usefulness in a
threads design can be worked around in other ways. Both #12 and #13
were done to simplify the code and improve readability and maintain-
ability. (As were most all of these changes)
TODO:
1) Rewrite most of the vnode pager to use VOP_GETPAGES/PUTPAGES. Doing
this will reduce the vnode pager to a mere fraction of its current size.
2) Rewrite vm_fault and the swap/vnode pagers to use the clustering
information provided by the new haspage pager interface. This will
substantially reduce the overhead by eliminating a large number of
VOP_BMAP() calls. The VOP_BMAP() filesystem interface should be
improved to provide both a "behind" and "ahead" indication of
contiguousness.
3) Implement the extended features of pager_haspage in swap_pager_haspage().
It currently just says 0 pages ahead/behind.
4) Re-implement the swap device (swstrategy) in a more elegant way, perhaps
via a much more general mechanism that could also be used for disk
striping of regular filesystems.
5) Do something to improve the architecture of vm_object_collapse(). The
fact that it makes calls into the swap pager and knows too much about
how the swap pager operates really bothers me. It also doesn't allow
for collapsing of non-swap pager objects ("unnamed" objects backed by
other pagers).
375 lines
9.0 KiB
C
375 lines
9.0 KiB
C
/*
|
|
* Copyright (c) 1991, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* The Mach Operating System project at Carnegie-Mellon University.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* from: @(#)vm_pager.c 8.6 (Berkeley) 1/12/94
|
|
*
|
|
*
|
|
* Copyright (c) 1987, 1990 Carnegie-Mellon University.
|
|
* All rights reserved.
|
|
*
|
|
* Authors: Avadis Tevanian, Jr., Michael Wayne Young
|
|
*
|
|
* Permission to use, copy, modify and distribute this software and
|
|
* its documentation is hereby granted, provided that both the copyright
|
|
* notice and this permission notice appear in all copies of the
|
|
* software, derivative works or modified versions, and any portions
|
|
* thereof, and that both notices appear in supporting documentation.
|
|
*
|
|
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
|
|
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
|
|
* FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
|
|
*
|
|
* Carnegie Mellon requests users of this software to return to
|
|
*
|
|
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
|
|
* School of Computer Science
|
|
* Carnegie Mellon University
|
|
* Pittsburgh PA 15213-3890
|
|
*
|
|
* any improvements or extensions that they make and grant Carnegie the
|
|
* rights to redistribute these changes.
|
|
*
|
|
* $Id: vm_pager.c,v 1.15 1995/05/10 18:56:07 davidg Exp $
|
|
*/
|
|
|
|
/*
|
|
* Paging space routine stubs. Emulates a matchmaker-like interface
|
|
* for builtin pagers.
|
|
*/
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/malloc.h>
|
|
#include <sys/buf.h>
|
|
#include <sys/ucred.h>
|
|
|
|
#include <vm/vm.h>
|
|
#include <vm/vm_page.h>
|
|
#include <vm/vm_kern.h>
|
|
#include <vm/vm_pager.h>
|
|
|
|
extern struct pagerops defaultpagerops;
|
|
extern struct pagerops swappagerops;
|
|
extern struct pagerops vnodepagerops;
|
|
extern struct pagerops devicepagerops;
|
|
|
|
struct pagerops *pagertab[] = {
|
|
&defaultpagerops, /* OBJT_DEFAULT */
|
|
&swappagerops, /* OBJT_SWAP */
|
|
&vnodepagerops, /* OBJT_VNODE */
|
|
&devicepagerops, /* OBJT_DEVICE */
|
|
};
|
|
int npagers = sizeof(pagertab) / sizeof(pagertab[0]);
|
|
|
|
/*
|
|
* Kernel address space for mapping pages.
|
|
* Used by pagers where KVAs are needed for IO.
|
|
*
|
|
* XXX needs to be large enough to support the number of pending async
|
|
* cleaning requests (NPENDINGIO == 64) * the maximum swap cluster size
|
|
* (MAXPHYS == 64k) if you want to get the most efficiency.
|
|
*/
|
|
#define PAGER_MAP_SIZE (8 * 1024 * 1024)
|
|
|
|
int pager_map_size = PAGER_MAP_SIZE;
|
|
vm_map_t pager_map;
|
|
boolean_t pager_map_wanted;
|
|
vm_offset_t pager_sva, pager_eva;
|
|
int bswneeded;
|
|
vm_offset_t swapbkva; /* swap buffers kva */
|
|
|
|
void
|
|
vm_pager_init()
|
|
{
|
|
struct pagerops **pgops;
|
|
|
|
/*
|
|
* Initialize known pagers
|
|
*/
|
|
for (pgops = pagertab; pgops < &pagertab[npagers]; pgops++)
|
|
if (pgops && ((*pgops)->pgo_init != NULL))
|
|
(*(*pgops)->pgo_init) ();
|
|
}
|
|
|
|
void
|
|
vm_pager_bufferinit()
|
|
{
|
|
struct buf *bp;
|
|
int i;
|
|
|
|
bp = swbuf;
|
|
/*
|
|
* Now set up swap and physical I/O buffer headers.
|
|
*/
|
|
for (i = 0; i < nswbuf - 1; i++, bp++) {
|
|
TAILQ_INSERT_HEAD(&bswlist, bp, b_freelist);
|
|
bp->b_rcred = bp->b_wcred = NOCRED;
|
|
bp->b_vnbufs.le_next = NOLIST;
|
|
}
|
|
bp->b_rcred = bp->b_wcred = NOCRED;
|
|
bp->b_vnbufs.le_next = NOLIST;
|
|
bp->b_actf = NULL;
|
|
|
|
swapbkva = kmem_alloc_pageable(pager_map, nswbuf * MAXPHYS);
|
|
if (!swapbkva)
|
|
panic("Not enough pager_map VM space for physical buffers");
|
|
}
|
|
|
|
/*
|
|
* Allocate an instance of a pager of the given type.
|
|
* Size, protection and offset parameters are passed in for pagers that
|
|
* need to perform page-level validation (e.g. the device pager).
|
|
*/
|
|
vm_object_t
|
|
vm_pager_allocate(type, handle, size, prot, off)
|
|
objtype_t type;
|
|
void *handle;
|
|
vm_size_t size;
|
|
vm_prot_t prot;
|
|
vm_offset_t off;
|
|
{
|
|
struct pagerops *ops;
|
|
|
|
ops = pagertab[type];
|
|
if (ops)
|
|
return ((*ops->pgo_alloc) (handle, size, prot, off));
|
|
return (NULL);
|
|
}
|
|
|
|
void
|
|
vm_pager_deallocate(object)
|
|
vm_object_t object;
|
|
{
|
|
(*pagertab[object->type]->pgo_dealloc) (object);
|
|
}
|
|
|
|
|
|
int
|
|
vm_pager_get_pages(object, m, count, reqpage)
|
|
vm_object_t object;
|
|
vm_page_t *m;
|
|
int count;
|
|
int reqpage;
|
|
{
|
|
return ((*pagertab[object->type]->pgo_getpages)(object, m, count, reqpage));
|
|
}
|
|
|
|
int
|
|
vm_pager_put_pages(object, m, count, sync, rtvals)
|
|
vm_object_t object;
|
|
vm_page_t *m;
|
|
int count;
|
|
boolean_t sync;
|
|
int *rtvals;
|
|
{
|
|
return ((*pagertab[object->type]->pgo_putpages)(object, m, count, sync, rtvals));
|
|
}
|
|
|
|
boolean_t
|
|
vm_pager_has_page(object, offset, before, after)
|
|
vm_object_t object;
|
|
vm_offset_t offset;
|
|
int *before;
|
|
int *after;
|
|
{
|
|
return ((*pagertab[object->type]->pgo_haspage) (object, offset, before, after));
|
|
}
|
|
|
|
/*
|
|
* Called by pageout daemon before going back to sleep.
|
|
* Gives pagers a chance to clean up any completed async pageing operations.
|
|
*/
|
|
void
|
|
vm_pager_sync()
|
|
{
|
|
struct pagerops **pgops;
|
|
|
|
for (pgops = pagertab; pgops < &pagertab[npagers]; pgops++)
|
|
if (pgops && ((*pgops)->pgo_sync != NULL))
|
|
(*(*pgops)->pgo_sync) ();
|
|
}
|
|
|
|
vm_offset_t
|
|
vm_pager_map_page(m)
|
|
vm_page_t m;
|
|
{
|
|
vm_offset_t kva;
|
|
|
|
kva = kmem_alloc_wait(pager_map, PAGE_SIZE);
|
|
pmap_kenter(kva, VM_PAGE_TO_PHYS(m));
|
|
return (kva);
|
|
}
|
|
|
|
void
|
|
vm_pager_unmap_page(kva)
|
|
vm_offset_t kva;
|
|
{
|
|
pmap_kremove(kva);
|
|
kmem_free_wakeup(pager_map, kva, PAGE_SIZE);
|
|
}
|
|
|
|
vm_page_t
|
|
vm_pager_atop(kva)
|
|
vm_offset_t kva;
|
|
{
|
|
vm_offset_t pa;
|
|
|
|
pa = pmap_kextract(kva);
|
|
if (pa == 0)
|
|
panic("vm_pager_atop");
|
|
return (PHYS_TO_VM_PAGE(pa));
|
|
}
|
|
|
|
vm_object_t
|
|
vm_pager_object_lookup(pg_list, handle)
|
|
register struct pagerlst *pg_list;
|
|
void *handle;
|
|
{
|
|
register vm_object_t object;
|
|
|
|
for (object = pg_list->tqh_first; object != NULL; object = object->pager_object_list.tqe_next)
|
|
if (object->handle == handle)
|
|
return (object);
|
|
return (NULL);
|
|
}
|
|
|
|
/*
|
|
* This routine loses a reference to the object -
|
|
* thus a reference must be gained before calling.
|
|
*/
|
|
int
|
|
pager_cache(object, should_cache)
|
|
vm_object_t object;
|
|
boolean_t should_cache;
|
|
{
|
|
if (object == NULL)
|
|
return (KERN_INVALID_ARGUMENT);
|
|
|
|
if (should_cache)
|
|
object->flags |= OBJ_CANPERSIST;
|
|
else
|
|
object->flags &= ~OBJ_CANPERSIST;
|
|
|
|
vm_object_deallocate(object);
|
|
|
|
return (KERN_SUCCESS);
|
|
}
|
|
|
|
/*
|
|
* allocate a physical buffer
|
|
*/
|
|
struct buf *
|
|
getpbuf()
|
|
{
|
|
int s;
|
|
struct buf *bp;
|
|
|
|
s = splbio();
|
|
/* get a bp from the swap buffer header pool */
|
|
while ((bp = bswlist.tqh_first) == NULL) {
|
|
bswneeded = 1;
|
|
tsleep(&bswneeded, PVM, "wswbuf", 0);
|
|
}
|
|
TAILQ_REMOVE(&bswlist, bp, b_freelist);
|
|
splx(s);
|
|
|
|
bzero(bp, sizeof *bp);
|
|
bp->b_rcred = NOCRED;
|
|
bp->b_wcred = NOCRED;
|
|
bp->b_data = (caddr_t) (MAXPHYS * (bp - swbuf)) + swapbkva;
|
|
bp->b_vnbufs.le_next = NOLIST;
|
|
return bp;
|
|
}
|
|
|
|
/*
|
|
* allocate a physical buffer, if one is available
|
|
*/
|
|
struct buf *
|
|
trypbuf()
|
|
{
|
|
int s;
|
|
struct buf *bp;
|
|
|
|
s = splbio();
|
|
if ((bp = bswlist.tqh_first) == NULL) {
|
|
splx(s);
|
|
return NULL;
|
|
}
|
|
TAILQ_REMOVE(&bswlist, bp, b_freelist);
|
|
splx(s);
|
|
|
|
bzero(bp, sizeof *bp);
|
|
bp->b_rcred = NOCRED;
|
|
bp->b_wcred = NOCRED;
|
|
bp->b_data = (caddr_t) (MAXPHYS * (bp - swbuf)) + swapbkva;
|
|
bp->b_vnbufs.le_next = NOLIST;
|
|
return bp;
|
|
}
|
|
|
|
/*
|
|
* release a physical buffer
|
|
*/
|
|
void
|
|
relpbuf(bp)
|
|
struct buf *bp;
|
|
{
|
|
int s;
|
|
|
|
s = splbio();
|
|
|
|
if (bp->b_rcred != NOCRED) {
|
|
crfree(bp->b_rcred);
|
|
bp->b_rcred = NOCRED;
|
|
}
|
|
if (bp->b_wcred != NOCRED) {
|
|
crfree(bp->b_wcred);
|
|
bp->b_wcred = NOCRED;
|
|
}
|
|
if (bp->b_vp)
|
|
pbrelvp(bp);
|
|
|
|
if (bp->b_flags & B_WANTED)
|
|
wakeup(bp);
|
|
|
|
TAILQ_INSERT_HEAD(&bswlist, bp, b_freelist);
|
|
|
|
if (bswneeded) {
|
|
bswneeded = 0;
|
|
wakeup(&bswneeded);
|
|
}
|
|
splx(s);
|
|
}
|