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

12

/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DSafeStackColoring.h142 int idx = V.find_first();
H A DRDFRegisters.cpp320 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 DStackSlotColoring.cpp252 NextColors[I] = AllColors[I].find_first();
278 Color = UsedColors[StackID].find_first();
H A DGlobalMerge.cpp447 << GlobalSet.find_first() << "\n");
450 ssize_t i = GlobalSet.find_first();
H A DShrinkWrap.cpp173 for (int Reg = SavedRegs.find_first(); Reg != -1;
H A DRegisterScavenging.cpp311 int Survivor = Candidates.find_first();
359 Survivor = Candidates.find_first();
H A DStackColoring.cpp828 for (int pos = MBBLiveness.LiveIn.find_first(); pos != -1;
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSparseBitVector.h126 /// 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 DSmallBitVector.h227 int find_first() const { function in class:llvm::SmallBitVector
234 return getPointer()->find_first();
H A DBitVector.h44 : 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 DHexagonGenInsert.cpp103 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 DHexagonFrameLowering.cpp322 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 DHexagonBitSimplify.cpp83 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 DHexagonRegisterInfo.cpp178 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x))
H A DHexagonSplitDouble.cpp233 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 DMips16InstrInfo.cpp387 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 DImmutableGraph.h196 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 DTypeSystem.cpp37 return (LanguageType)bitvector.find_first();
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/
H A DHashTable.h49 int I = Map.Present.find_first();
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopRerollPass.cpp1206 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 Dtextbox.c203 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 DMSFBuilder.cpp132 int Block = FreeBlocks.find_first();
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ProfileData/Coverage/
H A DCoverageMapping.cpp628 int I = IsNotExpandedFile.find_first();
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCFrameLowering.cpp675 int FirstScratchReg = BV.find_first();
2171 unsigned VolatileVFReg = BVAllocatable.find_first();
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DThumb1FrameLowering.cpp742 PopReg = PopFriendly.find_first();

Completed in 486 milliseconds

12