Home
last modified time | relevance | path

Searched refs:find_next (Results 1 – 25 of 80) sorted by relevance

1234

/external/llvm-project/llvm/unittests/ADT/
DBitVectorTest.cpp74 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { in TYPED_TEST()
104 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { in TYPED_TEST()
211 EXPECT_EQ(13, A.find_next(12)); in TYPED_TEST()
212 EXPECT_EQ(75, A.find_next(13)); in TYPED_TEST()
213 EXPECT_EQ(-1, A.find_next(75)); in TYPED_TEST()
236 EXPECT_EQ(99, A.find_next(98)); in TYPED_TEST()
259 EXPECT_EQ(13, A.find_next(12)); in TYPED_TEST()
260 EXPECT_EQ(47, A.find_next(13)); in TYPED_TEST()
261 EXPECT_EQ(-1, A.find_next(47)); in TYPED_TEST()
303 EXPECT_EQ(-1, A.find_next(5)); in TYPED_TEST()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
DRDFRegisters.cpp336 U = Units.find_next(U); in makeRegRef()
344 U = Units.find_next(U); in makeRegRef()
366 for (int U = Units.find_first(); U >= 0; U = Units.find_next(U)) in print()
374 for (int U = RG.Units.find_first(); U >= 0; U = RG.Units.find_next(U)) { in rr_iterator()
DHexagonGenInsert.cpp110 unsigned find_next(unsigned Prev) const { in find_next() function
111 int Next = BitVector::find_next(v2x(Prev)); in find_next()
193 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) in operator <<()
958 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) { in collectInBlock()
979 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) in collectInBlock()
989 for (unsigned VR = BlockDefs.find_first(); VR; VR = BlockDefs.find_next(VR)) in collectInBlock()
1008 for (unsigned R = Regs[S].find_first(); R; R = Regs[S].find_next(R)) { in findRemovableRegisters()
1272 for (unsigned R = Rs.find_first(); R; R = Rs.find_next(R)) { in stats()
1299 for (unsigned R = TT.find_first(); R; R = TT.find_next(R)) in selectCandidates()
1304 for (unsigned R = AllRMs.find_first(); R; R = AllRMs.find_next(R)) { in selectCandidates()
[all …]
DHexagonFrameLowering.cpp322 for (int x = CSR.find_first(); x >= 0; x = CSR.find_next(x)) { in needsStackFrame()
1453 for (int x = Regs.find_first(); x >= 0; x = Regs.find_next(x)) { in dump_registers()
1487 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x)) { in assignCalleeSavedSpillSlots()
1502 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1507 for (int x = TmpSup.find_first(); x >= 0; x = TmpSup.find_next(x)) { in assignCalleeSavedSpillSlots()
1526 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1560 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1590 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
2497 int N = Regs.find_next(F); in shouldInlineCSR()
/external/llvm-project/llvm/lib/CodeGen/
DRDFRegisters.cpp334 U = Units.find_next(U); in makeRegRef()
340 U = Units.find_next(U); in makeRegRef()
362 for (int U = Units.find_first(); U >= 0; U = Units.find_next(U)) in print()
370 for (int U = RG.Units.find_first(); U >= 0; U = RG.Units.find_next(U)) { in rr_iterator()
DStackSlotColoring.cpp286 Color = UsedColors[StackID].find_next(Color); in ColorSlot()
301 NextColors[StackID] = AllColors[StackID].find_next(NextColors[StackID]); in ColorSlot()
388 NextColor = AllColors[StackID].find_next(NextColor); in ColorSlots()
DGlobalMerge.cpp464 for (j = i; j != -1; j = GlobalSet.find_next(j)) { in doMerge()
526 for (ssize_t k = i, idx = 0; k != j; k = GlobalSet.find_next(k), ++idx) { in doMerge()
/external/swiftshader/third_party/subzero/src/
DIceBitVector.h101 int find_next(unsigned Prev) const { return find_next<0>(Prev); } in find_next() function
210 find_next(unsigned) const { in find_next() function
216 Pos<BitsElements, int>::type find_next(unsigned Prev) const {
226 return find_next<Pos + 1>(Prev);
397 int find_next(unsigned Prev) const { in find_next() function
/external/llvm-project/llvm/lib/Target/Hexagon/
DHexagonGenInsert.cpp110 unsigned find_next(unsigned Prev) const { in find_next() function
111 int Next = BitVector::find_next(v2x(Prev)); in find_next()
193 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) in operator <<()
958 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) { in collectInBlock()
979 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) in collectInBlock()
989 for (unsigned VR = BlockDefs.find_first(); VR; VR = BlockDefs.find_next(VR)) in collectInBlock()
1008 for (unsigned R = Regs[S].find_first(); R; R = Regs[S].find_next(R)) { in findRemovableRegisters()
1272 for (unsigned R = Rs.find_first(); R; R = Rs.find_next(R)) { in stats()
1299 for (unsigned R = TT.find_first(); R; R = TT.find_next(R)) in selectCandidates()
1304 for (unsigned R = AllRMs.find_first(); R; R = AllRMs.find_next(R)) { in selectCandidates()
[all …]
DHexagonFrameLowering.cpp322 for (int x = CSR.find_first(); x >= 0; x = CSR.find_next(x)) { in needsStackFrame()
1603 for (int x = Regs.find_first(); x >= 0; x = Regs.find_next(x)) { in dump_registers()
1637 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x)) { in assignCalleeSavedSpillSlots()
1652 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1657 for (int x = TmpSup.find_first(); x >= 0; x = TmpSup.find_next(x)) { in assignCalleeSavedSpillSlots()
1676 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1710 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1739 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
2649 int N = Regs.find_next(F); in shouldInlineCSR()
/external/llvm/lib/Target/Hexagon/
DHexagonGenInsert.cpp90 unsigned find_next(unsigned Prev) const { in find_next() function
91 int Next = BitVector::find_next(v2x(Prev)); in find_next()
170 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) in operator <<()
917 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) { in collectInBlock()
935 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) in collectInBlock()
948 for (unsigned VR = BlockDefs.find_first(); VR; VR = BlockDefs.find_next(VR)) in collectInBlock()
968 for (unsigned R = Regs[S].find_first(); R; R = Regs[S].find_next(R)) { in findRemovableRegisters()
1234 for (unsigned R = Rs.find_first(); R; R = Rs.find_next(R)) { in stats()
1262 for (unsigned R = TT.find_first(); R; R = TT.find_next(R)) in selectCandidates()
1267 for (unsigned R = AllRMs.find_first(); R; R = AllRMs.find_next(R)) { in selectCandidates()
[all …]
/external/toybox/toys/other/
Dhexedit.c170 static void find_next(int pos) in find_next() function
294 find_next(TT.pos); in hexedit_main()
296 if (TT.pos < TT.len) find_next(TT.pos+1); in hexedit_main()
/external/llvm/lib/CodeGen/
DStackSlotColoring.cpp245 Color = UsedColors.find_next(Color); in ColorSlot()
255 NextColor = AllColors.find_next(NextColor); in ColorSlot()
339 NextColor = AllColors.find_next(NextColor); in ColorSlots()
DSpillPlacement.cpp313 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n)) { in scanActiveBundles()
368 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n)) in finish()
DSafeStackColoring.h135 idx = V.find_next(idx);
DGlobalMerge.cpp437 for (j = i; j != -1; j = GlobalSet.find_next(j)) { in doMerge()
454 for (ssize_t k = i, idx = 0; k != j; k = GlobalSet.find_next(k), ++idx) { in doMerge()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DStackSlotColoring.cpp285 Color = UsedColors[StackID].find_next(Color); in ColorSlot()
300 NextColors[StackID] = AllColors[StackID].find_next(NextColors[StackID]); in ColorSlot()
387 NextColor = AllColors[StackID].find_next(NextColor); in ColorSlots()
DSafeStackColoring.h150 idx = V.find_next(idx);
DGlobalMerge.cpp462 for (j = i; j != -1; j = GlobalSet.find_next(j)) { in doMerge()
524 for (ssize_t k = i, idx = 0; k != j; k = GlobalSet.find_next(k), ++idx) { in doMerge()
/external/llvm-project/llvm/include/llvm/Analysis/
DStackLifetime.h179 Idx = V.find_next(Idx);
/external/llvm/lib/Analysis/
DDependenceAnalysis.cpp2986 for (int LI = Loops.find_first(); LI >= 0; LI = Loops.find_next(LI)) { in propagate()
3268 for (int VI = BV.find_first(); VI >= 0; VI = BV.find_next(VI)) { in dumpSmallBitVector()
3270 if (BV.find_next(VI) >= 0) in dumpSmallBitVector()
3508 for (int SI = Separable.find_first(); SI >= 0; SI = Separable.find_next(SI)) { in depends()
3547 for (int SI = Coupled.find_first(); SI >= 0; SI = Coupled.find_next(SI)) { in depends()
3554 for (int SJ = Group.find_first(); SJ >= 0; SJ = Group.find_next(SJ)) { in depends()
3566 for (int SJ = Sivs.find_first(); SJ >= 0; SJ = Sivs.find_next(SJ)) { in depends()
3590 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { in depends()
3624 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { in depends()
3637 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { in depends()
[all …]
/external/llvm/lib/Target/WebAssembly/
DWebAssemblyRegColoring.cpp144 C = UsedColors.find_next(C)) { in runOnMachineFunction()
/external/llvm/include/llvm/ADT/
DSmallBitVector.h221 int find_next(unsigned Prev) const { in find_next() function
230 return getPointer()->find_next(Prev); in find_next()
/external/llvm/unittests/ADT/
DBitVectorTest.cpp77 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { in TYPED_TEST()
107 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { in TYPED_TEST()
/external/llvm-project/llvm/tools/llvm-exegesis/lib/
DParallelSnippetGenerator.cpp140 PossibleRegsForVar[VarId].find_next(Iterators[VarId]); in generateSnippetUsingStaticRenaming()

1234