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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
|
/* $OpenBSD: uvm_stat.c,v 1.20 2009/03/20 15:19:04 oga Exp $ */
/* $NetBSD: uvm_stat.c,v 1.18 2001/03/09 01:02:13 chs Exp $ */
/*
*
* Copyright (c) 1997 Charles D. Cranor and Washington University.
* 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 Charles D. Cranor and
* Washington University.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
*
* from: Id: uvm_stat.c,v 1.1.2.3 1997/12/19 15:01:00 mrg Exp
*/
/*
* uvm_stat.c
*/
#include <sys/param.h>
#include <sys/systm.h>
#include <uvm/uvm.h>
#include <uvm/uvm_ddb.h>
/*
* globals
*/
struct uvm_cnt *uvm_cnt_head = NULL;
#ifdef UVMHIST
struct uvm_history_head uvm_histories;
#endif
#ifdef UVMHIST_PRINT
int uvmhist_print_enabled = 1;
#endif
#ifdef DDB
/*
* prototypes
*/
#ifdef UVMHIST
void uvmhist_dump(struct uvm_history *);
void uvm_hist(u_int32_t);
static void uvmhist_dump_histories(struct uvm_history *[]);
#endif
void uvmcnt_dump(void);
#ifdef UVMHIST
/* call this from ddb */
void
uvmhist_dump(struct uvm_history *l)
{
int lcv, s;
s = splhigh();
lcv = l->f;
do {
if (l->e[lcv].fmt)
uvmhist_print(&l->e[lcv]);
lcv = (lcv + 1) % l->n;
} while (lcv != l->f);
splx(s);
}
/*
* print a merged list of uvm_history structures
*/
static void
uvmhist_dump_histories(struct uvm_history *hists[])
{
struct timeval tv;
int cur[MAXHISTS];
int s, lcv, hi;
/* so we don't get corrupted lists! */
s = splhigh();
/* find the first of each list */
for (lcv = 0; hists[lcv]; lcv++)
cur[lcv] = hists[lcv]->f;
/*
* here we loop "forever", finding the next earliest
* history entry and printing it. cur[X] is the current
* entry to test for the history in hists[X]. if it is
* -1, then this history is finished.
*/
for (;;) {
hi = -1;
tv.tv_sec = tv.tv_usec = 0;
/* loop over each history */
for (lcv = 0; hists[lcv]; lcv++) {
restart:
if (cur[lcv] == -1)
continue;
/*
* if the format is empty, go to the next entry
* and retry.
*/
if (hists[lcv]->e[cur[lcv]].fmt == NULL) {
cur[lcv] = (cur[lcv] + 1) % (hists[lcv]->n);
if (cur[lcv] == hists[lcv]->f)
cur[lcv] = -1;
goto restart;
}
/*
* if the time hasn't been set yet, or this entry is
* earlier than the current tv, set the time and history
* index.
*/
if (tv.tv_sec == 0 ||
timercmp(&hists[lcv]->e[cur[lcv]].tv, &tv, <)) {
tv = hists[lcv]->e[cur[lcv]].tv;
hi = lcv;
}
}
/* if we didn't find any entries, we must be done */
if (hi == -1)
break;
/* print and move to the next entry */
uvmhist_print(&hists[hi]->e[cur[hi]]);
cur[hi] = (cur[hi] + 1) % (hists[hi]->n);
if (cur[hi] == hists[hi]->f)
cur[hi] = -1;
}
/* done! */
splx(s);
}
/*
* call this from ddb. `bitmask' is from <uvm/uvm_stat.h>. it
* merges the named histories.
*/
void
uvm_hist(u_int32_t bitmask) /* XXX only support 32 hists */
{
struct uvm_history *hists[MAXHISTS + 1];
int i = 0;
if ((bitmask & UVMHIST_MAPHIST) || bitmask == 0)
hists[i++] = &maphist;
if ((bitmask & UVMHIST_PDHIST) || bitmask == 0)
hists[i++] = &pdhist;
hists[i] = NULL;
uvmhist_dump_histories(hists);
}
#endif /* UVMHIST */
void
uvmcnt_dump()
{
struct uvm_cnt *uvc = uvm_cnt_head;
while (uvc) {
if ((uvc->t & UVMCNT_MASK) != UVMCNT_CNT)
continue;
printf("%s = %d\n", uvc->name, uvc->c);
uvc = uvc->next;
}
}
/*
* uvmexp_print: ddb hook to print interesting uvm counters
*/
void
uvmexp_print(int (*pr)(const char *, ...))
{
(*pr)("Current UVM status:\n");
(*pr)(" pagesize=%d (0x%x), pagemask=0x%x, pageshift=%d\n",
uvmexp.pagesize, uvmexp.pagesize, uvmexp.pagemask,
uvmexp.pageshift);
(*pr)(" %d VM pages: %d active, %d inactive, %d wired, %d free\n",
uvmexp.npages, uvmexp.active, uvmexp.inactive, uvmexp.wired,
uvmexp.free);
(*pr)(" min %d%% (%d) anon, %d%% (%d) vnode, %d%% (%d) vtext\n",
uvmexp.anonminpct, uvmexp.anonmin, uvmexp.vnodeminpct,
uvmexp.vnodemin, uvmexp.vtextminpct, uvmexp.vtextmin);
(*pr)(" pages %d anon, %d vnode, %d vtext\n",
uvmexp.anonpages, uvmexp.vnodepages, uvmexp.vtextpages);
(*pr)(" freemin=%d, free-target=%d, inactive-target=%d, "
"wired-max=%d\n", uvmexp.freemin, uvmexp.freetarg, uvmexp.inactarg,
uvmexp.wiredmax);
(*pr)(" faults=%d, traps=%d, intrs=%d, ctxswitch=%d fpuswitch=%d\n",
uvmexp.faults, uvmexp.traps, uvmexp.intrs, uvmexp.swtch,
uvmexp.fpswtch);
(*pr)(" softint=%d, syscalls=%d, swapins=%d, swapouts=%d, "
"kmapent=%d\n", uvmexp.softs, uvmexp.syscalls, uvmexp.swapins,
uvmexp.swapouts, uvmexp.kmapent);
(*pr)(" fault counts:\n");
(*pr)(" noram=%d, noanon=%d, pgwait=%d, pgrele=%d\n",
uvmexp.fltnoram, uvmexp.fltnoanon, uvmexp.fltpgwait,
uvmexp.fltpgrele);
(*pr)(" ok relocks(total)=%d(%d), anget(retries)=%d(%d), "
"amapcopy=%d\n", uvmexp.fltrelckok, uvmexp.fltrelck,
uvmexp.fltanget, uvmexp.fltanretry, uvmexp.fltamcopy);
(*pr)(" neighbor anon/obj pg=%d/%d, gets(lock/unlock)=%d/%d\n",
uvmexp.fltnamap, uvmexp.fltnomap, uvmexp.fltlget, uvmexp.fltget);
(*pr)(" cases: anon=%d, anoncow=%d, obj=%d, prcopy=%d, przero=%d\n",
uvmexp.flt_anon, uvmexp.flt_acow, uvmexp.flt_obj, uvmexp.flt_prcopy,
uvmexp.flt_przero);
(*pr)(" daemon and swap counts:\n");
(*pr)(" woke=%d, revs=%d, scans=%d, obscans=%d, anscans=%d\n",
uvmexp.pdwoke, uvmexp.pdrevs, uvmexp.pdscans, uvmexp.pdobscan,
uvmexp.pdanscan);
(*pr)(" busy=%d, freed=%d, reactivate=%d, deactivate=%d\n",
uvmexp.pdbusy, uvmexp.pdfreed, uvmexp.pdreact, uvmexp.pddeact);
(*pr)(" pageouts=%d, pending=%d, nswget=%d\n", uvmexp.pdpageouts,
uvmexp.pdpending, uvmexp.nswget);
(*pr)(" nswapdev=%d, nanon=%d, nanonneeded=%d nfreeanon=%d\n",
uvmexp.nswapdev, uvmexp.nanon, uvmexp.nanonneeded,
uvmexp.nfreeanon);
(*pr)(" swpages=%d, swpginuse=%d, swpgonly=%d paging=%d\n",
uvmexp.swpages, uvmexp.swpginuse, uvmexp.swpgonly, uvmexp.paging);
(*pr)(" kernel pointers:\n");
(*pr)(" objs(kern)=%p\n", uvm.kernel_object);
}
#endif
|
