2 Copyright (C) 1999, 2000, 2002, 2003, 2004 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, 51 Franklin Street, Fifth Floor, Boston, MA
23 #include "coretypes.h"
27 #include "hard-reg-set.h"
29 #include "basic-block.h"
31 /* Bitmap manipulation routines. */
33 /* Allocate a simple bitmap of N_ELMS bits. */
36 sbitmap_alloc (unsigned int n_elms)
38 unsigned int bytes, size, amt;
41 size = SBITMAP_SET_SIZE (n_elms);
42 bytes = size * sizeof (SBITMAP_ELT_TYPE);
43 amt = (sizeof (struct simple_bitmap_def)
44 + bytes - sizeof (SBITMAP_ELT_TYPE));
46 bmap->n_bits = n_elms;
52 /* Resize a simple bitmap BMAP to N_ELMS bits. If increasing the
53 size of BMAP, clear the new bits to zero if the DEF argument
54 is zero, and set them to one otherwise. */
57 sbitmap_resize (sbitmap bmap, unsigned int n_elms, int def)
59 unsigned int bytes, size, amt;
60 unsigned int last_bit;
62 size = SBITMAP_SET_SIZE (n_elms);
63 bytes = size * sizeof (SBITMAP_ELT_TYPE);
64 if (bytes > bmap->bytes)
66 amt = (sizeof (struct simple_bitmap_def)
67 + bytes - sizeof (SBITMAP_ELT_TYPE));
68 bmap = xrealloc (bmap, amt);
71 if (n_elms > bmap->n_bits)
75 memset (bmap->elms + bmap->size, -1, bytes - bmap->bytes);
77 /* Set the new bits if the original last element. */
78 last_bit = bmap->n_bits % SBITMAP_ELT_BITS;
80 bmap->elms[bmap->size - 1]
81 |= ~((SBITMAP_ELT_TYPE)-1 >> (SBITMAP_ELT_BITS - last_bit));
83 /* Clear the unused bit in the new last element. */
84 last_bit = n_elms % SBITMAP_ELT_BITS;
87 &= (SBITMAP_ELT_TYPE)-1 >> (SBITMAP_ELT_BITS - last_bit);
90 memset (bmap->elms + bmap->size, 0, bytes - bmap->bytes);
92 else if (n_elms < bmap->n_bits)
94 /* Clear the surplus bits in the last word. */
95 last_bit = n_elms % SBITMAP_ELT_BITS;
98 &= (SBITMAP_ELT_TYPE)-1 >> (SBITMAP_ELT_BITS - last_bit);
101 bmap->n_bits = n_elms;
107 /* Re-allocate a simple bitmap of N_ELMS bits. New storage is uninitialized. */
110 sbitmap_realloc (sbitmap src, unsigned int n_elms)
112 unsigned int bytes, size, amt;
115 size = SBITMAP_SET_SIZE (n_elms);
116 bytes = size * sizeof (SBITMAP_ELT_TYPE);
117 amt = (sizeof (struct simple_bitmap_def)
118 + bytes - sizeof (SBITMAP_ELT_TYPE));
120 if (src->bytes >= bytes)
122 src->n_bits = n_elms;
126 bmap = (sbitmap) xrealloc (src, amt);
127 bmap->n_bits = n_elms;
133 /* Allocate a vector of N_VECS bitmaps of N_ELMS bits. */
136 sbitmap_vector_alloc (unsigned int n_vecs, unsigned int n_elms)
138 unsigned int i, bytes, offset, elm_bytes, size, amt, vector_bytes;
139 sbitmap *bitmap_vector;
141 size = SBITMAP_SET_SIZE (n_elms);
142 bytes = size * sizeof (SBITMAP_ELT_TYPE);
143 elm_bytes = (sizeof (struct simple_bitmap_def)
144 + bytes - sizeof (SBITMAP_ELT_TYPE));
145 vector_bytes = n_vecs * sizeof (sbitmap *);
147 /* Round up `vector_bytes' to account for the alignment requirements
148 of an sbitmap. One could allocate the vector-table and set of sbitmaps
149 separately, but that requires maintaining two pointers or creating
150 a cover struct to hold both pointers (so our result is still just
151 one pointer). Neither is a bad idea, but this is simpler for now. */
153 /* Based on DEFAULT_ALIGNMENT computation in obstack.c. */
154 struct { char x; SBITMAP_ELT_TYPE y; } align;
155 int alignment = (char *) & align.y - & align.x;
156 vector_bytes = (vector_bytes + alignment - 1) & ~ (alignment - 1);
159 amt = vector_bytes + (n_vecs * elm_bytes);
160 bitmap_vector = xmalloc (amt);
162 for (i = 0, offset = vector_bytes; i < n_vecs; i++, offset += elm_bytes)
164 sbitmap b = (sbitmap) ((char *) bitmap_vector + offset);
166 bitmap_vector[i] = b;
172 return bitmap_vector;
175 /* Copy sbitmap SRC to DST. */
178 sbitmap_copy (sbitmap dst, sbitmap src)
180 memcpy (dst->elms, src->elms, sizeof (SBITMAP_ELT_TYPE) * dst->size);
183 /* Determine if a == b. */
185 sbitmap_equal (sbitmap a, sbitmap b)
187 return !memcmp (a->elms, b->elms, sizeof (SBITMAP_ELT_TYPE) * a->size);
190 /* Zero all elements in a bitmap. */
193 sbitmap_zero (sbitmap bmap)
195 memset (bmap->elms, 0, bmap->bytes);
198 /* Set all elements in a bitmap to ones. */
201 sbitmap_ones (sbitmap bmap)
203 unsigned int last_bit;
205 memset (bmap->elms, -1, bmap->bytes);
207 last_bit = bmap->n_bits % SBITMAP_ELT_BITS;
209 bmap->elms[bmap->size - 1]
210 = (SBITMAP_ELT_TYPE)-1 >> (SBITMAP_ELT_BITS - last_bit);
213 /* Zero a vector of N_VECS bitmaps. */
216 sbitmap_vector_zero (sbitmap *bmap, unsigned int n_vecs)
220 for (i = 0; i < n_vecs; i++)
221 sbitmap_zero (bmap[i]);
224 /* Set a vector of N_VECS bitmaps to ones. */
227 sbitmap_vector_ones (sbitmap *bmap, unsigned int n_vecs)
231 for (i = 0; i < n_vecs; i++)
232 sbitmap_ones (bmap[i]);
235 /* Set DST to be A union (B - C).
237 Returns true if any change is made. */
240 sbitmap_union_of_diff_cg (sbitmap dst, sbitmap a, sbitmap b, sbitmap c)
242 unsigned int i, n = dst->size;
243 sbitmap_ptr dstp = dst->elms;
244 sbitmap_ptr ap = a->elms;
245 sbitmap_ptr bp = b->elms;
246 sbitmap_ptr cp = c->elms;
247 SBITMAP_ELT_TYPE changed = 0;
249 for (i = 0; i < n; i++)
251 SBITMAP_ELT_TYPE tmp = *ap++ | (*bp++ & ~*cp++);
252 changed |= *dstp ^ tmp;
260 sbitmap_union_of_diff (sbitmap dst, sbitmap a, sbitmap b, sbitmap c)
262 unsigned int i, n = dst->size;
263 sbitmap_ptr dstp = dst->elms;
264 sbitmap_ptr ap = a->elms;
265 sbitmap_ptr bp = b->elms;
266 sbitmap_ptr cp = c->elms;
268 for (i = 0; i < n; i++)
269 *dstp++ = *ap++ | (*bp++ & ~*cp++);
272 /* Set bitmap DST to the bitwise negation of the bitmap SRC. */
275 sbitmap_not (sbitmap dst, sbitmap src)
277 unsigned int i, n = dst->size;
278 sbitmap_ptr dstp = dst->elms;
279 sbitmap_ptr srcp = src->elms;
280 unsigned int last_bit;
282 for (i = 0; i < n; i++)
285 /* Zero all bits past n_bits, by ANDing dst with sbitmap_ones. */
286 last_bit = src->n_bits % SBITMAP_ELT_BITS;
288 dst->elms[n-1] = dst->elms[n-1]
289 & ((SBITMAP_ELT_TYPE)-1 >> (SBITMAP_ELT_BITS - last_bit));
292 /* Set the bits in DST to be the difference between the bits
293 in A and the bits in B. i.e. dst = a & (~b). */
296 sbitmap_difference (sbitmap dst, sbitmap a, sbitmap b)
298 unsigned int i, dst_size = dst->size;
299 unsigned int min_size = dst->size;
300 sbitmap_ptr dstp = dst->elms;
301 sbitmap_ptr ap = a->elms;
302 sbitmap_ptr bp = b->elms;
304 /* A should be at least as large as DEST, to have a defined source. */
305 gcc_assert (a->size >= dst_size);
306 /* If minuend is smaller, we simply pretend it to be zero bits, i.e.
307 only copy the subtrahend into dest. */
308 if (b->size < min_size)
310 for (i = 0; i < min_size; i++)
311 *dstp++ = *ap++ & (~*bp++);
312 /* Now fill the rest of dest from A, if B was too short.
313 This makes sense only when destination and A differ. */
314 if (dst != a && i != dst_size)
315 for (; i < dst_size; i++)
319 /* Return true if there are any bits set in A are also set in B.
320 Return false otherwise. */
323 sbitmap_any_common_bits (sbitmap a, sbitmap b)
325 sbitmap_ptr ap = a->elms;
326 sbitmap_ptr bp = b->elms;
329 n = MIN (a->size, b->size);
330 for (i = 0; i < n; i++)
331 if ((*ap++ & *bp++) != 0)
337 /* Set DST to be (A and B).
338 Return nonzero if any change is made. */
341 sbitmap_a_and_b_cg (sbitmap dst, sbitmap a, sbitmap b)
343 unsigned int i, n = dst->size;
344 sbitmap_ptr dstp = dst->elms;
345 sbitmap_ptr ap = a->elms;
346 sbitmap_ptr bp = b->elms;
347 SBITMAP_ELT_TYPE changed = 0;
349 for (i = 0; i < n; i++)
351 SBITMAP_ELT_TYPE tmp = *ap++ & *bp++;
352 changed |= *dstp ^ tmp;
360 sbitmap_a_and_b (sbitmap dst, sbitmap a, sbitmap b)
362 unsigned int i, n = dst->size;
363 sbitmap_ptr dstp = dst->elms;
364 sbitmap_ptr ap = a->elms;
365 sbitmap_ptr bp = b->elms;
367 for (i = 0; i < n; i++)
368 *dstp++ = *ap++ & *bp++;
371 /* Set DST to be (A xor B)).
372 Return nonzero if any change is made. */
375 sbitmap_a_xor_b_cg (sbitmap dst, sbitmap a, sbitmap b)
377 unsigned int i, n = dst->size;
378 sbitmap_ptr dstp = dst->elms;
379 sbitmap_ptr ap = a->elms;
380 sbitmap_ptr bp = b->elms;
381 SBITMAP_ELT_TYPE changed = 0;
383 for (i = 0; i < n; i++)
385 SBITMAP_ELT_TYPE tmp = *ap++ ^ *bp++;
386 changed |= *dstp ^ tmp;
394 sbitmap_a_xor_b (sbitmap dst, sbitmap a, sbitmap b)
396 unsigned int i, n = dst->size;
397 sbitmap_ptr dstp = dst->elms;
398 sbitmap_ptr ap = a->elms;
399 sbitmap_ptr bp = b->elms;
401 for (i = 0; i < n; i++)
402 *dstp++ = *ap++ ^ *bp++;
405 /* Set DST to be (A or B)).
406 Return nonzero if any change is made. */
409 sbitmap_a_or_b_cg (sbitmap dst, sbitmap a, sbitmap b)
411 unsigned int i, n = dst->size;
412 sbitmap_ptr dstp = dst->elms;
413 sbitmap_ptr ap = a->elms;
414 sbitmap_ptr bp = b->elms;
415 SBITMAP_ELT_TYPE changed = 0;
417 for (i = 0; i < n; i++)
419 SBITMAP_ELT_TYPE tmp = *ap++ | *bp++;
420 changed |= *dstp ^ tmp;
428 sbitmap_a_or_b (sbitmap dst, sbitmap a, sbitmap b)
430 unsigned int i, n = dst->size;
431 sbitmap_ptr dstp = dst->elms;
432 sbitmap_ptr ap = a->elms;
433 sbitmap_ptr bp = b->elms;
435 for (i = 0; i < n; i++)
436 *dstp++ = *ap++ | *bp++;
439 /* Return nonzero if A is a subset of B. */
442 sbitmap_a_subset_b_p (sbitmap a, sbitmap b)
444 unsigned int i, n = a->size;
447 for (ap = a->elms, bp = b->elms, i = 0; i < n; i++, ap++, bp++)
448 if ((*ap | *bp) != *bp)
454 /* Set DST to be (A or (B and C)).
455 Return nonzero if any change is made. */
458 sbitmap_a_or_b_and_c_cg (sbitmap dst, sbitmap a, sbitmap b, sbitmap c)
460 unsigned int i, n = dst->size;
461 sbitmap_ptr dstp = dst->elms;
462 sbitmap_ptr ap = a->elms;
463 sbitmap_ptr bp = b->elms;
464 sbitmap_ptr cp = c->elms;
465 SBITMAP_ELT_TYPE changed = 0;
467 for (i = 0; i < n; i++)
469 SBITMAP_ELT_TYPE tmp = *ap++ | (*bp++ & *cp++);
470 changed |= *dstp ^ tmp;
478 sbitmap_a_or_b_and_c (sbitmap dst, sbitmap a, sbitmap b, sbitmap c)
480 unsigned int i, n = dst->size;
481 sbitmap_ptr dstp = dst->elms;
482 sbitmap_ptr ap = a->elms;
483 sbitmap_ptr bp = b->elms;
484 sbitmap_ptr cp = c->elms;
486 for (i = 0; i < n; i++)
487 *dstp++ = *ap++ | (*bp++ & *cp++);
490 /* Set DST to be (A and (B or C)).
491 Return nonzero if any change is made. */
494 sbitmap_a_and_b_or_c_cg (sbitmap dst, sbitmap a, sbitmap b, sbitmap c)
496 unsigned int i, n = dst->size;
497 sbitmap_ptr dstp = dst->elms;
498 sbitmap_ptr ap = a->elms;
499 sbitmap_ptr bp = b->elms;
500 sbitmap_ptr cp = c->elms;
501 SBITMAP_ELT_TYPE changed = 0;
503 for (i = 0; i < n; i++)
505 SBITMAP_ELT_TYPE tmp = *ap++ & (*bp++ | *cp++);
506 changed |= *dstp ^ tmp;
514 sbitmap_a_and_b_or_c (sbitmap dst, sbitmap a, sbitmap b, sbitmap c)
516 unsigned int i, n = dst->size;
517 sbitmap_ptr dstp = dst->elms;
518 sbitmap_ptr ap = a->elms;
519 sbitmap_ptr bp = b->elms;
520 sbitmap_ptr cp = c->elms;
522 for (i = 0; i < n; i++)
523 *dstp++ = *ap++ & (*bp++ | *cp++);
527 /* Set the bitmap DST to the intersection of SRC of successors of
528 block number BB, using the new flow graph structures. */
531 sbitmap_intersection_of_succs (sbitmap dst, sbitmap *src, int bb)
533 basic_block b = BASIC_BLOCK (bb);
534 unsigned int set_size = dst->size;
538 for (e = NULL, ix = 0; ix < EDGE_COUNT (b->succs); ix++)
540 e = EDGE_SUCC (b, ix);
541 if (e->dest == EXIT_BLOCK_PTR)
544 sbitmap_copy (dst, src[e->dest->index]);
551 for (++ix; ix < EDGE_COUNT (b->succs); ix++)
556 e = EDGE_SUCC (b, ix);
557 if (e->dest == EXIT_BLOCK_PTR)
560 p = src[e->dest->index]->elms;
562 for (i = 0; i < set_size; i++)
567 /* Set the bitmap DST to the intersection of SRC of predecessors of
568 block number BB, using the new flow graph structures. */
571 sbitmap_intersection_of_preds (sbitmap dst, sbitmap *src, int bb)
573 basic_block b = BASIC_BLOCK (bb);
574 unsigned int set_size = dst->size;
578 for (e = NULL, ix = 0; ix < EDGE_COUNT (b->preds); ix++)
580 e = EDGE_PRED (b, ix);
581 if (e->src == ENTRY_BLOCK_PTR)
584 sbitmap_copy (dst, src[e->src->index]);
591 for (++ix; ix < EDGE_COUNT (b->preds); ix++)
596 e = EDGE_PRED (b, ix);
597 if (e->src == ENTRY_BLOCK_PTR)
600 p = src[e->src->index]->elms;
602 for (i = 0; i < set_size; i++)
607 /* Set the bitmap DST to the union of SRC of successors of
608 block number BB, using the new flow graph structures. */
611 sbitmap_union_of_succs (sbitmap dst, sbitmap *src, int bb)
613 basic_block b = BASIC_BLOCK (bb);
614 unsigned int set_size = dst->size;
618 for (ix = 0; ix < EDGE_COUNT (b->succs); ix++)
620 e = EDGE_SUCC (b, ix);
621 if (e->dest == EXIT_BLOCK_PTR)
624 sbitmap_copy (dst, src[e->dest->index]);
628 if (ix == EDGE_COUNT (b->succs))
631 for (ix++; ix < EDGE_COUNT (b->succs); ix++)
636 e = EDGE_SUCC (b, ix);
637 if (e->dest == EXIT_BLOCK_PTR)
640 p = src[e->dest->index]->elms;
642 for (i = 0; i < set_size; i++)
647 /* Set the bitmap DST to the union of SRC of predecessors of
648 block number BB, using the new flow graph structures. */
651 sbitmap_union_of_preds (sbitmap dst, sbitmap *src, int bb)
653 basic_block b = BASIC_BLOCK (bb);
654 unsigned int set_size = dst->size;
658 for (ix = 0; ix < EDGE_COUNT (b->preds); ix++)
660 e = EDGE_PRED (b, ix);
661 if (e->src== ENTRY_BLOCK_PTR)
664 sbitmap_copy (dst, src[e->src->index]);
668 if (ix == EDGE_COUNT (b->preds))
671 for (ix++; ix < EDGE_COUNT (b->preds); ix++)
676 e = EDGE_PRED (b, ix);
677 if (e->src == ENTRY_BLOCK_PTR)
680 p = src[e->src->index]->elms;
682 for (i = 0; i < set_size; i++)
688 /* Return number of first bit set in the bitmap, -1 if none. */
691 sbitmap_first_set_bit (sbitmap bmap)
694 sbitmap_iterator sbi;
696 EXECUTE_IF_SET_IN_SBITMAP (bmap, 0, n, sbi)
701 /* Return number of last bit set in the bitmap, -1 if none. */
704 sbitmap_last_set_bit (sbitmap bmap)
707 SBITMAP_ELT_TYPE *ptr = bmap->elms;
709 for (i = bmap->size - 1; i >= 0; i--)
711 SBITMAP_ELT_TYPE word = ptr[i];
715 unsigned int index = (i + 1) * SBITMAP_ELT_BITS - 1;
716 SBITMAP_ELT_TYPE mask
717 = (SBITMAP_ELT_TYPE) 1 << (SBITMAP_ELT_BITS - 1);
721 if ((word & mask) != 0)
734 dump_sbitmap (FILE *file, sbitmap bmap)
736 unsigned int i, n, j;
737 unsigned int set_size = bmap->size;
738 unsigned int total_bits = bmap->n_bits;
741 for (i = n = 0; i < set_size && n < total_bits; i++)
742 for (j = 0; j < SBITMAP_ELT_BITS && n < total_bits; j++, n++)
744 if (n != 0 && n % 10 == 0)
748 (bmap->elms[i] & ((SBITMAP_ELT_TYPE) 1 << j)) != 0);
751 fprintf (file, "\n");
755 dump_sbitmap_file (FILE *file, sbitmap bmap)
759 fprintf (file, "n_bits = %d, set = {", bmap->n_bits);
761 for (pos = 30, i = 0; i < bmap->n_bits; i++)
762 if (TEST_BIT (bmap, i))
766 fprintf (file, "\n ");
770 fprintf (file, "%d ", i);
771 pos += 2 + (i >= 10) + (i >= 100) + (i >= 1000);
774 fprintf (file, "}\n");
778 debug_sbitmap (sbitmap bmap)
780 dump_sbitmap_file (stderr, bmap);
784 dump_sbitmap_vector (FILE *file, const char *title, const char *subtitle,
785 sbitmap *bmaps, int n_maps)
789 fprintf (file, "%s\n", title);
790 for (bb = 0; bb < n_maps; bb++)
792 fprintf (file, "%s %d\n", subtitle, bb);
793 dump_sbitmap (file, bmaps[bb]);
796 fprintf (file, "\n");