Home
last modified time | relevance | path

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

12

/external/llvm/lib/Target/Hexagon/
DHexagonGenInsert.cpp92 unsigned find_next(unsigned Prev) const { in find_next() function
93 int Next = BitVector::find_next(v2x(Prev)); in find_next()
172 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) in operator <<()
919 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) { in collectInBlock()
937 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) in collectInBlock()
950 for (unsigned VR = BlockDefs.find_first(); VR; VR = BlockDefs.find_next(VR)) in collectInBlock()
970 for (unsigned R = Regs[S].find_first(); R; R = Regs[S].find_next(R)) { in findRemovableRegisters()
1236 for (unsigned R = Rs.find_first(); R; R = Rs.find_next(R)) { in stats()
1264 for (unsigned R = TT.find_first(); R; R = TT.find_next(R)) in selectCandidates()
1269 for (unsigned R = AllRMs.find_first(); R; R = AllRMs.find_next(R)) { in selectCandidates()
[all …]
DHexagonFrameLowering.cpp1186 for (int x = Regs.find_first(); x >= 0; x = Regs.find_next(x)) { in dump_registers()
1221 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x)) { in assignCalleeSavedSpillSlots()
1234 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1239 for (int x = TmpSup.find_first(); x >= 0; x = TmpSup.find_next(x)) { in assignCalleeSavedSpillSlots()
1256 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1288 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1317 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1447 int N = Regs.find_next(F); in shouldInlineCSR()
DHexagonSplitDouble.cpp224 for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) { in partitionRegisters()
235 for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) { in partitionRegisters()
274 for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) { in partitionRegisters()
DHexagonBitSimplify.cpp49 unsigned find_next(unsigned Prev) const { in find_next() function
50 int Next = BitVector::find_next(v2x(Prev)); in find_next()
131 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) in operator <<()
1505 for (unsigned R = AVs.find_first(); R; R = AVs.find_next(R)) { in findMatch()
1556 for (unsigned R = Defs.find_first(); R; R = Defs.find_next(R)) { in processBlock()
/external/llvm/lib/CodeGen/
DStackSlotColoring.cpp244 Color = UsedColors.find_next(Color); in ColorSlot()
254 NextColor = AllColors.find_next(NextColor); in ColorSlot()
341 NextColor = AllColors.find_next(NextColor); in ColorSlots()
DSpillPlacement.cpp303 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n)) { in scanActiveBundles()
383 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n)) in finish()
DGlobalMerge.cpp427 for (j = i; j != -1; j = GlobalSet.find_next(j)) { in doMerge()
444 for (ssize_t k = i, idx = 0; k != j; k = GlobalSet.find_next(k), ++idx) { in doMerge()
DStackColoring.cpp410 pos = MBBLiveness.LiveIn.find_next(pos)) { in calculateLiveIntervals()
414 pos = MBBLiveness.LiveOut.find_next(pos)) { in calculateLiveIntervals()
DShrinkWrap.cpp145 Reg = SavedRegs.find_next(Reg)) in getCurrentCSRs()
DRegisterScavenging.cpp62 for (int I = PR.find_first(); I>0; I = PR.find_next(I)) in initRegState()
DAggressiveAntiDepBreaker.cpp132 r = CriticalPathSet.find_next(r)) in AggressiveAntiDepBreaker()
570 DEBUG(for (int r = BV.find_first(); r != -1; r = BV.find_next(r)) in FindSuitableFreeRegisters()
DRegAllocGreedy.cpp285 i = LiveBundles.find_next(i)) in getBundles()
1124 i = Cand.LiveBundles.find_next(i)) in calcCompactRegion()
1442 i = Cand.LiveBundles.find_next(i)) in calculateRegionSplitCost()
DMachineVerifier.cpp474 Reg = regsReserved.find_next(Reg)) { in visitMachineFunctionBefore()
708 for (int I = PR.find_first(); I>0; I = PR.find_next(I)) { in visitMachineBasicBlockBefore()
DTargetLoweringBase.cpp1167 for (int i = SuperRegRC.find_first(); i >= 0; i = SuperRegRC.find_next(i)) { in findRepresentativeClass()
/external/llvm/lib/Analysis/
DDependenceAnalysis.cpp3049 for (int LI = Loops.find_first(); LI >= 0; LI = Loops.find_next(LI)) { in propagate()
3337 for (int VI = BV.find_first(); VI >= 0; VI = BV.find_next(VI)) { in dumpSmallBitVector()
3339 if (BV.find_next(VI) >= 0) in dumpSmallBitVector()
3577 for (int SI = Separable.find_first(); SI >= 0; SI = Separable.find_next(SI)) { in depends()
3616 for (int SI = Coupled.find_first(); SI >= 0; SI = Coupled.find_next(SI)) { in depends()
3623 for (int SJ = Group.find_first(); SJ >= 0; SJ = Group.find_next(SJ)) { in depends()
3635 for (int SJ = Sivs.find_first(); SJ >= 0; SJ = Sivs.find_next(SJ)) { in depends()
3659 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { in depends()
3693 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { in depends()
3706 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.h225 int find_next(unsigned Prev) const { in find_next() function
234 return getPointer()->find_next(Prev); in find_next()
DSparseBitVector.h140 int find_next(unsigned Curr) const {
356 int NextSetBitNumber = Iter->find_next(BitNumber % ElementSize) ;
DBitVector.h165 int find_next(unsigned Prev) const { in find_next() function
/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/chromium-trace/catapult/third_party/beautifulsoup4/bs4/tests/
Dtest_tree.py500 self.assertEqual(self.start.find_next('b')['id'], '2')
501 self.assertEqual(self.start.find_next(text="Three"), "Three")
505 self.assertEqual(text.find_next("b").string, "Two")
/external/chromium-trace/catapult/third_party/beautifulsoup4/bs4/
Delement.py378 def find_next(self, name=None, attrs={}, text=None, **kwargs): member in PageElement
382 findNext = find_next # BS3
/external/llvm/lib/Target/ARM/
DThumb1FrameLowering.cpp506 Register = GPRsNoLRSP.find_next(Register)) { in emitPopSpecialFixUp()
/external/llvm/lib/Target/Mips/
DMipsDelaySlotFiller.cpp343 for (int R = AllocSet.find_first(); R != -1; R = AllocSet.find_next(R)) in setUnallocatableRegs()
/external/chromium-trace/catapult/third_party/beautifulsoup4/doc/source/
Dindex.rst1557 ``find_all_next()`` and ``find_next()``
1562 Signature: find_next(:ref:`name <name>`, :ref:`attrs <attrs>`, :ref:`text <text>`, :ref:`**kwargs <…
1567 ``find_next()`` only returns the first match::
1577 first_link.find_next("p")
2918 * ``findNext`` -> ``find_next``

12