Lines Matching refs:bitmap

4 /* Maximum bitmap bit count is 2^LG_BITMAP_MAXBITS. */
32 /* Logical number of bits in bitmap (stored at bottom level). */
52 void bitmap_init(bitmap_t *bitmap, const bitmap_info_t *binfo);
59 bool bitmap_full(bitmap_t *bitmap, const bitmap_info_t *binfo);
60 bool bitmap_get(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
61 void bitmap_set(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
62 size_t bitmap_sfu(bitmap_t *bitmap, const bitmap_info_t *binfo);
63 void bitmap_unset(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit);
68 bitmap_full(bitmap_t *bitmap, const bitmap_info_t *binfo)
71 bitmap_t rg = bitmap[rgoff];
72 /* The bitmap is full iff the root group is 0. */
77 bitmap_get(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit)
84 g = bitmap[goff];
89 bitmap_set(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit)
96 assert(bitmap_get(bitmap, binfo, bit) == false);
98 gp = &bitmap[goff];
103 assert(bitmap_get(bitmap, binfo, bit));
110 gp = &bitmap[binfo->levels[i].group_offset + goff];
123 bitmap_sfu(bitmap_t *bitmap, const bitmap_info_t *binfo)
129 assert(bitmap_full(bitmap, binfo) == false);
132 g = bitmap[binfo->levels[i].group_offset];
136 g = bitmap[binfo->levels[i].group_offset + bit];
140 bitmap_set(bitmap, binfo, bit);
145 bitmap_unset(bitmap_t *bitmap, const bitmap_info_t *binfo, size_t bit)
153 assert(bitmap_get(bitmap, binfo, bit));
155 gp = &bitmap[goff];
161 assert(bitmap_get(bitmap, binfo, bit) == false);
168 gp = &bitmap[binfo->levels[i].group_offset + goff];