|
|
1.1 root 1: /*
2: * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * The contents of this file constitute Original Code as defined in and
7: * are subject to the Apple Public Source License Version 1.1 (the
8: * "License"). You may not use this file except in compliance with the
9: * License. Please obtain a copy of the License at
10: * http://www.apple.com/publicsource and read it before using this file.
11: *
12: * This Original Code and all software distributed under the License are
13: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17: * License for the specific language governing rights and limitations
18: * under the License.
19: *
20: * @APPLE_LICENSE_HEADER_END@
21: */
22: /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
23: /*-
24: * Copyright (c) 1982, 1986, 1993
25: * The Regents of the University of California. All rights reserved.
26: *
27: * Redistribution and use in source and binary forms, with or without
28: * modification, are permitted provided that the following conditions
29: * are met:
30: * 1. Redistributions of source code must retain the above copyright
31: * notice, this list of conditions and the following disclaimer.
32: * 2. Redistributions in binary form must reproduce the above copyright
33: * notice, this list of conditions and the following disclaimer in the
34: * documentation and/or other materials provided with the distribution.
35: * 3. All advertising materials mentioning features or use of this software
36: * must display the following acknowledgement:
37: * This product includes software developed by the University of
38: * California, Berkeley and its contributors.
39: * 4. Neither the name of the University nor the names of its contributors
40: * may be used to endorse or promote products derived from this software
41: * without specific prior written permission.
42: *
43: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
44: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
45: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
46: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
47: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
48: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
49: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
50: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
51: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
52: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
53: * SUCH DAMAGE.
54: *
55: * @(#)vmmeter.h 8.2 (Berkeley) 7/10/94
56: */
57:
58: #ifndef _SYS_VMMETER_H_
59: #define _SYS_VMMETER_H_
60:
61: /*
62: * System wide statistics counters.
63: */
64: struct vmmeter {
65: /*
66: * General system activity.
67: */
68: u_int v_swtch; /* context switches */
69: u_int v_trap; /* calls to trap */
70: u_int v_syscall; /* calls to syscall() */
71: u_int v_intr; /* device interrupts */
72: u_int v_soft; /* software interrupts */
73: u_int v_faults; /* total faults taken */
74: /*
75: * Virtual memory activity.
76: */
77: u_int v_lookups; /* object cache lookups */
78: u_int v_hits; /* object cache hits */
79: u_int v_vm_faults; /* number of address memory faults */
80: u_int v_cow_faults; /* number of copy-on-writes */
81: u_int v_swpin; /* swapins */
82: u_int v_swpout; /* swapouts */
83: u_int v_pswpin; /* pages swapped in */
84: u_int v_pswpout; /* pages swapped out */
85: u_int v_pageins; /* number of pageins */
86: u_int v_pageouts; /* number of pageouts */
87: u_int v_pgpgin; /* pages paged in */
88: u_int v_pgpgout; /* pages paged out */
89: u_int v_intrans; /* intransit blocking page faults */
90: u_int v_reactivated; /* number of pages reactivated from free list */
91: u_int v_rev; /* revolutions of the hand */
92: u_int v_scan; /* scans in page out daemon */
93: u_int v_dfree; /* pages freed by daemon */
94: u_int v_pfree; /* pages freed by exiting processes */
95: u_int v_zfod; /* pages zero filled on demand */
96: u_int v_nzfod; /* number of zfod's created */
97: /*
98: * Distribution of page usages.
99: */
100: u_int v_page_size; /* page size in bytes */
101: u_int v_kernel_pages; /* number of pages in use by kernel */
102: u_int v_free_target; /* number of pages desired free */
103: u_int v_free_min; /* minimum number of pages desired free */
104: u_int v_free_count; /* number of pages free */
105: u_int v_wire_count; /* number of pages wired down */
106: u_int v_active_count; /* number of pages active */
107: u_int v_inactive_target; /* number of pages desired inactive */
108: u_int v_inactive_count; /* number of pages inactive */
109: };
110: #ifdef KERNEL
111: extern struct vmmeter cnt;
112: #endif
113:
114: /* systemwide totals computed every five seconds */
115: struct vmtotal
116: {
117: int16_t t_rq; /* length of the run queue */
118: int16_t t_dw; /* jobs in ``disk wait'' (neg priority) */
119: int16_t t_pw; /* jobs in page wait */
120: int16_t t_sl; /* jobs sleeping in core */
121: int16_t t_sw; /* swapped out runnable/short block jobs */
122: int32_t t_vm; /* total virtual memory */
123: int32_t t_avm; /* active virtual memory */
124: int32_t t_rm; /* total real memory in use */
125: int32_t t_arm; /* active real memory */
126: int32_t t_vmshr; /* shared virtual memory */
127: int32_t t_avmshr; /* active shared virtual memory */
128: int32_t t_rmshr; /* shared real memory */
129: int32_t t_armshr; /* active shared real memory */
130: int32_t t_free; /* free memory pages */
131: };
132: #ifdef KERNEL
133: extern struct vmtotal total;
134: #endif
135:
136: #endif /* !_SYS_VMMETER_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.