Searched refs:iters (Results 1 - 25 of 37) sorted by relevance

12

/external/chromium_org/third_party/re2/re2/testing/
H A Dregexp_benchmark.cc105 typedef void SearchImpl(int iters, const char* regexp, const StringPiece& text,
113 typedef void ParseImpl(int iters, const char* regexp, const StringPiece& text);
149 // the text for regexp iters times.
150 void Search(int iters, int nbytes, const char* regexp, SearchImpl* search) { argument
156 search(iters, regexp, s, Prog::kUnanchored, false);
157 SetBenchmarkBytesProcessed(static_cast<int64>(iters)*nbytes);
239 void SearchBigFixed(int iters, int nbytes, SearchImpl* search) { argument
249 search(iters, regexp.c_str(), s, Prog::kUnanchored, true);
250 SetBenchmarkBytesProcessed(static_cast<int64>(iters)*nbytes);
266 void FindAndConsume(int iters, in argument
286 SearchSuccess(int iters, int nbytes, const char* regexp, SearchImpl* search) argument
346 SearchDigits(int iters, SearchImpl* search) argument
373 Parse3Digits(int iters, void (*parse3)(int, const char*, const StringPiece&)) argument
412 Parse3DigitDs(int iters, void (*parse3)(int, const char*, const StringPiece&)) argument
453 Parse1Split(int iters, void (*parse1)(int, const char*, const StringPiece&)) argument
490 Parse1SplitHard(int iters, void (*run)(int, const char*, const StringPiece&)) argument
525 Parse1SplitBig1(int iters, void (*run)(int, const char*, const StringPiece&)) argument
545 Parse1SplitBig2(int iters, void (*run)(int, const char*, const StringPiece&)) argument
566 ParseRegexp(int iters, const string& regexp) argument
574 SimplifyRegexp(int iters, const string& regexp) argument
585 NullWalkRegexp(int iters, const string& regexp) argument
594 SimplifyCompileRegexp(int iters, const string& regexp) argument
608 CompileRegexp(int iters, const string& regexp) argument
619 CompileToProg(int iters, const string& regexp) argument
630 CompileByteMap(int iters, const string& regexp) argument
642 CompilePCRE(int iters, const string& regexp) argument
649 CompileRE2(int iters, const string& regexp) argument
656 RunBuild(int iters, const string& regexp, void (*run)(int, const string&)) argument
692 SearchPhone(int iters, int nbytes, ParseImpl* search) argument
801 SearchDFA(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
818 SearchNFA(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
832 SearchOnePass(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
847 SearchBitState(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
861 SearchPCRE(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
873 SearchRE2(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
889 SearchCachedDFA(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
906 SearchCachedNFA(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
920 SearchCachedOnePass(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
934 SearchCachedBitState(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
947 SearchCachedPCRE(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
959 SearchCachedRE2(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
975 Parse3NFA(int iters, const char* regexp, const StringPiece& text) argument
988 Parse3OnePass(int iters, const char* regexp, const StringPiece& text) argument
1002 Parse3BitState(int iters, const char* regexp, const StringPiece& text) argument
1015 Parse3Backtrack(int iters, const char* regexp, const StringPiece& text) argument
1028 Parse3PCRE(int iters, const char* regexp, const StringPiece& text) argument
1037 Parse3RE2(int iters, const char* regexp, const StringPiece& text) argument
1046 Parse3CachedNFA(int iters, const char* regexp, const StringPiece& text) argument
1059 Parse3CachedOnePass(int iters, const char* regexp, const StringPiece& text) argument
1072 Parse3CachedBitState(int iters, const char* regexp, const StringPiece& text) argument
1084 Parse3CachedBacktrack(int iters, const char* regexp, const StringPiece& text) argument
1096 Parse3CachedPCRE(int iters, const char* regexp, const StringPiece& text) argument
1105 Parse3CachedRE2(int iters, const char* regexp, const StringPiece& text) argument
1118 Parse1NFA(int iters, const char* regexp, const StringPiece& text) argument
1131 Parse1OnePass(int iters, const char* regexp, const StringPiece& text) argument
1145 Parse1BitState(int iters, const char* regexp, const StringPiece& text) argument
1158 Parse1PCRE(int iters, const char* regexp, const StringPiece& text) argument
1167 Parse1RE2(int iters, const char* regexp, const StringPiece& text) argument
1176 Parse1CachedNFA(int iters, const char* regexp, const StringPiece& text) argument
1189 Parse1CachedOnePass(int iters, const char* regexp, const StringPiece& text) argument
1202 Parse1CachedBitState(int iters, const char* regexp, const StringPiece& text) argument
1214 Parse1CachedBacktrack(int iters, const char* regexp, const StringPiece& text) argument
1226 Parse1CachedPCRE(int iters, const char* regexp, const StringPiece& text) argument
1235 Parse1CachedRE2(int iters, const char* regexp, const StringPiece& text) argument
1244 SearchParse2CachedPCRE(int iters, const char* regexp, const StringPiece& text) argument
1254 SearchParse2CachedRE2(int iters, const char* regexp, const StringPiece& text) argument
1264 SearchParse1CachedPCRE(int iters, const char* regexp, const StringPiece& text) argument
1274 SearchParse1CachedRE2(int iters, const char* regexp, const StringPiece& text) argument
[all...]
/external/regex-re2/re2/testing/
H A Dregexp_benchmark.cc105 typedef void SearchImpl(int iters, const char* regexp, const StringPiece& text,
113 typedef void ParseImpl(int iters, const char* regexp, const StringPiece& text);
149 // the text for regexp iters times.
150 void Search(int iters, int nbytes, const char* regexp, SearchImpl* search) { argument
156 search(iters, regexp, s, Prog::kUnanchored, false);
157 SetBenchmarkBytesProcessed(static_cast<int64>(iters)*nbytes);
239 void SearchBigFixed(int iters, int nbytes, SearchImpl* search) { argument
249 search(iters, regexp.c_str(), s, Prog::kUnanchored, true);
250 SetBenchmarkBytesProcessed(static_cast<int64>(iters)*nbytes);
266 void FindAndConsume(int iters, in argument
286 SearchSuccess(int iters, int nbytes, const char* regexp, SearchImpl* search) argument
346 SearchDigits(int iters, SearchImpl* search) argument
373 Parse3Digits(int iters, void (*parse3)(int, const char*, const StringPiece&)) argument
412 Parse3DigitDs(int iters, void (*parse3)(int, const char*, const StringPiece&)) argument
453 Parse1Split(int iters, void (*parse1)(int, const char*, const StringPiece&)) argument
490 Parse1SplitHard(int iters, void (*run)(int, const char*, const StringPiece&)) argument
525 Parse1SplitBig1(int iters, void (*run)(int, const char*, const StringPiece&)) argument
545 Parse1SplitBig2(int iters, void (*run)(int, const char*, const StringPiece&)) argument
566 ParseRegexp(int iters, const string& regexp) argument
574 SimplifyRegexp(int iters, const string& regexp) argument
585 NullWalkRegexp(int iters, const string& regexp) argument
594 SimplifyCompileRegexp(int iters, const string& regexp) argument
608 CompileRegexp(int iters, const string& regexp) argument
619 CompileToProg(int iters, const string& regexp) argument
630 CompileByteMap(int iters, const string& regexp) argument
642 CompilePCRE(int iters, const string& regexp) argument
649 CompileRE2(int iters, const string& regexp) argument
656 RunBuild(int iters, const string& regexp, void (*run)(int, const string&)) argument
692 SearchPhone(int iters, int nbytes, ParseImpl* search) argument
801 SearchDFA(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
818 SearchNFA(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
832 SearchOnePass(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
847 SearchBitState(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
861 SearchPCRE(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
873 SearchRE2(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
889 SearchCachedDFA(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
906 SearchCachedNFA(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
920 SearchCachedOnePass(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
934 SearchCachedBitState(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
947 SearchCachedPCRE(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
959 SearchCachedRE2(int iters, const char* regexp, const StringPiece& text, Prog::Anchor anchor, bool expect_match) argument
975 Parse3NFA(int iters, const char* regexp, const StringPiece& text) argument
988 Parse3OnePass(int iters, const char* regexp, const StringPiece& text) argument
1002 Parse3BitState(int iters, const char* regexp, const StringPiece& text) argument
1015 Parse3Backtrack(int iters, const char* regexp, const StringPiece& text) argument
1028 Parse3PCRE(int iters, const char* regexp, const StringPiece& text) argument
1037 Parse3RE2(int iters, const char* regexp, const StringPiece& text) argument
1046 Parse3CachedNFA(int iters, const char* regexp, const StringPiece& text) argument
1059 Parse3CachedOnePass(int iters, const char* regexp, const StringPiece& text) argument
1072 Parse3CachedBitState(int iters, const char* regexp, const StringPiece& text) argument
1084 Parse3CachedBacktrack(int iters, const char* regexp, const StringPiece& text) argument
1096 Parse3CachedPCRE(int iters, const char* regexp, const StringPiece& text) argument
1105 Parse3CachedRE2(int iters, const char* regexp, const StringPiece& text) argument
1118 Parse1NFA(int iters, const char* regexp, const StringPiece& text) argument
1131 Parse1OnePass(int iters, const char* regexp, const StringPiece& text) argument
1145 Parse1BitState(int iters, const char* regexp, const StringPiece& text) argument
1158 Parse1PCRE(int iters, const char* regexp, const StringPiece& text) argument
1167 Parse1RE2(int iters, const char* regexp, const StringPiece& text) argument
1176 Parse1CachedNFA(int iters, const char* regexp, const StringPiece& text) argument
1189 Parse1CachedOnePass(int iters, const char* regexp, const StringPiece& text) argument
1202 Parse1CachedBitState(int iters, const char* regexp, const StringPiece& text) argument
1214 Parse1CachedBacktrack(int iters, const char* regexp, const StringPiece& text) argument
1226 Parse1CachedPCRE(int iters, const char* regexp, const StringPiece& text) argument
1235 Parse1CachedRE2(int iters, const char* regexp, const StringPiece& text) argument
1244 SearchParse2CachedPCRE(int iters, const char* regexp, const StringPiece& text) argument
1254 SearchParse2CachedRE2(int iters, const char* regexp, const StringPiece& text) argument
1264 SearchParse1CachedPCRE(int iters, const char* regexp, const StringPiece& text) argument
1274 SearchParse1CachedRE2(int iters, const char* regexp, const StringPiece& text) argument
[all...]
/external/chromium_org/content/browser/android/java/
H A Dgin_java_bound_object.cc99 iters = methods_.equal_range(method_name); local
100 if (iters.first == iters.second) {
107 for (JavaMethodMap::const_iterator iter = iters.first; iter != iters.second;
/external/chromium_org/third_party/skia/src/core/
H A DSkCubicClipper.cpp40 int iters = 0; local
54 ++iters;
55 } while (!converged && (iters < maxiters));
84 int iters = 0;
99 ++iters;
/external/skia/src/core/
H A DSkCubicClipper.cpp40 int iters = 0; local
54 ++iters;
55 } while (!converged && (iters < maxiters));
84 int iters = 0;
99 ++iters;
/external/chromium_org/third_party/skia/tests/
H A DPathOpsCubicLineIntersectionIdeas.cpp55 int* iters) {
58 *iters += 1;
143 int iters = 0; local
219 double newT = binary_search(cubic, step, pt, t, &iters);
239 SkDebugf("errors=%d avgIter=%1.9g", errors, (double) iters / errors);
264 int iters = 0;
265 double newT = binary_search(cubic, 0.1, pt, t, &iters);
54 binary_search(const SkDCubic& cubic, double step, const SkDPoint& pt, double t, int* iters) argument
/external/skia/tests/
H A DPathOpsCubicLineIntersectionIdeas.cpp55 int* iters) {
58 *iters += 1;
143 int iters = 0; local
219 double newT = binary_search(cubic, step, pt, t, &iters);
239 SkDebugf("errors=%d avgIter=%1.9g", errors, (double) iters / errors);
264 int iters = 0;
265 double newT = binary_search(cubic, 0.1, pt, t, &iters);
54 binary_search(const SkDCubic& cubic, double step, const SkDPoint& pt, double t, int* iters) argument
/external/eigen/Eigen/src/IterativeLinearSolvers/
H A DConjugateGradient.h23 * \param iters On input the max number of iteration, on output the number of performed iterations.
29 const Preconditioner& precond, int& iters,
39 int maxIters = iters;
49 iters = 0;
57 iters = 0;
89 iters = i;
28 conjugate_gradient(const MatrixType& mat, const Rhs& rhs, Dest& x, const Preconditioner& precond, int& iters, typename Dest::RealScalar& tol_error) argument
H A DBiCGSTAB.h24 * \param iters On input the max number of iteration, on output the number of performed iterations.
30 const Preconditioner& precond, int& iters,
39 int maxIters = iters;
105 iters = i;
29 bicgstab(const MatrixType& mat, const Rhs& rhs, Dest& x, const Preconditioner& precond, int& iters, typename Dest::RealScalar& tol_error) argument
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DMINRES.h26 * \param iters On input the max number of iteration, on output the number of performed iterations.
32 const Preconditioner& precond, int& iters,
41 const int maxIters(iters); // initialize maxIters to iters
70 iters = 0; // reset iters
71 while ( iters < maxIters ){
122 iters++; // increment iteration number (for output purposes)
31 minres(const MatrixType& mat, const Rhs& rhs, Dest& x, const Preconditioner& precond, int& iters, typename Dest::RealScalar& tol_error) argument
H A DGMRES.h27 * \param iters on input: maximum number of iterations to perform
57 int &iters, const int &restart, typename Dest::RealScalar & tol_error) {
68 const int maxIters = iters;
69 iters = 0;
96 ++iters;
150 bool stop=(k==m || abs(w(k)) < tol || iters == maxIters);
56 gmres(const MatrixType & mat, const Rhs & rhs, Dest & x, const Preconditioner & precond, int &iters, const int &restart, typename Dest::RealScalar & tol_error) argument
/external/chromium_org/third_party/webrtc/modules/audio_processing/ns/
H A Dnsx_core_mips.c336 int iters, after; local
358 "sra %[iters], %[anaLen], 3 \n\t"
360 "blez %[iters], 2f \n\t"
413 " addiu %[iters], %[iters], -1 \n\t"
434 [iters] "=&r" (iters), [after] "=&r" (after),
444 "sra %[iters], %[anaLen], 2 \n\t"
446 "blez %[iters], 2f \n\t"
476 " addiu %[iters],
512 int iters = inst->blockLen10ms >> 2; local
[all...]
/external/chromium_org/third_party/boringssl/src/crypto/chacha/
H A Dchacha_vec.c149 unsigned iters, i, *op=(unsigned *)out, *ip=(unsigned *)in, *kp; local
188 for (iters = 0; iters < inlen/(BPI*64); iters++)
217 x12 = counter+BPI*iters+(BPI-1); x13 = 0;
269 op[12] = REVW_BE(REVW_BE(ip[12]) ^ (x12 + counter+BPI*iters+(BPI-1)));
279 for (iters = inlen%(BPI*64)/64; iters != 0; iters--)
/external/eigen/bench/
H A Dbench_norm.cpp219 for (int i=0; i<iters; ++i) NRM(vf); \
224 for (int i=0; i<iters; ++i) NRM(vd); \
229 for (int i=0; i<iters; ++i) NRM(vcf); \
275 int iters = 100000; local
318 int iters = 1; local
333 int iters = 100000; local
H A Dquat_slerp.cpp166 int iters = 40; local
185 for (int i=0; i<iters; ++i)
214 avgerr /= RefScalar(rep*iters);
/external/chromium_org/third_party/skia/bench/
H A Dbench_util.py143 iters = [float(i) for i in
147 iters)
239 _ListAlgorithm(iters, representation).compute()
240 for iters in bench_dic[bench][config][time_type]]
/external/skia/bench/
H A Dbench_util.py143 iters = [float(i) for i in
147 iters)
239 _ListAlgorithm(iters, representation).compute()
240 for iters in bench_dic[bench][config][time_type]]
/external/chromium_org/third_party/brotli/src/brotli/enc/
H A Dblock_splitter.cc131 int iters = local
134 iters = ((iters + vec->size() - 1) / vec->size()) * vec->size();
135 for (int iter = 0; iter < iters; ++iter) {
/external/chromium_org/v8/benchmarks/
H A Dnavier-stokes.js340 this.setIterations = function(iters) {
341 if (iters > 0 && iters <= 100)
342 iterations = iters;
/external/opencv/cxcore/src/
H A Dcxjacobieigens.cpp71 int i, j, k, ind, iters = 0; local
100 while( Amax > ax && iters++ < 100 )
222 int i, j, k, p, q, ind, iters = 0; local
251 while( Amax > ax && iters++ < 100 )
H A Dcxsvd.cpp249 int iters = 0; local
486 iters = 0;
532 if( l == k || iters++ == MAX_ITERS )
587 if( iters > MAX_ITERS )
644 int iters = 0; local
883 iters = 0;
928 if( l == k || iters++ == MAX_ITERS )
983 if( iters > MAX_ITERS )
/external/chromium_org/third_party/smhasher/src/
H A DCity.cpp373 size_t iters = len / 240; local
374 len -= iters * 240;
396 } while (--iters > 0);
/external/valgrind/main/coregrind/
H A Dm_main.c2017 ULong iters, q; local
2022 iters = 10;
2024 iters = 10;
2026 iters = 5;
2028 iters = 5;
2030 iters = 5;
2032 iters = 10;
2034 iters = 10;
2036 iters = 3;
2041 iters *
[all...]
/external/chromium_org/third_party/leveldatabase/src/db/
H A Dversion_set.h61 // Append to *iters a sequence of iterators that will
64 void AddIterators(const ReadOptions&, std::vector<Iterator*>* iters);
/external/chromium_org/third_party/tcmalloc/chromium/src/tests/
H A Daddressmap_unittest.cc42 DEFINE_int32(iters, 20, "Number of test iterations");

Completed in 740 milliseconds

12