Home | History | Annotate | Download | only in gcc

Lines Matching defs:elt1

518   bitmap_element *elt1;
539 bi->elt1 = map->first;
544 /* Advance elt1 until it is not before the block containing start_bit. */
547 if (!bi->elt1)
549 bi->elt1 = &bitmap_zero_bits;
553 if (bi->elt1->indx >= start_bit / BITMAP_ELEMENT_ALL_BITS)
555 bi->elt1 = bi->elt1->next;
559 if (bi->elt1->indx != start_bit / BITMAP_ELEMENT_ALL_BITS)
560 start_bit = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
564 bi->bits = bi->elt1->bits[bi->word_no];
583 bi->elt1 = map1->first;
588 /* Advance elt1 until it is not before the block containing
592 if (!bi->elt1)
598 if (bi->elt1->indx >= start_bit / BITMAP_ELEMENT_ALL_BITS)
600 bi->elt1 = bi->elt1->next;
603 /* Advance elt2 until it is not before elt1. */
608 bi->elt1 = bi->elt2 = &bitmap_zero_bits;
612 if (bi->elt2->indx >= bi->elt1->indx)
618 if (bi->elt1->indx == bi->elt2->indx)
622 if (bi->elt1->indx != start_bit / BITMAP_ELEMENT_ALL_BITS)
623 start_bit = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
626 bi->bits = bi->elt1->bits[bi->word_no] & bi->elt2->bits[bi->word_no];
631 /* Otherwise we must immediately advance elt1, so initialize for
653 bi->elt1 = map1->first;
658 /* Advance elt1 until it is not before the block containing start_bit. */
661 if (!bi->elt1)
663 bi->elt1 = &bitmap_zero_bits;
667 if (bi->elt1->indx >= start_bit / BITMAP_ELEMENT_ALL_BITS)
669 bi->elt1 = bi->elt1->next;
672 /* Advance elt2 until it is not before elt1. */
673 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx)
678 if (bi->elt1->indx != start_bit / BITMAP_ELEMENT_ALL_BITS)
679 start_bit = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
682 bi->bits = bi->elt1->bits[bi->word_no];
683 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx)
754 bi->bits = bi->elt1->bits[bi->word_no];
762 gcc_checking_assert (bi->elt1->indx != -1U);
765 bi->elt1 = bi->elt1->next;
766 if (!bi->elt1)
768 *bit_no = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
800 bi->bits = bi->elt1->bits[bi->word_no] & bi->elt2->bits[bi->word_no];
811 gcc_checking_assert (bi->elt1->indx != -1U);
813 /* Advance elt1 while it is less than elt2. We always want
817 bi->elt1 = bi->elt1->next;
818 if (!bi->elt1)
821 while (bi->elt1->indx < bi->elt2->indx);
826 /* Advance elt2 to be no less than elt1. This might not
828 while (bi->elt2->indx < bi->elt1->indx)
835 while (bi->elt1->indx != bi->elt2->indx);
837 *bit_no = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
869 bi->bits = bi->elt1->bits[bi->word_no];
870 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx)
879 gcc_checking_assert (bi->elt1->indx != -1U);
881 /* Advance to the next element of elt1. */
882 bi->elt1 = bi->elt1->next;
883 if (!bi->elt1)
889 /* Advance elt2 until it is no less than elt1. */
890 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx)
893 *bit_no = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;