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