| /third_party/boost/libs/dynamic_bitset/test/ |
| D | dyn_bitset_unit_tests3.cpp | 338 Tests::find_next(b, 0); in run_test_cases()
339 Tests::find_next(b, 1); in run_test_cases()
340 Tests::find_next(b, 200); in run_test_cases()
341 Tests::find_next(b, b.npos); in run_test_cases()
348 Tests::find_next(b, 0); in run_test_cases()
349 Tests::find_next(b, 1); in run_test_cases()
350 Tests::find_next(b, 200); in run_test_cases()
351 Tests::find_next(b, b.npos); in run_test_cases()
361 Tests::find_next(b, i); in run_test_cases()
363 Tests::find_next(b, b.npos); in run_test_cases()
[all …]
|
| D | bitset_test.hpp | 986 static void find_next(const Bitset& b, typename Bitset::size_type prev) in find_next() function
988 BOOST_TEST(next_bit_on(b, prev) == b.find_next(prev)); in find_next()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | 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()
|
| D | 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 …]
|
| D | 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()
|
| D | HexagonRegisterInfo.cpp | 178 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x)) in getReservedRegs()
|
| D | 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()
|
| D | 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()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/ |
| D | IceBitVector.h | 101 int find_next(unsigned Prev) const { return find_next<0>(Prev); } in find_next() function
210 find_next(unsigned) const { in find_next() function
216 Pos<BitsElements, int>::type find_next(unsigned Prev) const {
226 return find_next<Pos + 1>(Prev);
397 int find_next(unsigned Prev) const { in find_next() function
|
| D | IceCfgNode.cpp | 715 if (Live.find_next(NumGlobalVars) != -1) { in liveness()
868 i = LiveInAndOut.find_next(i)) { in livenessAddIntervals()
|
| D | IceOperand.h | 544 Current = V.find_next(Current);
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | 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()
|
| D | SafeStackColoring.h | 150 idx = V.find_next(idx);
|
| D | 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()
|
| D | ShrinkWrap.cpp | 174 Reg = SavedRegs.find_next(Reg)) in getCurrentCSRs()
|
| D | StackColoring.cpp | 829 pos = MBBLiveness.LiveIn.find_next(pos)) { in calculateLiveIntervals()
|
| D | PrologEpilogInserter.cpp | 728 FreeStart = StackBytesFree.find_next(FreeStart)) { in scavengeStackSlot()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | SmallBitVector.h | 274 int find_next(unsigned Prev) const { in find_next() function
283 return getPointer()->find_next(Prev); in find_next()
|
| D | SparseBitVector.h | 147 int find_next(unsigned Curr) const { in find_next() function
365 int NextSetBitNumber = Iter->find_next(BitNumber % ElementSize) ; in AdvanceToNextNonZero()
|
| D | 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
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/DebugInfo/MSF/ |
| D | MSFBuilder.cpp | 139 Block = FreeBlocks.find_next(Block); in allocateBlocks()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| D | BitVector.h | 166 int find_next(unsigned Prev) const { in find_next() function
|
| /third_party/boost/boost/dynamic_bitset/ |
| D | dynamic_bitset.hpp | 326 size_type find_next(size_type pos) const;
1308 if (find_next(ulong_width - 1) != npos) in to_ulong()
1471 dynamic_bitset<Block, Allocator>::find_next(size_type pos) const in find_next() function in boost::dynamic_bitset
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/ |
| D | PPCFrameLowering.cpp | 683 int SecondScratchReg = BV.find_next(*SR1); in findScratchRegister()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | DependenceAnalysis.cpp | 3370 if (BV.find_next(VI) >= 0) in dumpSmallBitVector()
|