![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to malloc.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Net/2] / Net2 / sys|
Return to malloc.h CVS log | Up to [Net/2] / Net2 / sys |
1.1 root 1: /*
2: * Copyright (c) 1987 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms, with or without
6: * modification, are permitted provided that the following conditions
7: * are met:
8: * 1. Redistributions of source code must retain the above copyright
9: * notice, this list of conditions and the following disclaimer.
10: * 2. Redistributions in binary form must reproduce the above copyright
11: * notice, this list of conditions and the following disclaimer in the
12: * documentation and/or other materials provided with the distribution.
13: * 3. All advertising materials mentioning features or use of this software
14: * must display the following acknowledgement:
15: * This product includes software developed by the University of
16: * California, Berkeley and its contributors.
17: * 4. Neither the name of the University nor the names of its contributors
18: * may be used to endorse or promote products derived from this software
19: * without specific prior written permission.
20: *
21: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31: * SUCH DAMAGE.
32: *
33: * @(#)malloc.h 7.25 (Berkeley) 5/15/91
34: */
35:
36: #ifndef _MALLOC_H_
37: #define _MALLOC_H_
38:
39: #define KMEMSTATS
40:
41: /*
42: * flags to malloc
43: */
44: #define M_WAITOK 0x0000
45: #define M_NOWAIT 0x0001
46:
47: /*
48: * Types of memory to be allocated
49: */
50: #define M_FREE 0 /* should be on free list */
51: #define M_MBUF 1 /* mbuf */
52: #define M_DEVBUF 2 /* device driver memory */
53: #define M_SOCKET 3 /* socket structure */
54: #define M_PCB 4 /* protocol control block */
55: #define M_RTABLE 5 /* routing tables */
56: #define M_HTABLE 6 /* IMP host tables */
57: #define M_FTABLE 7 /* fragment reassembly header */
58: #define M_ZOMBIE 8 /* zombie proc status */
59: #define M_IFADDR 9 /* interface address */
60: #define M_SOOPTS 10 /* socket options */
61: #define M_SONAME 11 /* socket name */
62: #define M_NAMEI 12 /* namei path name buffer */
63: #define M_GPROF 13 /* kernel profiling buffer */
64: #define M_IOCTLOPS 14 /* ioctl data buffer */
65: #define M_SUPERBLK 15 /* super block data */
66: #define M_CRED 16 /* credentials */
67: #define M_PGRP 17 /* process group header */
68: #define M_SESSION 18 /* session header */
69: #define M_IOV 19 /* large iov's */
70: #define M_MOUNT 20 /* vfs mount struct */
71: #define M_FHANDLE 21 /* network file handle */
72: #define M_NFSREQ 22 /* NFS request header */
73: #define M_NFSMNT 23 /* NFS mount structure */
74: #define M_VNODE 24 /* Dynamically allocated vnodes */
75: #define M_CACHE 25 /* Dynamically allocated cache entries */
76: #define M_DQUOT 26 /* UFS quota entries */
77: #define M_UFSMNT 27 /* UFS mount structure */
78: #define M_MAPMEM 28 /* mapped memory descriptors */
79: #define M_SHM 29 /* SVID compatible shared memory segments */
80: #define M_VMMAP 30 /* VM map structures */
81: #define M_VMMAPENT 31 /* VM map entry structures */
82: #define M_VMOBJ 32 /* VM object structure */
83: #define M_VMOBJHASH 33 /* VM object hash structure */
84: #define M_VMPMAP 34 /* VM pmap */
85: #define M_VMPVENT 35 /* VM phys-virt mapping entry */
86: #define M_VMPAGER 36 /* XXX: VM pager struct */
87: #define M_VMPGDATA 37 /* XXX: VM pager private data */
88: #define M_FILE 38 /* Open file structure */
89: #define M_FILEDESC 39 /* Open file descriptor table */
90: #define M_LOCKF 40 /* Byte-range locking structures */
91: #define M_PROC 41 /* Proc structures */
92: #define M_SUBPROC 42 /* Proc sub-structures */
93: #define M_TEMP 49 /* misc temporary data buffers */
1.1.1.2 ! root 94: #define M_PCFSMNT 50 /* PCFS mount structure */
! 95: #define M_PCFSFAT 51 /* PCFS fat table */
! 96: #define M_LAST 52
1.1 root 97:
98: #define INITKMEMNAMES { \
99: "free", /* 0 M_FREE */ \
100: "mbuf", /* 1 M_MBUF */ \
101: "devbuf", /* 2 M_DEVBUF */ \
102: "socket", /* 3 M_SOCKET */ \
103: "pcb", /* 4 M_PCB */ \
104: "routetbl", /* 5 M_RTABLE */ \
105: "hosttbl", /* 6 M_HTABLE */ \
106: "fragtbl", /* 7 M_FTABLE */ \
107: "zombie", /* 8 M_ZOMBIE */ \
108: "ifaddr", /* 9 M_IFADDR */ \
109: "soopts", /* 10 M_SOOPTS */ \
110: "soname", /* 11 M_SONAME */ \
111: "namei", /* 12 M_NAMEI */ \
112: "gprof", /* 13 M_GPROF */ \
113: "ioctlops", /* 14 M_IOCTLOPS */ \
114: "superblk", /* 15 M_SUPERBLK */ \
115: "cred", /* 16 M_CRED */ \
116: "pgrp", /* 17 M_PGRP */ \
117: "session", /* 18 M_SESSION */ \
118: "iov", /* 19 M_IOV */ \
119: "mount", /* 20 M_MOUNT */ \
120: "fhandle", /* 21 M_FHANDLE */ \
121: "NFS req", /* 22 M_NFSREQ */ \
122: "NFS mount", /* 23 M_NFSMNT */ \
123: "vnodes", /* 24 M_VNODE */ \
124: "namecache", /* 25 M_CACHE */ \
125: "UFS quota", /* 26 M_DQUOT */ \
126: "UFS mount", /* 27 M_UFSMNT */ \
127: "mapmem", /* 28 M_MAPMEM */ \
128: "shm", /* 29 M_SHM */ \
129: "VM map", /* 30 M_VMMAP */ \
130: "VM mapent", /* 31 M_VMMAPENT */ \
131: "VM object", /* 32 M_VMOBJ */ \
132: "VM objhash", /* 33 M_VMOBJHASH */ \
133: "VM pmap", /* 34 M_VMPMAP */ \
134: "VM pvmap", /* 35 M_VMPVENT */ \
135: "VM pager", /* 36 M_VMPAGER */ \
136: "VM pgdata", /* 37 M_VMPGDATA */ \
137: "file", /* 38 M_FILE */ \
138: "file desc", /* 39 M_FILEDESC */ \
139: "lockf", /* 40 M_LOCKF */ \
140: "proc", /* 41 M_PROC */ \
141: "subproc", /* 42 M_PROC */ \
142: 0, 0, 0, 0, 0, 0, \
143: "temp", /* 49 M_TEMP */ \
1.1.1.2 ! root 144: "PCFS mount", /* 50 M_PCFSMNT */ \
! 145: "PCFS fat", /* 51 M_PCFSFAT */ \
1.1 root 146: }
147:
148: struct kmemstats {
149: long ks_inuse; /* # of packets of this type currently in use */
150: long ks_calls; /* total packets of this type ever allocated */
151: long ks_memuse; /* total memory held in bytes */
152: u_short ks_limblocks; /* number of times blocked for hitting limit */
153: u_short ks_mapblocks; /* number of times blocked for kernel map */
154: long ks_maxused; /* maximum number ever used */
155: long ks_limit; /* most that are allowed to exist */
156: };
157:
158: /*
159: * Array of descriptors that describe the contents of each page
160: */
161: struct kmemusage {
162: short ku_indx; /* bucket index */
163: union {
164: u_short freecnt;/* for small allocations, free pieces in page */
165: u_short pagecnt;/* for large allocations, pages alloced */
166: } ku_un;
167: };
168: #define ku_freecnt ku_un.freecnt
169: #define ku_pagecnt ku_un.pagecnt
170:
171: /*
172: * Set of buckets for each size of memory block that is retained
173: */
174: struct kmembuckets {
175: caddr_t kb_next; /* list of free blocks */
176: long kb_calls; /* total calls to allocate this size */
177: long kb_total; /* total number of blocks allocated */
178: long kb_totalfree; /* # of free elements in this bucket */
179: long kb_elmpercl; /* # of elements in this sized allocation */
180: long kb_highwat; /* high water mark */
181: long kb_couldfree; /* over high water mark and could free */
182: };
183:
184: #ifdef KERNEL
185: #define MINALLOCSIZE (1 << MINBUCKET)
186: #define BUCKETINDX(size) \
187: (size) <= (MINALLOCSIZE * 128) \
188: ? (size) <= (MINALLOCSIZE * 8) \
189: ? (size) <= (MINALLOCSIZE * 2) \
190: ? (size) <= (MINALLOCSIZE * 1) \
191: ? (MINBUCKET + 0) \
192: : (MINBUCKET + 1) \
193: : (size) <= (MINALLOCSIZE * 4) \
194: ? (MINBUCKET + 2) \
195: : (MINBUCKET + 3) \
196: : (size) <= (MINALLOCSIZE* 32) \
197: ? (size) <= (MINALLOCSIZE * 16) \
198: ? (MINBUCKET + 4) \
199: : (MINBUCKET + 5) \
200: : (size) <= (MINALLOCSIZE * 64) \
201: ? (MINBUCKET + 6) \
202: : (MINBUCKET + 7) \
203: : (size) <= (MINALLOCSIZE * 2048) \
204: ? (size) <= (MINALLOCSIZE * 512) \
205: ? (size) <= (MINALLOCSIZE * 256) \
206: ? (MINBUCKET + 8) \
207: : (MINBUCKET + 9) \
208: : (size) <= (MINALLOCSIZE * 1024) \
209: ? (MINBUCKET + 10) \
210: : (MINBUCKET + 11) \
211: : (size) <= (MINALLOCSIZE * 8192) \
212: ? (size) <= (MINALLOCSIZE * 4096) \
213: ? (MINBUCKET + 12) \
214: : (MINBUCKET + 13) \
215: : (size) <= (MINALLOCSIZE * 16384) \
216: ? (MINBUCKET + 14) \
217: : (MINBUCKET + 15)
218:
219: /*
220: * Turn virtual addresses into kmem map indicies
221: */
222: #define kmemxtob(alloc) (kmembase + (alloc) * NBPG)
223: #define btokmemx(addr) (((caddr_t)(addr) - kmembase) / NBPG)
224: #define btokup(addr) (&kmemusage[((caddr_t)(addr) - kmembase) >> CLSHIFT])
225:
226: /*
227: * Macro versions for the usual cases of malloc/free
228: */
229: #ifdef KMEMSTATS
230: #define MALLOC(space, cast, size, type, flags) \
231: (space) = (cast)malloc((u_long)(size), type, flags)
232: #define FREE(addr, type) free((caddr_t)(addr), type)
233:
234: #else /* do not collect statistics */
235: #define MALLOC(space, cast, size, type, flags) { \
236: register struct kmembuckets *kbp = &bucket[BUCKETINDX(size)]; \
237: long s = splimp(); \
238: if (kbp->kb_next == NULL) { \
239: (space) = (cast)malloc((u_long)(size), type, flags); \
240: } else { \
241: (space) = (cast)kbp->kb_next; \
242: kbp->kb_next = *(caddr_t *)(space); \
243: } \
244: splx(s); \
245: }
246:
247: #define FREE(addr, type) { \
248: register struct kmembuckets *kbp; \
249: register struct kmemusage *kup = btokup(addr); \
250: long s = splimp(); \
251: if (1 << kup->ku_indx > MAXALLOCSAVE) { \
252: free((caddr_t)(addr), type); \
253: } else { \
254: kbp = &bucket[kup->ku_indx]; \
255: *(caddr_t *)(addr) = kbp->kb_next; \
256: kbp->kb_next = (caddr_t)(addr); \
257: } \
258: splx(s); \
259: }
260: #endif /* do not collect statistics */
261:
262: extern struct kmemstats kmemstats[];
263: extern struct kmemusage *kmemusage;
264: extern char *kmembase;
265: extern struct kmembuckets bucket[];
266: extern void *malloc __P((unsigned long size, int type, int flags));
267: extern void free __P((void *addr, int type));
268: #endif /* KERNEL */
269: #endif /* !_MALLOC_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.