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

References

include/llvm/ADT/BitVector.h

   37     Current = Parent.find_next(Current);

include/llvm/ADT/SmallBitVector.h

  283     return getPointer()->find_next(Prev);

lib/CodeGen/GlobalMerge.cpp

  461     for (j = i; j != -1; j = GlobalSet.find_next(j)) {
  523     for (ssize_t k = i, idx = 0; k != j; k = GlobalSet.find_next(k), ++idx) {

lib/CodeGen/PrologEpilogInserter.cpp

  727        FreeStart = StackBytesFree.find_next(FreeStart)) {

lib/CodeGen/SafeStackColoring.h

  150     idx = V.find_next(idx);

lib/CodeGen/ShrinkWrap.cpp

  173            Reg = SavedRegs.find_next(Reg))

lib/CodeGen/StackColoring.cpp

  828          pos = MBBLiveness.LiveIn.find_next(pos)) {

lib/CodeGen/StackSlotColoring.cpp

  284       Color = UsedColors[StackID].find_next(Color);
  299     NextColors[StackID] = AllColors[StackID].find_next(NextColors[StackID]);
  386       NextColor = AllColors[StackID].find_next(NextColor);

lib/DebugInfo/MSF/MSFBuilder.cpp

  139     Block = FreeBlocks.find_next(Block);

lib/Target/Hexagon/HexagonBitSimplify.cpp

   90       int Next = BitVector::find_next(v2x(Prev));

lib/Target/Hexagon/HexagonFrameLowering.cpp

  322           for (int x = CSR.find_first(); x >= 0; x = CSR.find_next(x)) {
 1419   for (int x = Regs.find_first(); x >= 0; x = Regs.find_next(x)) {
 1453   for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x)) {
 1468   for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) {
 1473   for (int x = TmpSup.find_first(); x >= 0; x = TmpSup.find_next(x)) {
 1492   for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) {
 1526   for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) {
 1556   for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) {
 2443     int N = Regs.find_next(F);

lib/Target/Hexagon/HexagonGenInsert.cpp

  106       int Next = BitVector::find_next(v2x(Prev));

lib/Target/Hexagon/HexagonRegisterInfo.cpp

  173   for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x))

lib/Target/Hexagon/HexagonSplitDouble.cpp

  233   for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) {
  244   for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) {
  283   for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) {

lib/Target/Hexagon/RDFRegisters.cpp

  336   U = Units.find_next(U);
  344     U = Units.find_next(U);
  366   for (int U = Units.find_first(); U >= 0; U = Units.find_next(U))
  374   for (int U = RG.Units.find_first(); U >= 0; U = RG.Units.find_next(U)) {

lib/Target/PowerPC/PPCFrameLowering.cpp

  683     int SecondScratchReg = BV.find_next(*SR1);

tools/llvm-exegesis/lib/Uops.cpp

  143           PossibleRegsForVar[VarId].find_next(Iterators[VarId]);

unittests/ADT/BitVectorTest.cpp

   73   for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) {
  103   for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) {
  192   EXPECT_EQ(13, A.find_next(12));
  193   EXPECT_EQ(75, A.find_next(13));
  194   EXPECT_EQ(-1, A.find_next(75));
  217   EXPECT_EQ(99, A.find_next(98));
  240   EXPECT_EQ(13, A.find_next(12));
  241   EXPECT_EQ(47, A.find_next(13));
  242   EXPECT_EQ(-1, A.find_next(47));
  287   EXPECT_EQ(3, A.find_next(1));
  288   EXPECT_EQ(4, A.find_next(3));
  289   EXPECT_EQ(16, A.find_next(4));
  290   EXPECT_EQ(-1, A.find_next(16));

unittests/IR/ConstantRangeTest.cpp

 1120     int LastPos = Results.find_next(Bias) - Bias;

utils/TableGen/CodeGenDAGPatterns.cpp

 4637     for (int p = Matches.find_first(); p != -1; p = Matches.find_next(p))

utils/TableGen/CodeGenRegisters.cpp

  973          next_s = SC.find_next(s)) {