| /external/chromium/chrome/browser/resources/chromeos/ |
| sim_unlock.html | 43 <div id="locked-pin-no-tries-overlay" class="dialog" hidden>
45 <div id="pin-no-tries-content-area" class="content-area">
47 <div id="pin-no-tries-error-msg" i18n-content="noPinTriesLeft"></div>
52 <button id="pin-no-tries-proceed" i18n-content="enterPukButton">
54 <button id="pin-no-tries-dismiss" i18n-content="cancel"></button>
118 <div id="locked-puk-no-tries-overlay" class="dialog" hidden>
120 <div id="puk-no-tries-content-area" class="content-area">
121 <div id="puk-no-tries-msg" i18n-content="noPukTriesLeft"></div>
125 <button id="puk-no-tries-confirm" i18n-content="ok"></button>
|
| /external/eigen/bench/ |
| bench_reverse.cpp | 11 #ifndef TRIES
12 #define TRIES 20
33 for (int t=0; t<TRIES; ++t)
|
| 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
|
| /external/openssh/regress/ |
| cipher-speed.sh | 11 tries="1 2"
25 for x in $tries; do
41 for x in $tries; do
|
| keytype.sh | 28 tries="1 2 3"
47 for i in $tries; do
|
| /external/smack/src/org/jivesoftware/smackx/ping/ |
| ServerPingTask.java | 32 private int tries = 3; // 3 tries field in class:ServerPingTask
49 for (int i = 0; i < tries; i++) {
|
| /frameworks/av/media/libmedia/ |
| SingleStateQueue.cpp | 70 for (int tries = 0; ; ) {
73 if (++tries >= MAX_TRIES) {
87 if (++tries >= MAX_TRIES) {
|
| /dalvik/dx/tests/076-dex-synch-and-stack/ |
| expected.txt | 17 tries:
|
| /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/antlr/antlr-3.4/runtime/Python/tests/ |
| t032subrulePredict.py | 31 @testbase.broken("DFA tries to look beyond end of rule b", Exception)
|
| /external/llvm/test/CodeGen/X86/ |
| extractelement-shuffle.ll | 5 ; preserves the number of elements so the optimization code tries to read
|
| /external/llvm/test/Transforms/ArgumentPromotion/ |
| 2008-07-02-array-indexing.ll | 5 ; This test tries to convince argpromotion about promoting the load from %A + 2,
|
| /external/llvm/test/Transforms/InstCombine/ |
| fold-sqrt-sqrtf.ll | 4 ; Instcombine tries to fold (fptrunc (sqrt (fpext x))) -> (sqrtf x), but this
|
| /external/valgrind/main/gdbserver_tests/ |
| filter_vgdb | 12 # gdb 7.2 sometimes tries to access address 0x0 (same as with standard gdbserver)
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| BrokenBarrierException.java | 10 * Exception thrown when a thread tries to wait upon a barrier that is
|
| /system/extras/tests/bionic/libc/common/ |
| test_strftime_2039.c | 1 /* this tests tries to call strftime() with a date > 2038
|
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| SortedMapTestBase.java | 41 final int TRIES = 100;
61 for (int i = 0; i < TRIES; i++) {
69 for (int i = 0; i < TRIES; i++) {
90 for (int i = 0; i < TRIES; i++) {
112 for (int i = 0; i < TRIES; i++) {
133 Map<Integer, Integer> mixin = new HashMap<Integer, Integer>(TRIES);
134 for (int i = 0; i < TRIES; i++) {
147 if (i % (N / TRIES) == 0) {
193 for (int i = 0; i < TRIES; i++) {
205 for (int i = 0; i < TRIES; i++)
[all...] |
| /dalvik/dx/tests/046-dex-exceptions/ |
| expected.txt | 16 tries:
44 tries:
|
| /external/smali/dexlib/src/main/java/org/jf/dexlib/ |
| CodeItem.java | 46 private TryItem[] tries; field in class:CodeItem
67 * @param tries an array of the tries defined for this code/method
76 TryItem[] tries,
89 this.tries = tries;
101 * @param tries a list of the tries defined for this code/method or null if none
111 List<TryItem> tries,
117 if (tries != null && tries.size() > 0)
[all...] |
| /external/qemu/android/utils/ |
| filelock.c | 116 int tries; local
118 for ( tries = 4; tries > 0; tries-- )
221 int rc, tries, _sleep;
252 for ( tries = 4; tries > 0; tries-- )
325 tries++;
|
| /dalvik/dx/tests/066-dex-try-catch-rethrow/ |
| expected.txt | 17 tries:
35 tries:
54 tries:
73 tries:
93 tries:
|
| /dalvik/dx/tests/067-dex-switch-and-try/ |
| expected.txt | 44 tries:
71 tries:
98 tries:
|
| /device/generic/goldfish/qemu-props/ |
| qemu-props.c | 52 int tries = MAX_TRIES; local
59 if (--tries <= 0) {
60 DD("Could not connect after too many tries. Aborting");
|
| /development/samples/training/threadsample/src/com/example/android/threadsample/ |
| PhotoDecodeRunnable.java | 35 // Limits the number of times the decoder tries to process an image
215 // Tries to decode the image buffer
227 * If the decode fails, this block tries to get more memory.
246 * Tries to pause the thread for 250 milliseconds,
247 * and catches an Exception if something tries to
258 // Catches exceptions if something tries to activate the
|
| /external/mockito/src/org/mockito/internal/stubbing/defaultanswers/ |
| ReturnsSmartNulls.java | 29 * ReturnsSmartNulls first tries to return ordinary return values (see
30 * {@link ReturnsMoreEmptyValues}) then it tries to return SmartNull. If the
|
