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