1 /* Functions to support general ended bitmaps.
2 Copyright (C) 1997, 1998, 1999, 2000, 2001 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 2, 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 COPYING. If not, write to the Free
18 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
28 /* Obstack to allocate bitmap elements from. */
29 static struct obstack bitmap_obstack;
30 static int bitmap_obstack_init = FALSE;
36 #define INLINE __inline__
41 bitmap_element bitmap_zero_bits; /* An element of all zero bits. */
42 static bitmap_element *bitmap_free; /* Freelist of bitmap elements. */
44 static void bitmap_element_free PARAMS ((bitmap, bitmap_element *));
45 static bitmap_element *bitmap_element_allocate PARAMS ((void));
46 static int bitmap_element_zerop PARAMS ((bitmap_element *));
47 static void bitmap_element_link PARAMS ((bitmap, bitmap_element *));
48 static bitmap_element *bitmap_find_bit PARAMS ((bitmap, unsigned int));
50 /* Free a bitmap element. Since these are allocated off the
51 bitmap_obstack, "free" actually means "put onto the freelist". */
54 bitmap_element_free (head, elt)
58 bitmap_element *next = elt->next;
59 bitmap_element *prev = elt->prev;
67 if (head->first == elt)
70 /* Since the first thing we try is to insert before current,
71 make current the next entry in preference to the previous. */
72 if (head->current == elt)
74 head->current = next != 0 ? next : prev;
76 head->indx = head->current->indx;
79 elt->next = bitmap_free;
83 /* Allocate a bitmap element. The bits are cleared, but nothing else is. */
85 static INLINE bitmap_element *
86 bitmap_element_allocate ()
88 bitmap_element *element;
92 element = bitmap_free;
93 bitmap_free = element->next;
97 /* We can't use gcc_obstack_init to initialize the obstack since
98 print-rtl.c now calls bitmap functions, and bitmap is linked
99 into the gen* functions. */
100 if (!bitmap_obstack_init)
102 bitmap_obstack_init = TRUE;
104 /* Let particular systems override the size of a chunk. */
105 #ifndef OBSTACK_CHUNK_SIZE
106 #define OBSTACK_CHUNK_SIZE 0
108 /* Let them override the alloc and free routines too. */
109 #ifndef OBSTACK_CHUNK_ALLOC
110 #define OBSTACK_CHUNK_ALLOC xmalloc
112 #ifndef OBSTACK_CHUNK_FREE
113 #define OBSTACK_CHUNK_FREE free
116 #if !defined(__GNUC__) || (__GNUC__ < 2)
117 #define __alignof__(type) 0
120 obstack_specify_allocation (&bitmap_obstack, OBSTACK_CHUNK_SIZE,
121 __alignof__ (bitmap_element),
122 (void *(*) PARAMS ((long))) OBSTACK_CHUNK_ALLOC,
123 (void (*) PARAMS ((void *))) OBSTACK_CHUNK_FREE);
126 element = (bitmap_element *) obstack_alloc (&bitmap_obstack,
127 sizeof (bitmap_element));
130 memset (element->bits, 0, sizeof (element->bits));
135 /* Release any memory allocated by bitmaps. */
138 bitmap_release_memory ()
141 if (bitmap_obstack_init)
143 bitmap_obstack_init = FALSE;
144 obstack_free (&bitmap_obstack, NULL);
148 /* Return nonzero if all bits in an element are zero. */
151 bitmap_element_zerop (element)
152 bitmap_element *element;
154 #if BITMAP_ELEMENT_WORDS == 2
155 return (element->bits[0] | element->bits[1]) == 0;
159 for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
160 if (element->bits[i] != 0)
167 /* Link the bitmap element into the current bitmap linked list. */
170 bitmap_element_link (head, element)
172 bitmap_element *element;
174 unsigned int indx = element->indx;
177 /* If this is the first and only element, set it in. */
178 if (head->first == 0)
180 element->next = element->prev = 0;
181 head->first = element;
184 /* If this index is less than that of the current element, it goes someplace
185 before the current element. */
186 else if (indx < head->indx)
188 for (ptr = head->current;
189 ptr->prev != 0 && ptr->prev->indx > indx;
194 ptr->prev->next = element;
196 head->first = element;
198 element->prev = ptr->prev;
203 /* Otherwise, it must go someplace after the current element. */
206 for (ptr = head->current;
207 ptr->next != 0 && ptr->next->indx < indx;
212 ptr->next->prev = element;
214 element->next = ptr->next;
219 /* Set up so this is the first element searched. */
220 head->current = element;
224 /* Clear a bitmap by freeing the linked list. */
230 bitmap_element *element, *next;
232 for (element = head->first; element != 0; element = next)
234 next = element->next;
235 element->next = bitmap_free;
236 bitmap_free = element;
239 head->first = head->current = 0;
242 /* Copy a bitmap to another bitmap. */
245 bitmap_copy (to, from)
249 bitmap_element *from_ptr, *to_ptr = 0;
250 #if BITMAP_ELEMENT_WORDS != 2
256 /* Copy elements in forward direction one at a time */
257 for (from_ptr = from->first; from_ptr; from_ptr = from_ptr->next)
259 bitmap_element *to_elt = bitmap_element_allocate ();
261 to_elt->indx = from_ptr->indx;
263 #if BITMAP_ELEMENT_WORDS == 2
264 to_elt->bits[0] = from_ptr->bits[0];
265 to_elt->bits[1] = from_ptr->bits[1];
267 for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
268 to_elt->bits[i] = from_ptr->bits[i];
271 /* Here we have a special case of bitmap_element_link, for the case
272 where we know the links are being entered in sequence. */
275 to->first = to->current = to_elt;
276 to->indx = from_ptr->indx;
277 to_elt->next = to_elt->prev = 0;
281 to_elt->prev = to_ptr;
283 to_ptr->next = to_elt;
290 /* Find a bitmap element that would hold a bitmap's bit.
291 Update the `current' field even if we can't find an element that
292 would hold the bitmap's bit to make eventual allocation
295 static INLINE bitmap_element *
296 bitmap_find_bit (head, bit)
300 bitmap_element *element;
301 unsigned HOST_WIDE_INT indx = bit / BITMAP_ELEMENT_ALL_BITS;
303 if (head->current == 0)
306 if (head->indx > indx)
307 for (element = head->current;
308 element->prev != 0 && element->indx > indx;
309 element = element->prev)
313 for (element = head->current;
314 element->next != 0 && element->indx < indx;
315 element = element->next)
318 /* `element' is the nearest to the one we want. If it's not the one we
319 want, the one we want doesn't exist. */
320 head->current = element;
321 head->indx = element->indx;
322 if (element != 0 && element->indx != indx)
328 /* Clear a single bit in a bitmap. */
331 bitmap_clear_bit (head, bit)
335 bitmap_element *ptr = bitmap_find_bit (head, bit);
339 unsigned bit_num = bit % (unsigned) HOST_BITS_PER_WIDE_INT;
340 unsigned word_num = ((bit / (unsigned) HOST_BITS_PER_WIDE_INT)
341 % BITMAP_ELEMENT_WORDS);
342 ptr->bits[word_num] &= ~ (((unsigned HOST_WIDE_INT) 1) << bit_num);
344 /* If we cleared the entire word, free up the element */
345 if (bitmap_element_zerop (ptr))
346 bitmap_element_free (head, ptr);
350 /* Set a single bit in a bitmap. */
353 bitmap_set_bit (head, bit)
357 bitmap_element *ptr = bitmap_find_bit (head, bit);
359 = ((bit / (unsigned) HOST_BITS_PER_WIDE_INT) % BITMAP_ELEMENT_WORDS);
360 unsigned bit_num = bit % (unsigned) HOST_BITS_PER_WIDE_INT;
361 unsigned HOST_WIDE_INT bit_val = ((unsigned HOST_WIDE_INT) 1) << bit_num;
365 ptr = bitmap_element_allocate ();
366 ptr->indx = bit / BITMAP_ELEMENT_ALL_BITS;
367 ptr->bits[word_num] = bit_val;
368 bitmap_element_link (head, ptr);
371 ptr->bits[word_num] |= bit_val;
374 /* Return whether a bit is set within a bitmap. */
377 bitmap_bit_p (head, bit)
385 ptr = bitmap_find_bit (head, bit);
389 bit_num = bit % (unsigned) HOST_BITS_PER_WIDE_INT;
391 = ((bit / (unsigned) HOST_BITS_PER_WIDE_INT) % BITMAP_ELEMENT_WORDS);
393 return (ptr->bits[word_num] >> bit_num) & 1;
396 /* Return the bit number of the first set bit in the bitmap, or -1
397 if the bitmap is empty. */
400 bitmap_first_set_bit (a)
403 bitmap_element *ptr = a->first;
404 unsigned HOST_WIDE_INT word;
405 unsigned word_num, bit_num;
410 #if BITMAP_ELEMENT_WORDS == 2
411 word_num = 0, word = ptr->bits[0];
413 word_num = 1, word = ptr->bits[1];
415 for (word_num = 0; word_num < BITMAP_ELEMENT_WORDS; ++word_num)
416 if ((word = ptr->bits[word_num]) != 0)
420 /* Binary search for the first set bit. */
421 /* ??? It'd be nice to know if ffs or ffsl was available. */
426 #if HOST_BITS_PER_WIDE_INT > 64
427 #error "Fill out the table."
429 #if HOST_BITS_PER_WIDE_INT > 32
430 if ((word & 0xffffffff) == 0)
431 word >>= 32, bit_num += 32;
433 if ((word & 0xffff) == 0)
434 word >>= 16, bit_num += 16;
435 if ((word & 0xff) == 0)
436 word >>= 8, bit_num += 8;
444 return (ptr->indx * BITMAP_ELEMENT_ALL_BITS
445 + word_num * HOST_BITS_PER_WIDE_INT
449 /* Return the bit number of the last set bit in the bitmap, or -1
450 if the bitmap is empty. */
453 bitmap_last_set_bit (a)
456 bitmap_element *ptr = a->first;
457 unsigned HOST_WIDE_INT word;
458 unsigned word_num, bit_num;
463 while (ptr->next != NULL)
466 #if BITMAP_ELEMENT_WORDS == 2
467 word_num = 1, word = ptr->bits[1];
469 word_num = 0, word = ptr->bits[0];
471 for (word_num = BITMAP_ELEMENT_WORDS; word_num-- > 0; )
472 if ((word = ptr->bits[word_num]) != 0)
476 /* Binary search for the last set bit. */
479 #if HOST_BITS_PER_WIDE_INT > 64
480 #error "Fill out the table."
482 #if HOST_BITS_PER_WIDE_INT > 32
483 if (word & ~ (unsigned HOST_WIDE_INT) 0xffffffff)
484 word >>= 32, bit_num += 32;
486 if (word & 0xffff0000)
487 word >>= 16, bit_num += 16;
489 word >>= 8, bit_num += 8;
491 word >>= 4, bit_num += 4;
493 word >>= 2, bit_num += 2;
497 return (ptr->indx * BITMAP_ELEMENT_ALL_BITS
498 + word_num * HOST_BITS_PER_WIDE_INT
502 /* Store in bitmap TO the result of combining bitmap FROM1 and FROM2 using
503 a specific bit manipulation. Return true if TO changes. */
506 bitmap_operation (to, from1, from2, operation)
510 enum bitmap_bits operation;
512 #define HIGHEST_INDEX (unsigned int) ~0
514 bitmap_element *from1_ptr = from1->first;
515 bitmap_element *from2_ptr = from2->first;
516 unsigned int indx1 = (from1_ptr) ? from1_ptr->indx : HIGHEST_INDEX;
517 unsigned int indx2 = (from2_ptr) ? from2_ptr->indx : HIGHEST_INDEX;
518 bitmap_element *to_ptr = to->first;
519 bitmap_element *from1_tmp;
520 bitmap_element *from2_tmp;
521 bitmap_element *to_tmp;
525 #if BITMAP_ELEMENT_WORDS == 2
528 unsigned HOST_WIDE_INT t0, t1, f10, f11, f20, f21; \
529 f10 = from1_tmp->bits[0]; \
530 f20 = from2_tmp->bits[0]; \
532 changed |= (t0 != to_tmp->bits[0]); \
533 f11 = from1_tmp->bits[1]; \
534 f21 = from2_tmp->bits[1]; \
536 changed |= (t1 != to_tmp->bits[1]); \
537 to_tmp->bits[0] = t0; \
538 to_tmp->bits[1] = t1; \
543 unsigned HOST_WIDE_INT t, f1, f2; \
545 for (i = 0; i < BITMAP_ELEMENT_WORDS; ++i) \
547 f1 = from1_tmp->bits[i]; \
548 f2 = from2_tmp->bits[i]; \
550 changed |= (t != to_tmp->bits[i]); \
551 to_tmp->bits[i] = t; \
556 to->first = to->current = 0;
558 while (from1_ptr != 0 || from2_ptr != 0)
560 /* Figure out whether we need to substitute zero elements for
565 from1_tmp = from1_ptr;
566 from2_tmp = from2_ptr;
567 from1_ptr = from1_ptr->next;
568 indx1 = (from1_ptr) ? from1_ptr->indx : HIGHEST_INDEX;
569 from2_ptr = from2_ptr->next;
570 indx2 = (from2_ptr) ? from2_ptr->indx : HIGHEST_INDEX;
572 else if (indx1 < indx2)
575 from1_tmp = from1_ptr;
576 from2_tmp = &bitmap_zero_bits;
577 from1_ptr = from1_ptr->next;
578 indx1 = (from1_ptr) ? from1_ptr->indx : HIGHEST_INDEX;
583 from1_tmp = &bitmap_zero_bits;
584 from2_tmp = from2_ptr;
585 from2_ptr = from2_ptr->next;
586 indx2 = (from2_ptr) ? from2_ptr->indx : HIGHEST_INDEX;
589 /* Find the appropriate element from TO. Begin by discarding
590 elements that we've skipped. */
591 while (to_ptr && to_ptr->indx < indx)
595 to_ptr = to_ptr->next;
596 to_tmp->next = bitmap_free;
597 bitmap_free = to_tmp;
599 if (to_ptr && to_ptr->indx == indx)
602 to_ptr = to_ptr->next;
605 to_tmp = bitmap_element_allocate ();
607 /* Do the operation, and if any bits are set, link it into the
618 case BITMAP_AND_COMPL:
625 case BITMAP_IOR_COMPL:
633 if (! bitmap_element_zerop (to_tmp))
636 bitmap_element_link (to, to_tmp);
640 to_tmp->next = bitmap_free;
641 bitmap_free = to_tmp;
645 /* If we have elements of TO left over, free the lot. */
649 for (to_tmp = to_ptr; to_tmp->next ; to_tmp = to_tmp->next)
651 to_tmp->next = bitmap_free;
652 bitmap_free = to_ptr;
660 /* Return true if two bitmaps are identical. */
663 bitmap_equal_p (a, b)
670 c.first = c.current = 0;
671 ret = ! bitmap_operation (&c, a, b, BITMAP_XOR);
677 /* Or into bitmap TO bitmap FROM1 and'ed with the complement of
681 bitmap_ior_and_compl (to, from1, from2)
688 tmp.first = tmp.current = 0;
690 bitmap_operation (&tmp, from1, from2, BITMAP_AND_COMPL);
691 bitmap_operation (to, to, &tmp, BITMAP_IOR);
696 bitmap_union_of_diff (dst, a, b, c)
705 tmp.first = tmp.current = 0;
707 bitmap_operation (&tmp, b, c, BITMAP_AND_COMPL);
708 changed = bitmap_operation (dst, &tmp, a, BITMAP_IOR);
714 /* Initialize a bitmap header. */
717 bitmap_initialize (head)
720 head->first = head->current = 0;
725 /* Debugging function to print out the contents of a bitmap. */
728 debug_bitmap_file (file, head)
734 fprintf (file, "\nfirst = ");
735 fprintf (file, HOST_PTR_PRINTF, (PTR) head->first);
736 fprintf (file, " current = ");
737 fprintf (file, HOST_PTR_PRINTF, (PTR) head->current);
738 fprintf (file, " indx = %u\n", head->indx);
740 for (ptr = head->first; ptr; ptr = ptr->next)
744 fprintf (file, "\t");
745 fprintf (file, HOST_PTR_PRINTF, (PTR) ptr);
746 fprintf (file, " next = ");
747 fprintf (file, HOST_PTR_PRINTF, (PTR) ptr->next);
748 fprintf (file, " prev = ");
749 fprintf (file, HOST_PTR_PRINTF, (PTR) ptr->prev);
750 fprintf (file, " indx = %u\n\t\tbits = {", ptr->indx);
752 for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
753 for (j = 0; j < HOST_BITS_PER_WIDE_INT; j++)
754 if ((ptr->bits[i] >> j) & 1)
758 fprintf (file, "\n\t\t\t");
762 fprintf (file, " %u", (ptr->indx * BITMAP_ELEMENT_ALL_BITS
763 + i * HOST_BITS_PER_WIDE_INT + j));
767 fprintf (file, " }\n");
771 /* Function to be called from the debugger to print the contents
778 debug_bitmap_file (stdout, head);
781 /* Function to print out the contents of a bitmap. Unlike debug_bitmap_file,
782 it does not print anything but the bits. */
785 bitmap_print (file, head, prefix, suffix)
791 const char *comma = "";
794 fputs (prefix, file);
795 EXECUTE_IF_SET_IN_BITMAP (head, 0, i,
797 fprintf (file, "%s%d", comma, i);
800 fputs (suffix, file);