/external/llvm/test/Transforms/ArgumentPromotion/ |
D | pr3085.ll | 23 br i1 false, label %bb.i.i, label %bb1.i.i 25 bb.i.i: ; preds = %bb6 28 bb1.i.i: ; preds = %bb6 31 int2lit.exit: ; preds = %bb1.i.i, %bb.i.i 37 br i1 false, label %bb.i, label %picosat_time_stamp.exit 39 bb.i: ; preds = %entry 42 picosat_time_stamp.exit: ; preds = %bb.i, %entry 331 br i1 false, label %bb.i.i35, label %bb1.i.i36 333 bb.i.i35: ; preds = %bb114 336 bb1.i.i36: ; preds = %bb114 [all …]
|
/external/llvm/test/CodeGen/ARM/ |
D | 2008-04-11-PHIofImpDef.ll | 8 br label %bb4351.i 9 bb4351.i: ; preds = %1 10 switch i32 0, label %bb4411.i [ 11 i32 1, label %bb4354.i 12 i32 2, label %bb4369.i 14 bb4354.i: ; preds = %bb4351.i 16 bb4369.i: ; preds = %bb4351.i 17 br label %bb4374.i 18 bb4374.i: ; preds = %bb4369.i 19 br label %bb4411.i [all …]
|
/external/v8/test/webkit/ |
D | dfg-mispredict-variable-but-prove-int-expected.txt | 30 PASS foo(i, i + 1, i + 2) is 1 31 PASS foo(i, i + 1, i + 2) is 1 32 PASS foo(i, i + 1, i + 2) is 1 33 PASS foo(i, i + 1, i + 2) is 1 34 PASS foo(i, i + 1, i + 2) is 1 35 PASS foo(i, i + 1, i + 2) is 1 36 PASS foo(i, i + 1, i + 2) is 1 37 PASS foo(i, i + 1, i + 2) is 1 38 PASS foo(i, i + 1, i + 2) is 1 39 PASS foo(i, i + 1, i + 2) is 1 [all …]
|
D | dfg-get-by-val-clobber-expected.txt | 29 PASS doAccesses(array1, array2, i % 4, (i + 1) % 4, i) is 1 31 PASS doAccesses(array1, array1, i % 4, 0, i) is 0 32 PASS doAccesses(array1, array2, i % 4, (i + 1) % 4, i) is 2 34 PASS doAccesses(array1, array1, i % 4, 0, i) is 2 35 PASS doAccesses(array1, array2, i % 4, (i + 1) % 4, i) is 3 37 PASS doAccesses(array1, array1, i % 4, 0, i) is 3 38 PASS doAccesses(array1, array2, i % 4, (i + 1) % 4, i) is 4 40 PASS doAccesses(array1, array1, i % 4, 0, i) is 4 41 PASS doAccesses(array1, array2, i % 4, (i + 1) % 4, i) is 1 43 PASS doAccesses(array1, array1, i % 4, 0, i) is 4 [all …]
|
D | dfg-branch-logical-not-peephole-around-osr-exit-expected.txt | 29 PASS foo(i, 5, i == 199 ? 2147483647 : 5) is 6 30 PASS foo(i, 5, i == 199 ? 2147483647 : 5) is 7 31 PASS foo(i, 5, i == 199 ? 2147483647 : 5) is 8 32 PASS foo(i, 5, i == 199 ? 2147483647 : 5) is 9 33 PASS foo(i, 5, i == 199 ? 2147483647 : 5) is 10 34 PASS foo(i, 5, i == 199 ? 2147483647 : 5) is 9 35 PASS foo(i, 5, i == 199 ? 2147483647 : 5) is 12 36 PASS foo(i, 5, i == 199 ? 2147483647 : 5) is 13 37 PASS foo(i, 5, i == 199 ? 2147483647 : 5) is 14 38 PASS foo(i, 5, i == 199 ? 2147483647 : 5) is 15 [all …]
|
D | dfg-cse-cfa-discrepancy-expected.txt | 29 PASS foo(i, i + 1) is 162 30 PASS foo(i, i + 1) is 162 31 PASS foo(i, i + 1) is 162 32 PASS foo(i, i + 1) is 162 33 PASS foo(i, i + 1) is 162 34 PASS foo(i, i + 1) is 162 35 PASS foo(i, i + 1) is 162 36 PASS foo(i, i + 1) is 162 37 PASS foo(i, i + 1) is 162 38 PASS foo(i, i + 1) is 162 [all …]
|
D | dfg-call-function-hit-watchpoint-expected.txt | 29 PASS bar(i, i + 1) is 1 30 PASS bar(i, i + 1) is 3 31 PASS bar(i, i + 1) is 5 32 PASS bar(i, i + 1) is 7 33 PASS bar(i, i + 1) is 9 34 PASS bar(i, i + 1) is 11 35 PASS bar(i, i + 1) is 13 36 PASS bar(i, i + 1) is 15 37 PASS bar(i, i + 1) is 17 38 PASS bar(i, i + 1) is 19 [all …]
|
D | dfg-arguments-alias-one-block-expected.txt | 29 PASS foo(i, i + 1) is 1 30 PASS foo(i, i + 1) is 3 31 PASS foo(i, i + 1) is 5 32 PASS foo(i, i + 1) is 7 33 PASS foo(i, i + 1) is 9 34 PASS foo(i, i + 1) is 11 35 PASS foo(i, i + 1) is 13 36 PASS foo(i, i + 1) is 15 37 PASS foo(i, i + 1) is 17 38 PASS foo(i, i + 1) is 19 [all …]
|
D | dfg-to-string-int-or-string-expected.txt | 29 PASS "" + foo(i % 2 ? 42 : "hello") is i % 2 ? "42" : "hello" 30 PASS "" + foo(i % 2 ? 42 : "hello") is i % 2 ? "42" : "hello" 31 PASS "" + foo(i % 2 ? 42 : "hello") is i % 2 ? "42" : "hello" 32 PASS "" + foo(i % 2 ? 42 : "hello") is i % 2 ? "42" : "hello" 33 PASS "" + foo(i % 2 ? 42 : "hello") is i % 2 ? "42" : "hello" 34 PASS "" + foo(i % 2 ? 42 : "hello") is i % 2 ? "42" : "hello" 35 PASS "" + foo(i % 2 ? 42 : "hello") is i % 2 ? "42" : "hello" 36 PASS "" + foo(i % 2 ? 42 : "hello") is i % 2 ? "42" : "hello" 37 PASS "" + foo(i % 2 ? 42 : "hello") is i % 2 ? "42" : "hello" 38 PASS "" + foo(i % 2 ? 42 : "hello") is i % 2 ? "42" : "hello" [all …]
|
D | dfg-inlining-reg-alloc-expected.txt | 24 …inlining, out-of-line function calls (i.e. unconditional register flushing), and slow paths for ob… 29 PASS o.a is bar(2 * i + 1, i) 30 PASS o.b is bar(2 * i, i) 31 PASS o.c is i 32 PASS o.a is bar(2 * i + 1, i) 33 PASS o.b is bar(2 * i, i) 34 PASS o.c is i 35 PASS o.a is bar(2 * i + 1, i) 36 PASS o.b is bar(2 * i, i) 37 PASS o.c is i [all …]
|
/external/v8/test/mjsunit/ |
D | large-object-allocation.js | 31 function LargeObject(i) { argument 32 this.a = i; 33 this.b = i; 34 this.c = i; 35 this.d = i; 36 this.e = i; 37 this.f = i; 38 this.g = i; 39 this.h = i; 40 this.i = i; [all …]
|
/external/clang/test/OpenMP/ |
D | simd_misc_messages.c | 13 int i; in test_no_clause() local 15 for (i = 0; i < 16; ++i) in test_no_clause() 20 ++i; in test_no_clause() 24 int i = 0; in test_branch_protected_scope() local 26 ++i; in test_branch_protected_scope() 31 for (i = 0; i < 16; ++i) { in test_branch_protected_scope() 32 if (i == 5) in test_branch_protected_scope() 34 else if (i == 6) in test_branch_protected_scope() 36 else if (i == 7) in test_branch_protected_scope() 38 else if (i == 8) { in test_branch_protected_scope() [all …]
|
D | for_simd_misc_messages.c | 10 int i; in test_no_clause() local 12 for (i = 0; i < 16; ++i) in test_no_clause() 17 ++i; in test_no_clause() 21 int i = 0; in test_branch_protected_scope() local 23 ++i; in test_branch_protected_scope() 29 for (i = 0; i < 16; ++i) { in test_branch_protected_scope() 30 if (i == 5) in test_branch_protected_scope() 32 else if (i == 6) in test_branch_protected_scope() 34 else if (i == 7) in test_branch_protected_scope() 36 else if (i == 8) { in test_branch_protected_scope() [all …]
|
D | parallel_for_simd_misc_messages.c | 10 int i; in test_no_clause() local 12 for (i = 0; i < 16; ++i) in test_no_clause() 17 ++i; in test_no_clause() 21 int i = 0; in test_branch_protected_scope() local 23 ++i; in test_branch_protected_scope() 29 for (i = 0; i < 16; ++i) { in test_branch_protected_scope() 30 if (i == 5) in test_branch_protected_scope() 32 else if (i == 6) in test_branch_protected_scope() 34 else if (i == 7) in test_branch_protected_scope() 36 else if (i == 8) { in test_branch_protected_scope() [all …]
|
D | nesting_of_regions.cpp | 11 for (int i = 0; i < 10; ++i) in foo() local 15 for (int i = 0; i < 10; ++i) in foo() local 19 for (int i = 0; i < 10; ++i) in foo() local 47 for (int i = 0; i < 10; ++i) in foo() local 51 for (int i = 0; i < 10; ++i) in foo() local 106 for (int i = 0; i < 10; ++i) { in foo() local 108 for (int i = 0; i < 10; ++i) in foo() local 112 for (int i = 0; i < 10; ++i) { in foo() local 114 for (int i = 0; i < 10; ++i) in foo() local 118 for (int i = 0; i < 10; ++i) { in foo() local [all …]
|
D | for_schedule_messages.cpp | 15 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 17 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 19 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 21 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 23 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 25 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 27 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 30 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 33 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 35 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local [all …]
|
D | parallel_for_misc_messages.c | 10 int i; in test_no_clause() local 12 for (i = 0; i < 16; ++i) in test_no_clause() 17 ++i; in test_no_clause() 21 int i = 0; in test_branch_protected_scope() local 23 ++i; in test_branch_protected_scope() 28 for (i = 0; i < 16; ++i) { in test_branch_protected_scope() 29 if (i == 5) in test_branch_protected_scope() 31 else if (i == 6) in test_branch_protected_scope() 33 else if (i == 7) in test_branch_protected_scope() 35 else if (i == 8) { in test_branch_protected_scope() [all …]
|
D | parallel_for_schedule_messages.cpp | 15 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 17 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 19 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 21 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 23 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 25 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 27 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 30 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 33 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 35 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local [all …]
|
D | for_simd_schedule_messages.cpp | 15 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 17 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 19 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 21 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 23 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 25 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 27 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 30 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 33 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local 35 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local [all …]
|
/external/llvm/test/Transforms/InstCombine/ |
D | div-shift-crash.ll | 10 …%l_819.i.i = alloca %struct.S0.0.1.2.3.4.13.22.31.44.48.53.54.55.56.58.59.60.66.68.70.74.77.106.10… 11 br i1 undef, label %land.lhs.true, label %for.cond.i 14 br label %for.cond.i 16 for.cond.i: ; preds = %land.lhs.true, %entry 17 ….54.55.56.58.59.60.66.68.70.74.77.106.107.108.109.110.113.117.118.128.129* %l_819.i.i, i64 0, i32 0 18 br label %for.cond.i6.i.i 20 for.cond.i6.i.i: ; preds = %for.body.i8.i.i, %for.cond.i 21 br i1 undef, label %for.body.i8.i.i, label %lbl_707.i.i.i 23 for.body.i8.i.i: ; preds = %for.cond.i6.i.i 24 br label %for.cond.i6.i.i [all …]
|
/external/openssh/ |
D | sc25519.c | 35 int i; in reduce_add_sub() local 38 for(i=0;i<32;i++) in reduce_add_sub() 40 pb += m[i]; in reduce_add_sub() 41 b = lt(r->v[i],pb); in reduce_add_sub() 42 t[i] = r->v[i]-pb+(b<<8); in reduce_add_sub() 46 for(i=0;i<32;i++) in reduce_add_sub() 47 r->v[i] ^= mask & (r->v[i] ^ t[i]); in reduce_add_sub() 54 int i,j; in barrett_reduce() local 63 for (i = 0;i < 66;++i) q2[i] = 0; in barrett_reduce() 64 for (i = 0;i < 33;++i) r2[i] = 0; in barrett_reduce() [all …]
|
/external/valgrind/none/tests/mips64/ |
D | load_store.c | 6 int i; in main() local 14 for (i = 0; i < N*s1; i++) in main() 15 TEST1("lb", i, reg_val1); in main() 17 for (i = 0; i < N*s2; i++) in main() 18 TEST1("lb", i, reg_val2); in main() 21 for (i = 0; i < N*s1; i++) in main() 22 TEST1("lbu", i, reg_val1); in main() 24 for (i = 0; i < N*s2; i++) in main() 25 TEST1("lbu", i, reg_val2); in main() 28 for (i = 0; i < N*s1; i = i+8) in main() [all …]
|
/external/clang/test/Profile/ |
D | c-general.c | 27 int i; in simple_loops() local 30 for (i = 0; i < 100; ++i) { in simple_loops() 34 while (i > 0) in simple_loops() 35 i--; in simple_loops() 38 do {} while (i++ < 75); in simple_loops() 50 for (int i = 0; i < 100; ++i) { in conditionals() local 53 if (i % 2) { in conditionals() 56 if (i) {} in conditionals() 59 } else if (i % 3) { in conditionals() 62 if (i) {} in conditionals() [all …]
|
/external/mesa3d/src/mesa/main/ |
D | format_unpack.c | 67 GLuint i; in nonlinear_to_linear() local 68 for (i = 0; i < 256; i++) { in nonlinear_to_linear() 69 const GLfloat cs = UBYTE_TO_FLOAT(i); in nonlinear_to_linear() 71 table[i] = cs / 12.92f; in nonlinear_to_linear() 74 table[i] = (GLfloat) pow((cs + 0.055) / 1.055, 2.4); in nonlinear_to_linear() 94 GLuint i; in unpack_RGBA8888() local 95 for (i = 0; i < n; i++) { in unpack_RGBA8888() 96 dst[i][RCOMP] = UBYTE_TO_FLOAT( (s[i] >> 24) ); in unpack_RGBA8888() 97 dst[i][GCOMP] = UBYTE_TO_FLOAT( (s[i] >> 16) & 0xff ); in unpack_RGBA8888() 98 dst[i][BCOMP] = UBYTE_TO_FLOAT( (s[i] >> 8) & 0xff ); in unpack_RGBA8888() [all …]
|
/external/clang/test/SemaCXX/ |
D | warn-loop-analysis.cpp | 16 for (int i; i < 1; ++i) {} in test1() local 17 …for (int i; i < 1; ) {} // expected-warning {{variable 'i' used in loop condition not modified in… in test1() local 18 for (int i; i < 1; ) { ++i; } in test1() local 19 for (int i; i < 1; ) { return; } in test1() local 20 for (int i; i < 1; ) { break; } in test1() local 21 for (int i; i < 1; ) { goto exit_loop; } in test1() local 23 for (int i; i < 1; ) { by_ref(i); } in test1() local 24 …for (int i; i < 1; ) { by_value(i); } // expected-warning {{variable 'i' used in loop condition n… in test1() local 25 for (int i; i < 1; ) { by_pointer(&i); } in test1() local 27 for (int i; i < 1; ++i) in test1() local [all …]
|