Home
last modified time | relevance | path

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

12345678910>>...18

/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 …]
DFloatMath.java27 int i; in convTest() local
32 i = (int) f; in convTest()
33 Main.assertTrue(i == 1234); in convTest()
36 i = (int) f; in convTest()
37 Main.assertTrue(i == -1234); in convTest()
55 i = (int) d; in convTest()
56 Main.assertTrue(i == 1234); in convTest()
59 i = (int) d; in convTest()
60 Main.assertTrue(i == -1234); in convTest()
77 i = 7654; in convTest()
[all …]
/art/test/449-checker-bce/src/
DMain.java38 for (int i = 1; i < size; i++) flags[i] = true; // Can eliminate. in sieve()
39 for (int i = 2; i < size; i++) { in sieve()
40 if (flags[i]) { // Can eliminate. in sieve()
42 for (int k = i + 1; k <= size; k += i) in sieve()
285 for (int i = 0; i < array.length; i++) { in loopPattern1()
286 array[i] = 1; // Bounds check can be eliminated. in loopPattern1()
289 for (int i = 1; i < array.length; i++) { in loopPattern1()
290 array[i] = 1; // Bounds check can be eliminated. in loopPattern1()
293 for (int i = 1; i < array.length - 1; i++) { in loopPattern1()
294 array[i] = 1; // Bounds check can be eliminated. in loopPattern1()
[all …]
/art/runtime/
Dleb128_test.cc96 for (size_t i = 0; i < arraysize(uleb128_tests); ++i) { in TEST() local
98 builder.PushBackUnsigned(uleb128_tests[i].decoded); in TEST()
99 EXPECT_EQ(UnsignedLeb128Size(uleb128_tests[i].decoded), builder.GetData().size()); in TEST()
100 const uint8_t* data_ptr = &uleb128_tests[i].leb128_data[0]; 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()
109 EXPECT_EQ(DecodeUnsignedLeb128(&data_ptr), uleb128_tests[i].decoded) << " i = " << i; in TEST()
115 for (size_t i = 0; i < arraysize(uleb128_tests); ++i) { in TEST() local
117 uint8_t* end = EncodeUnsignedLeb128(encoded_data, uleb128_tests[i].decoded); in TEST()
119 EXPECT_EQ(UnsignedLeb128Size(uleb128_tests[i].decoded), data_size); in TEST()
[all …]
/art/compiler/utils/
Dswap_space_test.cc44 for (int32_t i = 0; i < 1000000; ++i) { in SwapTest() local
45 v.push_back(i); in SwapTest()
46 EXPECT_EQ(i, v[i]); in SwapTest()
51 for (int32_t i = 0; i < 1000000; ++i) { in SwapTest() local
52 v2.push_back(i); in SwapTest()
53 EXPECT_EQ(i, v2[i]); in SwapTest()
58 for (int32_t i = 0; i < 1000000; ++i) { in SwapTest() local
59 v3.push_back(i); in SwapTest()
60 EXPECT_EQ(i, v2[i]); in SwapTest()
64 for (int32_t i = 0; i < 1000000; ++i) { in SwapTest() local
[all …]
Dgrowable_array.h44 for (size_t i = 0; i < init_length; ++i) { in GrowableArray() local
45 elem_list_[i] = initial_data; in GrowableArray()
50 for (size_t i = 0; i < num_used_; ++i) { in Contains() local
51 if (elem_list_[i] == value) { in Contains()
89 for (size_t i = Size() - 1; i > index; --i) { in InsertAt() local
90 elem_list_[i] = elem_list_[i - 1]; in InsertAt()
122 for (size_t i = 0; i < num_used_ - 1; i++) { in Delete() local
123 if (!found && elem_list_[i] == element) { in Delete()
127 elem_list_[i] = elem_list_[i+1]; in Delete()
136 for (size_t i = index; i < num_used_ - 1; i++) { in DeleteAt() local
[all …]
/art/compiler/dex/
Dvreg_analysis.cc29 for (int i = 0; i < count; i++) { in DumpRegLocTable() local
31 table[i].orig_sreg, storage_name[table[i].location], in DumpRegLocTable()
32 table[i].wide ? 'W' : 'N', table[i].defined ? 'D' : 'U', in DumpRegLocTable()
33 table[i].fp ? 'F' : table[i].ref ? 'R' :'C', in DumpRegLocTable()
34 table[i].is_const ? 'c' : 'n', in DumpRegLocTable()
35 table[i].high_word ? 'H' : 'L', table[i].home ? 'h' : 't', in DumpRegLocTable()
36 table[i].reg.GetRawBits(), in DumpRegLocTable()
37 table[i].s_reg_low); in DumpRegLocTable()
51 for (int i = 0; i < GetNumSSARegs(); i++) { in InitRegLocations() local
52 loc[i] = fresh_loc; in InitRegLocations()
[all …]
Dlocal_value_numbering_test.cc97 for (size_t i = 0u; i != count; ++i) { in DoPrepareIFields() local
98 const IFieldDef* def = &defs[i]; in DoPrepareIFields()
117 for (size_t i = 0u; i != count; ++i) { in DoPrepareSFields() local
118 const SFieldDef* def = &defs[i]; in DoPrepareSFields()
141 for (size_t i = 0u; i != count; ++i) { in DoPrepareMIRs() local
142 const MIRDef* def = &defs[i]; in DoPrepareMIRs()
143 MIR* mir = &mirs_[i]; in DoPrepareMIRs()
158 mir->ssa_rep = &ssa_reps_[i]; in DoPrepareMIRs()
164 mir->offset = i; // LVN uses offset only for debug output in DoPrepareMIRs()
167 if (i != 0u) { in DoPrepareMIRs()
[all …]
/art/test/011-array-copy/src/
DMain.java32 for (int i = 0; i < stringArray.length; i++) in testObjectCopy()
33 stringArray[i] = new String(Integer.toString(i)); in testObjectCopy()
52 for (int i = 0; i < ARRAY_SIZE; i++) { in initByteArray()
53 array[i] = (byte) i; in initByteArray()
57 for (int i = 0; i < ARRAY_SIZE; i++) { in initShortArray()
58 array[i] = (short) i; in initShortArray()
62 for (int i = 0; i < ARRAY_SIZE; i++) { in initIntArray()
63 array[i] = (int) i; in initIntArray()
67 for (int i = 0; i < ARRAY_SIZE; i++) { in initLongArray()
68 array[i] = (long) i; in initLongArray()
[all …]
/art/compiler/optimizing/
Dparallel_move_resolver.cc28 for (size_t i = 0; i < parallel_move->NumMoves(); ++i) { in BuildInitialMoveList() local
29 MoveOperands* move = parallel_move->MoveOperandsAt(i); in BuildInitialMoveList()
41 for (size_t i = 0; i < moves_.Size(); ++i) { in EmitNativeCode() local
42 const MoveOperands& move = *moves_.Get(i); in EmitNativeCode()
47 PerformMove(i); in EmitNativeCode()
52 for (size_t i = 0; i < moves_.Size(); ++i) { in EmitNativeCode() local
53 MoveOperands* move = moves_.Get(i); in EmitNativeCode()
56 EmitMove(i); in EmitNativeCode()
132 for (size_t i = 0; i < moves_.Size(); ++i) { in PerformMove() local
133 const MoveOperands& other_move = *moves_.Get(i); in PerformMove()
[all …]
Dcode_generator.cc94 for (size_t i = 0, e = instruction->InputCount(); i < e; ++i) { in CheckTypeConsistency() local
95 DCHECK(CheckType(instruction->InputAt(i)->GetType(), locations->InAt(i))) in CheckTypeConsistency()
96 << instruction->InputAt(i)->GetType() in CheckTypeConsistency()
97 << " " << locations->InAt(i); in CheckTypeConsistency()
101 for (size_t i = 0; i < instruction->EnvironmentSize(); ++i) { in CheckTypeConsistency() local
102 if (environment->GetInstructionAt(i) != nullptr) { in CheckTypeConsistency()
103 Primitive::Type type = environment->GetInstructionAt(i)->GetType(); in CheckTypeConsistency()
104 DCHECK(CheckType(type, environment->GetLocationAt(i))) in CheckTypeConsistency()
105 << type << " " << environment->GetLocationAt(i); in CheckTypeConsistency()
107 DCHECK(environment->GetLocationAt(i).IsInvalid()) in CheckTypeConsistency()
[all …]
/art/test/023-many-interfaces/
Diface-gen.c14 int i; in createFiles() local
16 for (i = 0; i < count; i++) { in createFiles()
19 snprintf(nameBuf, sizeof(nameBuf), "src/Interface%03d.java", i); in createFiles()
26 fprintf(fp, "interface Interface%03d {\n", i); in createFiles()
27 if ((i & 0x01) != 0) in createFiles()
28 fprintf(fp, " int func%03d();\n", i); in createFiles()
35 for (i = 0; i < count; i++) { in createFiles()
36 fprintf(fp, " Interface%03d%s\n", i, (i == count-1) ? "" : ","); in createFiles()
39 for (i = 1; i < count; i += 2) { in createFiles()
40 fprintf(fp, " public int func%03d() { return %d; }\n", i, i); in createFiles()
/art/tools/dexfuzz/src/dexfuzz/rawdex/
DClassDataItem.java47 for (int i = 0; i < staticFieldsSize; i++) { in read()
48 (staticFields[i] = new EncodedField()).read(file); in read()
51 for (int i = 0; i < instanceFieldsSize; i++) { in read()
52 (instanceFields[i] = new EncodedField()).read(file); in read()
55 for (int i = 0; i < directMethodsSize; i++) { in read()
56 (directMethods[i] = new EncodedMethod()).read(file); in read()
59 for (int i = 0; i < virtualMethodsSize; i++) { in read()
60 (virtualMethods[i] = new EncodedMethod()).read(file); in read()
71 for (int i = 0; i < staticFieldsSize; i++) { in write()
72 staticFields[i].write(file); in write()
[all …]
DMapList.java48 for (int i = 0; i < size; i++) { in read()
69 for (int i = 0; i < mapItem.size; i++) { in read()
76 for (int i = 0; i < mapItem.size; i++) { in read()
83 for (int i = 0; i < mapItem.size; i++) { in read()
90 for (int i = 0; i < mapItem.size; i++) { in read()
97 for (int i = 0; i < mapItem.size; i++) { in read()
104 for (int i = 0; i < mapItem.size; i++) { in read()
115 for (int i = 0; i < mapItem.size; i++) { in read()
124 for (int i = 0; i < mapItem.size; i++) { in read()
132 for (int i = 0; i < mapItem.size; i++) { in read()
[all …]
/art/runtime/mirror/
Dobject_array-inl.h59 inline T* ObjectArray<T>::Get(int32_t i) { in Get() argument
60 if (!CheckIsValidIndex(i)) { in Get()
64 return GetFieldObject<T>(OffsetOfElement(i)); in Get()
80 inline void ObjectArray<T>::Set(int32_t i, T* object) { in Set() argument
82 Set<true>(i, object); in Set()
84 Set<false>(i, object); in Set()
90 inline void ObjectArray<T>::Set(int32_t i, T* object) { in Set() argument
91 if (CheckIsValidIndex(i) && CheckAssignable<kVerifyFlags>(object)) { in Set()
92 SetFieldObject<kTransactionActive, kCheckTransaction, kVerifyFlags>(OffsetOfElement(i), object); in Set()
100 inline void ObjectArray<T>::SetWithoutChecks(int32_t i, T* object) { in SetWithoutChecks() argument
[all …]
/art/test/444-checker-nce/src/
DMain.java109 for (int i = 0; i < count; i++) { in forRemoveTest()
110 if (i % 2 == 0) { in forRemoveTest()
125 for (int i = 0; i < count; i++) { in forKeepTest()
126 if (i % 2 == 0) { in forKeepTest()
143 for (int i = 0; i < count; i++) { in phiFlowRemoveTest()
144 if (i % 2 == 0) { in phiFlowRemoveTest()
149 for (int i = 0; i < count; i++) { in phiFlowRemoveTest()
150 if (i % 3 == 0) { in phiFlowRemoveTest()
165 for (int i = 0; i < count; i++) { in phiFlowKeepTest()
166 if (i % 2 == 0) { in phiFlowKeepTest()
[all …]
/art/test/027-arithmetic/src/
DMain.java72 int i; in convTest() local
77 i = (int) f; in convTest()
78 System.out.println("f=" + f + " --> i=" + i); in convTest()
81 i = (int) f; in convTest()
82 System.out.println("f=" + f + " --> i=" + i); in convTest()
86 i = (int) d; in convTest()
87 System.out.println("d=" + d + " --> i=" + i); in convTest()
90 i = (int) d; in convTest()
91 System.out.println("d=" + d + " --> i=" + i); in convTest()
103 i = 7654; in convTest()
[all …]
/art/runtime/arch/
Dmemcmp16_test.cc38 for (size_t i = 0; i < count; i++) { in memcmp16_compare() local
39 if (s0[i] != s1[i]) { in memcmp16_compare()
40 return static_cast<int32_t>(s0[i]) - static_cast<int32_t>(s1[i]); in memcmp16_compare()
105 for (size_t i = 0; i < min; ++i) { in CheckSeparate() local
106 s1[i] = static_cast<uint16_t>(r.next() & 0xFFFF); in CheckSeparate()
107 s2[i] = s1[i]; in CheckSeparate()
109 for (size_t i = min; i < count1; ++i) { in CheckSeparate() local
110 s1[i] = static_cast<uint16_t>(r.next() & 0xFFFF); in CheckSeparate()
112 for (size_t i = min; i < count2; ++i) { in CheckSeparate() local
113 s2[i] = static_cast<uint16_t>(r.next() & 0xFFFF); in CheckSeparate()
[all …]
/art/runtime/base/
Dhash_set_test.cc44 for (size_t i = 0; i < len; ++i) { in RandomString() local
84 for (size_t i = 0; i < count; ++i) { in TEST_F() local
87 hash_set.Insert(strings[i]); in TEST_F()
88 auto it = hash_set.Find(strings[i]); in TEST_F()
90 ASSERT_EQ(*it, strings[i]); in TEST_F()
94 for (size_t i = 1; i < count; i += 2) { in TEST_F() local
95 auto it = hash_set.Find(strings[i]); in TEST_F()
97 ASSERT_EQ(*it, strings[i]); in TEST_F()
101 for (size_t i = 1; i < count; i += 2) { in TEST_F() local
102 auto it = hash_set.Find(strings[i]); in TEST_F()
[all …]
/art/test/109-suspend-check/src/
DMain.java42 for (int i = 0; i < TEST_TIME; i++) { in main()
106 long i = 0L; in run() local
108 i += smi.ReturnArgOrConst(i); in run()
119 long i = 0L; in run() local
121 smi.PutOrNop(i); in run()
122 i++; in run()
133 long i = 0L; in run() local
135 i += smi.ConstOrIGet(); in run()
147 long i = 0L; in run() local
149 i += smi.ConstOrIGet(); in run()
[all …]
/art/test/701-easy-div-rem/
DgenMain.py17 [('CheckDiv', 'idiv_by_pow2_', [2**i for i in range(31)]),
18 ('CheckDiv', 'idiv_by_small_', [i for i in range(3, 16) if i not in (4, 8)]),
19 ('CheckRem', 'irem_by_pow2_', [2**i for i in range(31)])]),
21 [('CheckDiv', 'ldiv_by_pow2_', [2**i for i in range(63)]),
22 ('CheckDiv', 'ldiv_by_small_', [i for i in range(3, 16) if i not in (4, 8)]),
23 ('CheckRem', 'lrem_by_pow2_', [2**i for i in range(63)])])
39 for i, value in enumerate(values):
40 local_vars['@NAME@'] = name + str(i)
/art/test/445-checker-licm/src/
DMain.java30 for (int i = 0; i < 10; ++i) { in div()
47 for (int i = 0; i < 10; ++i) { in innerDiv()
63 for (int i = 0; i < 10; ++i) { in innerDiv2()
68 result += staticField * i; in innerDiv2()
104 for (int i = 0; i < array.length; ++i) { in arrayLength()
105 result += array[i]; in arrayLength()
/art/test/115-native-bridge/src/
DNativeBridgeMain.java99 for (int i = 0; i < returns.length; i++) { in testByteMethod()
100 byte result = byteMethod((byte)i, (byte)2, (byte)(-3), (byte)4, (byte)(-5), (byte)6, in testByteMethod()
102 if (returns[i] != result) { in testByteMethod()
103 System.out.println("Run " + i + " with " + returns[i] + " vs " + result); in testByteMethod()
114 for (int i = 0; i < returns.length; i++) { in testShortMethod()
115 short result = shortMethod((short)i, (short)2, (short)(-3), (short)4, (short)(-5), (short)6, in testShortMethod()
117 if (returns[i] != result) { in testShortMethod()
118 System.out.println("Run " + i + " with " + returns[i] + " vs " + result); in testShortMethod()
145 for (int i = 0; i < returns.length; i++) { in testCharMethod()
146 char result = charMethod((char)i, 'a', 'b', 'c', '0', '1', '2', (char)1234, (char)2345, in testCharMethod()
[all …]
/art/test/450-checker-types/src/
DMain.java133 for (int i = 0 ; i < x; i++) { in testForRemove()
148 for (int i = 0 ; i < x; i++) { in testForKeep()
161 public void testPhiFromCall(int i) { in testPhiFromCall() argument
163 if (i % 2 == 0) { in testPhiFromCall()
223 public void testInstanceOfWithPhi(int i) { in testInstanceOfWithPhi() argument
225 if (i == 0) { in testInstanceOfWithPhi()
243 for (int i = 0; i < n; i++) { in testInstanceOfInFor()
244 if (i / 2 == 0) { in testInstanceOfInFor()
270 public void testInstanceOfWithPhiSubclass(int i) { in testInstanceOfWithPhiSubclass() argument
272 if (i == 0) { in testInstanceOfWithPhiSubclass()
[all …]
/art/test/027-arithmetic/
Dexpected.txt1 f=1234.5677 --> i=1234
2 f=-1234.5677 --> i=-1234
3 d=1234.5678 --> i=1234
4 d=-1234.5678 --> i=-1234
7 i=7654 --> l=7654
8 i=-7654 --> l=-7654
9 l=5678956789 --> i=1383989493
10 l=-5678956789 --> i=-1383989493
11 i=1234 --> f=1234.0
12 i=-1234 --> f=-1234.0
[all …]

12345678910>>...18