/external/valgrind/drd/tests/ |
omp_printf.c | 26 int num_iterations = 2; local 34 case 'i': num_iterations = atoi(optarg); break; 46 assert(num_iterations > 0); 53 for (i = 0; i < num_iterations; i++)
|
/external/autotest/server/site_tests/network_WiFi_ReconnectInDarkResume/ |
network_WiFi_ReconnectInDarkResume.py | 23 num_iterations=1): 31 @param num_iterations: number of times to bring the AP down and up 70 for iter_num in xrange(1, num_iterations+1): 72 (iter_num, num_iterations)) 106 if disconnect_before_suspend and num_iterations == 1: 116 expected_num_dark_resumes = 2 * num_iterations
|
/external/ceres-solver/internal/ceres/ |
trust_region_strategy.h | 108 num_iterations(-1), 124 int num_iterations; member in struct:ceres::internal::TrustRegionStrategy::Summary
|
conjugate_gradients_solver.cc | 79 summary.num_iterations = 0; 116 for (summary.num_iterations = 1; 117 summary.num_iterations < options_.max_num_iterations; 118 ++summary.num_iterations) { 135 if (summary.num_iterations == 1) { 175 if (summary.num_iterations % options_.residual_reset_period == 0) { 209 const double zeta = summary.num_iterations * (Q1 - Q0) / Q1;
|
sparse_normal_cholesky_solver.cc | 132 summary.num_iterations = 0; 146 summary.num_iterations = 1; 229 summary.num_iterations = 0; 243 summary.num_iterations = 1; 311 summary.num_iterations = 0; 324 summary.num_iterations = 1;
|
schur_complement_solver.cc | 120 summary.num_iterations = 0; 134 summary.num_iterations = 1; 277 summary.num_iterations = 0; 286 summary.num_iterations = 0; 301 summary.num_iterations = 1; 384 summary.num_iterations = 0; 393 summary.num_iterations = 0; 440 summary.num_iterations = 0; 452 summary.num_iterations = 0;
|
solver_test.cc | 103 int num_iterations; local 107 num_iterations = summary.num_successful_steps + 109 EXPECT_GT(num_iterations, 1); 119 num_iterations = summary.num_successful_steps + 121 EXPECT_GT(num_iterations, 1);
|
dense_normal_cholesky_solver.cc | 97 summary.num_iterations = 1; 156 summary.num_iterations = 1;
|
dense_qr_solver.cc | 105 summary.num_iterations = 1; 161 summary.num_iterations = 1;
|
iterative_schur_complement_solver.cc | 90 cg_summary.num_iterations = 0; 159 cg_summary.num_iterations = 0;
|
levenberg_marquardt_strategy.cc | 138 summary.num_iterations = linear_solver_summary.num_iterations;
|
line_search.h | 184 num_iterations(0) {} 190 int num_iterations; member in struct:ceres::internal::LineSearch::Summary
|
linear_solver.h | 267 num_iterations(-1), 272 int num_iterations; member in struct:ceres::internal::LinearSolver::Summary
|
line_search.cc | 271 ++summary->num_iterations; 272 if (summary->num_iterations >= options().max_num_iterations) { 490 ++summary->num_iterations; 562 } else if (summary->num_iterations >= options().max_num_iterations) { 699 const int num_bracketing_iterations = summary->num_iterations; 708 if (summary->num_iterations >= options().max_num_iterations) { 731 ++summary->num_iterations; [all...] |
/external/autotest/client/site_tests/hardware_MemoryLatency/ |
hardware_MemoryLatency.py | 19 def _run_benchmarks(self, warmup, num_iterations, max_size_mb, 26 num_iterations: integer number of times to run the benchmark on each 43 num_iterations, max_size_mb, 81 def run_once(self, warmup=100, num_iterations=20, max_size_mb='32', 83 self._run_benchmarks(warmup, num_iterations, max_size_mb,
|
/external/autotest/client/site_tests/hardware_MemoryThroughput/ |
hardware_MemoryThroughput.py | 23 def _run_benchmarks(self, test, warmup, num_iterations, parallel, sizes): 30 num_iterations: integer number of times to run the benchmark on each 39 num_iterations, 71 def run_once(self, test='bcopy', warmup=100, num_iterations=20, 73 self._run_benchmarks(test, warmup, num_iterations, parallel,
|
/external/autotest/client/site_tests/firmware_TouchMTB/ |
noise_summary.py | 24 def __init__(self, num_iterations): 31 self.num_iterations = num_iterations 34 for x in range(0, self.num_iterations): 102 ParseReport.__init__(self, num_iterations=0) 113 self.num_iterations = self.num_iterations + 1 194 plt.subplot(parse_report.num_iterations, 1, iteration) 234 p = ParseReport(c.num_iterations)
|
/external/zopfli/src/zopflipng/ |
zopflipng_lib.h | 63 int num_iterations; member in struct:ZopfliPNGOptions
|
/external/autotest/site_utils/bootperf-bin/ |
perfprinter.py | 24 for i in range(0, keyset.num_iterations): 71 print "(on %d cycles):" % keyset.num_iterations
|
/frameworks/ml/bordeaux/learning/multiclass_pa/native/ |
multiclass_pa.h | 65 // Iteratively train the model for num_iterations on the given dataset. 67 int num_iterations); 70 int num_iterations);
|
multiclass_pa.cpp | 174 int num_iterations) { 177 for (int t = 0; t < num_iterations; ++t) { 182 return total_loss / static_cast<float>(num_iterations); 187 int num_iterations) { 190 for (int t = 0; t < num_iterations; ++t) { 195 return total_loss / static_cast<float>(num_iterations);
|
/external/autotest/client/site_tests/graphics_VTSwitch/ |
graphics_VTSwitch.py | 53 num_iterations=2, 71 keyvals['num_iterations'] = num_iterations 93 for iteration in xrange(num_iterations):
|
/external/autotest/server/site_tests/network_StressServoEthernetPlug/ |
network_StressServoEthernetPlug.py | 114 def run_once(self, num_iterations=1): 115 for iteration in range(num_iterations):
|
/external/harfbuzz_ng/util/ |
shape-consumer.hh | 56 for (unsigned int n = shaper.num_iterations; n; n--)
|
/external/autotest/client/site_tests/network_EthernetStressPlug/ |
network_EthernetStressPlug.py | 444 def run_once(self, num_iterations=1): 450 for i in range(num_iterations): 470 if self.warning_count > num_iterations * self.warning_threshold: 475 num_iterations,
|