| /openbsd/src/gnu/llvm/llvm/lib/Target/Hexagon/ |
| D | HexagonGenInsert.cpp | 102 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 <<() 940 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) { in collectInBlock() 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() [all …]
|
| D | HexagonBitSimplify.cpp | 93 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() 1640 for (Register R = Defs.find_first(); R; R = Defs.find_next(R)) { in processBlock() 2259 for (unsigned S = AVs.find_first(); S; S = AVs.find_next(S)) { in genBitSplit() 2504 for (unsigned R = AVs.find_first(); R != 0; R = AVs.find_next(R)) { in simplifyExtractLow() [all …]
|
| D | HexagonFrameLowering.cpp | 325 for (int x = CSR.find_first(); x >= 0; x = CSR.find_next(x)) { in needsStackFrame() 1548 for (int x = Regs.find_first(); x >= 0; x = Regs.find_next(x)) { in dump_registers() 1602 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x)) { in assignCalleeSavedSpillSlots() 1617 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots() 1622 for (int x = TmpSup.find_first(); x >= 0; x = TmpSup.find_next(x)) { in assignCalleeSavedSpillSlots() 1641 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots() 1675 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots() 1704 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots() 2596 int F = Regs.find_first(); in shouldInlineCSR()
|
| D | HexagonSplitDouble.cpp | 233 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()
|
| D | HexagonRegisterInfo.cpp | 202 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x)) in getReservedRegs()
|
| /openbsd/src/gnu/llvm/llvm/lib/CodeGen/ |
| D | RDFRegisters.cpp | 325 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()
|
| D | StackSlotColoring.cpp | 247 NextColors[I] = AllColors[I].find_first(); in InitializeSlots() 273 Color = UsedColors[StackID].find_first(); in ColorSlot()
|
| D | GlobalMerge.cpp | 448 << GlobalSet.find_first() << "\n"); in doMerge() 451 ssize_t i = GlobalSet.find_first(); in doMerge()
|
| D | RegisterScavenging.cpp | 289 int Survivor = Candidates.find_first(); in findSurvivorReg() 337 Survivor = Candidates.find_first(); in findSurvivorReg()
|
| D | ShrinkWrap.cpp | 173 for (int Reg = SavedRegs.find_first(); Reg != -1; in getCurrentCSRs()
|
| D | StackColoring.cpp | 872 for (int pos = MBBLiveness.LiveIn.find_first(); pos != -1; in calculateLiveIntervals()
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/ADT/ |
| D | SparseBitVector.h | 128 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()
|
| D | SmallBitVector.h | 230 int find_first() const { in find_first() function 237 return getPointer()->find_first(); in find_first()
|
| D | BitVector.h | 46 : 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
|
| /openbsd/src/gnu/llvm/llvm/lib/Target/Mips/ |
| D | Mips16InstrInfo.cpp | 387 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()
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/Analysis/ |
| D | StackLifetime.h | 172 for (int Idx = V.find_first(); Idx >= 0; Idx = V.find_next(Idx))
|
| /openbsd/src/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| D | LoopRerollPass.cpp | 1220 dbgs() << "LRR: " << KV.second.find_first() << "\t" << *KV.first << "\n"; in validate() 1300 if (LastRootIt->second.find_first() < (int)Iter) in validate() 1453 unsigned I = Uses[&Inst].find_first(); in replace() 1511 if (KV.second.find_first() == 0) in replaceIV()
|
| /openbsd/src/gnu/llvm/llvm/lib/Target/X86/ |
| D | ImmutableGraph.h | 195 iterator begin() const { return iterator{*this, V.find_first()}; } in begin() 283 iterator begin() const { return iterator{*this, V.find_first()}; } in begin()
|
| /openbsd/src/gnu/llvm/lldb/source/Symbol/ |
| D | TypeSystem.cpp | 30 return (LanguageType)bitvector.find_first(); in GetSingularLanguage()
|
| /openbsd/src/gnu/llvm/llvm/tools/llvm-exegesis/lib/ |
| D | SnippetGenerator.cpp | 221 int idx = Intersect.find_first(); in getFirstCommonBit()
|
| D | MCInstrDescView.cpp | 214 for (int AIndex = A.find_first(); AIndex != -1;) { in anyCommonExcludingForbidden()
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/DebugInfo/PDB/Native/ |
| D | HashTable.h | 47 int I = Map.Present.find_first(); in HashTableIterator()
|
| /openbsd/src/gnu/llvm/llvm/lib/DebugInfo/MSF/ |
| D | MSFBuilder.cpp | 133 int Block = FreeBlocks.find_first(); in allocateBlocks()
|
| /openbsd/src/gnu/llvm/llvm/lib/ProfileData/Coverage/ |
| D | CoverageMapping.cpp | 742 int I = IsNotExpandedFile.find_first(); in findMainViewFileID()
|
| /openbsd/src/gnu/llvm/llvm/lib/Target/PowerPC/ |
| D | PPCFrameLowering.cpp | 502 int FirstScratchReg = BV.find_first(); in findScratchRegister() 2366 unsigned VolatileVFReg = BVAllocatable.find_first(); in assignCalleeSavedSpillSlots()
|