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.21 (Berkeley) 02/01/91 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_VMMAP 30 /* VM map structures */ 52 #define M_VMMAPENT 31 /* VM map entry structures */ 53 #define M_VMOBJ 32 /* VM object structure */ 54 #define M_VMOBJHASH 33 /* VM object hash structure */ 55 #define M_VMPMAP 34 /* VM pmap */ 56 #define M_VMPVENT 35 /* VM phys-virt mapping entry */ 57 #define M_VMPAGER 36 /* XXX: VM pager struct */ 58 #define M_VMPGDATA 37 /* XXX: VM pager private data */ 59 #define M_FILE 38 /* Open file structure */ 60 #define M_LOCKF 39 /* Byte-range locking structures */ 61 #define M_TEMP 49 /* misc temporary data buffers */ 62 #define M_LAST 50 63 64 #define INITKMEMNAMES { \ 65 "free", /* 0 M_FREE */ \ 66 "mbuf", /* 1 M_MBUF */ \ 67 "devbuf", /* 2 M_DEVBUF */ \ 68 "socket", /* 3 M_SOCKET */ \ 69 "pcb", /* 4 M_PCB */ \ 70 "routetbl", /* 5 M_RTABLE */ \ 71 "hosttbl", /* 6 M_HTABLE */ \ 72 "fragtbl", /* 7 M_FTABLE */ \ 73 "zombie", /* 8 M_ZOMBIE */ \ 74 "ifaddr", /* 9 M_IFADDR */ \ 75 "soopts", /* 10 M_SOOPTS */ \ 76 "soname", /* 11 M_SONAME */ \ 77 "namei", /* 12 M_NAMEI */ \ 78 "gprof", /* 13 M_GPROF */ \ 79 "ioctlops", /* 14 M_IOCTLOPS */ \ 80 "superblk", /* 15 M_SUPERBLK */ \ 81 "cred", /* 16 M_CRED */ \ 82 "pgrp", /* 17 M_PGRP */ \ 83 "session", /* 18 M_SESSION */ \ 84 "iov", /* 19 M_IOV */ \ 85 "mount", /* 20 M_MOUNT */ \ 86 "fhandle", /* 21 M_FHANDLE */ \ 87 "NFS req", /* 22 M_NFSREQ */ \ 88 "NFS mount", /* 23 M_NFSMNT */ \ 89 "vnodes", /* 24 M_VNODE */ \ 90 "namecache", /* 25 M_CACHE */ \ 91 "UFS quota", /* 26 M_DQUOT */ \ 92 "UFS mount", /* 27 M_UFSMNT */ \ 93 "mapmem", /* 28 M_MAPMEM */ \ 94 "shm", /* 29 M_SHM */ \ 95 "VM map", /* 30 M_VMMAP */ \ 96 "VM mapent", /* 31 M_VMMAPENT */ \ 97 "VM object", /* 32 M_VMOBJ */ \ 98 "VM objhash", /* 33 M_VMOBJHASH */ \ 99 "VM pmap", /* 34 M_VMPMAP */ \ 100 "VM pvmap", /* 35 M_VMPVENT */ \ 101 "VM pager", /* 36 M_VMPAGER */ \ 102 "VM pgdata", /* 37 M_VMPGDATA */ \ 103 "open files", /* 38 M_FILE */ \ 104 "lockf", /* 39 M_LOCKF */ \ 105 0, 0, 0, 0, \ 106 0, 0, 0, 0, 0, \ 107 "temp", /* 49 M_TEMP */ \ 108 } 109 110 struct kmemstats { 111 long ks_inuse; /* # of packets of this type currently in use */ 112 long ks_calls; /* total packets of this type ever allocated */ 113 long ks_memuse; /* total memory held in bytes */ 114 u_short ks_limblocks; /* number of times blocked for hitting limit */ 115 u_short ks_mapblocks; /* number of times blocked for kernel map */ 116 long ks_maxused; /* maximum number ever used */ 117 long ks_limit; /* most that are allowed to exist */ 118 }; 119 120 /* 121 * Array of descriptors that describe the contents of each page 122 */ 123 struct kmemusage { 124 short ku_indx; /* bucket index */ 125 union { 126 u_short freecnt;/* for small allocations, free pieces in page */ 127 u_short pagecnt;/* for large allocations, pages alloced */ 128 } ku_un; 129 }; 130 #define ku_freecnt ku_un.freecnt 131 #define ku_pagecnt ku_un.pagecnt 132 133 /* 134 * Set of buckets for each size of memory block that is retained 135 */ 136 struct kmembuckets { 137 caddr_t kb_next; /* list of free blocks */ 138 long kb_calls; /* total calls to allocate this size */ 139 long kb_total; /* total number of blocks allocated */ 140 long kb_totalfree; /* # of free elements in this bucket */ 141 long kb_elmpercl; /* # of elements in this sized allocation */ 142 long kb_highwat; /* high water mark */ 143 long kb_couldfree; /* over high water mark and could free */ 144 }; 145 146 #ifdef KERNEL 147 #define MINALLOCSIZE (1 << MINBUCKET) 148 #define BUCKETINDX(size) \ 149 (size) <= (MINALLOCSIZE * 128) \ 150 ? (size) <= (MINALLOCSIZE * 8) \ 151 ? (size) <= (MINALLOCSIZE * 2) \ 152 ? (size) <= (MINALLOCSIZE * 1) \ 153 ? (MINBUCKET + 0) \ 154 : (MINBUCKET + 1) \ 155 : (size) <= (MINALLOCSIZE * 4) \ 156 ? (MINBUCKET + 2) \ 157 : (MINBUCKET + 3) \ 158 : (size) <= (MINALLOCSIZE* 32) \ 159 ? (size) <= (MINALLOCSIZE * 16) \ 160 ? (MINBUCKET + 4) \ 161 : (MINBUCKET + 5) \ 162 : (size) <= (MINALLOCSIZE * 64) \ 163 ? (MINBUCKET + 6) \ 164 : (MINBUCKET + 7) \ 165 : (size) <= (MINALLOCSIZE * 2048) \ 166 ? (size) <= (MINALLOCSIZE * 512) \ 167 ? (size) <= (MINALLOCSIZE * 256) \ 168 ? (MINBUCKET + 8) \ 169 : (MINBUCKET + 9) \ 170 : (size) <= (MINALLOCSIZE * 1024) \ 171 ? (MINBUCKET + 10) \ 172 : (MINBUCKET + 11) \ 173 : (size) <= (MINALLOCSIZE * 8192) \ 174 ? (size) <= (MINALLOCSIZE * 4096) \ 175 ? (MINBUCKET + 12) \ 176 : (MINBUCKET + 13) \ 177 : (size) <= (MINALLOCSIZE * 16384) \ 178 ? (MINBUCKET + 14) \ 179 : (MINBUCKET + 15) 180 181 /* 182 * Turn virtual addresses into kmem map indicies 183 */ 184 #define kmemxtob(alloc) (kmembase + (alloc) * NBPG) 185 #define btokmemx(addr) (((caddr_t)(addr) - kmembase) / NBPG) 186 #define btokup(addr) (&kmemusage[((caddr_t)(addr) - kmembase) >> CLSHIFT]) 187 188 /* 189 * Macro versions for the usual cases of malloc/free 190 */ 191 #ifdef KMEMSTATS 192 #define MALLOC(space, cast, size, type, flags) \ 193 (space) = (cast)malloc((u_long)(size), type, flags) 194 #define FREE(addr, type) free((caddr_t)(addr), type) 195 196 #else /* do not collect statistics */ 197 #define MALLOC(space, cast, size, type, flags) { \ 198 register struct kmembuckets *kbp = &bucket[BUCKETINDX(size)]; \ 199 long s = splimp(); \ 200 if (kbp->kb_next == NULL) { \ 201 (space) = (cast)malloc((u_long)(size), type, flags); \ 202 } else { \ 203 (space) = (cast)kbp->kb_next; \ 204 kbp->kb_next = *(caddr_t *)(space); \ 205 } \ 206 splx(s); \ 207 } 208 209 #define FREE(addr, type) { \ 210 register struct kmembuckets *kbp; \ 211 register struct kmemusage *kup = btokup(addr); \ 212 long s = splimp(); \ 213 if (1 << kup->ku_indx > MAXALLOCSAVE) { \ 214 free((caddr_t)(addr), type); \ 215 } else { \ 216 kbp = &bucket[kup->ku_indx]; \ 217 *(caddr_t *)(addr) = kbp->kb_next; \ 218 kbp->kb_next = (caddr_t)(addr); \ 219 } \ 220 splx(s); \ 221 } 222 #endif /* do not collect statistics */ 223 224 extern struct kmemstats kmemstats[]; 225 extern struct kmemusage *kmemusage; 226 extern char *kmembase; 227 extern struct kmembuckets bucket[]; 228 extern qaddr_t malloc(); 229 extern void free(); 230 #endif /* KERNEL */ 231