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;
352 /* Copy elements in forward direction one at a time. */
353 for (from_ptr = from->first; from_ptr; from_ptr = from_ptr->next)
355 bitmap_element *to_elt = bitmap_element_allocate (to);
357 to_elt->indx = from_ptr->indx;
358 memcpy (to_elt->bits, from_ptr->bits, sizeof (to_elt->bits));
360 /* Here we have a special case of bitmap_element_link, for the case
361 where we know the links are being entered in sequence. */
364 to->first = to->current = to_elt;
365 to->indx = from_ptr->indx;
366 to_elt->next = to_elt->prev = 0;
370 to_elt->prev = to_ptr;
372 to_ptr->next = to_elt;
379 /* Find a bitmap element that would hold a bitmap's bit.
380 Update the `current' field even if we can't find an element that
381 would hold the bitmap's bit to make eventual allocation
384 static inline bitmap_element *
385 bitmap_find_bit (bitmap head, unsigned int bit)
387 bitmap_element *element;
388 unsigned int indx = bit / BITMAP_ELEMENT_ALL_BITS;
390 if (head->current == 0
391 || head->indx == indx)
392 return head->current;
394 if (head->indx < indx)
395 /* INDX is beyond head->indx. Search from head->current
397 for (element = head->current;
398 element->next != 0 && element->indx < indx;
399 element = element->next)
402 else if (head->indx / 2 < indx)
403 /* INDX is less than head->indx and closer to head->indx than to
404 0. Search from head->current backward. */
405 for (element = head->current;
406 element->prev != 0 && element->indx > indx;
407 element = element->prev)
411 /* INDX is less than head->indx and closer to 0 than to
412 head->indx. Search from head->first forward. */
413 for (element = head->first;
414 element->next != 0 && element->indx < indx;
415 element = element->next)
418 /* `element' is the nearest to the one we want. If it's not the one we
419 want, the one we want doesn't exist. */
420 head->current = element;
421 head->indx = element->indx;
422 if (element != 0 && element->indx != indx)
428 /* Clear a single bit in a bitmap. */
431 bitmap_clear_bit (bitmap head, int bit)
433 bitmap_element *ptr = bitmap_find_bit (head, bit);
437 unsigned bit_num = bit % BITMAP_WORD_BITS;
438 unsigned word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
439 ptr->bits[word_num] &= ~ (((BITMAP_WORD) 1) << bit_num);
441 /* If we cleared the entire word, free up the element. */
442 if (bitmap_element_zerop (ptr))
443 bitmap_element_free (head, ptr);
447 /* Set a single bit in a bitmap. */
450 bitmap_set_bit (bitmap head, int bit)
452 bitmap_element *ptr = bitmap_find_bit (head, bit);
453 unsigned word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
454 unsigned bit_num = bit % BITMAP_WORD_BITS;
455 BITMAP_WORD bit_val = ((BITMAP_WORD) 1) << bit_num;
459 ptr = bitmap_element_allocate (head);
460 ptr->indx = bit / BITMAP_ELEMENT_ALL_BITS;
461 ptr->bits[word_num] = bit_val;
462 bitmap_element_link (head, ptr);
465 ptr->bits[word_num] |= bit_val;
468 /* Return whether a bit is set within a bitmap. */
471 bitmap_bit_p (bitmap head, int bit)
477 ptr = bitmap_find_bit (head, bit);
481 bit_num = bit % BITMAP_WORD_BITS;
482 word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
484 return (ptr->bits[word_num] >> bit_num) & 1;
487 /* Return the bit number of the first set bit in the bitmap. The
488 bitmap must be non-empty. */
491 bitmap_first_set_bit (bitmap a)
493 bitmap_element *elt = a->first;
499 bit_no = elt->indx * BITMAP_ELEMENT_ALL_BITS;
500 for (ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++)
502 word = elt->bits[ix];
508 bit_no += ix * BITMAP_WORD_BITS;
510 #if GCC_VERSION >= 3004
511 gcc_assert (sizeof(long) == sizeof (word));
512 bit_no += __builtin_ctzl (word);
514 /* Binary search for the first set bit. */
515 #if BITMAP_WORD_BITS > 64
516 #error "Fill out the table."
518 #if BITMAP_WORD_BITS > 32
519 if (!(word & 0xffffffff))
520 word >>= 32, bit_no += 32;
522 if (!(word & 0xffff))
523 word >>= 16, bit_no += 16;
525 word >>= 8, bit_no += 8;
527 word >>= 4, bit_no += 4;
529 word >>= 2, bit_no += 2;
531 word >>= 1, bit_no += 1;
533 gcc_assert (word & 1);
542 bitmap_and (bitmap dst, bitmap a, bitmap b)
544 bitmap_element *dst_elt = dst->first;
545 bitmap_element *a_elt = a->first;
546 bitmap_element *b_elt = b->first;
547 bitmap_element *dst_prev = NULL;
549 gcc_assert (dst != a && dst != b && a != b);
550 while (a_elt && b_elt)
552 if (a_elt->indx < b_elt->indx)
554 else if (b_elt->indx < a_elt->indx)
558 /* Matching elts, generate A & B. */
563 dst_elt = bitmap_elt_insert_after (dst, dst_prev);
565 dst_elt->indx = a_elt->indx;
566 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
568 BITMAP_WORD r = a_elt->bits[ix] & b_elt->bits[ix];
570 dst_elt->bits[ix] = r;
576 dst_elt = dst_elt->next;
582 bitmap_elt_clear_from (dst, dst_elt);
583 gcc_assert (!dst->current == !dst->first);
585 dst->indx = dst->current->indx;
591 bitmap_and_into (bitmap a, bitmap b)
593 bitmap_element *a_elt = a->first;
594 bitmap_element *b_elt = b->first;
595 bitmap_element *next;
598 while (a_elt && b_elt)
600 if (a_elt->indx < b_elt->indx)
603 bitmap_element_free (a, a_elt);
606 else if (b_elt->indx < a_elt->indx)
610 /* Matching elts, generate A &= B. */
614 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
616 BITMAP_WORD r = a_elt->bits[ix] & b_elt->bits[ix];
623 bitmap_element_free (a, a_elt);
628 bitmap_elt_clear_from (a, a_elt);
629 gcc_assert (!a->current == !a->first);
630 gcc_assert (!a->current || a->indx == a->current->indx);
636 bitmap_and_compl (bitmap dst, bitmap a, bitmap b)
638 bitmap_element *dst_elt = dst->first;
639 bitmap_element *a_elt = a->first;
640 bitmap_element *b_elt = b->first;
641 bitmap_element *dst_prev = NULL;
643 gcc_assert (dst != a && dst != b && a != b);
647 if (!b_elt || a_elt->indx < b_elt->indx)
651 dst_elt = bitmap_elt_insert_after (dst, dst_prev);
653 dst_elt->indx = a_elt->indx;
654 memcpy (dst_elt->bits, a_elt->bits, sizeof (dst_elt->bits));
656 dst_elt = dst_elt->next;
659 else if (b_elt->indx < a_elt->indx)
663 /* Matching elts, generate A & ~B. */
668 dst_elt = bitmap_elt_insert_after (dst, dst_prev);
670 dst_elt->indx = a_elt->indx;
671 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
673 BITMAP_WORD r = a_elt->bits[ix] & ~b_elt->bits[ix];
675 dst_elt->bits[ix] = r;
681 dst_elt = dst_elt->next;
687 bitmap_elt_clear_from (dst, dst_elt);
688 gcc_assert (!dst->current == !dst->first);
690 dst->indx = dst->current->indx;
693 /* A &= ~B. Returns true if A changes */
696 bitmap_and_compl_into (bitmap a, bitmap b)
698 bitmap_element *a_elt = a->first;
699 bitmap_element *b_elt = b->first;
700 bitmap_element *next;
701 BITMAP_WORD changed = 0;
704 while (a_elt && b_elt)
706 if (a_elt->indx < b_elt->indx)
708 else if (b_elt->indx < a_elt->indx)
712 /* Matching elts, generate A &= ~B. */
716 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
718 BITMAP_WORD cleared = a_elt->bits[ix] & b_elt->bits[ix];
719 BITMAP_WORD r = a_elt->bits[ix] ^ cleared;
727 bitmap_element_free (a, a_elt);
732 gcc_assert (!a->current == !a->first);
733 gcc_assert (!a->current || a->indx == a->current->indx);
737 /* DST = A | B. Return true if DST changes. */
740 bitmap_ior (bitmap dst, bitmap a, bitmap b)
742 bitmap_element *dst_elt = dst->first;
743 bitmap_element *a_elt = a->first;
744 bitmap_element *b_elt = b->first;
745 bitmap_element *dst_prev = NULL;
746 bool changed = false;
748 gcc_assert (dst != a && dst != b && a != b);
749 while (a_elt || b_elt)
751 if (a_elt && b_elt && a_elt->indx == b_elt->indx)
753 /* Matching elts, generate A | B. */
756 if (!changed && dst_elt && dst_elt->indx == a_elt->indx)
758 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
760 BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
762 if (r != dst_elt->bits[ix])
764 dst_elt->bits[ix] = r;
773 dst_elt = bitmap_elt_insert_after (dst, dst_prev);
774 dst_elt->indx = a_elt->indx;
775 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
777 BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
779 dst_elt->bits[ix] = r;
785 dst_elt = dst_elt->next;
789 /* Copy a single element. */
792 if (!b_elt || (a_elt && a_elt->indx < b_elt->indx))
803 if (!changed && dst_elt && dst_elt->indx == src->indx)
807 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
808 if (src->bits[ix] != dst_elt->bits[ix])
810 dst_elt->bits[ix] = src->bits[ix];
818 dst_elt = bitmap_elt_insert_after (dst, dst_prev);
819 dst_elt->indx = src->indx;
820 memcpy (dst_elt->bits, src->bits, sizeof (dst_elt->bits));
824 dst_elt = dst_elt->next;
831 bitmap_elt_clear_from (dst, dst_elt);
833 gcc_assert (!dst->current == !dst->first);
835 dst->indx = dst->current->indx;
839 /* A |= B. Return true if A changes. */
842 bitmap_ior_into (bitmap a, bitmap b)
844 bitmap_element *a_elt = a->first;
845 bitmap_element *b_elt = b->first;
846 bitmap_element *a_prev = NULL;
847 bool changed = false;
852 if (!a_elt || b_elt->indx < a_elt->indx)
855 bitmap_element *dst = bitmap_elt_insert_after (a, a_prev);
857 dst->indx = b_elt->indx;
858 memcpy (dst->bits, b_elt->bits, sizeof (dst->bits));
863 else if (a_elt->indx < b_elt->indx)
870 /* Matching elts, generate A |= B. */
874 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
876 BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
881 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
883 BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
885 if (a_elt->bits[ix] != r)
896 gcc_assert (!a->current == !a->first);
898 a->indx = a->current->indx;
905 bitmap_xor (bitmap dst, bitmap a, bitmap b)
907 bitmap_element *dst_elt = dst->first;
908 bitmap_element *a_elt = a->first;
909 bitmap_element *b_elt = b->first;
910 bitmap_element *dst_prev = NULL;
912 gcc_assert (dst != a && dst != b && a != b);
913 while (a_elt || b_elt)
915 if (a_elt && b_elt && a_elt->indx == b_elt->indx)
917 /* Matching elts, generate A ^ B. */
922 dst_elt = bitmap_elt_insert_after (dst, dst_prev);
924 dst_elt->indx = a_elt->indx;
925 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
927 BITMAP_WORD r = a_elt->bits[ix] ^ b_elt->bits[ix];
930 dst_elt->bits[ix] = r;
937 dst_elt = dst_elt->next;
942 /* Copy a single element. */
945 if (!b_elt || (a_elt && a_elt->indx < b_elt->indx))
957 dst_elt = bitmap_elt_insert_after (dst, dst_prev);
959 dst_elt->indx = src->indx;
960 memcpy (dst_elt->bits, src->bits, sizeof (dst_elt->bits));
962 dst_elt = dst_elt->next;
965 bitmap_elt_clear_from (dst, dst_elt);
966 gcc_assert (!dst->current == !dst->first);
968 dst->indx = dst->current->indx;
974 bitmap_xor_into (bitmap a, bitmap b)
976 bitmap_element *a_elt = a->first;
977 bitmap_element *b_elt = b->first;
978 bitmap_element *a_prev = NULL;
983 if (!a_elt || b_elt->indx < a_elt->indx)
986 bitmap_element *dst = bitmap_elt_insert_after (a, a_prev);
988 dst->indx = b_elt->indx;
989 memcpy (dst->bits, b_elt->bits, sizeof (dst->bits));
993 else if (a_elt->indx < b_elt->indx)
1000 /* Matching elts, generate A ^= B. */
1002 BITMAP_WORD ior = 0;
1003 bitmap_element *next = a_elt->next;
1005 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
1007 BITMAP_WORD r = a_elt->bits[ix] ^ b_elt->bits[ix];
1010 a_elt->bits[ix] = r;
1012 b_elt = b_elt->next;
1016 bitmap_element_free (a, a_elt);
1020 gcc_assert (!a->current == !a->first);
1022 a->indx = a->current->indx;
1025 /* Return true if two bitmaps are identical.
1026 We do not bother with a check for pointer equality, as that never
1027 occurs in practice. */
1030 bitmap_equal_p (bitmap a, bitmap b)
1032 bitmap_element *a_elt;
1033 bitmap_element *b_elt;
1036 for (a_elt = a->first, b_elt = b->first;
1038 a_elt = a_elt->next, b_elt = b_elt->next)
1040 if (a_elt->indx != b_elt->indx)
1042 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
1043 if (a_elt->bits[ix] != b_elt->bits[ix])
1046 return !a_elt && !b_elt;
1049 /* Return true if A AND B is not empty. */
1052 bitmap_intersect_p (bitmap a, bitmap b)
1054 bitmap_element *a_elt;
1055 bitmap_element *b_elt;
1058 for (a_elt = a->first, b_elt = b->first;
1061 if (a_elt->indx < b_elt->indx)
1062 a_elt = a_elt->next;
1063 else if (b_elt->indx < a_elt->indx)
1064 b_elt = b_elt->next;
1067 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
1068 if (a_elt->bits[ix] & b_elt->bits[ix])
1070 a_elt = a_elt->next;
1071 b_elt = b_elt->next;
1077 /* Return true if A AND NOT B is not empty. */
1080 bitmap_intersect_compl_p (bitmap a, bitmap b)
1082 bitmap_element *a_elt;
1083 bitmap_element *b_elt;
1085 for (a_elt = a->first, b_elt = b->first;
1088 if (a_elt->indx < b_elt->indx)
1090 else if (b_elt->indx < a_elt->indx)
1091 b_elt = b_elt->next;
1094 for (ix = BITMAP_ELEMENT_WORDS; ix--;)
1095 if (a_elt->bits[ix] & ~b_elt->bits[ix])
1097 a_elt = a_elt->next;
1098 b_elt = b_elt->next;
1101 return a_elt != NULL;
1105 /* DST = A | (FROM1 & ~FROM2). Return true if DST changes. */
1108 bitmap_ior_and_compl (bitmap dst, bitmap a, bitmap from1, bitmap from2)
1113 bitmap_initialize (&tmp, &bitmap_default_obstack);
1114 bitmap_and_compl (&tmp, from1, from2);
1115 changed = bitmap_ior (dst, a, &tmp);
1116 bitmap_clear (&tmp);
1121 /* A |= (FROM1 & ~FROM2). Return true if A changes. */
1124 bitmap_ior_and_compl_into (bitmap a, bitmap from1, bitmap from2)
1129 bitmap_initialize (&tmp, &bitmap_default_obstack);
1130 bitmap_and_compl (&tmp, from1, from2);
1131 changed = bitmap_ior_into (a, &tmp);
1132 bitmap_clear (&tmp);
1137 /* Debugging function to print out the contents of a bitmap. */
1140 debug_bitmap_file (FILE *file, bitmap head)
1142 bitmap_element *ptr;
1144 fprintf (file, "\nfirst = " HOST_PTR_PRINTF
1145 " current = " HOST_PTR_PRINTF " indx = %u\n",
1146 (void *) head->first, (void *) head->current, head->indx);
1148 for (ptr = head->first; ptr; ptr = ptr->next)
1150 unsigned int i, j, col = 26;
1152 fprintf (file, "\t" HOST_PTR_PRINTF " next = " HOST_PTR_PRINTF
1153 " prev = " HOST_PTR_PRINTF " indx = %u\n\t\tbits = {",
1154 (void*) ptr, (void*) ptr->next, (void*) ptr->prev, ptr->indx);
1156 for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
1157 for (j = 0; j < BITMAP_WORD_BITS; j++)
1158 if ((ptr->bits[i] >> j) & 1)
1162 fprintf (file, "\n\t\t\t");
1166 fprintf (file, " %u", (ptr->indx * BITMAP_ELEMENT_ALL_BITS
1167 + i * BITMAP_WORD_BITS + j));
1171 fprintf (file, " }\n");
1175 /* Function to be called from the debugger to print the contents
1179 debug_bitmap (bitmap head)
1181 debug_bitmap_file (stdout, head);
1184 /* Function to print out the contents of a bitmap. Unlike debug_bitmap_file,
1185 it does not print anything but the bits. */
1188 bitmap_print (FILE *file, bitmap head, const char *prefix, const char *suffix)
1190 const char *comma = "";
1194 fputs (prefix, file);
1195 EXECUTE_IF_SET_IN_BITMAP (head, 0, i, bi)
1197 fprintf (file, "%s%d", comma, i);
1200 fputs (suffix, file);
1203 #include "gt-bitmap.h"