uvm_stat.c revision 1.29 1 1.29 yamt /* $NetBSD: uvm_stat.c,v 1.29 2005/11/29 15:45:28 yamt Exp $ */
2 1.1 mrg
3 1.1 mrg /*
4 1.1 mrg *
5 1.1 mrg * Copyright (c) 1997 Charles D. Cranor and Washington University.
6 1.1 mrg * All rights reserved.
7 1.1 mrg *
8 1.1 mrg * Redistribution and use in source and binary forms, with or without
9 1.1 mrg * modification, are permitted provided that the following conditions
10 1.1 mrg * are met:
11 1.1 mrg * 1. Redistributions of source code must retain the above copyright
12 1.1 mrg * notice, this list of conditions and the following disclaimer.
13 1.1 mrg * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 mrg * notice, this list of conditions and the following disclaimer in the
15 1.1 mrg * documentation and/or other materials provided with the distribution.
16 1.1 mrg * 3. All advertising materials mentioning features or use of this software
17 1.1 mrg * must display the following acknowledgement:
18 1.1 mrg * This product includes software developed by Charles D. Cranor and
19 1.1 mrg * Washington University.
20 1.1 mrg * 4. The name of the author may not be used to endorse or promote products
21 1.1 mrg * derived from this software without specific prior written permission.
22 1.1 mrg *
23 1.1 mrg * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
24 1.1 mrg * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
25 1.1 mrg * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 1.1 mrg * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
27 1.1 mrg * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
28 1.1 mrg * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 1.1 mrg * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 1.1 mrg * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 1.1 mrg * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
32 1.1 mrg * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 1.3 mrg *
34 1.7 thorpej * from: Id: uvm_stat.c,v 1.1.2.3 1997/12/19 15:01:00 mrg Exp
35 1.1 mrg */
36 1.4 mrg
37 1.1 mrg /*
38 1.1 mrg * uvm_stat.c
39 1.1 mrg */
40 1.21 lukem
41 1.21 lukem #include <sys/cdefs.h>
42 1.29 yamt __KERNEL_RCSID(0, "$NetBSD: uvm_stat.c,v 1.29 2005/11/29 15:45:28 yamt Exp $");
43 1.21 lukem
44 1.21 lukem #include "opt_uvmhist.h"
45 1.29 yamt #include "opt_readahead.h"
46 1.21 lukem #include "opt_ddb.h"
47 1.1 mrg
48 1.1 mrg #include <sys/param.h>
49 1.1 mrg #include <sys/systm.h>
50 1.1 mrg
51 1.1 mrg #include <uvm/uvm.h>
52 1.15 chs #include <uvm/uvm_ddb.h>
53 1.1 mrg
54 1.5 thorpej /*
55 1.5 thorpej * globals
56 1.5 thorpej */
57 1.5 thorpej
58 1.6 thorpej #ifdef UVMHIST
59 1.6 thorpej struct uvm_history_head uvm_histories;
60 1.6 thorpej #endif
61 1.6 thorpej
62 1.5 thorpej #ifdef UVMHIST_PRINT
63 1.5 thorpej int uvmhist_print_enabled = 1;
64 1.5 thorpej #endif
65 1.1 mrg
66 1.15 chs #ifdef DDB
67 1.15 chs
68 1.1 mrg /*
69 1.1 mrg * prototypes
70 1.1 mrg */
71 1.1 mrg
72 1.6 thorpej #ifdef UVMHIST
73 1.23 junyoung void uvmhist_dump(struct uvm_history *);
74 1.23 junyoung void uvm_hist(u_int32_t);
75 1.23 junyoung static void uvmhist_dump_histories(struct uvm_history *[]);
76 1.6 thorpej #endif
77 1.23 junyoung void uvmcnt_dump(void);
78 1.1 mrg
79 1.10 mrg
80 1.1 mrg #ifdef UVMHIST
81 1.1 mrg /* call this from ddb */
82 1.1 mrg void
83 1.28 thorpej uvmhist_dump(struct uvm_history *l)
84 1.7 thorpej {
85 1.7 thorpej int lcv, s;
86 1.1 mrg
87 1.7 thorpej s = splhigh();
88 1.7 thorpej lcv = l->f;
89 1.7 thorpej do {
90 1.7 thorpej if (l->e[lcv].fmt)
91 1.7 thorpej uvmhist_print(&l->e[lcv]);
92 1.7 thorpej lcv = (lcv + 1) % l->n;
93 1.7 thorpej } while (lcv != l->f);
94 1.7 thorpej splx(s);
95 1.10 mrg }
96 1.10 mrg
97 1.10 mrg /*
98 1.10 mrg * print a merged list of uvm_history structures
99 1.10 mrg */
100 1.10 mrg static void
101 1.28 thorpej uvmhist_dump_histories(struct uvm_history *hists[])
102 1.10 mrg {
103 1.10 mrg struct timeval tv;
104 1.10 mrg int cur[MAXHISTS];
105 1.10 mrg int s, lcv, hi;
106 1.10 mrg
107 1.10 mrg /* so we don't get corrupted lists! */
108 1.10 mrg s = splhigh();
109 1.10 mrg
110 1.10 mrg /* find the first of each list */
111 1.10 mrg for (lcv = 0; hists[lcv]; lcv++)
112 1.10 mrg cur[lcv] = hists[lcv]->f;
113 1.10 mrg
114 1.10 mrg /*
115 1.10 mrg * here we loop "forever", finding the next earliest
116 1.10 mrg * history entry and printing it. cur[X] is the current
117 1.10 mrg * entry to test for the history in hists[X]. if it is
118 1.10 mrg * -1, then this history is finished.
119 1.10 mrg */
120 1.10 mrg for (;;) {
121 1.10 mrg hi = -1;
122 1.10 mrg tv.tv_sec = tv.tv_usec = 0;
123 1.10 mrg
124 1.10 mrg /* loop over each history */
125 1.10 mrg for (lcv = 0; hists[lcv]; lcv++) {
126 1.10 mrg restart:
127 1.10 mrg if (cur[lcv] == -1)
128 1.10 mrg continue;
129 1.10 mrg
130 1.10 mrg /*
131 1.10 mrg * if the format is empty, go to the next entry
132 1.10 mrg * and retry.
133 1.10 mrg */
134 1.10 mrg if (hists[lcv]->e[cur[lcv]].fmt == NULL) {
135 1.10 mrg cur[lcv] = (cur[lcv] + 1) % (hists[lcv]->n);
136 1.10 mrg if (cur[lcv] == hists[lcv]->f)
137 1.10 mrg cur[lcv] = -1;
138 1.10 mrg goto restart;
139 1.10 mrg }
140 1.19 chs
141 1.10 mrg /*
142 1.10 mrg * if the time hasn't been set yet, or this entry is
143 1.10 mrg * earlier than the current tv, set the time and history
144 1.10 mrg * index.
145 1.10 mrg */
146 1.10 mrg if (tv.tv_sec == 0 ||
147 1.10 mrg timercmp(&hists[lcv]->e[cur[lcv]].tv, &tv, <)) {
148 1.10 mrg tv = hists[lcv]->e[cur[lcv]].tv;
149 1.10 mrg hi = lcv;
150 1.10 mrg }
151 1.10 mrg }
152 1.10 mrg
153 1.10 mrg /* if we didn't find any entries, we must be done */
154 1.10 mrg if (hi == -1)
155 1.10 mrg break;
156 1.10 mrg
157 1.10 mrg /* print and move to the next entry */
158 1.10 mrg uvmhist_print(&hists[hi]->e[cur[hi]]);
159 1.10 mrg cur[hi] = (cur[hi] + 1) % (hists[hi]->n);
160 1.10 mrg if (cur[hi] == hists[hi]->f)
161 1.10 mrg cur[hi] = -1;
162 1.10 mrg }
163 1.10 mrg splx(s);
164 1.10 mrg }
165 1.10 mrg
166 1.10 mrg /*
167 1.10 mrg * call this from ddb. `bitmask' is from <uvm/uvm_stat.h>. it
168 1.10 mrg * merges the named histories.
169 1.10 mrg */
170 1.10 mrg void
171 1.28 thorpej uvm_hist(u_int32_t bitmask) /* XXX only support 32 hists */
172 1.10 mrg {
173 1.10 mrg struct uvm_history *hists[MAXHISTS + 1];
174 1.10 mrg int i = 0;
175 1.10 mrg
176 1.10 mrg if ((bitmask & UVMHIST_MAPHIST) || bitmask == 0)
177 1.10 mrg hists[i++] = &maphist;
178 1.10 mrg
179 1.10 mrg if ((bitmask & UVMHIST_PDHIST) || bitmask == 0)
180 1.10 mrg hists[i++] = &pdhist;
181 1.17 mrg
182 1.17 mrg if ((bitmask & UVMHIST_UBCHIST) || bitmask == 0)
183 1.17 mrg hists[i++] = &ubchist;
184 1.10 mrg
185 1.25 yamt if ((bitmask & UVMHIST_LOANHIST) || bitmask == 0)
186 1.25 yamt hists[i++] = &loanhist;
187 1.25 yamt
188 1.10 mrg hists[i] = NULL;
189 1.10 mrg
190 1.10 mrg uvmhist_dump_histories(hists);
191 1.1 mrg }
192 1.7 thorpej #endif /* UVMHIST */
193 1.1 mrg
194 1.1 mrg /*
195 1.15 chs * uvmexp_print: ddb hook to print interesting uvm counters
196 1.1 mrg */
197 1.15 chs void
198 1.15 chs uvmexp_print(void (*pr)(const char *, ...))
199 1.7 thorpej {
200 1.1 mrg
201 1.15 chs (*pr)("Current UVM status:\n");
202 1.15 chs (*pr)(" pagesize=%d (0x%x), pagemask=0x%x, pageshift=%d\n",
203 1.7 thorpej uvmexp.pagesize, uvmexp.pagesize, uvmexp.pagemask,
204 1.7 thorpej uvmexp.pageshift);
205 1.15 chs (*pr)(" %d VM pages: %d active, %d inactive, %d wired, %d free\n",
206 1.7 thorpej uvmexp.npages, uvmexp.active, uvmexp.inactive, uvmexp.wired,
207 1.7 thorpej uvmexp.free);
208 1.22 chs (*pr)(" min %d%% (%d) anon, %d%% (%d) file, %d%% (%d) exec\n",
209 1.22 chs uvmexp.anonminpct, uvmexp.anonmin, uvmexp.fileminpct,
210 1.22 chs uvmexp.filemin, uvmexp.execminpct, uvmexp.execmin);
211 1.22 chs (*pr)(" max %d%% (%d) anon, %d%% (%d) file, %d%% (%d) exec\n",
212 1.22 chs uvmexp.anonmaxpct, uvmexp.anonmax, uvmexp.filemaxpct,
213 1.22 chs uvmexp.filemax, uvmexp.execmaxpct, uvmexp.execmax);
214 1.22 chs (*pr)(" pages %d anon, %d file, %d exec\n",
215 1.22 chs uvmexp.anonpages, uvmexp.filepages, uvmexp.execpages);
216 1.15 chs (*pr)(" freemin=%d, free-target=%d, inactive-target=%d, "
217 1.7 thorpej "wired-max=%d\n", uvmexp.freemin, uvmexp.freetarg, uvmexp.inactarg,
218 1.7 thorpej uvmexp.wiredmax);
219 1.15 chs (*pr)(" faults=%d, traps=%d, intrs=%d, ctxswitch=%d\n",
220 1.7 thorpej uvmexp.faults, uvmexp.traps, uvmexp.intrs, uvmexp.swtch);
221 1.15 chs (*pr)(" softint=%d, syscalls=%d, swapins=%d, swapouts=%d\n",
222 1.7 thorpej uvmexp.softs, uvmexp.syscalls, uvmexp.swapins, uvmexp.swapouts);
223 1.7 thorpej
224 1.15 chs (*pr)(" fault counts:\n");
225 1.15 chs (*pr)(" noram=%d, noanon=%d, pgwait=%d, pgrele=%d\n",
226 1.7 thorpej uvmexp.fltnoram, uvmexp.fltnoanon, uvmexp.fltpgwait,
227 1.7 thorpej uvmexp.fltpgrele);
228 1.15 chs (*pr)(" ok relocks(total)=%d(%d), anget(retrys)=%d(%d), "
229 1.7 thorpej "amapcopy=%d\n", uvmexp.fltrelckok, uvmexp.fltrelck,
230 1.7 thorpej uvmexp.fltanget, uvmexp.fltanretry, uvmexp.fltamcopy);
231 1.15 chs (*pr)(" neighbor anon/obj pg=%d/%d, gets(lock/unlock)=%d/%d\n",
232 1.7 thorpej uvmexp.fltnamap, uvmexp.fltnomap, uvmexp.fltlget, uvmexp.fltget);
233 1.15 chs (*pr)(" cases: anon=%d, anoncow=%d, obj=%d, prcopy=%d, przero=%d\n",
234 1.7 thorpej uvmexp.flt_anon, uvmexp.flt_acow, uvmexp.flt_obj, uvmexp.flt_prcopy,
235 1.7 thorpej uvmexp.flt_przero);
236 1.7 thorpej
237 1.15 chs (*pr)(" daemon and swap counts:\n");
238 1.15 chs (*pr)(" woke=%d, revs=%d, scans=%d, obscans=%d, anscans=%d\n",
239 1.15 chs uvmexp.pdwoke, uvmexp.pdrevs, uvmexp.pdscans, uvmexp.pdobscan,
240 1.15 chs uvmexp.pdanscan);
241 1.15 chs (*pr)(" busy=%d, freed=%d, reactivate=%d, deactivate=%d\n",
242 1.7 thorpej uvmexp.pdbusy, uvmexp.pdfreed, uvmexp.pdreact, uvmexp.pddeact);
243 1.15 chs (*pr)(" pageouts=%d, pending=%d, nswget=%d\n", uvmexp.pdpageouts,
244 1.7 thorpej uvmexp.pdpending, uvmexp.nswget);
245 1.27 yamt (*pr)(" nswapdev=%d, swpgavail=%d\n",
246 1.27 yamt uvmexp.nswapdev, uvmexp.swpgavail);
247 1.27 yamt (*pr)(" swpages=%d, swpginuse=%d, swpgonly=%d, paging=%d\n",
248 1.12 chs uvmexp.swpages, uvmexp.swpginuse, uvmexp.swpgonly, uvmexp.paging);
249 1.1 mrg }
250 1.15 chs #endif
251 1.29 yamt
252 1.29 yamt #if defined(READAHEAD_STATS)
253 1.29 yamt
254 1.29 yamt #define UVM_RA_EVCNT_DEFINE(name) \
255 1.29 yamt struct evcnt uvm_ra_##name = \
256 1.29 yamt EVCNT_INITIALIZER(EVCNT_TYPE_MISC, NULL, "readahead", #name); \
257 1.29 yamt EVCNT_ATTACH_STATIC(uvm_ra_##name);
258 1.29 yamt
259 1.29 yamt UVM_RA_EVCNT_DEFINE(total);
260 1.29 yamt UVM_RA_EVCNT_DEFINE(hit);
261 1.29 yamt UVM_RA_EVCNT_DEFINE(miss);
262 1.29 yamt
263 1.29 yamt #endif /* defined(READAHEAD_STATS) */
264