| /art/runtime/ |
| D | safe_map.h | 72 size_type erase(const K& k) { return map_.erase(k); } in erase() argument
74 iterator find(const K& k) { return map_.find(k); } in find() argument
75 const_iterator find(const K& k) const { return map_.find(k); } in find() argument
77 iterator lower_bound(const K& k) { return map_.lower_bound(k); } in lower_bound() argument
78 const_iterator lower_bound(const K& k) const { return map_.lower_bound(k); } in lower_bound() argument
80 size_type count(const K& k) const { return map_.count(k); } in count() argument
83 V Get(const K& k) const { in Get() argument
84 const_iterator it = map_.find(k); in Get()
90 iterator Put(const K& k, const V& v) { in Put() argument
91 std::pair<iterator, bool> result = map_.emplace(k, v); in Put()
[all …]
|
| D | class_linker_test.cc | 307 mirror::Class* k = klass.Get(); in AssertClass() local
308 while (k != nullptr) { in AssertClass()
309 total_num_reference_instance_fields += k->NumReferenceInstanceFields(); in AssertClass()
310 k = k->GetSuperClass(); in AssertClass()
|
| D | class_linker.cc | 1510 mirror::Object* k = kMovingClasses ? in AllocClass() local
1513 if (UNLIKELY(k == nullptr)) { in AllocClass()
1517 return k->AsClass(); in AllocClass()
2975 for (mirror::Class* k : result) { in LookupClasses()
2976 class_table_.Insert(GcRoot<mirror::Class>(k)); in LookupClasses()
4740 for (size_t k = 0; k < idx; k++) { in LinkInterfaceMethods() local
4741 mirror::Class* existing_interface = iftable->GetInterface(k); in LinkInterfaceMethods()
4883 int32_t k; in LinkInterfaceMethods() local
4892 for (k = input_array_length - 1; k >= 0; --k) { in LinkInterfaceMethods()
4895 reinterpret_cast<uintptr_t>(input_virtual_methods) + method_size * k) : in LinkInterfaceMethods()
[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/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/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/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/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/test/118-noimage-dex2oat/src/ |
| D | Main.java | 75 Class<?> k = Class.forName("B18485243"); in testB18485243() local
76 Object o = k.newInstance(); in testB18485243()
77 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 | 626 for (Class* k = klass.Get(); k != nullptr; k = k->GetSuperClass()) { in FindStaticField() local
628 ArtField* f = k->FindDeclaredStaticField(name, type); in FindStaticField()
634 HandleWrapper<mirror::Class> h_k(hs.NewHandleWrapper(&k)); in FindStaticField()
650 for (Class* k = klass.Get(); k != nullptr; k = k->GetSuperClass()) { in FindStaticField() local
652 ArtField* f = k->FindDeclaredStaticField(dex_cache, dex_field_idx); in FindStaticField()
658 HandleWrapper<mirror::Class> h_k(hs.NewHandleWrapper(&k)); in FindStaticField()
675 for (Class* k = klass.Get(); k != nullptr; k = k->GetSuperClass()) { in FindField() local
677 ArtField* f = k->FindDeclaredInstanceField(name, type); in FindField()
681 f = k->FindDeclaredStaticField(name, type); in FindField()
687 HandleWrapper<mirror::Class> h_k(hs.NewHandleWrapper(&k)); in FindField()
|
| D | object_test.cc | 351 for (int k = 0; k < i; ++k) { in TEST_F() local
352 Array* outer = multi->AsObjectArray<Array>()->Get(k); in TEST_F()
|
| /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/compiler/driver/ |
| D | compiler_driver.h | 714 uint32_t k = blocks[i]; in operator() local
715 k *= c1; in operator()
716 k = (k << r1) | (k >> (32 - r1)); in operator()
717 k *= c2; in operator()
719 hash ^= k; in operator()
|
| /art/compiler/optimizing/ |
| D | intrinsics.h | 59 case Intrinsics::k ## Name: \ in Dispatch()
|
| D | intrinsics.cc | 35 case Intrinsics::k ## Name: \ in GetIntrinsicInvokeType()
365 case Intrinsics::k ## Name: \ in operator <<()
|
| D | nodes.h | 886 InstructionKind GetKind() const OVERRIDE { return k##type; } \
1308 #define DECLARE_KIND(type, super) k##type,
2367 #define OPTIMIZING_INTRINSICS(Name, IsStatic) k ## Name,
|
| D | nodes.cc | 892 #define DECLARE_CASE(type, super) case HInstruction::k##type: os << #type; break; in operator <<()
|
| /art/test/800-smali/smali/ |
| D | sameFieldNames.smali | 34 .field static public k:J
|
| /art/test/082-inline-execute/src/ |
| D | Main.java | 1012 for (int k = 0; k < 10; k++) {
1028 for (int k = 0; k < 10; k++) {
|
| /art/compiler/dex/quick/ |
| D | gen_common.cc | 1676 int k = CTZ(lit); in HandleEasyDivRem() local
1677 if (k >= 30) { in HandleEasyDivRem()
1687 OpRegRegImm(kOpLsr, t_reg, rl_src.reg, 32 - k); in HandleEasyDivRem()
1689 OpRegRegImm(kOpAsr, rl_result.reg, t_reg, k); in HandleEasyDivRem()
1692 OpRegRegImm(kOpLsr, t_reg, t_reg, 32 - k); in HandleEasyDivRem()
1694 OpRegRegImm(kOpAsr, rl_result.reg, t_reg, k); in HandleEasyDivRem()
1700 OpRegRegImm(kOpLsr, t_reg1, rl_src.reg, 32 - k); in HandleEasyDivRem()
1706 OpRegRegImm(kOpLsr, t_reg1, t_reg1, 32 - k); in HandleEasyDivRem()
|
| /art/compiler/dex/quick/arm64/ |
| D | int_arm64.cc | 551 int k = CTZ(lit); in HandleEasyDivRem64() local
552 if (k >= nbits - 2) { in HandleEasyDivRem64()
569 int shift = EncodeShift(kA64Lsr, nbits - k); in HandleEasyDivRem64()
574 OpRegRegImm(kOpAsr, rl_result.reg, t_reg, k); in HandleEasyDivRem64()
578 OpRegRegImm(kOpAsr, rl_result.reg, t_reg, k); in HandleEasyDivRem64()
|
| /art/oatdump/ |
| D | oatdump.cc | 1420 for (int32_t k = j + 1; k < image_root_object_array->GetLength(); k++) { in Dump() local
1421 if (value == image_root_object_array->Get(k)) { in Dump()
|