Lines Matching defs:bits
26 * <index> is the index of .bits that contains the bit representing
34 /* Pack the bits in backwards so they come out in address order
44 HB_INDEX_TO_OFFSET((hb_)->bitsLen / sizeof(*(hb_)->bits))
55 unsigned long int *bits;
57 /* The size of the memory pointed to by bits, in bytes.
68 * to a set bit. If there are no bits set, (max < base).
117 * address that hasn't been visited yet; setting bits for objects whose
139 * Similar to dvmHeapBitmapXorWalk(), but visit the set bits
148 * Similar to dvmHeapBitmapXorWalkList(), but visit the set bits
159 * have had corresponding bits set in this bitmap.
189 return index < hb->bitsLen / sizeof(*hb->bits);
208 assert(hb->bits != NULL);
210 assert(index < hb->bitsLen / sizeof(*hb->bits));
218 unsigned long int *p = hb->bits + index;
223 hb->bits[index] |= mask;
226 hb->bits[index] &= ~mask;
237 * set bits will be lost.
298 * set bits will be lost.
306 assert(hb->bits != NULL);
311 return hb->bits[HB_OFFSET_TO_INDEX(offset)] & HB_OFFSET_TO_MASK(offset);