contrib/gcc/bitmap.c

33 bitmap_element bitmap_zero_bits;  /* An element of all zero bits.  */
100 /* Allocate a bitmap element.  The bits are cleared, but nothing else is.  */
144   memset (element->bits, 0, sizeof (element->bits));
282 /* Return nonzero if all bits in an element are zero.  */
288   return (element->bits[0] | element->bits[1]) == 0;
293     if (element->bits[i] != 0)
407       memcpy (to_elt->bits, from_ptr->bits, sizeof (to_elt->bits));
490       ptr->bits[word_num] &= ~ (((BITMAP_WORD) 1) << bit_num);
512       ptr->bits[word_num] = bit_val;
516     ptr->bits[word_num] |= bit_val;
535   return (ptr->bits[word_num] >> bit_num) & 1;
540 /* Table of number of set bits in a character, indexed by value of char.  */
565 /* Count the number of bits set in the bitmap, and return it.  */
581 	  count += __builtin_popcountl (elt->bits[ix]);
583 	  count += bitmap_popcount (elt->bits[ix]);
607       word = elt->bits[ix];
681 	      BITMAP_WORD r = a_elt->bits[ix] & b_elt->bits[ix];
683 	      dst_elt->bits[ix] = r;
731 	      BITMAP_WORD r = a_elt->bits[ix] & b_elt->bits[ix];
733 	      a_elt->bits[ix] = r;
775 	  memcpy (dst_elt->bits, a_elt->bits, sizeof (dst_elt->bits));
794 	      BITMAP_WORD r = a_elt->bits[ix] & ~b_elt->bits[ix];
796 	      dst_elt->bits[ix] = r;
849 	      BITMAP_WORD cleared = a_elt->bits[ix] & b_elt->bits[ix];
850 	      BITMAP_WORD r = a_elt->bits[ix] ^ cleared;
852 	      a_elt->bits[ix] = r;
868 /* Clear COUNT bits from START in HEAD.  */
910 	  /* Going to have to knock out some bits in this elt.  */
924 	      /* This mask should have 1s in all bits >= start position. */
959 	      elt->bits[first_word_to_mod] &= ~mask;
963 	      elt->bits[first_word_to_mod] &= ~first_mask;
965 		elt->bits[i] = 0;
966 	      elt->bits[last_word_to_mod] &= ~last_mask;
969 	    if (elt->bits[i])
974 	  /* Check to see if there are any bits left.  */
1025 	  memcpy (next->bits, b_elt->bits, sizeof (next->bits));
1037 	      BITMAP_WORD cleared = a_elt->bits[ix] & b_elt->bits[ix];
1038 	      BITMAP_WORD r = b_elt->bits[ix] ^ cleared;
1040 	      a_elt->bits[ix] = r;
1081 		  BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
1083 		  if (r != dst_elt->bits[ix])
1085 		      dst_elt->bits[ix] = r;
1099 		  BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
1101 		  dst_elt->bits[ix] = r;
1130 		if (src->bits[ix] != dst_elt->bits[ix])
1132 		    dst_elt->bits[ix] = src->bits[ix];
1143 	      memcpy (dst_elt->bits, src->bits, sizeof (dst_elt->bits));
1181 	  memcpy (dst->bits, b_elt->bits, sizeof (dst->bits));
1199 		BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
1201 		a_elt->bits[ix] = r;
1206 		BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
1208 		if (a_elt->bits[ix] != r)
1211 		    a_elt->bits[ix] = r;
1256 	      BITMAP_WORD r = a_elt->bits[ix] ^ b_elt->bits[ix];
1259 	      dst_elt->bits[ix] = r;
1289 	  memcpy (dst_elt->bits, src->bits, sizeof (dst_elt->bits));
1321 	  memcpy (dst->bits, b_elt->bits, sizeof (dst->bits));
1339 	      BITMAP_WORD r = a_elt->bits[ix] ^ b_elt->bits[ix];
1342 	      a_elt->bits[ix] = r;
1375 	if (a_elt->bits[ix] != b_elt->bits[ix])
1400 	    if (a_elt->bits[ix] & b_elt->bits[ix])
1427 	    if (a_elt->bits[ix] & ~b_elt->bits[ix])
1490 	  if ((ptr->bits[i] >> j) & 1)
1517    it does not print anything but the bits.  */
1547 	hash ^= ptr->bits[ix];