Home
last modified time | relevance | path

Searched refs:find_first (Results 1 – 25 of 48) sorted by relevance

12

/llvm-project-15.0.7/llvm/unittests/ADT/
H A DSparseBitVectorTest.cpp153 EXPECT_EQ(1, Vec.find_first()); in TEST()
157 EXPECT_EQ(1, Vec.find_first()); in TEST()
162 EXPECT_EQ(0, Vec.find_first()); in TEST()
168 EXPECT_EQ(2, Vec.find_first()); in TEST()
178 EXPECT_EQ(500, Vec.find_first()); in TEST()
184 EXPECT_EQ(2000, Vec.find_first()); in TEST()
H A DBitVectorTest.cpp93 EXPECT_TRUE(Vec.find_first() == 3); in TYPED_TEST()
210 EXPECT_EQ(12, A.find_first()); in TYPED_TEST()
232 EXPECT_EQ(0, A.find_first()); in TYPED_TEST()
240 EXPECT_EQ(-1, A.find_first()); in TYPED_TEST()
258 EXPECT_EQ(12, A.find_first()); in TYPED_TEST()
294 EXPECT_EQ(-1, A.find_first()); in TYPED_TEST()
301 EXPECT_EQ(-1, A.find_first()); in TYPED_TEST()
317 EXPECT_EQ(3, A.find_first()); in TYPED_TEST()
337 EXPECT_EQ(0, A.find_first()); in TYPED_TEST()
1070 EXPECT_EQ(50, C.find_first()); in TYPED_TEST()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/Hexagon/
H A DHexagonGenInsert.cpp102 unsigned find_first() const { in find_first() function
103 int First = BitVector::find_first(); in find_first()
192 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) in operator <<()
961 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) in collectInBlock()
971 for (unsigned VR = BlockDefs.find_first(); VR; VR = BlockDefs.find_next(VR)) in collectInBlock()
990 for (unsigned R = Regs[S].find_first(); R; R = Regs[S].find_next(R)) { in findRemovableRegisters()
1250 for (unsigned R = Rs.find_first(); R; R = Rs.find_next(R)) { in stats()
1277 for (unsigned R = TT.find_first(); R; R = TT.find_next(R)) in selectCandidates()
1282 for (unsigned R = AllRMs.find_first(); R; R = AllRMs.find_next(R)) { in selectCandidates()
1335 for (unsigned R = Us.find_first(); R; R = Us.find_next(R)) { in selectCandidates()
[all …]
H A DHexagonBitSimplify.cpp93 unsigned find_first() const { in find_first() function
94 int First = Bits.find_first(); in find_first()
137 for (unsigned R = Rs.find_first(); R; R = Rs.find_next(R)) in insert()
142 for (unsigned R = Rs.find_first(); R; R = Rs.find_next(R)) in remove()
203 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) in operator <<()
1507 Register DR = Defs.find_first(); in processBlock()
1583 for (Register R = AVs.find_first(); R; R = AVs.find_next(R)) { in findMatch()
2259 for (unsigned S = AVs.find_first(); S; S = AVs.find_next(S)) { in genBitSplit()
2999 return Defs.find_first(); in getDefReg()
3196 Register DefR = Defs.find_first(); in processLoop()
[all …]
H A DHexagonFrameLowering.cpp326 for (int x = CSR.find_first(); x >= 0; x = CSR.find_next(x)) { in needsStackFrame()
1606 for (int x = Regs.find_first(); x >= 0; x = Regs.find_next(x)) { in dump_registers()
1640 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x)) { in assignCalleeSavedSpillSlots()
1655 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1660 for (int x = TmpSup.find_first(); x >= 0; x = TmpSup.find_next(x)) { in assignCalleeSavedSpillSlots()
1679 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1713 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1742 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
2648 int F = Regs.find_first(); in shouldInlineCSR()
H A DHexagonSplitDouble.cpp233 for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) { in partitionRegisters()
244 for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) { in partitionRegisters()
283 for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) { in partitionRegisters()
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DRDFRegisters.cpp325 int U = Units.find_first(); in makeRegRef()
347 int F = Regs.find_first(); 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()
H A DStackSlotColoring.cpp247 NextColors[I] = AllColors[I].find_first(); in InitializeSlots()
273 Color = UsedColors[StackID].find_first(); in ColorSlot()
H A DGlobalMerge.cpp447 << GlobalSet.find_first() << "\n"); in doMerge()
450 ssize_t i = GlobalSet.find_first(); in doMerge()
H A DRegisterScavenging.cpp289 int Survivor = Candidates.find_first(); in findSurvivorReg()
337 Survivor = Candidates.find_first(); in findSurvivorReg()
H A DShrinkWrap.cpp173 for (int Reg = SavedRegs.find_first(); Reg != -1; in getCurrentCSRs()
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DSparseBitVector.h128 int find_first() const { in find_first() function
347 unsigned BitPos = Iter->find_first(); in AdvanceToFirstNonZero()
379 NextSetBitNumber = Iter->find_first(); in AdvanceToNextNonZero()
780 int find_first() const { in find_first() function
784 return (First.index() * ElementSize) + First.find_first(); in find_first()
H A DSmallBitVector.h230 int find_first() const { in find_first() function
237 return getPointer()->find_first(); in find_first()
H A DBitVector.h46 : const_set_bits_iterator_impl(Parent, Parent.find_first()) {} in const_set_bits_iterator_impl()
293 int find_first() const { return find_first_in(0, Size); } in find_first() function
/llvm-project-15.0.7/bolt/lib/Passes/
H A DRegAnalysis.cpp92 int RegIdx = RegsKilled.find_first(); in RegAnalysis()
99 RegIdx = RegsUsed.find_first(); in RegAnalysis()
H A DRegReAssign.cpp152 BC.MIB->getAliases(*ImplicitUses, false).find_first(); in rankRegisters()
162 BC.MIB->getAliases(*ImplicitDefs, false).find_first(); in rankRegisters()
177 size_t RegEC = BC.MIB->getAliases(Reg, false).find_first(); in rankRegisters()
/llvm-project-15.0.7/llvm/lib/Target/Mips/
H A DMips16InstrInfo.cpp387 Reg = Available.find_first(); in loadImmediate()
390 Reg = Candidates.find_first(); in loadImmediate()
403 SpReg = Available.find_first(); in loadImmediate()
405 SpReg = Candidates.find_first(); in loadImmediate()
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DStackLifetime.h172 for (int Idx = V.find_first(); Idx >= 0; Idx = V.find_next(Idx))
/llvm-project-15.0.7/bolt/include/bolt/Passes/
H A DLivenessAnalysis.h61 int Reg = BV.find_first(); in scavengeRegAfter()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DLoopRerollPass.cpp1224 dbgs() << "LRR: " << KV.second.find_first() << "\t" << *KV.first << "\n"; in validate()
1303 if (LastRootIt->second.find_first() < (int)Iter) in validate()
1455 unsigned I = Uses[&Inst].find_first(); in replace()
1513 if (KV.second.find_first() == 0) in replaceIV()
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DImmutableGraph.h195 iterator begin() const { return iterator{*this, V.find_first()}; } in begin()
283 iterator begin() const { return iterator{*this, V.find_first()}; } in begin()
/llvm-project-15.0.7/lldb/source/Symbol/
H A DTypeSystem.cpp29 return (LanguageType)bitvector.find_first(); in GetSingularLanguage()
/llvm-project-15.0.7/llvm/include/llvm/DebugInfo/PDB/Native/
H A DHashTable.h47 int I = Map.Present.find_first(); in HashTableIterator()
/llvm-project-15.0.7/llvm/tools/llvm-exegesis/lib/
H A DMCInstrDescView.cpp216 for (int AIndex = A.find_first(); AIndex != -1;) { in anyCommonExcludingForbidden()
/llvm-project-15.0.7/llvm/lib/DebugInfo/MSF/
H A DMSFBuilder.cpp133 int Block = FreeBlocks.find_first(); in allocateBlocks()

12