1 /* 2 * Copyright (c) 1987 Regents of the University of California. 3 * All rights reserved. 4 * 5 * %sccs.include.redist.c% 6 * 7 * @(#)malloc.h 7.16 (Berkeley) 06/28/90 8 */ 9 10 #define KMEMSTATS 11 12 /* 13 * flags to malloc 14 */ 15 #define M_WAITOK 0x0000 16 #define M_NOWAIT 0x0001 17 18 /* 19 * Types of memory to be allocated 20 */ 21 #define M_FREE 0 /* should be on free list */ 22 #define M_MBUF 1 /* mbuf */ 23 #define M_DEVBUF 2 /* device driver memory */ 24 #define M_SOCKET 3 /* socket structure */ 25 #define M_PCB 4 /* protocol control block */ 26 #define M_RTABLE 5 /* routing tables */ 27 #define M_HTABLE 6 /* IMP host tables */ 28 #define M_FTABLE 7 /* fragment reassembly header */ 29 #define M_ZOMBIE 8 /* zombie proc status */ 30 #define M_IFADDR 9 /* interface address */ 31 #define M_SOOPTS 10 /* socket options */ 32 #define M_SONAME 11 /* socket name */ 33 #define M_NAMEI 12 /* namei path name buffer */ 34 #define M_GPROF 13 /* kernel profiling buffer */ 35 #define M_IOCTLOPS 14 /* ioctl data buffer */ 36 #define M_SUPERBLK 15 /* super block data */ 37 #define M_CRED 16 /* credentials */ 38 #define M_PGRP 17 /* process group header */ 39 #define M_SESSION 18 /* session header */ 40 #define M_IOV 19 /* large iov's */ 41 #define M_MOUNT 20 /* vfs mount struct */ 42 #define M_FHANDLE 21 /* network file handle */ 43 #define M_NFSREQ 22 /* NFS request header */ 44 #define M_NFSMNT 23 /* NFS mount structure */ 45 #define M_VNODE 24 /* Dynamically allocated vnodes */ 46 #define M_CACHE 25 /* Dynamically allocated cache entries */ 47 #define M_DQUOT 26 /* UFS quota entries */ 48 #define M_UFSMNT 27 /* UFS mount structure */ 49 #define M_MAPMEM 28 /* mapped memory descriptors */ 50 #define M_SHM 29 /* SVID compatible shared memory segments */ 51 #define M_TEMP 49 /* misc temporary data buffers */ 52 #define M_LAST 50 53 54 struct kmemstats { 55 long ks_inuse; /* # of packets of this type currently in use */ 56 long ks_calls; /* total packets of this type ever allocated */ 57 long ks_memuse; /* total memory held in bytes */ 58 u_short ks_limblocks; /* number of times blocked for hitting limit */ 59 u_short ks_mapblocks; /* number of times blocked for kernel map */ 60 long ks_maxused; /* maximum number ever used */ 61 long ks_limit; /* most that are allowed to exist */ 62 }; 63 64 /* 65 * Array of descriptors that describe the contents of each page 66 */ 67 struct kmemusage { 68 short ku_indx; /* bucket index */ 69 union { 70 u_short freecnt;/* for small allocations, free pieces in page */ 71 u_short pagecnt;/* for large allocations, pages alloced */ 72 } ku_un; 73 }; 74 #define ku_freecnt ku_un.freecnt 75 #define ku_pagecnt ku_un.pagecnt 76 77 /* 78 * Set of buckets for each size of memory block that is retained 79 */ 80 struct kmembuckets { 81 caddr_t kb_next; /* list of free blocks */ 82 long kb_calls; /* total calls to allocate this size */ 83 long kb_total; /* total number of blocks allocated */ 84 long kb_totalfree; /* # of free elements in this bucket */ 85 long kb_elmpercl; /* # of elements in this sized allocation */ 86 long kb_highwat; /* high water mark */ 87 long kb_couldfree; /* over high water mark and could free */ 88 }; 89 90 #ifdef KERNEL 91 #define MINALLOCSIZE (1 << MINBUCKET) 92 #define BUCKETINDX(size) \ 93 (size) <= (MINALLOCSIZE * 128) \ 94 ? (size) <= (MINALLOCSIZE * 8) \ 95 ? (size) <= (MINALLOCSIZE * 2) \ 96 ? (size) <= (MINALLOCSIZE * 1) \ 97 ? (MINBUCKET + 0) \ 98 : (MINBUCKET + 1) \ 99 : (size) <= (MINALLOCSIZE * 4) \ 100 ? (MINBUCKET + 2) \ 101 : (MINBUCKET + 3) \ 102 : (size) <= (MINALLOCSIZE* 32) \ 103 ? (size) <= (MINALLOCSIZE * 16) \ 104 ? (MINBUCKET + 4) \ 105 : (MINBUCKET + 5) \ 106 : (size) <= (MINALLOCSIZE * 64) \ 107 ? (MINBUCKET + 6) \ 108 : (MINBUCKET + 7) \ 109 : (size) <= (MINALLOCSIZE * 2048) \ 110 ? (size) <= (MINALLOCSIZE * 512) \ 111 ? (size) <= (MINALLOCSIZE * 256) \ 112 ? (MINBUCKET + 8) \ 113 : (MINBUCKET + 9) \ 114 : (size) <= (MINALLOCSIZE * 1024) \ 115 ? (MINBUCKET + 10) \ 116 : (MINBUCKET + 11) \ 117 : (size) <= (MINALLOCSIZE * 8192) \ 118 ? (size) <= (MINALLOCSIZE * 4096) \ 119 ? (MINBUCKET + 12) \ 120 : (MINBUCKET + 13) \ 121 : (size) <= (MINALLOCSIZE * 16384) \ 122 ? (MINBUCKET + 14) \ 123 : (MINBUCKET + 15) 124 125 /* 126 * Turn virtual addresses into kmem map indicies 127 */ 128 #define kmemxtob(alloc) (kmembase + (alloc) * NBPG) 129 #define btokmemx(addr) (((caddr_t)(addr) - kmembase) / NBPG) 130 #define btokup(addr) (&kmemusage[((caddr_t)(addr) - kmembase) >> CLSHIFT]) 131 132 /* 133 * Macro versions for the usual cases of malloc/free 134 */ 135 #ifdef KMEMSTATS 136 #define MALLOC(space, cast, size, type, flags) \ 137 (space) = (cast)malloc((u_long)(size), type, flags) 138 #define FREE(addr, type) free((caddr_t)(addr), type) 139 140 #else /* do not collect statistics */ 141 #define MALLOC(space, cast, size, type, flags) { \ 142 register struct kmembuckets *kbp = &bucket[BUCKETINDX(size)]; \ 143 long s = splimp(); \ 144 if (kbp->kb_next == NULL) { \ 145 (space) = (cast)malloc((u_long)(size), type, flags); \ 146 } else { \ 147 (space) = (cast)kbp->kb_next; \ 148 kbp->kb_next = *(caddr_t *)(space); \ 149 } \ 150 splx(s); \ 151 } 152 153 #define FREE(addr, type) { \ 154 register struct kmembuckets *kbp; \ 155 register struct kmemusage *kup = btokup(addr); \ 156 long s = splimp(); \ 157 if (1 << kup->ku_indx > MAXALLOCSAVE) { \ 158 free((caddr_t)(addr), type); \ 159 } else { \ 160 kbp = &bucket[kup->ku_indx]; \ 161 *(caddr_t *)(addr) = kbp->kb_next; \ 162 kbp->kb_next = (caddr_t)(addr); \ 163 } \ 164 splx(s); \ 165 } 166 #endif /* do not collect statistics */ 167 168 extern struct kmemstats kmemstats[]; 169 extern struct kmemusage *kmemusage; 170 extern char kmembase[]; 171 extern struct kmembuckets bucket[]; 172 extern qaddr_t malloc(); 173 extern void free(); 174 #endif KERNEL 175