/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | SafeStackColoring.h | 142 int idx = V.find_first();
|
H A D | RDFRegisters.cpp | 320 int U = Units.find_first(); 351 int F = Regs.find_first(); 366 for (int U = Units.find_first(); U >= 0; U = Units.find_next(U)) 374 for (int U = RG.Units.find_first(); U >= 0; U = RG.Units.find_next(U)) {
|
H A D | StackSlotColoring.cpp | 252 NextColors[I] = AllColors[I].find_first(); 278 Color = UsedColors[StackID].find_first();
|
H A D | GlobalMerge.cpp | 447 << GlobalSet.find_first() << "\n"); 450 ssize_t i = GlobalSet.find_first();
|
H A D | ShrinkWrap.cpp | 173 for (int Reg = SavedRegs.find_first(); Reg != -1;
|
H A D | RegisterScavenging.cpp | 311 int Survivor = Candidates.find_first(); 359 Survivor = Candidates.find_first();
|
H A D | StackColoring.cpp | 828 for (int pos = MBBLiveness.LiveIn.find_first(); pos != -1;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | SparseBitVector.h | 126 /// find_first - Returns the index of the first set bit. 127 int find_first() const { 346 unsigned BitPos = Iter->find_first(); 378 NextSetBitNumber = Iter->find_first(); 779 int find_first() const { 783 return (First.index() * ElementSize) + First.find_first();
|
H A D | SmallBitVector.h | 227 int find_first() const { function in class:llvm::SmallBitVector 234 return getPointer()->find_first();
|
H A D | BitVector.h | 44 : const_set_bits_iterator_impl(Parent, Parent.find_first()) {} 329 /// find_first - Returns the index of the first set bit, -1 if none 331 int find_first() const { return find_first_in(0, Size); } function in class:llvm::BitVector
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonGenInsert.cpp | 103 unsigned find_first() const { function in struct:__anon2245::RegisterSet 104 int First = BitVector::find_first(); 193 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) 958 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) { 979 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) 989 for (unsigned VR = BlockDefs.find_first(); VR; VR = BlockDefs.find_next(VR)) 1008 for (unsigned R = Regs[S].find_first(); R; R = Regs[S].find_next(R)) { 1272 for (unsigned R = Rs.find_first(); R; R = Rs.find_next(R)) { 1299 for (unsigned R = TT.find_first(); R; R = TT.find_next(R)) 1304 for (unsigned R = AllRMs.find_first(); [all...] |
H A D | HexagonFrameLowering.cpp | 322 for (int x = CSR.find_first(); x >= 0; x = CSR.find_next(x)) { 1453 for (int x = Regs.find_first(); x >= 0; x = Regs.find_next(x)) { 1487 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x)) { 1502 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { 1507 for (int x = TmpSup.find_first(); x >= 0; x = TmpSup.find_next(x)) { 1526 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { 1560 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { 1590 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { 2493 int F = Regs.find_first();
|
H A D | HexagonBitSimplify.cpp | 83 unsigned find_first() const { function in struct:__anon2220::RegisterSet 84 int First = BitVector::find_first(); 175 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) 1470 unsigned DR = Defs.find_first(); 1546 for (unsigned R = AVs.find_first(); R; R = AVs.find_next(R)) { 1605 for (unsigned R = Defs.find_first(); R; R = Defs.find_next(R)) { 2224 for (unsigned S = AVs.find_first(); S; S = AVs.find_next(S)) { 2469 for (unsigned R = AVs.find_first(); R != 0; R = AVs.find_next(R)) { 2964 return Defs.find_first(); 3162 unsigned DefR = Defs.find_first(); [all...] |
H A D | HexagonRegisterInfo.cpp | 178 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x))
|
H A D | HexagonSplitDouble.cpp | 233 for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) { 244 for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) { 283 for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Mips/ |
H A D | Mips16InstrInfo.cpp | 387 Reg = Available.find_first(); 390 Reg = Candidates.find_first(); 403 SpReg = Available.find_first(); 405 SpReg = Candidates.find_first();
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | ImmutableGraph.h | 196 iterator begin() const { return iterator{*this, V.find_first()}; } 284 iterator begin() const { return iterator{*this, V.find_first()}; }
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Symbol/ |
H A D | TypeSystem.cpp | 37 return (LanguageType)bitvector.find_first();
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/ |
H A D | HashTable.h | 49 int I = Map.Present.find_first();
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopRerollPass.cpp | 1206 dbgs() << "LRR: " << KV.second.find_first() << "\t" << *KV.first << "\n"; 1285 if (LastRootIt->second.find_first() < (int)Iter) 1438 unsigned I = Uses[&*J].find_first(); 1499 if (KV.second.find_first() == 0)
|
/freebsd-11-stable/contrib/dialog/ |
H A D | textbox.c | 203 find_first(MY_OBJ * obj, char *buffer, long length) function 246 *first_pos = find_first(obj, buftab, i); 466 first = find_first(obj, obj->buf, size = obj->in_buf);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/MSF/ |
H A D | MSFBuilder.cpp | 132 int Block = FreeBlocks.find_first();
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ProfileData/Coverage/ |
H A D | CoverageMapping.cpp | 628 int I = IsNotExpandedFile.find_first();
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCFrameLowering.cpp | 675 int FirstScratchReg = BV.find_first(); 2171 unsigned VolatileVFReg = BVAllocatable.find_first();
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | Thumb1FrameLowering.cpp | 742 PopReg = PopFriendly.find_first();
|