2 Unix SMB/CIFS implementation.
3 simple bitmap functions
4 Copyright (C) Andrew Tridgell 1992-1998
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
21 #include "lib/util/bitmap.h"
28 /* these functions provide a simple way to allocate integers from a
29 pool without repetition */
31 /****************************************************************************
33 ****************************************************************************/
34 struct bitmap *bitmap_talloc(TALLOC_CTX *mem_ctx, int n)
38 bm = talloc(mem_ctx, struct bitmap);
43 bm->b = talloc_zero_array(bm, uint32_t, (n+31)/32);
51 /****************************************************************************
52 copy as much of the source bitmap as will fit in the destination bitmap.
53 ****************************************************************************/
55 int bitmap_copy(struct bitmap * const dst, const struct bitmap * const src)
57 int count = MIN(dst->n, src->n);
59 SMB_ASSERT(dst->b != src->b);
60 memcpy(dst->b, src->b, sizeof(uint32_t)*((count+31)/32));
65 /****************************************************************************
67 ****************************************************************************/
68 bool bitmap_set(struct bitmap *bm, unsigned i)
71 DEBUG(0,("Setting invalid bitmap entry %d (of %d)\n",
75 bm->b[i/32] |= (1<<(i%32));
79 /****************************************************************************
80 clear a bit in a bitmap
81 ****************************************************************************/
82 bool bitmap_clear(struct bitmap *bm, unsigned i)
85 DEBUG(0,("clearing invalid bitmap entry %d (of %d)\n",
89 bm->b[i/32] &= ~(1<<(i%32));
93 /****************************************************************************
94 query a bit in a bitmap
95 ****************************************************************************/
96 bool bitmap_query(struct bitmap *bm, unsigned i)
98 if (i >= bm->n) return false;
99 if (bm->b[i/32] & (1<<(i%32))) {
105 /****************************************************************************
106 find a zero bit in a bitmap starting at the specified offset, with
108 ****************************************************************************/
109 int bitmap_find(struct bitmap *bm, unsigned ofs)
113 if (ofs > bm->n) ofs = 0;
117 if (~(bm->b[i/32])) {
120 if (!bitmap_query(bm, j)) return j;
122 } while (j & 31 && j < bm->n);
130 if (~(bm->b[i/32])) {
133 if (!bitmap_query(bm, j)) return j;
135 } while (j & 31 && j < bm->n);