| /freebsd-11-stable/crypto/heimdal/lib/sl/ |
| HD | slc-gram.y | 274 find_next(struct assignment *as, const char *name) in find_next() function 472 tmp = find_next(tmp, "option")) { in gen_options() 529 tmp = find_next(tmp, "option")) { in gen_wrapper() 567 tmp = find_next(tmp, "option")) { in gen_wrapper() 583 tmp = find_next(tmp, "option")) { in gen_wrapper() 656 tmp = find_next(tmp, "option")) { in gen_wrapper() 675 tmp = find_next(tmp, "option")) { in gen_wrapper()
|
| HD | slc-gram.c | 1783 find_next(struct assignment *as, const char *name) in find_next() function 1981 tmp = find_next(tmp, "option")) { in gen_options() 2038 tmp = find_next(tmp, "option")) { in gen_wrapper() 2076 tmp = find_next(tmp, "option")) { in gen_wrapper() 2092 tmp = find_next(tmp, "option")) { in gen_wrapper() 2165 tmp = find_next(tmp, "option")) { in gen_wrapper() 2184 tmp = find_next(tmp, "option")) { in gen_wrapper()
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| HD | HexagonGenInsert.cpp | 110 unsigned find_next(unsigned Prev) const { in find_next() function 111 int Next = BitVector::find_next(v2x(Prev)); in find_next() 193 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) in operator <<() 958 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) { in collectInBlock() 979 for (unsigned VR = InsDefs.find_first(); VR; VR = InsDefs.find_next(VR)) in collectInBlock() 989 for (unsigned VR = BlockDefs.find_first(); VR; VR = BlockDefs.find_next(VR)) in collectInBlock() 1008 for (unsigned R = Regs[S].find_first(); R; R = Regs[S].find_next(R)) { in findRemovableRegisters() 1272 for (unsigned R = Rs.find_first(); R; R = Rs.find_next(R)) { in stats() 1299 for (unsigned R = TT.find_first(); R; R = TT.find_next(R)) in selectCandidates() 1304 for (unsigned R = AllRMs.find_first(); R; R = AllRMs.find_next(R)) { in selectCandidates() [all …]
|
| HD | HexagonFrameLowering.cpp | 322 for (int x = CSR.find_first(); x >= 0; x = CSR.find_next(x)) { in needsStackFrame() 1453 for (int x = Regs.find_first(); x >= 0; x = Regs.find_next(x)) { in dump_registers() 1487 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x)) { in assignCalleeSavedSpillSlots() 1502 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots() 1507 for (int x = TmpSup.find_first(); x >= 0; x = TmpSup.find_next(x)) { in assignCalleeSavedSpillSlots() 1526 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots() 1560 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots() 1590 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots() 2497 int N = Regs.find_next(F); in shouldInlineCSR()
|
| HD | HexagonBitSimplify.cpp | 90 unsigned find_next(unsigned Prev) const { in find_next() function 91 int Next = BitVector::find_next(v2x(Prev)); in find_next() 175 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) in operator <<() 1546 for (unsigned R = AVs.find_first(); R; R = AVs.find_next(R)) { in findMatch() 1605 for (unsigned R = Defs.find_first(); R; R = Defs.find_next(R)) { in processBlock() 2224 for (unsigned S = AVs.find_first(); S; S = AVs.find_next(S)) { in genBitSplit() 2469 for (unsigned R = AVs.find_first(); R != 0; R = AVs.find_next(R)) { in simplifyExtractLow()
|
| HD | HexagonRegisterInfo.cpp | 178 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x)) in getReservedRegs()
|
| HD | 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()
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| HD | RDFRegisters.cpp | 336 U = Units.find_next(U); in makeRegRef() 344 U = Units.find_next(U); in makeRegRef() 366 for (int U = Units.find_first(); U >= 0; U = Units.find_next(U)) in print() 374 for (int U = RG.Units.find_first(); U >= 0; U = RG.Units.find_next(U)) { in rr_iterator()
|
| HD | StackSlotColoring.cpp | 285 Color = UsedColors[StackID].find_next(Color); in ColorSlot() 300 NextColors[StackID] = AllColors[StackID].find_next(NextColors[StackID]); in ColorSlot() 387 NextColor = AllColors[StackID].find_next(NextColor); in ColorSlots()
|
| HD | SafeStackColoring.h | 150 idx = V.find_next(idx);
|
| HD | GlobalMerge.cpp | 462 for (j = i; j != -1; j = GlobalSet.find_next(j)) { in doMerge() 524 for (ssize_t k = i, idx = 0; k != j; k = GlobalSet.find_next(k), ++idx) { in doMerge()
|
| HD | ShrinkWrap.cpp | 174 Reg = SavedRegs.find_next(Reg)) in getCurrentCSRs()
|
| HD | StackColoring.cpp | 829 pos = MBBLiveness.LiveIn.find_next(pos)) { in calculateLiveIntervals()
|
| HD | PrologEpilogInserter.cpp | 728 FreeStart = StackBytesFree.find_next(FreeStart)) { in scavengeStackSlot()
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
| HD | ImmutableGraph.h | 170 Current = Set.V.find_next(Current); in advance() 258 Current = Set.V.find_next(Current); in advance()
|
| /freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
| HD | SmallBitVector.h | 274 int find_next(unsigned Prev) const { in find_next() function 283 return getPointer()->find_next(Prev); in find_next()
|
| HD | SparseBitVector.h | 147 int find_next(unsigned Curr) const { in find_next() function 365 int NextSetBitNumber = Iter->find_next(BitNumber % ElementSize) ; in AdvanceToNextNonZero()
|
| HD | BitVector.h | 37 Current = Parent.find_next(Current); in advance() 339 int find_next(unsigned Prev) const { return find_first_in(Prev + 1, Size); } in find_next() function
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/MSF/ |
| HD | MSFBuilder.cpp | 139 Block = FreeBlocks.find_next(Block); in allocateBlocks()
|
| /freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
| HD | CodeGenRegisters.cpp | 973 next_s = SC.find_next(s)) { in computeSubClasses()
|
| HD | CodeGenDAGPatterns.cpp | 4663 for (int p = Matches.find_first(); p != -1; p = Matches.find_next(p)) in GenerateVariants()
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| HD | PPCFrameLowering.cpp | 683 int SecondScratchReg = BV.find_next(*SR1); in findScratchRegister()
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| HD | DependenceAnalysis.cpp | 3370 if (BV.find_next(VI) >= 0) in dumpSmallBitVector()
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| HD | LoopStrengthReduce.cpp | 306 return UsedByIndices.find_next(i) != -1; in isRegUsedByUsesOtherThan()
|