Lines Matching defs:bit
1090 int32_t bit, first_page, free_bit, free_page, i, in_use_bits, j;
1119 bit = hashp->hdr.last_freed &
1121 j = bit / BITS_PER_MAP;
1122 bit = bit & ~(BITS_PER_MAP - 1);
1124 bit = 0;
1127 for (; bit <= in_use_bits; j++, bit += BITS_PER_MAP)
1159 * allocated with 1 clear bit. Actually, you are going to
1163 * the first bit of itself to indicate that the bitmap itself
1164 * is in use. We would explicitly set the second bit, but
1190 * Free_bit addresses the last used bit. Bump it to address
1191 * the first available bit.
1211 bit = bit + first_free(freep[j]);
1212 SETBIT(freep, bit);
1214 tmp1 = bit;
1219 * beginning at 1. Bit is a bit address number, so we need to increment
1222 bit = 1 + bit + (i * (hashp->hdr.bsize << BYTE_SHIFT));
1223 if (bit >= hashp->hdr.last_freed)
1224 hashp->hdr.last_freed = bit - 1;
1227 for (i = 0; i < splitnum && (bit > hashp->hdr.spares[i]); i++);
1228 offset = (i ? bit - hashp->hdr.spares[i - 1] : bit);