| /external/llvm/unittests/ADT/ |
| D | BitVectorTest.cpp | 77 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { in TYPED_TEST()
96 EXPECT_TRUE(Vec.find_first() == 3); in TYPED_TEST()
107 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) { in TYPED_TEST()
398 EXPECT_EQ(50, C.find_first()); in TYPED_TEST()
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonGenInsert.cpp | 85 unsigned find_first() const { in find_first() function
86 int First = BitVector::find_first(); in find_first()
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 …]
|
| D | HexagonFrameLowering.cpp | 1186 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()
1443 int F = Regs.find_first(); in shouldInlineCSR()
|
| D | HexagonBitSimplify.cpp | 42 unsigned find_first() const { in find_first() function
43 int First = BitVector::find_first(); in find_first()
131 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) in operator <<()
1433 unsigned DR = Defs.find_first(); in processBlock()
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()
2372 return Defs.find_first(); in getDefReg()
2576 unsigned DefR = Defs.find_first(); in processLoop()
2662 G.Inp.Reg = Inputs.find_first(); in processLoop()
|
| D | HexagonSplitDouble.cpp | 224 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()
|
| /external/llvm/lib/CodeGen/ |
| D | RegisterScavenging.cpp | 62 for (int I = PR.find_first(); I>0; I = PR.find_next(I)) in initRegState()
295 int Survivor = Candidates.find_first(); in findSurvivorReg()
344 Survivor = Candidates.find_first(); in findSurvivorReg()
|
| D | SpillPlacement.cpp | 303 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()
|
| D | StackSlotColoring.cpp | 214 NextColor = AllColors.find_first(); in InitializeSlots()
237 Color = UsedColors.find_first(); in ColorSlot()
|
| D | GlobalMerge.cpp | 418 << GlobalSet.find_first() << "\n"); in doMerge()
420 ssize_t i = GlobalSet.find_first(); in doMerge()
|
| D | StackColoring.cpp | 409 for (int pos = MBBLiveness.LiveIn.find_first(); pos != -1; in calculateLiveIntervals()
413 for (int pos = MBBLiveness.LiveOut.find_first(); pos != -1; in calculateLiveIntervals()
|
| D | ShrinkWrap.cpp | 144 for (int Reg = SavedRegs.find_first(); Reg != -1; in getCurrentCSRs()
|
| D | AggressiveAntiDepBreaker.cpp | 131 DEBUG(for (int r = CriticalPathSet.find_first(); r != -1; in AggressiveAntiDepBreaker()
570 DEBUG(for (int r = BV.find_first(); r != -1; r = BV.find_next(r)) in FindSuitableFreeRegisters()
|
| D | RegAllocGreedy.cpp | 284 for (int i = LiveBundles.find_first(); i >= 0; in getBundles()
1123 for (int i = Cand.LiveBundles.find_first(); i>=0; in calcCompactRegion()
1441 for (int i = Cand.LiveBundles.find_first(); i>=0; in calculateRegionSplitCost()
|
| D | MachineVerifier.cpp | 473 for (int Reg = regsReserved.find_first(); Reg>=0; in visitMachineFunctionBefore()
708 for (int I = PR.find_first(); I>0; I = PR.find_next(I)) { in visitMachineBasicBlockBefore()
|
| D | TargetLoweringBase.cpp | 1167 for (int i = SuperRegRC.find_first(); i >= 0; i = SuperRegRC.find_next(i)) { in findRepresentativeClass()
|
| /external/llvm/include/llvm/ADT/ |
| D | SparseBitVector.h | 131 int find_first() const {
337 unsigned BitPos = Iter->find_first();
369 NextSetBitNumber = Iter->find_first();
801 int find_first() const {
805 return (First.index() * ElementSize) + First.find_first();
|
| D | SmallBitVector.h | 213 int find_first() const { in find_first() function
220 return getPointer()->find_first(); in find_first()
|
| D | BitVector.h | 156 int find_first() const { in find_first() function
|
| /external/llvm/lib/Target/Mips/ |
| D | Mips16InstrInfo.cpp | 373 Reg = Available.find_first(); in loadImmediate()
376 Reg = Candidates.find_first(); in loadImmediate()
389 SpReg = Available.find_first(); in loadImmediate()
391 SpReg = Candidates.find_first(); in loadImmediate()
|
| D | MipsDelaySlotFiller.cpp | 343 for (int R = AllocSet.find_first(); R != -1; R = AllocSet.find_next(R)) in setUnallocatableRegs()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopRerollPass.cpp | 1046 dbgs() << "LRR: " << KV.second.find_first() << "\t" << *KV.first << "\n"; in validate()
1126 if (LastRootIt->second.find_first() < (int)Iter) in validate()
1265 unsigned I = Uses[&*J].find_first(); in replace()
1292 if (KV.second.find_first() == 0) in replace()
1298 if (Uses[BI].find_first() == IL_All) { in replace()
|
| /external/llvm/lib/Analysis/ |
| D | DependenceAnalysis.cpp | 3049 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()
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()
3718 for (int SJ = ConstrainedLevels.find_first(); SJ >= 0; in depends()
[all …]
|
| /external/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyRegColoring.cpp | 143 for (int C(UsedColors.find_first()); C != -1; in runOnMachineFunction()
|
| /external/llvm/lib/ProfileData/ |
| D | CoverageMapping.cpp | 376 int I = IsNotExpandedFile.find_first(); in findMainViewFileID()
387 int I = IsNotExpandedFile.find_first(); in findMainViewFileID()
|
| /external/llvm/lib/Target/ARM/ |
| D | Thumb1FrameLowering.cpp | 505 for (int Register = GPRsNoLRSP.find_first(); Register != -1; in emitPopSpecialFixUp()
527 PopReg = PopFriendly.find_first(); in emitPopSpecialFixUp()
|