2005-01-07 02:29:27 +00:00
|
|
|
/*-
|
1994-05-24 10:09:53 +00:00
|
|
|
* 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.
|
|
|
|
* 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
|
|
|
|
*/
|
|
|
|
|
2003-06-11 23:50:51 +00:00
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/kernel.h>
|
2001-05-01 08:13:21 +00:00
|
|
|
#include <sys/lock.h>
|
|
|
|
#include <sys/mutex.h>
|
|
|
|
#include <sys/proc.h>
|
1998-03-28 10:33:27 +00:00
|
|
|
#include <sys/resource.h>
|
2013-03-09 02:32:23 +00:00
|
|
|
#include <sys/rwlock.h>
|
2001-03-28 11:52:56 +00:00
|
|
|
#include <sys/sx.h>
|
1995-12-07 12:48:31 +00:00
|
|
|
#include <sys/vmmeter.h>
|
2002-04-04 21:38:47 +00:00
|
|
|
#include <sys/smp.h>
|
1995-12-07 12:48:31 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <vm/vm.h>
|
1998-10-31 17:21:31 +00:00
|
|
|
#include <vm/vm_page.h>
|
1995-12-10 14:52:10 +00:00
|
|
|
#include <vm/vm_extern.h>
|
1995-12-07 12:48:31 +00:00
|
|
|
#include <vm/vm_param.h>
|
|
|
|
#include <vm/pmap.h>
|
|
|
|
#include <vm/vm_map.h>
|
|
|
|
#include <vm/vm_object.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/sysctl.h>
|
|
|
|
|
2014-03-22 10:26:09 +00:00
|
|
|
struct vmmeter vm_cnt;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2000-07-05 07:46:41 +00:00
|
|
|
SYSCTL_UINT(_vm, VM_V_FREE_MIN, v_free_min,
|
2014-03-22 10:26:09 +00:00
|
|
|
CTLFLAG_RW, &vm_cnt.v_free_min, 0, "Minimum low-free-pages threshold");
|
2000-07-05 07:46:41 +00:00
|
|
|
SYSCTL_UINT(_vm, VM_V_FREE_TARGET, v_free_target,
|
2014-03-22 10:26:09 +00:00
|
|
|
CTLFLAG_RW, &vm_cnt.v_free_target, 0, "Desired free pages");
|
2000-07-05 07:46:41 +00:00
|
|
|
SYSCTL_UINT(_vm, VM_V_FREE_RESERVED, v_free_reserved,
|
2014-03-22 10:26:09 +00:00
|
|
|
CTLFLAG_RW, &vm_cnt.v_free_reserved, 0, "Pages reserved for deadlock");
|
2000-07-05 07:46:41 +00:00
|
|
|
SYSCTL_UINT(_vm, VM_V_INACTIVE_TARGET, v_inactive_target,
|
2014-03-22 10:26:09 +00:00
|
|
|
CTLFLAG_RW, &vm_cnt.v_inactive_target, 0, "Pages desired inactive");
|
2000-07-05 07:46:41 +00:00
|
|
|
SYSCTL_UINT(_vm, VM_V_PAGEOUT_FREE_MIN, v_pageout_free_min,
|
2014-03-22 10:26:09 +00:00
|
|
|
CTLFLAG_RW, &vm_cnt.v_pageout_free_min, 0, "Min pages reserved for kernel");
|
2000-07-05 07:46:41 +00:00
|
|
|
SYSCTL_UINT(_vm, OID_AUTO, v_free_severe,
|
2014-03-22 10:26:09 +00:00
|
|
|
CTLFLAG_RW, &vm_cnt.v_free_severe, 0, "Severe page depletion point");
|
1995-11-14 09:29:34 +00:00
|
|
|
|
2004-10-11 22:04:16 +00:00
|
|
|
static int
|
|
|
|
sysctl_vm_loadavg(SYSCTL_HANDLER_ARGS)
|
|
|
|
{
|
2008-08-20 01:05:56 +00:00
|
|
|
|
2004-10-11 22:04:16 +00:00
|
|
|
#ifdef SCTL_MASK32
|
|
|
|
u_int32_t la[4];
|
|
|
|
|
|
|
|
if (req->flags & SCTL_MASK32) {
|
|
|
|
la[0] = averunnable.ldavg[0];
|
|
|
|
la[1] = averunnable.ldavg[1];
|
|
|
|
la[2] = averunnable.ldavg[2];
|
|
|
|
la[3] = averunnable.fscale;
|
|
|
|
return SYSCTL_OUT(req, la, sizeof(la));
|
|
|
|
} else
|
|
|
|
#endif
|
|
|
|
return SYSCTL_OUT(req, &averunnable, sizeof(averunnable));
|
|
|
|
}
|
2009-01-23 22:49:23 +00:00
|
|
|
SYSCTL_PROC(_vm, VM_LOADAVG, loadavg, CTLTYPE_STRUCT | CTLFLAG_RD |
|
|
|
|
CTLFLAG_MPSAFE, NULL, 0, sysctl_vm_loadavg, "S,loadavg",
|
|
|
|
"Machine loadaverage history");
|
1995-11-14 09:29:34 +00:00
|
|
|
|
|
|
|
static int
|
2000-07-04 11:25:35 +00:00
|
|
|
vmtotal(SYSCTL_HANDLER_ARGS)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
1995-11-14 09:29:34 +00:00
|
|
|
struct proc *p;
|
2006-11-20 08:33:55 +00:00
|
|
|
struct vmtotal total;
|
1995-11-14 09:29:34 +00:00
|
|
|
vm_map_entry_t entry;
|
|
|
|
vm_object_t object;
|
|
|
|
vm_map_t map;
|
1994-05-24 10:09:53 +00:00
|
|
|
int paging;
|
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;
|
2006-05-29 21:28:56 +00:00
|
|
|
struct vmspace *vm;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2006-11-20 08:33:55 +00:00
|
|
|
bzero(&total, sizeof(total));
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Mark all objects as inactive.
|
|
|
|
*/
|
2002-04-20 07:23:22 +00:00
|
|
|
mtx_lock(&vm_object_list_mtx);
|
2003-01-02 09:09:27 +00:00
|
|
|
TAILQ_FOREACH(object, &vm_object_list, object_list) {
|
2015-05-08 19:43:37 +00:00
|
|
|
VM_OBJECT_WLOCK(object);
|
1998-08-24 08:39:39 +00:00
|
|
|
vm_object_clear_flag(object, OBJ_ACTIVE);
|
2013-03-09 02:32:23 +00:00
|
|
|
VM_OBJECT_WUNLOCK(object);
|
2003-01-02 09:09:27 +00:00
|
|
|
}
|
2002-04-20 07:23:22 +00:00
|
|
|
mtx_unlock(&vm_object_list_mtx);
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Calculate process statistics.
|
|
|
|
*/
|
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) {
|
1994-05-24 10:09:53 +00:00
|
|
|
if (p->p_flag & P_SYSTEM)
|
|
|
|
continue;
|
2008-03-19 06:19:01 +00:00
|
|
|
PROC_LOCK(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
|
|
|
switch (p->p_state) {
|
|
|
|
case PRS_NEW:
|
2008-03-19 06:19:01 +00:00
|
|
|
PROC_UNLOCK(p);
|
1994-05-24 10:09:53 +00:00
|
|
|
continue;
|
|
|
|
break;
|
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
|
|
|
default:
|
|
|
|
FOREACH_THREAD_IN_PROC(p, 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_lock(td);
|
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 (td->td_state) {
|
2002-09-11 08:13:56 +00:00
|
|
|
case TDS_INHIBITED:
|
2008-03-12 06:31:06 +00:00
|
|
|
if (TD_IS_SWAPPED(td))
|
2006-11-20 08:33:55 +00:00
|
|
|
total.t_sw++;
|
2008-03-12 06:31:06 +00:00
|
|
|
else if (TD_IS_SLEEPING(td) &&
|
|
|
|
td->td_priority <= PZERO)
|
|
|
|
total.t_dw++;
|
|
|
|
else
|
|
|
|
total.t_sl++;
|
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
|
|
|
break;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2002-09-11 08:13:56 +00:00
|
|
|
case TDS_CAN_RUN:
|
2006-11-20 08:33:55 +00:00
|
|
|
total.t_sw++;
|
2002-09-11 08:13:56 +00:00
|
|
|
break;
|
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 TDS_RUNQ:
|
|
|
|
case TDS_RUNNING:
|
2006-11-20 08:33:55 +00:00
|
|
|
total.t_rq++;
|
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);
|
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;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
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);
|
2001-01-24 11:28:36 +00:00
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2008-03-19 06:19:01 +00:00
|
|
|
PROC_UNLOCK(p);
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Note active objects.
|
|
|
|
*/
|
|
|
|
paging = 0;
|
2006-05-29 21:28:56 +00:00
|
|
|
vm = vmspace_acquire_ref(p);
|
|
|
|
if (vm == NULL)
|
|
|
|
continue;
|
|
|
|
map = &vm->vm_map;
|
2003-01-03 05:52:02 +00:00
|
|
|
vm_map_lock_read(map);
|
|
|
|
for (entry = map->header.next;
|
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
|
|
|
entry != &map->header; entry = entry->next) {
|
1999-02-07 21:48:23 +00:00
|
|
|
if ((entry->eflags & MAP_ENTRY_IS_SUB_MAP) ||
|
2003-01-03 05:52:02 +00:00
|
|
|
(object = entry->object.vm_object) == NULL)
|
1994-05-24 10:09:53 +00:00
|
|
|
continue;
|
2013-03-09 02:32:23 +00:00
|
|
|
VM_OBJECT_WLOCK(object);
|
2003-01-03 05:52:02 +00:00
|
|
|
vm_object_set_flag(object, OBJ_ACTIVE);
|
|
|
|
paging |= object->paging_in_progress;
|
2013-03-09 02:32:23 +00:00
|
|
|
VM_OBJECT_WUNLOCK(object);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2003-01-03 05:52:02 +00:00
|
|
|
vm_map_unlock_read(map);
|
2006-05-29 21:28:56 +00:00
|
|
|
vmspace_free(vm);
|
1994-05-24 10:09:53 +00:00
|
|
|
if (paging)
|
2006-11-20 08:33:55 +00:00
|
|
|
total.t_pw++;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2001-03-28 11:52:56 +00:00
|
|
|
sx_sunlock(&allproc_lock);
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Calculate object memory usage statistics.
|
|
|
|
*/
|
2002-04-20 07:23:22 +00:00
|
|
|
mtx_lock(&vm_object_list_mtx);
|
2001-04-15 10:22:04 +00:00
|
|
|
TAILQ_FOREACH(object, &vm_object_list, object_list) {
|
1999-01-21 08:29:12 +00:00
|
|
|
/*
|
2015-05-08 19:43:37 +00:00
|
|
|
* Perform unsynchronized reads on the object. In
|
|
|
|
* this case, the lack of synchronization should not
|
|
|
|
* impair the accuracy of the reported statistics.
|
1999-01-21 08:29:12 +00:00
|
|
|
*/
|
In the past four years, we've added two new vm object types. Each time,
similar changes had to be made in various places throughout the machine-
independent virtual memory layer to support the new vm object type.
However, in most of these places, it's actually not the type of the vm
object that matters to us but instead certain attributes of its pages.
For example, OBJT_DEVICE, OBJT_MGTDEVICE, and OBJT_SG objects contain
fictitious pages. In other words, in most of these places, we were
testing the vm object's type to determine if it contained fictitious (or
unmanaged) pages.
To both simplify the code in these places and make the addition of future
vm object types easier, this change introduces two new vm object flags
that describe attributes of the vm object's pages, specifically, whether
they are fictitious or unmanaged.
Reviewed and tested by: kib
2012-12-09 00:32:38 +00:00
|
|
|
if ((object->flags & OBJ_FICTITIOUS) != 0) {
|
2004-01-02 19:38:25 +00:00
|
|
|
/*
|
|
|
|
* Devices, like /dev/mem, will badly skew our totals.
|
|
|
|
*/
|
1999-01-21 08:29:12 +00:00
|
|
|
continue;
|
2003-01-03 05:52:02 +00:00
|
|
|
}
|
2006-11-20 00:16:00 +00:00
|
|
|
if (object->ref_count == 0) {
|
|
|
|
/*
|
|
|
|
* Also skip unreferenced objects, including
|
|
|
|
* vnodes representing mounted file systems.
|
|
|
|
*/
|
|
|
|
continue;
|
|
|
|
}
|
2006-11-20 08:33:55 +00:00
|
|
|
total.t_vm += object->size;
|
|
|
|
total.t_rm += object->resident_page_count;
|
1994-05-24 10:09:53 +00:00
|
|
|
if (object->flags & OBJ_ACTIVE) {
|
2006-11-20 08:33:55 +00:00
|
|
|
total.t_avm += object->size;
|
|
|
|
total.t_arm += object->resident_page_count;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
1996-09-08 20:44:49 +00:00
|
|
|
if (object->shadow_count > 1) {
|
1994-05-24 10:09:53 +00:00
|
|
|
/* shared object */
|
2006-11-20 08:33:55 +00:00
|
|
|
total.t_vmshr += object->size;
|
|
|
|
total.t_rmshr += object->resident_page_count;
|
1994-05-24 10:09:53 +00:00
|
|
|
if (object->flags & OBJ_ACTIVE) {
|
2006-11-20 08:33:55 +00:00
|
|
|
total.t_avmshr += object->size;
|
|
|
|
total.t_armshr += object->resident_page_count;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2002-04-20 07:23:22 +00:00
|
|
|
mtx_unlock(&vm_object_list_mtx);
|
2014-03-22 10:26:09 +00:00
|
|
|
total.t_free = vm_cnt.v_free_count + vm_cnt.v_cache_count;
|
2006-11-20 08:33:55 +00:00
|
|
|
return (sysctl_handle_opaque(oidp, &total, sizeof(total), req));
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
1995-11-14 09:29:34 +00:00
|
|
|
|
2002-04-04 21:38:47 +00:00
|
|
|
/*
|
|
|
|
* vcnt() - accumulate statistics from all cpus and the global cnt
|
|
|
|
* structure.
|
|
|
|
*
|
|
|
|
* The vmmeter structure is now per-cpu as well as global. Those
|
|
|
|
* statistics which can be kept on a per-cpu basis (to avoid cache
|
|
|
|
* stalls between cpus) can be moved to the per-cpu vmmeter. Remaining
|
|
|
|
* statistics, such as v_free_reserved, are left in the global
|
|
|
|
* structure.
|
|
|
|
*
|
|
|
|
* (sysctl_oid *oidp, void *arg1, int arg2, struct sysctl_req *req)
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
vcnt(SYSCTL_HANDLER_ARGS)
|
|
|
|
{
|
|
|
|
int count = *(int *)arg1;
|
2014-03-22 10:26:09 +00:00
|
|
|
int offset = (char *)arg1 - (char *)&vm_cnt;
|
2002-04-04 21:38:47 +00:00
|
|
|
int i;
|
|
|
|
|
2011-02-12 02:10:08 +00:00
|
|
|
CPU_FOREACH(i) {
|
2002-04-04 21:38:47 +00:00
|
|
|
struct pcpu *pcpu = pcpu_find(i);
|
|
|
|
count += *(int *)((char *)&pcpu->pc_cnt + offset);
|
|
|
|
}
|
2005-04-12 23:15:28 +00:00
|
|
|
return (SYSCTL_OUT(req, &count, sizeof(int)));
|
2002-04-04 21:38:47 +00:00
|
|
|
}
|
|
|
|
|
2009-01-23 22:49:23 +00:00
|
|
|
SYSCTL_PROC(_vm, VM_TOTAL, vmtotal, CTLTYPE_OPAQUE|CTLFLAG_RD|CTLFLAG_MPSAFE,
|
1999-05-03 23:57:32 +00:00
|
|
|
0, sizeof(struct vmtotal), vmtotal, "S,vmtotal",
|
|
|
|
"System virtual memory statistics");
|
2005-02-11 16:34:14 +00:00
|
|
|
SYSCTL_NODE(_vm, OID_AUTO, stats, CTLFLAG_RW, 0, "VM meter stats");
|
2005-02-10 12:18:36 +00:00
|
|
|
static SYSCTL_NODE(_vm_stats, OID_AUTO, sys, CTLFLAG_RW, 0,
|
|
|
|
"VM meter sys stats");
|
|
|
|
static SYSCTL_NODE(_vm_stats, OID_AUTO, vm, CTLFLAG_RW, 0,
|
|
|
|
"VM meter vm stats");
|
1998-10-31 17:21:31 +00:00
|
|
|
SYSCTL_NODE(_vm_stats, OID_AUTO, misc, CTLFLAG_RW, 0, "VM meter misc stats");
|
2002-04-04 21:38:47 +00:00
|
|
|
|
2011-12-14 13:25:00 +00:00
|
|
|
#define VM_STATS(parent, var, descr) \
|
|
|
|
SYSCTL_PROC(parent, OID_AUTO, var, \
|
2014-03-22 10:26:09 +00:00
|
|
|
CTLTYPE_UINT | CTLFLAG_RD | CTLFLAG_MPSAFE, &vm_cnt.var, 0, vcnt, \
|
2011-12-14 13:25:00 +00:00
|
|
|
"IU", descr)
|
|
|
|
#define VM_STATS_VM(var, descr) VM_STATS(_vm_stats_vm, var, descr)
|
|
|
|
#define VM_STATS_SYS(var, descr) VM_STATS(_vm_stats_sys, var, descr)
|
2002-04-04 21:38:47 +00:00
|
|
|
|
2011-12-13 00:38:50 +00:00
|
|
|
VM_STATS_SYS(v_swtch, "Context switches");
|
|
|
|
VM_STATS_SYS(v_trap, "Traps");
|
|
|
|
VM_STATS_SYS(v_syscall, "System calls");
|
|
|
|
VM_STATS_SYS(v_intr, "Device interrupts");
|
|
|
|
VM_STATS_SYS(v_soft, "Software interrupts");
|
2011-12-14 13:25:00 +00:00
|
|
|
VM_STATS_VM(v_vm_faults, "Address memory faults");
|
2013-01-28 12:54:53 +00:00
|
|
|
VM_STATS_VM(v_io_faults, "Page faults requiring I/O");
|
2011-12-14 13:25:00 +00:00
|
|
|
VM_STATS_VM(v_cow_faults, "Copy-on-write faults");
|
|
|
|
VM_STATS_VM(v_cow_optim, "Optimized COW faults");
|
|
|
|
VM_STATS_VM(v_zfod, "Pages zero-filled on demand");
|
|
|
|
VM_STATS_VM(v_ozfod, "Optimized zero fill pages");
|
|
|
|
VM_STATS_VM(v_swapin, "Swap pager pageins");
|
|
|
|
VM_STATS_VM(v_swapout, "Swap pager pageouts");
|
|
|
|
VM_STATS_VM(v_swappgsin, "Swap pages swapped in");
|
|
|
|
VM_STATS_VM(v_swappgsout, "Swap pages swapped out");
|
|
|
|
VM_STATS_VM(v_vnodein, "Vnode pager pageins");
|
|
|
|
VM_STATS_VM(v_vnodeout, "Vnode pager pageouts");
|
|
|
|
VM_STATS_VM(v_vnodepgsin, "Vnode pages paged in");
|
|
|
|
VM_STATS_VM(v_vnodepgsout, "Vnode pages paged out");
|
|
|
|
VM_STATS_VM(v_intrans, "In transit page faults");
|
|
|
|
VM_STATS_VM(v_reactivated, "Pages reactivated from free list");
|
|
|
|
VM_STATS_VM(v_pdwakeups, "Pagedaemon wakeups");
|
|
|
|
VM_STATS_VM(v_pdpages, "Pages analyzed by pagedaemon");
|
|
|
|
VM_STATS_VM(v_tcached, "Total pages cached");
|
|
|
|
VM_STATS_VM(v_dfree, "Pages freed by pagedaemon");
|
|
|
|
VM_STATS_VM(v_pfree, "Pages freed by exiting processes");
|
|
|
|
VM_STATS_VM(v_tfree, "Total pages freed");
|
|
|
|
VM_STATS_VM(v_page_size, "Page size in bytes");
|
|
|
|
VM_STATS_VM(v_page_count, "Total number of pages in system");
|
|
|
|
VM_STATS_VM(v_free_reserved, "Pages reserved for deadlock");
|
|
|
|
VM_STATS_VM(v_free_target, "Pages desired free");
|
|
|
|
VM_STATS_VM(v_free_min, "Minimum low-free-pages threshold");
|
|
|
|
VM_STATS_VM(v_free_count, "Free pages");
|
|
|
|
VM_STATS_VM(v_wire_count, "Wired pages");
|
|
|
|
VM_STATS_VM(v_active_count, "Active pages");
|
|
|
|
VM_STATS_VM(v_inactive_target, "Desired inactive pages");
|
|
|
|
VM_STATS_VM(v_inactive_count, "Inactive pages");
|
|
|
|
VM_STATS_VM(v_cache_count, "Pages on cache queue");
|
|
|
|
VM_STATS_VM(v_pageout_free_min, "Min pages reserved for kernel");
|
|
|
|
VM_STATS_VM(v_interrupt_free_min, "Reserved pages for interrupt code");
|
|
|
|
VM_STATS_VM(v_forks, "Number of fork() calls");
|
|
|
|
VM_STATS_VM(v_vforks, "Number of vfork() calls");
|
|
|
|
VM_STATS_VM(v_rforks, "Number of rfork() calls");
|
|
|
|
VM_STATS_VM(v_kthreads, "Number of fork() calls by kernel");
|
|
|
|
VM_STATS_VM(v_forkpages, "VM pages affected by fork()");
|
|
|
|
VM_STATS_VM(v_vforkpages, "VM pages affected by vfork()");
|
|
|
|
VM_STATS_VM(v_rforkpages, "VM pages affected by rfork()");
|
|
|
|
VM_STATS_VM(v_kthreadpages, "VM pages affected by fork() by kernel");
|
2011-12-13 00:38:50 +00:00
|
|
|
|
|
|
|
SYSCTL_INT(_vm_stats_misc, OID_AUTO, zero_page_count, CTLFLAG_RD,
|
|
|
|
&vm_page_zero_count, 0, "Number of zero-ed free pages");
|