1 /* Functions to support general ended bitmaps.
2 Copyright (C) 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005
3 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
33 bitmap_element bitmap_zero_bits; /* An element of all zero bits. */
34 bitmap_obstack bitmap_default_obstack; /* The default bitmap obstack. */
35 static GTY((deletable)) bitmap_element *bitmap_ggc_free; /* Freelist of
38 static void bitmap_elem_to_freelist (bitmap, bitmap_element *);
39 static void bitmap_element_free (bitmap, bitmap_element *);
40 static bitmap_element *bitmap_element_allocate (bitmap);
41 static int bitmap_element_zerop (bitmap_element *);
42 static void bitmap_element_link (bitmap, bitmap_element *);
43 static bitmap_element *bitmap_elt_insert_after (bitmap, bitmap_element *);
44 static void bitmap_elt_clear_from (bitmap, bitmap_element *);
45 static bitmap_element *bitmap_find_bit (bitmap, unsigned int);
48 /* Add ELEM to the appropriate freelist. */
50 bitmap_elem_to_freelist (bitmap head, bitmap_element *elt)
52 bitmap_obstack *bit_obstack = head->obstack;
56 elt->next = bit_obstack->elements;
57 bit_obstack->elements = elt;
61 elt->next = bitmap_ggc_free;
62 bitmap_ggc_free = elt;
66 /* Free a bitmap element. Since these are allocated off the
67 bitmap_obstack, "free" actually means "put onto the freelist". */
70 bitmap_element_free (bitmap head, bitmap_element *elt)
72 bitmap_element *next = elt->next;
73 bitmap_element *prev = elt->prev;
81 if (head->first == elt)
84 /* Since the first thing we try is to insert before current,
85 make current the next entry in preference to the previous. */
86 if (head->current == elt)
88 head->current = next != 0 ? next : prev;
90 head->indx = head->current->indx;
92 bitmap_elem_to_freelist (head, elt);
95 /* Allocate a bitmap element. The bits are cleared, but nothing else is. */
97 static inline bitmap_element *
98 bitmap_element_allocate (bitmap head)
100 bitmap_element *element;
101 bitmap_obstack *bit_obstack = head->obstack;
105 element = bit_obstack->elements;
108 bit_obstack->elements = element->next;
110 element = XOBNEW (&bit_obstack->obstack, bitmap_element);
114 element = bitmap_ggc_free;
116 bitmap_ggc_free = element->next;
118 element = GGC_NEW (bitmap_element);
121 memset (element->bits, 0, sizeof (element->bits));
126 /* Remove ELT and all following elements from bitmap HEAD. */
129 bitmap_elt_clear_from (bitmap head, bitmap_element *elt)
131 bitmap_element *next;
136 bitmap_element_free (head, elt);
141 /* Clear a bitmap by freeing the linked list. */
144 bitmap_clear (bitmap head)
146 bitmap_element *element, *next;
148 for (element = head->first; element != 0; element = next)
150 next = element->next;
151 bitmap_elem_to_freelist (head, element);
154 head->first = head->current = 0;
157 /* Initialize a bitmap obstack. If BIT_OBSTACK is NULL, initialize
158 the default bitmap obstack. */
161 bitmap_obstack_initialize (bitmap_obstack *bit_obstack)
164 bit_obstack = &bitmap_default_obstack;
166 #if !defined(__GNUC__) || (__GNUC__ < 2)
167 #define __alignof__(type) 0
170 bit_obstack->elements = NULL;
171 bit_obstack->heads = NULL;
172 obstack_specify_allocation (&bit_obstack->obstack, OBSTACK_CHUNK_SIZE,
173 __alignof__ (bitmap_element),
178 /* Release the memory from a bitmap obstack. If BIT_OBSTACK is NULL,
179 release the default bitmap obstack. */
182 bitmap_obstack_release (bitmap_obstack *bit_obstack)
185 bit_obstack = &bitmap_default_obstack;
187 bit_obstack->elements = NULL;
188 bit_obstack->heads = NULL;
189 obstack_free (&bit_obstack->obstack, NULL);
192 /* Create a new bitmap on an obstack. If BIT_OBSTACK is NULL, create
193 it on the default bitmap obstack. */
196 bitmap_obstack_alloc (bitmap_obstack *bit_obstack)
201 bit_obstack = &bitmap_default_obstack;
202 map = bit_obstack->heads;
204 bit_obstack->heads = (void *)map->first;
206 map = XOBNEW (&bit_obstack->obstack, bitmap_head);
207 bitmap_initialize (map, bit_obstack);
212 /* Create a new GCd bitmap. */
215 bitmap_gc_alloc (void)
219 map = GGC_NEW (struct bitmap_head_def);
220 bitmap_initialize (map, NULL);
225 /* Release an obstack allocated bitmap. */
228 bitmap_obstack_free (bitmap map)
233 map->first = (void *)map->obstack->heads;
234 map->obstack->heads = map;
239 /* Return nonzero if all bits in an element are zero. */
242 bitmap_element_zerop (bitmap_element *element)
244 #if BITMAP_ELEMENT_WORDS == 2
245 return (element->bits[0] | element->bits[1]) == 0;
249 for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
250 if (element->bits[i] != 0)
257 /* Link the bitmap element into the current bitmap linked list. */
260 bitmap_element_link (bitmap head, bitmap_element *element)
262 unsigned int indx = element->indx;
265 /* If this is the first and only element, set it in. */
266 if (head->first == 0)
268 element->next = element->prev = 0;
269 head->first = element;
272 /* If this index is less than that of the current element, it goes someplace
273 before the current element. */
274 else if (indx < head->indx)
276 for (ptr = head->current;
277 ptr->prev != 0 && ptr->prev->indx > indx;
282 ptr->prev->next = element;
284 head->first = element;
286 element->prev = ptr->prev;
291 /* Otherwise, it must go someplace after the current element. */
294 for (ptr = head->current;
295 ptr->next != 0 && ptr->next->indx < indx;
300 ptr->next->prev = element;
302 element->next = ptr->next;
307 /* Set up so this is the first element searched. */
308 head->current = element;
312 /* Insert a new uninitialized element into bitmap HEAD after element
313 ELT. If ELT is NULL, insert the element at the start. Return the
316 static bitmap_element *
317 bitmap_elt_insert_after (bitmap head, bitmap_element *elt)
319 bitmap_element *node = bitmap_element_allocate (head);
324 head->current = node;
325 node->next = head->first;
327 node->next->prev = node;
333 gcc_assert (head->current);
334 node->next = elt->next;
336 node->next->prev = node;
343 /* Copy a bitmap to another bitmap. */
346 bitmap_copy (bitmap to, bitmap from)
348 bitmap_element *from_ptr, *to_ptr = 0;
349 #if BITMAP_ELEMENT_WORDS != 2
355 /* Copy elements in forward direction one at a time. */
356 for (from_ptr = from->first; from_ptr; from_ptr = from_ptr->next)
358 bitmap_element *to_elt = bitmap_element_allocate (to);
360 to_elt->indx = from_ptr->indx;
362 #if BITMAP_ELEMENT_WORDS == 2
363 to_elt->bits[0] = from_ptr->bits[0];
364 to_elt->bits[1] = from_ptr->bits[1];
366 for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
367 to_elt->bits[i] = from_ptr->bits[i];
370 /* Here we have a special case of bitmap_element_link, for the case
371 where we know the links are being entered in sequence. */
374 to->first = to->current = to_elt;
375 to->indx = from_ptr->indx;
376 to_elt->next = to_elt->prev = 0;
380 to_elt->prev = to_ptr;
382 to_ptr->next = to_elt;
389 /* Find a bitmap element that would hold a bitmap's bit.
390 Update the `current' field even if we can't find an element that
391 would hold the bitmap's bit to make eventual allocation
394 static inline bitmap_element *
395 bitmap_find_bit (bitmap head, unsigned int bit)
397 bitmap_element *element;
398 unsigned int indx = bit / BITMAP_ELEMENT_ALL_BITS;
400 if (head->current == 0
401 || head->indx == indx)
402 return head->current;
404 if (head->indx < indx)
405 /* INDX is beyond head->indx. Search from head->current
407 for (element = head->current;
408 element->next != 0 && element->indx < indx;
409 element = element->next)
412 else if (head->indx / 2 < indx)
413 /* INDX is less than head->indx and closer to head->indx than to
414 0. Search from head->current backward. */
415 for (element = head->current;
416 element->prev != 0 && element->indx > indx;
417 element = element->prev)
421 /* INDX is less than head->indx and closer to 0 than to
422 head->indx. Search from head->first forward. */
423 for (element = head->first;
424 element->next != 0 && element->indx < indx;
425 element = element->next)
428 /* `element' is the nearest to the one we want. If it's not the one we
429 want, the one we want doesn't exist. */
430 head->current = element;
431 head->indx = element->indx;
432 if (element != 0 && element->indx != indx)
438 /* Clear a single bit in a bitmap. */
441 bitmap_clear_bit (bitmap head, int bit)
443 bitmap_element *ptr = bitmap_find_bit (head, bit);
447 unsigned bit_num = bit % BITMAP_WORD_BITS;
448 unsigned word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
449 ptr->bits[word_num] &= ~ (((BITMAP_WORD) 1) << bit_num);
451 /* If we cleared the entire word, free up the element. */
452 if (bitmap_element_zerop (ptr))
453 bitmap_element_free (head, ptr);
457 /* Set a single bit in a bitmap. */
460 bitmap_set_bit (bitmap head, int bit)
462 bitmap_element *ptr = bitmap_find_bit (head, bit);
463 unsigned word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
464 unsigned bit_num = bit % BITMAP_WORD_BITS;
465 BITMAP_WORD bit_val = ((BITMAP_WORD) 1) << bit_num;
469 ptr = bitmap_element_allocate (head);
470 ptr->indx = bit / BITMAP_ELEMENT_ALL_BITS;
471 ptr->bits[word_num] = bit_val;
472 bitmap_element_link (head, ptr);
475 ptr->bits[word_num] |= bit_val;
478 /* Return whether a bit is set within a bitmap. */
481 bitmap_bit_p (bitmap head, int bit)
487 ptr = bitmap_find_bit (head, bit);
491 bit_num = bit % BITMAP_WORD_BITS;
492 word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
494 return (ptr->bits[word_num] >> bit_num) & 1;
497 /* Return the bit number of the first set bit in the bitmap. The
498 bitmap must be non-empty. */
501 bitmap_first_set_bit (bitmap a)
503 bitmap_element *elt = a->first;
509 bit_no = elt->indx * BITMAP_ELEMENT_ALL_BITS;
510 for (ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++)
512 word = elt->bits[ix];
518 bit_no += ix * BITMAP_WORD_BITS;
520 #if GCC_VERSION >= 3004
521 gcc_assert (sizeof(long) == sizeof (word));
522 bit_no += __builtin_ctzl (word);
524 /* Binary search for the first set bit. */
525 #if BITMAP_WORD_BITS > 64
526 #error "Fill out the table."
528 #if BITMAP_WORD_BITS > 32
529 if (!(word & 0xffffffff))
530 word >>= 32, bit_no += 32;
532 if (!(word & 0xffff))
533 word >>= 16, bit_no += 16;
535 word >>= 8, bit_no += 8;
537 word >>= 4, bit_no += 4;
539 word >>= 2, bit_no += 2;
541 word >>= 1, bit_no += 1;
543 gcc_assert (word & 1);
552 bitmap_and (bitmap dst, bitmap a, bitmap b)
554 bitmap_element *dst_elt = dst->first;
555 bitmap_element *a_elt = a->first;
556 bitmap_element *b_elt = b->first;
557 bitmap_element *dst_prev = NULL;
559 gcc_assert (dst != a && dst != b && a != b);
560 while (a_elt && b_elt)
562 if (a_elt->indx < b_elt->indx)
564 else if (b_elt->indx < a_elt->indx)
568 /* Matching elts, generate A & B. */
573 dst_elt = bitmap_elt_insert_after (dst, dst_prev);
575 dst_elt->indx = a_elt->indx;
576 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
578 BITMAP_WORD r = a_elt->bits[ix] & b_elt->bits[ix];
580 dst_elt->bits[ix] = r;
586 dst_elt = dst_elt->next;
592 bitmap_elt_clear_from (dst, dst_elt);
593 gcc_assert (!dst->current == !dst->first);
595 dst->indx = dst->current->indx;
601 bitmap_and_into (bitmap a, bitmap b)
603 bitmap_element *a_elt = a->first;
604 bitmap_element *b_elt = b->first;
605 bitmap_element *next;
608 while (a_elt && b_elt)
610 if (a_elt->indx < b_elt->indx)
613 bitmap_element_free (a, a_elt);
616 else if (b_elt->indx < a_elt->indx)
620 /* Matching elts, generate A &= B. */
624 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
626 BITMAP_WORD r = a_elt->bits[ix] & b_elt->bits[ix];
633 bitmap_element_free (a, a_elt);
638 bitmap_elt_clear_from (a, a_elt);
639 gcc_assert (!a->current == !a->first);
640 gcc_assert (!a->current || a->indx == a->current->indx);
646 bitmap_and_compl (bitmap dst, bitmap a, bitmap b)
648 bitmap_element *dst_elt = dst->first;
649 bitmap_element *a_elt = a->first;
650 bitmap_element *b_elt = b->first;
651 bitmap_element *dst_prev = NULL;
653 gcc_assert (dst != a && dst != b && a != b);
657 if (!b_elt || a_elt->indx < b_elt->indx)
661 dst_elt = bitmap_elt_insert_after (dst, dst_prev);
663 dst_elt->indx = a_elt->indx;
664 memcpy (dst_elt->bits, a_elt->bits, sizeof (dst_elt->bits));
666 dst_elt = dst_elt->next;
669 else if (b_elt->indx < a_elt->indx)
673 /* Matching elts, generate A & ~B. */
678 dst_elt = bitmap_elt_insert_after (dst, dst_prev);
680 dst_elt->indx = a_elt->indx;
681 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
683 BITMAP_WORD r = a_elt->bits[ix] & ~b_elt->bits[ix];
685 dst_elt->bits[ix] = r;
691 dst_elt = dst_elt->next;
697 bitmap_elt_clear_from (dst, dst_elt);
698 gcc_assert (!dst->current == !dst->first);
700 dst->indx = dst->current->indx;
703 /* A &= ~B. Returns true if A changes */
706 bitmap_and_compl_into (bitmap a, bitmap b)
708 bitmap_element *a_elt = a->first;
709 bitmap_element *b_elt = b->first;
710 bitmap_element *next;
711 BITMAP_WORD changed = 0;
714 while (a_elt && b_elt)
716 if (a_elt->indx < b_elt->indx)
718 else if (b_elt->indx < a_elt->indx)
722 /* Matching elts, generate A &= ~B. */
726 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
728 BITMAP_WORD cleared = a_elt->bits[ix] & b_elt->bits[ix];
729 BITMAP_WORD r = a_elt->bits[ix] ^ cleared;
737 bitmap_element_free (a, a_elt);
742 gcc_assert (!a->current == !a->first);
743 gcc_assert (!a->current || a->indx == a->current->indx);
747 /* DST = A | B. Return true if DST changes. */
750 bitmap_ior (bitmap dst, bitmap a, bitmap b)
752 bitmap_element *dst_elt = dst->first;
753 bitmap_element *a_elt = a->first;
754 bitmap_element *b_elt = b->first;
755 bitmap_element *dst_prev = NULL;
756 bool changed = false;
758 gcc_assert (dst != a && dst != b && a != b);
759 while (a_elt || b_elt)
761 if (a_elt && b_elt && a_elt->indx == b_elt->indx)
763 /* Matching elts, generate A | B. */
766 if (!changed && dst_elt && dst_elt->indx == a_elt->indx)
768 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
770 BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
772 if (r != dst_elt->bits[ix])
774 dst_elt->bits[ix] = r;
783 dst_elt = bitmap_elt_insert_after (dst, dst_prev);
784 dst_elt->indx = a_elt->indx;
785 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
787 BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
789 dst_elt->bits[ix] = r;
795 dst_elt = dst_elt->next;
799 /* Copy a single element. */
802 if (!b_elt || (a_elt && a_elt->indx < b_elt->indx))
813 if (!changed && dst_elt && dst_elt->indx == src->indx)
817 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
818 if (src->bits[ix] != dst_elt->bits[ix])
820 dst_elt->bits[ix] = src->bits[ix];
828 dst_elt = bitmap_elt_insert_after (dst, dst_prev);
829 dst_elt->indx = src->indx;
830 memcpy (dst_elt->bits, src->bits, sizeof (dst_elt->bits));
834 dst_elt = dst_elt->next;
841 bitmap_elt_clear_from (dst, dst_elt);
843 gcc_assert (!dst->current == !dst->first);
845 dst->indx = dst->current->indx;
849 /* A |= B. Return true if A changes. */
852 bitmap_ior_into (bitmap a, bitmap b)
854 bitmap_element *a_elt = a->first;
855 bitmap_element *b_elt = b->first;
856 bitmap_element *a_prev = NULL;
857 bool changed = false;
862 if (!a_elt || b_elt->indx < a_elt->indx)
865 bitmap_element *dst = bitmap_elt_insert_after (a, a_prev);
867 dst->indx = b_elt->indx;
868 memcpy (dst->bits, b_elt->bits, sizeof (dst->bits));
873 else if (a_elt->indx < b_elt->indx)
880 /* Matching elts, generate A |= B. */
884 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
886 BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
891 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
893 BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
895 if (a_elt->bits[ix] != r)
906 gcc_assert (!a->current == !a->first);
908 a->indx = a->current->indx;
915 bitmap_xor (bitmap dst, bitmap a, bitmap b)
917 bitmap_element *dst_elt = dst->first;
918 bitmap_element *a_elt = a->first;
919 bitmap_element *b_elt = b->first;
920 bitmap_element *dst_prev = NULL;
922 gcc_assert (dst != a && dst != b && a != b);
923 while (a_elt || b_elt)
925 if (a_elt && b_elt && a_elt->indx == b_elt->indx)
927 /* Matching elts, generate A ^ B. */
932 dst_elt = bitmap_elt_insert_after (dst, dst_prev);
934 dst_elt->indx = a_elt->indx;
935 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
937 BITMAP_WORD r = a_elt->bits[ix] ^ b_elt->bits[ix];
940 dst_elt->bits[ix] = r;
947 dst_elt = dst_elt->next;
952 /* Copy a single element. */
955 if (!b_elt || (a_elt && a_elt->indx < b_elt->indx))
967 dst_elt = bitmap_elt_insert_after (dst, dst_prev);
969 dst_elt->indx = src->indx;
970 memcpy (dst_elt->bits, src->bits, sizeof (dst_elt->bits));
972 dst_elt = dst_elt->next;
975 bitmap_elt_clear_from (dst, dst_elt);
976 gcc_assert (!dst->current == !dst->first);
978 dst->indx = dst->current->indx;
984 bitmap_xor_into (bitmap a, bitmap b)
986 bitmap_element *a_elt = a->first;
987 bitmap_element *b_elt = b->first;
988 bitmap_element *a_prev = NULL;
993 if (!a_elt || b_elt->indx < a_elt->indx)
996 bitmap_element *dst = bitmap_elt_insert_after (a, a_prev);
998 dst->indx = b_elt->indx;
999 memcpy (dst->bits, b_elt->bits, sizeof (dst->bits));
1001 b_elt = b_elt->next;
1003 else if (a_elt->indx < b_elt->indx)
1006 a_elt = a_elt->next;
1010 /* Matching elts, generate A ^= B. */
1012 BITMAP_WORD ior = 0;
1013 bitmap_element *next = a_elt->next;
1015 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
1017 BITMAP_WORD r = a_elt->bits[ix] ^ b_elt->bits[ix];
1020 a_elt->bits[ix] = r;
1022 b_elt = b_elt->next;
1026 bitmap_element_free (a, a_elt);
1030 gcc_assert (!a->current == !a->first);
1032 a->indx = a->current->indx;
1035 /* Return true if two bitmaps are identical.
1036 We do not bother with a check for pointer equality, as that never
1037 occurs in practice. */
1040 bitmap_equal_p (bitmap a, bitmap b)
1042 bitmap_element *a_elt;
1043 bitmap_element *b_elt;
1046 for (a_elt = a->first, b_elt = b->first;
1048 a_elt = a_elt->next, b_elt = b_elt->next)
1050 if (a_elt->indx != b_elt->indx)
1052 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
1053 if (a_elt->bits[ix] != b_elt->bits[ix])
1056 return !a_elt && !b_elt;
1059 /* Return true if A AND B is not empty. */
1062 bitmap_intersect_p (bitmap a, bitmap b)
1064 bitmap_element *a_elt;
1065 bitmap_element *b_elt;
1068 for (a_elt = a->first, b_elt = b->first;
1071 if (a_elt->indx < b_elt->indx)
1072 a_elt = a_elt->next;
1073 else if (b_elt->indx < a_elt->indx)
1074 b_elt = b_elt->next;
1077 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
1078 if (a_elt->bits[ix] & b_elt->bits[ix])
1080 a_elt = a_elt->next;
1081 b_elt = b_elt->next;
1087 /* Return true if A AND NOT B is not empty. */
1090 bitmap_intersect_compl_p (bitmap a, bitmap b)
1092 bitmap_element *a_elt;
1093 bitmap_element *b_elt;
1095 for (a_elt = a->first, b_elt = b->first;
1098 if (a_elt->indx < b_elt->indx)
1100 else if (b_elt->indx < a_elt->indx)
1101 b_elt = b_elt->next;
1104 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
1105 if (a_elt->bits[ix] & ~b_elt->bits[ix])
1107 a_elt = a_elt->next;
1108 b_elt = b_elt->next;
1111 return a_elt != NULL;
1115 /* DST = A | (FROM1 & ~FROM2). Return true if DST changes. */
1118 bitmap_ior_and_compl (bitmap dst, bitmap a, bitmap from1, bitmap from2)
1123 bitmap_initialize (&tmp, &bitmap_default_obstack);
1124 bitmap_and_compl (&tmp, from1, from2);
1125 changed = bitmap_ior (dst, a, &tmp);
1126 bitmap_clear (&tmp);
1131 /* A |= (FROM1 & ~FROM2). Return true if A changes. */
1134 bitmap_ior_and_compl_into (bitmap a, bitmap from1, bitmap from2)
1139 bitmap_initialize (&tmp, &bitmap_default_obstack);
1140 bitmap_and_compl (&tmp, from1, from2);
1141 changed = bitmap_ior_into (a, &tmp);
1142 bitmap_clear (&tmp);
1147 /* Debugging function to print out the contents of a bitmap. */
1150 debug_bitmap_file (FILE *file, bitmap head)
1152 bitmap_element *ptr;
1154 fprintf (file, "\nfirst = " HOST_PTR_PRINTF
1155 " current = " HOST_PTR_PRINTF " indx = %u\n",
1156 (void *) head->first, (void *) head->current, head->indx);
1158 for (ptr = head->first; ptr; ptr = ptr->next)
1160 unsigned int i, j, col = 26;
1162 fprintf (file, "\t" HOST_PTR_PRINTF " next = " HOST_PTR_PRINTF
1163 " prev = " HOST_PTR_PRINTF " indx = %u\n\t\tbits = {",
1164 (void*) ptr, (void*) ptr->next, (void*) ptr->prev, ptr->indx);
1166 for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
1167 for (j = 0; j < BITMAP_WORD_BITS; j++)
1168 if ((ptr->bits[i] >> j) & 1)
1172 fprintf (file, "\n\t\t\t");
1176 fprintf (file, " %u", (ptr->indx * BITMAP_ELEMENT_ALL_BITS
1177 + i * BITMAP_WORD_BITS + j));
1181 fprintf (file, " }\n");
1185 /* Function to be called from the debugger to print the contents
1189 debug_bitmap (bitmap head)
1191 debug_bitmap_file (stdout, head);
1194 /* Function to print out the contents of a bitmap. Unlike debug_bitmap_file,
1195 it does not print anything but the bits. */
1198 bitmap_print (FILE *file, bitmap head, const char *prefix, const char *suffix)
1200 const char *comma = "";
1204 fputs (prefix, file);
1205 EXECUTE_IF_SET_IN_BITMAP (head, 0, i, bi)
1207 fprintf (file, "%s%d", comma, i);
1210 fputs (suffix, file);
1213 #include "gt-bitmap.h"