2 * Copyright (c) 2006-2007 Pawel Jakub Dawidek <pjd@FreeBSD.org>
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHORS AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 #include <sys/cdefs.h>
28 __FBSDID("$FreeBSD$");
30 #include <sys/param.h>
31 #include <sys/kernel.h>
32 #include <sys/systm.h>
33 #include <sys/malloc.h>
35 #include <sys/debug.h>
36 #include <sys/mutex.h>
38 #include <vm/vm_page.h>
39 #include <vm/vm_object.h>
40 #include <vm/vm_kern.h>
41 #include <vm/vm_map.h>
44 #include <sys/queue.h>
45 #include <sys/stack.h>
49 MALLOC_DEFINE(M_SOLARIS, "solaris", "Solaris");
51 #define malloc(size, type, flags) malloc(size)
52 #define free(addr, type) free(addr)
58 LIST_ENTRY(kmem_item) next;
60 static LIST_HEAD(, kmem_item) kmem_items;
61 static struct mtx kmem_items_mtx;
62 MTX_SYSINIT(kmem_items_mtx, &kmem_items_mtx, "kmem_items", MTX_DEF);
63 #endif /* KMEM_DEBUG */
68 zfs_kmem_alloc(size_t size, int kmflags)
74 size += sizeof(struct kmem_item);
76 p = malloc(size, M_SOLARIS, kmflags);
78 if (kmflags & KM_SLEEP)
84 p = (u_char *)p + sizeof(struct kmem_item);
85 stack_save(&i->stack);
86 mtx_lock(&kmem_items_mtx);
87 LIST_INSERT_HEAD(&kmem_items, i, next);
88 mtx_unlock(&kmem_items_mtx);
95 zfs_kmem_free(void *buf, size_t size __unused)
99 printf("%s: attempt to free NULL\n", __func__);
104 buf = (u_char *)buf - sizeof(struct kmem_item);
105 mtx_lock(&kmem_items_mtx);
106 LIST_FOREACH(i, &kmem_items, next) {
111 LIST_REMOVE(i, next);
112 mtx_unlock(&kmem_items_mtx);
114 free(buf, M_SOLARIS);
117 static uint64_t kmem_size_val;
120 kmem_size_init(void *unused __unused)
123 kmem_size_val = (uint64_t)cnt.v_page_count * PAGE_SIZE;
124 if (kmem_size_val > vm_kmem_size)
125 kmem_size_val = vm_kmem_size;
127 SYSINIT(kmem_size_init, SI_SUB_KMEM, SI_ORDER_ANY, kmem_size_init, NULL);
133 return (kmem_size_val);
140 return (vmem_size(kmem_arena, VMEM_ALLOC));
144 kmem_std_constructor(void *mem, int size __unused, void *private, int flags)
146 struct kmem_cache *cache = private;
148 return (cache->kc_constructor(mem, cache->kc_private, flags));
152 kmem_std_destructor(void *mem, int size __unused, void *private)
154 struct kmem_cache *cache = private;
156 cache->kc_destructor(mem, cache->kc_private);
160 kmem_cache_create(char *name, size_t bufsize, size_t align,
161 int (*constructor)(void *, void *, int), void (*destructor)(void *, void *),
162 void (*reclaim)(void *) __unused, void *private, vmem_t *vmp, int cflags)
168 cache = kmem_alloc(sizeof(*cache), KM_SLEEP);
169 strlcpy(cache->kc_name, name, sizeof(cache->kc_name));
170 cache->kc_constructor = constructor;
171 cache->kc_destructor = destructor;
172 cache->kc_private = private;
173 #if defined(_KERNEL) && !defined(KMEM_DEBUG)
174 cache->kc_zone = uma_zcreate(cache->kc_name, bufsize,
175 constructor != NULL ? kmem_std_constructor : NULL,
176 destructor != NULL ? kmem_std_destructor : NULL,
177 NULL, NULL, align > 0 ? align - 1 : 0, cflags);
179 cache->kc_size = bufsize;
186 kmem_cache_destroy(kmem_cache_t *cache)
188 #if defined(_KERNEL) && !defined(KMEM_DEBUG)
189 uma_zdestroy(cache->kc_zone);
191 kmem_free(cache, sizeof(*cache));
195 kmem_cache_alloc(kmem_cache_t *cache, int flags)
197 #if defined(_KERNEL) && !defined(KMEM_DEBUG)
198 return (uma_zalloc_arg(cache->kc_zone, cache, flags));
202 p = kmem_alloc(cache->kc_size, flags);
203 if (p != NULL && cache->kc_constructor != NULL)
204 kmem_std_constructor(p, cache->kc_size, cache, flags);
210 kmem_cache_free(kmem_cache_t *cache, void *buf)
212 #if defined(_KERNEL) && !defined(KMEM_DEBUG)
213 uma_zfree_arg(cache->kc_zone, buf, cache);
215 if (cache->kc_destructor != NULL)
216 kmem_std_destructor(buf, cache->kc_size, cache);
217 kmem_free(buf, cache->kc_size);
223 kmem_cache_reap_now(kmem_cache_t *cache)
226 zone_drain(cache->kc_zone);
237 kmem_cache_reap_now(kmem_cache_t *cache __unused)
254 calloc(size_t n, size_t s)
256 return (kmem_zalloc(n * s, KM_NOSLEEP));
260 void kmem_show(void *);
262 kmem_show(void *dummy __unused)
266 mtx_lock(&kmem_items_mtx);
267 if (LIST_EMPTY(&kmem_items))
268 printf("KMEM_DEBUG: No leaked elements.\n");
270 printf("KMEM_DEBUG: Leaked elements:\n\n");
271 LIST_FOREACH(i, &kmem_items, next) {
272 printf("address=%p\n", i);
273 stack_print_ddb(&i->stack);
277 mtx_unlock(&kmem_items_mtx);
280 SYSUNINIT(sol_kmem, SI_SUB_CPU, SI_ORDER_FIRST, kmem_show, NULL);
281 #endif /* KMEM_DEBUG */