Home
last modified time | relevance | path

Searched refs:find_next (Results 1 – 25 of 25) sorted by relevance

/freebsd/crypto/heimdal/lib/sl/
H A Dslc-gram.y274 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()
H A Dslc-gram.c1783 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/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonGenInsert.cpp109 unsigned find_next(unsigned Prev) const { in find_next() function
110 int Next = BitVector::find_next(v2x(Prev)); in find_next()
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 …]
H A DHexagonFrameLowering.cpp328 for (int x = CSR.find_first(); x >= 0; x = CSR.find_next(x)) { in needsStackFrame()
1550 for (int x = Regs.find_first(); x >= 0; x = Regs.find_next(x)) { in dump_registers()
1604 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x)) { in assignCalleeSavedSpillSlots()
1619 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1624 for (int x = TmpSup.find_first(); x >= 0; x = TmpSup.find_next(x)) { in assignCalleeSavedSpillSlots()
1643 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1677 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
1706 for (int x = SRegs.find_first(); x >= 0; x = SRegs.find_next(x)) { in assignCalleeSavedSpillSlots()
2602 int N = Regs.find_next(F); in shouldInlineCSR()
H A DHexagonBitSimplify.cpp100 unsigned find_next(unsigned Prev) const { in find_next() function
101 int Next = Bits.find_next(v2x(Prev)); in find_next()
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 <<()
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()
2260 for (unsigned S = AVs.find_first(); S; S = AVs.find_next(S)) { in genBitSplit()
2505 for (unsigned R = AVs.find_first(); R != 0; R = AVs.find_next(R)) { in simplifyExtractLow()
H A DHexagonSplitDouble.cpp233 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()
282 for (int x = DoubleRegs.find_first(); x >= 0; x = DoubleRegs.find_next(x)) { in partitionRegisters()
H A DHexagonRegisterInfo.cpp202 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x)) in getReservedRegs()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DStackSlotColoring.cpp317 Color = UsedColors[StackID].find_next(Color); in ColorSlot()
332 NextColors[StackID] = AllColors[StackID].find_next(NextColors[StackID]); in ColorSlot()
417 NextColor = AllColors[StackID].find_next(NextColor); in ColorSlots()
H A DRDFRegisters.cpp368 U = Units.find_next(U); in intersectWith()
374 U = Units.find_next(U);
396 for (int U = RG.Units.find_first(); U >= 0; U = RG.Units.find_next(U)) { in makeRegRef()
H A DGlobalMerge.cpp493 for (j = i; j != -1; j = GlobalSet.find_next(j)) { in doMerge()
555 for (ssize_t k = i, idx = 0; k != j; k = GlobalSet.find_next(k), ++idx) { in doMerge()
H A DShrinkWrap.cpp186 Reg = SavedRegs.find_next(Reg)) in getCurrentCSRs()
H A DStackColoring.cpp844 pos = MBBLiveness.LiveIn.find_next(pos)) { in calculateLiveIntervals()
H A DPrologEpilogInserter.cpp791 FreeStart = StackBytesFree.find_next(FreeStart)) { in scavengeStackSlot()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DStackLifetime.h172 for (int Idx = V.find_first(); Idx >= 0; Idx = V.find_next(Idx))
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DImmutableGraph.h169 Current = Set.V.find_next(Current); in advance()
257 Current = Set.V.find_next(Current); in advance()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSmallBitVector.h277 int find_next(unsigned Prev) const { in find_next() function
286 return getPointer()->find_next(Prev); in find_next()
H A DSparseBitVector.h146 /// find_next - Returns the index of the next set bit starting from the
148 int find_next(unsigned Curr) const { in find_next() function
366 int NextSetBitNumber = Iter->find_next(BitNumber % ElementSize) ; in AdvanceToNextNonZero()
H A DBitVector.h40 Current = Parent.find_next(Current); in advance()
308 int find_next(unsigned Prev) const { return find_first_in(Prev + 1, Size); } in find_next() function
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/MSF/
H A DMSFBuilder.cpp141 Block = FreeBlocks.find_next(Block); in allocateBlocks()
/freebsd/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_affinity.cpp3612 FindNextFunctionType find_next) { in __kmp_create_os_id_masks() argument
3622 i = find_next(-1); in __kmp_create_os_id_masks()
3658 i = j = leader = find_next(-1); in __kmp_create_os_id_masks()
3661 for (i = find_next(i); i < numAddrs; i = find_next(i)) { in __kmp_create_os_id_masks()
3672 for (; j < i; j = find_next(j)) { in __kmp_create_os_id_masks()
3690 for (; j < i; j = find_next(j)) { in __kmp_create_os_id_masks()
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenRegisters.cpp1039 next_s = SC.find_next(s)) { in computeSubClasses()
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCFrameLowering.cpp512 int SecondScratchReg = BV.find_next(*SR1); in findScratchRegister()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DDependenceAnalysis.cpp3558 if (BV.find_next(VI) >= 0) in dumpSmallBitVector()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp465 return UsedByIndices.find_next(i) != -1; in isRegUsedByUsesOtherThan()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp1026 Idx = UnusedIndices.find_next(Idx); in fixupOrderingIndices()
1027 MIdx = MaskedIndices.find_next(MIdx); in fixupOrderingIndices()