dev/vn/shadow.c

102     uint32_t	byte;
115  *   Return a byte value in which bits numbered lower than 'b' are set.
126  *   Set the given range of bits within a byte.
139     b.byte = where / NBBY;
151  *   units, using longs, then a short, then a byte, then bits.
161     if (start.byte < end.byte) {
165 	    map[start.byte] |= byte_set_bits(start.bit, NBBY - 1);
167 	    start.byte++;
168 	    if (start.byte == end.byte)
172 	n_bytes = end.byte - start.byte;
175 	    *((uint32_t *)(map + start.byte)) = UINT32_ALL_ONES;
176 	    start.byte += sizeof(uint32_t);
180 	    *((u_short *)(map + start.byte)) = USHORT_ALL_ONES;
181 	    start.byte += sizeof(u_short);
185 	    map[start.byte] = UCHAR_ALL_ONES;
186 	    start.byte++;
193 	map[start.byte] |= byte_set_bits(start.bit, end.bit - 1);
207  *   first aligning to a byte offset, then trying to count longs, a short,
208  *   a byte, then any remaining bits to find the bit that is different.
224     is_set = (map[start.byte] & bit(start.bit)) ? TRUE : FALSE;
227     if (start.byte < end.byte) {
230 	if (start.bit) { /* try to align to a byte */
234 		this_is_set = (map[start.byte] & bit(i)) ? TRUE : FALSE;
240 	    start.bit = 0; /* made it to the next byte */
241 	    start.byte++;
242 	    if (start.byte == end.byte)
246 	n_bytes = end.byte - start.byte;
250 	    uint32_t * valPtr = (uint32_t *)(map + start.byte);
254 		start.byte += sizeof(*valPtr);
263 	    u_short * valPtr = (u_short *)(map + start.byte);
268 		start.byte += sizeof(*valPtr);
273 	/* check for 1 byte of the same bits */
275 	    if ((is_set && map[start.byte] == UCHAR_ALL_ONES)
276 		|| (!is_set && map[start.byte] == 0)) {
278 		start.byte++;
286 		    this_is_set = (map[start.byte] & bit(i)) ? TRUE : FALSE;
299 	boolean_t this_is_set = (map[start.byte] & bit(i)) ? TRUE : FALSE;
414  *   divided by the number of bits per byte.
416  *   An 8GB file requires (assuming 512 byte block):
540     return ((map->block_bitmap[b.byte] & bit(b.bit)) ? TRUE : FALSE);