uvm_stat.c revision 1.17
1 /* $NetBSD: uvm_stat.c,v 1.17 2001/02/04 10:55:58 mrg 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 #include "opt_uvmhist.h" 38 #include "opt_ddb.h" 39 40 /* 41 * uvm_stat.c 42 */ 43 44 #include <sys/param.h> 45 #include <sys/systm.h> 46 47 #include <uvm/uvm.h> 48 #include <uvm/uvm_ddb.h> 49 50 /* 51 * globals 52 */ 53 54 struct uvm_cnt *uvm_cnt_head = NULL; 55 56 #ifdef UVMHIST 57 struct uvm_history_head uvm_histories; 58 #endif 59 60 #ifdef UVMHIST_PRINT 61 int uvmhist_print_enabled = 1; 62 #endif 63 64 #ifdef DDB 65 66 /* 67 * prototypes 68 */ 69 70 #ifdef UVMHIST 71 void uvmhist_dump __P((struct uvm_history *)); 72 void uvm_hist __P((u_int32_t)); 73 static void uvmhist_dump_histories __P((struct uvm_history *[])); 74 #endif 75 void uvmcnt_dump __P((void)); 76 77 78 #ifdef UVMHIST 79 /* call this from ddb */ 80 void 81 uvmhist_dump(l) 82 struct uvm_history *l; 83 { 84 int lcv, s; 85 86 s = splhigh(); 87 lcv = l->f; 88 do { 89 if (l->e[lcv].fmt) 90 uvmhist_print(&l->e[lcv]); 91 lcv = (lcv + 1) % l->n; 92 } while (lcv != l->f); 93 splx(s); 94 } 95 96 /* 97 * print a merged list of uvm_history structures 98 */ 99 static void 100 uvmhist_dump_histories(hists) 101 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 164 /* done! */ 165 splx(s); 166 } 167 168 /* 169 * call this from ddb. `bitmask' is from <uvm/uvm_stat.h>. it 170 * merges the named histories. 171 */ 172 void 173 uvm_hist(bitmask) 174 u_int32_t bitmask; /* XXX only support 32 hists */ 175 { 176 struct uvm_history *hists[MAXHISTS + 1]; 177 int i = 0; 178 179 if ((bitmask & UVMHIST_MAPHIST) || bitmask == 0) 180 hists[i++] = &maphist; 181 182 if ((bitmask & UVMHIST_PDHIST) || bitmask == 0) 183 hists[i++] = &pdhist; 184 185 if ((bitmask & UVMHIST_UBCHIST) || bitmask == 0) 186 hists[i++] = &ubchist; 187 188 hists[i] = NULL; 189 190 uvmhist_dump_histories(hists); 191 } 192 #endif /* UVMHIST */ 193 194 void 195 uvmcnt_dump() 196 { 197 struct uvm_cnt *uvc = uvm_cnt_head; 198 199 while (uvc) { 200 if ((uvc->t & UVMCNT_MASK) != UVMCNT_CNT) 201 continue; 202 printf("%s = %d\n", uvc->name, uvc->c); 203 uvc = uvc->next; 204 } 205 } 206 207 /* 208 * uvmexp_print: ddb hook to print interesting uvm counters 209 */ 210 void 211 uvmexp_print(void (*pr)(const char *, ...)) 212 { 213 214 (*pr)("Current UVM status:\n"); 215 (*pr)(" pagesize=%d (0x%x), pagemask=0x%x, pageshift=%d\n", 216 uvmexp.pagesize, uvmexp.pagesize, uvmexp.pagemask, 217 uvmexp.pageshift); 218 (*pr)(" %d VM pages: %d active, %d inactive, %d wired, %d free\n", 219 uvmexp.npages, uvmexp.active, uvmexp.inactive, uvmexp.wired, 220 uvmexp.free); 221 (*pr)(" %d anon, %d vnode, %d vtext\n", 222 uvmexp.anonpages, uvmexp.vnodepages, uvmexp.vtextpages); 223 (*pr)(" freemin=%d, free-target=%d, inactive-target=%d, " 224 "wired-max=%d\n", uvmexp.freemin, uvmexp.freetarg, uvmexp.inactarg, 225 uvmexp.wiredmax); 226 (*pr)(" faults=%d, traps=%d, intrs=%d, ctxswitch=%d\n", 227 uvmexp.faults, uvmexp.traps, uvmexp.intrs, uvmexp.swtch); 228 (*pr)(" softint=%d, syscalls=%d, swapins=%d, swapouts=%d\n", 229 uvmexp.softs, uvmexp.syscalls, uvmexp.swapins, uvmexp.swapouts); 230 231 (*pr)(" fault counts:\n"); 232 (*pr)(" noram=%d, noanon=%d, pgwait=%d, pgrele=%d\n", 233 uvmexp.fltnoram, uvmexp.fltnoanon, uvmexp.fltpgwait, 234 uvmexp.fltpgrele); 235 (*pr)(" ok relocks(total)=%d(%d), anget(retrys)=%d(%d), " 236 "amapcopy=%d\n", uvmexp.fltrelckok, uvmexp.fltrelck, 237 uvmexp.fltanget, uvmexp.fltanretry, uvmexp.fltamcopy); 238 (*pr)(" neighbor anon/obj pg=%d/%d, gets(lock/unlock)=%d/%d\n", 239 uvmexp.fltnamap, uvmexp.fltnomap, uvmexp.fltlget, uvmexp.fltget); 240 (*pr)(" cases: anon=%d, anoncow=%d, obj=%d, prcopy=%d, przero=%d\n", 241 uvmexp.flt_anon, uvmexp.flt_acow, uvmexp.flt_obj, uvmexp.flt_prcopy, 242 uvmexp.flt_przero); 243 244 (*pr)(" daemon and swap counts:\n"); 245 (*pr)(" woke=%d, revs=%d, scans=%d, obscans=%d, anscans=%d\n", 246 uvmexp.pdwoke, uvmexp.pdrevs, uvmexp.pdscans, uvmexp.pdobscan, 247 uvmexp.pdanscan); 248 (*pr)(" busy=%d, freed=%d, reactivate=%d, deactivate=%d\n", 249 uvmexp.pdbusy, uvmexp.pdfreed, uvmexp.pdreact, uvmexp.pddeact); 250 (*pr)(" pageouts=%d, pending=%d, nswget=%d\n", uvmexp.pdpageouts, 251 uvmexp.pdpending, uvmexp.nswget); 252 (*pr)(" nswapdev=%d, nanon=%d, nanonneeded=%d nfreeanon=%d\n", 253 uvmexp.nswapdev, uvmexp.nanon, uvmexp.nanonneeded, 254 uvmexp.nfreeanon); 255 (*pr)(" swpages=%d, swpginuse=%d, swpgonly=%d paging=%d\n", 256 uvmexp.swpages, uvmexp.swpginuse, uvmexp.swpgonly, uvmexp.paging); 257 258 (*pr)(" kernel pointers:\n"); 259 (*pr)(" objs(kern/kmem/mb)=%p/%p/%p\n", uvm.kernel_object, 260 uvmexp.kmem_object, uvmexp.mb_object); 261 } 262 #endif 263
Indexes created Mon Sep 22 10:09:38 GMT 2025