NetBSD/sys/vm/vm_meter.c

241 lines
6.6 KiB
C
Raw Normal View History

/* $NetBSD: vm_meter.c,v 1.23 1998/08/09 21:58:53 perry Exp $ */
1993-03-21 12:45:37 +03:00
/*
1994-05-07 04:40:07 +04:00
* Copyright (c) 1982, 1986, 1989, 1993
* The Regents of the University of California. All rights reserved.
1993-03-21 12:45:37 +03:00
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
1998-03-01 05:20:01 +03:00
* @(#)vm_meter.c 8.8 (Berkeley) 7/14/95
1993-03-21 12:45:37 +03:00
*/
1993-12-17 10:56:32 +03:00
#include <sys/param.h>
#include <sys/proc.h>
#include <sys/systm.h>
#include <sys/kernel.h>
1994-05-07 04:40:07 +04:00
#include <vm/vm.h>
#include <sys/sysctl.h>
1993-03-21 12:45:37 +03:00
1994-05-11 05:01:03 +04:00
struct loadavg averunnable; /* load average, of runnable procs */
1993-03-21 12:45:37 +03:00
int maxslp = MAXSLP;
#if !defined(MACHINE_NONCONTIG) && !defined(MACHINE_NEW_NONCONTIG)
int saferss = SAFERSS;
#endif /* MACHINE_NONCONTIG */
1993-03-21 12:45:37 +03:00
1993-06-27 10:27:29 +04:00
void
1993-03-21 12:45:37 +03:00
vmmeter()
{
if (time.tv_sec % 5 == 0)
1994-05-07 04:40:07 +04:00
loadav(&averunnable);
1993-03-21 12:45:37 +03:00
if (proc0.p_slptime > maxslp/2)
wakeup((caddr_t)&proc0);
}
/*
* Constants for averages over 1, 5, and 15 minutes
* when sampling at 5 second intervals.
*/
fixpt_t cexp[3] = {
0.9200444146293232 * FSCALE, /* exp(-1/12) */
0.9834714538216174 * FSCALE, /* exp(-1/60) */
0.9944598480048967 * FSCALE, /* exp(-1/180) */
};
/*
* Compute a tenex style load average of a quantity on
* 1, 5 and 15 minute intervals.
*/
1994-05-07 04:40:07 +04:00
void
loadav(avg)
register struct loadavg *avg;
1993-03-21 12:45:37 +03:00
{
1994-05-07 04:40:07 +04:00
register int i, nrun;
register struct proc *p;
1993-03-21 12:45:37 +03:00
for (nrun = 0, p = allproc.lh_first; p != 0; p = p->p_list.le_next) {
1994-05-07 04:40:07 +04:00
switch (p->p_stat) {
case SSLEEP:
if (p->p_priority > PZERO || p->p_slptime > 1)
1994-05-07 04:40:07 +04:00
continue;
/* fall through */
1994-05-11 05:01:03 +04:00
case SRUN:
1994-05-07 04:40:07 +04:00
case SIDL:
nrun++;
}
}
1993-03-21 12:45:37 +03:00
for (i = 0; i < 3; i++)
1994-05-07 04:40:07 +04:00
avg->ldavg[i] = (cexp[i] * avg->ldavg[i] +
nrun * FSCALE * (FSCALE - cexp[i])) >> FSHIFT;
1993-03-21 12:45:37 +03:00
}
1994-01-28 07:50:47 +03:00
/*
1994-05-07 04:40:07 +04:00
* Attributes associated with virtual memory.
1994-01-28 07:50:47 +03:00
*/
1996-02-05 04:53:47 +03:00
int
1994-05-07 04:40:07 +04:00
vm_sysctl(name, namelen, oldp, oldlenp, newp, newlen, p)
int *name;
u_int namelen;
void *oldp;
size_t *oldlenp;
void *newp;
size_t newlen;
struct proc *p;
1994-01-28 07:50:47 +03:00
{
1994-05-07 04:40:07 +04:00
struct vmtotal vmtotals;
/* all sysctl names at this level are terminal */
if (namelen != 1)
return (ENOTDIR); /* overloaded */
switch (name[0]) {
case VM_LOADAVG:
averunnable.fscale = FSCALE;
return (sysctl_rdstruct(oldp, oldlenp, newp, &averunnable,
sizeof(averunnable)));
case VM_METER:
vmtotal(&vmtotals);
return (sysctl_rdstruct(oldp, oldlenp, newp, &vmtotals,
sizeof(vmtotals)));
default:
return (EOPNOTSUPP);
}
/* NOTREACHED */
}
1994-01-28 07:50:47 +03:00
1994-05-07 04:40:07 +04:00
/*
* Calculate the current state of the system.
* Done on demand from getkerninfo().
*/
void
vmtotal(totalp)
register struct vmtotal *totalp;
{
register struct proc *p;
register vm_map_entry_t entry;
register vm_object_t object;
register vm_map_t map;
int paging;
memset(totalp, 0, sizeof *totalp);
1994-05-07 04:40:07 +04:00
/*
* Mark all objects as inactive.
*/
simple_lock(&vm_object_list_lock);
for (object = vm_object_list.tqh_first;
object != NULL;
object = object->object_list.tqe_next)
object->flags &= ~OBJ_ACTIVE;
simple_unlock(&vm_object_list_lock);
/*
* Calculate process statistics.
*/
for (p = allproc.lh_first; p != 0; p = p->p_list.le_next) {
1994-05-07 04:40:07 +04:00
if (p->p_flag & P_SYSTEM)
continue;
switch (p->p_stat) {
case 0:
continue;
case SSLEEP:
case SSTOP:
if (p->p_flag & P_INMEM) {
if (p->p_priority <= PZERO)
totalp->t_dw++;
else if (p->p_slptime < maxslp)
totalp->t_sl++;
} else if (p->p_slptime < maxslp)
totalp->t_sw++;
if (p->p_slptime >= maxslp)
continue;
break;
case SRUN:
case SIDL:
if (p->p_flag & P_INMEM)
totalp->t_rq++;
else
totalp->t_sw++;
if (p->p_stat == SIDL)
continue;
break;
}
/*
* Note active objects.
1998-03-01 05:20:01 +03:00
*
* XXX don't count shadow objects with no resident pages.
* This eliminates the forced shadows caused by MAP_PRIVATE.
* Right now we require that such an object completely shadow
* the original, to catch just those cases.
1994-05-07 04:40:07 +04:00
*/
paging = 0;
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-03-01 05:20:01 +03:00
(object = entry->object.vm_object) == NULL)
1994-05-07 04:40:07 +04:00
continue;
1998-03-01 05:20:01 +03:00
while (object->shadow &&
object->resident_page_count == 0 &&
object->shadow_offset == 0 &&
object->size == object->shadow->size)
object = object->shadow;
object->flags |= OBJ_ACTIVE;
paging |= vm_object_paging(entry->object.vm_object);
1994-05-07 04:40:07 +04:00
}
if (paging)
totalp->t_pw++;
1994-01-28 07:50:47 +03:00
}
1994-05-07 04:40:07 +04:00
/*
* Calculate object memory usage statistics.
*/
simple_lock(&vm_object_list_lock);
for (object = vm_object_list.tqh_first;
object != NULL;
object = object->object_list.tqe_next) {
totalp->t_vm += num_pages(object->size);
totalp->t_rm += object->resident_page_count;
if (object->flags & OBJ_ACTIVE) {
totalp->t_avm += num_pages(object->size);
totalp->t_arm += object->resident_page_count;
}
if (object->ref_count > 1) {
/* shared object */
totalp->t_vmshr += num_pages(object->size);
totalp->t_rmshr += object->resident_page_count;
if (object->flags & OBJ_ACTIVE) {
totalp->t_avmshr += num_pages(object->size);
totalp->t_armshr += object->resident_page_count;
}
}
1994-01-28 07:50:47 +03:00
}
1994-05-07 04:40:07 +04:00
totalp->t_free = cnt.v_free_count;
simple_unlock(&vm_object_list_lock);
1994-01-28 07:50:47 +03:00
}