uma_dbg.c revision 148078
1139825Simp/*- 2148078Srwatson * Copyright (c) 2002, 2003, 2004, 2005 Jeffrey Roberson <jeff@FreeBSD.org> 3148078Srwatson * Copyright (c) 2004, 2005 Bosko Milekic <bmilekic@FreeBSD.org> 4148078Srwatson * All rights reserved. 595771Sjeff * 695771Sjeff * Redistribution and use in source and binary forms, with or without 795771Sjeff * modification, are permitted provided that the following conditions 895771Sjeff * are met: 995771Sjeff * 1. Redistributions of source code must retain the above copyright 1095771Sjeff * notice unmodified, this list of conditions, and the following 1195771Sjeff * disclaimer. 1295771Sjeff * 2. Redistributions in binary form must reproduce the above copyright 1395771Sjeff * notice, this list of conditions and the following disclaimer in the 1495771Sjeff * documentation and/or other materials provided with the distribution. 1595771Sjeff * 1695771Sjeff * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 1795771Sjeff * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 1895771Sjeff * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 1995771Sjeff * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 2095771Sjeff * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 2195771Sjeff * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 2295771Sjeff * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 2395771Sjeff * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 2495771Sjeff * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 2595771Sjeff * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 2695771Sjeff */ 2795771Sjeff 2895771Sjeff/* 2995771Sjeff * uma_dbg.c Debugging features for UMA users 3095771Sjeff * 3195771Sjeff */ 3295771Sjeff 33116226Sobrien#include <sys/cdefs.h> 34116226Sobrien__FBSDID("$FreeBSD: head/sys/vm/uma_dbg.c 148078 2005-07-16 09:51:52Z rwatson $"); 3595771Sjeff 3695771Sjeff#include <sys/param.h> 3795771Sjeff#include <sys/systm.h> 3895771Sjeff#include <sys/kernel.h> 3995771Sjeff#include <sys/types.h> 4095771Sjeff#include <sys/queue.h> 4195771Sjeff#include <sys/lock.h> 4295771Sjeff#include <sys/mutex.h> 4395931Sjeff#include <sys/malloc.h> 4495771Sjeff 45103531Sjeff#include <vm/vm.h> 46103531Sjeff#include <vm/vm_object.h> 47103531Sjeff#include <vm/vm_page.h> 4895771Sjeff#include <vm/uma.h> 4995771Sjeff#include <vm/uma_int.h> 5095771Sjeff#include <vm/uma_dbg.h> 5195771Sjeff 5295771Sjeffstatic const u_int32_t uma_junk = 0xdeadc0de; 5395771Sjeff 5495771Sjeff/* 55132987Sgreen * Checks an item to make sure it hasn't been overwritten since it was freed, 56132987Sgreen * prior to subsequent reallocation. 5795771Sjeff * 5895771Sjeff * Complies with standard ctor arg/return 5995771Sjeff * 6095771Sjeff */ 61132987Sgreenint 62132987Sgreentrash_ctor(void *mem, int size, void *arg, int flags) 6395771Sjeff{ 6495771Sjeff int cnt; 6595771Sjeff u_int32_t *p; 6695771Sjeff 6795771Sjeff cnt = size / sizeof(uma_junk); 6895771Sjeff 6995771Sjeff for (p = mem; cnt > 0; cnt--, p++) 70147615Ssilby if (*p != uma_junk) { 71147615Ssilby printf("Memory modified after free %p(%d) val=%x @ %p\n", 72120526Sphk mem, size, *p, p); 73147615Ssilby return (0); 74147615Ssilby } 75132987Sgreen return (0); 7695771Sjeff} 7795771Sjeff 7895771Sjeff/* 7995771Sjeff * Fills an item with predictable garbage 8095771Sjeff * 8195771Sjeff * Complies with standard dtor arg/return 8295771Sjeff * 8395771Sjeff */ 8495771Sjeffvoid 8595771Sjefftrash_dtor(void *mem, int size, void *arg) 8695771Sjeff{ 8795771Sjeff int cnt; 8895771Sjeff u_int32_t *p; 8995771Sjeff 9095771Sjeff cnt = size / sizeof(uma_junk); 9195771Sjeff 9295771Sjeff for (p = mem; cnt > 0; cnt--, p++) 9395771Sjeff *p = uma_junk; 9495771Sjeff} 9595771Sjeff 9695771Sjeff/* 9795771Sjeff * Fills an item with predictable garbage 9895771Sjeff * 9995771Sjeff * Complies with standard init arg/return 10095771Sjeff * 10195771Sjeff */ 102132987Sgreenint 103132987Sgreentrash_init(void *mem, int size, int flags) 10495771Sjeff{ 10595771Sjeff trash_dtor(mem, size, NULL); 106132987Sgreen return (0); 10795771Sjeff} 10895771Sjeff 10995771Sjeff/* 11095771Sjeff * Checks an item to make sure it hasn't been overwritten since it was freed. 11195771Sjeff * 11295771Sjeff * Complies with standard fini arg/return 11395771Sjeff * 11495771Sjeff */ 11595771Sjeffvoid 11695771Sjefftrash_fini(void *mem, int size) 11795771Sjeff{ 118132987Sgreen (void)trash_ctor(mem, size, NULL, 0); 11995771Sjeff} 12095899Sjeff 121132987Sgreenint 122132987Sgreenmtrash_ctor(void *mem, int size, void *arg, int flags) 12395931Sjeff{ 12495931Sjeff struct malloc_type **ksp; 12595931Sjeff u_int32_t *p = mem; 12695931Sjeff int cnt; 12795931Sjeff 12895931Sjeff size -= sizeof(struct malloc_type *); 12995931Sjeff ksp = (struct malloc_type **)mem; 13095931Sjeff ksp += size / sizeof(struct malloc_type *); 13195931Sjeff cnt = size / sizeof(uma_junk); 13295931Sjeff 13395931Sjeff for (p = mem; cnt > 0; cnt--, p++) 13495931Sjeff if (*p != uma_junk) { 135120526Sphk printf("Memory modified after free %p(%d) val=%x @ %p\n", 136120526Sphk mem, size, *p, p); 13795931Sjeff panic("Most recently used by %s\n", (*ksp == NULL)? 13895931Sjeff "none" : (*ksp)->ks_shortdesc); 13995931Sjeff } 140132987Sgreen return (0); 14195931Sjeff} 14295931Sjeff 14395931Sjeff/* 14495931Sjeff * Fills an item with predictable garbage 14595931Sjeff * 14695931Sjeff * Complies with standard dtor arg/return 14795931Sjeff * 14895931Sjeff */ 14995931Sjeffvoid 15095931Sjeffmtrash_dtor(void *mem, int size, void *arg) 15195931Sjeff{ 15295931Sjeff int cnt; 15395931Sjeff u_int32_t *p; 15495931Sjeff 15595931Sjeff size -= sizeof(struct malloc_type *); 15695931Sjeff cnt = size / sizeof(uma_junk); 15795931Sjeff 15895931Sjeff for (p = mem; cnt > 0; cnt--, p++) 15995931Sjeff *p = uma_junk; 16095931Sjeff} 16195931Sjeff 16295931Sjeff/* 16395931Sjeff * Fills an item with predictable garbage 16495931Sjeff * 16595931Sjeff * Complies with standard init arg/return 16695931Sjeff * 16795931Sjeff */ 168132987Sgreenint 169132987Sgreenmtrash_init(void *mem, int size, int flags) 17095931Sjeff{ 17195931Sjeff struct malloc_type **ksp; 17295931Sjeff 17395931Sjeff mtrash_dtor(mem, size, NULL); 17495931Sjeff 17595931Sjeff ksp = (struct malloc_type **)mem; 17695931Sjeff ksp += (size / sizeof(struct malloc_type *)) - 1; 17795931Sjeff *ksp = NULL; 178132987Sgreen return (0); 17995931Sjeff} 18095931Sjeff 18195931Sjeff/* 182132987Sgreen * Checks an item to make sure it hasn't been overwritten since it was freed, 183132987Sgreen * prior to freeing it back to available memory. 18495931Sjeff * 18595931Sjeff * Complies with standard fini arg/return 18695931Sjeff * 18795931Sjeff */ 18895931Sjeffvoid 18995931Sjeffmtrash_fini(void *mem, int size) 19095931Sjeff{ 191132987Sgreen (void)mtrash_ctor(mem, size, NULL, 0); 19295931Sjeff} 19395931Sjeff 19495899Sjeffstatic uma_slab_t 19595899Sjeffuma_dbg_getslab(uma_zone_t zone, void *item) 19695899Sjeff{ 19795899Sjeff uma_slab_t slab; 198129906Sbmilekic uma_keg_t keg; 19995899Sjeff u_int8_t *mem; 20095899Sjeff 201129906Sbmilekic keg = zone->uz_keg; 20295899Sjeff mem = (u_int8_t *)((unsigned long)item & (~UMA_SLAB_MASK)); 203129906Sbmilekic if (keg->uk_flags & UMA_ZONE_MALLOC) { 204103531Sjeff slab = vtoslab((vm_offset_t)mem); 205129906Sbmilekic } else if (keg->uk_flags & UMA_ZONE_HASH) { 206129906Sbmilekic slab = hash_sfind(&keg->uk_hash, mem); 20795899Sjeff } else { 208129906Sbmilekic mem += keg->uk_pgoff; 20995899Sjeff slab = (uma_slab_t)mem; 21095899Sjeff } 21195899Sjeff 21295899Sjeff return (slab); 21395899Sjeff} 21495899Sjeff 21595899Sjeff/* 21695899Sjeff * Set up the slab's freei data such that uma_dbg_free can function. 21795899Sjeff * 21895899Sjeff */ 21995899Sjeff 22095899Sjeffvoid 22195899Sjeffuma_dbg_alloc(uma_zone_t zone, uma_slab_t slab, void *item) 22295899Sjeff{ 223129906Sbmilekic uma_keg_t keg; 224136276Sgreen uma_slabrefcnt_t slabref; 22595899Sjeff int freei; 22695899Sjeff 227129906Sbmilekic keg = zone->uz_keg; 22895899Sjeff if (slab == NULL) { 22995899Sjeff slab = uma_dbg_getslab(zone, item); 23095899Sjeff if (slab == NULL) 23195899Sjeff panic("uma: item %p did not belong to zone %s\n", 23295899Sjeff item, zone->uz_name); 23395899Sjeff } 23495899Sjeff 23595899Sjeff freei = ((unsigned long)item - (unsigned long)slab->us_data) 236129906Sbmilekic / keg->uk_rsize; 23795899Sjeff 238136276Sgreen if (keg->uk_flags & UMA_ZONE_REFCNT) { 239136276Sgreen slabref = (uma_slabrefcnt_t)slab; 240136276Sgreen slabref->us_freelist[freei].us_item = 255; 241136276Sgreen } else { 242136276Sgreen slab->us_freelist[freei].us_item = 255; 243136276Sgreen } 24495899Sjeff 24595899Sjeff return; 24695899Sjeff} 24795899Sjeff 24895899Sjeff/* 24995899Sjeff * Verifies freed addresses. Checks for alignment, valid slab membership 25095899Sjeff * and duplicate frees. 25195899Sjeff * 25295899Sjeff */ 25395899Sjeff 25495899Sjeffvoid 25595899Sjeffuma_dbg_free(uma_zone_t zone, uma_slab_t slab, void *item) 25695899Sjeff{ 257129906Sbmilekic uma_keg_t keg; 258136276Sgreen uma_slabrefcnt_t slabref; 25995899Sjeff int freei; 26095899Sjeff 261129906Sbmilekic keg = zone->uz_keg; 26295899Sjeff if (slab == NULL) { 26395899Sjeff slab = uma_dbg_getslab(zone, item); 26495899Sjeff if (slab == NULL) 26595899Sjeff panic("uma: Freed item %p did not belong to zone %s\n", 26695899Sjeff item, zone->uz_name); 26795899Sjeff } 26895899Sjeff 26995899Sjeff freei = ((unsigned long)item - (unsigned long)slab->us_data) 270129906Sbmilekic / keg->uk_rsize; 27195899Sjeff 272129906Sbmilekic if (freei >= keg->uk_ipers) 27397453Speter panic("zone: %s(%p) slab %p freelist %d out of range 0-%d\n", 274129906Sbmilekic zone->uz_name, zone, slab, freei, keg->uk_ipers-1); 27595899Sjeff 276129906Sbmilekic if (((freei * keg->uk_rsize) + slab->us_data) != item) { 27795899Sjeff printf("zone: %s(%p) slab %p freed address %p unaligned.\n", 27895899Sjeff zone->uz_name, zone, slab, item); 27995899Sjeff panic("should be %p\n", 280129906Sbmilekic (freei * keg->uk_rsize) + slab->us_data); 28195899Sjeff } 28295899Sjeff 283136276Sgreen if (keg->uk_flags & UMA_ZONE_REFCNT) { 284136276Sgreen slabref = (uma_slabrefcnt_t)slab; 285136276Sgreen if (slabref->us_freelist[freei].us_item != 255) { 286136276Sgreen printf("Slab at %p, freei %d = %d.\n", 287136276Sgreen slab, freei, slabref->us_freelist[freei].us_item); 288136276Sgreen panic("Duplicate free of item %p from zone %p(%s)\n", 289136276Sgreen item, zone, zone->uz_name); 290136276Sgreen } 291136276Sgreen 292136276Sgreen /* 293136276Sgreen * When this is actually linked into the slab this will change. 294136276Sgreen * Until then the count of valid slabs will make sure we don't 295136276Sgreen * accidentally follow this and assume it's a valid index. 296136276Sgreen */ 297136276Sgreen slabref->us_freelist[freei].us_item = 0; 298136276Sgreen } else { 299136276Sgreen if (slab->us_freelist[freei].us_item != 255) { 300136276Sgreen printf("Slab at %p, freei %d = %d.\n", 301136276Sgreen slab, freei, slab->us_freelist[freei].us_item); 302136276Sgreen panic("Duplicate free of item %p from zone %p(%s)\n", 303136276Sgreen item, zone, zone->uz_name); 304136276Sgreen } 305136276Sgreen 306136276Sgreen /* 307136276Sgreen * When this is actually linked into the slab this will change. 308136276Sgreen * Until then the count of valid slabs will make sure we don't 309136276Sgreen * accidentally follow this and assume it's a valid index. 310136276Sgreen */ 311136276Sgreen slab->us_freelist[freei].us_item = 0; 31295899Sjeff } 31395899Sjeff} 314