| /art/libartbase/base/ |
| D | safe_map.h | 73 size_type erase(const K& k) { return map_.erase(k); } in erase() argument
75 iterator find(const K& k) { return map_.find(k); } in find() argument
76 const_iterator find(const K& k) const { return map_.find(k); } in find() argument
78 iterator lower_bound(const K& k) { return map_.lower_bound(k); } in lower_bound() argument
79 const_iterator lower_bound(const K& k) const { return map_.lower_bound(k); } in lower_bound() argument
81 iterator upper_bound(const K& k) { return map_.upper_bound(k); } in upper_bound() argument
82 const_iterator upper_bound(const K& k) const { return map_.upper_bound(k); } in upper_bound() argument
84 size_type count(const K& k) const { return map_.count(k); } in count() argument
87 V Get(const K& k) const { in Get() argument
88 const_iterator it = map_.find(k); in Get()
[all …]
|
| D | data_hash.h | 63 uint32_t k = blocks[i]; in operator() local
64 k *= c1; in operator()
65 k = (k << r1) | (k >> (32 - r1)); in operator()
66 k *= c2; in operator()
68 hash ^= k; in operator()
|
| /art/test/552-checker-x86-avx2-bit-manipulation/src/ |
| D | Main.java | 51 long k = 2; in and_not_64() local
82 int k = 2; in and_not_32() local
127 int k = 10; in reset_lowest_set_bit_32() local
133 k +=j; in reset_lowest_set_bit_32()
134 k = k & k-1; in reset_lowest_set_bit_32()
135 l +=k; in reset_lowest_set_bit_32()
138 return y + j + k + l; in reset_lowest_set_bit_32()
166 long k = 10; in reset_lowest_set_bit_64() local
172 k +=j; in reset_lowest_set_bit_64()
173 k = k & k-1; in reset_lowest_set_bit_64()
[all …]
|
| /art/test/992-source-data/src/art/ |
| D | Test992.java | 41 public static String printClass(Class<?> k) { in printClass() argument
42 if (k != null && Proxy.class.isAssignableFrom(k)) { in printClass()
43 return String.format("Proxy of %s", Arrays.toString(k.getInterfaces())); in printClass()
45 return String.format("%s", k); in printClass()
48 public static void doTest(Class<?> k) { in doTest() argument
49 String pk = printClass(k); in doTest()
51 System.out.println(pk + " is defined in file \"" + getSourceFileName(k) + "\""); in doTest()
56 System.out.println(pk + " has extension \"" + getSourceDebugExtension(k) + "\""); in doTest()
62 public static native String getSourceFileName(Class<?> k) throws Exception; in getSourceFileName() argument
63 public static native String getSourceDebugExtension(Class<?> k) throws Exception; in getSourceDebugExtension() argument
|
| /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/661-checker-simd-reduc/src/ |
| D | Main.java | 384 for (int i = 0, k = -17; i < N; i++, k += 3) { in main()
385 xb[i] = (byte) k; in main()
386 xs[i] = (short) k; in main()
387 xc[i] = (char) k; in main()
388 xi[i] = k; in main()
389 xl[i] = k; in main()
398 for (int i = 0, k = 3; i < M; i++, k++) { in main()
399 xpb[i] = (byte) k; in main()
400 xps[i] = (short) k; in main()
401 xpc[i] = (char) k; in main()
[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/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/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/624-checker-stringops/src/ |
| D | Main.java | 41 int k = ABC.length() + XYZ.length(); // does LoadString before loops in liveIndexOf() local
43 k += ABC.indexOf(c); in liveIndexOf()
46 k += ABC.indexOf(c, 4); in liveIndexOf()
49 k += ABC.indexOf(XYZ); in liveIndexOf()
52 k += ABC.indexOf(XYZ, 2); in liveIndexOf()
54 return k; in liveIndexOf()
72 int k = ABC.length() + XYZ.length(); // does LoadString before loops in deadIndexOf() local
85 return k; in deadIndexOf()
95 int k = 0; in indexOfExceptions() local
97 k += s.indexOf(t); in indexOfExceptions()
[all …]
|
| /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/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/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/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/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/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/646-checker-hadd-alt-byte/src/ |
| D | Main.java | 209 int k = 0; in main() local
212 sB1[k] = (byte) i; in main()
213 sB2[k] = (byte) j; in main()
214 k++; in main()
218 sB1[k] = (byte) i; in main()
219 sB2[k] = 100; in main()
220 k++; in main()
222 expectEquals(k, M); in main()
|
| /art/test/646-checker-hadd-byte/src/ |
| D | Main.java | 206 int k = 0; in main() local
209 sB1[k] = (byte) i; in main()
210 sB2[k] = (byte) j; in main()
211 k++; in main()
215 sB1[k] = (byte) i; in main()
216 sB2[k] = 100; in main()
217 k++; in main()
219 expectEquals(k, M); in main()
|
| /art/test/660-checker-simd-sad-long/src/ |
| D | Main.java | 186 int k = 0; in main() local
189 x[k] = interesting[i]; in main()
190 y[k] = interesting[j]; in main()
191 k++; in main()
194 x[k] = 10; in main()
195 y[k] = 2; in main()
|
| /art/test/090-loop-formation/src/ |
| D | Main.java | 65 for (int k = 0; k < 2; k++) { in deeplyNested()
|
| /art/test/Interfaces/ |
| D | Interfaces.java | 27 public void k(); in k() method
37 public void k() {}; in k() method in Interfaces.B
|
| /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 …]
|
| /art/test/660-checker-simd-sad-int/src/ |
| D | Main.java | 214 int k = 0; in main() local
217 x[k] = interesting[i]; in main()
218 y[k] = interesting[j]; in main()
219 k++; in main()
222 x[k] = 10; in main()
223 y[k] = 2; in main()
|