reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

include/llvm/ADT/SparseBitVector.h
   58     memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
   64     memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
   72       if (Bits[i] != RHS.Bits[i])
   72       if (Bits[i] != RHS.Bits[i])
   84     return Bits[Idx];
   93       if (Bits[i])
   99     Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE);
  112     Bits[Idx / BITWORD_SIZE] &= ~(1L << (Idx % BITWORD_SIZE));
  116     return Bits[Idx / BITWORD_SIZE] & (1L << (Idx % BITWORD_SIZE));
  122       NumBits += countPopulation(Bits[i]);
  129       if (Bits[i] != 0)
  130         return i * BITWORD_SIZE + countTrailingZeros(Bits[i]);
  138       if (Bits[Idx] != 0)
  140                countLeadingZeros(Bits[Idx]) - 1;
  153     BitWord Copy = Bits[WordPos];
  165       if (Bits[i] != 0)
  166         return i * BITWORD_SIZE + countTrailingZeros(Bits[i]);
  174       BitWord old = changed ? 0 : Bits[i];
  176       Bits[i] |= RHS.Bits[i];
  176       Bits[i] |= RHS.Bits[i];
  177       if (!changed && old != Bits[i])
  186       if (RHS.Bits[i] & Bits[i])
  186       if (RHS.Bits[i] & Bits[i])
  201       BitWord old = changed ? 0 : Bits[i];
  203       Bits[i] &= RHS.Bits[i];
  203       Bits[i] &= RHS.Bits[i];
  204       if (Bits[i] != 0)
  207       if (!changed && old != Bits[i])
  224       BitWord old = changed ? 0 : Bits[i];
  226       Bits[i] &= ~RHS.Bits[i];
  226       Bits[i] &= ~RHS.Bits[i];
  227       if (Bits[i] != 0)
  230       if (!changed && old != Bits[i])
  246       Bits[i] = RHS1.Bits[i] & ~RHS2.Bits[i];
  246       Bits[i] = RHS1.Bits[i] & ~RHS2.Bits[i];
  246       Bits[i] = RHS1.Bits[i] & ~RHS2.Bits[i];
  247       if (Bits[i] != 0)