Home
last modified time | relevance | path

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

12345678910>>...44

/art/test/003-omnibus-opcodes/src/
DGoto.java21 static int filler(int i) { in filler() argument
22 return i+1; in filler()
28 int i = 0; in smallGoto() local
31 i += filler(i); in smallGoto()
33 i -= filler(i); in smallGoto()
36 return i; in smallGoto()
42 int i = 0; in mediumGoto() local
45 i += filler(i); in mediumGoto()
47 i -= filler(i); i -= filler(i); i -= filler(i); i -= filler(i); in mediumGoto()
48 i -= filler(i); i -= filler(i); i -= filler(i); i -= filler(i); in mediumGoto()
[all …]
/art/test/640-checker-simd/src/
DSimdByte.java37 for (int i = 0; i < 128; i++) in add()
38 a[i] += x; in add()
50 for (int i = 0; i < 128; i++) in sub()
51 a[i] -= x; in sub()
63 for (int i = 0; i < 128; i++) in mul()
64 a[i] *= x; in mul()
76 for (int i = 0; i < 128; i++) in div()
77 a[i] /= x; in div()
89 for (int i = 0; i < 128; i++) in neg()
90 a[i] = (byte) -a[i]; in neg()
[all …]
DSimdChar.java37 for (int i = 0; i < 128; i++) in add()
38 a[i] += x; in add()
50 for (int i = 0; i < 128; i++) in sub()
51 a[i] -= x; in sub()
63 for (int i = 0; i < 128; i++) in mul()
64 a[i] *= x; in mul()
77 for (int i = 0; i < 128; i++) in div()
78 a[i] /= x; in div()
90 for (int i = 0; i < 128; i++) in neg()
91 a[i] = (char) -a[i]; in neg()
[all …]
DSimdShort.java37 for (int i = 0; i < 128; i++) in add()
38 a[i] += x; in add()
50 for (int i = 0; i < 128; i++) in sub()
51 a[i] -= x; in sub()
63 for (int i = 0; i < 128; i++) in mul()
64 a[i] *= x; in mul()
77 for (int i = 0; i < 128; i++) in div()
78 a[i] /= x; in div()
90 for (int i = 0; i < 128; i++) in neg()
91 a[i] = (short) -a[i]; in neg()
[all …]
DSimdInt.java37 for (int i = 0; i < 128; i++) in add()
38 a[i] += x; in add()
50 for (int i = 0; i < 128; i++) in sub()
51 a[i] -= x; in sub()
63 for (int i = 0; i < 128; i++) in mul()
64 a[i] *= x; in mul()
77 for (int i = 0; i < 128; i++) in div()
78 a[i] /= x; in div()
90 for (int i = 0; i < 128; i++) in neg()
91 a[i] = -a[i]; in neg()
[all …]
DSimdLong.java37 for (int i = 0; i < 128; i++) in add()
38 a[i] += x; in add()
50 for (int i = 0; i < 128; i++) in sub()
51 a[i] -= x; in sub()
73 for (int i = 0; i < 128; i++) in mul()
74 a[i] *= x; in mul()
87 for (int i = 0; i < 128; i++) in div()
88 a[i] /= x; in div()
100 for (int i = 0; i < 128; i++) in neg()
101 a[i] = -a[i]; in neg()
[all …]
DSimdFloat.java38 for (int i = 0; i < 128; i++) in add()
39 a[i] += x; in add()
51 for (int i = 0; i < 128; i++) in sub()
52 a[i] -= x; in sub()
64 for (int i = 0; i < 128; i++) in mul()
65 a[i] *= x; in mul()
77 for (int i = 0; i < 128; i++) in div()
78 a[i] /= x; in div()
90 for (int i = 0; i < 128; i++) in neg()
91 a[i] = -a[i]; in neg()
[all …]
DSimdDouble.java38 for (int i = 0; i < 128; i++) in add()
39 a[i] += x; in add()
51 for (int i = 0; i < 128; i++) in sub()
52 a[i] -= x; in sub()
64 for (int i = 0; i < 128; i++) in mul()
65 a[i] *= x; in mul()
77 for (int i = 0; i < 128; i++) in div()
78 a[i] /= x; in div()
90 for (int i = 0; i < 128; i++) in neg()
91 a[i] = -a[i]; in neg()
[all …]
/art/test/525-checker-arrays-fields1/src/
DMain.java67 for (int i = 0; i < sArrZ.length; i++) { in InvLoopZ()
68 sArrZ[i] = sZ; in InvLoopZ()
81 for (int i = 0; i < sArrB.length; i++) { in InvLoopB()
82 sArrB[i] = sB; in InvLoopB()
95 for (int i = 0; i < sArrC.length; i++) { in InvLoopC()
96 sArrC[i] = sC; in InvLoopC()
109 for (int i = 0; i < sArrS.length; i++) { in InvLoopS()
110 sArrS[i] = sS; in InvLoopS()
123 for (int i = 0; i < sArrI.length; i++) { in InvLoopI()
124 sArrI[i] = sI; in InvLoopI()
[all …]
/art/test/525-checker-arrays-fields2/src/
DMain.java67 for (int i = 0; i < mArrZ.length; i++) { in InvLoopZ()
68 mArrZ[i] = mZ; in InvLoopZ()
81 for (int i = 0; i < mArrB.length; i++) { in InvLoopB()
82 mArrB[i] = mB; in InvLoopB()
95 for (int i = 0; i < mArrC.length; i++) { in InvLoopC()
96 mArrC[i] = mC; in InvLoopC()
109 for (int i = 0; i < mArrS.length; i++) { in InvLoopS()
110 mArrS[i] = mS; in InvLoopS()
123 for (int i = 0; i < mArrI.length; i++) { in InvLoopI()
124 mArrI[i] = mI; in InvLoopI()
[all …]
/art/test/656-checker-simd-opt/src/
DMain.java63 for (int i = 0; i < 100; i++) { in unroll()
64 x[i] = y[i] * 2.5f; in unroll()
98 for (int i = 1; i < n - 1; i++) { in stencil()
99 a[i] = b[i - 1] + b[i] + b[i + 1]; in stencil()
147 for (int i = 1; i < n + minus1; i++) { in stencilAddInt()
148 a[i] = b[i + minus1] + b[i] + b[i + 1]; in stencilAddInt()
201 for (int i = 1; i < n - plus1; i++) { in stencilSubInt()
202 a[i] = b[i - plus1] + b[i] + b[i + 1]; in stencilSubInt()
248 for (long i = 0; i < 10; i++) { in longInductionReduction()
286 for (int i = 0; i < 100; i++) { in intVectorLongInvariant()
[all …]
/art/test/618-checker-induction/src/
DMain.java32 for (int i = 0; i < 4; i++) { in deadSingleLoop()
42 for (int i = 0; i < n; i++) { in deadSingleLoopN()
52 for (int i = 0; i <= n; i++) { // loops forever when n = MAX_INT in potentialInfiniteLoop()
63 for (int i = 0; i < 4; i++) { in deadNestedLoops()
81 for (int i = 0; i < 4; i++) { in deadNestedAndFollowingLoops()
93 for (int i = 0; i < 4; i++) { in deadNestedAndFollowingLoops()
105 for (int i = 0; i < n; i++) { in deadConditional()
106 if (i == 3) in deadConditional()
107 k = i; in deadConditional()
109 m = i; in deadConditional()
[all …]
/art/test/530-checker-loops4/src/
DMain.java37 for (int i = 0; i < 10; i++) { in geo1()
58 for (int i = 0; i < 10; i++) { in geo2()
79 for (int i = 0; i < 10; i++) { in geo3()
98 for (int i = 0; i < 10; i++) { in geo4()
120 for (int i = 0; i < 10; i++) { in geo5()
144 for (int i = 0; i < 3; i++) { in geo1BCE()
169 for (int i = 0; i < 5; i++) { in geo2BCE()
189 for (int i = 0; i < 100; i++) { // a converges to 0 in geo3BCE()
209 for (int i = 0; i < 100; i++) { // a converges to 0 in geo4BCE()
228 for (int i = 0; i < 100; i++) { in geoMulBlackHole()
[all …]
/art/test/640-checker-boolean-simd/src/
DMain.java37 for (int i = 0; i < 128; i++) in and()
38 a[i] &= x; // NOTE: bitwise and, not the common && in and()
50 for (int i = 0; i < 128; i++) in or()
51 a[i] |= x; // NOTE: bitwise or, not the common || in or()
63 for (int i = 0; i < 128; i++) in xor()
64 a[i] ^= x; // NOTE: bitwise xor in xor()
76 for (int i = 0; i < 128; i++) in not()
77 a[i] = !a[i]; in not()
87 for (int i = 0; i < 128; i++) { in main()
88 a[i] = (i & 1) == 0; in main()
[all …]
/art/test/530-checker-loops3/src/
DMain.java39 for (int i = 0; i < a.length; i++) { in oneConstantIndex()
40 a[i] = b[1]; in oneConstantIndex()
59 for (int i = 0; i < a.length; i++) { in multipleConstantIndices()
60 a[i] = b[0] + b[1] + b[2]; in multipleConstantIndices()
77 for (int i = 0; i < a.length; i++) { in oneInvariantIndex()
78 a[i] = b[c]; in oneInvariantIndex()
98 for (int i = 0; i < a.length; i++) { in multipleInvariantIndices()
99 a[i] = b[c-1] + b[c] + b[c+1]; in multipleInvariantIndices()
117 for (int i = 0; i < a.length; i++) { in oneUnitStride()
118 a[i] = b[i]; in oneUnitStride()
[all …]
/art/test/646-checker-simd-hadd/src/
DHaddShort.java65 for (int i = 0; i < min_length; i++) { in halving_add_signed()
66 bo[i] = (short) ((b1[i] + b2[i]) >> 1); in halving_add_signed()
106 for (int i = 0; i < min_length; i++) { in halving_add_signed_alt()
108 bo[i] = (short) (((b1[i] + 10) + (b2[i] - 10)) >> 1); in halving_add_signed_alt()
157 for (int i = 0; i < min_length; i++) { in halving_add_unsigned()
158 int v1 = b1[i] & 0xffff; in halving_add_unsigned()
159 int v2 = b2[i] & 0xffff; in halving_add_unsigned()
160 bo[i] = (short) ((v1 + v2) >> 1); in halving_add_unsigned()
197 for (int i = 0; i < min_length; i++) { in rounding_halving_add_signed()
198 bo[i] = (short) ((b1[i] + b2[i] + 1) >> 1); in rounding_halving_add_signed()
[all …]
DHaddOther.java30 for (int i = 0; i < min_length; i++) { in test_no_hadd_short2short()
31 out[i] = (short) (a[i] >> 1); in test_no_hadd_short2short()
42 for (int i = 0; i < min_length; i++) { in test_no_hadd_short2short_logical()
43 out[i] = (short) (a[i] >>> 1); in test_no_hadd_short2short_logical()
54 for (int i = 0; i < min_length; i++) { in test_no_hadd_int2short()
55 out[i] = (short) (a[i] >> 1); in test_no_hadd_int2short()
68 for (int i = 0; i < min_length; i++) { in test_no_hadd_int2int()
69 out[i] = a[i] >> 1; in test_no_hadd_int2int()
83 for (int i = 0; i < min_length; i++) { in test_no_hadd_sum_casted()
84 out[i] = (short) (((short) (a[i] + b[i])) >> 1); in test_no_hadd_sum_casted()
[all …]
DHaddAltChar.java64 for (int i = 0; i < min_length; i++) { in halving_add_unsigned()
65 bo[i] = (char) ((b1[i] + b2[i]) >>> 1); in halving_add_unsigned()
118 for (int i = 0; i < min_length; i++) { in halving_add_also_unsigned()
119 bo[i] = (char) (((b1[i] & 0xffff) + (b2[i] & 0xffff)) >>> 1); in halving_add_also_unsigned()
156 for (int i = 0; i < min_length; i++) { in rounding_halving_add_unsigned()
157 bo[i] = (char) ((b1[i] + b2[i] + 1) >>> 1); in rounding_halving_add_unsigned()
212 for (int i = 0; i < min_length; i++) { in rounding_halving_add_also_unsigned()
213 bo[i] = (char) (((b1[i] & 0xffff) + (b2[i] & 0xffff) + 1) >>> 1); in rounding_halving_add_also_unsigned()
251 for (int i = 0; i < min_length; i++) { in halving_add_unsigned_constant()
252 bo[i] = (char) ((b1[i] + 0xffff) >>> 1); in halving_add_unsigned_constant()
[all …]
DHaddChar.java61 for (int i = 0; i < min_length; i++) { in halving_add_unsigned()
62 bo[i] = (char) ((b1[i] + b2[i]) >> 1); in halving_add_unsigned()
114 for (int i = 0; i < min_length; i++) { in halving_add_also_unsigned()
115 bo[i] = (char) (((b1[i] & 0xffff) + (b2[i] & 0xffff)) >> 1); in halving_add_also_unsigned()
152 for (int i = 0; i < min_length; i++) { in rounding_halving_add_unsigned()
153 bo[i] = (char) ((b1[i] + b2[i] + 1) >> 1); in rounding_halving_add_unsigned()
207 for (int i = 0; i < min_length; i++) { in rounding_halving_add_also_unsigned()
208 bo[i] = (char) (((b1[i] & 0xffff) + (b2[i] & 0xffff) + 1) >> 1); in rounding_halving_add_also_unsigned()
245 for (int i = 0; i < min_length; i++) { in halving_add_unsigned_constant()
246 bo[i] = (char) ((b1[i] + 0xffff) >> 1); in halving_add_unsigned_constant()
[all …]
DHaddAltShort.java64 for (int i = 0; i < min_length; i++) { in halving_add_signed()
65 bo[i] = (short) ((b1[i] + b2[i]) >>> 1); in halving_add_signed()
114 for (int i = 0; i < min_length; i++) { in halving_add_unsigned()
115 int v1 = b1[i] & 0xffff; in halving_add_unsigned()
116 int v2 = b2[i] & 0xffff; in halving_add_unsigned()
117 bo[i] = (short) ((v1 + v2) >>> 1); in halving_add_unsigned()
154 for (int i = 0; i < min_length; i++) { in rounding_halving_add_signed()
155 bo[i] = (short) ((b1[i] + b2[i] + 1) >>> 1); in rounding_halving_add_signed()
206 for (int i = 0; i < min_length; i++) { in rounding_halving_add_unsigned()
207 int v1 = b1[i] & 0xffff; in rounding_halving_add_unsigned()
[all …]
/art/test/623-checker-loop-regressions/src/
DMain.java33 for (int i = 0; i < 10; i++) { in earlyExitFirst()
34 if (i == m) { in earlyExitFirst()
51 for (int i = 0; i < 10; i++) { in earlyExitLast()
53 if (i == m) { in earlyExitLast()
74 for (int i = 0; i < 2; i++) { in earlyExitNested()
80 if (i == 1) { in earlyExitNested()
105 for (int i = 0; i < 10; i++) { in transferNarrowWrap()
126 for (short i = 0; i < 10; i++) { in polynomialShort()
127 x = x - i; // polynomial on narrowing linear in polynomialShort()
145 for (long i = 0; i < 10; i++) { in polynomialIntFromLong()
[all …]
/art/test/655-checker-simd-arm-opt/src/
DMain.java69 for (int i = 0; i < ARRAY_SIZE; i++) { in encodableConstants()
70 b[i] += 1; in encodableConstants()
72 for (int i = 0; i < ARRAY_SIZE; i++) { in encodableConstants()
73 s[i] += -128; in encodableConstants()
75 for (int i = 0; i < ARRAY_SIZE; i++) { in encodableConstants()
76 c[i] += 127; in encodableConstants()
78 for (int i = 0; i < ARRAY_SIZE; i++) { in encodableConstants()
79 a[i] += -219; in encodableConstants()
81 for (int i = 0; i < ARRAY_SIZE; i++) { in encodableConstants()
82 a[i] += 219; in encodableConstants()
[all …]
/art/test/594-checker-array-alias/src/
DMain.java42 for (int i = 0; i < a.length; i++) { in CrossOverLoop1()
43 a[i] = b[20] - 7; in CrossOverLoop1()
58 for (int i = 0; i < a.length; i++) { in CrossOverLoop2()
59 a[i] = b[20] - 7; in CrossOverLoop2()
74 for (int i = 0; i < a.length; i++) { in CrossOverLoop3()
75 a[i] = b[20] - 7; in CrossOverLoop3()
90 for (int i = 0; i < a.length; i++) { in CrossOverLoop4()
91 a[i] = b[20] - 7; in CrossOverLoop4()
113 for (int i = 0; i < a.length; i++) { in FalseCrossOverLoop1()
114 a[i] = (int) b[20] - 7; in FalseCrossOverLoop1()
[all …]
/art/test/530-checker-loops1/src/
DMain.java36 for (int i = 0; i < x.length; i++) { in linear()
37 result += x[i]; in linear()
50 for (int i = x.length - 1; i >= 0; i--) { in linearDown()
51 result += x[i]; in linearDown()
64 for (int i = x.length - 1; i >= 0; i--) { in linearObscure()
65 int k = i + 5; in linearObscure()
79 for (int i = 0; i < x.length; i++) { in linearVeryObscure()
80 int k = (-i) + (i << 5) + i - (32 * i) + 5 + (int) i; in linearVeryObscure()
94 for (int i = 1; i <= 1; i++) { in hiddenStride()
96 for (int j = 0; j < a.length; j += i) { in hiddenStride()
[all …]
/art/test/665-checker-simd-zero/src/
DMain.java43 for (int i = 0; i < x.length; i++) { in zeroz()
44 x[i] = false; in zeroz()
69 for (int i = 0; i < x.length; i++) { in zerob()
70 x[i] = 0; in zerob()
95 for (int i = 0; i < x.length; i++) { in zeroc()
96 x[i] = 0; in zeroc()
121 for (int i = 0; i < x.length; i++) { in zeros()
122 x[i] = 0; in zeros()
147 for (int i = 0; i < x.length; i++) { in zeroi()
148 x[i] = 0; in zeroi()
[all …]

12345678910>>...44