Lines Matching refs:overhead
37 (1) a fixed size overhead of length 4 bytes
48 | overhead | payload |
59 identified by the leftmost bit in the overhead field, the so called F-bit.
79 overhead). Ah well -- the name sticks.
100 for (ix = overhead; (size = get_slotsize(ix)) != 0; ix += size + overhead) {
124 overhead = refcount_size + slotsize_size,
150 aspacem_assert(ix >= overhead && ix <= segnames_used);
157 aspacem_assert(ix >= overhead && ix <= segnames_used);
159 aspacem_assert(slotindex >= overhead && slotindex <= segnames_used);
171 aspacem_assert(ix >= overhead && ix <= segnames_used);
189 aspacem_assert(ix >= overhead && ix <= segnames_used);
198 aspacem_assert(ix >= overhead && ix <= segnames_used);
211 aspacem_assert(ix >= overhead && ix <= segnames_used);
221 aspacem_assert(ix >= overhead && ix <= segnames_used);
233 aspacem_assert(ix >= overhead && ix <= segnames_used);
242 aspacem_assert(ix >= overhead && ix <= segnames_used);
266 aspacem_assert(ix >= overhead && ix <= segnames_used);
288 for (ix = overhead; (size = get_slotsize(ix)) != 0; ix += size + overhead) {
329 /* Is there enough room in the string table? The OVERHEAD is for the
331 SizeT need = len + 1 + overhead;
366 for (i = 0, ix = overhead; (size = get_slotsize(ix)) != 0;
367 ix += size + overhead, ++i) {
390 for (ix = overhead; (size = get_slotsize(ix)) != 0; ix += size + overhead) {
406 aspacem_assert(sizeof segnames >= overhead);
408 segnames_used = overhead;
431 return ix == -1 || (ix >= overhead && ix < segnames_used);
