$FreeBSD$
.am vS .. .am vE .. 'ss 23 'ds _ \d-\u 'ps 9z 'vs 10p 'ds - - 'ds / \\h'\\w' 'u-\\w'/'u'/ 'ds /* \\h'\\w' 'u-\\w'/'u'/* 'bd B 3 'bd S B 3 'nr cm 0 'nf 'de vH 'ev 2 'ft 1 'sp .35i 'tl '\s14\f3\\*(=F\s0'\\*(=H'\f3\s14\\*(=F\s0' 'sp .25i 'ft 1 \f2\s12\h'\\n(.lu-\w'\\*(=f'u'\\*(=f\s0\h'|0u' 'ev 'ds =G \\*(=F .. 'de vF 'ev 2 'sp .35i 'ie o 'tl '\f2\\*(=M''Page % of \\*(=G' 'el 'tl '\f2Page % of \\*(=G''\\*(=M' 'bp 'ev 'ft 1 'if \\n(cm=1 'ft 2 .. 'de () 'pn 1 .. 'de +C 'nr cm 1 'ft 2 'ds +K 'ds -K .. 'de -C 'nr cm 0 'ft 1 'ds +K \f3 'ds -K .. '+C '-C 'am +C 'ne 3 .. 'de FN \f2\s14\h'\\n(.lu-\w'\\$1'u'\\$1\s0\h'|0u'\c 'ds =f ...\\$1 .. 'de FC 'ds =f ...\\$1 .. 'de -F 'rm =f .. 'ft 1 'lg 0 '-F Copyright (c) 1988 The Regents of the University of California.
All rights reserved.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. All advertising materials mentioning features or use of this software
must display the following acknowledgement:
This product includes software developed by the University of
California, Berkeley and its contributors.
4. Neither the name of the University nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE.

@(#)appendix.t 5.1 (Berkeley) 4/16/91

.bp .H 1 "Appendix A - Implementation Details"

.vS
\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Constants for setting the parameters of the kernel memory allocator.
 *
 * 2 ** MINBUCKET is the smallest unit of memory that will be
 * allocated. It must be at least large enough to hold a pointer.
 *
 * Units of memory less or equal to MAXALLOCSAVE will permanently
 * allocate physical memory; requests for these size pieces of memory
 * are quite fast. Allocations greater than MAXALLOCSAVE must
 * always allocate and free physical memory; requests for these size
 * allocations should be done infrequently as they will be slow.
 * Constraints: CLBYTES <= MAXALLOCSAVE <= 2 ** (MINBUCKET + 14)
 * and MAXALLOCSIZE must be a power of two.
 *\h'\w' 'u-\w'/'u'/\c
'-C

\*(+K#define\*(-K MINBUCKET\h'|31n'4\h'|51n'\h'\w' 'u-\w'/'u'/*\c\c
'+C
 4 => min allocation of 16 bytes *\h'\w' 'u-\w'/'u'/\c
'-C

'FN MAXALLOCSAVE
\*(+K#define\*(-K MAXALLOCSAVE\h'|31n'(2 * CLBYTES)

\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Maximum amount of kernel dynamic memory.
 * Constraints: must be a multiple of the pagesize.
 *\h'\w' 'u-\w'/'u'/\c
'-C

'FN MAXKMEM
\*(+K#define\*(-K MAXKMEM\h'|31n'(1024 * PAGESIZE)

\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Arena for all kernel dynamic memory allocation.
 * This arena is known to start on a page boundary.
 *\h'\w' 'u-\w'/'u'/\c
'-C

\*(+Kextern\*(-K \*(+Kchar\*(-K kmembase[MAXKMEM];

\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Array of descriptors that describe the contents of each page
 *\h'\w' 'u-\w'/'u'/\c
'-C

\*(+Kstruct\*(-K kmemsizes \*(+K{\*(-K
\h'|11n'\*(+Kshort\*(-K\h'|21n'ks\*_indx;\h'|41n'\h'\w' 'u-\w'/'u'/*\c\c
'+C
 bucket index, size of small allocations *\h'\w' 'u-\w'/'u'/\c
'-C

\h'|11n'u\*_short\h'|21n'ks\*_pagecnt;\h'|41n'\h'\w' 'u-\w'/'u'/*\c\c
'+C
 for large allocations, pages allocated *\h'\w' 'u-\w'/'u'/\c
'-C

\*(+K}\*(-K\c\c
'-F
 kmemsizes[MAXKMEM \h'\w' 'u-\w'/'u'/ PAGESIZE];
'FC MAXALLOCSAVE

\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Set of buckets for each size of memory block that is retained
 *\h'\w' 'u-\w'/'u'/\c
'-C

\*(+Kstruct\*(-K kmembuckets \*(+K{\*(-K
\h'|11n'caddr\*_t kb\*_next;\h'|41n'\h'\w' 'u-\w'/'u'/*\c\c
'+C
 list of free blocks *\h'\w' 'u-\w'/'u'/\c
'-C

\*(+K}\*(-K\c\c
'-F
 bucket[MINBUCKET + 16];
.bp
\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Macro to convert a size to a bucket index. If the size is constant,
 * this macro reduces to a compile time constant.
 *\h'\w' 'u-\w'/'u'/\c
'-C

'FN MINALLOCSIZE
\*(+K#define\*(-K MINALLOCSIZE\h'|31n'(1 << MINBUCKET)
'FN BUCKETINDX
\*(+K#define\*(-K BUCKETINDX(size) \e
\h'|11n'(size) <= (MINALLOCSIZE * 128) \e
\h'|21n'? (size) <= (MINALLOCSIZE * 8) \e
\h'|31n'? (size) <= (MINALLOCSIZE * 2) \e
\h'|41n'? (size) <= (MINALLOCSIZE * 1) \e
\h'|51n'? (MINBUCKET + 0) \e
\h'|51n': (MINBUCKET + 1) \e
\h'|41n': (size) <= (MINALLOCSIZE * 4) \e
\h'|51n'? (MINBUCKET + 2) \e
\h'|51n': (MINBUCKET + 3) \e
\h'|31n': (size) <= (MINALLOCSIZE* 32) \e
\h'|41n'? (size) <= (MINALLOCSIZE * 16) \e
\h'|51n'? (MINBUCKET + 4) \e
\h'|51n': (MINBUCKET + 5) \e
\h'|41n': (size) <= (MINALLOCSIZE * 64) \e
\h'|51n'? (MINBUCKET + 6) \e
\h'|51n': (MINBUCKET + 7) \e
\h'|21n': (size) <= (MINALLOCSIZE * 2048) \e
\h'|31n'\h'\w' 'u-\w'/'u'/*\c\c
'+C
 etc ... *\h'\w' 'u-\w'/'u'/\c
'-C


\h'\w' 'u-\w'/'u'/*\c\c
'+C

 * Macro versions for the usual cases of malloc\h'\w' 'u-\w'/'u'/free
 *\h'\w' 'u-\w'/'u'/\c
'-C

'FN MALLOC
\*(+K#define\*(-K MALLOC(space, cast, size, flags) \*(+K{\*(-K \e
\h'|11n'\*(+Kregister\*(-K \*(+Kstruct\*(-K kmembuckets *kbp = &bucket[BUCKETINDX(size)]; \e
\h'|11n'\*(+Klong\*(-K s = splimp(); \e
\h'|11n'\*(+Kif\*(-K (kbp\*->kb\*_next == NULL) \*(+K{\*(-K \e
\h'|21n'(space) = (cast)malloc(size, flags); \e
\h'|11n'\*(+K}\*(-K \*(+Kelse\*(-K \*(+K{\*(-K \e
\h'|21n'(space) = (cast)kbp\*->kb\*_next; \e
\h'|21n'kbp\*->kb\*_next = *(caddr\*_t *)(space); \e
\h'|11n'\*(+K}\*(-K \e
\h'|11n'splx(s); \e
\*(+K}\*(-K\c\c
'-F

'FC BUCKETINDX

'FN FREE
\*(+K#define\*(-K FREE(addr) \*(+K{\*(-K \e
\h'|11n'\*(+Kregister\*(-K \*(+Kstruct\*(-K kmembuckets *kbp; \e
\h'|11n'\*(+Kregister\*(-K \*(+Kstruct\*(-K kmemsizes *ksp = \e
\h'|21n'&kmemsizes[((addr) \*- kmembase) \h'\w' 'u-\w'/'u'/ PAGESIZE]; \e
\h'|11n'\*(+Klong\*(-K s = splimp(); \e
\h'|11n'\*(+Kif\*(-K (1 << ksp\*->ks\*_indx > MAXALLOCSAVE) \*(+K{\*(-K \e
\h'|21n'free(addr); \e
\h'|11n'\*(+K}\*(-K \*(+Kelse\*(-K \*(+K{\*(-K \e
\h'|21n'kbp = &bucket[ksp\*->ks\*_indx]; \e
\h'|21n'*(caddr\*_t *)(addr) = kbp\*->kb\*_next; \e
\h'|21n'kbp\*->kb\*_next = (caddr\*_t)(addr); \e
\h'|11n'\*(+K}\*(-K \e
\h'|11n'splx(s); \e
\*(+K}\*(-K\c\c
'-F

'FC BUCKETINDX
.vE