Searched refs:values (Results 1 - 9 of 9) sorted by relevance

/art/test/701-easy-div-rem/
H A DgenMain.py37 for checker, name, values in tests:
39 for i, value in enumerate(values):
/art/compiler/dex/
H A Dlocal_value_numbering.cc207 AliasingValues* values) {
208 if (values->last_load_memory_version == kNoValue) {
211 uint16_t memory_version = values->memory_version_before_stores;
215 if (!values->store_loc_set.empty()) {
216 uint16_t ref_set_id = gvn_->GetRefSetId(values->store_loc_set);
218 values->last_stored_value);
220 values->last_load_memory_version = memory_version;
255 AliasingValues* values = GetAliasingValues(map, key); local
256 if (values->store_loc_set.count(location) != 0u) {
257 res = values
206 UpdateAliasingValuesLoadVersion(const KeyType& key, AliasingValues* values) argument
274 AliasingValues* values = GetAliasingValues(map, key); local
589 IntersectAliasingValueLocations(AliasingValues* work_values, const AliasingValues* values) argument
1406 AliasingValues* values = GetAliasingValues(&non_aliasing_array_value_map_, array); local
[all...]
H A Dlocal_value_numbering.h31 // Enable/disable tracking values stored in the FILLED_NEW_ARRAY result.
220 // Known location values for an aliasing set. The set can be tied to one of:
225 // where it was stored. We also keep track of all values known for the current write state
242 // Maps refs (other than stored_to) to currently known values for this field other. On write,
275 void UpdateAliasingValuesLoadVersion(const KeyType& key, AliasingValues* values);
337 void IntersectAliasingValueLocations(AliasingValues* work_values, const AliasingValues* values);
388 // Map to identify when different locations merge the same values.
/art/runtime/hprof/
H A Dhprof.cc269 int AddU1List(const uint8_t* values, size_t numValues) { argument
275 memcpy(body_ + length_, values, numValues);
280 int AddU2List(const uint16_t* values, size_t numValues) { argument
288 U2_TO_BUF_BE(insert, 0, *values++);
289 insert += sizeof(*values);
295 int AddU4List(const uint32_t* values, size_t numValues) { argument
303 U4_TO_BUF_BE(insert, 0, *values++);
304 insert += sizeof(*values);
314 int AddU8List(const uint64_t* values, size_t numValues) { argument
322 U8_TO_BUF_BE(insert, 0, *values
[all...]
/art/test/004-ThreadStress/src/
H A DMain.java59 // the Operation.frequency values. We fill out an Operation[]
71 for (Operation op : Operation.values()) {
87 for (Operation op : Operation.values()) {
118 for (Operation op : Operation.values()) {
/art/runtime/arch/
H A Dstub_test.cc1314 uint32_t values[num_values] = { 0, 1, 2, 255, 32768, 1000000, 0xFFFFFFFF };
1318 static_cast<size_t>(values[i]),
1330 EXPECT_EQ(res, values[i]) << "Iteration " << i;
1345 uint32_t values[num_values] = { 0, 1, 2, 255, 32768, 1000000, 0xFFFFFFFF };
1350 static_cast<size_t>(values[i]),
1356 EXPECT_EQ(res, static_cast<int32_t>(values[i])) << "Iteration " << i;
1469 uint64_t values[num_values] = { 0, 1, 2, 255, 32768, 1000000, 0xFFFFFFFF, 0xFFFFFFFFFFFF };
1473 values[i],
1484 EXPECT_EQ(res, values[i]) << "Iteration " << i;
1499 uint64_t values[num_value
[all...]
/art/test/005-annotations/src/android/test/anno/
H A DTestAnnotations.java22 for (Annotation a : sorted.values()) {
/art/runtime/arch/mips/
H A Dquick_entrypoints_mips.S1082 addiu $sp, $sp, -48 # save return values and set up args
1099 lw $v0, 32($sp) # restore return values
/art/test/083-compiler-regressions/src/
H A DMain.java990 int v1 = B16177324Values.values[0]; // Null-check on array element access.
991 int v2 = B16177324ValuesKiller.values[0]; // clinit<>() sets B16177324Values.values to null.
992 int v3 = B16177324Values.values[0]; // Should throw NPE.
994 System.out.println("Unexpectedly retrieved all values: " + v1 + ", " + v2 + ", " + v3);
9859 public static int values[] = { 42 }; field in class:B16177324Values
9863 public static int values[] = { 1234 }; field in class:B16177324ValuesKiller
9865 B16177324Values.values = null;

Completed in 243 milliseconds