]>
Commit | Line | Data |
---|---|---|
096ab9ea | 1 | /* Functions to support general ended bitmaps. |
a5544970 | 2 | Copyright (C) 1997-2019 Free Software Foundation, Inc. |
096ab9ea | 3 | |
1322177d | 4 | This file is part of GCC. |
096ab9ea | 5 | |
1322177d LB |
6 | GCC is free software; you can redistribute it and/or modify it under |
7 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 8 | Software Foundation; either version 3, or (at your option) any later |
1322177d | 9 | version. |
096ab9ea | 10 | |
1322177d LB |
11 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
12 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 | for more details. | |
096ab9ea RK |
15 | |
16 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
096ab9ea | 19 | |
88657302 | 20 | #ifndef GCC_BITMAP_H |
ca7fd9cd | 21 | #define GCC_BITMAP_H |
0263463d | 22 | |
d1e14d97 | 23 | /* Implementation of sparse integer sets as a linked list or tree. |
0263463d SB |
24 | |
25 | This sparse set representation is suitable for sparse sets with an | |
d1e14d97 SB |
26 | unknown (a priori) universe. |
27 | ||
28 | Sets are represented as double-linked lists of container nodes of | |
29 | type "struct bitmap_element" or as a binary trees of the same | |
30 | container nodes. Each container node consists of an index for the | |
31 | first member that could be held in the container, a small array of | |
32 | integers that represent the members in the container, and pointers | |
33 | to the next and previous element in the linked list, or left and | |
34 | right children in the tree. In linked-list form, the container | |
35 | nodes in the list are sorted in ascending order, i.e. the head of | |
0263463d | 36 | the list holds the element with the smallest member of the set. |
d1e14d97 | 37 | In tree form, nodes to the left have a smaller container index. |
0263463d SB |
38 | |
39 | For a given member I in the set: | |
40 | - the element for I will have index is I / (bits per element) | |
41 | - the position for I within element is I % (bits per element) | |
42 | ||
43 | This representation is very space-efficient for large sparse sets, and | |
44 | the size of the set can be changed dynamically without much overhead. | |
45 | An important parameter is the number of bits per element. In this | |
46 | implementation, there are 128 bits per element. This results in a | |
47 | high storage overhead *per element*, but a small overall overhead if | |
48 | the set is very sparse. | |
49 | ||
d1e14d97 SB |
50 | The storage requirements for linked-list sparse sets are O(E), with E->N |
51 | in the worst case (a sparse set with large distances between the values | |
52 | of the set members). | |
0263463d | 53 | |
d1e14d97 SB |
54 | This representation also works well for data flow problems where the size |
55 | of the set may grow dynamically, but care must be taken that the member_p, | |
56 | add_member, and remove_member operations occur with a suitable access | |
57 | pattern. | |
58 | ||
59 | The linked-list set representation works well for problems involving very | |
60 | sparse sets. The canonical example in GCC is, of course, the "set of | |
61 | sets" for some CFG-based data flow problems (liveness analysis, dominance | |
62 | frontiers, etc.). | |
63 | ||
64 | For random-access sparse sets of unknown universe, the binary tree | |
65 | representation is likely to be a more suitable choice. Theoretical | |
66 | access times for the binary tree representation are better than those | |
67 | for the linked-list, but in practice this is only true for truely | |
68 | random access. | |
69 | ||
70 | Often the most suitable representation during construction of the set | |
71 | is not the best choice for the usage of the set. For such cases, the | |
72 | "view" of the set can be changed from one representation to the other. | |
73 | This is an O(E) operation: | |
74 | ||
75 | * from list to tree view : bitmap_tree_view | |
76 | * from tree to list view : bitmap_list_view | |
77 | ||
78 | Traversing linked lists or trees can be cache-unfriendly. Performance | |
79 | can be improved by keeping container nodes in the set grouped together | |
80 | in memory, using a dedicated obstack for a set (or group of related | |
81 | sets). Elements allocated on obstacks are released to a free-list and | |
82 | taken off the free list. If multiple sets are allocated on the same | |
83 | obstack, elements freed from one set may be re-used for one of the other | |
84 | sets. This usually helps avoid cache misses. | |
85 | ||
86 | A single free-list is used for all sets allocated in GGC space. This is | |
87 | bad for persistent sets, so persistent sets should be allocated on an | |
88 | obstack whenever possible. | |
89 | ||
90 | For random-access sets with a known, relatively small universe size, the | |
91 | SparseSet or simple bitmap representations may be more efficient than a | |
92 | linked-list set. | |
93 | ||
94 | ||
95 | LINKED LIST FORM | |
96 | ================ | |
97 | ||
98 | In linked-list form, in-order iterations of the set can be executed | |
99 | efficiently. The downside is that many random-access operations are | |
100 | relatively slow, because the linked list has to be traversed to test | |
101 | membership (i.e. member_p/ add_member/remove_member). | |
102 | ||
103 | To improve the performance of this set representation, the last | |
104 | accessed element and its index are cached. For membership tests on | |
105 | members close to recently accessed members, the cached last element | |
106 | improves membership test to a constant-time operation. | |
107 | ||
108 | The following operations can always be performed in O(1) time in | |
109 | list view: | |
0263463d SB |
110 | |
111 | * clear : bitmap_clear | |
d1e14d97 | 112 | * smallest_member : bitmap_first_set_bit |
0263463d | 113 | * choose_one : (not implemented, but could be |
d1e14d97 | 114 | in constant time) |
0263463d | 115 | |
d1e14d97 SB |
116 | The following operations can be performed in O(E) time worst-case in |
117 | list view (with E the number of elements in the linked list), but in | |
118 | O(1) time with a suitable access patterns: | |
0263463d SB |
119 | |
120 | * member_p : bitmap_bit_p | |
d1e14d97 SB |
121 | * add_member : bitmap_set_bit / bitmap_set_range |
122 | * remove_member : bitmap_clear_bit / bitmap_clear_range | |
0263463d | 123 | |
d1e14d97 | 124 | The following operations can be performed in O(E) time in list view: |
0263463d SB |
125 | |
126 | * cardinality : bitmap_count_bits | |
d1e14d97 | 127 | * largest_member : bitmap_last_set_bit (but this could |
0263463d SB |
128 | in constant time with a pointer to |
129 | the last element in the chain) | |
d1e14d97 SB |
130 | * set_size : bitmap_last_set_bit |
131 | ||
132 | In tree view the following operations can all be performed in O(log E) | |
133 | amortized time with O(E) worst-case behavior. | |
134 | ||
135 | * smallest_member | |
136 | * largest_member | |
137 | * set_size | |
138 | * member_p | |
139 | * add_member | |
140 | * remove_member | |
0263463d SB |
141 | |
142 | Additionally, the linked-list sparse set representation supports | |
143 | enumeration of the members in O(E) time: | |
144 | ||
145 | * forall : EXECUTE_IF_SET_IN_BITMAP | |
146 | * set_copy : bitmap_copy | |
147 | * set_intersection : bitmap_intersect_p / | |
148 | bitmap_and / bitmap_and_into / | |
149 | EXECUTE_IF_AND_IN_BITMAP | |
150 | * set_union : bitmap_ior / bitmap_ior_into | |
151 | * set_difference : bitmap_intersect_compl_p / | |
152 | bitmap_and_comp / bitmap_and_comp_into / | |
153 | EXECUTE_IF_AND_COMPL_IN_BITMAP | |
154 | * set_disjuction : bitmap_xor_comp / bitmap_xor_comp_into | |
155 | * set_compare : bitmap_equal_p | |
156 | ||
026c3cfd | 157 | Some operations on 3 sets that occur frequently in data flow problems |
0263463d SB |
158 | are also implemented: |
159 | ||
160 | * A | (B & C) : bitmap_ior_and_into | |
161 | * A | (B & ~C) : bitmap_ior_and_compl / | |
162 | bitmap_ior_and_compl_into | |
163 | ||
0263463d | 164 | |
d1e14d97 SB |
165 | BINARY TREE FORM |
166 | ================ | |
167 | An alternate "view" of a bitmap is its binary tree representation. | |
168 | For this representation, splay trees are used because they can be | |
169 | implemented using the same data structures as the linked list, with | |
170 | no overhead for meta-data (like color, or rank) on the tree nodes. | |
0263463d | 171 | |
d1e14d97 SB |
172 | In binary tree form, random-access to the set is much more efficient |
173 | than for the linked-list representation. Downsides are the high cost | |
174 | of clearing the set, and the relatively large number of operations | |
175 | necessary to balance the tree. Also, iterating the set members is | |
176 | not supported. | |
0263463d | 177 | |
d1e14d97 SB |
178 | As for the linked-list representation, the last accessed element and |
179 | its index are cached, so that membership tests on the latest accessed | |
180 | members is a constant-time operation. Other lookups take O(logE) | |
181 | time amortized (but O(E) time worst-case). | |
0263463d | 182 | |
d1e14d97 SB |
183 | The following operations can always be performed in O(1) time: |
184 | ||
185 | * choose_one : (not implemented, but could be | |
186 | implemented in constant time) | |
187 | ||
188 | The following operations can be performed in O(logE) time amortized | |
189 | but O(E) time worst-case, but in O(1) time if the same element is | |
190 | accessed. | |
191 | ||
192 | * member_p : bitmap_bit_p | |
193 | * add_member : bitmap_set_bit | |
194 | * remove_member : bitmap_clear_bit | |
195 | ||
196 | The following operations can be performed in O(logE) time amortized | |
197 | but O(E) time worst-case: | |
198 | ||
199 | * smallest_member : bitmap_first_set_bit | |
200 | * largest_member : bitmap_last_set_bit | |
201 | * set_size : bitmap_last_set_bit | |
202 | ||
203 | The following operations can be performed in O(E) time: | |
204 | ||
205 | * clear : bitmap_clear | |
206 | ||
207 | The binary tree sparse set representation does *not* support any form | |
208 | of enumeration, and does also *not* support logical operations on sets. | |
209 | The binary tree representation is only supposed to be used for sets | |
210 | on which many random-access membership tests will happen. */ | |
0263463d | 211 | |
b60db1ba | 212 | #include "obstack.h" |
2d44c7de ML |
213 | |
214 | /* Bitmap memory usage. */ | |
6c1dae73 | 215 | class bitmap_usage: public mem_usage |
2d44c7de | 216 | { |
6c1dae73 | 217 | public: |
2d44c7de ML |
218 | /* Default contructor. */ |
219 | bitmap_usage (): m_nsearches (0), m_search_iter (0) {} | |
220 | /* Constructor. */ | |
221 | bitmap_usage (size_t allocated, size_t times, size_t peak, | |
222 | uint64_t nsearches, uint64_t search_iter) | |
223 | : mem_usage (allocated, times, peak), | |
224 | m_nsearches (nsearches), m_search_iter (search_iter) {} | |
225 | ||
226 | /* Sum the usage with SECOND usage. */ | |
80a4fe78 ML |
227 | bitmap_usage |
228 | operator+ (const bitmap_usage &second) | |
2d44c7de ML |
229 | { |
230 | return bitmap_usage (m_allocated + second.m_allocated, | |
231 | m_times + second.m_times, | |
232 | m_peak + second.m_peak, | |
233 | m_nsearches + second.m_nsearches, | |
234 | m_search_iter + second.m_search_iter); | |
235 | } | |
236 | ||
237 | /* Dump usage coupled to LOC location, where TOTAL is sum of all rows. */ | |
80a4fe78 ML |
238 | inline void |
239 | dump (mem_location *loc, mem_usage &total) const | |
2d44c7de | 240 | { |
ac059261 | 241 | char *location_string = loc->to_string (); |
2d44c7de | 242 | |
a0b48080 MM |
243 | fprintf (stderr, "%-48s " PRsa (9) ":%5.1f%%" |
244 | PRsa (9) PRsa (9) ":%5.1f%%" | |
245 | PRsa (11) PRsa (11) "%10s\n", | |
40ce7fa6 | 246 | location_string, SIZE_AMOUNT (m_allocated), |
43331dfb | 247 | get_percent (m_allocated, total.m_allocated), |
40ce7fa6 | 248 | SIZE_AMOUNT (m_peak), SIZE_AMOUNT (m_times), |
2d44c7de | 249 | get_percent (m_times, total.m_times), |
40ce7fa6 | 250 | SIZE_AMOUNT (m_nsearches), SIZE_AMOUNT (m_search_iter), |
2d44c7de | 251 | loc->m_ggc ? "ggc" : "heap"); |
ac059261 ML |
252 | |
253 | free (location_string); | |
2d44c7de ML |
254 | } |
255 | ||
256 | /* Dump header with NAME. */ | |
80a4fe78 ML |
257 | static inline void |
258 | dump_header (const char *name) | |
2d44c7de ML |
259 | { |
260 | fprintf (stderr, "%-48s %11s%16s%17s%12s%12s%10s\n", name, "Leak", "Peak", | |
261 | "Times", "N searches", "Search iter", "Type"); | |
2d44c7de ML |
262 | } |
263 | ||
264 | /* Number search operations. */ | |
265 | uint64_t m_nsearches; | |
266 | /* Number of search iterations. */ | |
267 | uint64_t m_search_iter; | |
268 | }; | |
269 | ||
270 | /* Bitmap memory description. */ | |
271 | extern mem_alloc_description<bitmap_usage> bitmap_mem_desc; | |
a05924f9 | 272 | |
72e42e26 SB |
273 | /* Fundamental storage type for bitmap. */ |
274 | ||
72e42e26 | 275 | typedef unsigned long BITMAP_WORD; |
65a6f342 NS |
276 | /* BITMAP_WORD_BITS needs to be unsigned, but cannot contain casts as |
277 | it is used in preprocessor directives -- hence the 1u. */ | |
278 | #define BITMAP_WORD_BITS (CHAR_BIT * SIZEOF_LONG * 1u) | |
72e42e26 | 279 | |
096ab9ea RK |
280 | /* Number of words to use for each element in the linked list. */ |
281 | ||
282 | #ifndef BITMAP_ELEMENT_WORDS | |
65a6f342 | 283 | #define BITMAP_ELEMENT_WORDS ((128 + BITMAP_WORD_BITS - 1) / BITMAP_WORD_BITS) |
096ab9ea RK |
284 | #endif |
285 | ||
65a6f342 | 286 | /* Number of bits in each actual element of a bitmap. */ |
096ab9ea | 287 | |
65a6f342 | 288 | #define BITMAP_ELEMENT_ALL_BITS (BITMAP_ELEMENT_WORDS * BITMAP_WORD_BITS) |
096ab9ea | 289 | |
7932a3db | 290 | /* Obstack for allocating bitmaps and elements from. */ |
7eeb6fc2 | 291 | struct bitmap_obstack { |
84562394 OE |
292 | struct bitmap_element *elements; |
293 | struct bitmap_head *heads; | |
7eeb6fc2 | 294 | struct obstack obstack; |
84562394 | 295 | }; |
7932a3db | 296 | |
096ab9ea RK |
297 | /* Bitmap set element. We use a linked list to hold only the bits that |
298 | are set. This allows for use to grow the bitset dynamically without | |
c22cacf3 | 299 | having to realloc and copy a giant bit array. |
5765e552 KZ |
300 | |
301 | The free list is implemented as a list of lists. There is one | |
302 | outer list connected together by prev fields. Each element of that | |
303 | outer is an inner list (that may consist only of the outer list | |
304 | element) that are connected by the next fields. The prev pointer | |
305 | is undefined for interior elements. This allows | |
306 | bitmap_elt_clear_from to be implemented in unit time rather than | |
307 | linear in the number of elements to be freed. */ | |
096ab9ea | 308 | |
7eeb6fc2 | 309 | struct GTY((chain_next ("%h.next"))) bitmap_element { |
d1e14d97 SB |
310 | /* In list form, the next element in the linked list; |
311 | in tree form, the left child node in the tree. */ | |
312 | struct bitmap_element *next; | |
313 | /* In list form, the previous element in the linked list; | |
314 | in tree form, the right child node in the tree. */ | |
315 | struct bitmap_element *prev; | |
316 | /* regno/BITMAP_ELEMENT_ALL_BITS. */ | |
317 | unsigned int indx; | |
318 | /* Bits that are set, counting from INDX, inclusive */ | |
319 | BITMAP_WORD bits[BITMAP_ELEMENT_WORDS]; | |
84562394 | 320 | }; |
096ab9ea | 321 | |
3c53f55a SB |
322 | /* Head of bitmap linked list. The 'current' member points to something |
323 | already pointed to by the chain started by first, so GTY((skip)) it. */ | |
01d419ae | 324 | |
6c1dae73 MS |
325 | class GTY(()) bitmap_head { |
326 | public: | |
1c252ef3 RB |
327 | static bitmap_obstack crashme; |
328 | /* Poison obstack to not make it not a valid initialized GC bitmap. */ | |
329 | CONSTEXPR bitmap_head() | |
7664eeb7 ML |
330 | : indx (0), tree_form (false), padding (0), alloc_descriptor (0), first (NULL), |
331 | current (NULL), obstack (&crashme) | |
1c252ef3 | 332 | {} |
d1e14d97 SB |
333 | /* Index of last element looked at. */ |
334 | unsigned int indx; | |
335 | /* False if the bitmap is in list form; true if the bitmap is in tree form. | |
336 | Bitmap iterators only work on bitmaps in list form. */ | |
7664eeb7 ML |
337 | unsigned tree_form: 1; |
338 | /* Next integer is shifted, so padding is needed. */ | |
339 | unsigned padding: 2; | |
340 | /* Bitmap UID used for memory allocation statistics. */ | |
341 | unsigned alloc_descriptor: 29; | |
d1e14d97 SB |
342 | /* In list form, the first element in the linked list; |
343 | in tree form, the root of the tree. */ | |
344 | bitmap_element *first; | |
345 | /* Last element looked at. */ | |
346 | bitmap_element * GTY((skip(""))) current; | |
347 | /* Obstack to allocate elements from. If NULL, then use GGC allocation. */ | |
7eeb6fc2 | 348 | bitmap_obstack * GTY((skip(""))) obstack; |
7664eeb7 ML |
349 | |
350 | /* Dump bitmap. */ | |
54994253 | 351 | void dump (); |
7664eeb7 ML |
352 | |
353 | /* Get bitmap descriptor UID casted to an unsigned integer pointer. | |
354 | Shift the descriptor because pointer_hash<Type>::hash is | |
355 | doing >> 3 shift operation. */ | |
356 | unsigned *get_descriptor () | |
357 | { | |
358 | return (unsigned *)(ptrdiff_t)(alloc_descriptor << 3); | |
359 | } | |
84562394 | 360 | }; |
7932a3db | 361 | |
096ab9ea | 362 | /* Global data */ |
ae0ed63a | 363 | extern bitmap_element bitmap_zero_bits; /* Zero bitmap element */ |
7932a3db | 364 | extern bitmap_obstack bitmap_default_obstack; /* Default bitmap obstack */ |
096ab9ea | 365 | |
d1e14d97 SB |
366 | /* Change the view of the bitmap to list, or tree. */ |
367 | void bitmap_list_view (bitmap); | |
368 | void bitmap_tree_view (bitmap); | |
369 | ||
096ab9ea | 370 | /* Clear a bitmap by freeing up the linked list. */ |
4682ae04 | 371 | extern void bitmap_clear (bitmap); |
096ab9ea | 372 | |
eebedaa5 | 373 | /* Copy a bitmap to another bitmap. */ |
e326eeb5 | 374 | extern void bitmap_copy (bitmap, const_bitmap); |
096ab9ea | 375 | |
43331dfb RB |
376 | /* Move a bitmap to another bitmap. */ |
377 | extern void bitmap_move (bitmap, bitmap); | |
378 | ||
8229306b | 379 | /* True if two bitmaps are identical. */ |
e326eeb5 | 380 | extern bool bitmap_equal_p (const_bitmap, const_bitmap); |
8229306b | 381 | |
55994078 | 382 | /* True if the bitmaps intersect (their AND is non-empty). */ |
e326eeb5 | 383 | extern bool bitmap_intersect_p (const_bitmap, const_bitmap); |
55994078 NS |
384 | |
385 | /* True if the complement of the second intersects the first (their | |
386 | AND_COMPL is non-empty). */ | |
e326eeb5 | 387 | extern bool bitmap_intersect_compl_p (const_bitmap, const_bitmap); |
55994078 NS |
388 | |
389 | /* True if MAP is an empty bitmap. */ | |
f61e445a LC |
390 | inline bool bitmap_empty_p (const_bitmap map) |
391 | { | |
392 | return !map->first; | |
393 | } | |
eb59b8de | 394 | |
76e910c6 RG |
395 | /* True if the bitmap has only a single bit set. */ |
396 | extern bool bitmap_single_bit_set_p (const_bitmap); | |
397 | ||
1bc40c7e | 398 | /* Count the number of bits set in the bitmap. */ |
e326eeb5 | 399 | extern unsigned long bitmap_count_bits (const_bitmap); |
1bc40c7e | 400 | |
478baf91 JL |
401 | /* Count the number of unique bits set across the two bitmaps. */ |
402 | extern unsigned long bitmap_count_unique_bits (const_bitmap, const_bitmap); | |
403 | ||
88c4f655 NS |
404 | /* Boolean operations on bitmaps. The _into variants are two operand |
405 | versions that modify the first source operand. The other variants | |
406 | are three operand versions that to not destroy the source bitmaps. | |
407 | The operations supported are &, & ~, |, ^. */ | |
e326eeb5 | 408 | extern void bitmap_and (bitmap, const_bitmap, const_bitmap); |
7b19209f | 409 | extern bool bitmap_and_into (bitmap, const_bitmap); |
e326eeb5 KG |
410 | extern bool bitmap_and_compl (bitmap, const_bitmap, const_bitmap); |
411 | extern bool bitmap_and_compl_into (bitmap, const_bitmap); | |
1bc40c7e | 412 | #define bitmap_compl_and(DST, A, B) bitmap_and_compl (DST, B, A) |
e326eeb5 | 413 | extern void bitmap_compl_and_into (bitmap, const_bitmap); |
1bc40c7e | 414 | extern void bitmap_clear_range (bitmap, unsigned int, unsigned int); |
6fb5fa3c | 415 | extern void bitmap_set_range (bitmap, unsigned int, unsigned int); |
e326eeb5 KG |
416 | extern bool bitmap_ior (bitmap, const_bitmap, const_bitmap); |
417 | extern bool bitmap_ior_into (bitmap, const_bitmap); | |
418 | extern void bitmap_xor (bitmap, const_bitmap, const_bitmap); | |
419 | extern void bitmap_xor_into (bitmap, const_bitmap); | |
88c4f655 | 420 | |
7ff23740 PB |
421 | /* DST = A | (B & C). Return true if DST changes. */ |
422 | extern bool bitmap_ior_and_into (bitmap DST, const_bitmap B, const_bitmap C); | |
88c4f655 | 423 | /* DST = A | (B & ~C). Return true if DST changes. */ |
0263463d SB |
424 | extern bool bitmap_ior_and_compl (bitmap DST, const_bitmap A, |
425 | const_bitmap B, const_bitmap C); | |
88c4f655 | 426 | /* A |= (B & ~C). Return true if A changes. */ |
0263463d SB |
427 | extern bool bitmap_ior_and_compl_into (bitmap A, |
428 | const_bitmap B, const_bitmap C); | |
096ab9ea | 429 | |
5f0d975b RG |
430 | /* Clear a single bit in a bitmap. Return true if the bit changed. */ |
431 | extern bool bitmap_clear_bit (bitmap, int); | |
096ab9ea | 432 | |
5f0d975b RG |
433 | /* Set a single bit in a bitmap. Return true if the bit changed. */ |
434 | extern bool bitmap_set_bit (bitmap, int); | |
096ab9ea | 435 | |
d1e14d97 | 436 | /* Return true if a bit is set in a bitmap. */ |
4682ae04 | 437 | extern int bitmap_bit_p (bitmap, int); |
096ab9ea | 438 | |
d1e14d97 | 439 | /* Debug functions to print a bitmap. */ |
e326eeb5 KG |
440 | extern void debug_bitmap (const_bitmap); |
441 | extern void debug_bitmap_file (FILE *, const_bitmap); | |
096ab9ea | 442 | |
f9da5064 | 443 | /* Print a bitmap. */ |
e326eeb5 | 444 | extern void bitmap_print (FILE *, const_bitmap, const char *, const char *); |
22fa5b8a | 445 | |
5765e552 | 446 | /* Initialize and release a bitmap obstack. */ |
7932a3db NS |
447 | extern void bitmap_obstack_initialize (bitmap_obstack *); |
448 | extern void bitmap_obstack_release (bitmap_obstack *); | |
f75709c6 JH |
449 | extern void bitmap_register (bitmap MEM_STAT_DECL); |
450 | extern void dump_bitmap_statistics (void); | |
096ab9ea | 451 | |
7932a3db NS |
452 | /* Initialize a bitmap header. OBSTACK indicates the bitmap obstack |
453 | to allocate from, NULL for GC'd bitmap. */ | |
454 | ||
455 | static inline void | |
2a1a5f30 | 456 | bitmap_initialize (bitmap head, bitmap_obstack *obstack CXX_MEM_STAT_INFO) |
7932a3db NS |
457 | { |
458 | head->first = head->current = NULL; | |
d1e14d97 | 459 | head->indx = head->tree_form = 0; |
7664eeb7 ML |
460 | head->padding = 0; |
461 | head->alloc_descriptor = 0; | |
7932a3db | 462 | head->obstack = obstack; |
7aa6d18a SB |
463 | if (GATHER_STATISTICS) |
464 | bitmap_register (head PASS_MEM_STAT); | |
7932a3db NS |
465 | } |
466 | ||
1c252ef3 RB |
467 | /* Release a bitmap (but not its head). This is suitable for pairing with |
468 | bitmap_initialize. */ | |
469 | ||
470 | static inline void | |
471 | bitmap_release (bitmap head) | |
472 | { | |
473 | bitmap_clear (head); | |
474 | /* Poison the obstack pointer so the obstack can be safely released. | |
475 | Do not zero it as the bitmap then becomes initialized GC. */ | |
476 | head->obstack = &bitmap_head::crashme; | |
477 | } | |
478 | ||
7932a3db | 479 | /* Allocate and free bitmaps from obstack, malloc and gc'd memory. */ |
3fe793df TS |
480 | extern bitmap bitmap_alloc (bitmap_obstack *obstack CXX_MEM_STAT_INFO); |
481 | #define BITMAP_ALLOC bitmap_alloc | |
482 | extern bitmap bitmap_gc_alloc (ALONE_CXX_MEM_STAT_INFO); | |
483 | #define BITMAP_GGC_ALLOC bitmap_gc_alloc | |
7932a3db | 484 | extern void bitmap_obstack_free (bitmap); |
096ab9ea | 485 | |
ea193996 | 486 | /* A few compatibility/functions macros for compatibility with sbitmaps */ |
f61e445a LC |
487 | inline void dump_bitmap (FILE *file, const_bitmap map) |
488 | { | |
489 | bitmap_print (file, map, "", "\n"); | |
490 | } | |
84562394 OE |
491 | extern void debug (const bitmap_head &ref); |
492 | extern void debug (const bitmap_head *ptr); | |
f61e445a | 493 | |
e326eeb5 | 494 | extern unsigned bitmap_first_set_bit (const_bitmap); |
12802c2b | 495 | extern unsigned bitmap_last_set_bit (const_bitmap); |
ea193996 | 496 | |
1af4bba8 | 497 | /* Compute bitmap hash (for purposes of hashing etc.) */ |
c3284718 | 498 | extern hashval_t bitmap_hash (const_bitmap); |
1af4bba8 | 499 | |
096ab9ea | 500 | /* Do any cleanup needed on a bitmap when it is no longer used. */ |
61ad0914 BE |
501 | #define BITMAP_FREE(BITMAP) \ |
502 | ((void) (bitmap_obstack_free ((bitmap) BITMAP), (BITMAP) = (bitmap) NULL)) | |
e7749837 | 503 | |
87c476a2 | 504 | /* Iterator for bitmaps. */ |
096ab9ea | 505 | |
84562394 | 506 | struct bitmap_iterator |
87c476a2 | 507 | { |
e90ea8cb NS |
508 | /* Pointer to the current bitmap element. */ |
509 | bitmap_element *elt1; | |
c22cacf3 | 510 | |
e90ea8cb NS |
511 | /* Pointer to 2nd bitmap element when two are involved. */ |
512 | bitmap_element *elt2; | |
513 | ||
514 | /* Word within the current element. */ | |
515 | unsigned word_no; | |
c22cacf3 | 516 | |
87c476a2 ZD |
517 | /* Contents of the actually processed word. When finding next bit |
518 | it is shifted right, so that the actual bit is always the least | |
519 | significant bit of ACTUAL. */ | |
e90ea8cb | 520 | BITMAP_WORD bits; |
84562394 | 521 | }; |
87c476a2 | 522 | |
e90ea8cb NS |
523 | /* Initialize a single bitmap iterator. START_BIT is the first bit to |
524 | iterate from. */ | |
87c476a2 | 525 | |
e90ea8cb | 526 | static inline void |
e326eeb5 | 527 | bmp_iter_set_init (bitmap_iterator *bi, const_bitmap map, |
e90ea8cb | 528 | unsigned start_bit, unsigned *bit_no) |
87c476a2 | 529 | { |
e90ea8cb NS |
530 | bi->elt1 = map->first; |
531 | bi->elt2 = NULL; | |
532 | ||
d1e14d97 SB |
533 | gcc_checking_assert (!map->tree_form); |
534 | ||
e90ea8cb NS |
535 | /* Advance elt1 until it is not before the block containing start_bit. */ |
536 | while (1) | |
87c476a2 | 537 | { |
e90ea8cb NS |
538 | if (!bi->elt1) |
539 | { | |
540 | bi->elt1 = &bitmap_zero_bits; | |
541 | break; | |
542 | } | |
c22cacf3 | 543 | |
e90ea8cb NS |
544 | if (bi->elt1->indx >= start_bit / BITMAP_ELEMENT_ALL_BITS) |
545 | break; | |
546 | bi->elt1 = bi->elt1->next; | |
87c476a2 ZD |
547 | } |
548 | ||
e90ea8cb NS |
549 | /* We might have gone past the start bit, so reinitialize it. */ |
550 | if (bi->elt1->indx != start_bit / BITMAP_ELEMENT_ALL_BITS) | |
551 | start_bit = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS; | |
c22cacf3 | 552 | |
e90ea8cb NS |
553 | /* Initialize for what is now start_bit. */ |
554 | bi->word_no = start_bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS; | |
555 | bi->bits = bi->elt1->bits[bi->word_no]; | |
556 | bi->bits >>= start_bit % BITMAP_WORD_BITS; | |
557 | ||
558 | /* If this word is zero, we must make sure we're not pointing at the | |
559 | first bit, otherwise our incrementing to the next word boundary | |
560 | will fail. It won't matter if this increment moves us into the | |
561 | next word. */ | |
562 | start_bit += !bi->bits; | |
c22cacf3 | 563 | |
e90ea8cb | 564 | *bit_no = start_bit; |
87c476a2 ZD |
565 | } |
566 | ||
e90ea8cb NS |
567 | /* Initialize an iterator to iterate over the intersection of two |
568 | bitmaps. START_BIT is the bit to commence from. */ | |
87c476a2 | 569 | |
e90ea8cb | 570 | static inline void |
e326eeb5 | 571 | bmp_iter_and_init (bitmap_iterator *bi, const_bitmap map1, const_bitmap map2, |
e90ea8cb | 572 | unsigned start_bit, unsigned *bit_no) |
87c476a2 | 573 | { |
e90ea8cb NS |
574 | bi->elt1 = map1->first; |
575 | bi->elt2 = map2->first; | |
87c476a2 | 576 | |
d1e14d97 SB |
577 | gcc_checking_assert (!map1->tree_form && !map2->tree_form); |
578 | ||
e90ea8cb NS |
579 | /* Advance elt1 until it is not before the block containing |
580 | start_bit. */ | |
87c476a2 ZD |
581 | while (1) |
582 | { | |
e90ea8cb | 583 | if (!bi->elt1) |
87c476a2 | 584 | { |
e90ea8cb NS |
585 | bi->elt2 = NULL; |
586 | break; | |
87c476a2 | 587 | } |
c22cacf3 | 588 | |
e90ea8cb NS |
589 | if (bi->elt1->indx >= start_bit / BITMAP_ELEMENT_ALL_BITS) |
590 | break; | |
591 | bi->elt1 = bi->elt1->next; | |
87c476a2 | 592 | } |
c22cacf3 | 593 | |
e90ea8cb NS |
594 | /* Advance elt2 until it is not before elt1. */ |
595 | while (1) | |
87c476a2 | 596 | { |
e90ea8cb NS |
597 | if (!bi->elt2) |
598 | { | |
599 | bi->elt1 = bi->elt2 = &bitmap_zero_bits; | |
600 | break; | |
601 | } | |
c22cacf3 | 602 | |
e90ea8cb NS |
603 | if (bi->elt2->indx >= bi->elt1->indx) |
604 | break; | |
605 | bi->elt2 = bi->elt2->next; | |
87c476a2 ZD |
606 | } |
607 | ||
e28d0cfb | 608 | /* If we're at the same index, then we have some intersecting bits. */ |
e90ea8cb | 609 | if (bi->elt1->indx == bi->elt2->indx) |
87c476a2 | 610 | { |
e90ea8cb | 611 | /* We might have advanced beyond the start_bit, so reinitialize |
c22cacf3 | 612 | for that. */ |
e90ea8cb NS |
613 | if (bi->elt1->indx != start_bit / BITMAP_ELEMENT_ALL_BITS) |
614 | start_bit = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS; | |
c22cacf3 | 615 | |
e90ea8cb NS |
616 | bi->word_no = start_bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS; |
617 | bi->bits = bi->elt1->bits[bi->word_no] & bi->elt2->bits[bi->word_no]; | |
618 | bi->bits >>= start_bit % BITMAP_WORD_BITS; | |
87c476a2 ZD |
619 | } |
620 | else | |
621 | { | |
e90ea8cb NS |
622 | /* Otherwise we must immediately advance elt1, so initialize for |
623 | that. */ | |
624 | bi->word_no = BITMAP_ELEMENT_WORDS - 1; | |
625 | bi->bits = 0; | |
87c476a2 | 626 | } |
c22cacf3 | 627 | |
e90ea8cb NS |
628 | /* If this word is zero, we must make sure we're not pointing at the |
629 | first bit, otherwise our incrementing to the next word boundary | |
630 | will fail. It won't matter if this increment moves us into the | |
631 | next word. */ | |
632 | start_bit += !bi->bits; | |
c22cacf3 | 633 | |
e90ea8cb | 634 | *bit_no = start_bit; |
87c476a2 ZD |
635 | } |
636 | ||
d1e14d97 | 637 | /* Initialize an iterator to iterate over the bits in MAP1 & ~MAP2. */ |
87c476a2 | 638 | |
e90ea8cb | 639 | static inline void |
0263463d SB |
640 | bmp_iter_and_compl_init (bitmap_iterator *bi, |
641 | const_bitmap map1, const_bitmap map2, | |
e90ea8cb | 642 | unsigned start_bit, unsigned *bit_no) |
87c476a2 | 643 | { |
e90ea8cb NS |
644 | bi->elt1 = map1->first; |
645 | bi->elt2 = map2->first; | |
87c476a2 | 646 | |
d1e14d97 SB |
647 | gcc_checking_assert (!map1->tree_form && !map2->tree_form); |
648 | ||
e90ea8cb | 649 | /* Advance elt1 until it is not before the block containing start_bit. */ |
87c476a2 ZD |
650 | while (1) |
651 | { | |
e90ea8cb | 652 | if (!bi->elt1) |
87c476a2 | 653 | { |
e90ea8cb NS |
654 | bi->elt1 = &bitmap_zero_bits; |
655 | break; | |
87c476a2 | 656 | } |
c22cacf3 | 657 | |
e90ea8cb NS |
658 | if (bi->elt1->indx >= start_bit / BITMAP_ELEMENT_ALL_BITS) |
659 | break; | |
660 | bi->elt1 = bi->elt1->next; | |
87c476a2 | 661 | } |
e90ea8cb NS |
662 | |
663 | /* Advance elt2 until it is not before elt1. */ | |
664 | while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) | |
665 | bi->elt2 = bi->elt2->next; | |
666 | ||
667 | /* We might have advanced beyond the start_bit, so reinitialize for | |
668 | that. */ | |
669 | if (bi->elt1->indx != start_bit / BITMAP_ELEMENT_ALL_BITS) | |
670 | start_bit = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS; | |
c22cacf3 | 671 | |
e90ea8cb NS |
672 | bi->word_no = start_bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS; |
673 | bi->bits = bi->elt1->bits[bi->word_no]; | |
674 | if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) | |
675 | bi->bits &= ~bi->elt2->bits[bi->word_no]; | |
676 | bi->bits >>= start_bit % BITMAP_WORD_BITS; | |
c22cacf3 | 677 | |
e90ea8cb NS |
678 | /* If this word is zero, we must make sure we're not pointing at the |
679 | first bit, otherwise our incrementing to the next word boundary | |
680 | will fail. It won't matter if this increment moves us into the | |
681 | next word. */ | |
682 | start_bit += !bi->bits; | |
c22cacf3 | 683 | |
e90ea8cb | 684 | *bit_no = start_bit; |
87c476a2 ZD |
685 | } |
686 | ||
e90ea8cb | 687 | /* Advance to the next bit in BI. We don't advance to the next |
d46aed51 | 688 | nonzero bit yet. */ |
87c476a2 | 689 | |
e90ea8cb NS |
690 | static inline void |
691 | bmp_iter_next (bitmap_iterator *bi, unsigned *bit_no) | |
87c476a2 | 692 | { |
e90ea8cb NS |
693 | bi->bits >>= 1; |
694 | *bit_no += 1; | |
695 | } | |
87c476a2 | 696 | |
d5568f03 JH |
697 | /* Advance to first set bit in BI. */ |
698 | ||
699 | static inline void | |
700 | bmp_iter_next_bit (bitmap_iterator * bi, unsigned *bit_no) | |
701 | { | |
702 | #if (GCC_VERSION >= 3004) | |
703 | { | |
704 | unsigned int n = __builtin_ctzl (bi->bits); | |
705 | gcc_assert (sizeof (unsigned long) == sizeof (BITMAP_WORD)); | |
706 | bi->bits >>= n; | |
707 | *bit_no += n; | |
708 | } | |
709 | #else | |
710 | while (!(bi->bits & 1)) | |
711 | { | |
712 | bi->bits >>= 1; | |
713 | *bit_no += 1; | |
714 | } | |
715 | #endif | |
716 | } | |
717 | ||
d46aed51 | 718 | /* Advance to the next nonzero bit of a single bitmap, we will have |
e90ea8cb NS |
719 | already advanced past the just iterated bit. Return true if there |
720 | is a bit to iterate. */ | |
87c476a2 | 721 | |
e90ea8cb NS |
722 | static inline bool |
723 | bmp_iter_set (bitmap_iterator *bi, unsigned *bit_no) | |
724 | { | |
d46aed51 | 725 | /* If our current word is nonzero, it contains the bit we want. */ |
e90ea8cb | 726 | if (bi->bits) |
87c476a2 | 727 | { |
e90ea8cb | 728 | next_bit: |
d5568f03 | 729 | bmp_iter_next_bit (bi, bit_no); |
e90ea8cb | 730 | return true; |
87c476a2 ZD |
731 | } |
732 | ||
e90ea8cb NS |
733 | /* Round up to the word boundary. We might have just iterated past |
734 | the end of the last word, hence the -1. It is not possible for | |
735 | bit_no to point at the beginning of the now last word. */ | |
736 | *bit_no = ((*bit_no + BITMAP_WORD_BITS - 1) | |
737 | / BITMAP_WORD_BITS * BITMAP_WORD_BITS); | |
738 | bi->word_no++; | |
87c476a2 | 739 | |
e90ea8cb | 740 | while (1) |
87c476a2 | 741 | { |
d46aed51 | 742 | /* Find the next nonzero word in this elt. */ |
e90ea8cb NS |
743 | while (bi->word_no != BITMAP_ELEMENT_WORDS) |
744 | { | |
745 | bi->bits = bi->elt1->bits[bi->word_no]; | |
746 | if (bi->bits) | |
747 | goto next_bit; | |
748 | *bit_no += BITMAP_WORD_BITS; | |
749 | bi->word_no++; | |
750 | } | |
c22cacf3 | 751 | |
a30fe4b6 RB |
752 | /* Make sure we didn't remove the element while iterating. */ |
753 | gcc_checking_assert (bi->elt1->indx != -1U); | |
754 | ||
e90ea8cb NS |
755 | /* Advance to the next element. */ |
756 | bi->elt1 = bi->elt1->next; | |
757 | if (!bi->elt1) | |
758 | return false; | |
759 | *bit_no = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS; | |
760 | bi->word_no = 0; | |
87c476a2 | 761 | } |
87c476a2 ZD |
762 | } |
763 | ||
d46aed51 KH |
764 | /* Advance to the next nonzero bit of an intersecting pair of |
765 | bitmaps. We will have already advanced past the just iterated bit. | |
e90ea8cb | 766 | Return true if there is a bit to iterate. */ |
87c476a2 | 767 | |
e90ea8cb NS |
768 | static inline bool |
769 | bmp_iter_and (bitmap_iterator *bi, unsigned *bit_no) | |
87c476a2 | 770 | { |
d46aed51 | 771 | /* If our current word is nonzero, it contains the bit we want. */ |
e90ea8cb NS |
772 | if (bi->bits) |
773 | { | |
774 | next_bit: | |
d5568f03 | 775 | bmp_iter_next_bit (bi, bit_no); |
e90ea8cb NS |
776 | return true; |
777 | } | |
87c476a2 | 778 | |
e90ea8cb NS |
779 | /* Round up to the word boundary. We might have just iterated past |
780 | the end of the last word, hence the -1. It is not possible for | |
781 | bit_no to point at the beginning of the now last word. */ | |
782 | *bit_no = ((*bit_no + BITMAP_WORD_BITS - 1) | |
783 | / BITMAP_WORD_BITS * BITMAP_WORD_BITS); | |
784 | bi->word_no++; | |
c22cacf3 | 785 | |
87c476a2 ZD |
786 | while (1) |
787 | { | |
d46aed51 | 788 | /* Find the next nonzero word in this elt. */ |
e90ea8cb | 789 | while (bi->word_no != BITMAP_ELEMENT_WORDS) |
87c476a2 | 790 | { |
e90ea8cb NS |
791 | bi->bits = bi->elt1->bits[bi->word_no] & bi->elt2->bits[bi->word_no]; |
792 | if (bi->bits) | |
793 | goto next_bit; | |
794 | *bit_no += BITMAP_WORD_BITS; | |
795 | bi->word_no++; | |
87c476a2 | 796 | } |
c22cacf3 | 797 | |
e90ea8cb | 798 | /* Advance to the next identical element. */ |
87c476a2 ZD |
799 | do |
800 | { | |
a30fe4b6 RB |
801 | /* Make sure we didn't remove the element while iterating. */ |
802 | gcc_checking_assert (bi->elt1->indx != -1U); | |
803 | ||
e90ea8cb NS |
804 | /* Advance elt1 while it is less than elt2. We always want |
805 | to advance one elt. */ | |
806 | do | |
87c476a2 | 807 | { |
e90ea8cb NS |
808 | bi->elt1 = bi->elt1->next; |
809 | if (!bi->elt1) | |
810 | return false; | |
811 | } | |
812 | while (bi->elt1->indx < bi->elt2->indx); | |
c22cacf3 | 813 | |
a30fe4b6 RB |
814 | /* Make sure we didn't remove the element while iterating. */ |
815 | gcc_checking_assert (bi->elt2->indx != -1U); | |
816 | ||
e90ea8cb NS |
817 | /* Advance elt2 to be no less than elt1. This might not |
818 | advance. */ | |
819 | while (bi->elt2->indx < bi->elt1->indx) | |
820 | { | |
821 | bi->elt2 = bi->elt2->next; | |
822 | if (!bi->elt2) | |
823 | return false; | |
87c476a2 ZD |
824 | } |
825 | } | |
e90ea8cb | 826 | while (bi->elt1->indx != bi->elt2->indx); |
c22cacf3 | 827 | |
e90ea8cb NS |
828 | *bit_no = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS; |
829 | bi->word_no = 0; | |
87c476a2 ZD |
830 | } |
831 | } | |
832 | ||
d46aed51 | 833 | /* Advance to the next nonzero bit in the intersection of |
e90ea8cb NS |
834 | complemented bitmaps. We will have already advanced past the just |
835 | iterated bit. */ | |
87c476a2 | 836 | |
e90ea8cb NS |
837 | static inline bool |
838 | bmp_iter_and_compl (bitmap_iterator *bi, unsigned *bit_no) | |
87c476a2 | 839 | { |
d46aed51 | 840 | /* If our current word is nonzero, it contains the bit we want. */ |
e90ea8cb | 841 | if (bi->bits) |
87c476a2 | 842 | { |
e90ea8cb | 843 | next_bit: |
d5568f03 | 844 | bmp_iter_next_bit (bi, bit_no); |
e90ea8cb | 845 | return true; |
87c476a2 ZD |
846 | } |
847 | ||
e90ea8cb NS |
848 | /* Round up to the word boundary. We might have just iterated past |
849 | the end of the last word, hence the -1. It is not possible for | |
850 | bit_no to point at the beginning of the now last word. */ | |
851 | *bit_no = ((*bit_no + BITMAP_WORD_BITS - 1) | |
852 | / BITMAP_WORD_BITS * BITMAP_WORD_BITS); | |
853 | bi->word_no++; | |
87c476a2 | 854 | |
e90ea8cb | 855 | while (1) |
87c476a2 | 856 | { |
d46aed51 | 857 | /* Find the next nonzero word in this elt. */ |
e90ea8cb NS |
858 | while (bi->word_no != BITMAP_ELEMENT_WORDS) |
859 | { | |
860 | bi->bits = bi->elt1->bits[bi->word_no]; | |
861 | if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) | |
862 | bi->bits &= ~bi->elt2->bits[bi->word_no]; | |
863 | if (bi->bits) | |
864 | goto next_bit; | |
865 | *bit_no += BITMAP_WORD_BITS; | |
866 | bi->word_no++; | |
867 | } | |
c22cacf3 | 868 | |
a30fe4b6 RB |
869 | /* Make sure we didn't remove the element while iterating. */ |
870 | gcc_checking_assert (bi->elt1->indx != -1U); | |
871 | ||
e90ea8cb NS |
872 | /* Advance to the next element of elt1. */ |
873 | bi->elt1 = bi->elt1->next; | |
874 | if (!bi->elt1) | |
875 | return false; | |
876 | ||
a30fe4b6 RB |
877 | /* Make sure we didn't remove the element while iterating. */ |
878 | gcc_checking_assert (! bi->elt2 || bi->elt2->indx != -1U); | |
879 | ||
e90ea8cb NS |
880 | /* Advance elt2 until it is no less than elt1. */ |
881 | while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) | |
882 | bi->elt2 = bi->elt2->next; | |
c22cacf3 | 883 | |
e90ea8cb NS |
884 | *bit_no = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS; |
885 | bi->word_no = 0; | |
87c476a2 | 886 | } |
87c476a2 ZD |
887 | } |
888 | ||
7a18d752 RB |
889 | /* If you are modifying a bitmap you are currently iterating over you |
890 | have to ensure to | |
891 | - never remove the current bit; | |
892 | - if you set or clear a bit before the current bit this operation | |
893 | will not affect the set of bits you are visiting during the iteration; | |
894 | - if you set or clear a bit after the current bit it is unspecified | |
895 | whether that affects the set of bits you are visiting during the | |
896 | iteration. | |
897 | If you want to remove the current bit you can delay this to the next | |
898 | iteration (and after the iteration in case the last iteration is | |
899 | affected). */ | |
900 | ||
e90ea8cb NS |
901 | /* Loop over all bits set in BITMAP, starting with MIN and setting |
902 | BITNUM to the bit number. ITER is a bitmap iterator. BITNUM | |
903 | should be treated as a read-only variable as it contains loop | |
904 | state. */ | |
87c476a2 | 905 | |
d4ac4ce2 LC |
906 | #ifndef EXECUTE_IF_SET_IN_BITMAP |
907 | /* See sbitmap.h for the other definition of EXECUTE_IF_SET_IN_BITMAP. */ | |
e90ea8cb NS |
908 | #define EXECUTE_IF_SET_IN_BITMAP(BITMAP, MIN, BITNUM, ITER) \ |
909 | for (bmp_iter_set_init (&(ITER), (BITMAP), (MIN), &(BITNUM)); \ | |
910 | bmp_iter_set (&(ITER), &(BITNUM)); \ | |
911 | bmp_iter_next (&(ITER), &(BITNUM))) | |
d4ac4ce2 | 912 | #endif |
e90ea8cb NS |
913 | |
914 | /* Loop over all the bits set in BITMAP1 & BITMAP2, starting with MIN | |
915 | and setting BITNUM to the bit number. ITER is a bitmap iterator. | |
916 | BITNUM should be treated as a read-only variable as it contains | |
917 | loop state. */ | |
918 | ||
919 | #define EXECUTE_IF_AND_IN_BITMAP(BITMAP1, BITMAP2, MIN, BITNUM, ITER) \ | |
c22cacf3 | 920 | for (bmp_iter_and_init (&(ITER), (BITMAP1), (BITMAP2), (MIN), \ |
e90ea8cb NS |
921 | &(BITNUM)); \ |
922 | bmp_iter_and (&(ITER), &(BITNUM)); \ | |
923 | bmp_iter_next (&(ITER), &(BITNUM))) | |
924 | ||
925 | /* Loop over all the bits set in BITMAP1 & ~BITMAP2, starting with MIN | |
926 | and setting BITNUM to the bit number. ITER is a bitmap iterator. | |
927 | BITNUM should be treated as a read-only variable as it contains | |
928 | loop state. */ | |
929 | ||
930 | #define EXECUTE_IF_AND_COMPL_IN_BITMAP(BITMAP1, BITMAP2, MIN, BITNUM, ITER) \ | |
931 | for (bmp_iter_and_compl_init (&(ITER), (BITMAP1), (BITMAP2), (MIN), \ | |
c22cacf3 | 932 | &(BITNUM)); \ |
e90ea8cb NS |
933 | bmp_iter_and_compl (&(ITER), &(BITNUM)); \ |
934 | bmp_iter_next (&(ITER), &(BITNUM))) | |
a05924f9 | 935 | |
8b670f93 AH |
936 | /* A class that ties the lifetime of a bitmap to its scope. */ |
937 | class auto_bitmap | |
938 | { | |
939 | public: | |
a4d51bfb | 940 | auto_bitmap () { bitmap_initialize (&m_bits, &bitmap_default_obstack); } |
4b5c84f4 | 941 | explicit auto_bitmap (bitmap_obstack *o) { bitmap_initialize (&m_bits, o); } |
a4d51bfb | 942 | ~auto_bitmap () { bitmap_clear (&m_bits); } |
8b670f93 | 943 | // Allow calling bitmap functions on our bitmap. |
a4d51bfb | 944 | operator bitmap () { return &m_bits; } |
8b670f93 AH |
945 | |
946 | private: | |
947 | // Prevent making a copy that references our bitmap. | |
948 | auto_bitmap (const auto_bitmap &); | |
949 | auto_bitmap &operator = (const auto_bitmap &); | |
950 | #if __cplusplus >= 201103L | |
951 | auto_bitmap (auto_bitmap &&); | |
952 | auto_bitmap &operator = (auto_bitmap &&); | |
953 | #endif | |
954 | ||
a4d51bfb | 955 | bitmap_head m_bits; |
8b670f93 AH |
956 | }; |
957 | ||
88657302 | 958 | #endif /* GCC_BITMAP_H */ |