Lines Matching defs:bit
655 int bit, first_page, free_bit, free_page, i, in_use_bits, j;
677 bit = hashp->LAST_FREED &
679 j = bit / BITS_PER_MAP;
680 bit = rounddown2(bit, BITS_PER_MAP);
682 bit = 0;
685 for (; bit <= in_use_bits; j++, bit += BITS_PER_MAP)
719 * allocated with 1 clear bit. Actually, you are going to
723 * the first bit of itself to indicate that the bitmap itself
724 * is in use. We would explicitly set the second bit, but
750 * Free_bit addresses the last used bit. Bump it to address
751 * the first available bit.
766 bit = bit + first_free(freep[j]);
767 SETBIT(freep, bit);
769 tmp1 = bit;
774 * beginning at 1. Bit is a bit addressnumber, so we need to increment
777 bit = 1 + bit + (i * (hashp->BSIZE << BYTE_SHIFT));
778 if (bit >= hashp->LAST_FREED)
779 hashp->LAST_FREED = bit - 1;
782 for (i = 0; (i < splitnum) && (bit > hashp->SPARES[i]); i++);
783 offset = (i ? bit - hashp->SPARES[i - 1] : bit);