HomeSort by relevance Sort by last modified time
    Searched defs:trials (Results 1 - 9 of 9) sorted by null

  /external/chromium_org/third_party/smhasher/src/
Types.cpp 71 int trials = 0; local
82 trials++;
145 printf("%d %d %d %d %d %d\n",trials,popfail,bitfail,matchfail,primefail,count);
SpeedTest.cpp 168 double SpeedTest ( pfHash hash, uint32_t seed, const int trials, const int blocksize, const int align )
186 times.reserve(trials);
188 for(int itrial = 0; itrial < trials; itrial++)
213 const int trials = 2999; local
220 double cycles = SpeedTest(hash,seed,trials,blocksize,align);
233 const int trials = 999999; local
237 double cycles = SpeedTest(hash,seed,trials,keysize,0);
  /external/chromium_org/chrome/common/extensions/docs/examples/extensions/ttsdebug/
ttsdebug.js 8 var trials = 3; variable
55 trials: 3,
103 trials: 3,
138 trials: 3,
175 trials: 1,
219 trials: 1,
241 trials: 1,
263 trials: 1,
285 trials: 1,
400 trials: 3
    [all...]
  /external/chromium_org/components/variations/
entropy_provider_unittest.cc 137 // Number of buckets in the simulated field trials.
186 // Simply asserts that two trials using one-time randomization
194 scoped_refptr<base::FieldTrial> trials[] = { local
203 for (size_t i = 0; i < arraysize(trials); ++i) {
205 trials[i]->AppendGroup(std::string(), 1);
208 // The trials are most likely to give different results since they have
210 EXPECT_NE(trials[0]->group(), trials[1]->group());
211 EXPECT_NE(trials[0]->group_name(), trials[1]->group_name())
224 scoped_refptr<base::FieldTrial> trials[] = { local
251 scoped_refptr<base::FieldTrial> trials[] = { local
    [all...]
  /external/valgrind/main/coregrind/
m_cache.c 120 Int i, j, trials; local
136 trials = info[0] - 1; /* AL register - bits 0..7 of %eax */
139 if (0 != trials) {
140 VG_(debugLog)(1, "cache", "warning: non-zero CPUID trials for Intel "
141 "processor (%d)\n", trials);
  /frameworks/av/services/audioflinger/
test-resample.cpp 392 * it is better to run a few trials with a shorter loop limit,
407 const int trials = 4; local
412 for (int n = 0; n < trials; ++n) {
423 time = diff_ns; // save the best out of our trials.
  /external/chromium_org/net/url_request/
url_request_throttler_simulation_unittest.cc 659 VerboseOut(" Test result after %d trials.\n", num_runs);
687 Trial trials[] = { local
710 // If things don't converge by the time we've done 100K trials, then
713 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(trials); ++i) {
715 ++trials[i].stats.num_runs;
717 trials[i].duration, trials[i].average_client_interval, false);
719 trials[i].duration, trials[i].average_client_interval, true);
722 trials[i].stats.total_ratio_unprotected += ratio_unprotected
    [all...]
  /external/clang/tools/c-index-test/
c-index-test.c 4045 int trials = atoi(argv[2]); local
    [all...]
  /libcore/benchmarks/libs/
caliper.jar 

Completed in 231 milliseconds