Searched refs:find_first (Results 1 - 25 of 28) sorted by relevance

12

/external/llvm/unittests/ADT/
H A DBitVectorTest.cpp77 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) {
96 EXPECT_TRUE(Vec.find_first() == 3);
107 for (unsigned i = Vec.find_first(); i != -1u; i = Vec.find_next(i)) {
398 EXPECT_EQ(50, C.find_first());
/external/llvm/lib/CodeGen/
H A DRegisterScavenging.cpp62 for (int I = PR.find_first(); I>0; I = PR.find_next(I))
295 int Survivor = Candidates.find_first();
344 Survivor = Candidates.find_first();
H A DSpillPlacement.cpp303 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n)) {
383 for (int n = ActiveNodes->find_first(); n>=0; n = ActiveNodes->find_next(n))
H A DGlobalMerge.cpp418 << GlobalSet.find_first() << "\n");
420 ssize_t i = GlobalSet.find_first();
H A DStackSlotColoring.cpp214 NextColor = AllColors.find_first();
237 Color = UsedColors.find_first();
H A DStackColoring.cpp409 for (int pos = MBBLiveness.LiveIn.find_first(); pos != -1;
413 for (int pos = MBBLiveness.LiveOut.find_first(); pos != -1;
H A DShrinkWrap.cpp144 for (int Reg = SavedRegs.find_first(); Reg != -1;
H A DAggressiveAntiDepBreaker.cpp131 DEBUG(for (int r = CriticalPathSet.find_first(); r != -1;
570 DEBUG(for (int r = BV.find_first(); r != -1; r = BV.find_next(r))
H A DRegAllocGreedy.cpp284 for (int i = LiveBundles.find_first(); i >= 0;
1123 for (int i = Cand.LiveBundles.find_first(); i>=0;
1441 for (int i = Cand.LiveBundles.find_first(); i>=0;
H A DMachineVerifier.cpp473 for (int Reg = regsReserved.find_first(); Reg>=0;
708 for (int I = PR.find_first(); I>0; I = PR.find_next(I)) {
H A DTargetLoweringBase.cpp1167 for (int i = SuperRegRC.find_first(); i >= 0; i = SuperRegRC.find_next(i)) {
/external/llvm/lib/Target/Hexagon/
H A DHexagonGenInsert.cpp85 unsigned find_first() const { function in struct:__anon12606::RegisterSet
86 int First = BitVector::find_first();
172 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R))
919 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) {
937 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR))
950 for (unsigned VR = BlockDefs.find_first(); VR; VR = BlockDefs.find_next(VR))
970 for (unsigned R = Regs[S].find_first(); R; R = Regs[S].find_next(R)) {
1236 for (unsigned R = Rs.find_first(); R; R = Rs.find_next(R)) {
1264 for (unsigned R = TT.find_first(); R; R = TT.find_next(R))
1269 for (unsigned R = AllRMs.find_first();
[all...]
H A DHexagonFrameLowering.cpp1186 for (int x = Regs.find_first(); x >= 0; x = Regs.find_next(x)) {
1221 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x)) {
1234 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) {
1239 for (int x = TmpSup.find_first(); x >= 0; x = TmpSup.find_next(x)) {
1256 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) {
1288 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) {
1317 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) {
1443 int F = Regs.find_first();
H A DHexagonBitSimplify.cpp42 unsigned find_first() const { function in struct:__anon12580::RegisterSet
43 int First = BitVector::find_first();
131 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R))
1433 unsigned DR = Defs.find_first();
1505 for (unsigned R = AVs.find_first(); R; R = AVs.find_next(R)) {
1556 for (unsigned R = Defs.find_first(); R; R = Defs.find_next(R)) {
2372 return Defs.find_first();
2576 unsigned DefR = Defs.find_first();
2662 G.Inp.Reg = Inputs.find_first();
H A DHexagonSplitDouble.cpp224 for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) {
235 for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) {
274 for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) {
/external/llvm/lib/Target/Mips/
H A DMips16InstrInfo.cpp373 Reg = Available.find_first();
376 Reg = Candidates.find_first();
389 SpReg = Available.find_first();
391 SpReg = Candidates.find_first();
H A DMipsDelaySlotFiller.cpp343 for (int R = AllocSet.find_first(); R != -1; R = AllocSet.find_next(R))
/external/llvm/lib/Target/WebAssembly/
H A DWebAssemblyRegColoring.cpp143 for (int C(UsedColors.find_first()); C != -1;
/external/llvm/include/llvm/ADT/
H A DSparseBitVector.h130 /// find_first - Returns the index of the first set bit.
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();
H A DSmallBitVector.h211 /// find_first - Returns the index of the first set bit, -1 if none
213 int find_first() const { function in class:llvm::SmallBitVector
220 return getPointer()->find_first();
H A DBitVector.h154 /// find_first - Returns the index of the first set bit, -1 if none
156 int find_first() const { function in class:llvm::BitVector
/external/llvm/lib/Transforms/Scalar/
H A DLoopRerollPass.cpp1046 dbgs() << "LRR: " << KV.second.find_first() << "\t" << *KV.first << "\n";
1126 if (LastRootIt->second.find_first() < (int)Iter)
1265 unsigned I = Uses[&*J].find_first();
1292 if (KV.second.find_first() == 0)
1298 if (Uses[BI].find_first() == IL_All) {
/external/llvm/lib/Analysis/
H A DDependenceAnalysis.cpp3049 for (int LI = Loops.find_first(); LI >= 0; LI = Loops.find_next(LI)) {
3337 for (int VI = BV.find_first(); VI >= 0; VI = BV.find_next(VI)) {
3577 for (int SI = Separable.find_first(); SI >= 0; SI = Separable.find_next(SI)) {
3616 for (int SI = Coupled.find_first(); SI >= 0; SI = Coupled.find_next(SI)) {
3623 for (int SJ = Group.find_first(); SJ >= 0; SJ = Group.find_next(SJ)) {
3635 for (int SJ = Sivs.find_first(); SJ >= 0; SJ = Sivs.find_next(SJ)) {
3659 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) {
3693 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) {
3706 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) {
3718 for (int SJ = ConstrainedLevels.find_first(); S
[all...]
/external/llvm/lib/ProfileData/
H A DCoverageMapping.cpp376 int I = IsNotExpandedFile.find_first();
387 int I = IsNotExpandedFile.find_first();
/external/llvm/lib/Target/ARM/
H A DThumb1FrameLowering.cpp505 for (int Register = GPRsNoLRSP.find_first(); Register != -1;
527 PopReg = PopFriendly.find_first();

Completed in 885 milliseconds

12