]>
git.saurik.com Git - bison.git/blob - lib/bitset.h
8e319380b914e27dea5f9594482dc4ff76302cd1
2 Copyright (C) 2002-2004, 2009-2010 Free Software Foundation, Inc.
3 Contributed by Michael Hayes (m.hayes@elec.canterbury.ac.nz).
5 This program is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation, either version 3 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>. */
21 /* This file is the public interface to the bitset abstract data type.
22 Only use the functions and macros defined in this file. */
29 # include "unlocked-io.h"
32 /* Attributes used to select a bitset implementation. */
33 enum bitset_attr
{BITSET_FIXED
= 1, /* Bitset size fixed. */
34 BITSET_VARIABLE
= 2, /* Bitset size variable. */
35 BITSET_DENSE
= 4, /* Bitset dense. */
36 BITSET_SPARSE
= 8, /* Bitset sparse. */
37 BITSET_FRUGAL
= 16, /* Prefer most compact. */
38 BITSET_GREEDY
= 32}; /* Prefer fastest at memory expense. */
40 typedef unsigned int bitset_attrs
;
42 /* The contents of the union should be considered to be private.
43 While I would like to make this union opaque, it needs to be
44 visible for the inline bit set/test functions, and for delegation
45 to the proper implementation. */
48 /* This must be the first member of every other structure that is a
49 member of this union. */
50 struct bbitset_struct b
; /* Base bitset data. */
54 struct bbitset_struct b
;
55 bitset_word words
[1]; /* The array of bits. */
60 struct bbitset_struct b
;
61 bitset_windex size
; /* Number of elements. */
62 struct ebitset_elt_struct
**elts
; /* Expanding array of ptrs to elts. */
67 struct bbitset_struct b
;
68 struct lbitset_elt_struct
*head
; /* First element in linked list. */
69 struct lbitset_elt_struct
*tail
; /* Last element in linked list. */
72 struct bitset_stats_struct
74 struct bbitset_struct b
;
80 struct bbitset_struct b
;
81 bitset_windex size
; /* Allocated size of array. */
87 /* The contents of this structure should be considered private.
88 It is used for iterating over set bits. */
91 bitset_bindex list
[BITSET_LIST_SIZE
];
98 /* Return bytes required for bitset of desired type and size. */
99 extern size_t bitset_bytes (enum bitset_type
, bitset_bindex
);
101 /* Initialise a bitset with desired type and size. */
102 extern bitset
bitset_init (bitset
, bitset_bindex
, enum bitset_type
);
104 /* Select an implementation type based on the desired bitset size
106 extern enum bitset_type
bitset_type_choose (bitset_bindex
, bitset_attrs
);
108 /* Create a bitset of desired type and size. The bitset is zeroed. */
109 extern bitset
bitset_alloc (bitset_bindex
, enum bitset_type
);
112 extern void bitset_free (bitset
);
114 /* Create a bitset of desired type and size using an obstack. The
116 extern bitset
bitset_obstack_alloc (struct obstack
*bobstack
,
117 bitset_bindex
, enum bitset_type
);
119 /* Free bitset allocated on obstack. */
120 extern void bitset_obstack_free (bitset
);
122 /* Create a bitset of desired size and attributes. The bitset is zeroed. */
123 extern bitset
bitset_create (bitset_bindex
, bitset_attrs
);
125 /* Return bitset type. */
126 extern enum bitset_type
bitset_type_get (bitset
);
128 /* Return bitset type name. */
129 extern const char *bitset_type_name_get (bitset
);
132 /* Set bit BITNO in bitset BSET. */
134 bitset_set (bitset bset
, bitset_bindex bitno
)
136 bitset_windex windex
= bitno
/ BITSET_WORD_BITS
;
137 bitset_windex offset
= windex
- bset
->b
.cindex
;
139 if (offset
< bset
->b
.csize
)
140 bset
->b
.cdata
[offset
] |= ((bitset_word
) 1 << (bitno
% BITSET_WORD_BITS
));
142 BITSET_SET_ (bset
, bitno
);
146 /* Reset bit BITNO in bitset BSET. */
148 bitset_reset (bitset bset
, bitset_bindex bitno
)
150 bitset_windex windex
= bitno
/ BITSET_WORD_BITS
;
151 bitset_windex offset
= windex
- bset
->b
.cindex
;
153 if (offset
< bset
->b
.csize
)
154 bset
->b
.cdata
[offset
] &= ~((bitset_word
) 1 << (bitno
% BITSET_WORD_BITS
));
156 BITSET_RESET_ (bset
, bitno
);
160 /* Test bit BITNO in bitset BSET. */
162 bitset_test (bitset bset
, bitset_bindex bitno
)
164 bitset_windex windex
= bitno
/ BITSET_WORD_BITS
;
165 bitset_windex offset
= windex
- bset
->b
.cindex
;
167 if (offset
< bset
->b
.csize
)
168 return (bset
->b
.cdata
[offset
] >> (bitno
% BITSET_WORD_BITS
)) & 1;
170 return BITSET_TEST_ (bset
, bitno
);
174 /* Toggle bit BITNO in bitset BSET and return non-zero if now set. */
175 #define bitset_toggle(bset, bitno) BITSET_TOGGLE_ (bset, bitno)
177 /* Return size in bits of bitset SRC. */
178 #define bitset_size(SRC) BITSET_SIZE_ (SRC)
180 /* Change size of bitset. */
181 extern void bitset_resize (bitset
, bitset_bindex
);
183 /* Return number of bits set in bitset SRC. */
184 #define bitset_count(SRC) BITSET_COUNT_ (SRC)
187 /* Return SRC == 0. */
188 #define bitset_empty_p(SRC) BITSET_EMPTY_P_ (SRC)
191 #define bitset_ones(DST) BITSET_ONES_ (DST)
194 #define bitset_zero(DST) BITSET_ZERO_ (DST)
199 #define bitset_copy(DST, SRC) BITSET_COPY_ (DST, SRC)
201 /* Return DST & SRC == 0. */
202 #define bitset_disjoint_p(DST, SRC) BITSET_DISJOINT_P_ (DST, SRC)
204 /* Return DST == SRC. */
205 #define bitset_equal_p(DST, SRC) BITSET_EQUAL_P_ (DST, SRC)
208 #define bitset_not(DST, SRC) BITSET_NOT_ (DST, SRC)
210 /* Return DST == DST | SRC. */
211 #define bitset_subset_p(DST, SRC) BITSET_SUBSET_P_ (DST, SRC)
215 /* DST = SRC1 & SRC2. */
216 #define bitset_and(DST, SRC1, SRC2) BITSET_AND_ (DST, SRC1, SRC2)
218 /* DST = SRC1 & SRC2. Return non-zero if DST != SRC1 & SRC2. */
219 #define bitset_and_cmp(DST, SRC1, SRC2) BITSET_AND_CMP_ (DST, SRC1, SRC2)
221 /* DST = SRC1 & ~SRC2. */
222 #define bitset_andn(DST, SRC1, SRC2) BITSET_ANDN_ (DST, SRC1, SRC2)
224 /* DST = SRC1 & ~SRC2. Return non-zero if DST != SRC1 & ~SRC2. */
225 #define bitset_andn_cmp(DST, SRC1, SRC2) BITSET_ANDN_CMP_ (DST, SRC1, SRC2)
227 /* DST = SRC1 | SRC2. */
228 #define bitset_or(DST, SRC1, SRC2) BITSET_OR_ (DST, SRC1, SRC2)
230 /* DST = SRC1 | SRC2. Return non-zero if DST != SRC1 | SRC2. */
231 #define bitset_or_cmp(DST, SRC1, SRC2) BITSET_OR_CMP_ (DST, SRC1, SRC2)
233 /* DST = SRC1 ^ SRC2. */
234 #define bitset_xor(DST, SRC1, SRC2) BITSET_XOR_ (DST, SRC1, SRC2)
236 /* DST = SRC1 ^ SRC2. Return non-zero if DST != SRC1 ^ SRC2. */
237 #define bitset_xor_cmp(DST, SRC1, SRC2) BITSET_XOR_CMP_ (DST, SRC1, SRC2)
241 /* DST = (SRC1 & SRC2) | SRC3. */
242 #define bitset_and_or(DST, SRC1, SRC2, SRC3) \
243 BITSET_AND_OR_ (DST, SRC1, SRC2, SRC3)
245 /* DST = (SRC1 & SRC2) | SRC3. Return non-zero if
246 DST != (SRC1 & SRC2) | SRC3. */
247 #define bitset_and_or_cmp(DST, SRC1, SRC2, SRC3) \
248 BITSET_AND_OR_CMP_ (DST, SRC1, SRC2, SRC3)
250 /* DST = (SRC1 & ~SRC2) | SRC3. */
251 #define bitset_andn_or(DST, SRC1, SRC2, SRC3) \
252 BITSET_ANDN_OR_ (DST, SRC1, SRC2, SRC3)
254 /* DST = (SRC1 & ~SRC2) | SRC3. Return non-zero if
255 DST != (SRC1 & ~SRC2) | SRC3. */
256 #define bitset_andn_or_cmp(DST, SRC1, SRC2, SRC3) \
257 BITSET_ANDN_OR_CMP_ (DST, SRC1, SRC2, SRC3)
259 /* DST = (SRC1 | SRC2) & SRC3. */
260 #define bitset_or_and(DST, SRC1, SRC2, SRC3)\
261 BITSET_OR_AND_ (DST, SRC1, SRC2, SRC3)
263 /* DST = (SRC1 | SRC2) & SRC3. Return non-zero if
264 DST != (SRC1 | SRC2) & SRC3. */
265 #define bitset_or_and_cmp(DST, SRC1, SRC2, SRC3)\
266 BITSET_OR_AND_CMP_ (DST, SRC1, SRC2, SRC3)
268 /* Find list of up to NUM bits set in BSET starting from and including
269 *NEXT. Return with actual number of bits found and with *NEXT
270 indicating where search stopped. */
271 #define bitset_list(BSET, LIST, NUM, NEXT) \
272 BITSET_LIST_ (BSET, LIST, NUM, NEXT)
274 /* Find reverse list of up to NUM bits set in BSET starting from and
275 including NEXT. Return with actual number of bits found and with
276 *NEXT indicating where search stopped. */
277 #define bitset_list_reverse(BSET, LIST, NUM, NEXT) \
278 BITSET_LIST_REVERSE_ (BSET, LIST, NUM, NEXT)
280 /* Return true if both bitsets are of the same type and size. */
281 extern bool bitset_compatible_p (bitset bset1
, bitset bset2
);
283 /* Find next set bit from the given bit index. */
284 extern bitset_bindex
bitset_next (bitset
, bitset_bindex
);
286 /* Find previous set bit from the given bit index. */
287 extern bitset_bindex
bitset_prev (bitset
, bitset_bindex
);
289 /* Find first set bit. */
290 extern bitset_bindex
bitset_first (bitset
);
292 /* Find last set bit. */
293 extern bitset_bindex
bitset_last (bitset
);
295 /* Return nonzero if this is the only set bit. */
296 extern bool bitset_only_set_p (bitset
, bitset_bindex
);
299 extern void bitset_dump (FILE *, bitset
);
301 /* Loop over all elements of BSET, starting with MIN, setting INDEX
302 to the index of each set bit. For example, the following will print
303 the bits set in a bitset:
306 bitset_iterator iter;
308 BITSET_FOR_EACH (iter, src, i, 0)
310 printf ("%lu ", (unsigned long int) i);
313 #define BITSET_FOR_EACH(ITER, BSET, INDEX, MIN) \
314 for (ITER.next = (MIN), ITER.num = BITSET_LIST_SIZE; \
315 (ITER.num == BITSET_LIST_SIZE) \
316 && (ITER.num = bitset_list (BSET, ITER.list, \
317 BITSET_LIST_SIZE, &ITER.next));) \
319 ITER.i < ITER.num && ((INDEX) = ITER.list[ITER.i], 1); \
323 /* Loop over all elements of BSET, in reverse order starting with
324 MIN, setting INDEX to the index of each set bit. For example, the
325 following will print the bits set in a bitset in reverse order:
328 bitset_iterator iter;
330 BITSET_FOR_EACH_REVERSE (iter, src, i, 0)
332 printf ("%lu ", (unsigned long int) i);
335 #define BITSET_FOR_EACH_REVERSE(ITER, BSET, INDEX, MIN) \
336 for (ITER.next = (MIN), ITER.num = BITSET_LIST_SIZE; \
337 (ITER.num == BITSET_LIST_SIZE) \
338 && (ITER.num = bitset_list_reverse (BSET, ITER.list, \
339 BITSET_LIST_SIZE, &ITER.next));) \
341 ITER.i < ITER.num && ((INDEX) = ITER.list[ITER.i], 1); \
345 /* Define set operations in terms of logical operations. */
347 #define bitset_diff(DST, SRC1, SRC2) bitset_andn (DST, SRC1, SRC2)
348 #define bitset_diff_cmp(DST, SRC1, SRC2) bitset_andn_cmp (DST, SRC1, SRC2)
350 #define bitset_intersection(DST, SRC1, SRC2) bitset_and (DST, SRC1, SRC2)
351 #define bitset_intersection_cmp(DST, SRC1, SRC2) bitset_and_cmp (DST, SRC1, SRC2)
353 #define bitset_union(DST, SRC1, SRC2) bitset_or (DST, SRC1, SRC2)
354 #define bitset_union_cmp(DST, SRC1, SRC2) bitset_or_cmp (DST, SRC1, SRC2)
356 /* Symmetrical difference. */
357 #define bitset_symdiff(DST, SRC1, SRC2) bitset_xor (DST, SRC1, SRC2)
358 #define bitset_symdiff_cmp(DST, SRC1, SRC2) bitset_xor_cmp (DST, SRC1, SRC2)
360 /* Union of difference. */
361 #define bitset_diff_union(DST, SRC1, SRC2, SRC3) \
362 bitset_andn_or (DST, SRC1, SRC2, SRC3)
363 #define bitset_diff_union_cmp(DST, SRC1, SRC2, SRC3) \
364 bitset_andn_or_cmp (DST, SRC1, SRC2, SRC3)
367 /* Release any memory tied up with bitsets. */
368 extern void bitset_release_memory (void);
370 /* Enable bitset stats gathering. */
371 extern void bitset_stats_enable (void);
373 /* Disable bitset stats gathering. */
374 extern void bitset_stats_disable (void);
376 /* Read bitset stats file of accummulated stats. */
377 void bitset_stats_read (const char *file_name
);
379 /* Write bitset stats file of accummulated stats. */
380 void bitset_stats_write (const char *file_name
);
382 /* Dump bitset stats. */
383 extern void bitset_stats_dump (FILE *);
385 /* Function to debug bitset from debugger. */
386 extern void debug_bitset (bitset
);
388 /* Function to debug bitset stats from debugger. */
389 extern void debug_bitset_stats (void);
391 #endif /* _BITSET_H */