/* $NetBSD: uvm_stat.c,v 1.31 2008/08/08 17:09:28 skrll 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 __KERNEL_RCSID(0, "$NetBSD: uvm_stat.c,v 1.31 2008/08/08 17:09:28 skrll Exp $"); #include "opt_uvmhist.h" #include "opt_readahead.h" #include "opt_ddb.h" #include #include #include #include /* * globals */ #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_entry_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_entry_print(&hists[hi]->e[cur[hi]]); cur[hi] = (cur[hi] + 1) % (hists[hi]->n); if (cur[hi] == hists[hi]->f) cur[hi] = -1; } splx(s); } /* * call this from ddb. `bitmask' is from . 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; if ((bitmask & UVMHIST_UBCHIST) || bitmask == 0) hists[i++] = &ubchist; if ((bitmask & UVMHIST_LOANHIST) || bitmask == 0) hists[i++] = &loanhist; hists[i] = NULL; uvmhist_dump_histories(hists); } /* * uvmhist_print: ddb hook to print uvm history */ void uvmhist_print(void (*pr)(const char *, ...)) { uvmhist_dump(LIST_FIRST(&uvm_histories)); } #endif /* UVMHIST */ /* * uvmexp_print: ddb hook to print interesting uvm counters */ void uvmexp_print(void (*pr)(const char *, ...)) { int active, inactive; uvm_estimatepageable(&active, &inactive); (*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, active, inactive, uvmexp.wired, uvmexp.free); (*pr)(" pages %d anon, %d file, %d exec\n", uvmexp.anonpages, uvmexp.filepages, uvmexp.execpages); (*pr)(" freemin=%d, free-target=%d, wired-max=%d\n", uvmexp.freemin, uvmexp.freetarg, uvmexp.wiredmax); (*pr)(" faults=%d, traps=%d, intrs=%d, ctxswitch=%d\n", uvmexp.faults, uvmexp.traps, uvmexp.intrs, uvmexp.swtch); (*pr)(" softint=%d, syscalls=%d, swapins=%d, swapouts=%d\n", uvmexp.softs, uvmexp.syscalls, uvmexp.swapins, uvmexp.swapouts); (*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(retrys)=%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, swpgavail=%d\n", uvmexp.nswapdev, uvmexp.swpgavail); (*pr)(" swpages=%d, swpginuse=%d, swpgonly=%d, paging=%d\n", uvmexp.swpages, uvmexp.swpginuse, uvmexp.swpgonly, uvmexp.paging); } #endif #if defined(READAHEAD_STATS) #define UVM_RA_EVCNT_DEFINE(name) \ struct evcnt uvm_ra_##name = \ EVCNT_INITIALIZER(EVCNT_TYPE_MISC, NULL, "readahead", #name); \ EVCNT_ATTACH_STATIC(uvm_ra_##name); UVM_RA_EVCNT_DEFINE(total); UVM_RA_EVCNT_DEFINE(hit); UVM_RA_EVCNT_DEFINE(miss); #endif /* defined(READAHEAD_STATS) */