gcc/sbitmap.c

   1 /* Simple bitmaps.
   2    Copyright (C) 1999, 2000, 2002, 2003 Free Software Foundation, Inc.
   3
   4 This file is part of GCC.
   5
   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
   9 version.
  10
  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
  14 for more details.
  15
  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
  19 02111-1307, USA.  */
  20
  21 #include "config.h"
  22 #include "system.h"
  23 #include "coretypes.h"
  24 #include "tm.h"
  25 #include "rtl.h"
  26 #include "flags.h"
  27 #include "hard-reg-set.h"
  28 #include "basic-block.h"
  29
  30 /* Bitmap manipulation routines.  */
  31
  32 /* Allocate a simple bitmap of N_ELMS bits.  */
  33
  34 sbitmap
  35 sbitmap_alloc (unsigned int n_elms)
  36 {
  37   unsigned int bytes, size, amt;
  38   sbitmap bmap;
  39
  40   size = SBITMAP_SET_SIZE (n_elms);
  41   bytes = size * sizeof (SBITMAP_ELT_TYPE);
  42   amt = (sizeof (struct simple_bitmap_def)
  43          + bytes - sizeof (SBITMAP_ELT_TYPE));
  44   bmap = xmalloc (amt);
  45   bmap->n_bits = n_elms;
  46   bmap->size = size;
  47   bmap->bytes = bytes;
  48   return bmap;
  49 }
  50
  51 /* Resize a simple bitmap BMAP to N_ELMS bits.  If increasing the
  52    size of BMAP, clear the new bits to zero if the DEF argument
  53    is zero, and set them to one otherwise.  */
  54
  55 sbitmap
  56 sbitmap_resize (sbitmap bmap, unsigned int n_elms, int def)
  57 {
  58   unsigned int bytes, size, amt;
  59   unsigned int last_bit;
  60
  61   size = SBITMAP_SET_SIZE (n_elms);
  62   bytes = size * sizeof (SBITMAP_ELT_TYPE);
  63   if (bytes > bmap->bytes)
  64     {
  65       amt = (sizeof (struct simple_bitmap_def)
  66             + bytes - sizeof (SBITMAP_ELT_TYPE));
  67       bmap = xrealloc (bmap, amt);
  68     }
  69
  70   if (n_elms > bmap->n_bits)
  71     {
  72       if (def)
  73         {
  74           memset (bmap->elms + bmap->size, -1, bytes - bmap->bytes);
  75
  76           /* Set the new bits if the original last element.  */
  77           last_bit = bmap->n_bits % SBITMAP_ELT_BITS;
  78           if (last_bit)
  79             bmap->elms[bmap->size - 1]
  80               |= ~((SBITMAP_ELT_TYPE)-1 >> (SBITMAP_ELT_BITS - last_bit));
  81
  82           /* Clear the unused bit in the new last element.  */
  83           last_bit = n_elms % SBITMAP_ELT_BITS;
  84           if (last_bit)
  85             bmap->elms[size - 1]
  86               &= (SBITMAP_ELT_TYPE)-1 >> (SBITMAP_ELT_BITS - last_bit);
  87         }
  88       else
  89         memset (bmap->elms + bmap->size, 0, bytes - bmap->bytes);
  90     }
  91   else if (n_elms < bmap->n_bits)
  92     {
  93       /* Clear the surplus bits in the last word.  */
  94       last_bit = n_elms % SBITMAP_ELT_BITS;
  95       if (last_bit)
  96         bmap->elms[size - 1]
  97           &= (SBITMAP_ELT_TYPE)-1 >> (SBITMAP_ELT_BITS - last_bit);
  98     }
  99
 100   bmap->n_bits = n_elms;
 101   bmap->size = size;
 102   bmap->bytes = bytes;
 103   return bmap;
 104 }
 105
 106 /* Re-allocate a simple bitmap of N_ELMS bits. New storage is uninitialized.   */
 107
 108 sbitmap
 109 sbitmap_realloc (sbitmap src, unsigned int n_elms)
 110 {
 111   unsigned int bytes, size, amt;
 112   sbitmap bmap;
 113
 114   size = SBITMAP_SET_SIZE (n_elms);
 115   bytes = size * sizeof (SBITMAP_ELT_TYPE);
 116   amt = (sizeof (struct simple_bitmap_def)
 117          + bytes - sizeof (SBITMAP_ELT_TYPE));
 118
 119   if (src->bytes  >= bytes)
 120     {
 121       src->n_bits = n_elms;
 122       return src;
 123     }
 124
 125   bmap = (sbitmap) xrealloc (src, amt);
 126   bmap->n_bits = n_elms;
 127   bmap->size = size;
 128   bmap->bytes = bytes;
 129   return bmap;
 130 }
 131
 132 /* Allocate a vector of N_VECS bitmaps of N_ELMS bits.  */
 133
 134 sbitmap *
 135 sbitmap_vector_alloc (unsigned int n_vecs, unsigned int n_elms)
 136 {
 137   unsigned int i, bytes, offset, elm_bytes, size, amt, vector_bytes;
 138   sbitmap *bitmap_vector;
 139
 140   size = SBITMAP_SET_SIZE (n_elms);
 141   bytes = size * sizeof (SBITMAP_ELT_TYPE);
 142   elm_bytes = (sizeof (struct simple_bitmap_def)
 143                + bytes - sizeof (SBITMAP_ELT_TYPE));
 144   vector_bytes = n_vecs * sizeof (sbitmap *);
 145
 146   /* Round up `vector_bytes' to account for the alignment requirements
 147      of an sbitmap.  One could allocate the vector-table and set of sbitmaps
 148      separately, but that requires maintaining two pointers or creating
 149      a cover struct to hold both pointers (so our result is still just
 150      one pointer).  Neither is a bad idea, but this is simpler for now.  */
 151   {
 152     /* Based on DEFAULT_ALIGNMENT computation in obstack.c.  */
 153     struct { char x; SBITMAP_ELT_TYPE y; } align;
 154     int alignment = (char *) & align.y - & align.x;
 155     vector_bytes = (vector_bytes + alignment - 1) & ~ (alignment - 1);
 156   }
 157
 158   amt = vector_bytes + (n_vecs * elm_bytes);
 159   bitmap_vector = xmalloc (amt);
 160
 161   for (i = 0, offset = vector_bytes; i < n_vecs; i++, offset += elm_bytes)
 162     {
 163       sbitmap b = (sbitmap) ((char *) bitmap_vector + offset);
 164
 165       bitmap_vector[i] = b;
 166       b->n_bits = n_elms;
 167       b->size = size;
 168       b->bytes = bytes;
 169     }
 170
 171   return bitmap_vector;
 172 }
 173
 174 /* Copy sbitmap SRC to DST.  */
 175
 176 void
 177 sbitmap_copy (sbitmap dst, sbitmap src)
 178 {
 179   memcpy (dst->elms, src->elms, sizeof (SBITMAP_ELT_TYPE) * dst->size);
 180 }
 181
 182 /* Determine if a == b.  */
 183 int
 184 sbitmap_equal (sbitmap a, sbitmap b)
 185 {
 186   return !memcmp (a->elms, b->elms, sizeof (SBITMAP_ELT_TYPE) * a->size);
 187 }
 188
 189 /* Zero all elements in a bitmap.  */
 190
 191 void
 192 sbitmap_zero (sbitmap bmap)
 193 {
 194   memset (bmap->elms, 0, bmap->bytes);
 195 }
 196
 197 /* Set all elements in a bitmap to ones.  */
 198
 199 void
 200 sbitmap_ones (sbitmap bmap)
 201 {
 202   unsigned int last_bit;
 203
 204   memset (bmap->elms, -1, bmap->bytes);
 205
 206   last_bit = bmap->n_bits % SBITMAP_ELT_BITS;
 207   if (last_bit)
 208     bmap->elms[bmap->size - 1]
 209       = (SBITMAP_ELT_TYPE)-1 >> (SBITMAP_ELT_BITS - last_bit);
 210 }
 211
 212 /* Zero a vector of N_VECS bitmaps.  */
 213
 214 void
 215 sbitmap_vector_zero (sbitmap *bmap, unsigned int n_vecs)
 216 {
 217   unsigned int i;
 218
 219   for (i = 0; i < n_vecs; i++)
 220     sbitmap_zero (bmap[i]);
 221 }
 222
 223 /* Set a vector of N_VECS bitmaps to ones.  */
 224
 225 void
 226 sbitmap_vector_ones (sbitmap *bmap, unsigned int n_vecs)
 227 {
 228   unsigned int i;
 229
 230   for (i = 0; i < n_vecs; i++)
 231     sbitmap_ones (bmap[i]);
 232 }
 233
 234 /* Set DST to be A union (B - C).
 235    DST = A | (B & ~C).
 236    Returns true if any change is made.  */
 237
 238 bool
 239 sbitmap_union_of_diff_cg (sbitmap dst, sbitmap a, sbitmap b, sbitmap c)
 240 {
 241   unsigned int i, n = dst->size;
 242   sbitmap_ptr dstp = dst->elms;
 243   sbitmap_ptr ap = a->elms;
 244   sbitmap_ptr bp = b->elms;
 245   sbitmap_ptr cp = c->elms;
 246   SBITMAP_ELT_TYPE changed = 0;
 247
 248   for (i = 0; i < n; i++)
 249     {
 250       SBITMAP_ELT_TYPE tmp = *ap++ | (*bp++ & ~*cp++);
 251       changed |= *dstp ^ tmp;
 252       *dstp++ = tmp;
 253     }
 254
 255   return changed != 0;
 256 }
 257
 258 void
 259 sbitmap_union_of_diff (sbitmap dst, sbitmap a, sbitmap b, sbitmap c)
 260 {
 261   unsigned int i, n = dst->size;
 262   sbitmap_ptr dstp = dst->elms;
 263   sbitmap_ptr ap = a->elms;
 264   sbitmap_ptr bp = b->elms;
 265   sbitmap_ptr cp = c->elms;
 266
 267   for (i = 0; i < n; i++)
 268     *dstp++ = *ap++ | (*bp++ & ~*cp++);
 269 }
 270
 271 /* Set bitmap DST to the bitwise negation of the bitmap SRC.  */
 272
 273 void
 274 sbitmap_not (sbitmap dst, sbitmap src)
 275 {
 276   unsigned int i, n = dst->size;
 277   sbitmap_ptr dstp = dst->elms;
 278   sbitmap_ptr srcp = src->elms;
 279   unsigned int last_bit;
 280
 281   for (i = 0; i < n; i++)
 282     *dstp++ = ~*srcp++;
 283
 284   /* Zero all bits past n_bits, by ANDing dst with sbitmap_ones.  */
 285   last_bit = src->n_bits % SBITMAP_ELT_BITS;
 286   if (last_bit)
 287     dst->elms[n-1] = dst->elms[n-1]
 288       & ((SBITMAP_ELT_TYPE)-1 >> (SBITMAP_ELT_BITS - last_bit));
 289 }
 290
 291 /* Set the bits in DST to be the difference between the bits
 292    in A and the bits in B. i.e. dst = a & (~b).  */
 293
 294 void
 295 sbitmap_difference (sbitmap dst, sbitmap a, sbitmap b)
 296 {
 297   unsigned int i, dst_size = dst->size;
 298   unsigned int min_size = dst->size;
 299   sbitmap_ptr dstp = dst->elms;
 300   sbitmap_ptr ap = a->elms;
 301   sbitmap_ptr bp = b->elms;
 302
 303   /* A should be at least as large as DEST, to have a defined source.  */
 304   if (a->size < dst_size)
 305     abort ();
 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)
 309     min_size = b->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++)
 316       *dstp++ = *ap++;
 317 }
 318
 319 /* Set DST to be (A and B).
 320    Return nonzero if any change is made.  */
 321
 322 bool
 323 sbitmap_a_and_b_cg (sbitmap dst, sbitmap a, sbitmap b)
 324 {
 325   unsigned int i, n = dst->size;
 326   sbitmap_ptr dstp = dst->elms;
 327   sbitmap_ptr ap = a->elms;
 328   sbitmap_ptr bp = b->elms;
 329   SBITMAP_ELT_TYPE changed = 0;
 330
 331   for (i = 0; i < n; i++)
 332     {
 333       SBITMAP_ELT_TYPE tmp = *ap++ & *bp++;
 334       changed |= *dstp ^ tmp;
 335       *dstp++ = tmp;
 336     }
 337
 338   return changed != 0;
 339 }
 340
 341 void
 342 sbitmap_a_and_b (sbitmap dst, sbitmap a, sbitmap b)
 343 {
 344   unsigned int i, n = dst->size;
 345   sbitmap_ptr dstp = dst->elms;
 346   sbitmap_ptr ap = a->elms;
 347   sbitmap_ptr bp = b->elms;
 348
 349   for (i = 0; i < n; i++)
 350     *dstp++ = *ap++ & *bp++;
 351 }
 352
 353 /* Set DST to be (A xor B)).
 354    Return nonzero if any change is made.  */
 355
 356 bool
 357 sbitmap_a_xor_b_cg (sbitmap dst, sbitmap a, sbitmap b)
 358 {
 359   unsigned int i, n = dst->size;
 360   sbitmap_ptr dstp = dst->elms;
 361   sbitmap_ptr ap = a->elms;
 362   sbitmap_ptr bp = b->elms;
 363   SBITMAP_ELT_TYPE changed = 0;
 364
 365   for (i = 0; i < n; i++)
 366     {
 367       SBITMAP_ELT_TYPE tmp = *ap++ ^ *bp++;
 368       changed |= *dstp ^ tmp;
 369       *dstp++ = tmp;
 370     }
 371
 372   return changed != 0;
 373 }
 374
 375 void
 376 sbitmap_a_xor_b (sbitmap dst, sbitmap a, sbitmap b)
 377 {
 378   unsigned int i, n = dst->size;
 379   sbitmap_ptr dstp = dst->elms;
 380   sbitmap_ptr ap = a->elms;
 381   sbitmap_ptr bp = b->elms;
 382
 383   for (i = 0; i < n; i++)
 384     *dstp++ = *ap++ ^ *bp++;
 385 }
 386
 387 /* Set DST to be (A or B)).
 388    Return nonzero if any change is made.  */
 389
 390 bool
 391 sbitmap_a_or_b_cg (sbitmap dst, sbitmap a, sbitmap b)
 392 {
 393   unsigned int i, n = dst->size;
 394   sbitmap_ptr dstp = dst->elms;
 395   sbitmap_ptr ap = a->elms;
 396   sbitmap_ptr bp = b->elms;
 397   SBITMAP_ELT_TYPE changed = 0;
 398
 399   for (i = 0; i < n; i++)
 400     {
 401       SBITMAP_ELT_TYPE tmp = *ap++ | *bp++;
 402       changed |= *dstp ^ tmp;
 403       *dstp++ = tmp;
 404     }
 405
 406   return changed != 0;
 407 }
 408
 409 void
 410 sbitmap_a_or_b (sbitmap dst, sbitmap a, sbitmap b)
 411 {
 412   unsigned int i, n = dst->size;
 413   sbitmap_ptr dstp = dst->elms;
 414   sbitmap_ptr ap = a->elms;
 415   sbitmap_ptr bp = b->elms;
 416
 417   for (i = 0; i < n; i++)
 418     *dstp++ = *ap++ | *bp++;
 419 }
 420
 421 /* Return nonzero if A is a subset of B.  */
 422
 423 bool
 424 sbitmap_a_subset_b_p (sbitmap a, sbitmap b)
 425 {
 426   unsigned int i, n = a->size;
 427   sbitmap_ptr ap, bp;
 428
 429   for (ap = a->elms, bp = b->elms, i = 0; i < n; i++, ap++, bp++)
 430     if ((*ap | *bp) != *bp)
 431       return false;
 432
 433   return true;
 434 }
 435
 436 /* Set DST to be (A or (B and C)).
 437    Return nonzero if any change is made.  */
 438
 439 bool
 440 sbitmap_a_or_b_and_c_cg (sbitmap dst, sbitmap a, sbitmap b, sbitmap c)
 441 {
 442   unsigned int i, n = dst->size;
 443   sbitmap_ptr dstp = dst->elms;
 444   sbitmap_ptr ap = a->elms;
 445   sbitmap_ptr bp = b->elms;
 446   sbitmap_ptr cp = c->elms;
 447   SBITMAP_ELT_TYPE changed = 0;
 448
 449   for (i = 0; i < n; i++)
 450     {
 451       SBITMAP_ELT_TYPE tmp = *ap++ | (*bp++ & *cp++);
 452       changed |= *dstp ^ tmp;
 453       *dstp++ = tmp;
 454     }
 455
 456   return changed != 0;
 457 }
 458
 459 void
 460 sbitmap_a_or_b_and_c (sbitmap dst, sbitmap a, sbitmap b, sbitmap c)
 461 {
 462   unsigned int i, n = dst->size;
 463   sbitmap_ptr dstp = dst->elms;
 464   sbitmap_ptr ap = a->elms;
 465   sbitmap_ptr bp = b->elms;
 466   sbitmap_ptr cp = c->elms;
 467
 468   for (i = 0; i < n; i++)
 469     *dstp++ = *ap++ | (*bp++ & *cp++);
 470 }
 471
 472 /* Set DST to be (A and (B or C)).
 473    Return nonzero if any change is made.  */
 474
 475 bool
 476 sbitmap_a_and_b_or_c_cg (sbitmap dst, sbitmap a, sbitmap b, sbitmap c)
 477 {
 478   unsigned int i, n = dst->size;
 479   sbitmap_ptr dstp = dst->elms;
 480   sbitmap_ptr ap = a->elms;
 481   sbitmap_ptr bp = b->elms;
 482   sbitmap_ptr cp = c->elms;
 483   SBITMAP_ELT_TYPE changed = 0;
 484
 485   for (i = 0; i < n; i++)
 486     {
 487       SBITMAP_ELT_TYPE tmp = *ap++ & (*bp++ | *cp++);
 488       changed |= *dstp ^ tmp;
 489       *dstp++ = tmp;
 490     }
 491
 492   return changed != 0;
 493 }
 494
 495 void
 496 sbitmap_a_and_b_or_c (sbitmap dst, sbitmap a, sbitmap b, sbitmap c)
 497 {
 498   unsigned int i, n = dst->size;
 499   sbitmap_ptr dstp = dst->elms;
 500   sbitmap_ptr ap = a->elms;
 501   sbitmap_ptr bp = b->elms;
 502   sbitmap_ptr cp = c->elms;
 503
 504   for (i = 0; i < n; i++)
 505     *dstp++ = *ap++ & (*bp++ | *cp++);
 506 }
 507
 508 #ifdef IN_GCC
 509 /* Set the bitmap DST to the intersection of SRC of successors of
 510    block number BB, using the new flow graph structures.  */
 511
 512 void
 513 sbitmap_intersection_of_succs (sbitmap dst, sbitmap *src, int bb)
 514 {
 515   basic_block b = BASIC_BLOCK (bb);
 516   unsigned int set_size = dst->size;
 517   edge e;
 518   unsigned ix;
 519
 520   for (ix = 0; ix < EDGE_COUNT (b->succs); ix++)
 521     {
 522       e = EDGE_SUCC (b, ix);
 523       if (e->dest == EXIT_BLOCK_PTR)
 524         continue;
 525
 526       sbitmap_copy (dst, src[e->dest->index]);
 527       break;
 528     }
 529
 530   if (!e)
 531     sbitmap_ones (dst);
 532   else
 533     for (++ix; ix < EDGE_COUNT (b->succs); ix++)
 534       {
 535         unsigned int i;
 536         sbitmap_ptr p, r;
 537
 538         e = EDGE_SUCC (b, ix);
 539         if (e->dest == EXIT_BLOCK_PTR)
 540           continue;
 541
 542         p = src[e->dest->index]->elms;
 543         r = dst->elms;
 544         for (i = 0; i < set_size; i++)
 545           *r++ &= *p++;
 546       }
 547 }
 548
 549 /* Set the bitmap DST to the intersection of SRC of predecessors of
 550    block number BB, using the new flow graph structures.  */
 551
 552 void
 553 sbitmap_intersection_of_preds (sbitmap dst, sbitmap *src, int bb)
 554 {
 555   basic_block b = BASIC_BLOCK (bb);
 556   unsigned int set_size = dst->size;
 557   edge e;
 558   unsigned ix;
 559
 560   for (ix = 0; ix < EDGE_COUNT (b->preds); ix++)
 561     {
 562       e = EDGE_PRED (b, ix);
 563       if (e->src == ENTRY_BLOCK_PTR)
 564         continue;
 565
 566       sbitmap_copy (dst, src[e->src->index]);
 567       break;
 568     }
 569
 570   if (!e)
 571     sbitmap_ones (dst);
 572   else
 573     for (++ix; ix < EDGE_COUNT (b->preds); ix++)
 574       {
 575         unsigned int i;
 576         sbitmap_ptr p, r;
 577
 578         e = EDGE_PRED (b, ix);
 579         if (e->src == ENTRY_BLOCK_PTR)
 580           continue;
 581
 582         p = src[e->src->index]->elms;
 583         r = dst->elms;
 584         for (i = 0; i < set_size; i++)
 585           *r++ &= *p++;
 586       }
 587 }
 588
 589 /* Set the bitmap DST to the union of SRC of successors of
 590    block number BB, using the new flow graph structures.  */
 591
 592 void
 593 sbitmap_union_of_succs (sbitmap dst, sbitmap *src, int bb)
 594 {
 595   basic_block b = BASIC_BLOCK (bb);
 596   unsigned int set_size = dst->size;
 597   edge e;
 598   unsigned ix;
 599
 600   for (ix = 0; ix < EDGE_COUNT (b->succs); ix++)
 601     {
 602       e = EDGE_SUCC (b, ix);
 603       if (e->dest == EXIT_BLOCK_PTR)
 604         continue;
 605
 606       sbitmap_copy (dst, src[e->dest->index]);
 607       break;
 608     }
 609
 610   if (ix == EDGE_COUNT (b->succs))
 611     sbitmap_zero (dst);
 612   else
 613     for (ix++; ix < EDGE_COUNT (b->succs); ix++)
 614       {
 615         unsigned int i;
 616         sbitmap_ptr p, r;
 617
 618         e = EDGE_SUCC (b, ix);
 619         if (e->dest == EXIT_BLOCK_PTR)
 620           continue;
 621
 622         p = src[e->dest->index]->elms;
 623         r = dst->elms;
 624         for (i = 0; i < set_size; i++)
 625           *r++ |= *p++;
 626       }
 627 }
 628
 629 /* Set the bitmap DST to the union of SRC of predecessors of
 630    block number BB, using the new flow graph structures.  */
 631
 632 void
 633 sbitmap_union_of_preds (sbitmap dst, sbitmap *src, int bb)
 634 {
 635   basic_block b = BASIC_BLOCK (bb);
 636   unsigned int set_size = dst->size;
 637   edge e;
 638   unsigned ix;
 639
 640   for (ix = 0; ix < EDGE_COUNT (b->preds); ix++)
 641     {
 642       if (e->src== ENTRY_BLOCK_PTR)
 643         continue;
 644
 645       sbitmap_copy (dst, src[e->src->index]);
 646       break;
 647     }
 648
 649   if (ix == EDGE_COUNT (b->preds))
 650     sbitmap_zero (dst);
 651   else
 652     for (ix++; ix < EDGE_COUNT (b->preds); ix++)
 653       {
 654         unsigned int i;
 655         sbitmap_ptr p, r;
 656
 657         e = EDGE_PRED (b, ix);
 658         if (e->src == ENTRY_BLOCK_PTR)
 659           continue;
 660
 661         p = src[e->src->index]->elms;
 662         r = dst->elms;
 663         for (i = 0; i < set_size; i++)
 664           *r++ |= *p++;
 665       }
 666 }
 667 #endif
 668
 669 /* Return number of first bit set in the bitmap, -1 if none.  */
 670
 671 int
 672 sbitmap_first_set_bit (sbitmap bmap)
 673 {
 674   unsigned int n;
 675
 676   EXECUTE_IF_SET_IN_SBITMAP (bmap, 0, n, { return n; });
 677   return -1;
 678 }
 679
 680 /* Return number of last bit set in the bitmap, -1 if none.  */
 681
 682 int
 683 sbitmap_last_set_bit (sbitmap bmap)
 684 {
 685   int i;
 686   SBITMAP_ELT_TYPE *ptr = bmap->elms;
 687
 688   for (i = bmap->size - 1; i >= 0; i--)
 689     {
 690       SBITMAP_ELT_TYPE word = ptr[i];
 691
 692       if (word != 0)
 693         {
 694           unsigned int index = (i + 1) * SBITMAP_ELT_BITS - 1;
 695           SBITMAP_ELT_TYPE mask
 696             = (SBITMAP_ELT_TYPE) 1 << (SBITMAP_ELT_BITS - 1);
 697
 698           while (1)
 699             {
 700               if ((word & mask) != 0)
 701                 return index;
 702
 703               mask >>= 1;
 704               index--;
 705             }
 706         }
 707     }
 708
 709   return -1;
 710 }
 711
 712 void
 713 dump_sbitmap (FILE *file, sbitmap bmap)
 714 {
 715   unsigned int i, n, j;
 716   unsigned int set_size = bmap->size;
 717   unsigned int total_bits = bmap->n_bits;
 718
 719   fprintf (file, "  ");
 720   for (i = n = 0; i < set_size && n < total_bits; i++)
 721     for (j = 0; j < SBITMAP_ELT_BITS && n < total_bits; j++, n++)
 722       {
 723         if (n != 0 && n % 10 == 0)
 724           fprintf (file, " ");
 725
 726         fprintf (file, "%d",
 727                  (bmap->elms[i] & ((SBITMAP_ELT_TYPE) 1 << j)) != 0);
 728       }
 729
 730   fprintf (file, "\n");
 731 }
 732
 733 void
 734 dump_sbitmap_file (FILE *file, sbitmap bmap)
 735 {
 736   unsigned int i, pos;
 737
 738   fprintf (file, "n_bits = %d, set = {", bmap->n_bits);
 739
 740   for (pos = 30, i = 0; i < bmap->n_bits; i++)
 741     if (TEST_BIT (bmap, i))
 742       {
 743         if (pos > 70)
 744           {
 745             fprintf (file, "\n  ");
 746             pos = 0;
 747           }
 748
 749         fprintf (file, "%d ", i);
 750         pos += 2 + (i >= 10) + (i >= 100) + (i >= 1000);
 751       }
 752
 753   fprintf (file, "}\n");
 754 }
 755
 756 void
 757 debug_sbitmap (sbitmap bmap)
 758 {
 759   dump_sbitmap_file (stderr, bmap);
 760 }
 761
 762 void
 763 dump_sbitmap_vector (FILE *file, const char *title, const char *subtitle,
 764                      sbitmap *bmaps, int n_maps)
 765 {
 766   int bb;
 767
 768   fprintf (file, "%s\n", title);
 769   for (bb = 0; bb < n_maps; bb++)
 770     {
 771       fprintf (file, "%s %d\n", subtitle, bb);
 772       dump_sbitmap (file, bmaps[bb]);
 773     }
 774
 775   fprintf (file, "\n");
 776 }