Lines Matching defs:top
34 size_t top; /* index of top word allocated */
49 ret->top = 0;
68 b->top = 0;
74 if (b->top >= b->len)
76 if (b->len == 0 || (n / BITMAP_BITS) > b->top)
87 if (b->top >= b->len || n > BITMAP_MAX)
109 if (offset > b->top)
110 b->top = offset;
115 /* Resets b->top to point to the most significant bit set in b->d */
119 if (b->top >= b->len)
121 while (b->top > 0 && b->d[b->top] == 0)
122 b->top--;
130 if (b->top >= b->len || n > BITMAP_MAX)
133 if (offset > b->top)
136 /* The top may have changed as a result of the clear */
147 if (b->top >= b->len)
149 if (b->len == 0 || (b->top == 0 && b->d[0] == 0))
152 w = b->d[b->top];
153 bits = (b->top + 1) * BITMAP_BITS;
173 if (l < need || b->top >= b->len)
178 for (i = k = 0; i < b->top + 1; i++) {
202 b->top = offset = ((l + (BITMAP_BYTES - 1)) / BITMAP_BYTES) - 1;