Lines Matching refs:first
34 * Allocation policy is always lowest free number first.
205 y = uh->first;
316 uh->first = 0;
405 * If the first element is not a bitmap, make it one.
532 /* Merge into ->first if possible */
535 uh->first += upp->len;
570 x = uh->low + uh->first;
575 * If we have an ideal split, just adjust the first+last
578 uh->first++;
585 * We can always allocate from the first list element, so if we have
591 KASSERT(up->ptr != uh, ("UNR first element is allocated"));
594 uh->first++;
631 if (item < uh->low + uh->first || item > uh->high)
636 if (up == NULL && item - uh->low == uh->first) {
637 uh->first++;
644 i = item - uh->low - uh->first;
769 if (item + 1 == uh->first && upp == NULL) {
771 uh->first--;
777 * Freeing in the ->first section. Create a run starting at the
780 if (item < uh->first) {
783 up->len = uh->first - item;
785 uh->first -= up->len;
788 item -= uh->first;
917 "%p low = %u high = %u first = %u last = %u busy %u chunks = %u\n",
918 uh, uh->low, uh->high, uh->first, uh->last, uh->busy, uh->alloc);
919 x = uh->low + uh->first;