| /dalvik/dx/tests/034-dex-minimal/ |
| info.txt | 3 The first test tries to create the truly minimal dex file by using the
7 The second test tries to convert a minimal classfile and ensures that
|
| /external/chromium-trace/trace-viewer/third_party/closure_linter/ |
| README | 9 fixjsstyle.py - tries to fix errors automatically
|
| /external/webkit/LayoutTests/storage/domstorage/localstorage/ |
| simple-usage-expected.txt | 1 This test tries simple operations on localStorage
|
| /ndk/tests/build/ndk-build-unit-tests/ |
| build.sh | 3 # within the build system, not anything that tries to build something.
|
| /external/dexmaker/src/dx/java/com/android/dx/io/ |
| 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;
|
| /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) \
|
| basicbenchmark.h | 38 double benchBasic(const MatrixType& mat, int size, int tries) __attribute__((noinline));
41 double benchBasic(const MatrixType& mat, int iterations, int tries)
52 for(uint t=0; t<tries; ++t)
|
| 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));
|
| benchEigenSolver.cpp | 23 #ifndef TRIES
24 #define TRIES 4
55 for (int t=0; t<TRIES; ++t)
69 for (int t=0; t<TRIES; ++t)
99 for (int t=0; t<TRIES; ++t)
110 // for (int t=0; t<TRIES; ++t)
144 for (int t=0; t<TRIES; ++t)
155 for (int t=0; t<TRIES; ++t)
|
| benchCholesky.cpp | 22 #ifndef TRIES
23 #define TRIES 10
54 for (int t=0; t<TRIES; ++t)
65 for (int t=0; t<TRIES; ++t)
96 for (int t=0; t<TRIES; ++t)
|
| /external/llvm/test/Transforms/DeadArgElim/ |
| 2008-06-23-DeadAfterLive.ll | 4 ; This test tries to catch wrongful removal of return values for a specific case
12 ; This function doesn't use the return value @test5 and tries to lure DAE into
|
| /external/llvm/test/Transforms/Inline/ |
| 2004-04-15-InlineDeletesCall.ll | 4 ; call. Then the inliner tries to inline the second call, which no longer
|
| /dalvik/dx/src/com/android/dx/io/ |
| 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;
|
| /dalvik/dx/tests/061-dex-try-catch/ |
| expected.txt | 19 tries:
32 tries:
47 tries:
|
| /bootable/recovery/minadbd/ |
| utils.h | 42 /* tries to add a character to the buffer, in case of overflow
47 /* tries to add a string to the buffer */
50 /* tries to add a bytes to the buffer. the input can contain zero bytes,
55 /* tries to add a formatted string to a bounded buffer */
|
| /dalvik/dx/tests/055-dex-explicit-throw/ |
| expected.txt | 15 tries:
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
| DHParametersHelper.java | 30 int tries = 0; local
38 tries++;
53 logger.info("Generated safe primes: " + tries + " tries took " + duration + "ms");
|
| /external/chromium/chrome/browser/resources/chromeos/ |
| sim_unlock.js | 45 var tries = simInfo.tries;
57 'enterPinTriesMessage', tries);
61 'incorrectPinTriesMessage', tries);
76 'incorrectPinTriesMessage', tries);
92 'incorrectPinTriesMessage', tries);
104 $('locked-pin-no-tries-overlay').hidden = false;
108 if (tries && tries >= 0) {
110 'enterPukWarning', tries);
[all...] |
| /external/chromium/chrome/browser/ui/webui/chromeos/ |
| sim_unlock_ui.h | 16 // - Display "SIM card is blocked" message when there're no PUK tries left.
|
| /external/webkit/Source/WebCore/manual-tests/resources/ |
| before-go-back.html | 13 When you click on the above link, one page is loaded and tries to go back.
|
| /system/core/adb/ |
| utils.h | 42 /* tries to add a character to the buffer, in case of overflow
47 /* tries to add a string to the buffer */
50 /* tries to add a bytes to the buffer. the input can contain zero bytes,
55 /* tries to add a formatted string to a bounded buffer */
|
| /external/llvm/test/CodeGen/ARM/ |
| 2011-03-23-PeepholeBug.ll | 31 %tries.0 = sub i32 2147483647, %indvar
32 %tmp1 = icmp sgt i32 %tries.0, 0
|
| /external/openssh/regress/ |
| kextype.sh | 20 tries="1 2 3 4"
23 for i in $tries; do
|
| /external/marisa-trie/tools/ |
| marisa-build.cc | 26 " -n, --num-tries=[N] limits the number of tries to N"
28 " -P, --patricia-trie build patricia tries (default)\n"
29 " -p, --prefix-trie build prefix tries\n"
35 " -o, --output=[FILE] write tries to FILE (default: stdout)\n"
88 std::cerr << "#tries: " << trie.num_tries() << std::endl;
119 { "max-num-tries", 1, NULL, 'n' },
|
| /external/marisa-trie/v0_1_5/tools/ |
| marisa_alpha-build.cc | 26 " -n, --num-tries=[N] limits the number of tries to N"
28 " -P, --patricia-trie build patricia tries (default)\n"
29 " -p, --prefix-trie build prefix tries\n"
35 " -o, --output=[FILE] write tries to FILE (default: stdout)\n"
88 std::cerr << "#tries: " << trie.num_tries() << std::endl;
119 { "max-num-tries", 1, NULL, 'n' },
|
