1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
/*
Unix SMB/Netbios implementation.
Version 1.9.
simple bitmap functions
Copyright (C) Andrew Tridgell 1992-1998
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include "includes.h"
/* these functions provide a simple way to allocate integers from a
pool without repitition */
/****************************************************************************
allocate a bitmap of the specified size
****************************************************************************/
struct bitmap *bitmap_allocate(int n)
{
struct bitmap *bm;
bm = (struct bitmap *)malloc(sizeof(*bm));
bm->n = n;
if (!bm) return NULL;
bm->b = (uint32 *)malloc(sizeof(bm->b[0])*(n+31)/32);
if (!bm->b) {
free(bm);
return NULL;
}
memset(bm->b, 0, sizeof(bm->b[0])*bm->n);
return bm;
}
/****************************************************************************
free a bitmap structure
****************************************************************************/
void bitmap_free(struct bitmap *bm)
{
free(bm->b);
bm->b = NULL;
free(bm);
}
/****************************************************************************
set a bit in a bitmap
****************************************************************************/
BOOL bitmap_set(struct bitmap *bm, unsigned i)
{
if (i >= bm->n) return False;
bm->b[i/32] |= (1<<(i%32));
return True;
}
/****************************************************************************
query a bit in a bitmap
****************************************************************************/
BOOL bitmap_query(struct bitmap *bm, unsigned i)
{
if (i >= bm->n) return False;
if (bm->b[i/32] & (1<<(i%32))) {
return True;
}
return False;
}
/****************************************************************************
find a zero bit in a bitmap starting at the specified offset, with
wraparound
****************************************************************************/
int bitmap_find(struct bitmap *bm, unsigned ofs)
{
int i, j;
if (ofs > bm->n) ofs = 0;
i = ofs;
while (i < bm->n) {
if (~(bm->b[i/32])) {
j = i;
do {
if (!bitmap_query(bm, j)) return j;
j++;
} while (j & 31 && j < bm->n);
}
i += 32;
i &= ~31;
}
i = 0;
while (i < ofs) {
if (~(bm->b[i/32])) {
j = i;
do {
if (!bitmap_query(bm, j)) return j;
j++;
} while (j & 31 && j < bm->n);
}
i += 32;
i &= ~31;
}
return -1;
}
|