bm                 79 lib/util/idtree.c static int find_next_bit(uint32_t bm, int maxid, int n)
bm                 81 lib/util/idtree.c 	while (n<maxid && !test_bit(n, bm)) n++;
bm                109 lib/util/idtree.c 	uint32_t bm;
bm                123 lib/util/idtree.c 		bm = ~p->bitmap;
bm                124 lib/util/idtree.c 		m = find_next_bit(bm, IDR_SIZE, n);
bm                333 source3/include/proto.h void bitmap_free(struct bitmap *bm);
bm                336 source3/include/proto.h bool bitmap_set(struct bitmap *bm, unsigned i);
bm                337 source3/include/proto.h bool bitmap_clear(struct bitmap *bm, unsigned i);
bm                338 source3/include/proto.h bool bitmap_query(struct bitmap *bm, unsigned i);
bm                339 source3/include/proto.h int bitmap_find(struct bitmap *bm, unsigned ofs);
bm                 30 source3/lib/bitmap.c 	struct bitmap *bm;
bm                 32 source3/lib/bitmap.c 	bm = SMB_MALLOC_P(struct bitmap);
bm                 34 source3/lib/bitmap.c 	if (!bm) return NULL;
bm                 36 source3/lib/bitmap.c 	bm->n = n;
bm                 37 source3/lib/bitmap.c 	bm->b = SMB_MALLOC_ARRAY(uint32, (n+31)/32);
bm                 38 source3/lib/bitmap.c 	if (!bm->b) {
bm                 39 source3/lib/bitmap.c 		SAFE_FREE(bm);
bm                 43 source3/lib/bitmap.c 	memset(bm->b, 0, sizeof(uint32)*((n+31)/32));
bm                 45 source3/lib/bitmap.c 	return bm;
bm                 52 source3/lib/bitmap.c void bitmap_free(struct bitmap *bm)
bm                 54 source3/lib/bitmap.c 	if (!bm)
bm                 57 source3/lib/bitmap.c 	SAFE_FREE(bm->b);
bm                 58 source3/lib/bitmap.c 	SAFE_FREE(bm);
bm                 66 source3/lib/bitmap.c 	struct bitmap *bm;
bm                 70 source3/lib/bitmap.c 	bm = TALLOC_P(mem_ctx, struct bitmap);
bm                 72 source3/lib/bitmap.c 	if (!bm) return NULL;
bm                 74 source3/lib/bitmap.c 	bm->n = n;
bm                 75 source3/lib/bitmap.c 	bm->b = TALLOC_ARRAY(mem_ctx, uint32, (n+31)/32);
bm                 76 source3/lib/bitmap.c 	if (!bm->b) {
bm                 80 source3/lib/bitmap.c 	memset(bm->b, 0, sizeof(uint32)*((n+31)/32));
bm                 82 source3/lib/bitmap.c 	return bm;
bm                102 source3/lib/bitmap.c bool bitmap_set(struct bitmap *bm, unsigned i)
bm                104 source3/lib/bitmap.c 	if (i >= bm->n) {
bm                106 source3/lib/bitmap.c 		      i, bm->n));
bm                109 source3/lib/bitmap.c 	bm->b[i/32] |= (1<<(i%32));
bm                116 source3/lib/bitmap.c bool bitmap_clear(struct bitmap *bm, unsigned i)
bm                118 source3/lib/bitmap.c 	if (i >= bm->n) {
bm                120 source3/lib/bitmap.c 		      i, bm->n));
bm                123 source3/lib/bitmap.c 	bm->b[i/32] &= ~(1<<(i%32));
bm                130 source3/lib/bitmap.c bool bitmap_query(struct bitmap *bm, unsigned i)
bm                132 source3/lib/bitmap.c 	if (i >= bm->n) return False;
bm                133 source3/lib/bitmap.c 	if (bm->b[i/32] & (1<<(i%32))) {
bm                143 source3/lib/bitmap.c int bitmap_find(struct bitmap *bm, unsigned ofs)
bm                147 source3/lib/bitmap.c 	if (ofs > bm->n) ofs = 0;
bm                150 source3/lib/bitmap.c 	while (i < bm->n) {
bm                151 source3/lib/bitmap.c 		if (~(bm->b[i/32])) {
bm                154 source3/lib/bitmap.c 				if (!bitmap_query(bm, j)) return j;
bm                156 source3/lib/bitmap.c 			} while (j & 31 && j < bm->n);
bm                164 source3/lib/bitmap.c 		if (~(bm->b[i/32])) {
bm                167 source3/lib/bitmap.c 				if (!bitmap_query(bm, j)) return j;
bm                169 source3/lib/bitmap.c 			} while (j & 31 && j < bm->n);
bm                824 source3/modules/vfs_full_audit.c static void init_bitmap(struct bitmap **bm, const char **ops)
bm                828 source3/modules/vfs_full_audit.c 	if (*bm != NULL)
bm                831 source3/modules/vfs_full_audit.c 	*bm = bitmap_allocate(SMB_VFS_OP_LAST);
bm                833 source3/modules/vfs_full_audit.c 	if (*bm == NULL) {
bm                859 source3/modules/vfs_full_audit.c 				bitmap_set(*bm, i);
bm                874 source3/modules/vfs_full_audit.c 		bitmap_free(*bm);
bm                875 source3/modules/vfs_full_audit.c 		*bm = NULL;
bm                 73 source4/torture/basic/properties.c static void show_bits(const struct bitmapping *bm, uint32_t value)
bm                 76 source4/torture/basic/properties.c 	for (i=0;bm[i].name;i++) {
bm                 77 source4/torture/basic/properties.c 		if (value & bm[i].value) {
bm                 78 source4/torture/basic/properties.c 			d_printf("\t%s\n", bm[i].name);
bm                 79 source4/torture/basic/properties.c 			value &= ~bm[i].value;