BYTE_SHIFT
(hashp->hdr.bsize << BYTE_SHIFT) - 1) >>
(hashp->hdr.bshift + BYTE_SHIFT);
free_page = (max_free - 1) >> (hashp->hdr.bshift + BYTE_SHIFT);
free_bit = (max_free - 1) & ((hashp->hdr.bsize << BYTE_SHIFT) - 1);
first_page = hashp->hdr.last_freed >> (hashp->hdr.bshift + BYTE_SHIFT);
in_use_bits = (hashp->hdr.bsize << BYTE_SHIFT) - 1;
((hashp->hdr.bsize << BYTE_SHIFT) - 1);
if (free_bit == (hashp->hdr.bsize << BYTE_SHIFT) - 1) {
bit = 1 + bit + (i * (hashp->hdr.bsize << BYTE_SHIFT));
free_page = (bit_address >> (hashp->hdr.bshift + BYTE_SHIFT));
free_bit = bit_address & ((hashp->hdr.bsize << BYTE_SHIFT) - 1);
(hashp->BSIZE << BYTE_SHIFT) - 1) >>
(hashp->BSHIFT + BYTE_SHIFT);
free_page = (max_free - 1) >> (hashp->BSHIFT + BYTE_SHIFT);
free_bit = (max_free - 1) & ((hashp->BSIZE << BYTE_SHIFT) - 1);
first_page = hashp->LAST_FREED >>(hashp->BSHIFT + BYTE_SHIFT);
in_use_bits = (hashp->BSIZE << BYTE_SHIFT) - 1;
((hashp->BSIZE << BYTE_SHIFT) - 1);
if (free_bit == (hashp->BSIZE << BYTE_SHIFT) - 1) {
bit = 1 + bit + (i * (hashp->BSIZE << BYTE_SHIFT));
free_page = (bit_address >> (hashp->BSHIFT + BYTE_SHIFT));
free_bit = bit_address & ((hashp->BSIZE << BYTE_SHIFT) - 1);