Lines Matching +full:11 +full:a

90 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
101 .H 1 "Appendix A - Implementation Details"
111  \fI*\fP allocated\&. It must be at least large enough to hold a pointer\&.
119  \fI*\fP and MAXALLOCSIZE must be a power of two\&.
135  \fI*\fP Constraints: must be a multiple of the pagesize\&.
146  \fI*\fP This arena is known to start on a page boundary\&.
160 \h'|11n'\*(+Kshort\*(-K\h'|21n'ks\*_indx;\h'|41n'\fI\h'\w' 'u-\w'/'u'/\fP\fI*\fP\c\c
165 \h'|11n'u\*_short\h'|21n'ks\*_pagecnt;\h'|41n'\fI\h'\w' 'u-\w'/'u'/\fP\fI*\fP\c\c
183 \h'|11n'caddr\*_t kb\*_next;\h'|41n'\fI\h'\w' 'u-\w'/'u'/\fP\fI*\fP\c\c
195  \fI*\fP Macro to convert a size to a bucket index\&. If the size is constant,
196  \fI*\fP this macro reduces to a compile time constant\&.
204 \h'|11n'(size) <= (MINALLOCSIZE \fI*\fP 128) \e
236 \h'|11n'\*(+Kregister\*(-K \*(+Kstruct\*(-K kmembuckets \fI*\fPkbp = &bucket[BUCKETINDX(size)]; \e
237 \h'|11n'\*(+Klong\*(-K s = splimp(); \e
238 \h'|11n'\*(+Kif\*(-K (kbp\*->kb\*_next == NULL) \*(+K{\*(-K \e
240 \h'|11n'\*(+K}\*(-K \*(+Kelse\*(-K \*(+K{\*(-K \e
243 \h'|11n'\*(+K}\*(-K \e
244 \h'|11n'splx(s); \e
252 \h'|11n'\*(+Kregister\*(-K \*(+Kstruct\*(-K kmembuckets \fI*\fPkbp; \e
253 \h'|11n'\*(+Kregister\*(-K \*(+Kstruct\*(-K kmemsizes \fI*\fPksp = \e
255 \h'|11n'\*(+Klong\*(-K s = splimp(); \e
256 \h'|11n'\*(+Kif\*(-K (1 << ksp\*->ks\*_indx > MAXALLOCSAVE) \*(+K{\*(-K \e
258 \h'|11n'\*(+K}\*(-K \*(+Kelse\*(-K \*(+K{\*(-K \e
262 \h'|11n'\*(+K}\*(-K \e
263 \h'|11n'splx(s); \e