2005-05-15 12:01:06 +04:00
|
|
|
/* $NetBSD: uvm_meter.c,v 1.34 2005/05/15 08:01:06 yamt Exp $ */
|
1998-02-05 09:25:08 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 1997 Charles D. Cranor and Washington University.
|
|
|
|
* Copyright (c) 1982, 1986, 1989, 1993
|
2001-05-25 08:06:11 +04:00
|
|
|
* The Regents of the University of California.
|
1998-02-05 09:25:08 +03:00
|
|
|
*
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by Charles D. Cranor,
|
2001-05-25 08:06:11 +04:00
|
|
|
* Washington University, and the University of California, Berkeley
|
1998-02-05 09:25:08 +03:00
|
|
|
* and its contributors.
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* @(#)vm_meter.c 8.4 (Berkeley) 1/4/94
|
1998-02-07 14:07:38 +03:00
|
|
|
* from: Id: uvm_meter.c,v 1.1.2.1 1997/08/14 19:10:35 chuck Exp
|
1998-02-05 09:25:08 +03:00
|
|
|
*/
|
|
|
|
|
2001-11-10 10:36:59 +03:00
|
|
|
#include <sys/cdefs.h>
|
2005-05-15 12:01:06 +04:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: uvm_meter.c,v 1.34 2005/05/15 08:01:06 yamt Exp $");
|
2001-11-10 10:36:59 +03:00
|
|
|
|
1998-02-05 09:25:08 +03:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/kernel.h>
|
2000-06-27 21:29:17 +04:00
|
|
|
#include <uvm/uvm_extern.h>
|
1998-02-05 09:25:08 +03:00
|
|
|
#include <sys/sysctl.h>
|
|
|
|
|
|
|
|
/*
|
|
|
|
* maxslp: ???? XXXCDC
|
|
|
|
*/
|
|
|
|
|
|
|
|
int maxslp = MAXSLP; /* patchable ... */
|
2000-11-24 21:54:31 +03:00
|
|
|
struct loadavg averunnable;
|
1998-02-05 09:25:08 +03:00
|
|
|
|
|
|
|
/*
|
2001-05-25 08:06:11 +04:00
|
|
|
* constants for averages over 1, 5, and 15 minutes when sampling at
|
1998-02-05 09:25:08 +03:00
|
|
|
* 5 second intervals.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static fixpt_t cexp[3] = {
|
|
|
|
0.9200444146293232 * FSCALE, /* exp(-1/12) */
|
|
|
|
0.9834714538216174 * FSCALE, /* exp(-1/60) */
|
|
|
|
0.9944598480048967 * FSCALE, /* exp(-1/180) */
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* prototypes
|
|
|
|
*/
|
|
|
|
|
2004-03-24 10:50:48 +03:00
|
|
|
static void uvm_loadav(struct loadavg *);
|
|
|
|
static void uvm_total(struct vmtotal *);
|
1998-02-05 09:25:08 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* uvm_meter: calculate load average and wake up the swapper (if needed)
|
|
|
|
*/
|
1998-02-07 15:45:53 +03:00
|
|
|
void
|
|
|
|
uvm_meter()
|
1998-02-05 09:25:08 +03:00
|
|
|
{
|
1998-02-07 15:45:53 +03:00
|
|
|
if ((time.tv_sec % 5) == 0)
|
|
|
|
uvm_loadav(&averunnable);
|
2003-01-18 11:51:40 +03:00
|
|
|
if (lwp0.l_slptime > (maxslp / 2))
|
2000-11-24 21:54:31 +03:00
|
|
|
wakeup(&proc0);
|
1998-02-05 09:25:08 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2001-05-25 08:06:11 +04:00
|
|
|
* uvm_loadav: compute a tenex style load average of a quantity on
|
1998-02-05 09:25:08 +03:00
|
|
|
* 1, 5, and 15 minute internvals.
|
|
|
|
*/
|
1998-02-07 15:45:53 +03:00
|
|
|
static void
|
|
|
|
uvm_loadav(avg)
|
|
|
|
struct loadavg *avg;
|
1998-02-05 09:25:08 +03:00
|
|
|
{
|
1998-02-07 15:45:53 +03:00
|
|
|
int i, nrun;
|
2003-01-18 11:51:40 +03:00
|
|
|
struct lwp *l;
|
1998-02-07 15:45:53 +03:00
|
|
|
|
1999-07-25 10:30:33 +04:00
|
|
|
proclist_lock_read();
|
2000-11-24 21:54:31 +03:00
|
|
|
nrun = 0;
|
2003-01-18 11:51:40 +03:00
|
|
|
LIST_FOREACH(l, &alllwp, l_list) {
|
|
|
|
switch (l->l_stat) {
|
|
|
|
case LSSLEEP:
|
|
|
|
if (l->l_priority > PZERO || l->l_slptime > 1)
|
1998-02-07 15:45:53 +03:00
|
|
|
continue;
|
|
|
|
/* fall through */
|
2003-01-18 11:51:40 +03:00
|
|
|
case LSRUN:
|
|
|
|
case LSONPROC:
|
|
|
|
case LSIDL:
|
1998-02-07 15:45:53 +03:00
|
|
|
nrun++;
|
|
|
|
}
|
|
|
|
}
|
1999-07-23 02:58:38 +04:00
|
|
|
proclist_unlock_read();
|
1998-02-07 15:45:53 +03:00
|
|
|
for (i = 0; i < 3; i++)
|
|
|
|
avg->ldavg[i] = (cexp[i] * avg->ldavg[i] +
|
|
|
|
nrun * FSCALE * (FSCALE - cexp[i])) >> FSHIFT;
|
1998-02-05 09:25:08 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
* sysctl helper routine for the vm.vmmeter node.
|
1998-02-05 09:25:08 +03:00
|
|
|
*/
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
static int
|
|
|
|
sysctl_vm_meter(SYSCTLFN_ARGS)
|
1998-02-05 09:25:08 +03:00
|
|
|
{
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
struct sysctlnode node;
|
1998-02-07 15:45:53 +03:00
|
|
|
struct vmtotal vmtotals;
|
2001-12-09 06:07:19 +03:00
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
node = *rnode;
|
|
|
|
node.sysctl_data = &vmtotals;
|
|
|
|
uvm_total(&vmtotals);
|
2001-12-09 06:07:19 +03:00
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
return (sysctl_lookup(SYSCTLFN_CALL(&node)));
|
|
|
|
}
|
2001-03-09 04:02:10 +03:00
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
/*
|
|
|
|
* sysctl helper routine for the vm.uvmexp node.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
sysctl_vm_uvmexp(SYSCTLFN_ARGS)
|
|
|
|
{
|
|
|
|
struct sysctlnode node;
|
2001-07-14 10:36:01 +04:00
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
node = *rnode;
|
|
|
|
if (oldp)
|
|
|
|
node.sysctl_size = min(*oldlenp, node.sysctl_size);
|
2001-07-14 10:36:01 +04:00
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
return (sysctl_lookup(SYSCTLFN_CALL(&node)));
|
1998-02-05 09:25:08 +03:00
|
|
|
}
|
|
|
|
|
2000-11-29 12:52:18 +03:00
|
|
|
static int
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_vm_uvmexp2(SYSCTLFN_ARGS)
|
2000-11-29 12:52:18 +03:00
|
|
|
{
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
struct sysctlnode node;
|
2000-11-29 12:52:18 +03:00
|
|
|
struct uvmexp_sysctl u;
|
|
|
|
|
2000-11-30 14:04:43 +03:00
|
|
|
memset(&u, 0, sizeof(u));
|
|
|
|
|
|
|
|
/* Entries here are in order of uvmexp_sysctl, not uvmexp */
|
2000-11-29 12:52:18 +03:00
|
|
|
u.pagesize = uvmexp.pagesize;
|
|
|
|
u.pagemask = uvmexp.pagemask;
|
|
|
|
u.pageshift = uvmexp.pageshift;
|
|
|
|
u.npages = uvmexp.npages;
|
|
|
|
u.free = uvmexp.free;
|
|
|
|
u.active = uvmexp.active;
|
|
|
|
u.inactive = uvmexp.inactive;
|
|
|
|
u.paging = uvmexp.paging;
|
|
|
|
u.wired = uvmexp.wired;
|
|
|
|
u.zeropages = uvmexp.zeropages;
|
|
|
|
u.reserve_pagedaemon = uvmexp.reserve_pagedaemon;
|
|
|
|
u.reserve_kernel = uvmexp.reserve_kernel;
|
|
|
|
u.freemin = uvmexp.freemin;
|
|
|
|
u.freetarg = uvmexp.freetarg;
|
|
|
|
u.inactarg = uvmexp.inactarg;
|
|
|
|
u.wiredmax = uvmexp.wiredmax;
|
|
|
|
u.nswapdev = uvmexp.nswapdev;
|
|
|
|
u.swpages = uvmexp.swpages;
|
|
|
|
u.swpginuse = uvmexp.swpginuse;
|
|
|
|
u.swpgonly = uvmexp.swpgonly;
|
|
|
|
u.nswget = uvmexp.nswget;
|
|
|
|
u.faults = uvmexp.faults;
|
|
|
|
u.traps = uvmexp.traps;
|
|
|
|
u.intrs = uvmexp.intrs;
|
|
|
|
u.swtch = uvmexp.swtch;
|
|
|
|
u.softs = uvmexp.softs;
|
|
|
|
u.syscalls = uvmexp.syscalls;
|
|
|
|
u.pageins = uvmexp.pageins;
|
|
|
|
u.swapins = uvmexp.swapins;
|
|
|
|
u.swapouts = uvmexp.swapouts;
|
|
|
|
u.pgswapin = uvmexp.pgswapin;
|
|
|
|
u.pgswapout = uvmexp.pgswapout;
|
|
|
|
u.forks = uvmexp.forks;
|
|
|
|
u.forks_ppwait = uvmexp.forks_ppwait;
|
|
|
|
u.forks_sharevm = uvmexp.forks_sharevm;
|
|
|
|
u.pga_zerohit = uvmexp.pga_zerohit;
|
|
|
|
u.pga_zeromiss = uvmexp.pga_zeromiss;
|
|
|
|
u.zeroaborts = uvmexp.zeroaborts;
|
|
|
|
u.fltnoram = uvmexp.fltnoram;
|
|
|
|
u.fltnoanon = uvmexp.fltnoanon;
|
|
|
|
u.fltpgwait = uvmexp.fltpgwait;
|
|
|
|
u.fltpgrele = uvmexp.fltpgrele;
|
|
|
|
u.fltrelck = uvmexp.fltrelck;
|
|
|
|
u.fltrelckok = uvmexp.fltrelckok;
|
|
|
|
u.fltanget = uvmexp.fltanget;
|
|
|
|
u.fltanretry = uvmexp.fltanretry;
|
|
|
|
u.fltamcopy = uvmexp.fltamcopy;
|
|
|
|
u.fltnamap = uvmexp.fltnamap;
|
|
|
|
u.fltnomap = uvmexp.fltnomap;
|
|
|
|
u.fltlget = uvmexp.fltlget;
|
|
|
|
u.fltget = uvmexp.fltget;
|
|
|
|
u.flt_anon = uvmexp.flt_anon;
|
|
|
|
u.flt_acow = uvmexp.flt_acow;
|
|
|
|
u.flt_obj = uvmexp.flt_obj;
|
|
|
|
u.flt_prcopy = uvmexp.flt_prcopy;
|
|
|
|
u.flt_przero = uvmexp.flt_przero;
|
|
|
|
u.pdwoke = uvmexp.pdwoke;
|
|
|
|
u.pdrevs = uvmexp.pdrevs;
|
|
|
|
u.pdswout = uvmexp.pdswout;
|
|
|
|
u.pdfreed = uvmexp.pdfreed;
|
|
|
|
u.pdscans = uvmexp.pdscans;
|
|
|
|
u.pdanscan = uvmexp.pdanscan;
|
|
|
|
u.pdobscan = uvmexp.pdobscan;
|
|
|
|
u.pdreact = uvmexp.pdreact;
|
|
|
|
u.pdbusy = uvmexp.pdbusy;
|
|
|
|
u.pdpageouts = uvmexp.pdpageouts;
|
|
|
|
u.pdpending = uvmexp.pdpending;
|
|
|
|
u.pddeact = uvmexp.pddeact;
|
2000-11-30 14:04:43 +03:00
|
|
|
u.anonpages = uvmexp.anonpages;
|
2001-12-09 06:07:19 +03:00
|
|
|
u.filepages = uvmexp.filepages;
|
|
|
|
u.execpages = uvmexp.execpages;
|
2001-04-29 08:23:20 +04:00
|
|
|
u.colorhit = uvmexp.colorhit;
|
|
|
|
u.colormiss = uvmexp.colormiss;
|
2000-11-29 12:52:18 +03:00
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
node = *rnode;
|
|
|
|
node.sysctl_data = &u;
|
|
|
|
node.sysctl_size = sizeof(u);
|
|
|
|
return (sysctl_lookup(SYSCTLFN_CALL(&node)));
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* sysctl helper routine for the vm.{anon,exec,file}{min,max} nodes.
|
|
|
|
* makes sure that they all correlate properly and none are set too
|
|
|
|
* large.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
sysctl_vm_updateminmax(SYSCTLFN_ARGS)
|
|
|
|
{
|
|
|
|
int t, error;
|
|
|
|
struct sysctlnode node;
|
|
|
|
|
|
|
|
node = *rnode;
|
|
|
|
node.sysctl_data = &t;
|
|
|
|
t = *(int*)rnode->sysctl_data;
|
|
|
|
error = sysctl_lookup(SYSCTLFN_CALL(&node));
|
|
|
|
if (error || newp == NULL)
|
|
|
|
return (error);
|
|
|
|
|
|
|
|
if (t < 0 || t > 100)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
#define UPDATEMIN(a, ap, bp, cp, tp) do { \
|
|
|
|
if (tp + uvmexp.bp + uvmexp.cp > 95) \
|
|
|
|
return (EINVAL); \
|
|
|
|
uvmexp.ap = tp; \
|
|
|
|
uvmexp.a = uvmexp.ap * 256 / 100; \
|
|
|
|
} while (0/*CONSTCOND*/)
|
|
|
|
|
|
|
|
#define UPDATEMAX(a, ap, tp) do { \
|
|
|
|
uvmexp.ap = tp; \
|
|
|
|
uvmexp.a = tp * 256 / 100; \
|
|
|
|
} while (0/*CONSTCOND*/)
|
|
|
|
|
|
|
|
switch (rnode->sysctl_num) {
|
|
|
|
case VM_ANONMIN:
|
|
|
|
UPDATEMIN(anonmin, anonminpct, fileminpct, execminpct, t);
|
|
|
|
break;
|
|
|
|
case VM_EXECMIN:
|
2004-01-11 21:42:25 +03:00
|
|
|
UPDATEMIN(execmin, execminpct, anonminpct, fileminpct, t);
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
break;
|
|
|
|
case VM_FILEMIN:
|
2004-01-11 21:42:25 +03:00
|
|
|
UPDATEMIN(filemin, fileminpct, execminpct, anonminpct, t);
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
break;
|
|
|
|
case VM_ANONMAX:
|
|
|
|
UPDATEMAX(anonmax, anonmaxpct, t);
|
|
|
|
break;
|
|
|
|
case VM_EXECMAX:
|
|
|
|
UPDATEMAX(execmax, execmaxpct, t);
|
|
|
|
break;
|
|
|
|
case VM_FILEMAX:
|
|
|
|
UPDATEMAX(filemax, filemaxpct, t);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
#undef UPDATEMIN
|
|
|
|
#undef UPDATEMAX
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* uvm_sysctl: sysctl hook into UVM system.
|
|
|
|
*/
|
|
|
|
SYSCTL_SETUP(sysctl_vm_setup, "sysctl vm subtree setup")
|
|
|
|
{
|
|
|
|
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
CTLTYPE_NODE, "vm", NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_VM, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
2004-05-25 08:31:17 +04:00
|
|
|
CTLTYPE_STRUCT, "vmmeter",
|
|
|
|
SYSCTL_DESCR("Simple system-wide virtual memory "
|
|
|
|
"statistics"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_vm_meter, 0, NULL, sizeof(struct vmtotal),
|
|
|
|
CTL_VM, VM_METER, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
2004-05-25 08:31:17 +04:00
|
|
|
CTLTYPE_STRUCT, "loadavg",
|
|
|
|
SYSCTL_DESCR("System load average history"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &averunnable, sizeof(averunnable),
|
|
|
|
CTL_VM, VM_LOADAVG, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
2004-05-25 08:31:17 +04:00
|
|
|
CTLTYPE_STRUCT, "uvmexp",
|
|
|
|
SYSCTL_DESCR("Detailed system-wide virtual memory "
|
|
|
|
"statistics"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_vm_uvmexp, 0, &uvmexp, sizeof(uvmexp),
|
|
|
|
CTL_VM, VM_UVMEXP, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
2004-05-25 08:31:17 +04:00
|
|
|
CTLTYPE_INT, "nkmempages",
|
|
|
|
SYSCTL_DESCR("Default number of pages in kmem_map"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &nkmempages, 0,
|
|
|
|
CTL_VM, VM_NKMEMPAGES, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
2004-05-25 08:31:17 +04:00
|
|
|
CTLTYPE_STRUCT, "uvmexp2",
|
|
|
|
SYSCTL_DESCR("Detailed system-wide virtual memory "
|
|
|
|
"statistics (MI)"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_vm_uvmexp2, 0, NULL, 0,
|
|
|
|
CTL_VM, VM_UVMEXP2, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:31:17 +04:00
|
|
|
CTLTYPE_INT, "anonmin",
|
|
|
|
SYSCTL_DESCR("Percentage of physical memory reserved "
|
|
|
|
"for anonymous application data"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_vm_updateminmax, 0, &uvmexp.anonminpct, 0,
|
|
|
|
CTL_VM, VM_ANONMIN, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:31:17 +04:00
|
|
|
CTLTYPE_INT, "execmin",
|
|
|
|
SYSCTL_DESCR("Percentage of physical memory reserved "
|
|
|
|
"for cached executable data"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_vm_updateminmax, 0, &uvmexp.execminpct, 0,
|
|
|
|
CTL_VM, VM_EXECMIN, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:31:17 +04:00
|
|
|
CTLTYPE_INT, "filemin",
|
|
|
|
SYSCTL_DESCR("Percentage of physical memory reserved "
|
|
|
|
"for cached file data"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_vm_updateminmax, 0, &uvmexp.fileminpct, 0,
|
|
|
|
CTL_VM, VM_FILEMIN, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
2004-05-25 08:31:17 +04:00
|
|
|
CTLFLAG_PERMANENT, CTLTYPE_INT, "maxslp",
|
|
|
|
SYSCTL_DESCR("Maximum process sleep time before being "
|
|
|
|
"swapped"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &maxslp, 0,
|
|
|
|
CTL_VM, VM_MAXSLP, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_IMMEDIATE,
|
2004-05-25 08:31:17 +04:00
|
|
|
CTLTYPE_INT, "uspace",
|
|
|
|
SYSCTL_DESCR("Number of bytes allocated for a kernel "
|
|
|
|
"stack"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, USPACE, NULL, 0,
|
|
|
|
CTL_VM, VM_USPACE, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:31:17 +04:00
|
|
|
CTLTYPE_INT, "anonmax",
|
|
|
|
SYSCTL_DESCR("Percentage of physical memory which will "
|
|
|
|
"be reclaimed from other usage for "
|
|
|
|
"anonymous application data"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_vm_updateminmax, 0, &uvmexp.anonmaxpct, 0,
|
|
|
|
CTL_VM, VM_ANONMAX, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:31:17 +04:00
|
|
|
CTLTYPE_INT, "execmax",
|
|
|
|
SYSCTL_DESCR("Percentage of physical memory which will "
|
|
|
|
"be reclaimed from other usage for cached "
|
|
|
|
"executable data"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_vm_updateminmax, 0, &uvmexp.execmaxpct, 0,
|
|
|
|
CTL_VM, VM_EXECMAX, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:31:17 +04:00
|
|
|
CTLTYPE_INT, "filemax",
|
|
|
|
SYSCTL_DESCR("Percentage of physical memory which will "
|
|
|
|
"be reclaimed from other usage for cached "
|
|
|
|
"file data"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_vm_updateminmax, 0, &uvmexp.filemaxpct, 0,
|
|
|
|
CTL_VM, VM_FILEMAX, CTL_EOL);
|
2004-10-10 13:57:31 +04:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "idlezero",
|
|
|
|
SYSCTL_DESCR("Whether try to zero pages in idle loop"),
|
|
|
|
NULL, 0, &vm_page_zero_enable, 0,
|
|
|
|
CTL_VM, CTL_CREATE, CTL_EOL);
|
2000-11-29 12:52:18 +03:00
|
|
|
}
|
|
|
|
|
1998-02-05 09:25:08 +03:00
|
|
|
/*
|
|
|
|
* uvm_total: calculate the current state of the system.
|
|
|
|
*/
|
1998-02-07 15:45:53 +03:00
|
|
|
static void
|
|
|
|
uvm_total(totalp)
|
|
|
|
struct vmtotal *totalp;
|
1998-02-05 09:25:08 +03:00
|
|
|
{
|
2003-01-18 11:51:40 +03:00
|
|
|
struct lwp *l;
|
1998-02-05 09:25:08 +03:00
|
|
|
#if 0
|
2001-06-02 22:09:08 +04:00
|
|
|
struct vm_map_entry * entry;
|
|
|
|
struct vm_map *map;
|
1998-02-07 15:45:53 +03:00
|
|
|
int paging;
|
1998-02-05 09:25:08 +03:00
|
|
|
#endif
|
|
|
|
|
1998-08-10 02:36:37 +04:00
|
|
|
memset(totalp, 0, sizeof *totalp);
|
1998-02-05 09:25:08 +03:00
|
|
|
|
1998-02-07 15:45:53 +03:00
|
|
|
/*
|
|
|
|
* calculate process statistics
|
|
|
|
*/
|
1998-02-05 09:25:08 +03:00
|
|
|
|
1999-07-25 10:30:33 +04:00
|
|
|
proclist_lock_read();
|
2004-03-24 10:50:48 +03:00
|
|
|
LIST_FOREACH(l, &alllwp, l_list) {
|
2003-01-18 11:51:40 +03:00
|
|
|
if (l->l_proc->p_flag & P_SYSTEM)
|
1998-02-07 15:45:53 +03:00
|
|
|
continue;
|
2003-01-18 11:51:40 +03:00
|
|
|
switch (l->l_stat) {
|
1998-02-07 15:45:53 +03:00
|
|
|
case 0:
|
|
|
|
continue;
|
1998-03-09 03:58:55 +03:00
|
|
|
|
2003-01-18 11:51:40 +03:00
|
|
|
case LSSLEEP:
|
|
|
|
case LSSTOP:
|
|
|
|
if (l->l_flag & L_INMEM) {
|
|
|
|
if (l->l_priority <= PZERO)
|
1998-02-07 15:45:53 +03:00
|
|
|
totalp->t_dw++;
|
2003-01-18 11:51:40 +03:00
|
|
|
else if (l->l_slptime < maxslp)
|
1998-02-07 15:45:53 +03:00
|
|
|
totalp->t_sl++;
|
2003-01-18 11:51:40 +03:00
|
|
|
} else if (l->l_slptime < maxslp)
|
1998-02-07 15:45:53 +03:00
|
|
|
totalp->t_sw++;
|
2003-01-18 11:51:40 +03:00
|
|
|
if (l->l_slptime >= maxslp)
|
1998-02-07 15:45:53 +03:00
|
|
|
continue;
|
|
|
|
break;
|
1998-03-09 03:58:55 +03:00
|
|
|
|
2003-01-18 11:51:40 +03:00
|
|
|
case LSRUN:
|
|
|
|
case LSONPROC:
|
|
|
|
case LSIDL:
|
|
|
|
if (l->l_flag & L_INMEM)
|
1998-02-07 15:45:53 +03:00
|
|
|
totalp->t_rq++;
|
|
|
|
else
|
|
|
|
totalp->t_sw++;
|
2003-01-18 11:51:40 +03:00
|
|
|
if (l->l_stat == LSIDL)
|
1998-02-07 15:45:53 +03:00
|
|
|
continue;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* note active objects
|
|
|
|
*/
|
1998-02-05 09:25:08 +03:00
|
|
|
#if 0
|
1998-02-07 15:45:53 +03:00
|
|
|
/*
|
1998-02-09 01:23:33 +03:00
|
|
|
* XXXCDC: BOGUS! rethink this. in the mean time
|
|
|
|
* don't do it.
|
1998-02-07 15:45:53 +03:00
|
|
|
*/
|
|
|
|
paging = 0;
|
1998-02-09 01:23:33 +03:00
|
|
|
vm_map_lock(map);
|
1998-02-07 15:45:53 +03:00
|
|
|
for (map = &p->p_vmspace->vm_map, entry = map->header.next;
|
|
|
|
entry != &map->header; entry = entry->next) {
|
|
|
|
if (entry->is_a_map || entry->is_sub_map ||
|
1998-02-09 01:23:33 +03:00
|
|
|
entry->object.uvm_obj == NULL)
|
1998-02-07 15:45:53 +03:00
|
|
|
continue;
|
1998-02-09 01:23:33 +03:00
|
|
|
/* XXX how to do this with uvm */
|
1998-02-07 15:45:53 +03:00
|
|
|
}
|
1998-02-09 01:23:33 +03:00
|
|
|
vm_map_unlock(map);
|
1998-02-07 15:45:53 +03:00
|
|
|
if (paging)
|
|
|
|
totalp->t_pw++;
|
1998-02-05 09:25:08 +03:00
|
|
|
#endif
|
1998-02-07 15:45:53 +03:00
|
|
|
}
|
1999-07-23 02:58:38 +04:00
|
|
|
proclist_unlock_read();
|
1998-02-07 15:45:53 +03:00
|
|
|
/*
|
|
|
|
* Calculate object memory usage statistics.
|
|
|
|
*/
|
1998-02-09 01:23:33 +03:00
|
|
|
totalp->t_free = uvmexp.free;
|
|
|
|
totalp->t_vm = uvmexp.npages - uvmexp.free + uvmexp.swpginuse;
|
|
|
|
totalp->t_avm = uvmexp.active + uvmexp.swpginuse; /* XXX */
|
|
|
|
totalp->t_rm = uvmexp.npages - uvmexp.free;
|
|
|
|
totalp->t_arm = uvmexp.active;
|
|
|
|
totalp->t_vmshr = 0; /* XXX */
|
|
|
|
totalp->t_avmshr = 0; /* XXX */
|
|
|
|
totalp->t_rmshr = 0; /* XXX */
|
|
|
|
totalp->t_armshr = 0; /* XXX */
|
1998-02-05 09:25:08 +03:00
|
|
|
}
|