Home
last modified time | relevance | path

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

12

/third_party/boost/libs/algorithm/string/test/
Dfind_test.cpp51 nc_result=find_first( str1, string("abc") ); in find_test()
56 cv_result=find_first( const_cast<const string&>(str1), str2 ); in find_test()
66 ch_result=find_first( pch1, "abc" ); in find_test()
228 nc_vresult=find_first( vec1, string("abc") ); in find_test()
233 cv_vresult=find_first( const_cast<const vector<int>&>(vec1), str2 ); in find_test()
241 nc_result=find_first( str2, string("abcd") ); in find_test()
243 cv_result=find_first( const_cast<const string&>(str2), string("abcd") ); in find_test()
254 nc_result=find_first( str3, string("abcd") ); in find_test()
256 nc_result=find_first( str1, string("") ); in find_test()
259 cv_result=find_first( const_cast<const string&>(str3), string("abcd") ); in find_test()
[all …]
/third_party/boost/boost/algorithm/string/
Dfind.hpp80 find_first( in find_first() function
321 using algorithm::find_first;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
DRDFRegisters.cpp320 int U = Units.find_first(); in makeRegRef()
351 int F = Regs.find_first(); 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()
DHexagonGenInsert.cpp103 unsigned find_first() const { in find_first() function
104 int First = BitVector::find_first(); in find_first()
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 …]
DHexagonFrameLowering.cpp322 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()
2493 int F = Regs.find_first(); in shouldInlineCSR()
DHexagonBitSimplify.cpp83 unsigned find_first() const { in find_first() function
84 int First = BitVector::find_first(); in find_first()
175 for (unsigned R = P.RS.find_first(); R; R = P.RS.find_next(R)) in operator <<()
1470 unsigned DR = Defs.find_first(); in processBlock()
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()
2964 return Defs.find_first(); in getDefReg()
3162 unsigned DefR = Defs.find_first(); in processLoop()
[all …]
DHexagonRegisterInfo.cpp178 for (int x = Reserved.find_first(); x >= 0; x = Reserved.find_next(x)) in getReservedRegs()
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()
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/
DIceBitVector.h99 int find_first() const { return find_first<0>(); } in find_first() function
195 typename std::enable_if<Pos == BitsElements, int>::type find_first() const { in find_first() function
201 Pos<BitsElements, int>::type find_first() const {
205 return find_first<Pos + 1>();
388 int find_first() const { in find_first() function
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DSparseBitVector.h127 int find_first() const { in find_first() function
346 unsigned BitPos = Iter->find_first(); in AdvanceToFirstNonZero()
378 NextSetBitNumber = Iter->find_first(); in AdvanceToNextNonZero()
779 int find_first() const { in find_first() function
783 return (First.index() * ElementSize) + First.find_first(); in find_first()
DSmallBitVector.h227 int find_first() const { in find_first() function
234 return getPointer()->find_first(); in find_first()
DBitVector.h44 : const_set_bits_iterator_impl(Parent, Parent.find_first()) {} in const_set_bits_iterator_impl()
331 int find_first() const { return find_first_in(0, Size); } in find_first() function
/third_party/boost/libs/algorithm/string/example/
Dfind_example.cpp28 iterator_range<string::iterator> range=find_first( str1, string("cde") ); in main()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Mips/
DMips16InstrInfo.cpp387 Reg = Available.find_first(); in loadImmediate()
390 Reg = Candidates.find_first(); in loadImmediate()
403 SpReg = Available.find_first(); in loadImmediate()
405 SpReg = Candidates.find_first(); in loadImmediate()
/third_party/boost/libs/dynamic_bitset/test/
Ddyn_bitset_unit_tests3.cpp308 Tests::find_first(b); in run_test_cases()
313 Tests::find_first(b); in run_test_cases()
318 Tests::find_first(b); in run_test_cases()
323 Tests::find_first(b); in run_test_cases()
329 Tests::find_first(b); in run_test_cases()
Dbitset_test.hpp970 static void find_first(const Bitset& b) in find_first() function
978 BOOST_TEST(b.find_first() == Bitset::npos); // not found; in find_first()
980 BOOST_TEST(b.find_first() == i); in find_first()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DSafeStackColoring.h142 int idx = V.find_first();
DStackSlotColoring.cpp252 NextColors[I] = AllColors[I].find_first(); in InitializeSlots()
278 Color = UsedColors[StackID].find_first(); in ColorSlot()
DGlobalMerge.cpp447 << GlobalSet.find_first() << "\n"); in doMerge()
450 ssize_t i = GlobalSet.find_first(); in doMerge()
DRegisterScavenging.cpp311 int Survivor = Candidates.find_first(); in findSurvivorReg()
359 Survivor = Candidates.find_first(); in findSurvivorReg()
DShrinkWrap.cpp173 for (int Reg = SavedRegs.find_first(); Reg != -1; in getCurrentCSRs()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
DLoopRerollPass.cpp1206 dbgs() << "LRR: " << KV.second.find_first() << "\t" << *KV.first << "\n"; in validate()
1285 if (LastRootIt->second.find_first() < (int)Iter) in validate()
1438 unsigned I = Uses[&*J].find_first(); in replace()
1499 if (KV.second.find_first() == 0) in replaceIV()
/third_party/boost/boost/sort/common/util/
Dsearch.hpp141 inline Iter_t find_first(Iter_t first, Iter_t last, in find_first() function
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/DebugInfo/PDB/Native/
DHashTable.h49 int I = Map.Present.find_first(); in HashTableIterator()
/third_party/boost/libs/range/doc/reference/
Dutilities.qbk292 iterator_range<std::string::iterator> ir = find_first( str, "ll" );
293 sub_range<std::string> sub = find_first( str, "ll" );

12