/art/runtime/ |
D | safe_map.h | 74 size_type erase(const K& k) { return map_.erase(k); } in erase() argument 76 iterator find(const K& k) { return map_.find(k); } in find() argument 77 const_iterator find(const K& k) const { return map_.find(k); } in find() argument 79 iterator lower_bound(const K& k) { return map_.lower_bound(k); } in lower_bound() argument 80 const_iterator lower_bound(const K& k) const { return map_.lower_bound(k); } in lower_bound() argument 82 iterator upper_bound(const K& k) { return map_.upper_bound(k); } in upper_bound() argument 83 const_iterator upper_bound(const K& k) const { return map_.upper_bound(k); } in upper_bound() argument 85 size_type count(const K& k) const { return map_.count(k); } in count() argument 88 V Get(const K& k) const { in Get() argument 89 const_iterator it = map_.find(k); in Get() [all …]
|
D | class_loader_context.cc | 268 for (size_t k = opened_dex_files_index; k < info.opened_dex_files.size(); k++) { in OpenDexFiles() local 269 std::unique_ptr<const DexFile>& dex = info.opened_dex_files[k]; in OpenDexFiles() 338 for (size_t k = 0; k < info.opened_dex_files.size(); k++) { in EncodeContext() local 339 const std::unique_ptr<const DexFile>& dex_file = info.opened_dex_files[k]; in EncodeContext() 349 if (k > 0) { in EncodeContext() 707 for (size_t k = 0; k < info.classpath.size(); k++) { in VerifyClassLoaderContextMatch() local 712 bool is_dex_name_absolute = IsAbsoluteLocation(info.classpath[k]); in VerifyClassLoaderContextMatch() 713 bool is_expected_dex_name_absolute = IsAbsoluteLocation(expected_info.classpath[k]); in VerifyClassLoaderContextMatch() 720 dex_name = info.classpath[k]; in VerifyClassLoaderContextMatch() 721 expected_dex_name = expected_info.classpath[k]; in VerifyClassLoaderContextMatch() [all …]
|
/art/test/618-checker-induction/src/ |
D | Main.java | 83 for (int k = 0; k < 4; k++) { in deadNestedAndFollowingLoops() 85 for (int k = 0; k < 4; k++) { in deadNestedAndFollowingLoops() 89 for (int k = 0; k < 4; k++) { in deadNestedAndFollowingLoops() 103 int k = 0; in deadConditional() local 107 k = i; in deadConditional() 123 int k = 0; in deadConditionalCycle() local 127 k--; in deadConditionalCycle() 211 static void deadCycleWithException(int k) { in deadCycleWithException() argument 218 dead += a[k]; in deadCycleWithException() 423 int k = 0; in periodicReturned9() local [all …]
|
/art/test/624-checker-stringops/src/ |
D | Main.java | 40 int k = ABC.length() + XYZ.length(); // does LoadString before loops in liveIndexOf() local 42 k += ABC.indexOf(c); in liveIndexOf() 45 k += ABC.indexOf(c, 4); in liveIndexOf() 48 k += ABC.indexOf(XYZ); in liveIndexOf() 51 k += ABC.indexOf(XYZ, 2); in liveIndexOf() 53 return k; in liveIndexOf() 71 int k = ABC.length() + XYZ.length(); // does LoadString before loops in deadIndexOf() local 84 return k; in deadIndexOf() 94 int k = 0; in indexOfExceptions() local 96 k += s.indexOf(t); in indexOfExceptions() [all …]
|
/art/test/303-verification-stress/ |
D | classes-gen.c | 15 int k; in createFiles() local 30 for (k = 0; k < array_size; k++) { in createFiles() 31 fprintf(fp, " array[%d] = \"string_%04d\";\n", k, k); in createFiles()
|
/art/test/992-source-data/src/art/ |
D | Test992.java | 38 public static void doTest(Class<?> k) { in doTest() argument 40 System.out.println(k + " is defined in file \"" + getSourceFileName(k) + "\""); in doTest() 42 System.out.println(k + " does not have a known source file because " + e); in doTest() 46 public static native String getSourceFileName(Class<?> k) throws Exception; in getSourceFileName() argument
|
/art/test/530-checker-loops2/src/ |
D | Main.java | 56 int k = 0; in periodicIdiom() local 59 result += x[k]; in periodicIdiom() 60 k = 1 - k; in periodicIdiom() 74 int k = 0; in periodicSequence2() local 78 result += x[k]; in periodicSequence2() 80 l = k; in periodicSequence2() 81 k = t; in periodicSequence2() 98 int k = 0; in periodicSequence4() local 104 result += x[k] + x[l] + x[m] + x[n]; // all used at once in periodicSequence4() 106 n = k; in periodicSequence4() [all …]
|
/art/test/534-checker-bce-deoptimization/src/ |
D | Main.java | 35 int i,k; in foo1() local 38 k = n - (i + 1); in foo1() 39 b[k] /= a[k][k]; in foo1() 40 t = -b[k]; in foo1() 41 foo2(k + 1000, t, b); in foo1()
|
/art/test/562-bce-preheader/src/ |
D | Main.java | 84 for (int k = 0; k < 10; ++k) { in doit() 85 a += z[k]; in doit() 98 int i = 0, i2 = 0, i3 = 0, k = 0; in hoistcheck() local 105 k += c[i3]; in hoistcheck() 109 return k; in hoistcheck()
|
/art/test/627-checker-unroll/src/ |
D | Main.java | 93 for (int k = 6; k < 7; k++) { in unrollNest() 94 sA = k; in unrollNest()
|
/art/test/405-optimizing-long-allocator/src/ |
D | Main.java | 139 long k = 42 + g - a; in $opt$TestAgressiveLive1() local 142 while (k != 1) { in $opt$TestAgressiveLive1() 143 --k; in $opt$TestAgressiveLive1() 150 k = 9; in $opt$TestAgressiveLive1() 153 return a - b - c - d - e - f - g - h - i - j - k; in $opt$TestAgressiveLive1() 160 long k = 42 + g - a; in $opt$TestAgressiveLive2() local 164 return a - b - c - d - e - f - g - h - i - j - k; in $opt$TestAgressiveLive2()
|
/art/test/440-stmp/src/ |
D | Main.java | 24 baz(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o); in bar() 28 float h, float i, float j, float k, float l, float m, float n, float o) { in baz() argument 29 System.out.println(a - b - c - d - e - f - g - h - i - j - k - l - m - n - o); in baz() 42 float k = 11.0f; field in Main
|
/art/test/404-optimizing-allocator/src/ |
D | Main.java | 133 int k = 42 + g - a; in $opt$reg$TestAgressiveLive1() local 136 while (k != 1) { in $opt$reg$TestAgressiveLive1() 137 --k; in $opt$reg$TestAgressiveLive1() 144 k = 9; in $opt$reg$TestAgressiveLive1() 147 return a - b - c - d - e - f - g - h - i - j - k; in $opt$reg$TestAgressiveLive1() 154 int k = 42 + g - a; in $opt$reg$TestAgressiveLive2() local 158 return a - b - c - d - e - f - g - h - i - j - k; in $opt$reg$TestAgressiveLive2()
|
/art/test/578-bce-visit/src/ |
D | Main.java | 48 int k = 1; in main() local 52 mA[i0][i1][i2] = k++; in main() 54 k = doit(); in main() 58 System.out.println("FUZZ result = " + k + " " + mX); in main()
|
/art/test/656-loop-deopt/src/ |
D | Main.java | 87 int k = 0; in $noinline$loopIncrement() local 92 for (int i = 0; i < 5000; i++, k++) { in $noinline$loopIncrement() 96 myIntStatic = k; in $noinline$loopIncrement() 99 if (k != 5000) { in $noinline$loopIncrement() 100 throw new Error("Expected 5000, got " + k); in $noinline$loopIncrement()
|
/art/test/646-checker-hadd-byte/src/ |
D | Main.java | 269 int k = 0; in main() local 272 sB1[k] = (byte) i; in main() 273 sB2[k] = (byte) j; in main() 274 k++; in main() 278 sB1[k] = (byte) i; in main() 279 sB2[k] = 100; in main() 280 k++; in main() 282 expectEquals(k, M); in main()
|
/art/test/646-checker-hadd-alt-byte/src/ |
D | Main.java | 272 int k = 0; in main() local 275 sB1[k] = (byte) i; in main() 276 sB2[k] = (byte) j; in main() 277 k++; in main() 281 sB1[k] = (byte) i; in main() 282 sB2[k] = 100; in main() 283 k++; in main() 285 expectEquals(k, M); in main()
|
/art/test/651-checker-int-simd-minmax/src/ |
D | Main.java | 104 int k = 0; in main() local 107 x[k] = 0; in main() 108 y[k] = interesting[i]; in main() 109 z[k] = interesting[j]; in main() 110 k++; in main()
|
/art/test/651-checker-char-simd-minmax/src/ |
D | Main.java | 106 int k = 0; in main() local 109 x[k] = 0; in main() 110 y[k] = interesting[i]; in main() 111 z[k] = interesting[j]; in main() 112 k++; in main()
|
/art/test/651-checker-long-simd-minmax/src/ |
D | Main.java | 93 int k = 0; in main() local 96 x[k] = 0; in main() 97 y[k] = interesting[i]; in main() 98 z[k] = interesting[j]; in main() 99 k++; in main()
|
/art/test/530-checker-loops5/src/ |
D | Main.java | 69 int k = 3 * i + 5; in poly2() local 70 a += k; in poly2() 134 int k = 2 * i + 1; in polyBCE2() local 136 a += k; in polyBCE2()
|
/art/test/651-checker-double-simd-minmax/src/ |
D | Main.java | 92 int k = 0; in main() local 95 x[k] = 0; in main() 96 y[k] = interesting[i]; in main() 97 z[k] = interesting[j]; in main() 98 k++; in main()
|
/art/test/651-checker-float-simd-minmax/src/ |
D | Main.java | 92 int k = 0; in main() local 95 x[k] = 0; in main() 96 y[k] = interesting[i]; in main() 97 z[k] = interesting[j]; in main() 98 k++; in main()
|
/art/test/623-checker-loop-regressions/src/ |
D | Main.java | 30 int k = 0; in earlyExitFirst() local 33 return k; in earlyExitFirst() 35 k++; in earlyExitFirst() 37 return k; in earlyExitFirst() 48 int k = 0; in earlyExitLast() local 50 k++; in earlyExitLast() 52 return k; in earlyExitLast() 55 return k; in earlyExitLast() 367 for (int k = 0; k < n; k++) { in arrayInTripCount()
|
/art/test/530-checker-loops1/src/ |
D | Main.java | 65 int k = i + 5; in linearObscure() local 66 result += x[k - 5]; in linearObscure() 80 int k = (-i) + (i << 5) + i - (32 * i) + 5 + (int) i; in linearVeryObscure() local 81 result += x[k - 5]; in linearVeryObscure() 300 int k = 0; in linearWithLargePositiveStride() local 304 result += x[k++]; in linearWithLargePositiveStride() 320 int k = 0; in linearWithVeryLargePositiveStride() local 324 result += x[k++]; in linearWithVeryLargePositiveStride() 338 int k = 0; in linearWithLargeNegativeStride() local 342 result += x[k++]; in linearWithLargeNegativeStride() [all …]
|