Searched defs:d1 (Results 1 - 4 of 4) sorted by relevance

/art/test/080-oom-throw/src/
H A DMain.java40 double d1, d2, d3, d4, d5, d6, d7, d8; // Bloat this object so we fill the heap faster. field in class:Main.InstanceMemEater
/art/compiler/optimizing/
H A Dinduction_var_analysis.cc149 const uint32_t d1 = ++global_depth_; local
150 map_.Put(instruction, NodeInfo(d1));
154 uint32_t low = d1;
160 if (low < d1) {
/art/test/700-LoadArgRegs/src/
H A DMain.java273 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 Dtracedump.cc2327 void createDiff(DataKeys* d1, DataKeys* d2) { argument
2328 MethodEntry** methods1 = parseMethodEntries(d1);
2332 qsort(methods1, d1->numMethods, sizeof(MethodEntry*), compareElapsedInclusive);
2333 for (int32_t i = 0; i < d1->numMethods; ++i) {
2342 int32_t max = (d1->numMethods < d2->numMethods) ? d2->numMethods : d1->numMethods;
2348 // printf("<br>d1->numMethods: %d d1->numMethods: %d<br>\n",
2349 // d1->numMethods, d2->numMethods);
2353 for (int32_t i = 0; i < d1
[all...]

Completed in 170 milliseconds