Lines Matching refs:len

174  * For runs the len field is the length of the run.
175 * For bitmaps the len field represents the number of allocated items.
181 u_int len;
194 /* Is the unrb empty in at least the first len bits? */
196 ub_empty(struct unrb *ub, int len) {
199 bit_ffs(ub->map, len, &first_set);
203 /* Is the unrb full? That is, is the number of set elements equal to len? */
205 ub_full(struct unrb *ub, int len)
209 bit_ffc(ub->map, len, &first_clear);
236 KASSERT (up->len <= NBITS,
237 ("UNR inconsistency: len %u max %zd (line %d)\n",
238 up->len, NBITS, line));
241 bit_count(ub->map, 0, up->len, &w);
244 y += up->len;
398 if (uf->len >= NBITS)
403 l = uf->len;
409 if ((up->len + l) > NBITS)
414 l += up->len;
432 a = us->len;
440 bit_nclear(ub->map, a, a + uf->len - 1);
442 bit_nset(ub->map, a, a + uf->len - 1);
444 uf->len += a;
448 for (l = 0; l < uf->len; l++, a++) {
454 uf->len = a;
465 if (uf->len + us->len > NBITS)
468 bit_nclear(ub->map, us->len, us->len + uf->len - 1);
469 us->len += uf->len;
473 bit_nset(ub->map, us->len, us->len + uf->len - 1);
474 us->len += uf->len;
479 for (l = 0; l < uf->len; l++, us->len++) {
481 bit_set(ub->map, us->len);
483 bit_clear(ub->map, us->len);
506 if (ub_full(ub, up->len)) {
509 } else if (ub_empty(ub, up->len)) {
516 if (up->len == 0) {
529 up->len += upp->len;
535 up->len += upp->len;
544 uh->first += upp->len;
554 uh->last += upp->len;
604 up->len--;
607 bit_ffc(ub->map, up->len, &y);
656 up->len = i;
660 up->len = 1;
669 if (up->len > i)
671 i -= up->len;
679 up->len = i;
684 up->len = 1;
703 tl = up->len - (1 + i);
707 upn->len = tl;
714 upn->len = i;
718 up->len = 1;
789 up->len = uh->first - item;
791 uh->first -= up->len;
798 if (up->len > item)
800 item -= up->len;
818 if (up->len == 1) {
828 upp->len++;
829 up->len--;
837 if (item == up->len - 1 && upn != NULL && upn->ptr == NULL) {
838 upn->len++;
839 up->len--;
846 pl = up->len - (1 + item);
850 upp->len = pl;
857 upp->len = item;
861 up->len = 1;
901 printf(" %p len = %5u ", up, up->len);
909 for (x = 0; x < up->len; x++) {
933 x += up->len;