Home | History | Annotate | Line # | Download | only in kern
kern_malloc.c revision 1.142.2.1
      1 /*	$NetBSD: kern_malloc.c,v 1.142.2.1 2014/08/20 00:04:29 tls Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1987, 1991, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. Neither the name of the University nor the names of its contributors
     16  *    may be used to endorse or promote products derived from this software
     17  *    without specific prior written permission.
     18  *
     19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29  * SUCH DAMAGE.
     30  *
     31  *	@(#)kern_malloc.c	8.4 (Berkeley) 5/20/95
     32  */
     33 
     34 /*
     35  * Copyright (c) 1996 Christopher G. Demetriou.  All rights reserved.
     36  *
     37  * Redistribution and use in source and binary forms, with or without
     38  * modification, are permitted provided that the following conditions
     39  * are met:
     40  * 1. Redistributions of source code must retain the above copyright
     41  *    notice, this list of conditions and the following disclaimer.
     42  * 2. Redistributions in binary form must reproduce the above copyright
     43  *    notice, this list of conditions and the following disclaimer in the
     44  *    documentation and/or other materials provided with the distribution.
     45  * 3. All advertising materials mentioning features or use of this software
     46  *    must display the following acknowledgement:
     47  *	This product includes software developed by the University of
     48  *	California, Berkeley and its contributors.
     49  * 4. Neither the name of the University nor the names of its contributors
     50  *    may be used to endorse or promote products derived from this software
     51  *    without specific prior written permission.
     52  *
     53  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     54  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     55  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     56  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     57  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     58  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     59  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     60  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     61  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     62  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     63  * SUCH DAMAGE.
     64  *
     65  *	@(#)kern_malloc.c	8.4 (Berkeley) 5/20/95
     66  */
     67 
     68 /*
     69  * Wrapper interface for obsolete malloc(9).
     70  */
     71 
     72 #include <sys/cdefs.h>
     73 __KERNEL_RCSID(0, "$NetBSD: kern_malloc.c,v 1.142.2.1 2014/08/20 00:04:29 tls Exp $");
     74 
     75 #include <sys/param.h>
     76 #include <sys/malloc.h>
     77 #include <sys/kmem.h>
     78 
     79 #include <uvm/uvm_extern.h>
     80 
     81 /*
     82  * Built-in malloc types.  Note: ought to be removed.
     83  */
     84 MALLOC_DEFINE(M_DEVBUF, "devbuf", "device driver memory");
     85 MALLOC_DEFINE(M_DMAMAP, "DMA map", "bus_dma(9) structures");
     86 MALLOC_DEFINE(M_FREE, "free", "should be on free list");
     87 MALLOC_DEFINE(M_TEMP, "temp", "misc. temporary data buffers");
     88 MALLOC_DEFINE(M_RTABLE, "routetbl", "routing tables");
     89 MALLOC_DEFINE(M_FTABLE, "fragtbl", "fragment reassembly header");
     90 MALLOC_DEFINE(M_UFSMNT, "UFS mount", "UFS mount structure");
     91 MALLOC_DEFINE(M_NETADDR, "Export Host", "Export host address structure");
     92 MALLOC_DEFINE(M_MRTABLE, "mrt", "multicast routing tables");
     93 
     94 /*
     95  * Header contains total size, including the header itself.
     96  */
     97 struct malloc_header {
     98 	size_t		mh_size;
     99 } __aligned(ALIGNBYTES + 1);
    100 
    101 void *
    102 kern_malloc(unsigned long size, int flags)
    103 {
    104 	const int kmflags = (flags & M_NOWAIT) ? KM_NOSLEEP : KM_SLEEP;
    105 	size_t allocsize, hdroffset;
    106 	struct malloc_header *mh;
    107 	void *p;
    108 
    109 	if (size >= PAGE_SIZE) {
    110 		allocsize = PAGE_SIZE + size; /* for page alignment */
    111 		hdroffset = PAGE_SIZE - sizeof(struct malloc_header);
    112 	} else {
    113 		allocsize = sizeof(struct malloc_header) + size;
    114 		hdroffset = 0;
    115 	}
    116 
    117 	p = kmem_intr_alloc(allocsize, kmflags);
    118 	if (p == NULL)
    119 		return NULL;
    120 
    121 	if ((flags & M_ZERO) != 0) {
    122 		memset(p, 0, allocsize);
    123 	}
    124 	mh = (void *)((char *)p + hdroffset);
    125 	mh->mh_size = allocsize - hdroffset;
    126 
    127 	return mh + 1;
    128 }
    129 
    130 void
    131 kern_free(void *addr)
    132 {
    133 	struct malloc_header *mh;
    134 
    135 	mh = addr;
    136 	mh--;
    137 
    138 	if (mh->mh_size >= PAGE_SIZE + sizeof(struct malloc_header))
    139 		kmem_intr_free((char *)addr - PAGE_SIZE,
    140 		    mh->mh_size + PAGE_SIZE - sizeof(struct malloc_header));
    141 	else
    142 		kmem_intr_free(mh, mh->mh_size);
    143 }
    144 
    145 void *
    146 kern_realloc(void *curaddr, unsigned long newsize, int flags)
    147 {
    148 	struct malloc_header *mh;
    149 	unsigned long cursize;
    150 	void *newaddr;
    151 
    152 	/*
    153 	 * realloc() with a NULL pointer is the same as malloc().
    154 	 */
    155 	if (curaddr == NULL)
    156 		return malloc(newsize, ksp, flags);
    157 
    158 	/*
    159 	 * realloc() with zero size is the same as free().
    160 	 */
    161 	if (newsize == 0) {
    162 		free(curaddr, ksp);
    163 		return NULL;
    164 	}
    165 
    166 	if ((flags & M_NOWAIT) == 0) {
    167 		ASSERT_SLEEPABLE();
    168 	}
    169 
    170 	mh = curaddr;
    171 	mh--;
    172 
    173 	cursize = mh->mh_size - sizeof(struct malloc_header);
    174 
    175 	/*
    176 	 * If we already actually have as much as they want, we're done.
    177 	 */
    178 	if (newsize <= cursize)
    179 		return curaddr;
    180 
    181 	/*
    182 	 * Can't satisfy the allocation with the existing block.
    183 	 * Allocate a new one and copy the data.
    184 	 */
    185 	newaddr = malloc(newsize, ksp, flags);
    186 	if (__predict_false(newaddr == NULL)) {
    187 		/*
    188 		 * malloc() failed, because flags included M_NOWAIT.
    189 		 * Return NULL to indicate that failure.  The old
    190 		 * pointer is still valid.
    191 		 */
    192 		return NULL;
    193 	}
    194 	memcpy(newaddr, curaddr, cursize);
    195 
    196 	/*
    197 	 * We were successful: free the old allocation and return
    198 	 * the new one.
    199 	 */
    200 	free(curaddr, ksp);
    201 	return newaddr;
    202 }
    203 
    204 /*
    205  * Initialize the kernel memory allocator
    206  */
    207 void
    208 kmeminit(void)
    209 {
    210 }
    211