1 /* Functions to support general ended bitmaps.
2 Copyright (C) 1997-2012 Free Software Foundation, Inc.
4 This file is part of GCC.
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
8 Software Foundation; either version 3, or (at your option) any later
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
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
23 /* Implementation of sparse integer sets as a linked list.
25 This sparse set representation is suitable for sparse sets with an
26 unknown (a priori) universe. The set is represented as a double-linked
27 list of container nodes (struct bitmap_element_def). Each node consists
28 of an index for the first member that could be held in the container,
29 a small array of integers that represent the members in the container,
30 and pointers to the next and previous element in the linked list. The
31 elements in the list are sorted in ascending order, i.e. the head of
32 the list holds the element with the smallest member of the set.
34 For a given member I in the set:
35 - the element for I will have index is I / (bits per element)
36 - the position for I within element is I % (bits per element)
38 This representation is very space-efficient for large sparse sets, and
39 the size of the set can be changed dynamically without much overhead.
40 An important parameter is the number of bits per element. In this
41 implementation, there are 128 bits per element. This results in a
42 high storage overhead *per element*, but a small overall overhead if
43 the set is very sparse.
45 The downside is that many operations are relatively slow because the
46 linked list has to be traversed to test membership (i.e. member_p/
47 add_member/remove_member). To improve the performance of this set
48 representation, the last accessed element and its index are cached.
49 For membership tests on members close to recently accessed members,
50 the cached last element improves membership test to a constant-time
53 The following operations can always be performed in O(1) time:
55 * clear : bitmap_clear
56 * choose_one : (not implemented, but could be
57 implemented in constant time)
59 The following operations can be performed in O(E) time worst-case (with
60 E the number of elements in the linked list), but in O(1) time with a
61 suitable access patterns:
63 * member_p : bitmap_bit_p
64 * add_member : bitmap_set_bit
65 * remove_member : bitmap_clear_bit
67 The following operations can be performed in O(E) time:
69 * cardinality : bitmap_count_bits
70 * set_size : bitmap_last_set_bit (but this could
71 in constant time with a pointer to
72 the last element in the chain)
74 Additionally, the linked-list sparse set representation supports
75 enumeration of the members in O(E) time:
77 * forall : EXECUTE_IF_SET_IN_BITMAP
78 * set_copy : bitmap_copy
79 * set_intersection : bitmap_intersect_p /
80 bitmap_and / bitmap_and_into /
81 EXECUTE_IF_AND_IN_BITMAP
82 * set_union : bitmap_ior / bitmap_ior_into
83 * set_difference : bitmap_intersect_compl_p /
84 bitmap_and_comp / bitmap_and_comp_into /
85 EXECUTE_IF_AND_COMPL_IN_BITMAP
86 * set_disjuction : bitmap_xor_comp / bitmap_xor_comp_into
87 * set_compare : bitmap_equal_p
89 Some operations on 3 sets that occur frequently in in data flow problems
92 * A | (B & C) : bitmap_ior_and_into
93 * A | (B & ~C) : bitmap_ior_and_compl /
94 bitmap_ior_and_compl_into
96 The storage requirements for linked-list sparse sets are O(E), with E->N
97 in the worst case (a sparse set with large distances between the values
100 The linked-list set representation works well for problems involving very
101 sparse sets. The canonical example in GCC is, of course, the "set of
102 sets" for some CFG-based data flow problems (liveness analysis, dominance
105 This representation also works well for data flow problems where the size
106 of the set may grow dynamically, but care must be taken that the member_p,
107 add_member, and remove_member operations occur with a suitable access
110 For random-access sets with a known, relatively small universe size, the
111 SparseSet or simple bitmap representations may be more efficient than a
112 linked-list set. For random-access sets of unknown universe, a hash table
113 or a balanced binary tree representation is likely to be a more suitable
116 Traversing linked lists is usually cache-unfriendly, even with the last
117 accessed element cached.
119 Cache performance can be improved by keeping the elements in the set
120 grouped together in memory, using a dedicated obstack for a set (or group
121 of related sets). Elements allocated on obstacks are released to a
122 free-list and taken off the free list. If multiple sets are allocated on
123 the same obstack, elements freed from one set may be re-used for one of
124 the other sets. This usually helps avoid cache misses.
126 A single free-list is used for all sets allocated in GGC space. This is
127 bad for persistent sets, so persistent sets should be allocated on an
128 obstack whenever possible. */
131 #include "statistics.h"
134 /* Fundamental storage type for bitmap. */
136 typedef unsigned long BITMAP_WORD
;
137 /* BITMAP_WORD_BITS needs to be unsigned, but cannot contain casts as
138 it is used in preprocessor directives -- hence the 1u. */
139 #define BITMAP_WORD_BITS (CHAR_BIT * SIZEOF_LONG * 1u)
141 /* Number of words to use for each element in the linked list. */
143 #ifndef BITMAP_ELEMENT_WORDS
144 #define BITMAP_ELEMENT_WORDS ((128 + BITMAP_WORD_BITS - 1) / BITMAP_WORD_BITS)
147 /* Number of bits in each actual element of a bitmap. */
149 #define BITMAP_ELEMENT_ALL_BITS (BITMAP_ELEMENT_WORDS * BITMAP_WORD_BITS)
151 /* Obstack for allocating bitmaps and elements from. */
152 typedef struct GTY (()) bitmap_obstack
{
153 struct bitmap_element_def
*elements
;
154 struct bitmap_head_def
*heads
;
155 struct obstack
GTY ((skip
)) obstack
;
158 /* Bitmap set element. We use a linked list to hold only the bits that
159 are set. This allows for use to grow the bitset dynamically without
160 having to realloc and copy a giant bit array.
162 The free list is implemented as a list of lists. There is one
163 outer list connected together by prev fields. Each element of that
164 outer is an inner list (that may consist only of the outer list
165 element) that are connected by the next fields. The prev pointer
166 is undefined for interior elements. This allows
167 bitmap_elt_clear_from to be implemented in unit time rather than
168 linear in the number of elements to be freed. */
170 typedef struct GTY((chain_next ("%h.next"), chain_prev ("%h.prev"))) bitmap_element_def
{
171 struct bitmap_element_def
*next
; /* Next element. */
172 struct bitmap_element_def
*prev
; /* Previous element. */
173 unsigned int indx
; /* regno/BITMAP_ELEMENT_ALL_BITS. */
174 BITMAP_WORD bits
[BITMAP_ELEMENT_WORDS
]; /* Bits that are set. */
177 struct bitmap_descriptor
;
178 /* Head of bitmap linked list. gengtype ignores ifdefs, but for
179 statistics we need to add a bitmap descriptor pointer. As it is
180 not collected, we can just GTY((skip(""))) it. Likewise current
181 points to something already pointed to by the chain started by first,
182 no need to walk it again. */
184 typedef struct GTY(()) bitmap_head_def
{
185 bitmap_element
*first
; /* First element in linked list. */
186 bitmap_element
* GTY((skip(""))) current
; /* Last element looked at. */
187 unsigned int indx
; /* Index of last element looked at. */
188 bitmap_obstack
*obstack
; /* Obstack to allocate elements from.
189 If NULL, then use GGC allocation. */
190 struct bitmap_descriptor
GTY((skip(""))) *desc
;
194 extern bitmap_element bitmap_zero_bits
; /* Zero bitmap element */
195 extern bitmap_obstack bitmap_default_obstack
; /* Default bitmap obstack */
197 /* Clear a bitmap by freeing up the linked list. */
198 extern void bitmap_clear (bitmap
);
200 /* Copy a bitmap to another bitmap. */
201 extern void bitmap_copy (bitmap
, const_bitmap
);
203 /* True if two bitmaps are identical. */
204 extern bool bitmap_equal_p (const_bitmap
, const_bitmap
);
206 /* True if the bitmaps intersect (their AND is non-empty). */
207 extern bool bitmap_intersect_p (const_bitmap
, const_bitmap
);
209 /* True if the complement of the second intersects the first (their
210 AND_COMPL is non-empty). */
211 extern bool bitmap_intersect_compl_p (const_bitmap
, const_bitmap
);
213 /* True if MAP is an empty bitmap. */
214 inline bool bitmap_empty_p (const_bitmap map
)
219 /* True if the bitmap has only a single bit set. */
220 extern bool bitmap_single_bit_set_p (const_bitmap
);
222 /* Count the number of bits set in the bitmap. */
223 extern unsigned long bitmap_count_bits (const_bitmap
);
225 /* Boolean operations on bitmaps. The _into variants are two operand
226 versions that modify the first source operand. The other variants
227 are three operand versions that to not destroy the source bitmaps.
228 The operations supported are &, & ~, |, ^. */
229 extern void bitmap_and (bitmap
, const_bitmap
, const_bitmap
);
230 extern bool bitmap_and_into (bitmap
, const_bitmap
);
231 extern bool bitmap_and_compl (bitmap
, const_bitmap
, const_bitmap
);
232 extern bool bitmap_and_compl_into (bitmap
, const_bitmap
);
233 #define bitmap_compl_and(DST, A, B) bitmap_and_compl (DST, B, A)
234 extern void bitmap_compl_and_into (bitmap
, const_bitmap
);
235 extern void bitmap_clear_range (bitmap
, unsigned int, unsigned int);
236 extern void bitmap_set_range (bitmap
, unsigned int, unsigned int);
237 extern bool bitmap_ior (bitmap
, const_bitmap
, const_bitmap
);
238 extern bool bitmap_ior_into (bitmap
, const_bitmap
);
239 extern void bitmap_xor (bitmap
, const_bitmap
, const_bitmap
);
240 extern void bitmap_xor_into (bitmap
, const_bitmap
);
242 /* DST = A | (B & C). Return true if DST changes. */
243 extern bool bitmap_ior_and_into (bitmap DST
, const_bitmap B
, const_bitmap C
);
244 /* DST = A | (B & ~C). Return true if DST changes. */
245 extern bool bitmap_ior_and_compl (bitmap DST
, const_bitmap A
,
246 const_bitmap B
, const_bitmap C
);
247 /* A |= (B & ~C). Return true if A changes. */
248 extern bool bitmap_ior_and_compl_into (bitmap A
,
249 const_bitmap B
, const_bitmap C
);
251 /* Clear a single bit in a bitmap. Return true if the bit changed. */
252 extern bool bitmap_clear_bit (bitmap
, int);
254 /* Set a single bit in a bitmap. Return true if the bit changed. */
255 extern bool bitmap_set_bit (bitmap
, int);
257 /* Return true if a register is set in a register set. */
258 extern int bitmap_bit_p (bitmap
, int);
260 /* Debug functions to print a bitmap linked list. */
261 extern void debug_bitmap (const_bitmap
);
262 extern void debug_bitmap_file (FILE *, const_bitmap
);
264 /* Print a bitmap. */
265 extern void bitmap_print (FILE *, const_bitmap
, const char *, const char *);
267 /* Initialize and release a bitmap obstack. */
268 extern void bitmap_obstack_initialize (bitmap_obstack
*);
269 extern void bitmap_obstack_release (bitmap_obstack
*);
270 extern void bitmap_register (bitmap MEM_STAT_DECL
);
271 extern void dump_bitmap_statistics (void);
273 /* Initialize a bitmap header. OBSTACK indicates the bitmap obstack
274 to allocate from, NULL for GC'd bitmap. */
277 bitmap_initialize_stat (bitmap head
, bitmap_obstack
*obstack MEM_STAT_DECL
)
279 head
->first
= head
->current
= NULL
;
280 head
->obstack
= obstack
;
281 if (GATHER_STATISTICS
)
282 bitmap_register (head PASS_MEM_STAT
);
284 #define bitmap_initialize(h,o) bitmap_initialize_stat (h,o MEM_STAT_INFO)
286 /* Allocate and free bitmaps from obstack, malloc and gc'd memory. */
287 extern bitmap
bitmap_obstack_alloc_stat (bitmap_obstack
*obstack MEM_STAT_DECL
);
288 #define bitmap_obstack_alloc(t) bitmap_obstack_alloc_stat (t MEM_STAT_INFO)
289 extern bitmap
bitmap_gc_alloc_stat (ALONE_MEM_STAT_DECL
);
290 #define bitmap_gc_alloc() bitmap_gc_alloc_stat (ALONE_MEM_STAT_INFO)
291 extern void bitmap_obstack_free (bitmap
);
293 /* A few compatibility/functions macros for compatibility with sbitmaps */
294 inline void dump_bitmap (FILE *file
, const_bitmap map
)
296 bitmap_print (file
, map
, "", "\n");
299 extern unsigned bitmap_first_set_bit (const_bitmap
);
300 extern unsigned bitmap_last_set_bit (const_bitmap
);
302 /* Compute bitmap hash (for purposes of hashing etc.) */
303 extern hashval_t
bitmap_hash(const_bitmap
);
305 /* Allocate a bitmap from a bit obstack. */
306 #define BITMAP_ALLOC(OBSTACK) bitmap_obstack_alloc (OBSTACK)
308 /* Allocate a gc'd bitmap. */
309 #define BITMAP_GGC_ALLOC() bitmap_gc_alloc ()
311 /* Do any cleanup needed on a bitmap when it is no longer used. */
312 #define BITMAP_FREE(BITMAP) \
313 ((void) (bitmap_obstack_free ((bitmap) BITMAP), (BITMAP) = (bitmap) NULL))
315 /* Iterator for bitmaps. */
319 /* Pointer to the current bitmap element. */
320 bitmap_element
*elt1
;
322 /* Pointer to 2nd bitmap element when two are involved. */
323 bitmap_element
*elt2
;
325 /* Word within the current element. */
328 /* Contents of the actually processed word. When finding next bit
329 it is shifted right, so that the actual bit is always the least
330 significant bit of ACTUAL. */
334 /* Initialize a single bitmap iterator. START_BIT is the first bit to
338 bmp_iter_set_init (bitmap_iterator
*bi
, const_bitmap map
,
339 unsigned start_bit
, unsigned *bit_no
)
341 bi
->elt1
= map
->first
;
344 /* Advance elt1 until it is not before the block containing start_bit. */
349 bi
->elt1
= &bitmap_zero_bits
;
353 if (bi
->elt1
->indx
>= start_bit
/ BITMAP_ELEMENT_ALL_BITS
)
355 bi
->elt1
= bi
->elt1
->next
;
358 /* We might have gone past the start bit, so reinitialize it. */
359 if (bi
->elt1
->indx
!= start_bit
/ BITMAP_ELEMENT_ALL_BITS
)
360 start_bit
= bi
->elt1
->indx
* BITMAP_ELEMENT_ALL_BITS
;
362 /* Initialize for what is now start_bit. */
363 bi
->word_no
= start_bit
/ BITMAP_WORD_BITS
% BITMAP_ELEMENT_WORDS
;
364 bi
->bits
= bi
->elt1
->bits
[bi
->word_no
];
365 bi
->bits
>>= start_bit
% BITMAP_WORD_BITS
;
367 /* If this word is zero, we must make sure we're not pointing at the
368 first bit, otherwise our incrementing to the next word boundary
369 will fail. It won't matter if this increment moves us into the
371 start_bit
+= !bi
->bits
;
376 /* Initialize an iterator to iterate over the intersection of two
377 bitmaps. START_BIT is the bit to commence from. */
380 bmp_iter_and_init (bitmap_iterator
*bi
, const_bitmap map1
, const_bitmap map2
,
381 unsigned start_bit
, unsigned *bit_no
)
383 bi
->elt1
= map1
->first
;
384 bi
->elt2
= map2
->first
;
386 /* Advance elt1 until it is not before the block containing
396 if (bi
->elt1
->indx
>= start_bit
/ BITMAP_ELEMENT_ALL_BITS
)
398 bi
->elt1
= bi
->elt1
->next
;
401 /* Advance elt2 until it is not before elt1. */
406 bi
->elt1
= bi
->elt2
= &bitmap_zero_bits
;
410 if (bi
->elt2
->indx
>= bi
->elt1
->indx
)
412 bi
->elt2
= bi
->elt2
->next
;
415 /* If we're at the same index, then we have some intersecting bits. */
416 if (bi
->elt1
->indx
== bi
->elt2
->indx
)
418 /* We might have advanced beyond the start_bit, so reinitialize
420 if (bi
->elt1
->indx
!= start_bit
/ BITMAP_ELEMENT_ALL_BITS
)
421 start_bit
= bi
->elt1
->indx
* BITMAP_ELEMENT_ALL_BITS
;
423 bi
->word_no
= start_bit
/ BITMAP_WORD_BITS
% BITMAP_ELEMENT_WORDS
;
424 bi
->bits
= bi
->elt1
->bits
[bi
->word_no
] & bi
->elt2
->bits
[bi
->word_no
];
425 bi
->bits
>>= start_bit
% BITMAP_WORD_BITS
;
429 /* Otherwise we must immediately advance elt1, so initialize for
431 bi
->word_no
= BITMAP_ELEMENT_WORDS
- 1;
435 /* If this word is zero, we must make sure we're not pointing at the
436 first bit, otherwise our incrementing to the next word boundary
437 will fail. It won't matter if this increment moves us into the
439 start_bit
+= !bi
->bits
;
444 /* Initialize an iterator to iterate over the bits in MAP1 & ~MAP2.
448 bmp_iter_and_compl_init (bitmap_iterator
*bi
,
449 const_bitmap map1
, const_bitmap map2
,
450 unsigned start_bit
, unsigned *bit_no
)
452 bi
->elt1
= map1
->first
;
453 bi
->elt2
= map2
->first
;
455 /* Advance elt1 until it is not before the block containing start_bit. */
460 bi
->elt1
= &bitmap_zero_bits
;
464 if (bi
->elt1
->indx
>= start_bit
/ BITMAP_ELEMENT_ALL_BITS
)
466 bi
->elt1
= bi
->elt1
->next
;
469 /* Advance elt2 until it is not before elt1. */
470 while (bi
->elt2
&& bi
->elt2
->indx
< bi
->elt1
->indx
)
471 bi
->elt2
= bi
->elt2
->next
;
473 /* We might have advanced beyond the start_bit, so reinitialize for
475 if (bi
->elt1
->indx
!= start_bit
/ BITMAP_ELEMENT_ALL_BITS
)
476 start_bit
= bi
->elt1
->indx
* BITMAP_ELEMENT_ALL_BITS
;
478 bi
->word_no
= start_bit
/ BITMAP_WORD_BITS
% BITMAP_ELEMENT_WORDS
;
479 bi
->bits
= bi
->elt1
->bits
[bi
->word_no
];
480 if (bi
->elt2
&& bi
->elt1
->indx
== bi
->elt2
->indx
)
481 bi
->bits
&= ~bi
->elt2
->bits
[bi
->word_no
];
482 bi
->bits
>>= start_bit
% BITMAP_WORD_BITS
;
484 /* If this word is zero, we must make sure we're not pointing at the
485 first bit, otherwise our incrementing to the next word boundary
486 will fail. It won't matter if this increment moves us into the
488 start_bit
+= !bi
->bits
;
493 /* Advance to the next bit in BI. We don't advance to the next
497 bmp_iter_next (bitmap_iterator
*bi
, unsigned *bit_no
)
503 /* Advance to first set bit in BI. */
506 bmp_iter_next_bit (bitmap_iterator
* bi
, unsigned *bit_no
)
508 #if (GCC_VERSION >= 3004)
510 unsigned int n
= __builtin_ctzl (bi
->bits
);
511 gcc_assert (sizeof (unsigned long) == sizeof (BITMAP_WORD
));
516 while (!(bi
->bits
& 1))
524 /* Advance to the next nonzero bit of a single bitmap, we will have
525 already advanced past the just iterated bit. Return true if there
526 is a bit to iterate. */
529 bmp_iter_set (bitmap_iterator
*bi
, unsigned *bit_no
)
531 /* If our current word is nonzero, it contains the bit we want. */
535 bmp_iter_next_bit (bi
, bit_no
);
539 /* Round up to the word boundary. We might have just iterated past
540 the end of the last word, hence the -1. It is not possible for
541 bit_no to point at the beginning of the now last word. */
542 *bit_no
= ((*bit_no
+ BITMAP_WORD_BITS
- 1)
543 / BITMAP_WORD_BITS
* BITMAP_WORD_BITS
);
548 /* Find the next nonzero word in this elt. */
549 while (bi
->word_no
!= BITMAP_ELEMENT_WORDS
)
551 bi
->bits
= bi
->elt1
->bits
[bi
->word_no
];
554 *bit_no
+= BITMAP_WORD_BITS
;
558 /* Advance to the next element. */
559 bi
->elt1
= bi
->elt1
->next
;
562 *bit_no
= bi
->elt1
->indx
* BITMAP_ELEMENT_ALL_BITS
;
567 /* Advance to the next nonzero bit of an intersecting pair of
568 bitmaps. We will have already advanced past the just iterated bit.
569 Return true if there is a bit to iterate. */
572 bmp_iter_and (bitmap_iterator
*bi
, unsigned *bit_no
)
574 /* If our current word is nonzero, it contains the bit we want. */
578 bmp_iter_next_bit (bi
, bit_no
);
582 /* Round up to the word boundary. We might have just iterated past
583 the end of the last word, hence the -1. It is not possible for
584 bit_no to point at the beginning of the now last word. */
585 *bit_no
= ((*bit_no
+ BITMAP_WORD_BITS
- 1)
586 / BITMAP_WORD_BITS
* BITMAP_WORD_BITS
);
591 /* Find the next nonzero word in this elt. */
592 while (bi
->word_no
!= BITMAP_ELEMENT_WORDS
)
594 bi
->bits
= bi
->elt1
->bits
[bi
->word_no
] & bi
->elt2
->bits
[bi
->word_no
];
597 *bit_no
+= BITMAP_WORD_BITS
;
601 /* Advance to the next identical element. */
604 /* Advance elt1 while it is less than elt2. We always want
605 to advance one elt. */
608 bi
->elt1
= bi
->elt1
->next
;
612 while (bi
->elt1
->indx
< bi
->elt2
->indx
);
614 /* Advance elt2 to be no less than elt1. This might not
616 while (bi
->elt2
->indx
< bi
->elt1
->indx
)
618 bi
->elt2
= bi
->elt2
->next
;
623 while (bi
->elt1
->indx
!= bi
->elt2
->indx
);
625 *bit_no
= bi
->elt1
->indx
* BITMAP_ELEMENT_ALL_BITS
;
630 /* Advance to the next nonzero bit in the intersection of
631 complemented bitmaps. We will have already advanced past the just
635 bmp_iter_and_compl (bitmap_iterator
*bi
, unsigned *bit_no
)
637 /* If our current word is nonzero, it contains the bit we want. */
641 bmp_iter_next_bit (bi
, bit_no
);
645 /* Round up to the word boundary. We might have just iterated past
646 the end of the last word, hence the -1. It is not possible for
647 bit_no to point at the beginning of the now last word. */
648 *bit_no
= ((*bit_no
+ BITMAP_WORD_BITS
- 1)
649 / BITMAP_WORD_BITS
* BITMAP_WORD_BITS
);
654 /* Find the next nonzero word in this elt. */
655 while (bi
->word_no
!= BITMAP_ELEMENT_WORDS
)
657 bi
->bits
= bi
->elt1
->bits
[bi
->word_no
];
658 if (bi
->elt2
&& bi
->elt2
->indx
== bi
->elt1
->indx
)
659 bi
->bits
&= ~bi
->elt2
->bits
[bi
->word_no
];
662 *bit_no
+= BITMAP_WORD_BITS
;
666 /* Advance to the next element of elt1. */
667 bi
->elt1
= bi
->elt1
->next
;
671 /* Advance elt2 until it is no less than elt1. */
672 while (bi
->elt2
&& bi
->elt2
->indx
< bi
->elt1
->indx
)
673 bi
->elt2
= bi
->elt2
->next
;
675 *bit_no
= bi
->elt1
->indx
* BITMAP_ELEMENT_ALL_BITS
;
680 /* Loop over all bits set in BITMAP, starting with MIN and setting
681 BITNUM to the bit number. ITER is a bitmap iterator. BITNUM
682 should be treated as a read-only variable as it contains loop
685 #define EXECUTE_IF_SET_IN_BITMAP(BITMAP, MIN, BITNUM, ITER) \
686 for (bmp_iter_set_init (&(ITER), (BITMAP), (MIN), &(BITNUM)); \
687 bmp_iter_set (&(ITER), &(BITNUM)); \
688 bmp_iter_next (&(ITER), &(BITNUM)))
690 /* Loop over all the bits set in BITMAP1 & BITMAP2, starting with MIN
691 and setting BITNUM to the bit number. ITER is a bitmap iterator.
692 BITNUM should be treated as a read-only variable as it contains
695 #define EXECUTE_IF_AND_IN_BITMAP(BITMAP1, BITMAP2, MIN, BITNUM, ITER) \
696 for (bmp_iter_and_init (&(ITER), (BITMAP1), (BITMAP2), (MIN), \
698 bmp_iter_and (&(ITER), &(BITNUM)); \
699 bmp_iter_next (&(ITER), &(BITNUM)))
701 /* Loop over all the bits set in BITMAP1 & ~BITMAP2, starting with MIN
702 and setting BITNUM to the bit number. ITER is a bitmap iterator.
703 BITNUM should be treated as a read-only variable as it contains
706 #define EXECUTE_IF_AND_COMPL_IN_BITMAP(BITMAP1, BITMAP2, MIN, BITNUM, ITER) \
707 for (bmp_iter_and_compl_init (&(ITER), (BITMAP1), (BITMAP2), (MIN), \
709 bmp_iter_and_compl (&(ITER), &(BITNUM)); \
710 bmp_iter_next (&(ITER), &(BITNUM)))
712 #endif /* GCC_BITMAP_H */