HomeSort by relevance Sort by last modified time
    Searched defs:tries (Results 1 - 25 of 175) sorted by null

1 2 3 4 5 6 7

  /external/eigen/bench/
basicbenchmark.cpp 21 const int tries = 10; local
26 BOOST_PP_SEQ_ELEM(1,EL),BOOST_PP_SEQ_ELEM(1,EL)), BOOST_PP_SEQ_ELEM(2,EL), tries) \
quatmul.cpp 22 int tries = 10; local
32 BENCH(t, tries, rep, quatmul_default(a,b,c));
35 BENCH(t, tries, rep, quatmul_novec(a,b,c));
spmv.cpp 11 #define SPMV_BENCH(CODE) BENCH(t,tries,repeats,CODE);
43 int tries = 2; local
63 tries = 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"; local
dense_solvers.cpp 43 int tries = 5; local
59 BENCH(t_llt, tries, rep, compute_norm_equation(llt,A));
60 BENCH(t_ldlt, tries, rep, compute_norm_equation(ldlt,A));
61 BENCH(t_lu, tries, rep, compute_norm_equation(lu,A));
63 BENCH(t_fplu, tries, rep, compute_norm_equation(fplu,A));
64 BENCH(t_qr, tries, rep, compute(qr,A));
65 BENCH(t_cpqr, tries, rep, compute(cpqr,A));
66 BENCH(t_cod, tries, rep, compute(cod,A));
68 BENCH(t_fpqr, tries, rep, compute(fpqr,A));
70 BENCH(t_jsvd, tries, rep, jsvd.compute(A,svd_opt))
    [all...]
  /art/libdexfile/dex/
dex_file_exception_helpers.cc 32 const DexFile::TryItem* tries = accessor.TryItems().begin(); local
33 uint32_t start = tries->start_addr_;
35 uint32_t end = start + tries->insn_count_;
37 offset = tries->handler_off_;
  /external/libcups/cups/
tempfile.c 43 int tries; /* Number of tries */ local
83 tries = 0;
92 curtime = GetTickCount() + tries;
110 snprintf(filename, (size_t)len - 1, "%s/%05x%08x", tmpdir, (unsigned)getpid(), (unsigned)(curtime.tv_sec + curtime.tv_usec + tries));
130 tries ++;
132 while (fd < 0 && tries < 1000);
  /external/eigen/bench/perf_monitoring/gemm/
gemm.cpp 45 long tries = std::max(tm0, std::min(tm1, up/flops) ); local
47 BENCH(t, tries, rep, gemm(A,B,C));
lazy_gemm.cpp 46 long tries = std::max(tm0, std::min(tm1, up/flops) ); local
48 BENCH(t, tries, rep, lazy_gemm(A,B,C));
  /external/google-breakpad/src/common/android/testing/
mkdtemp.h 92 int tries; local
93 for (tries = 128; tries > 0; tries--) {
  /external/vboot_reference/firmware/lib/cgptlib/
cgptlib.c 130 int tries; local
133 * Successfully booted this partition, so tries field
138 tries = GetEntryTries(e);
139 if (tries > 1) {
140 /* Still have tries left */
142 SetEntryTries(e, tries - 1);
145 /* Out of tries, so drop through and mark partition bad. */
151 * Only clear tries and priority if the successful bit
  /prebuilts/go/darwin-x86/src/runtime/cgo/
gcc_libinit.c 95 int tries; local
99 for (tries = 0; tries < 20; tries++) {
109 ts.tv_nsec = (tries + 1) * 1000 * 1000; // Milliseconds.
  /prebuilts/go/linux-x86/src/runtime/cgo/
gcc_libinit.c 95 int tries; local
99 for (tries = 0; tries < 20; tries++) {
109 ts.tv_nsec = (tries + 1) * 1000 * 1000; // Milliseconds.
  /system/netd/server/dns/
DnsTlsQueryMap.h 86 int tries = 0; member in struct:android::net::DnsTlsQueryMap::QueryPromise
  /dalvik/libdex/
DexCatch.h 131 const DexTry* tries = dexGetTries(pCode); local
132 u4 start = tries[0].startAddr;
138 u4 end = start + tries[0].insnCount;
144 offset = tries[0].handlerOff;
  /external/eigen/Eigen/src/SparseLU/
SparseLU_Memory.h 105 Index tries = 0; // Number of attempts local
122 tries += 1;
123 if ( tries > 10) return new_len;
  /external/ltp/testcases/kernel/containers/netns/
netns_netlink.c 69 int fd, len, event_found, tries; local
96 tries = 0;
99 while (tries < MAX_TRIES) {
111 tries++;
  /external/valgrind/memcheck/tests/solaris/
door_data.c 103 int tries; local
107 tries = 0;
116 if (tries > 10) {
123 tries++;
  /external/vboot_reference/firmware/2lib/
2misc.c 80 /* Use up remaining tries */
318 uint32_t tries; local
335 tries = vb2_nv_get(ctx, VB2_NV_TRY_COUNT);
339 tries == 0) {
348 if (tries > 0) {
353 vb2_nv_set(ctx, VB2_NV_TRY_COUNT, tries - 1);
  /bionic/libc/upstream-openbsd/lib/libc/stdio/
mktemp.c 49 unsigned int tries; local
74 tries = INT_MAX;
107 } while (--tries);
  /bootable/recovery/bootloader_message/
bootloader_message.cpp 50 int tries = 0; local
54 ++tries;
59 blk_device.c_str(), tries, strerror(errno));
62 } while (ret && tries < 10);
  /device/generic/goldfish/qemu-props/
qemu-props.c 57 int tries = MAX_TRIES; local
64 if (--tries <= 0) {
65 DD("Could not connect after too many tries. Aborting");
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/
DHParametersHelper.java 29 int tries = 0; local
38 tries++;
70 logger.info("Generated safe primes: " + tries + " tries took " + duration + "ms");
  /art/tools/dexfuzz/src/dexfuzz/rawdex/
CodeItem.java 34 public TryItem[] tries; field in class:CodeItem
63 tries = new TryItem[triesSize];
65 (tries[i] = new TryItem()).read(file);
109 for (TryItem tryItem : tries) {
  /dalvik/dx/src/com/android/dex/
Code.java 25 private final Try[] tries; field in class:Code
29 short[] instructions, Try[] tries, CatchHandler[] catchHandlers) {
35 this.tries = tries;
60 return tries;
  /development/samples/Wiktionary/src/com/example/android/wiktionary/
ExtendedWikiHelper.java 202 int tries = 0; local
203 while (tries++ < RANDOM_TRIES) {
225 // No valid word found in number of tries, so return null

Completed in 449 milliseconds

1 2 3 4 5 6 7