Home
last modified time | relevance | path

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

12345678910>>...33

/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-byte-simd/src/
DMain.java51 for (int i = 0; i < 128; i++) in add()
52 a[i] += x; in add()
78 for (int i = 0; i < 128; i++) in sub()
79 a[i] -= x; in sub()
105 for (int i = 0; i < 128; i++) in mul()
106 a[i] *= x; in mul()
119 for (int i = 0; i < 128; i++) in div()
120 a[i] /= x; in div()
146 for (int i = 0; i < 128; i++) in neg()
147 a[i] = (byte) -a[i]; in neg()
[all …]
/art/test/640-checker-char-simd/src/
DMain.java51 for (int i = 0; i < 128; i++) in add()
52 a[i] += x; in add()
78 for (int i = 0; i < 128; i++) in sub()
79 a[i] -= x; in sub()
105 for (int i = 0; i < 128; i++) in mul()
106 a[i] *= x; in mul()
119 for (int i = 0; i < 128; i++) in div()
120 a[i] /= x; in div()
146 for (int i = 0; i < 128; i++) in neg()
147 a[i] = (char) -a[i]; in neg()
[all …]
/art/test/640-checker-short-simd/src/
DMain.java51 for (int i = 0; i < 128; i++) in add()
52 a[i] += x; in add()
78 for (int i = 0; i < 128; i++) in sub()
79 a[i] -= x; in sub()
105 for (int i = 0; i < 128; i++) in mul()
106 a[i] *= x; in mul()
119 for (int i = 0; i < 128; i++) in div()
120 a[i] /= x; in div()
146 for (int i = 0; i < 128; i++) in neg()
147 a[i] = (short) -a[i]; in neg()
[all …]
/art/test/640-checker-long-simd/src/
DMain.java45 for (int i = 0; i < 128; i++) in add()
46 a[i] += x; in add()
66 for (int i = 0; i < 128; i++) in sub()
67 a[i] -= x; in sub()
85 for (int i = 0; i < 128; i++) in mul()
86 a[i] *= x; in mul()
100 for (int i = 0; i < 128; i++) in div()
101 a[i] /= x; in div()
121 for (int i = 0; i < 128; i++) in neg()
122 a[i] = -a[i]; in neg()
[all …]
/art/test/640-checker-int-simd/src/
DMain.java51 for (int i = 0; i < 128; i++) in add()
52 a[i] += x; in add()
78 for (int i = 0; i < 128; i++) in sub()
79 a[i] -= x; in sub()
105 for (int i = 0; i < 128; i++) in mul()
106 a[i] *= x; in mul()
120 for (int i = 0; i < 128; i++) in div()
121 a[i] /= x; in div()
147 for (int i = 0; i < 128; i++) in neg()
148 a[i] = -a[i]; in neg()
[all …]
/art/test/640-checker-float-simd/src/
DMain.java46 for (int i = 0; i < 128; i++) in add()
47 a[i] += x; in add()
67 for (int i = 0; i < 128; i++) in sub()
68 a[i] -= x; in sub()
88 for (int i = 0; i < 128; i++) in mul()
89 a[i] *= x; in mul()
109 for (int i = 0; i < 128; i++) in div()
110 a[i] /= x; in div()
130 for (int i = 0; i < 128; i++) in neg()
131 a[i] = -a[i]; in neg()
[all …]
/art/test/640-checker-double-simd/src/
DMain.java46 for (int i = 0; i < 128; i++) in add()
47 a[i] += x; in add()
67 for (int i = 0; i < 128; i++) in sub()
68 a[i] -= x; in sub()
88 for (int i = 0; i < 128; i++) in mul()
89 a[i] *= x; in mul()
109 for (int i = 0; i < 128; i++) in div()
110 a[i] /= x; in div()
130 for (int i = 0; i < 128; i++) in neg()
131 a[i] = -a[i]; in neg()
[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/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/640-checker-boolean-simd/src/
DMain.java51 for (int i = 0; i < 128; i++) in and()
52 a[i] &= x; // NOTE: bitwise and, not the common && in and()
78 for (int i = 0; i < 128; i++) in or()
79 a[i] |= x; // NOTE: bitwise or, not the common || in or()
105 for (int i = 0; i < 128; i++) in xor()
106 a[i] ^= x; // NOTE: bitwise xor in xor()
132 for (int i = 0; i < 128; i++) in not()
133 a[i] = !a[i]; in not()
143 for (int i = 0; i < 128; i++) { in main()
144 a[i] = (i & 1) == 0; in main()
[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/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-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-hadd-short/src/
DMain.java61 for (int i = 0; i < min_length; i++) { in halving_add_signed()
62 bo[i] = (short) ((b1[i] + b2[i]) >> 1); in halving_add_signed()
102 for (int i = 0; i < min_length; i++) { in halving_add_signed_alt()
104 bo[i] = (short) (((b1[i] + 10) + (b2[i] - 10)) >> 1); in halving_add_signed_alt()
143 for (int i = 0; i < min_length; i++) { in halving_add_unsigned()
144 bo[i] = (short) (((b1[i] & 0xffff) + (b2[i] & 0xffff)) >> 1); in halving_add_unsigned()
181 for (int i = 0; i < min_length; i++) { in rounding_halving_add_signed()
182 bo[i] = (short) ((b1[i] + b2[i] + 1) >> 1); in rounding_halving_add_signed()
219 for (int i = 0; i < min_length; i++) { in rounding_halving_add_signed_alt()
221 bo[i] = (short) (((1 + b1[i]) + b2[i]) >> 1); in rounding_halving_add_signed_alt()
[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/646-checker-hadd-alt-char/src/
DMain.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()
107 for (int i = 0; i < min_length; i++) { in halving_add_also_unsigned()
108 bo[i] = (char) (((b1[i] & 0xffff) + (b2[i] & 0xffff)) >>> 1); in halving_add_also_unsigned()
145 for (int i = 0; i < min_length; i++) { in rounding_halving_add_unsigned()
146 bo[i] = (char) ((b1[i] + b2[i] + 1) >>> 1); in rounding_halving_add_unsigned()
189 for (int i = 0; i < min_length; i++) { in rounding_halving_add_also_unsigned()
190 bo[i] = (char) (((b1[i] & 0xffff) + (b2[i] & 0xffff) + 1) >>> 1); in rounding_halving_add_also_unsigned()
229 for (int i = 0; i < min_length; i++) { in halving_add_unsigned_constant()
230 bo[i] = (char) ((b1[i] + 0xffff) >>> 1); in halving_add_unsigned_constant()
[all …]
/art/test/646-checker-hadd-alt-short/src/
DMain.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()
104 for (int i = 0; i < min_length; i++) { in halving_add_unsigned()
105 bo[i] = (short) (((b1[i] & 0xffff) + (b2[i] & 0xffff)) >>> 1); in halving_add_unsigned()
142 for (int i = 0; i < min_length; i++) { in rounding_halving_add_signed()
143 bo[i] = (short) ((b1[i] + b2[i] + 1) >>> 1); in rounding_halving_add_signed()
183 for (int i = 0; i < min_length; i++) { in rounding_halving_add_unsigned()
184 bo[i] = (short) (((b1[i] & 0xffff) + (b2[i] & 0xffff) + 1) >>> 1); in rounding_halving_add_unsigned()
223 for (int i = 0; i < min_length; i++) { in halving_add_signed_constant()
224 bo[i] = (short) ((b1[i] + 0x7fff) >>> 1); in halving_add_signed_constant()
[all …]
/art/test/646-checker-hadd-char/src/
DMain.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()
104 for (int i = 0; i < min_length; i++) { in halving_add_also_unsigned()
105 bo[i] = (char) (((b1[i] & 0xffff) + (b2[i] & 0xffff)) >> 1); in halving_add_also_unsigned()
142 for (int i = 0; i < min_length; i++) { in rounding_halving_add_unsigned()
143 bo[i] = (char) ((b1[i] + b2[i] + 1) >> 1); in rounding_halving_add_unsigned()
186 for (int i = 0; i < min_length; i++) { in rounding_halving_add_also_unsigned()
187 bo[i] = (char) (((b1[i] & 0xffff) + (b2[i] & 0xffff) + 1) >> 1); in rounding_halving_add_also_unsigned()
226 for (int i = 0; i < min_length; i++) { in halving_add_unsigned_constant()
227 bo[i] = (char) ((b1[i] + 0xffff) >> 1); in halving_add_unsigned_constant()
[all …]
/art/test/623-checker-loop-regressions/src/
DMain.java31 for (int i = 0; i < 10; i++) { in earlyExitFirst()
32 if (i == m) { in earlyExitFirst()
49 for (int i = 0; i < 10; i++) { in earlyExitLast()
51 if (i == m) { in earlyExitLast()
72 for (int i = 0; i < 2; i++) { in earlyExitNested()
78 if (i == 1) { in earlyExitNested()
103 for (int i = 0; i < 10; i++) { in transferNarrowWrap()
124 for (short i = 0; i < 10; i++) { in polynomialShort()
125 x = x - i; // polynomial on narrowing linear in polynomialShort()
143 for (long i = 0; i < 10; i++) { in polynomialIntFromLong()
[all …]
/art/test/646-checker-hadd-byte/src/
DMain.java61 for (int i = 0; i < min_length; i++) { in halving_add_signed()
62 bo[i] = (byte) ((b1[i] + b2[i]) >> 1); in halving_add_signed()
101 for (int i = 0; i < min_length; i++) { in halving_add_unsigned()
102 bo[i] = (byte) (((b1[i] & 0xff) + (b2[i] & 0xff)) >> 1); in halving_add_unsigned()
139 for (int i = 0; i < min_length; i++) { in rounding_halving_add_signed()
140 bo[i] = (byte) ((b1[i] + b2[i] + 1) >> 1); in rounding_halving_add_signed()
180 for (int i = 0; i < min_length; i++) { in rounding_halving_add_unsigned()
181 bo[i] = (byte) (((b1[i] & 0xff) + (b2[i] & 0xff) + 1) >> 1); in rounding_halving_add_unsigned()
220 for (int i = 0; i < min_length; i++) { in halving_add_signed_constant()
221 bo[i] = (byte) ((b1[i] + 0x7f) >> 1); in halving_add_signed_constant()
[all …]
/art/test/646-checker-hadd-alt-byte/src/
DMain.java64 for (int i = 0; i < min_length; i++) { in halving_add_signed()
65 bo[i] = (byte) ((b1[i] + b2[i]) >>> 1); in halving_add_signed()
104 for (int i = 0; i < min_length; i++) { in halving_add_unsigned()
105 bo[i] = (byte) (((b1[i] & 0xff) + (b2[i] & 0xff)) >>> 1); in halving_add_unsigned()
142 for (int i = 0; i < min_length; i++) { in rounding_halving_add_signed()
143 bo[i] = (byte) ((b1[i] + b2[i] + 1) >>> 1); in rounding_halving_add_signed()
183 for (int i = 0; i < min_length; i++) { in rounding_halving_add_unsigned()
184 bo[i] = (byte) (((b1[i] & 0xff) + (b2[i] & 0xff) + 1) >>> 1); in rounding_halving_add_unsigned()
223 for (int i = 0; i < min_length; i++) { in halving_add_signed_constant()
224 bo[i] = (byte) ((b1[i] + 0x7f) >>> 1); in halving_add_signed_constant()
[all …]
/art/test/561-shared-slowpaths/src/
DMain.java28 for (int i = l1; i < h1; i++) { in init()
29 x[i] = i; in init()
31 for (int i = l2; i < h2; i++) { in init()
32 y[i] = i; in init()
52 for (int i = 0; i < 100; i++) { in main()
53 expectEquals(x[i], i); in main()
54 expectEquals(y[i], i); in main()
66 for (int i = 0; i < 100; i++) { in main()
67 expectEquals(x[i], 0); in main()
68 expectEquals(y[i], 0); in main()
[all …]
/art/test/485-checker-dce-switch/src/
DMain.java34 int i = $inline$method(); in wholeSwitchDead() local
36 if (i > 100) { in wholeSwitchDead()
39 i++; in wholeSwitchDead()
42 i = 99; in wholeSwitchDead()
45 i = 100; in wholeSwitchDead()
48 i = -100; in wholeSwitchDead()
51 i = 7; in wholeSwitchDead()
54 i = -9; in wholeSwitchDead()
57 l += i; in wholeSwitchDead()
74 int i = $inline$method(); in constantSwitch_InRange() local
[all …]

12345678910>>...33