2005-01-07 02:29:27 +00:00
|
|
|
/*-
|
1994-05-24 10:09:53 +00:00
|
|
|
* 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.
|
|
|
|
* 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.
|
|
|
|
*
|
1994-08-02 07:55:43 +00:00
|
|
|
* from: @(#)vm_glue.c 8.6 (Berkeley) 1/5/94
|
1994-05-24 10:09:53 +00:00
|
|
|
*
|
|
|
|
*
|
|
|
|
* Copyright (c) 1987, 1990 Carnegie-Mellon University.
|
|
|
|
* All rights reserved.
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
*
|
1994-05-24 10:09:53 +00:00
|
|
|
* 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.
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
*
|
|
|
|
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
|
|
|
|
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
|
1994-05-24 10:09:53 +00:00
|
|
|
* FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
*
|
1994-05-24 10:09:53 +00:00
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
2003-06-11 23:50:51 +00:00
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
|
1998-09-29 17:33:59 +00:00
|
|
|
#include "opt_vm.h"
|
2003-07-31 01:25:05 +00:00
|
|
|
#include "opt_kstack_pages.h"
|
|
|
|
#include "opt_kstack_max_pages.h"
|
2014-10-04 18:38:14 +00:00
|
|
|
#include "opt_kstack_usage_prof.h"
|
1996-12-22 23:17:09 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
2003-04-29 13:36:06 +00:00
|
|
|
#include <sys/limits.h>
|
2001-05-01 08:13:21 +00:00
|
|
|
#include <sys/lock.h>
|
2013-08-07 06:21:20 +00:00
|
|
|
#include <sys/malloc.h>
|
2001-05-01 08:13:21 +00:00
|
|
|
#include <sys/mutex.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/proc.h>
|
2011-04-05 20:23:59 +00:00
|
|
|
#include <sys/racct.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/resourcevar.h>
|
2013-02-20 10:38:34 +00:00
|
|
|
#include <sys/rwlock.h>
|
2005-12-16 18:34:14 +00:00
|
|
|
#include <sys/sched.h>
|
|
|
|
#include <sys/sf_buf.h>
|
1995-03-28 07:58:53 +00:00
|
|
|
#include <sys/shm.h>
|
1995-12-07 12:48:31 +00:00
|
|
|
#include <sys/vmmeter.h>
|
2013-08-07 06:21:20 +00:00
|
|
|
#include <sys/vmem.h>
|
2001-03-28 11:52:56 +00:00
|
|
|
#include <sys/sx.h>
|
1997-12-06 02:23:36 +00:00
|
|
|
#include <sys/sysctl.h>
|
2011-12-16 10:56:16 +00:00
|
|
|
#include <sys/_kstack_cache.h>
|
2009-09-01 11:41:51 +00:00
|
|
|
#include <sys/eventhandler.h>
|
1994-05-25 09:21:21 +00:00
|
|
|
#include <sys/kernel.h>
|
2000-09-07 01:33:02 +00:00
|
|
|
#include <sys/ktr.h>
|
1997-04-07 07:16:06 +00:00
|
|
|
#include <sys/unistd.h>
|
1994-05-25 09:21:21 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <vm/vm.h>
|
1995-12-07 12:48:31 +00:00
|
|
|
#include <vm/vm_param.h>
|
|
|
|
#include <vm/pmap.h>
|
|
|
|
#include <vm/vm_map.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <vm/vm_page.h>
|
1994-05-25 09:21:21 +00:00
|
|
|
#include <vm/vm_pageout.h>
|
2002-07-07 23:05:27 +00:00
|
|
|
#include <vm/vm_object.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <vm/vm_kern.h>
|
1995-12-07 12:48:31 +00:00
|
|
|
#include <vm/vm_extern.h>
|
2002-07-07 23:05:27 +00:00
|
|
|
#include <vm/vm_pager.h>
|
2002-12-15 19:17:57 +00:00
|
|
|
#include <vm/swap_pager.h>
|
1995-12-07 12:48:31 +00:00
|
|
|
|
2014-10-04 18:38:14 +00:00
|
|
|
#include <machine/cpu.h>
|
|
|
|
|
2002-01-17 16:46:26 +00:00
|
|
|
#ifndef NO_SWAPPING
|
2007-09-17 05:31:39 +00:00
|
|
|
static int swapout(struct proc *);
|
|
|
|
static void swapclear(struct proc *);
|
2010-04-11 16:26:07 +00:00
|
|
|
static void vm_thread_swapin(struct thread *td);
|
|
|
|
static void vm_thread_swapout(struct thread *td);
|
2002-01-17 16:46:26 +00:00
|
|
|
#endif
|
1995-12-14 09:55:16 +00:00
|
|
|
|
2002-06-22 01:26:02 +00:00
|
|
|
/*
|
|
|
|
* MPSAFE
|
2003-01-20 17:46:48 +00:00
|
|
|
*
|
|
|
|
* WARNING! This code calls vm_map_check_protection() which only checks
|
|
|
|
* the associated vm_map_entry range. It does not determine whether the
|
|
|
|
* contents of the memory is actually readable or writable. In most cases
|
|
|
|
* just checking the vm_map_entry is sufficient within the kernel's address
|
|
|
|
* space.
|
2002-06-22 01:26:02 +00:00
|
|
|
*/
|
1994-05-24 10:09:53 +00:00
|
|
|
int
|
|
|
|
kernacc(addr, len, rw)
|
2003-01-21 11:34:57 +00:00
|
|
|
void *addr;
|
1994-05-24 10:09:53 +00:00
|
|
|
int len, rw;
|
|
|
|
{
|
|
|
|
boolean_t rv;
|
|
|
|
vm_offset_t saddr, eaddr;
|
1999-10-30 06:32:05 +00:00
|
|
|
vm_prot_t prot;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2002-01-17 16:46:26 +00:00
|
|
|
KASSERT((rw & ~VM_PROT_ALL) == 0,
|
1999-10-30 06:32:05 +00:00
|
|
|
("illegal ``rw'' argument to kernacc (%x)\n", rw));
|
2005-01-22 19:21:29 +00:00
|
|
|
|
|
|
|
if ((vm_offset_t)addr + len > kernel_map->max_offset ||
|
|
|
|
(vm_offset_t)addr + len < (vm_offset_t)addr)
|
|
|
|
return (FALSE);
|
|
|
|
|
1999-10-30 06:32:05 +00:00
|
|
|
prot = rw;
|
1998-10-13 08:24:45 +00:00
|
|
|
saddr = trunc_page((vm_offset_t)addr);
|
|
|
|
eaddr = round_page((vm_offset_t)addr + len);
|
2003-11-10 01:37:40 +00:00
|
|
|
vm_map_lock_read(kernel_map);
|
1994-05-24 10:09:53 +00:00
|
|
|
rv = vm_map_check_protection(kernel_map, saddr, eaddr, prot);
|
2003-11-10 01:37:40 +00:00
|
|
|
vm_map_unlock_read(kernel_map);
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
return (rv == TRUE);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
2002-06-22 01:26:02 +00:00
|
|
|
/*
|
|
|
|
* MPSAFE
|
2003-01-20 17:46:48 +00:00
|
|
|
*
|
|
|
|
* WARNING! This code calls vm_map_check_protection() which only checks
|
|
|
|
* the associated vm_map_entry range. It does not determine whether the
|
|
|
|
* contents of the memory is actually readable or writable. vmapbuf(),
|
|
|
|
* vm_fault_quick(), or copyin()/copout()/su*()/fu*() functions should be
|
|
|
|
* used in conjuction with this call.
|
2002-06-22 01:26:02 +00:00
|
|
|
*/
|
1994-05-24 10:09:53 +00:00
|
|
|
int
|
|
|
|
useracc(addr, len, rw)
|
2003-01-21 11:34:57 +00:00
|
|
|
void *addr;
|
1994-05-24 10:09:53 +00:00
|
|
|
int len, rw;
|
|
|
|
{
|
|
|
|
boolean_t rv;
|
1999-10-30 06:32:05 +00:00
|
|
|
vm_prot_t prot;
|
2002-09-21 22:07:17 +00:00
|
|
|
vm_map_t map;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2002-01-17 16:46:26 +00:00
|
|
|
KASSERT((rw & ~VM_PROT_ALL) == 0,
|
1999-10-30 06:32:05 +00:00
|
|
|
("illegal ``rw'' argument to useracc (%x)\n", rw));
|
|
|
|
prot = rw;
|
2002-09-21 22:07:17 +00:00
|
|
|
map = &curproc->p_vmspace->vm_map;
|
|
|
|
if ((vm_offset_t)addr + len > vm_map_max(map) ||
|
|
|
|
(vm_offset_t)addr + len < (vm_offset_t)addr) {
|
1994-05-25 09:21:21 +00:00
|
|
|
return (FALSE);
|
|
|
|
}
|
2003-11-10 01:37:40 +00:00
|
|
|
vm_map_lock_read(map);
|
2002-09-21 22:07:17 +00:00
|
|
|
rv = vm_map_check_protection(map, trunc_page((vm_offset_t)addr),
|
|
|
|
round_page((vm_offset_t)addr + len), prot);
|
2003-11-10 01:37:40 +00:00
|
|
|
vm_map_unlock_read(map);
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
return (rv == TRUE);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
2004-03-05 22:03:11 +00:00
|
|
|
int
|
2004-03-15 06:43:51 +00:00
|
|
|
vslock(void *addr, size_t len)
|
2004-03-05 22:03:11 +00:00
|
|
|
{
|
2004-03-15 09:11:23 +00:00
|
|
|
vm_offset_t end, last, start;
|
|
|
|
vm_size_t npages;
|
|
|
|
int error;
|
2004-03-05 22:03:11 +00:00
|
|
|
|
2004-03-15 09:11:23 +00:00
|
|
|
last = (vm_offset_t)addr + len;
|
2004-03-15 06:42:40 +00:00
|
|
|
start = trunc_page((vm_offset_t)addr);
|
2004-03-15 09:11:23 +00:00
|
|
|
end = round_page(last);
|
|
|
|
if (last < (vm_offset_t)addr || end < (vm_offset_t)addr)
|
2004-03-05 22:03:11 +00:00
|
|
|
return (EINVAL);
|
|
|
|
npages = atop(end - start);
|
|
|
|
if (npages > vm_page_max_wired)
|
|
|
|
return (ENOMEM);
|
|
|
|
#if 0
|
|
|
|
/*
|
|
|
|
* XXX - not yet
|
|
|
|
*
|
|
|
|
* The limit for transient usage of wired pages should be
|
|
|
|
* larger than for "permanent" wired pages (mlock()).
|
|
|
|
*
|
|
|
|
* Also, the sysctl code, which is the only present user
|
|
|
|
* of vslock(), does a hard loop on EAGAIN.
|
|
|
|
*/
|
2014-03-22 10:26:09 +00:00
|
|
|
if (npages + vm_cnt.v_wire_count > vm_page_max_wired)
|
2004-03-05 22:03:11 +00:00
|
|
|
return (EAGAIN);
|
|
|
|
#endif
|
2004-03-15 06:42:40 +00:00
|
|
|
error = vm_map_wire(&curproc->p_vmspace->vm_map, start, end,
|
2004-05-07 11:43:24 +00:00
|
|
|
VM_MAP_WIRE_SYSTEM | VM_MAP_WIRE_NOHOLES);
|
2004-03-15 06:42:40 +00:00
|
|
|
/*
|
|
|
|
* Return EFAULT on error to match copy{in,out}() behaviour
|
|
|
|
* rather than returning ENOMEM like mlock() would.
|
|
|
|
*/
|
|
|
|
return (error == KERN_SUCCESS ? 0 : EFAULT);
|
2004-03-05 22:03:11 +00:00
|
|
|
}
|
|
|
|
|
2004-03-15 06:42:40 +00:00
|
|
|
void
|
2004-03-15 06:43:51 +00:00
|
|
|
vsunlock(void *addr, size_t len)
|
2004-03-05 22:03:11 +00:00
|
|
|
{
|
|
|
|
|
2004-03-15 06:42:40 +00:00
|
|
|
/* Rely on the parameter sanity checks performed by vslock(). */
|
|
|
|
(void)vm_map_unwire(&curproc->p_vmspace->vm_map,
|
|
|
|
trunc_page((vm_offset_t)addr), round_page((vm_offset_t)addr + len),
|
2004-03-15 06:43:51 +00:00
|
|
|
VM_MAP_WIRE_SYSTEM | VM_MAP_WIRE_NOHOLES);
|
2004-03-05 22:03:11 +00:00
|
|
|
}
|
|
|
|
|
2005-12-16 18:34:14 +00:00
|
|
|
/*
|
|
|
|
* Pin the page contained within the given object at the given offset. If the
|
|
|
|
* page is not resident, allocate and load it using the given object's pager.
|
|
|
|
* Return the pinned page if successful; otherwise, return NULL.
|
|
|
|
*/
|
|
|
|
static vm_page_t
|
2013-08-05 08:55:35 +00:00
|
|
|
vm_imgact_hold_page(vm_object_t object, vm_ooffset_t offset)
|
2005-12-16 18:34:14 +00:00
|
|
|
{
|
|
|
|
vm_page_t m, ma[1];
|
|
|
|
vm_pindex_t pindex;
|
|
|
|
int rv;
|
|
|
|
|
2013-02-20 12:03:20 +00:00
|
|
|
VM_OBJECT_WLOCK(object);
|
2005-12-16 18:34:14 +00:00
|
|
|
pindex = OFF_TO_IDX(offset);
|
2013-08-22 07:39:53 +00:00
|
|
|
m = vm_page_grab(object, pindex, VM_ALLOC_NORMAL);
|
2009-06-07 19:38:26 +00:00
|
|
|
if (m->valid != VM_PAGE_BITS_ALL) {
|
2005-12-16 18:34:14 +00:00
|
|
|
ma[0] = m;
|
|
|
|
rv = vm_pager_get_pages(object, ma, 1, 0);
|
|
|
|
m = vm_page_lookup(object, pindex);
|
|
|
|
if (m == NULL)
|
|
|
|
goto out;
|
2009-06-06 20:13:14 +00:00
|
|
|
if (rv != VM_PAGER_OK) {
|
2010-04-30 00:46:43 +00:00
|
|
|
vm_page_lock(m);
|
2005-12-16 18:34:14 +00:00
|
|
|
vm_page_free(m);
|
2010-04-30 00:46:43 +00:00
|
|
|
vm_page_unlock(m);
|
2005-12-16 18:34:14 +00:00
|
|
|
m = NULL;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
2013-08-09 11:11:11 +00:00
|
|
|
vm_page_xunbusy(m);
|
2013-08-05 08:55:35 +00:00
|
|
|
vm_page_lock(m);
|
|
|
|
vm_page_hold(m);
|
2014-08-13 05:44:08 +00:00
|
|
|
vm_page_activate(m);
|
2013-08-05 08:55:35 +00:00
|
|
|
vm_page_unlock(m);
|
2005-12-16 18:34:14 +00:00
|
|
|
out:
|
2013-02-20 12:03:20 +00:00
|
|
|
VM_OBJECT_WUNLOCK(object);
|
2005-12-16 18:34:14 +00:00
|
|
|
return (m);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return a CPU private mapping to the page at the given offset within the
|
|
|
|
* given object. The page is pinned before it is mapped.
|
|
|
|
*/
|
|
|
|
struct sf_buf *
|
|
|
|
vm_imgact_map_page(vm_object_t object, vm_ooffset_t offset)
|
|
|
|
{
|
|
|
|
vm_page_t m;
|
|
|
|
|
2013-08-05 08:55:35 +00:00
|
|
|
m = vm_imgact_hold_page(object, offset);
|
2005-12-16 18:34:14 +00:00
|
|
|
if (m == NULL)
|
|
|
|
return (NULL);
|
|
|
|
sched_pin();
|
|
|
|
return (sf_buf_alloc(m, SFB_CPUPRIVATE));
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Destroy the given CPU private mapping and unpin the page that it mapped.
|
|
|
|
*/
|
|
|
|
void
|
2013-08-05 08:55:35 +00:00
|
|
|
vm_imgact_unmap_page(struct sf_buf *sf)
|
2005-12-16 18:34:14 +00:00
|
|
|
{
|
|
|
|
vm_page_t m;
|
|
|
|
|
|
|
|
m = sf_buf_page(sf);
|
|
|
|
sf_buf_free(sf);
|
|
|
|
sched_unpin();
|
2013-08-05 08:55:35 +00:00
|
|
|
vm_page_lock(m);
|
|
|
|
vm_page_unhold(m);
|
|
|
|
vm_page_unlock(m);
|
2005-12-16 18:34:14 +00:00
|
|
|
}
|
|
|
|
|
2009-10-21 18:38:02 +00:00
|
|
|
void
|
|
|
|
vm_sync_icache(vm_map_t map, vm_offset_t va, vm_offset_t sz)
|
|
|
|
{
|
|
|
|
|
|
|
|
pmap_sync_icache(map->pmap, va, sz);
|
|
|
|
}
|
|
|
|
|
2011-12-16 10:56:16 +00:00
|
|
|
struct kstack_cache_entry *kstack_cache;
|
2009-09-01 11:41:51 +00:00
|
|
|
static int kstack_cache_size = 128;
|
|
|
|
static int kstacks;
|
|
|
|
static struct mtx kstack_cache_mtx;
|
2012-10-26 17:31:35 +00:00
|
|
|
MTX_SYSINIT(kstack_cache, &kstack_cache_mtx, "kstkch", MTX_DEF);
|
|
|
|
|
2009-09-01 11:41:51 +00:00
|
|
|
SYSCTL_INT(_vm, OID_AUTO, kstack_cache_size, CTLFLAG_RW, &kstack_cache_size, 0,
|
|
|
|
"");
|
|
|
|
SYSCTL_INT(_vm, OID_AUTO, kstacks, CTLFLAG_RD, &kstacks, 0,
|
|
|
|
"");
|
|
|
|
|
2003-06-14 23:23:55 +00:00
|
|
|
#ifndef KSTACK_MAX_PAGES
|
|
|
|
#define KSTACK_MAX_PAGES 32
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Create the kernel stack (including pcb for i386) for a new thread.
|
|
|
|
* This routine directly affects the fork perf for a process and
|
|
|
|
* create performance for a thread.
|
|
|
|
*/
|
2007-11-05 11:36:16 +00:00
|
|
|
int
|
2003-06-14 23:23:55 +00:00
|
|
|
vm_thread_new(struct thread *td, int pages)
|
|
|
|
{
|
|
|
|
vm_object_t ksobj;
|
|
|
|
vm_offset_t ks;
|
|
|
|
vm_page_t m, ma[KSTACK_MAX_PAGES];
|
2009-09-01 11:41:51 +00:00
|
|
|
struct kstack_cache_entry *ks_ce;
|
2003-06-14 23:23:55 +00:00
|
|
|
int i;
|
|
|
|
|
|
|
|
/* Bounds check */
|
|
|
|
if (pages <= 1)
|
|
|
|
pages = KSTACK_PAGES;
|
|
|
|
else if (pages > KSTACK_MAX_PAGES)
|
|
|
|
pages = KSTACK_MAX_PAGES;
|
2009-09-01 11:41:51 +00:00
|
|
|
|
|
|
|
if (pages == KSTACK_PAGES) {
|
|
|
|
mtx_lock(&kstack_cache_mtx);
|
|
|
|
if (kstack_cache != NULL) {
|
|
|
|
ks_ce = kstack_cache;
|
|
|
|
kstack_cache = ks_ce->next_ks_entry;
|
|
|
|
mtx_unlock(&kstack_cache_mtx);
|
|
|
|
|
|
|
|
td->td_kstack_obj = ks_ce->ksobj;
|
|
|
|
td->td_kstack = (vm_offset_t)ks_ce;
|
|
|
|
td->td_kstack_pages = KSTACK_PAGES;
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
mtx_unlock(&kstack_cache_mtx);
|
|
|
|
}
|
|
|
|
|
2003-06-14 23:23:55 +00:00
|
|
|
/*
|
|
|
|
* Allocate an object for the kstack.
|
|
|
|
*/
|
|
|
|
ksobj = vm_object_allocate(OBJT_DEFAULT, pages);
|
2008-03-19 06:19:01 +00:00
|
|
|
|
2003-06-14 23:23:55 +00:00
|
|
|
/*
|
|
|
|
* Get a kernel virtual address for this thread's kstack.
|
|
|
|
*/
|
2010-04-18 22:32:07 +00:00
|
|
|
#if defined(__mips__)
|
|
|
|
/*
|
|
|
|
* We need to align the kstack's mapped address to fit within
|
|
|
|
* a single TLB entry.
|
|
|
|
*/
|
2013-08-07 06:21:20 +00:00
|
|
|
if (vmem_xalloc(kernel_arena, (pages + KSTACK_GUARD_PAGES) * PAGE_SIZE,
|
|
|
|
PAGE_SIZE * 2, 0, 0, VMEM_ADDR_MIN, VMEM_ADDR_MAX,
|
|
|
|
M_BESTFIT | M_NOWAIT, &ks)) {
|
|
|
|
ks = 0;
|
|
|
|
}
|
2010-04-18 22:32:07 +00:00
|
|
|
#else
|
2013-08-07 06:21:20 +00:00
|
|
|
ks = kva_alloc((pages + KSTACK_GUARD_PAGES) * PAGE_SIZE);
|
2010-04-18 22:32:07 +00:00
|
|
|
#endif
|
2007-11-05 11:36:16 +00:00
|
|
|
if (ks == 0) {
|
|
|
|
printf("vm_thread_new: kstack allocation failed\n");
|
|
|
|
vm_object_deallocate(ksobj);
|
|
|
|
return (0);
|
|
|
|
}
|
2009-09-01 11:41:51 +00:00
|
|
|
|
|
|
|
atomic_add_int(&kstacks, 1);
|
2003-06-14 23:23:55 +00:00
|
|
|
if (KSTACK_GUARD_PAGES != 0) {
|
|
|
|
pmap_qremove(ks, KSTACK_GUARD_PAGES);
|
|
|
|
ks += KSTACK_GUARD_PAGES * PAGE_SIZE;
|
|
|
|
}
|
2007-11-05 11:36:16 +00:00
|
|
|
td->td_kstack_obj = ksobj;
|
2003-06-14 23:23:55 +00:00
|
|
|
td->td_kstack = ks;
|
|
|
|
/*
|
|
|
|
* Knowing the number of pages allocated is useful when you
|
|
|
|
* want to deallocate them.
|
|
|
|
*/
|
|
|
|
td->td_kstack_pages = pages;
|
|
|
|
/*
|
|
|
|
* For the length of the stack, link in a real page of ram for each
|
|
|
|
* page of stack.
|
|
|
|
*/
|
2013-02-20 12:03:20 +00:00
|
|
|
VM_OBJECT_WLOCK(ksobj);
|
2003-06-14 23:23:55 +00:00
|
|
|
for (i = 0; i < pages; i++) {
|
|
|
|
/*
|
|
|
|
* Get a kernel stack page.
|
|
|
|
*/
|
2004-10-24 18:46:32 +00:00
|
|
|
m = vm_page_grab(ksobj, i, VM_ALLOC_NOBUSY |
|
2013-08-22 07:39:53 +00:00
|
|
|
VM_ALLOC_NORMAL | VM_ALLOC_WIRED);
|
2003-06-14 23:23:55 +00:00
|
|
|
ma[i] = m;
|
|
|
|
m->valid = VM_PAGE_BITS_ALL;
|
|
|
|
}
|
2013-02-20 12:03:20 +00:00
|
|
|
VM_OBJECT_WUNLOCK(ksobj);
|
2003-06-14 23:23:55 +00:00
|
|
|
pmap_qenter(ks, ma, pages);
|
2007-11-05 11:36:16 +00:00
|
|
|
return (1);
|
2003-06-14 23:23:55 +00:00
|
|
|
}
|
|
|
|
|
2009-09-01 11:41:51 +00:00
|
|
|
static void
|
|
|
|
vm_thread_stack_dispose(vm_object_t ksobj, vm_offset_t ks, int pages)
|
2003-06-14 23:23:55 +00:00
|
|
|
{
|
|
|
|
vm_page_t m;
|
2009-09-01 11:41:51 +00:00
|
|
|
int i;
|
2003-06-14 23:23:55 +00:00
|
|
|
|
2009-09-01 11:41:51 +00:00
|
|
|
atomic_add_int(&kstacks, -1);
|
2003-06-14 23:23:55 +00:00
|
|
|
pmap_qremove(ks, pages);
|
2013-02-20 12:03:20 +00:00
|
|
|
VM_OBJECT_WLOCK(ksobj);
|
2003-06-14 23:23:55 +00:00
|
|
|
for (i = 0; i < pages; i++) {
|
|
|
|
m = vm_page_lookup(ksobj, i);
|
|
|
|
if (m == NULL)
|
|
|
|
panic("vm_thread_dispose: kstack already missing?");
|
2010-04-30 00:46:43 +00:00
|
|
|
vm_page_lock(m);
|
2014-06-16 18:15:27 +00:00
|
|
|
vm_page_unwire(m, PQ_INACTIVE);
|
2003-06-14 23:23:55 +00:00
|
|
|
vm_page_free(m);
|
2010-04-30 00:46:43 +00:00
|
|
|
vm_page_unlock(m);
|
2003-06-14 23:23:55 +00:00
|
|
|
}
|
2013-02-20 12:03:20 +00:00
|
|
|
VM_OBJECT_WUNLOCK(ksobj);
|
2003-06-14 23:23:55 +00:00
|
|
|
vm_object_deallocate(ksobj);
|
2013-08-07 06:21:20 +00:00
|
|
|
kva_free(ks - (KSTACK_GUARD_PAGES * PAGE_SIZE),
|
2003-06-14 23:23:55 +00:00
|
|
|
(pages + KSTACK_GUARD_PAGES) * PAGE_SIZE);
|
2009-09-01 11:41:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Dispose of a thread's kernel stack.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
vm_thread_dispose(struct thread *td)
|
|
|
|
{
|
|
|
|
vm_object_t ksobj;
|
|
|
|
vm_offset_t ks;
|
|
|
|
struct kstack_cache_entry *ks_ce;
|
|
|
|
int pages;
|
|
|
|
|
|
|
|
pages = td->td_kstack_pages;
|
|
|
|
ksobj = td->td_kstack_obj;
|
|
|
|
ks = td->td_kstack;
|
2007-11-05 11:36:16 +00:00
|
|
|
td->td_kstack = 0;
|
2009-09-01 11:41:51 +00:00
|
|
|
td->td_kstack_pages = 0;
|
|
|
|
if (pages == KSTACK_PAGES && kstacks <= kstack_cache_size) {
|
|
|
|
ks_ce = (struct kstack_cache_entry *)ks;
|
|
|
|
ks_ce->ksobj = ksobj;
|
|
|
|
mtx_lock(&kstack_cache_mtx);
|
|
|
|
ks_ce->next_ks_entry = kstack_cache;
|
|
|
|
kstack_cache = ks_ce;
|
|
|
|
mtx_unlock(&kstack_cache_mtx);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
vm_thread_stack_dispose(ksobj, ks, pages);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
vm_thread_stack_lowmem(void *nulll)
|
|
|
|
{
|
|
|
|
struct kstack_cache_entry *ks_ce, *ks_ce1;
|
|
|
|
|
|
|
|
mtx_lock(&kstack_cache_mtx);
|
|
|
|
ks_ce = kstack_cache;
|
|
|
|
kstack_cache = NULL;
|
|
|
|
mtx_unlock(&kstack_cache_mtx);
|
|
|
|
|
|
|
|
while (ks_ce != NULL) {
|
|
|
|
ks_ce1 = ks_ce;
|
|
|
|
ks_ce = ks_ce->next_ks_entry;
|
|
|
|
|
|
|
|
vm_thread_stack_dispose(ks_ce1->ksobj, (vm_offset_t)ks_ce1,
|
|
|
|
KSTACK_PAGES);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
kstack_cache_init(void *nulll)
|
|
|
|
{
|
|
|
|
|
|
|
|
EVENTHANDLER_REGISTER(vm_lowmem, vm_thread_stack_lowmem, NULL,
|
|
|
|
EVENTHANDLER_PRI_ANY);
|
2003-06-14 23:23:55 +00:00
|
|
|
}
|
|
|
|
|
2009-09-01 11:41:51 +00:00
|
|
|
SYSINIT(vm_kstacks, SI_SUB_KTHREAD_INIT, SI_ORDER_ANY, kstack_cache_init, NULL);
|
|
|
|
|
2014-10-04 18:38:14 +00:00
|
|
|
#ifdef KSTACK_USAGE_PROF
|
|
|
|
/*
|
|
|
|
* Track maximum stack used by a thread in kernel.
|
|
|
|
*/
|
|
|
|
static int max_kstack_used;
|
|
|
|
|
|
|
|
SYSCTL_INT(_debug, OID_AUTO, max_kstack_used, CTLFLAG_RD,
|
|
|
|
&max_kstack_used, 0,
|
|
|
|
"Maxiumum stack depth used by a thread in kernel");
|
|
|
|
|
|
|
|
void
|
|
|
|
intr_prof_stack_use(struct thread *td, struct trapframe *frame)
|
|
|
|
{
|
|
|
|
vm_offset_t stack_top;
|
|
|
|
vm_offset_t current;
|
|
|
|
int used, prev_used;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Testing for interrupted kernel mode isn't strictly
|
|
|
|
* needed. It optimizes the execution, since interrupts from
|
|
|
|
* usermode will have only the trap frame on the stack.
|
|
|
|
*/
|
|
|
|
if (TRAPF_USERMODE(frame))
|
|
|
|
return;
|
|
|
|
|
|
|
|
stack_top = td->td_kstack + td->td_kstack_pages * PAGE_SIZE;
|
|
|
|
current = (vm_offset_t)(uintptr_t)&stack_top;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Try to detect if interrupt is using kernel thread stack.
|
|
|
|
* Hardware could use a dedicated stack for interrupt handling.
|
|
|
|
*/
|
|
|
|
if (stack_top <= current || current < td->td_kstack)
|
|
|
|
return;
|
|
|
|
|
|
|
|
used = stack_top - current;
|
|
|
|
for (;;) {
|
|
|
|
prev_used = max_kstack_used;
|
|
|
|
if (prev_used >= used)
|
|
|
|
break;
|
|
|
|
if (atomic_cmpset_int(&max_kstack_used, prev_used, used))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* KSTACK_USAGE_PROF */
|
|
|
|
|
2010-04-11 16:26:07 +00:00
|
|
|
#ifndef NO_SWAPPING
|
2003-06-14 23:23:55 +00:00
|
|
|
/*
|
|
|
|
* Allow a thread's kernel stack to be paged out.
|
|
|
|
*/
|
2010-04-11 16:26:07 +00:00
|
|
|
static void
|
2003-06-14 23:23:55 +00:00
|
|
|
vm_thread_swapout(struct thread *td)
|
|
|
|
{
|
|
|
|
vm_object_t ksobj;
|
|
|
|
vm_page_t m;
|
|
|
|
int i, pages;
|
|
|
|
|
2003-08-16 23:15:15 +00:00
|
|
|
cpu_thread_swapout(td);
|
2003-06-14 23:23:55 +00:00
|
|
|
pages = td->td_kstack_pages;
|
|
|
|
ksobj = td->td_kstack_obj;
|
|
|
|
pmap_qremove(td->td_kstack, pages);
|
2013-02-20 12:03:20 +00:00
|
|
|
VM_OBJECT_WLOCK(ksobj);
|
2003-06-14 23:23:55 +00:00
|
|
|
for (i = 0; i < pages; i++) {
|
|
|
|
m = vm_page_lookup(ksobj, i);
|
|
|
|
if (m == NULL)
|
|
|
|
panic("vm_thread_swapout: kstack already missing?");
|
|
|
|
vm_page_dirty(m);
|
2010-04-30 00:46:43 +00:00
|
|
|
vm_page_lock(m);
|
2014-06-16 18:15:27 +00:00
|
|
|
vm_page_unwire(m, PQ_INACTIVE);
|
2010-04-30 00:46:43 +00:00
|
|
|
vm_page_unlock(m);
|
2003-06-14 23:23:55 +00:00
|
|
|
}
|
2013-02-20 12:03:20 +00:00
|
|
|
VM_OBJECT_WUNLOCK(ksobj);
|
2003-06-14 23:23:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Bring the kernel stack for a specified thread back in.
|
|
|
|
*/
|
2010-04-11 16:26:07 +00:00
|
|
|
static void
|
2003-06-14 23:23:55 +00:00
|
|
|
vm_thread_swapin(struct thread *td)
|
|
|
|
{
|
|
|
|
vm_object_t ksobj;
|
2010-04-29 09:59:16 +00:00
|
|
|
vm_page_t ma[KSTACK_MAX_PAGES];
|
|
|
|
int i, j, k, pages, rv;
|
2003-06-14 23:23:55 +00:00
|
|
|
|
|
|
|
pages = td->td_kstack_pages;
|
|
|
|
ksobj = td->td_kstack_obj;
|
2013-02-20 12:03:20 +00:00
|
|
|
VM_OBJECT_WLOCK(ksobj);
|
2010-04-29 09:59:16 +00:00
|
|
|
for (i = 0; i < pages; i++)
|
2013-08-22 07:39:53 +00:00
|
|
|
ma[i] = vm_page_grab(ksobj, i, VM_ALLOC_NORMAL |
|
2010-04-13 06:48:37 +00:00
|
|
|
VM_ALLOC_WIRED);
|
2010-04-29 09:59:16 +00:00
|
|
|
for (i = 0; i < pages; i++) {
|
|
|
|
if (ma[i]->valid != VM_PAGE_BITS_ALL) {
|
2013-08-09 11:11:11 +00:00
|
|
|
vm_page_assert_xbusied(ma[i]);
|
2010-04-29 09:59:16 +00:00
|
|
|
vm_object_pip_add(ksobj, 1);
|
|
|
|
for (j = i + 1; j < pages; j++) {
|
2013-08-09 11:11:11 +00:00
|
|
|
if (ma[j]->valid != VM_PAGE_BITS_ALL)
|
|
|
|
vm_page_assert_xbusied(ma[j]);
|
2010-04-29 09:59:16 +00:00
|
|
|
if (ma[j]->valid == VM_PAGE_BITS_ALL)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
rv = vm_pager_get_pages(ksobj, ma + i, j - i, 0);
|
2003-06-14 23:23:55 +00:00
|
|
|
if (rv != VM_PAGER_OK)
|
2010-04-29 09:59:16 +00:00
|
|
|
panic("vm_thread_swapin: cannot get kstack for proc: %d",
|
|
|
|
td->td_proc->p_pid);
|
|
|
|
vm_object_pip_wakeup(ksobj);
|
|
|
|
for (k = i; k < j; k++)
|
|
|
|
ma[k] = vm_page_lookup(ksobj, k);
|
2013-08-09 11:11:11 +00:00
|
|
|
vm_page_xunbusy(ma[i]);
|
|
|
|
} else if (vm_page_xbusied(ma[i]))
|
|
|
|
vm_page_xunbusy(ma[i]);
|
2003-06-14 23:23:55 +00:00
|
|
|
}
|
2013-02-20 12:03:20 +00:00
|
|
|
VM_OBJECT_WUNLOCK(ksobj);
|
2003-06-14 23:23:55 +00:00
|
|
|
pmap_qenter(td->td_kstack, ma, pages);
|
2003-08-16 23:15:15 +00:00
|
|
|
cpu_thread_swapin(td);
|
2003-06-14 23:23:55 +00:00
|
|
|
}
|
2010-04-11 16:26:07 +00:00
|
|
|
#endif /* !NO_SWAPPING */
|
2003-06-14 23:23:55 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Implement fork's actions on an address space.
|
|
|
|
* Here we arrange for the address space to be copied or referenced,
|
|
|
|
* allocate a user struct (pcb and kernel stack), then call the
|
|
|
|
* machine-dependent layer to fill those in and make the new process
|
1997-04-07 07:16:06 +00:00
|
|
|
* ready to run. The new process is set up so that it returns directly
|
|
|
|
* to user mode to avoid stack copying and relocation problems.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
2007-11-05 11:36:16 +00:00
|
|
|
int
|
|
|
|
vm_forkproc(td, p2, td2, vm2, flags)
|
2001-09-12 08:38:13 +00:00
|
|
|
struct thread *td;
|
|
|
|
struct proc *p2;
|
2002-02-07 20:58:47 +00:00
|
|
|
struct thread *td2;
|
2007-11-05 11:36:16 +00:00
|
|
|
struct vmspace *vm2;
|
1997-04-07 07:16:06 +00:00
|
|
|
int flags;
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
2001-09-12 08:38:13 +00:00
|
|
|
struct proc *p1 = td->td_proc;
|
2007-11-05 11:36:16 +00:00
|
|
|
int error;
|
1994-05-25 09:21:21 +00:00
|
|
|
|
1999-12-06 04:53:08 +00:00
|
|
|
if ((flags & RFPROC) == 0) {
|
|
|
|
/*
|
|
|
|
* Divorce the memory, if it is shared, essentially
|
|
|
|
* this changes shared memory amongst threads, into
|
|
|
|
* COW locally.
|
|
|
|
*/
|
|
|
|
if ((flags & RFMEM) == 0) {
|
|
|
|
if (p1->p_vmspace->vm_refcnt > 1) {
|
2007-11-05 11:36:16 +00:00
|
|
|
error = vmspace_unshare(p1);
|
|
|
|
if (error)
|
|
|
|
return (error);
|
1999-12-06 04:53:08 +00:00
|
|
|
}
|
|
|
|
}
|
2002-02-07 20:58:47 +00:00
|
|
|
cpu_fork(td, p2, td2, flags);
|
2007-11-05 11:36:16 +00:00
|
|
|
return (0);
|
1999-12-06 04:53:08 +00:00
|
|
|
}
|
|
|
|
|
1997-04-13 01:48:35 +00:00
|
|
|
if (flags & RFMEM) {
|
|
|
|
p2->p_vmspace = p1->p_vmspace;
|
2004-07-27 03:53:41 +00:00
|
|
|
atomic_add_int(&p1->p_vmspace->vm_refcnt, 1);
|
1997-04-13 01:48:35 +00:00
|
|
|
}
|
|
|
|
|
1999-09-17 04:56:40 +00:00
|
|
|
while (vm_page_count_severe()) {
|
1994-05-25 09:21:21 +00:00
|
|
|
VM_WAIT;
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
|
1997-04-13 01:48:35 +00:00
|
|
|
if ((flags & RFMEM) == 0) {
|
2007-11-05 11:36:16 +00:00
|
|
|
p2->p_vmspace = vm2;
|
1997-04-07 07:16:06 +00:00
|
|
|
if (p1->p_vmspace->vm_shm)
|
|
|
|
shmfork(p1, p2);
|
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
/*
|
1997-04-07 07:16:06 +00:00
|
|
|
* cpu_fork will copy and update the pcb, set up the kernel stack,
|
|
|
|
* and make the child ready to run.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
2002-02-07 20:58:47 +00:00
|
|
|
cpu_fork(td, p2, td2, flags);
|
2007-11-05 11:36:16 +00:00
|
|
|
return (0);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2001-09-10 04:28:58 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Called after process has been wait(2)'ed apon and is being reaped.
|
|
|
|
* The idea is to reclaim resources that we could not reclaim while
|
|
|
|
* the process was still executing.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
vm_waitproc(p)
|
|
|
|
struct proc *p;
|
|
|
|
{
|
|
|
|
|
2002-02-05 21:23:05 +00:00
|
|
|
vmspace_exitfree(p); /* and clean-out the vmspace */
|
2001-09-10 04:28:58 +00:00
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
|
1994-05-25 09:21:21 +00:00
|
|
|
void
|
|
|
|
faultin(p)
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
struct proc *p;
|
1994-05-25 09:21:21 +00:00
|
|
|
{
|
2003-04-23 18:21:41 +00:00
|
|
|
#ifdef NO_SWAPPING
|
1994-05-25 09:21:21 +00:00
|
|
|
|
2001-05-15 22:20:44 +00:00
|
|
|
PROC_LOCK_ASSERT(p, MA_OWNED);
|
2007-09-17 05:31:39 +00:00
|
|
|
if ((p->p_flag & P_INMEM) == 0)
|
2002-07-07 23:05:27 +00:00
|
|
|
panic("faultin: proc swapped out with NO_SWAPPING!");
|
2003-04-23 18:21:41 +00:00
|
|
|
#else /* !NO_SWAPPING */
|
|
|
|
struct thread *td;
|
|
|
|
|
|
|
|
PROC_LOCK_ASSERT(p, MA_OWNED);
|
2003-04-22 20:00:26 +00:00
|
|
|
/*
|
|
|
|
* If another process is swapping in this process,
|
|
|
|
* just wait until it finishes.
|
|
|
|
*/
|
2007-09-17 05:31:39 +00:00
|
|
|
if (p->p_flag & P_SWAPPINGIN) {
|
|
|
|
while (p->p_flag & P_SWAPPINGIN)
|
|
|
|
msleep(&p->p_flag, &p->p_mtx, PVM, "faultin", 0);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if ((p->p_flag & P_INMEM) == 0) {
|
2002-07-29 18:33:32 +00:00
|
|
|
/*
|
2003-04-22 20:00:26 +00:00
|
|
|
* Don't let another thread swap process p out while we are
|
|
|
|
* busy swapping it in.
|
2002-07-29 18:33:32 +00:00
|
|
|
*/
|
2003-04-22 20:00:26 +00:00
|
|
|
++p->p_lock;
|
2007-09-17 05:31:39 +00:00
|
|
|
p->p_flag |= P_SWAPPINGIN;
|
2001-01-25 01:38:09 +00:00
|
|
|
PROC_UNLOCK(p);
|
1994-05-25 09:21:21 +00:00
|
|
|
|
2007-09-17 05:31:39 +00:00
|
|
|
/*
|
|
|
|
* We hold no lock here because the list of threads
|
|
|
|
* can not change while all threads in the process are
|
|
|
|
* swapped out.
|
|
|
|
*/
|
2003-04-22 20:00:26 +00:00
|
|
|
FOREACH_THREAD_IN_PROC(p, td)
|
2003-06-14 23:23:55 +00:00
|
|
|
vm_thread_swapin(td);
|
2001-01-25 01:38:09 +00:00
|
|
|
PROC_LOCK(p);
|
2007-09-17 05:31:39 +00:00
|
|
|
swapclear(p);
|
2007-09-21 05:07:07 +00:00
|
|
|
p->p_swtick = ticks;
|
1994-05-25 09:21:21 +00:00
|
|
|
|
2007-09-17 05:31:39 +00:00
|
|
|
wakeup(&p->p_flag);
|
1994-05-25 09:21:21 +00:00
|
|
|
|
2003-04-22 20:00:26 +00:00
|
|
|
/* Allow other threads to swap p out now. */
|
1994-05-25 09:21:21 +00:00
|
|
|
--p->p_lock;
|
|
|
|
}
|
2003-04-23 18:21:41 +00:00
|
|
|
#endif /* NO_SWAPPING */
|
1994-05-25 09:21:21 +00:00
|
|
|
}
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
1994-05-25 09:21:21 +00:00
|
|
|
* This swapin algorithm attempts to swap-in processes only if there
|
|
|
|
* is enough space for them. Of course, if a process waits for a long
|
|
|
|
* time, it will be swapped in anyway.
|
2000-09-07 01:33:02 +00:00
|
|
|
*
|
2005-05-22 21:06:07 +00:00
|
|
|
* Giant is held on entry.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
2013-07-24 09:45:31 +00:00
|
|
|
void
|
|
|
|
swapper(void)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
2001-07-04 19:00:13 +00:00
|
|
|
struct proc *p;
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
struct thread *td;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct proc *pp;
|
2007-09-21 05:07:07 +00:00
|
|
|
int slptime;
|
|
|
|
int swtime;
|
1994-05-24 10:09:53 +00:00
|
|
|
int ppri;
|
2007-09-21 05:07:07 +00:00
|
|
|
int pri;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
loop:
|
1999-09-17 04:56:40 +00:00
|
|
|
if (vm_page_count_min()) {
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
VM_WAIT;
|
1999-09-17 04:56:40 +00:00
|
|
|
goto loop;
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
}
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
pp = NULL;
|
|
|
|
ppri = INT_MIN;
|
2001-03-28 11:52:56 +00:00
|
|
|
sx_slock(&allproc_lock);
|
2001-09-12 08:38:13 +00:00
|
|
|
FOREACH_PROC_IN_SYSTEM(p) {
|
2007-09-17 05:31:39 +00:00
|
|
|
PROC_LOCK(p);
|
2011-04-06 17:47:22 +00:00
|
|
|
if (p->p_state == PRS_NEW ||
|
|
|
|
p->p_flag & (P_SWAPPINGOUT | P_SWAPPINGIN | P_INMEM)) {
|
2007-09-17 05:31:39 +00:00
|
|
|
PROC_UNLOCK(p);
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
continue;
|
|
|
|
}
|
2007-09-21 05:07:07 +00:00
|
|
|
swtime = (ticks - p->p_swtick) / hz;
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
FOREACH_THREAD_IN_PROC(p, td) {
|
2002-07-29 18:33:32 +00:00
|
|
|
/*
|
2002-09-11 08:13:56 +00:00
|
|
|
* An otherwise runnable thread of a process
|
|
|
|
* swapped out has only the TDI_SWAPPED bit set.
|
|
|
|
*
|
2002-07-29 18:33:32 +00:00
|
|
|
*/
|
Commit 14/14 of sched_lock decomposition.
- Use thread_lock() rather than sched_lock for per-thread scheduling
sychronization.
- Use the per-process spinlock rather than the sched_lock for per-process
scheduling synchronization.
Tested by: kris, current@
Tested on: i386, amd64, ULE, 4BSD, libthr, libkse, PREEMPTION, etc.
Discussed with: kris, attilio, kmacy, jhb, julian, bde (small parts each)
2007-06-05 00:00:57 +00:00
|
|
|
thread_lock(td);
|
2002-09-11 08:13:56 +00:00
|
|
|
if (td->td_inhibitors == TDI_SWAPPED) {
|
2007-09-21 05:07:07 +00:00
|
|
|
slptime = (ticks - td->td_slptick) / hz;
|
|
|
|
pri = swtime + slptime;
|
2007-09-17 05:31:39 +00:00
|
|
|
if ((td->td_flags & TDF_SWAPINREQ) == 0)
|
2004-06-16 00:26:31 +00:00
|
|
|
pri -= p->p_nice * 8;
|
2001-09-12 08:38:13 +00:00
|
|
|
/*
|
2006-12-06 06:34:57 +00:00
|
|
|
* if this thread is higher priority
|
2001-09-12 08:38:13 +00:00
|
|
|
* and there is enough space, then select
|
|
|
|
* this process instead of the previous
|
|
|
|
* selection.
|
|
|
|
*/
|
|
|
|
if (pri > ppri) {
|
|
|
|
pp = p;
|
|
|
|
ppri = pri;
|
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
Commit 14/14 of sched_lock decomposition.
- Use thread_lock() rather than sched_lock for per-thread scheduling
sychronization.
- Use the per-process spinlock rather than the sched_lock for per-process
scheduling synchronization.
Tested by: kris, current@
Tested on: i386, amd64, ULE, 4BSD, libthr, libkse, PREEMPTION, etc.
Discussed with: kris, attilio, kmacy, jhb, julian, bde (small parts each)
2007-06-05 00:00:57 +00:00
|
|
|
thread_unlock(td);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2007-09-17 05:31:39 +00:00
|
|
|
PROC_UNLOCK(p);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2001-03-28 11:52:56 +00:00
|
|
|
sx_sunlock(&allproc_lock);
|
1994-05-25 09:21:21 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
1996-10-17 02:58:20 +00:00
|
|
|
* Nothing to do, back to sleep.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
if ((p = pp) == NULL) {
|
2013-07-24 09:45:31 +00:00
|
|
|
tsleep(&proc0, PVM, "swapin", MAXSLP * hz / 2);
|
1994-05-24 10:09:53 +00:00
|
|
|
goto loop;
|
|
|
|
}
|
2002-07-29 18:33:32 +00:00
|
|
|
PROC_LOCK(p);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Another process may be bringing or may have already
|
|
|
|
* brought this process in while we traverse all threads.
|
|
|
|
* Or, this process may even be being swapped out again.
|
|
|
|
*/
|
2007-09-17 05:31:39 +00:00
|
|
|
if (p->p_flag & (P_INMEM | P_SWAPPINGOUT | P_SWAPPINGIN)) {
|
2002-07-29 18:33:32 +00:00
|
|
|
PROC_UNLOCK(p);
|
|
|
|
goto loop;
|
|
|
|
}
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
1994-05-25 09:21:21 +00:00
|
|
|
* We would like to bring someone in. (only if there is space).
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
* [What checks the space? ]
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
faultin(p);
|
2001-01-25 01:38:09 +00:00
|
|
|
PROC_UNLOCK(p);
|
1994-05-24 10:09:53 +00:00
|
|
|
goto loop;
|
|
|
|
}
|
|
|
|
|
If a thread that is swapped out is made runnable, then the setrunnable()
routine wakes up proc0 so that proc0 can swap the thread back in.
Historically, this has been done by waking up proc0 directly from
setrunnable() itself via a wakeup(). When waking up a sleeping thread
that was swapped out (the usual case when waking proc0 since only sleeping
threads are eligible to be swapped out), this resulted in a bit of
recursion (e.g. wakeup() -> setrunnable() -> wakeup()).
With sleep queues having separate locks in 6.x and later, this caused a
spin lock LOR (sleepq lock -> sched_lock/thread lock -> sleepq lock).
An attempt was made to fix this in 7.0 by making the proc0 wakeup use
the ithread mechanism for doing the wakeup. However, this required
grabbing proc0's thread lock to perform the wakeup. If proc0 was asleep
elsewhere in the kernel (e.g. waiting for disk I/O), then this degenerated
into the same LOR since the thread lock would be some other sleepq lock.
Fix this by deferring the wakeup of the swapper until after the sleepq
lock held by the upper layer has been locked. The setrunnable() routine
now returns a boolean value to indicate whether or not proc0 needs to be
woken up. The end result is that consumers of the sleepq API such as
*sleep/wakeup, condition variables, sx locks, and lockmgr, have to wakeup
proc0 if they get a non-zero return value from sleepq_abort(),
sleepq_broadcast(), or sleepq_signal().
Discussed with: jeff
Glanced at by: sam
Tested by: Jurgen Weber jurgen - ish com au
MFC after: 2 weeks
2008-08-05 20:02:31 +00:00
|
|
|
void
|
|
|
|
kick_proc0(void)
|
2005-05-23 23:01:53 +00:00
|
|
|
{
|
|
|
|
|
If a thread that is swapped out is made runnable, then the setrunnable()
routine wakes up proc0 so that proc0 can swap the thread back in.
Historically, this has been done by waking up proc0 directly from
setrunnable() itself via a wakeup(). When waking up a sleeping thread
that was swapped out (the usual case when waking proc0 since only sleeping
threads are eligible to be swapped out), this resulted in a bit of
recursion (e.g. wakeup() -> setrunnable() -> wakeup()).
With sleep queues having separate locks in 6.x and later, this caused a
spin lock LOR (sleepq lock -> sched_lock/thread lock -> sleepq lock).
An attempt was made to fix this in 7.0 by making the proc0 wakeup use
the ithread mechanism for doing the wakeup. However, this required
grabbing proc0's thread lock to perform the wakeup. If proc0 was asleep
elsewhere in the kernel (e.g. waiting for disk I/O), then this degenerated
into the same LOR since the thread lock would be some other sleepq lock.
Fix this by deferring the wakeup of the swapper until after the sleepq
lock held by the upper layer has been locked. The setrunnable() routine
now returns a boolean value to indicate whether or not proc0 needs to be
woken up. The end result is that consumers of the sleepq API such as
*sleep/wakeup, condition variables, sx locks, and lockmgr, have to wakeup
proc0 if they get a non-zero return value from sleepq_abort(),
sleepq_broadcast(), or sleepq_signal().
Discussed with: jeff
Glanced at by: sam
Tested by: Jurgen Weber jurgen - ish com au
MFC after: 2 weeks
2008-08-05 20:02:31 +00:00
|
|
|
wakeup(&proc0);
|
|
|
|
}
|
2005-05-23 23:01:53 +00:00
|
|
|
|
1996-02-22 10:57:37 +00:00
|
|
|
#ifndef NO_SWAPPING
|
|
|
|
|
1997-12-06 02:23:36 +00:00
|
|
|
/*
|
|
|
|
* Swap_idle_threshold1 is the guaranteed swapped in time for a process
|
|
|
|
*/
|
1998-02-09 06:11:36 +00:00
|
|
|
static int swap_idle_threshold1 = 2;
|
2003-04-17 15:39:12 +00:00
|
|
|
SYSCTL_INT(_vm, OID_AUTO, swap_idle_threshold1, CTLFLAG_RW,
|
2003-04-17 15:44:22 +00:00
|
|
|
&swap_idle_threshold1, 0, "Guaranteed swapped in time for a process");
|
1997-12-06 02:23:36 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Swap_idle_threshold2 is the time that a process can be idle before
|
|
|
|
* it will be swapped out, if idle swapping is enabled.
|
|
|
|
*/
|
1998-02-09 06:11:36 +00:00
|
|
|
static int swap_idle_threshold2 = 10;
|
2003-04-17 15:39:12 +00:00
|
|
|
SYSCTL_INT(_vm, OID_AUTO, swap_idle_threshold2, CTLFLAG_RW,
|
2003-04-17 15:44:22 +00:00
|
|
|
&swap_idle_threshold2, 0, "Time before a process will be swapped out");
|
1997-12-06 02:23:36 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
2011-01-09 12:50:44 +00:00
|
|
|
* First, if any processes have been sleeping or stopped for at least
|
|
|
|
* "swap_idle_threshold1" seconds, they are swapped out. If, however,
|
|
|
|
* no such processes exist, then the longest-sleeping or stopped
|
|
|
|
* process is swapped out. Finally, and only as a last resort, if
|
|
|
|
* there are no sleeping or stopped processes, the longest-resident
|
|
|
|
* process is swapped out.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
void
|
1997-12-11 02:10:55 +00:00
|
|
|
swapout_procs(action)
|
|
|
|
int action;
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
2001-07-04 19:00:13 +00:00
|
|
|
struct proc *p;
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
struct thread *td;
|
1994-05-24 10:09:53 +00:00
|
|
|
int didswap = 0;
|
|
|
|
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
retry:
|
2001-05-23 22:35:45 +00:00
|
|
|
sx_slock(&allproc_lock);
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
FOREACH_PROC_IN_SYSTEM(p) {
|
1996-05-18 03:38:05 +00:00
|
|
|
struct vmspace *vm;
|
2001-09-12 08:38:13 +00:00
|
|
|
int minslptime = 100000;
|
2007-09-21 05:07:07 +00:00
|
|
|
int slptime;
|
2001-01-24 11:25:56 +00:00
|
|
|
|
2002-07-30 06:54:05 +00:00
|
|
|
/*
|
2002-09-09 09:05:06 +00:00
|
|
|
* Watch out for a process in
|
|
|
|
* creation. It may have no
|
2002-10-22 14:31:32 +00:00
|
|
|
* address space or lock yet.
|
|
|
|
*/
|
2007-09-17 05:31:39 +00:00
|
|
|
if (p->p_state == PRS_NEW)
|
2002-10-22 14:31:32 +00:00
|
|
|
continue;
|
|
|
|
/*
|
2002-09-09 09:05:06 +00:00
|
|
|
* An aio daemon switches its
|
|
|
|
* address space while running.
|
|
|
|
* Perform a quick check whether
|
|
|
|
* a process has P_SYSTEM.
|
2002-07-30 06:54:05 +00:00
|
|
|
*/
|
2003-04-25 20:06:30 +00:00
|
|
|
if ((p->p_flag & P_SYSTEM) != 0)
|
2002-09-09 09:05:06 +00:00
|
|
|
continue;
|
2002-10-22 14:31:32 +00:00
|
|
|
/*
|
|
|
|
* Do not swapout a process that
|
|
|
|
* is waiting for VM data
|
|
|
|
* structures as there is a possible
|
|
|
|
* deadlock. Test this first as
|
|
|
|
* this may block.
|
|
|
|
*
|
|
|
|
* Lock the map until swapout
|
|
|
|
* finishes, or a thread of this
|
|
|
|
* process may attempt to alter
|
|
|
|
* the map.
|
|
|
|
*/
|
2006-05-29 21:28:56 +00:00
|
|
|
vm = vmspace_acquire_ref(p);
|
|
|
|
if (vm == NULL)
|
|
|
|
continue;
|
2002-07-30 06:54:05 +00:00
|
|
|
if (!vm_map_trylock(&vm->vm_map))
|
|
|
|
goto nextproc1;
|
|
|
|
|
2001-01-24 11:25:56 +00:00
|
|
|
PROC_LOCK(p);
|
2001-01-24 12:23:17 +00:00
|
|
|
if (p->p_lock != 0 ||
|
2002-09-05 07:30:18 +00:00
|
|
|
(p->p_flag & (P_STOPPED_SINGLE|P_TRACED|P_SYSTEM|P_WEXIT)
|
|
|
|
) != 0) {
|
2008-03-19 06:19:01 +00:00
|
|
|
goto nextproc;
|
2001-01-24 11:25:56 +00:00
|
|
|
}
|
2001-05-19 01:28:09 +00:00
|
|
|
/*
|
|
|
|
* only aiod changes vmspace, however it will be
|
|
|
|
* skipped because of the if statement above checking
|
|
|
|
* for P_SYSTEM
|
|
|
|
*/
|
2007-09-17 05:31:39 +00:00
|
|
|
if ((p->p_flag & (P_INMEM|P_SWAPPINGOUT|P_SWAPPINGIN)) != P_INMEM)
|
2008-03-19 06:19:01 +00:00
|
|
|
goto nextproc;
|
2001-01-24 12:23:17 +00:00
|
|
|
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
switch (p->p_state) {
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
default:
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
/* Don't swap out processes in any sort
|
|
|
|
* of 'special' state. */
|
2003-04-25 20:06:30 +00:00
|
|
|
break;
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
case PRS_NORMAL:
|
1994-11-13 12:47:07 +00:00
|
|
|
/*
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
* do not swapout a realtime process
|
2001-09-12 08:38:13 +00:00
|
|
|
* Check all the thread groups..
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
*/
|
2006-10-26 21:42:22 +00:00
|
|
|
FOREACH_THREAD_IN_PROC(p, td) {
|
2007-09-17 05:31:39 +00:00
|
|
|
thread_lock(td);
|
|
|
|
if (PRI_IS_REALTIME(td->td_pri_class)) {
|
|
|
|
thread_unlock(td);
|
2001-09-12 08:38:13 +00:00
|
|
|
goto nextproc;
|
2007-09-17 05:31:39 +00:00
|
|
|
}
|
2007-09-21 05:07:07 +00:00
|
|
|
slptime = (ticks - td->td_slptick) / hz;
|
2001-09-12 08:38:13 +00:00
|
|
|
/*
|
2002-07-30 06:54:05 +00:00
|
|
|
* Guarantee swap_idle_threshold1
|
2001-09-12 08:38:13 +00:00
|
|
|
* time in memory.
|
|
|
|
*/
|
2007-09-21 05:07:07 +00:00
|
|
|
if (slptime < swap_idle_threshold1) {
|
2007-09-17 05:31:39 +00:00
|
|
|
thread_unlock(td);
|
2001-09-12 08:38:13 +00:00
|
|
|
goto nextproc;
|
2007-09-17 05:31:39 +00:00
|
|
|
}
|
2002-07-30 06:54:05 +00:00
|
|
|
|
2002-07-29 18:33:32 +00:00
|
|
|
/*
|
2002-07-30 06:54:05 +00:00
|
|
|
* Do not swapout a process if it is
|
|
|
|
* waiting on a critical event of some
|
|
|
|
* kind or there is a thread whose
|
|
|
|
* pageable memory may be accessed.
|
2002-07-29 18:33:32 +00:00
|
|
|
*
|
|
|
|
* This could be refined to support
|
|
|
|
* swapping out a thread.
|
|
|
|
*/
|
2008-03-12 06:31:06 +00:00
|
|
|
if (!thread_safetoswapout(td)) {
|
2007-09-17 05:31:39 +00:00
|
|
|
thread_unlock(td);
|
2006-10-26 21:42:22 +00:00
|
|
|
goto nextproc;
|
2007-09-17 05:31:39 +00:00
|
|
|
}
|
2001-09-12 08:38:13 +00:00
|
|
|
/*
|
|
|
|
* If the system is under memory stress,
|
|
|
|
* or if we are swapping
|
|
|
|
* idle processes >= swap_idle_threshold2,
|
|
|
|
* then swap the process out.
|
|
|
|
*/
|
|
|
|
if (((action & VM_SWAP_NORMAL) == 0) &&
|
|
|
|
(((action & VM_SWAP_IDLE) == 0) ||
|
2007-09-21 05:07:07 +00:00
|
|
|
(slptime < swap_idle_threshold2))) {
|
2007-09-17 05:31:39 +00:00
|
|
|
thread_unlock(td);
|
2001-09-12 08:38:13 +00:00
|
|
|
goto nextproc;
|
2007-09-17 05:31:39 +00:00
|
|
|
}
|
2002-07-30 06:54:05 +00:00
|
|
|
|
2007-09-21 05:07:07 +00:00
|
|
|
if (minslptime > slptime)
|
|
|
|
minslptime = slptime;
|
2007-09-17 05:31:39 +00:00
|
|
|
thread_unlock(td);
|
2000-12-02 03:29:33 +00:00
|
|
|
}
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
|
1994-09-12 15:06:14 +00:00
|
|
|
/*
|
2004-06-27 01:58:12 +00:00
|
|
|
* If the pageout daemon didn't free enough pages,
|
|
|
|
* or if this process is idle and the system is
|
|
|
|
* configured to swap proactively, swap it out.
|
1994-09-12 15:06:14 +00:00
|
|
|
*/
|
1997-12-06 02:23:36 +00:00
|
|
|
if ((action & VM_SWAP_NORMAL) ||
|
|
|
|
((action & VM_SWAP_IDLE) &&
|
2001-09-12 08:38:13 +00:00
|
|
|
(minslptime > swap_idle_threshold2))) {
|
2007-09-17 05:31:39 +00:00
|
|
|
if (swapout(p) == 0)
|
|
|
|
didswap++;
|
2003-04-22 20:00:26 +00:00
|
|
|
PROC_UNLOCK(p);
|
2002-07-30 06:54:05 +00:00
|
|
|
vm_map_unlock(&vm->vm_map);
|
|
|
|
vmspace_free(vm);
|
|
|
|
sx_sunlock(&allproc_lock);
|
1997-12-06 02:23:36 +00:00
|
|
|
goto retry;
|
2001-05-15 22:20:44 +00:00
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2008-03-19 06:19:01 +00:00
|
|
|
nextproc:
|
2002-07-30 06:54:05 +00:00
|
|
|
PROC_UNLOCK(p);
|
|
|
|
vm_map_unlock(&vm->vm_map);
|
|
|
|
nextproc1:
|
|
|
|
vmspace_free(vm);
|
2002-03-19 11:02:06 +00:00
|
|
|
continue;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2001-03-28 11:52:56 +00:00
|
|
|
sx_sunlock(&allproc_lock);
|
1994-05-25 09:21:21 +00:00
|
|
|
/*
|
|
|
|
* If we swapped something out, and another process needed memory,
|
|
|
|
* then wakeup the sched process.
|
|
|
|
*/
|
These changes embody the support of the fully coherent merged VM buffer cache,
much higher filesystem I/O performance, and much better paging performance. It
represents the culmination of over 6 months of R&D.
The majority of the merged VM/cache work is by John Dyson.
The following highlights the most significant changes. Additionally, there are
(mostly minor) changes to the various filesystem modules (nfs, msdosfs, etc) to
support the new VM/buffer scheme.
vfs_bio.c:
Significant rewrite of most of vfs_bio to support the merged VM buffer cache
scheme. The scheme is almost fully compatible with the old filesystem
interface. Significant improvement in the number of opportunities for write
clustering.
vfs_cluster.c, vfs_subr.c
Upgrade and performance enhancements in vfs layer code to support merged
VM/buffer cache. Fixup of vfs_cluster to eliminate the bogus pagemove stuff.
vm_object.c:
Yet more improvements in the collapse code. Elimination of some windows that
can cause list corruption.
vm_pageout.c:
Fixed it, it really works better now. Somehow in 2.0, some "enhancements"
broke the code. This code has been reworked from the ground-up.
vm_fault.c, vm_page.c, pmap.c, vm_object.c
Support for small-block filesystems with merged VM/buffer cache scheme.
pmap.c vm_map.c
Dynamic kernel VM size, now we dont have to pre-allocate excessive numbers of
kernel PTs.
vm_glue.c
Much simpler and more effective swapping code. No more gratuitous swapping.
proc.h
Fixed the problem that the p_lock flag was not being cleared on a fork.
swap_pager.c, vnode_pager.c
Removal of old vfs_bio cruft to support the past pseudo-coherency. Now the
code doesn't need it anymore.
machdep.c
Changes to better support the parameter values for the merged VM/buffer cache
scheme.
machdep.c, kern_exec.c, vm_glue.c
Implemented a seperate submap for temporary exec string space and another one
to contain process upages. This eliminates all map fragmentation problems
that previously existed.
ffs_inode.c, ufs_inode.c, ufs_readwrite.c
Changes for merged VM/buffer cache. Add "bypass" support for sneaking in on
busy buffers.
Submitted by: John Dyson and David Greenman
1995-01-09 16:06:02 +00:00
|
|
|
if (didswap)
|
NOTE: libkvm, w, ps, 'top', and any other utility which depends on struct
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).
1995-07-13 08:48:48 +00:00
|
|
|
wakeup(&proc0);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
1995-12-14 09:55:16 +00:00
|
|
|
static void
|
2007-09-17 05:31:39 +00:00
|
|
|
swapclear(p)
|
|
|
|
struct proc *p;
|
|
|
|
{
|
|
|
|
struct thread *td;
|
|
|
|
|
|
|
|
PROC_LOCK_ASSERT(p, MA_OWNED);
|
|
|
|
|
|
|
|
FOREACH_THREAD_IN_PROC(p, td) {
|
|
|
|
thread_lock(td);
|
|
|
|
td->td_flags |= TDF_INMEM;
|
|
|
|
td->td_flags &= ~TDF_SWAPINREQ;
|
|
|
|
TD_CLR_SWAPPED(td);
|
|
|
|
if (TD_CAN_RUN(td))
|
If a thread that is swapped out is made runnable, then the setrunnable()
routine wakes up proc0 so that proc0 can swap the thread back in.
Historically, this has been done by waking up proc0 directly from
setrunnable() itself via a wakeup(). When waking up a sleeping thread
that was swapped out (the usual case when waking proc0 since only sleeping
threads are eligible to be swapped out), this resulted in a bit of
recursion (e.g. wakeup() -> setrunnable() -> wakeup()).
With sleep queues having separate locks in 6.x and later, this caused a
spin lock LOR (sleepq lock -> sched_lock/thread lock -> sleepq lock).
An attempt was made to fix this in 7.0 by making the proc0 wakeup use
the ithread mechanism for doing the wakeup. However, this required
grabbing proc0's thread lock to perform the wakeup. If proc0 was asleep
elsewhere in the kernel (e.g. waiting for disk I/O), then this degenerated
into the same LOR since the thread lock would be some other sleepq lock.
Fix this by deferring the wakeup of the swapper until after the sleepq
lock held by the upper layer has been locked. The setrunnable() routine
now returns a boolean value to indicate whether or not proc0 needs to be
woken up. The end result is that consumers of the sleepq API such as
*sleep/wakeup, condition variables, sx locks, and lockmgr, have to wakeup
proc0 if they get a non-zero return value from sleepq_abort(),
sleepq_broadcast(), or sleepq_signal().
Discussed with: jeff
Glanced at by: sam
Tested by: Jurgen Weber jurgen - ish com au
MFC after: 2 weeks
2008-08-05 20:02:31 +00:00
|
|
|
if (setrunnable(td)) {
|
|
|
|
#ifdef INVARIANTS
|
|
|
|
/*
|
|
|
|
* XXX: We just cleared TDI_SWAPPED
|
|
|
|
* above and set TDF_INMEM, so this
|
|
|
|
* should never happen.
|
|
|
|
*/
|
|
|
|
panic("not waking up swapper");
|
|
|
|
#endif
|
|
|
|
}
|
2007-09-17 05:31:39 +00:00
|
|
|
thread_unlock(td);
|
|
|
|
}
|
|
|
|
p->p_flag &= ~(P_SWAPPINGIN|P_SWAPPINGOUT);
|
|
|
|
p->p_flag |= P_INMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
1994-05-24 10:09:53 +00:00
|
|
|
swapout(p)
|
2001-07-04 19:00:13 +00:00
|
|
|
struct proc *p;
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
2001-09-12 08:38:13 +00:00
|
|
|
struct thread *td;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2001-05-18 00:08:38 +00:00
|
|
|
PROC_LOCK_ASSERT(p, MA_OWNED);
|
1996-04-09 04:36:58 +00:00
|
|
|
#if defined(SWAP_DEBUG)
|
|
|
|
printf("swapping out %d\n", p->p_pid);
|
|
|
|
#endif
|
2002-07-29 18:33:32 +00:00
|
|
|
|
2002-07-30 06:54:05 +00:00
|
|
|
/*
|
|
|
|
* The states of this process and its threads may have changed
|
|
|
|
* by now. Assuming that there is only one pageout daemon thread,
|
|
|
|
* this process should still be in memory.
|
|
|
|
*/
|
2007-09-17 05:31:39 +00:00
|
|
|
KASSERT((p->p_flag & (P_INMEM|P_SWAPPINGOUT|P_SWAPPINGIN)) == P_INMEM,
|
2002-07-30 06:54:05 +00:00
|
|
|
("swapout: lost a swapout race?"));
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
1994-05-25 09:21:21 +00:00
|
|
|
* remember the process resident count
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
1999-02-19 14:25:37 +00:00
|
|
|
p->p_vmspace->vm_swrss = vmspace_resident_count(p->p_vmspace);
|
2007-09-17 05:31:39 +00:00
|
|
|
/*
|
|
|
|
* Check and mark all threads before we proceed.
|
|
|
|
*/
|
|
|
|
p->p_flag &= ~P_INMEM;
|
|
|
|
p->p_flag |= P_SWAPPINGOUT;
|
Commit 14/14 of sched_lock decomposition.
- Use thread_lock() rather than sched_lock for per-thread scheduling
sychronization.
- Use the per-process spinlock rather than the sched_lock for per-process
scheduling synchronization.
Tested by: kris, current@
Tested on: i386, amd64, ULE, 4BSD, libthr, libkse, PREEMPTION, etc.
Discussed with: kris, attilio, kmacy, jhb, julian, bde (small parts each)
2007-06-05 00:00:57 +00:00
|
|
|
FOREACH_THREAD_IN_PROC(p, td) {
|
|
|
|
thread_lock(td);
|
2007-09-17 05:31:39 +00:00
|
|
|
if (!thread_safetoswapout(td)) {
|
|
|
|
thread_unlock(td);
|
|
|
|
swapclear(p);
|
|
|
|
return (EBUSY);
|
|
|
|
}
|
|
|
|
td->td_flags &= ~TDF_INMEM;
|
2003-04-22 20:00:26 +00:00
|
|
|
TD_SET_SWAPPED(td);
|
Commit 14/14 of sched_lock decomposition.
- Use thread_lock() rather than sched_lock for per-thread scheduling
sychronization.
- Use the per-process spinlock rather than the sched_lock for per-process
scheduling synchronization.
Tested by: kris, current@
Tested on: i386, amd64, ULE, 4BSD, libthr, libkse, PREEMPTION, etc.
Discussed with: kris, attilio, kmacy, jhb, julian, bde (small parts each)
2007-06-05 00:00:57 +00:00
|
|
|
thread_unlock(td);
|
|
|
|
}
|
2007-09-17 05:31:39 +00:00
|
|
|
td = FIRST_THREAD_IN_PROC(p);
|
|
|
|
++td->td_ru.ru_nswap;
|
|
|
|
PROC_UNLOCK(p);
|
1994-05-25 09:21:21 +00:00
|
|
|
|
2007-09-17 05:31:39 +00:00
|
|
|
/*
|
|
|
|
* This list is stable because all threads are now prevented from
|
|
|
|
* running. The list is only modified in the context of a running
|
|
|
|
* thread in this process.
|
|
|
|
*/
|
2003-04-22 20:00:26 +00:00
|
|
|
FOREACH_THREAD_IN_PROC(p, td)
|
2003-06-14 23:23:55 +00:00
|
|
|
vm_thread_swapout(td);
|
2003-04-22 20:00:26 +00:00
|
|
|
|
|
|
|
PROC_LOCK(p);
|
2007-09-17 05:31:39 +00:00
|
|
|
p->p_flag &= ~P_SWAPPINGOUT;
|
2007-09-21 05:07:07 +00:00
|
|
|
p->p_swtick = ticks;
|
2007-09-17 05:31:39 +00:00
|
|
|
return (0);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
1996-02-22 10:57:37 +00:00
|
|
|
#endif /* !NO_SWAPPING */
|