62b009f8b1
The default level works with minimal overhead, but one can also enable full, efficient use of a 512K cache. (Parameters can be generated to support arbitrary cache sizes also.)
219 lines
6.3 KiB
C
219 lines
6.3 KiB
C
/*
|
|
* Copyright (c) 1982, 1986, 1989, 1993
|
|
* The Regents of the University of California. 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 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.
|
|
*
|
|
* @(#)vm_meter.c 8.4 (Berkeley) 1/4/94
|
|
* $Id: vm_meter.c,v 1.15 1996/05/18 03:37:47 dyson Exp $
|
|
*/
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/kernel.h>
|
|
#include <sys/vmmeter.h>
|
|
#include <sys/queue.h>
|
|
|
|
#include <vm/vm.h>
|
|
#include <vm/vm_extern.h>
|
|
#include <vm/vm_param.h>
|
|
#include <vm/vm_prot.h>
|
|
#include <vm/lock.h>
|
|
#include <vm/pmap.h>
|
|
#include <vm/vm_map.h>
|
|
#include <vm/vm_object.h>
|
|
#include <sys/sysctl.h>
|
|
|
|
struct loadavg averunnable =
|
|
{ {0, 0, 0}, FSCALE }; /* load average, of runnable procs */
|
|
|
|
struct vmmeter cnt;
|
|
|
|
static int maxslp = MAXSLP;
|
|
|
|
/*
|
|
* Constants for averages over 1, 5, and 15 minutes
|
|
* when sampling at 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) */
|
|
};
|
|
|
|
/*
|
|
* Compute a tenex style load average of a quantity on
|
|
* 1, 5 and 15 minute intervals.
|
|
*/
|
|
static void
|
|
loadav(struct loadavg *avg)
|
|
{
|
|
register int i, nrun;
|
|
register struct proc *p;
|
|
|
|
for (nrun = 0, p = allproc.lh_first; p != 0; p = p->p_list.le_next) {
|
|
switch (p->p_stat) {
|
|
case SSLEEP:
|
|
if (p->p_priority > PZERO || p->p_slptime != 0)
|
|
continue;
|
|
/* fall through */
|
|
case SRUN:
|
|
case SIDL:
|
|
nrun++;
|
|
}
|
|
}
|
|
for (i = 0; i < 3; i++)
|
|
avg->ldavg[i] = (cexp[i] * avg->ldavg[i] +
|
|
nrun * FSCALE * (FSCALE - cexp[i])) >> FSHIFT;
|
|
}
|
|
|
|
void
|
|
vmmeter()
|
|
{
|
|
|
|
if (time.tv_sec % 5 == 0)
|
|
loadav(&averunnable);
|
|
if (proc0.p_slptime > maxslp / 2)
|
|
wakeup(&proc0);
|
|
}
|
|
|
|
SYSCTL_INT(_vm, VM_V_FREE_MIN, v_free_min,
|
|
CTLFLAG_RW, &cnt.v_free_min, 0, "");
|
|
SYSCTL_INT(_vm, VM_V_FREE_TARGET, v_free_target,
|
|
CTLFLAG_RW, &cnt.v_free_target, 0, "");
|
|
SYSCTL_INT(_vm, VM_V_FREE_RESERVED, v_free_reserved,
|
|
CTLFLAG_RW, &cnt.v_free_reserved, 0, "");
|
|
SYSCTL_INT(_vm, VM_V_INACTIVE_TARGET, v_inactive_target,
|
|
CTLFLAG_RW, &cnt.v_inactive_target, 0, "");
|
|
SYSCTL_INT(_vm, VM_V_CACHE_MIN, v_cache_min,
|
|
CTLFLAG_RW, &cnt.v_cache_min, 0, "");
|
|
SYSCTL_INT(_vm, VM_V_CACHE_MAX, v_cache_max,
|
|
CTLFLAG_RW, &cnt.v_cache_max, 0, "");
|
|
SYSCTL_INT(_vm, VM_V_PAGEOUT_FREE_MIN, v_pageout_free_min,
|
|
CTLFLAG_RW, &cnt.v_pageout_free_min, 0, "");
|
|
|
|
SYSCTL_STRUCT(_vm, VM_LOADAVG, loadavg, CTLFLAG_RD, &averunnable, loadavg, "");
|
|
|
|
static int
|
|
vmtotal SYSCTL_HANDLER_ARGS
|
|
{
|
|
struct proc *p;
|
|
struct vmtotal total, *totalp;
|
|
vm_map_entry_t entry;
|
|
vm_object_t object;
|
|
vm_map_t map;
|
|
int paging;
|
|
|
|
totalp = &total;
|
|
bzero(totalp, sizeof *totalp);
|
|
/*
|
|
* Mark all objects as inactive.
|
|
*/
|
|
for (object = TAILQ_FIRST(&vm_object_list);
|
|
object != NULL;
|
|
object = TAILQ_NEXT(object,object_list))
|
|
object->flags &= ~OBJ_ACTIVE;
|
|
/*
|
|
* Calculate process statistics.
|
|
*/
|
|
for (p = allproc.lh_first; p != 0; p = p->p_list.le_next) {
|
|
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.
|
|
*/
|
|
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 ||
|
|
entry->object.vm_object == NULL)
|
|
continue;
|
|
entry->object.vm_object->flags |= OBJ_ACTIVE;
|
|
paging |= entry->object.vm_object->paging_in_progress;
|
|
}
|
|
if (paging)
|
|
totalp->t_pw++;
|
|
}
|
|
/*
|
|
* Calculate object memory usage statistics.
|
|
*/
|
|
for (object = TAILQ_FIRST(&vm_object_list);
|
|
object != NULL;
|
|
object = TAILQ_NEXT(object, object_list)) {
|
|
totalp->t_vm += object->size;
|
|
totalp->t_rm += object->resident_page_count;
|
|
if (object->flags & OBJ_ACTIVE) {
|
|
totalp->t_avm += object->size;
|
|
totalp->t_arm += object->resident_page_count;
|
|
}
|
|
if (object->shadow_count > 1) {
|
|
/* shared object */
|
|
totalp->t_vmshr += object->size;
|
|
totalp->t_rmshr += object->resident_page_count;
|
|
if (object->flags & OBJ_ACTIVE) {
|
|
totalp->t_avmshr += object->size;
|
|
totalp->t_armshr += object->resident_page_count;
|
|
}
|
|
}
|
|
}
|
|
totalp->t_free = cnt.v_free_count + cnt.v_cache_count;
|
|
return (sysctl_handle_opaque(oidp, totalp, sizeof total, req));
|
|
}
|
|
|
|
SYSCTL_PROC(_vm, VM_METER, vmmeter, CTLTYPE_OPAQUE|CTLFLAG_RD,
|
|
0, sizeof(struct vmtotal), vmtotal, "S,vmtotal", "");
|