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

  /external/eigen/bench/
bench_reverse.cpp 24 int repeats = (REPEAT*1000)/size; local
36 for (int k=0; k<repeats; ++k)
51 << (timerB.value() * REPEAT) / repeats << "s "
52 << "(" << 1e-6 * size*repeats/timerB.value() << " MFLOPS)\t";
spmv.cpp 11 #define SPMV_BENCH(CODE) BENCH(t,tries,repeats,CODE);
44 int repeats = 2; local
67 repeats = atoi(argv[i]+1);
76 std::cout << argv[0] << " r<nb rows> c<nb columns> n<non zeros per column> t<nb tries> p<nb repeats>\n";
80 std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats << " repeats, and " << tries << " tries)\n\n";
100 std::cout << "Dense " << t.value()/repeats << "\t";
103 std::cout << t.value()/repeats << endl;
110 std::cout << "Eigen " << t.value()/repeats << "\t";
113 std::cout << t.value()/repeats << endl
    [all...]
benchCholesky.cpp 41 int repeats = (REPEAT*1000)/(rows*rows); local
57 for (int k=0; k<repeats; ++k)
68 for (int k=0; k<repeats; ++k)
81 << (timerNoSqrt.value() * REPEAT) / repeats << "s "
82 << "(" << 1e-6 * cost*repeats/timerNoSqrt.value() << " MFLOPS)\t"
83 << (timerSqrt.value() * REPEAT) / repeats << "s "
84 << "(" << 1e-6 * cost*repeats/timerSqrt.value() << " MFLOPS)\n";
99 for (int k=0; k<repeats; ++k)
109 << timerSqrt.value() * REPEAT / repeats << "s"; local
  /external/v8/src/
serialize.cc 1028 int repeats = source_->GetInt(); local
1043 int repeats = RepeatsForCode(data); local
    [all...]
  /external/toybox/generated/
globals.h 1151 long repeats; member in struct:uniq_data
  /frameworks/base/services/core/java/com/android/server/wm/
WindowManagerService.java 9917 int repeats = 0; local
    [all...]

Completed in 338 milliseconds