| /art/test/080-oom-throw/src/ |
| H A D | Main.java | 40 double d1, d2, d3, d4, d5, d6, d7, d8; // Bloat this object so we fill the heap faster. field in class:Main.InstanceMemEater
|
| /art/test/534-checker-bce-deoptimization/src/ |
| H A D | Main.java | 120 public static void $noinline$DoubleFill(double d1, double d2, double[] array, int n) { argument
123 array[i] = ((i & 1) == 1) ? d1 : d2;
124 d1 += 1.5;
|
| /art/test/952-invoke-custom/src/ |
| H A D | TestBase.java | 68 static void assertEquals(double d1, double d2) { argument
69 if (d1 == d2) {
72 throw new AssertionError("assertEquals d1: " + d1 + ", d2: " + d2);
|
| /art/compiler/utils/mips64/ |
| H A D | assembler_mips64_test.cc | 2651 unsigned d0, d1, d2, d3; local
2665 for (d1 = 0; d1 < sizeof imms / sizeof imms[0]; d1++) {
2666 u.v16[1] = imms[d1];
|
| /art/compiler/optimizing/ |
| H A D | induction_var_analysis.cc | 294 const uint32_t d1 = ++global_depth_; local
295 map_.Put(instruction, NodeInfo(d1));
299 uint32_t low = d1;
305 if (low < d1) {
|
| /art/profman/ |
| H A D | profile_assistant_test.cc | 1168 const DexFile& d1 = *dex_files[0]; local
1173 SetupProfile(d1.GetLocation(), d1.GetLocationChecksum(), "p1", 1,
1183 SetupProfile(d1.GetLocation(), d1.GetLocationChecksum(), "p1", 1,
1219 [&d1, &d2](const std::string& dex_location, uint32_t checksum) -> bool {
1220 return (dex_location == ProfileCompilationInfo::GetProfileDexFileKey(d1.GetLocation())
1221 && checksum == d1.GetLocationChecksum())
1247 const DexFile& d1 = *dex_files[0]; local
1251 uint16_t num_methods_to_add = std::min(d1
[all...] |
| /art/test/700-LoadArgRegs/src/ |
| H A D | Main.java | 273 static void testMore(int i1, double d1, double d2, double d3, double d4, double d5, double d6, double d7, double d8, double d9, int i2, int i3, int i4, int i5, int i6) { argument
274 System.out.println(i1+", "+d1+", "+d2+", "+d3+", "+d4+", "+d5+", "+d6+", "+d7+", "+d8+", "+d9+", "+i2+", "+i3+", "+i4+", "+i5+", "+i6);
|
| /art/tools/dmtracedump/ |
| H A D | tracedump.cc | 2331 void createDiff(DataKeys* d1, DataKeys* d2) { argument
2332 MethodEntry** methods1 = parseMethodEntries(d1);
2336 qsort(methods1, d1->numMethods, sizeof(MethodEntry*), compareElapsedInclusive);
2337 for (int32_t i = 0; i < d1->numMethods; ++i) {
2346 int32_t max = (d1->numMethods < d2->numMethods) ? d2->numMethods : d1->numMethods;
2352 // printf("<br>d1->numMethods: %d d1->numMethods: %d<br>\n",
2353 // d1->numMethods, d2->numMethods);
2357 for (int32_t i = 0; i < d1
[all...] |