4 * cc -I/usr/src/sys vmpageinfo.c -o /usr/local/bin/vmpageinfo -lkvm
8 * Validate the vm_page_buckets[] hash array against the vm_page_array
11 * Copyright (c) 2004 The DragonFly Project. All rights reserved.
13 * This code is derived from software contributed to The DragonFly Project
14 * by Matthew Dillon <dillon@backplane.com>
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
20 * 1. Redistributions of source code must retain the above copyright
21 * notice, this list of conditions and the following disclaimer.
22 * 2. Redistributions in binary form must reproduce the above copyright
23 * notice, this list of conditions and the following disclaimer in
24 * the documentation and/or other materials provided with the
26 * 3. Neither the name of The DragonFly Project nor the names of its
27 * contributors may be used to endorse or promote products derived
28 * from this software without specific, prior written permission.
30 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
31 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
32 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
33 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
34 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
35 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
36 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
37 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
38 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
39 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
40 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43 * $DragonFly: src/test/debug/vmpageinfo.c,v 1.2 2006/05/23 01:00:05 dillon Exp $
46 #define _KERNEL_STRUCTURES_
47 #include <sys/param.h>
49 #include <sys/malloc.h>
50 #include <sys/signalvar.h>
51 #include <sys/vnode.h>
52 #include <sys/namecache.h>
53 #include <sys/slaballoc.h>
56 #include <vm/vm_page.h>
57 #include <vm/vm_kern.h>
58 #include <vm/vm_page.h>
59 #include <vm/vm_object.h>
60 #include <vm/swap_pager.h>
61 #include <vm/vnode_pager.h>
73 { "_vm_page_buckets" },
74 { "_vm_page_hash_mask" },
77 { "_vm_page_array_size" },
84 struct vm_page **vm_page_buckets;
85 int vm_page_hash_mask;
87 struct vm_page *vm_page_array;
88 int vm_page_array_size;
90 void checkpage(kvm_t *kd, vm_page_t mptr, vm_page_t m, struct vm_object *obj);
91 static void kkread(kvm_t *kd, u_long addr, void *buf, size_t nbytes);
92 static int kkread_err(kvm_t *kd, u_long addr, void *buf, size_t nbytes);
94 static void addsltrack(vm_page_t m);
95 static void dumpsltrack(kvm_t *kd);
98 main(int ac, char **av)
100 const char *corefile = NULL;
101 const char *sysfile = NULL;
104 struct vm_object obj;
112 while ((ch = getopt(ac, av, "M:N:dv")) != -1) {
127 fprintf(stderr, "%s [-M core] [-N system]\n", av[0]);
134 if ((kd = kvm_open(sysfile, corefile, NULL, O_RDONLY, "kvm:")) == NULL) {
138 if (kvm_nlist(kd, Nl) != 0) {
144 kkread(kd, Nl[0].n_value, &vm_page_buckets, sizeof(vm_page_buckets));
145 kkread(kd, Nl[1].n_value, &vm_page_hash_mask, sizeof(vm_page_hash_mask));
147 kkread(kd, Nl[0].n_value, &vm_page_array, sizeof(vm_page_array));
148 kkread(kd, Nl[1].n_value, &vm_page_array_size, sizeof(vm_page_array_size));
151 * Scan the vm_page_array validating all pages with associated objects
153 for (i = 0; i < vm_page_array_size; ++i) {
155 printf("page %d\r", i);
158 kkread(kd, (u_long)&vm_page_array[i], &m, sizeof(m));
160 kkread(kd, (u_long)m.object, &obj, sizeof(obj));
161 checkpage(kd, &vm_page_array[i], &m, &obj);
164 if (m.queue >= PQ_HOLD) {
166 } else if (m.queue >= PQ_CACHE) {
168 } else if (m.queue >= PQ_ACTIVE) {
170 } else if (m.queue >= PQ_INACTIVE) {
172 } else if (m.queue >= PQ_FREE) {
177 printf("page %p obj %p/%-8ju(%016jx) val=%02x dty=%02x hold=%d "
178 "wire=%-2d act=%-3d busy=%d %8s",
182 (intmax_t)m.pindex * PAGE_SIZE,
218 printf(" %-7s", ostr);
219 if (m.flags & PG_BUSY)
221 if (m.flags & PG_WANTED)
223 if (m.flags & PG_WINATCFLS)
224 printf(" WINATCFLS");
225 if (m.flags & PG_FICTITIOUS)
226 printf(" FICTITIOUS");
227 if (m.flags & PG_WRITEABLE)
228 printf(" WRITEABLE");
229 if (m.flags & PG_MAPPED)
231 if (m.flags & PG_ZERO)
233 if (m.flags & PG_REFERENCED)
234 printf(" REFERENCED");
235 if (m.flags & PG_CLEANCHK)
237 if (m.flags & PG_SWAPINPROG)
238 printf(" SWAPINPROG");
239 if (m.flags & PG_NOSYNC)
241 if (m.flags & PG_UNMANAGED)
242 printf(" UNMANAGED");
243 if (m.flags & PG_MARKER)
245 if (m.flags & PG_RAM)
247 if (m.flags & PG_SWAPPED)
250 if (m.flags & PG_SLAB)
255 if (m.flags & PG_SLAB)
260 if (debugopt || verboseopt)
265 * Scan the vm_page_buckets array validating all pages found
267 for (i = 0; i <= vm_page_hash_mask; ++i) {
269 printf("index %d\r", i);
272 kkread(kd, (u_long)&vm_page_buckets[i], &mptr, sizeof(mptr));
274 kkread(kd, (u_long)mptr, &m, sizeof(m));
276 kkread(kd, (u_long)m.object, &obj, sizeof(obj));
277 hv = ((uintptr_t)m.object + m.pindex) ^ obj.hash_rand;
278 hv &= vm_page_hash_mask;
280 printf("vm_page_buckets[%d] ((struct vm_page *)%p)"
281 " should be in bucket %d\n", i, mptr, hv);
282 checkpage(kd, mptr, &m, &obj);
284 printf("vm_page_buckets[%d] ((struct vm_page *)%p)"
285 " has no object\n", i, mptr);
298 * A page with an object.
301 checkpage(kvm_t *kd, vm_page_t mptr, vm_page_t m, struct vm_object *obj)
308 hv = ((uintptr_t)m->object + m->pindex) ^ obj->hash_rand;
309 hv &= vm_page_hash_mask;
310 kkread(kd, (u_long)&vm_page_buckets[hv], &scanptr, sizeof(scanptr));
314 kkread(kd, (u_long)scanptr, &scan, sizeof(scan));
315 scanptr = scan.hnext;
319 printf("good checkpage %p bucket %d\n", mptr, hv);
321 printf("vm_page_buckets[%d] ((struct vm_page *)%p)"
322 " page not found in bucket list\n", hv, mptr);
328 kkread(kvm_t *kd, u_long addr, void *buf, size_t nbytes)
330 if (kvm_read(kd, addr, buf, nbytes) != nbytes) {
337 kkread_err(kvm_t *kd, u_long addr, void *buf, size_t nbytes)
339 if (kvm_read(kd, addr, buf, nbytes) != nbytes) {
346 struct SLTrack *next;
351 #define SLHMASK (SLHSIZE - 1)
353 struct SLTrack *SLHash[SLHSIZE];
357 addsltrack(vm_page_t m)
360 u_long addr = (m->pindex * PAGE_SIZE) & ~131071L;
363 if (m->wire_count == 0 || (m->flags & PG_MAPPED) == 0 ||
367 i = (addr / 131072) & SLHMASK;
368 for (slt = SLHash[i]; slt; slt = slt->next) {
369 if (slt->addr == addr)
373 slt = malloc(sizeof(*slt));
375 slt->next = SLHash[i];
382 dumpsltrack(kvm_t *kd)
386 long total_zones = 0;
389 for (i = 0; i < SLHSIZE; ++i) {
390 for (slt = SLHash[i]; slt; slt = slt->next) {
393 if (kkread_err(kd, slt->addr, &z, sizeof(z))) {
394 printf("SLZone 0x%016lx not mapped\n",
398 printf("SLZone 0x%016lx { mag=%08x cpu=%-2d NFree=%-3d "
411 printf("FullZones/TotalZones: %ld/%ld\n", full_zones, total_zones);