/art/libartbase/base/ |
D | leb128_test.cc | 102 for (size_t j = 0; j < 5; ++j) { in TEST() local 103 if (j < builder.GetData().size()) { in TEST() 104 EXPECT_EQ(data_ptr[j], encoded_data_ptr[j]) << " i = " << i << " j = " << j; in TEST() 106 EXPECT_EQ(data_ptr[j], 0U) << " i = " << i << " j = " << j; in TEST() 121 for (size_t j = 0; j < 5; ++j) { in TEST() local 122 if (j < data_size) { in TEST() 123 EXPECT_EQ(data_ptr[j], encoded_data[j]) << " i = " << i << " j = " << j; in TEST() 125 EXPECT_EQ(data_ptr[j], 0U) << " i = " << i << " j = " << j; in TEST() 141 for (size_t j = 0; j < UnsignedLeb128Size(uleb128_tests[i].decoded); ++j) { in TEST() local 142 EXPECT_EQ(data_ptr[j], encoded_data_ptr[j]) << " i = " << i << " j = " << j; in TEST() [all …]
|
/art/compiler/debug/ |
D | src_map_elem_test.cc | 38 for (size_t j = 0; j != arraysize(elems); ++j) { in TEST() local 39 bool expected = (i != 6u ? i : 4u) == (j != 6u ? j : 4u); in TEST() 40 EXPECT_EQ(expected, elems[i] == elems[j]) << i << " " << j; in TEST() 45 for (size_t j = 0; j != arraysize(elems); ++j) { in TEST() local 46 bool expected = (i != 6u ? i : 4u) < (j != 6u ? j : 4u); in TEST() 47 EXPECT_EQ(expected, elems[i] < elems[j]) << i << " " << j; in TEST()
|
/art/test/550-checker-multiply-accumulate/src/ |
D | Main.java | 430 for (int j = 0; j < 100; j++) { in SimdMulAdd() 431 array2[j] += 12345 * array1[j]; in SimdMulAdd() 436 for (int j = 0; j < 100; j++) { in SimdMulAddLong() 437 array2[j] += 12345 * array1[j]; in SimdMulAddLong() 455 for (int j = 0; j < 100; j++) { in SimdMulSub() 456 array2[j] -= 12345 * array1[j]; in SimdMulSub() 461 for (int j = 0; j < 100; j++) { in SimdMulSubLong() 462 array2[j] -= 12345 * array1[j]; in SimdMulSubLong() 475 for (int j = 0; j < 100; j++) { in SimdMulMultipleUses() 476 int temp = 12345 * array1[j]; in SimdMulMultipleUses() [all …]
|
/art/test/153-reference-stress/src/ |
D | Main.java | 46 for (int j = 0; j < weakReferences.length; ++j) { in GcThread() 47 weakReferences[j] = new WeakReference(temp); in GcThread() 53 for (int j = 0; j < weakReferences.length; ++j) { in run() 54 weakReferences[j] = new WeakReference(o); in run() 64 for (int j = 0; j < weakReferences.length; ++j) { in run() 65 keepAlive = weakReferences[j].get(); in run() 67 for (int j = 0; j < weakReferences.length; ++j) { in run() 68 weakReferences[j].clear(); in run()
|
/art/test/567-checker-builder-intrinsics/src/ |
D | TestRotate.java | 232 int j = i & 31; in testRotateLeftBoolean() local 234 expectEqualsInt(1 << j, rotateLeftBoolean(true, i)); in testRotateLeftBoolean() 248 int j = i & 31; in testRotateLeftByte() local 251 expectEqualsInt((1 << j), rotateLeftByte((byte)0x0001, i)); in testRotateLeftByte() 252 expectEqualsInt((0x12 << j) | (0x12 >>> -j), rotateLeftByte((byte)0x12, i)); in testRotateLeftByte() 266 int j = i & 31; in testRotateLeftShort() local 269 expectEqualsInt((1 << j), rotateLeftShort((short)0x0001, i)); in testRotateLeftShort() 270 expectEqualsInt((0x1234 << j) | (0x1234 >>> -j), rotateLeftShort((short)0x1234, i)); in testRotateLeftShort() 285 int j = i & 31; in testRotateLeftChar() local 287 expectEqualsInt((1 << j), rotateLeftChar((char)0x0001, i)); in testRotateLeftChar() [all …]
|
D | TestCompare.java | 338 for (byte j = -11; j <= 11; j++) { in testCompareBytes() 340 if (i < j) expected = -1; in testCompareBytes() 341 else if (i > j) expected = 1; in testCompareBytes() 342 expectEquals(expected, compareBytes(i, j)); in testCompareBytes() 373 for (short j = -11; j <= 11; j++) { in testCompareShorts() 375 if (i < j) expected = -1; in testCompareShorts() 376 else if (i > j) expected = 1; in testCompareShorts() 377 expectEquals(expected, compareShorts(i, j)); in testCompareShorts() 396 for (char j = 0; j <= 11; j++) { in testCompareChars() 398 if (i < j) expected = -1; in testCompareChars() [all …]
|
/art/test/530-checker-loops1/src/ |
D | Main.java | 96 for (int j = 0; j < a.length; j += i) { in hiddenStride() 97 result += a[j]; in hiddenStride() 570 for (int j = 0; j < b.length; j++) { in linearTriangularOnTwoArrayLengths() 572 a[j] += 1; in linearTriangularOnTwoArrayLengths() 574 b[j] += 1; in linearTriangularOnTwoArrayLengths() 591 for (int j = 0; j < i; j++) { in linearTriangularOnOneArrayLength() 593 a[j] += 1; in linearTriangularOnOneArrayLength() 595 b[j] += 1; in linearTriangularOnOneArrayLength() 612 for (int j = 0; j < i; j++) { in linearTriangularOnParameter() 614 a[j] += 1; in linearTriangularOnParameter() [all …]
|
/art/test/2030-long-running-child/src/ |
D | Main.java | 31 for (int j = 0; j < 10; ++j) { in run() 32 a[j] = new int[50000 * j + 20]; in run() 33 a[j][17] = 1; in run() 39 for (int j = 0; j < 10; ++j) { in run() 40 sum += a[j][16] /* = 0 */ + a[j][17] /* = 1 */; in run()
|
/art/test/552-checker-x86-avx2-bit-manipulation/src/ |
D | Main.java | 50 long j = 1; in and_not_64() local 81 int j = 1; in and_not_32() local 126 int j = 5; in reset_lowest_set_bit_32() local 131 j += y; in reset_lowest_set_bit_32() 132 j = j & j-1; in reset_lowest_set_bit_32() 133 k +=j; in reset_lowest_set_bit_32() 138 return y + j + k + l; in reset_lowest_set_bit_32() 165 long j = 5; in reset_lowest_set_bit_64() local 170 j += y; in reset_lowest_set_bit_64() 171 j = j & j-1; in reset_lowest_set_bit_64() [all …]
|
/art/test/625-checker-licm-regressions/src/ |
D | Main.java | 44 int j = 0; in foo() local 47 } while (j < arr.length); in foo() 69 int j = 0; in bar() local 71 j++; in bar() 72 sA = j; in bar() 73 } while (j < arr.length); in bar() 88 int j = 0; in catcher() local 91 j++; in catcher() 92 } while (j < arr.length); in catcher() 94 return -j; // flag exception with negative value in catcher() [all …]
|
/art/test/659-unpadded-array/src-art/ |
D | Main.java | 30 for (int j = 0; j < o.length; j++) { in main() 31 if (o[j] != null) { in main() 35 System.out.println("Unexpected value: " + o[j]); in main() 48 for (int j = 0; j < intArray.length; j++) { in allocateIntArray() 49 intArray[j] = 1; in allocateIntArray()
|
/art/test/530-checker-loops2/src/ |
D | Main.java | 37 for (int j = 0; j < i; j++) { in bubble() 38 if (a[j] > a[j+1]) { in bubble() 39 int tmp = a[j]; in bubble() 40 a[j] = a[j+1]; in bubble() 41 a[j+1] = tmp; in bubble() 331 for (int j = Integer.MIN_VALUE + 4; j < i - 5; j++) { in justRightTriangular1() 332 sResult += a[j - (Integer.MIN_VALUE + 4)]; in justRightTriangular1() 346 for (int j = 4; j < i - 5; j++) { in justRightTriangular2() 347 sResult += a[j - 4]; in justRightTriangular2() 363 for (int j = 4; j < i - 5; j++) { in justOOBTriangular() [all …]
|
/art/test/706-checker-scheduler/src/ |
D | Main.java | 145 for (int j = 0; j < 100; j++) { in arrayAccessVariable() 213 for (int j = 0; j < 100; j++) { in arrayAccessSub() 273 for (int j = 0; j < 9; j++) { in arrayAccessLoopVariable() 274 array[j]++; in arrayAccessLoopVariable() 275 array[j + 1]++; in arrayAccessLoopVariable() 544 for (int j = 0; j <= 8; j++) { in testVecReplicateScalar() 576 for (int j = 0; j <= 8; j++) { in testVecSetScalars() 658 int j = a[i]; in testNoSelfDependantSchedNode() local 659 b[i] = (j > MAX ? MAX : 0); in testNoSelfDependantSchedNode()
|
/art/test/499-bce-phi-array-length/src/ |
D | Main.java | 24 for (int j = 0; j < 2; ++j) { in foo() 29 result += array[j]; in foo() 39 for (int j = 0; j < 2; ++j) { in bar() 40 result += array[j]; in bar()
|
/art/test/006-args/src/ |
D | ArgsTest.java | 33 void argTest(int a, char c, double d, long j, float f) { in argTest() argument 35 + Long.toHexString(mLongArray[1]) + " " + Long.toHexString(j)); in argTest() 37 + mLongArray[1] + " " + j); in argTest() 39 System.out.println(j); in argTest() 40 System.out.println("j = " + j); in argTest() 42 + " j=" + j + " f=" + f); in argTest()
|
/art/compiler/driver/ |
D | compiled_method_storage_test.cc | 79 for (size_t j = 0; j != compiled_methods.size(); ++j) { in TEST() local 81 CompiledMethod* rhs = compiled_methods[j]; in TEST() 82 bool same_code = ((i ^ j) & code_bit) == 0u; in TEST() 83 bool same_vmap_table = ((i ^ j) & vmap_table_bit) == 0u; in TEST() 84 bool same_cfi_info = ((i ^ j) & cfi_info_bit) == 0u; in TEST() 85 bool same_patches = ((i ^ j) & patches_bit) == 0u; in TEST() 87 << i << " " << j; in TEST() 89 << i << " " << j; in TEST() 91 << i << " " << j; in TEST() 93 << i << " " << j; in TEST()
|
/art/runtime/ |
D | jvalue.h | 34 JValue() : j(0) {} in PACKED() 40 j = ((static_cast<int64_t>(new_b) << 56) >> 56); // Sign-extend to 64 bits. in PACKED() 45 j = static_cast<int64_t>(new_c); // Zero-extend to 64 bits. in PACKED() 56 j = ((static_cast<int64_t>(new_i) << 32) >> 32); // Sign-extend to 64 bits. in PACKED() 59 int64_t GetJ() const { return j; } in PACKED() 60 void SetJ(int64_t new_j) { j = new_j; } in PACKED() 70 j = ((static_cast<int64_t>(new_s) << 48) >> 48); // Sign-extend to 64 bits. in PACKED() 75 j = static_cast<int64_t>(new_z); // Zero-extend to 64 bits. in PACKED() 86 int64_t j; in PACKED() local
|
/art/test/473-remove-dead-block/src/ |
D | Main.java | 23 int j=4; in test() local 35 for (j = 1; j < 39; ++j) { in test() 36 j++; in test()
|
/art/test/618-checker-induction/src/ |
D | Main.java | 64 for (int j = 0; j < 4; j++) { in deadNestedLoops() 82 for (int j = 0; j < 4; j++) { in deadNestedAndFollowingLoops() 88 for (int j = 0; j < 4; j++) { in deadNestedAndFollowingLoops() 304 for (int j = 0; j < 10; j++) { in closedFormNested() 327 for (int j = 0; j < 23; j++) { in closedFormNestedAlt() 355 for (int j = 0; j < 10; j++) { in closedFormNestedN() 366 for (int j = 0; j < 23; j++) { in closedFormNestedNAlt() 377 for (int j = 0; j < n; j++) { in closedFormNestedMN() 388 for (int j = 0; j < n; j++) { in closedFormNestedMNAlt()
|
/art/test/482-checker-loop-back-edge-use/src/ |
D | Main.java | 98 for (long j = System.currentTimeMillis(); j != 42; ++j) { in loop5() 120 for (long j = System.currentTimeMillis(); j != 42; ++j) { in loop6() 121 System.out.print(j); // non-empty body in loop6()
|
/art/runtime/gc/accounting/ |
D | space_bitmap_test.cc | 69 for (size_t j = 0; j < kBitsPerIntPtrT * 3; ++j) { in TEST_F() local 71 reinterpret_cast<mirror::Object*>(heap_begin + j * kObjectAlignment); in TEST_F() 83 for (size_t j = 0; j < static_cast<size_t>(kBitsPerIntPtrT * 2); ++j) { in TEST_F() local 85 reinterpret_cast<mirror::Object*>(heap_begin + (i + j) * kObjectAlignment); in TEST_F() 100 for (size_t j = 0; j < heap_capacity; j += kObjectAlignment) { in TEST_F() local 101 const mirror::Object* obj = reinterpret_cast<mirror::Object*>(heap_begin + j); in TEST_F() 168 for (int j = 0; j < 10000; ++j) { in RunTest() local 179 for (int j = 0; j < 50; ++j) { in RunTest() local
|
/art/test/096-array-copy-concurrent-gc/src/ |
D | Main.java | 71 for (int j = 0; j < array.length; j++) { in stressArray() 78 for (int j = 0; j < array.length; j++) { in stressArray()
|
/art/test/530-checker-peel-unroll/src/ |
D | Main.java | 51 for (int j = 0; j < m[i].length; j++) { in initMatrix() 52 m[i][j] = (double) (i * LENGTH / (j + 1)); in initMatrix() 318 for (int j = 0; j < 16; j++) { in unrollingInTheNest() 392 for (int j = 0; j < 128; j++) { in unrollingTwoLoopsInTheNest() 554 for (int j = 0; j < 16; j++) { in unrollingLiveOutsNested() 859 for (int j = 0; j < LENGTH; j++) { in peelingBreakFromNest() 863 a[j] += 1; in peelingBreakFromNest()
|
/art/test/530-checker-lse/src/ |
D | Main.java | 36 TestClass(int i, int j) { in TestClass() argument 38 this.j = j; in TestClass() 41 int j; field in TestClass 56 int j; field in TestClass2 147 obj2.j = 2; in test1() 148 return obj1.i + obj2.j; in test1() 164 obj.j = 1; in test2() 165 obj.j = 1; in test2() 166 return obj.j; in test2() 201 obj1.j = 2; in test3() [all …]
|
/art/compiler/linker/ |
D | linker_patch_test.cc | 155 for (size_t j = 0; j != arraysize(patches); ++j) { in TEST() local 156 bool expected = (i != last_index ? i : 7u) == (j != last_index ? j : 7u); in TEST() 157 EXPECT_EQ(expected, patches[i] == patches[j]) << i << " " << j; in TEST() 162 for (size_t j = 0; j != arraysize(patches); ++j) { in TEST() local 163 bool expected = (i != last_index ? i : 7u) < (j != last_index ? j : 7u); in TEST() 164 EXPECT_EQ(expected, patches[i] < patches[j]) << i << " " << j; in TEST()
|