1 /* src/toolbox/bitvector.c - bitvector implementation
3 Copyright (C) 2005, 2006 R. Grafl, A. Krall, C. Kruegel, C. Oates,
4 R. Obermaisser, M. Platter, M. Probst, S. Ring, E. Steiner,
5 C. Thalinger, D. Thuernbeck, P. Tomsich, C. Ullrich, J. Wenninger,
6 Institut f. Computersprachen - TU Wien
8 This file is part of CACAO.
10 This program is free software; you can redistribute it and/or
11 modify it under the terms of the GNU General Public License as
12 published by the Free Software Foundation; either version 2, or (at
13 your option) any later version.
15 This program is distributed in the hope that it will be useful, but
16 WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with this program; if not, write to the Free Software
22 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
25 Contact: cacao@complang.tuwien.ac.at
27 Authors: Christian Ullrich
32 #include "mm/memory.h"
33 #include "toolbox/bitvector.h"
36 /******************************************************************************
38 Bitvector Implementation
40 ******************************************************************************/
44 /* Number of ints needed for size bits */
46 # define BV_NUM_INTS(size) (((((size) + 7)/ 8) + sizeof(int) - 1)\
49 /* Get index in bitvector */
51 # define BV_INT_INDEX(bit) ( ((bit) / 8) / sizeof(int) + 1)
53 /* Get bit index inside int */
55 # define BV_BIT_INDEX(bit, index) ( (bit) - (index - 1) * sizeof(int) * 8 );
59 /* Number of ints needed for size bits */
61 # define BV_NUM_INTS(size) (((((size) + 7)/ 8) + sizeof(int) - 1) / sizeof(int))
63 /* Get index in bitvector */
65 # define BV_INT_INDEX(bit) ( ((bit) / 8) / sizeof(int) )
67 /* Get bit index inside int */
69 # define BV_BIT_INDEX(bit, index) ( (bit) - (index) * sizeof(int) * 8 );
73 /************************************************************************
76 Transforms the bitvector bv to a string of 1's and 0's.
78 IN: bitvector bv bitvector created with bv_new()
79 int size size of bitvector bv
81 IN/OUT: char *string allocated buffer, at least size + 1 elements
83 RETURN:pointer to string
84 ******************************************************************************/
85 char *bv_to_string(bitvector bv, char *string, int size) {
88 _BV_ASSERT(bv[0] == size);
90 for(i = 0; i < size; i++)
91 if (bv_get_bit(bv, i))
100 /******************************************************************************
103 Creates a new bitvector and initializes all bits to 0.
105 IN: int size size of bitvector bv
109 *******************************************************************************/
110 bitvector bv_new(int size) {
114 /* Number of ints needed for size bits */
115 /* n = (((size+7)/8) + sizeof(int) - 1)/sizeof(int); */
116 n = BV_NUM_INTS(size);
120 for(i = 0; i < n; i++) bv[i] = 0;
122 #ifdef BV_DEBUG_CHECK
129 /******************************************************************************
132 Checks if a specific bit of the bitvector is set.
135 int bit Index of bit to check (0..size(
137 RETURN: bool true if bit is set otherwise false
138 *******************************************************************************/
139 bool bv_get_bit(bitvector bv, int bit) {
142 _BV_ASSERT(bit >= 0);
144 i = BV_INT_INDEX(bit);
145 n = BV_BIT_INDEX(bit, i);
147 _BV_ASSERT(i < (BV_NUM_INTS(bv[0])));
148 return (bv[i] & (1<<n));
151 /******************************************************************************
154 Sets a specific bit of the bitvector
157 int bit Index of bit to set (0..size(
158 *******************************************************************************/
159 void bv_set_bit(bitvector bv, int bit) {
162 _BV_ASSERT(bit >= 0);
164 i = BV_INT_INDEX(bit);
165 n = BV_BIT_INDEX(bit, i);
167 _BV_ASSERT(i < BV_NUM_INTS(bv[0]));
172 /******************************************************************************
175 Resets a specific bit of the bitvector
178 int bit Index of bit to reset (0..size(
179 *******************************************************************************/
180 void bv_reset_bit(bitvector bv, int bit) {
183 _BV_ASSERT(bit >= 0);
185 i = BV_INT_INDEX(bit);
186 n = BV_BIT_INDEX(bit, i);
188 _BV_ASSERT(i < BV_NUM_INTS(bv[0]));
193 /******************************************************************************
196 Resets all bits of the bitvector
199 int size Size of the bitvector
200 *******************************************************************************/
201 void bv_reset(bitvector bv, int size) {
204 _BV_ASSERT(bv[0] == size);
206 n = BV_NUM_INTS(size);
208 #ifdef BV_DEBUG_CHECK
209 for(i = 1; i < n; i++)
211 for(i = 0; i < n; i++)
216 /******************************************************************************
219 Checks if no bits of the bitvector are set == bitvector is "empty"
222 int size Size of the bitvector
224 RETURN: bool return true if bv is empty, false otherwise
225 *******************************************************************************/
226 bool bv_is_empty(bitvector bv, int size) {
230 _BV_ASSERT(bv[0] == size);
232 n = BV_NUM_INTS(size);
235 #ifdef BV_DEBUG_CHECK
236 for(i = 1; (i < n) && empty; i++)
238 for(i = 0; (i < n) && empty; i++)
240 empty = empty && (bv[i] == 0);
244 /******************************************************************************
247 Copyes bitvector src to dst
249 IN: bitvector dst bitvector created with bv_new
250 bitvector src bitvector created with bv_new
251 int size Size of the bitvector
252 *******************************************************************************/
253 void bv_copy(bitvector dst, bitvector src, int size) {
255 /* copy the whole bitvector */
256 _BV_ASSERT(dst[0] == size);
257 _BV_ASSERT(src[0] == size);
258 n = BV_NUM_INTS(size);
260 #ifdef BV_DEBUG_CHECK
261 for(i = 1; i < n; i++)
263 for(i = 0; i < n; i++)
268 /******************************************************************************
271 Compares two bitvectors
273 IN: bitvector s1 bitvector created with bv_new
274 bitvector s2 bitvector created with bv_new
275 int size Size of the bitvector
277 RETURN: bool true if s1==s1, false otherwise
278 *******************************************************************************/
279 bool bv_equal(bitvector s1, bitvector s2, int size) {
283 /* copy the whole bitvector */
284 _BV_ASSERT(s1[0] == size);
285 _BV_ASSERT(s2[0] == size);
290 n = BV_NUM_INTS(size);
292 #ifdef BV_DEBUG_CHECK
293 for(i = 1; equal && (i < n-1); i++)
295 for(i = 0; equal && (i < n-1); i++)
297 equal = (s1[i] == s2[i]);
299 /* Last compare maybe has to be masked! */
301 i = BV_INT_INDEX(size - 1);
302 n = BV_BIT_INDEX(size - 1, i);
304 _BV_ASSERT(i < BV_NUM_INTS(s1[0]));
305 _BV_ASSERT(i < BV_NUM_INTS(s2[0]));
307 if (n == (sizeof(int) * 8 - 1)) {
311 mask = (1<<(n+1)) - 1;
314 equal = equal && ( (s1[i]&mask) == (s2[i]&mask));
319 /******************************************************************************
322 d = s1 \ s2. ( set minus operator )
324 IN: bitvector s1 bitvector created with bv_new
325 bitvector s2 bitvector created with bv_new
326 int size Size of the bitvector
328 IN/OUT:bitvector d bitvector created with bv_new
330 *******************************************************************************/
331 void bv_minus(bitvector d, bitvector s1, bitvector s2, int size) {
334 _BV_ASSERT(d[0] == size);
335 _BV_ASSERT(s1[0] == size);
336 _BV_ASSERT(s2[0] == size);
337 n = BV_NUM_INTS(size);
338 #ifdef BV_DEBUG_CHECK
339 for(i = 1; i < n; i++)
341 for(i = 0; i < n; i++)
343 d[i] = s1[i] & (~s2[i]);
346 /******************************************************************************
349 d = s1 "union" s2. ( set union operator )
351 IN: bitvector s1 bitvector created with bv_new
352 bitvector s2 bitvector created with bv_new
353 int size Size of the bitvector
355 IN/OUT:bitvector d bitvector created with bv_new
357 *******************************************************************************/
358 void bv_union(bitvector d, bitvector s1, bitvector s2, int size) {
360 /* d = s1 union s2 */
361 _BV_ASSERT(d[0] == size);
362 _BV_ASSERT(s1[0] == size);
363 _BV_ASSERT(s2[0] == size);
364 n = BV_NUM_INTS(size);
365 #ifdef BV_DEBUG_CHECK
366 for(i = 1; i < n; i++)
368 for(i = 0; i < n; i++)
370 d[i] = s1[i] | s2[i];
374 * These are local overrides for various environment variables in Emacs.
375 * Please do not remove this and leave it at the end of the file, where
376 * Emacs will automagically detect them.
377 * ---------------------------------------------------------------------
380 * indent-tabs-mode: t