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