Searched refs:find_next (Results 1 - 24 of 24) sorted by relevance

/freebsd-11-stable/crypto/heimdal/lib/sl/
H A Dslc-gram.y274 find_next(struct assignment *as, const char *name)
472 tmp = find_next(tmp, "option")) {
529 tmp = find_next(tmp, "option")) {
567 tmp = find_next(tmp, "option")) {
583 tmp = find_next(tmp, "option")) {
656 tmp = find_next(tmp, "option")) {
675 tmp = find_next(tmp, "option")) {
H A Dslc-gram.c1786 find_next(struct assignment *as, const char *name)
1984 tmp = find_next(tmp, "option")) {
2041 tmp = find_next(tmp, "option")) {
2079 tmp = find_next(tmp, "option")) {
2095 tmp = find_next(tmp, "option")) {
2168 tmp = find_next(tmp, "option")) {
2187 tmp = find_next(tmp, "option")) {
1783 find_next(struct assignment *as, const char *name) function
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DSafeStackColoring.h150 idx = V.find_next(idx);
H A DRDFRegisters.cpp336 U = Units.find_next(U);
344 U = Units.find_next(U);
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.cpp285 Color = UsedColors[StackID].find_next(Color);
300 NextColors[StackID] = AllColors[StackID].find_next(NextColors[StackID]);
387 NextColor = AllColors[StackID].find_next(NextColor);
H A DGlobalMerge.cpp462 for (j = i; j != -1; j = GlobalSet.find_next(j)) {
524 for (ssize_t k = i, idx = 0; k != j; k = GlobalSet.find_next(k), ++idx) {
H A DShrinkWrap.cpp174 Reg = SavedRegs.find_next(Reg))
H A DStackColoring.cpp829 pos = MBBLiveness.LiveIn.find_next(pos)) {
H A DPrologEpilogInserter.cpp728 FreeStart = StackBytesFree.find_next(FreeStart)) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonGenInsert.cpp110 unsigned find_next(unsigned Prev) const { function in struct:__anon2245::RegisterSet
111 int Next = BitVector::find_next(v2x(Prev));
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(); R; R = AllRMs.find_next(
[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)) {
2497 int N = Regs.find_next(F);
H A DHexagonRegisterInfo.cpp178 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x))
H A DHexagonBitSimplify.cpp90 unsigned find_next(unsigned Prev) const { function in struct:__anon2220::RegisterSet
91 int Next = BitVector::find_next(v2x(Prev));
175 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R))
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)) {
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/include/llvm/ADT/
H A DSparseBitVector.h145 /// find_next - Returns the index of the next set bit starting from the
147 int find_next(unsigned Curr) const {
365 int NextSetBitNumber = Iter->find_next(BitNumber % ElementSize) ;
H A DSmallBitVector.h274 int find_next(unsigned Prev) const { function in class:llvm::SmallBitVector
283 return getPointer()->find_next(Prev);
H A DBitVector.h37 Current = Parent.find_next(Current);
337 /// find_next - Returns the index of the next set bit following the
339 int find_next(unsigned Prev) const { return find_first_in(Prev + 1, Size); } function in class:llvm::BitVector
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DImmutableGraph.h170 Current = Set.V.find_next(Current);
258 Current = Set.V.find_next(Current);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/MSF/
H A DMSFBuilder.cpp139 Block = FreeBlocks.find_next(Block);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCFrameLowering.cpp683 int SecondScratchReg = BV.find_next(*SR1);
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DCodeGenRegisters.cpp973 next_s = SC.find_next(s)) {
H A DCodeGenDAGPatterns.cpp4663 for (int p = Matches.find_first(); p != -1; p = Matches.find_next(p))
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DDependenceAnalysis.cpp3370 if (BV.find_next(VI) >= 0)
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp306 return UsedByIndices.find_next(i) != -1;

Completed in 366 milliseconds