Home
last modified time | relevance | path

Searched refs:i (Results 1 – 25 of 14281) sorted by relevance

12345678910>>...572

/external/llvm/test/Transforms/ArgumentPromotion/
Dpr3085.ll23 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/curl/tests/libtest/
Dlib557.c118 int i, j; in test_unsigned_short_formatting() local
124 i=1; us_test[i].num = 0xFFU; us_test[i].expected = "256"; in test_unsigned_short_formatting()
125 i++; us_test[i].num = 0xF0U; us_test[i].expected = "240"; in test_unsigned_short_formatting()
126 i++; us_test[i].num = 0x0FU; us_test[i].expected = "15"; in test_unsigned_short_formatting()
128 i++; us_test[i].num = 0xE0U; us_test[i].expected = "224"; in test_unsigned_short_formatting()
129 i++; us_test[i].num = 0x0EU; us_test[i].expected = "14"; in test_unsigned_short_formatting()
131 i++; us_test[i].num = 0xC0U; us_test[i].expected = "192"; in test_unsigned_short_formatting()
132 i++; us_test[i].num = 0x0CU; us_test[i].expected = "12"; in test_unsigned_short_formatting()
134 i++; us_test[i].num = 0x01U; us_test[i].expected = "1"; in test_unsigned_short_formatting()
135 i++; us_test[i].num = 0x00U; us_test[i].expected = "0"; in test_unsigned_short_formatting()
[all …]
/external/llvm/test/CodeGen/ARM/
D2008-04-11-PHIofImpDef.ll8 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/
Ddfg-mispredict-variable-but-prove-int-expected.txt30 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 …]
Ddfg-get-by-val-clobber-expected.txt29 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 …]
Ddfg-arguments-alias-one-block-expected.txt29 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 …]
Ddfg-branch-logical-not-peephole-around-osr-exit-expected.txt29 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 …]
Ddfg-call-function-hit-watchpoint-expected.txt29 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 …]
Ddfg-cse-cfa-discrepancy-expected.txt29 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 …]
Ddfg-to-string-int-or-string-expected.txt29 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 …]
Ddfg-inlining-reg-alloc-expected.txt24 …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/clang/test/OpenMP/
Dsimd_misc_messages.c13 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 …]
Dfor_simd_misc_messages.c10 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 …]
Dparallel_for_simd_misc_messages.c10 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 …]
Dnesting_of_regions.cpp11 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
112 for (int i = 0; i < 10; ++i) in foo() local
118 for (int i = 0; i < 10; ++i) { in foo() local
120 for (int i = 0; i < 10; ++i) in foo() local
124 for (int i = 0; i < 10; ++i) { in foo() local
[all …]
Dfor_schedule_messages.cpp15 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 …]
Dparallel_for_misc_messages.c10 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 …]
Dparallel_for_schedule_messages.cpp15 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 …]
Dfor_simd_schedule_messages.cpp15 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/v8/test/mjsunit/
Dlarge-object-allocation.js31 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/llvm/test/Transforms/InstCombine/
Ddiv-shift-crash.ll10 …%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/valgrind/none/tests/mips64/
Dload_store.c6 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/mesa3d/src/mesa/main/
Dformat_unpack.c67 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/Profile/
Dc-general.c28 int i; in simple_loops() local
31 for (i = 0; i < 100; ++i) { in simple_loops()
35 while (i > 0) in simple_loops()
36 i--; in simple_loops()
39 do {} while (i++ < 75); in simple_loops()
51 for (int i = 0; i < 100; ++i) { in conditionals() local
54 if (i % 2) { in conditionals()
57 if (i) {} in conditionals()
60 } else if (i % 3) { in conditionals()
63 if (i) {} in conditionals()
[all …]
/external/clang/test/SemaCXX/
Dwarn-loop-analysis.cpp16 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 …]

12345678910>>...572