| /art/runtime/ |
| 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 size_type count(const K& k) const { return map_.count(k); } in count() argument
84 V Get(const K& k) const { in Get() argument
85 const_iterator it = map_.find(k); in Get()
91 iterator Put(const K& k, const V& v) { in Put() argument
92 std::pair<iterator, bool> result = map_.emplace(k, v); in Put()
[all …]
|
| /art/test/534-checker-bce-deoptimization/src/ |
| D | Main.java | 33 int i,k; in foo1() local
36 k = n - (i + 1); in foo1()
37 b[k] /= a[k][k]; in foo1()
38 t = -b[k]; in foo1()
39 foo2(k + 1000, t, b); in foo1()
|
| /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/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/compiler/optimizing/ |
| D | induction_var_analysis_test.cc | 285 HPhi* k = InsertLoopPhi(0, 0); in TEST_F() local
286 k->AddInput(constant0_); in TEST_F()
289 new (&allocator_) HAdd(Primitive::kPrimInt, k, constant100_), 0); in TEST_F()
294 k->AddInput(sub); in TEST_F()
349 HPhi* k = BuildIf(0, &ifTrue, &ifFalse); in TEST_F() local
354 k->AddInput(inc1); in TEST_F()
358 k->AddInput(inc2); in TEST_F()
360 HInstruction* store = InsertArrayStore(k, 0); in TEST_F()
374 HPhi* k = InsertLoopPhi(0, 0); in TEST_F() local
375 k->AddInput(constant0_); in TEST_F()
[all …]
|
| D | intrinsics.h | 61 case Intrinsics::k ## Name: \ in Dispatch()
124 void Set##name() { SetBit(k##name); } \
125 bool Get##name() const { return IsBitSet(k##name); } \
127 static constexpr size_t k##name = bit
161 void Set##name() { SetBit(k##name); } \
162 bool Get##name() const { return IsBitSet(k##name); } \
164 static constexpr size_t k##name = bit + kNumberOfGenericOptimizations
|
| D | intrinsics.cc | 40 case Intrinsics::k ## Name: \ in GetIntrinsicInvokeType()
56 case Intrinsics::k ## Name: \ in NeedsEnvironmentOrCache()
72 case Intrinsics::k ## Name: \ in GetSideEffects()
88 case Intrinsics::k ## Name: \ in GetExceptions()
610 case Intrinsics::k ## Name: \ in operator <<()
|
| /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/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/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/runtime/gc/space/ |
| D | large_object_space_test.cc | 68 for (size_t k = 0; k < 10; ++k) { in LargeObjectTest() local
94 for (size_t k = 0; k < request_size; ++k) { in LargeObjectTest() local
95 ASSERT_EQ(reinterpret_cast<const uint8_t*>(obj)[k], magic); in LargeObjectTest()
|
| /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/compiler/driver/ |
| D | compiled_method_storage.cc | 101 uint32_t k = blocks[i]; in operator ()() local
102 k *= c1; in operator ()()
103 k = (k << r1) | (k >> (32 - r1)); in operator ()()
104 k *= c2; in operator ()()
106 hash ^= k; in operator ()()
|
| /art/test/118-noimage-dex2oat/src/ |
| D | Main.java | 72 Class<?> k = Class.forName("B18485243"); in testB18485243() local
73 Object o = k.newInstance(); in testB18485243()
74 Method m = k.getDeclaredMethod("run"); in testB18485243()
|
| /art/runtime/gc/accounting/ |
| D | space_bitmap_test.cc | 149 for (uintptr_t k = offset; k < end; k += kAlignment) { in RunTest() local
150 if (space_bitmap->Test(reinterpret_cast<mirror::Object*>(heap_begin + k))) { in RunTest()
|
| /art/runtime/mirror/ |
| D | class.cc | 575 for (size_t k = iftable_count; k != 0;) { in FindVirtualMethodForInterfaceSuper() local
576 k--; in FindVirtualMethodForInterfaceSuper()
577 DCHECK_LT(k, iftable->Count()); in FindVirtualMethodForInterfaceSuper()
578 iface.Assign(iftable->GetInterface(k)); in FindVirtualMethodForInterfaceSuper()
729 for (Class* k = klass.Get(); k != nullptr; k = k->GetSuperClass()) { in FindStaticField() local
731 ArtField* f = k->FindDeclaredStaticField(name, type); in FindStaticField()
737 HandleWrapper<mirror::Class> h_k(hs.NewHandleWrapper(&k)); in FindStaticField()
753 for (Class* k = klass.Get(); k != nullptr; k = k->GetSuperClass()) { in FindStaticField() local
755 ArtField* f = k->FindDeclaredStaticField(dex_cache, dex_field_idx); in FindStaticField()
761 HandleWrapper<mirror::Class> h_k(hs.NewHandleWrapper(&k)); in FindStaticField()
[all …]
|
| D | object_test.cc | 348 for (int k = 0; k < i; ++k) { in TEST_F() local
349 Array* outer = multi->AsObjectArray<Array>()->Get(k); in TEST_F()
|
| /art/profman/ |
| D | profile_assistant_test.cc | 75 for (size_t k = 0; k < profiles_fd.size(); k++) { in ProcessProfiles() local
76 argv_str.push_back("--profile-file-fd=" + std::to_string(profiles_fd[k])); in ProcessProfiles()
|
| /art/test/530-checker-lse/src/ |
| D | Main.java | 39 volatile int k; field in TestClass
47 int k; field in SubTestClass
456 obj.k = 1; in test18()
457 return obj.k; in test18()
|
| /art/test/449-checker-bce/src/ |
| D | Main.java | 42 for (int k = i + 1; k <= size; k += i) in sieve()
43 flags[k - 1] = false; // Can't eliminate yet due to (k+i) may overflow. in sieve()
|
| /art/test/800-smali/smali/ |
| D | sameFieldNames.smali | 34 .field static public k:J
|