1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
/*-
* Copyright (c) 1982, 1986, 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.
*
* @(#)vmmeter.h 8.1 (Berkeley) 6/2/93
*/
/*
* System wide statistics counters.
*/
struct vmmeter {
/*
* General system activity.
*/
unsigned v_swtch; /* context switches */
unsigned v_trap; /* calls to trap */
unsigned v_syscall; /* calls to syscall() */
unsigned v_intr; /* device interrupts */
unsigned v_soft; /* software interrupts */
unsigned v_faults; /* total faults taken */
/*
* Virtual memory activity.
*/
unsigned v_lookups; /* object cache lookups */
unsigned v_hits; /* object cache hits */
unsigned v_vm_faults; /* number of address memory faults */
unsigned v_cow_faults; /* number of copy-on-writes */
unsigned v_swpin; /* swapins */
unsigned v_swpout; /* swapouts */
unsigned v_pswpin; /* pages swapped in */
unsigned v_pswpout; /* pages swapped out */
unsigned v_pageins; /* number of pageins */
unsigned v_pageouts; /* number of pageouts */
unsigned v_pgpgin; /* pages paged in */
unsigned v_pgpgout; /* pages paged out */
unsigned v_intrans; /* intransit blocking page faults */
unsigned v_reactivated; /* number of pages reactivated from free list */
unsigned v_rev; /* revolutions of the hand */
unsigned v_scan; /* scans in page out daemon */
unsigned v_dfree; /* pages freed by daemon */
unsigned v_pfree; /* pages freed by exiting processes */
unsigned v_zfod; /* pages zero filled on demand */
unsigned v_nzfod; /* number of zfod's created */
/*
* Distribution of page usages.
*/
unsigned v_page_size; /* page size in bytes */
unsigned v_kernel_pages;/* number of pages in use by kernel */
unsigned v_free_target; /* number of pages desired free */
unsigned v_free_min; /* minimum number of pages desired free */
unsigned v_free_count; /* number of pages free */
unsigned v_wire_count; /* number of pages wired down */
unsigned v_active_count;/* number of pages active */
unsigned v_inactive_target; /* number of pages desired inactive */
unsigned v_inactive_count; /* number of pages inactive */
};
#ifdef KERNEL
struct vmmeter cnt;
#endif
/* systemwide totals computed every five seconds */
struct vmtotal
{
short t_rq; /* length of the run queue */
short t_dw; /* jobs in ``disk wait'' (neg priority) */
short t_pw; /* jobs in page wait */
short t_sl; /* jobs sleeping in core */
short t_sw; /* swapped out runnable/short block jobs */
long t_vm; /* total virtual memory */
long t_avm; /* active virtual memory */
long t_rm; /* total real memory in use */
long t_arm; /* active real memory */
long t_vmshr; /* shared virtual memory */
long t_avmshr; /* active shared virtual memory */
long t_rmshr; /* shared real memory */
long t_armshr; /* active shared real memory */
long t_free; /* free memory pages */
};
#ifdef KERNEL
struct vmtotal total;
#endif
/*
* Optional instrumentation.
*/
#ifdef PGINPROF
#define NDMON 128
#define NSMON 128
#define DRES 20
#define SRES 5
#define PMONMIN 20
#define PRES 50
#define NPMON 64
#define RMONMIN 130
#define RRES 5
#define NRMON 64
/* data and stack size distribution counters */
unsigned int dmon[NDMON+1];
unsigned int smon[NSMON+1];
/* page in time distribution counters */
unsigned int pmon[NPMON+2];
/* reclaim time distribution counters */
unsigned int rmon[NRMON+2];
int pmonmin;
int pres;
int rmonmin;
int rres;
unsigned rectime; /* accumulator for reclaim times */
unsigned pgintime; /* accumulator for page in times */
#endif
|
