| /art/runtime/jit/ |
| D | debugger_interface.cc | 82 JITCodeEntry* entry = new JITCodeEntry; in CreateJITCodeEntryInternal() local
83 CHECK(entry != nullptr); in CreateJITCodeEntryInternal()
84 entry->symfile_addr_ = symfile_copy; in CreateJITCodeEntryInternal()
85 entry->symfile_size_ = symfile.size(); in CreateJITCodeEntryInternal()
86 entry->prev_ = nullptr; in CreateJITCodeEntryInternal()
88 entry->next_ = __jit_debug_descriptor.first_entry_; in CreateJITCodeEntryInternal()
89 if (entry->next_ != nullptr) { in CreateJITCodeEntryInternal()
90 entry->next_->prev_ = entry; in CreateJITCodeEntryInternal()
92 __jit_debug_descriptor.first_entry_ = entry; in CreateJITCodeEntryInternal()
93 __jit_debug_descriptor.relevant_entry_ = entry; in CreateJITCodeEntryInternal()
[all …]
|
| /art/runtime/jdwp/ |
| D | object_registry.cc | 98 ObjectRegistryEntry* entry = nullptr; in InternalAdd() local
99 if (ContainsLocked(soa.Self(), obj_h.Get(), identity_hash_code, &entry)) { in InternalAdd()
101 ++entry->reference_count; in InternalAdd()
103 entry = new ObjectRegistryEntry; in InternalAdd()
104 entry->jni_reference_type = JNIWeakGlobalRefType; in InternalAdd()
105 entry->jni_reference = nullptr; in InternalAdd()
106 entry->reference_count = 0; in InternalAdd()
107 entry->id = 0; in InternalAdd()
108 entry->identity_hash_code = identity_hash_code; in InternalAdd()
109 object_to_entry_.insert(std::make_pair(identity_hash_code, entry)); in InternalAdd()
[all …]
|
| /art/runtime/arch/x86/ |
| D | thread_x86.cc | 62 descriptor_table_entry_t entry; in InitCpu() local
63 memset(&entry, 0, sizeof(entry)); in InitCpu()
64 entry.limit0 = (limit & 0x0ffff); in InitCpu()
65 entry.limit = (limit & 0xf0000) >> 16; in InitCpu()
66 entry.base0 = (base & 0x0000ffff); in InitCpu()
67 entry.base1 = (base & 0x00ff0000) >> 16; in InitCpu()
68 entry.base2 = (base & 0xff000000) >> 24; in InitCpu()
69 entry.type = ((read_exec_only ^ 1) << 1) | (contents << 2); in InitCpu()
70 entry.s = 1; in InitCpu()
71 entry.dpl = 0x3; in InitCpu()
[all …]
|
| /art/compiler/optimizing/ |
| D | nodes_test.cc | 34 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); in TEST() local
35 graph->AddBlock(entry); in TEST()
36 graph->SetEntryBlock(entry); in TEST()
39 entry->AddInstruction(parameter); in TEST()
40 entry->AddInstruction(new (&allocator) HGoto()); in TEST()
44 entry->AddSuccessor(first_block); in TEST()
77 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); in TEST() local
78 graph->AddBlock(entry); in TEST()
79 graph->SetEntryBlock(entry); in TEST()
84 entry->AddInstruction(parameter1); in TEST()
[all …]
|
| D | load_store_analysis_test.cc | 37 HBasicBlock* entry = new (&allocator_) HBasicBlock(graph_); in TEST_F() local
38 graph_->AddBlock(entry); in TEST_F()
39 graph_->SetEntryBlock(entry); in TEST_F()
62 entry->AddInstruction(array); in TEST_F()
63 entry->AddInstruction(index); in TEST_F()
64 entry->AddInstruction(array_get1); in TEST_F()
65 entry->AddInstruction(array_get2); in TEST_F()
66 entry->AddInstruction(array_set1); in TEST_F()
67 entry->AddInstruction(array_set2); in TEST_F()
77 heap_location_collector.VisitBasicBlock(entry); in TEST_F()
[all …]
|
| D | stack_map_stream.cc | 87 DexRegisterMapEntry* const entry = in_inline_frame_ in AddDexRegisterEntry() local
90 DCHECK_LT(current_dex_register_, entry->num_dex_registers); in AddDexRegisterEntry()
91 entry->live_dex_registers_mask->SetBit(current_dex_register_); in AddDexRegisterEntry()
92 entry->hash += (1 << in AddDexRegisterEntry()
94 entry->hash += static_cast<uint32_t>(value); in AddDexRegisterEntry()
95 entry->hash += static_cast<uint32_t>(kind); in AddDexRegisterEntry()
142 for (const StackMapEntry& entry : stack_maps_) { in ComputeMaxNativePcCodeOffset() local
143 max_native_pc_offset = std::max(max_native_pc_offset, entry.native_pc_code_offset); in ComputeMaxNativePcCodeOffset()
216 for (const DexRegisterMapEntry& entry : dex_register_entries_) { in ComputeDexRegisterMapsSize() local
217 size += entry.ComputeSize(location_catalog_entries_.size()); in ComputeDexRegisterMapsSize()
[all …]
|
| D | gvn_test.cc | 33 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); in TEST_F() local
34 graph->AddBlock(entry); in TEST_F()
35 graph->SetEntryBlock(entry); in TEST_F()
40 entry->AddInstruction(parameter); in TEST_F()
44 entry->AddSuccessor(block); in TEST_F()
117 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); in TEST_F() local
118 graph->AddBlock(entry); in TEST_F()
119 graph->SetEntryBlock(entry); in TEST_F()
124 entry->AddInstruction(parameter); in TEST_F()
128 entry->AddSuccessor(block); in TEST_F()
[all …]
|
| D | bounds_check_elimination_test.cc | 69 HBasicBlock* entry = new (&allocator_) HBasicBlock(graph_); in TEST_F() local
70 graph_->AddBlock(entry); in TEST_F()
71 graph_->SetEntryBlock(entry); in TEST_F()
76 entry->AddInstruction(parameter1); in TEST_F()
77 entry->AddInstruction(parameter2); in TEST_F()
88 entry->AddSuccessor(block1); in TEST_F()
166 HBasicBlock* entry = new (&allocator_) HBasicBlock(graph_); in TEST_F() local
167 graph_->AddBlock(entry); in TEST_F()
168 graph_->SetEntryBlock(entry); in TEST_F()
173 entry->AddInstruction(parameter1); in TEST_F()
[all …]
|
| D | register_allocator_test.cc | 494 HBasicBlock* entry = new (allocator) HBasicBlock(graph); in BuildIfElseWithPhi() local
495 graph->AddBlock(entry); in BuildIfElseWithPhi()
496 graph->SetEntryBlock(entry); in BuildIfElseWithPhi()
499 entry->AddInstruction(parameter); in BuildIfElseWithPhi()
503 entry->AddSuccessor(block); in BuildIfElseWithPhi()
656 HBasicBlock* entry = new (allocator) HBasicBlock(graph); in BuildFieldReturn() local
657 graph->AddBlock(entry); in BuildFieldReturn()
658 graph->SetEntryBlock(entry); in BuildFieldReturn()
661 entry->AddInstruction(parameter); in BuildFieldReturn()
665 entry->AddSuccessor(block); in BuildFieldReturn()
[all …]
|
| D | scheduler_test.cc | 81 HBasicBlock* entry = new (&allocator_) HBasicBlock(graph_); in TestBuildDependencyGraphAndSchedule() local
83 graph_->AddBlock(entry); in TestBuildDependencyGraphAndSchedule()
85 graph_->SetEntryBlock(entry); in TestBuildDependencyGraphAndSchedule()
120 entry->AddInstruction(array); in TestBuildDependencyGraphAndSchedule()
198 HBasicBlock* entry = new (&allocator_) HBasicBlock(graph_); in TestDependencyGraphOnAliasingArrayAccesses() local
199 graph_->AddBlock(entry); in TestDependencyGraphOnAliasingArrayAccesses()
200 graph_->SetEntryBlock(entry); in TestDependencyGraphOnAliasingArrayAccesses()
263 entry->AddInstruction(instr); in TestDependencyGraphOnAliasingArrayAccesses()
268 heap_location_collector.VisitBasicBlock(entry); in TestDependencyGraphOnAliasingArrayAccesses()
|
| /art/compiler/utils/ |
| D | test_dex_file_builder.h | 103 for (auto& entry : strings_) { in Build()
104 entry.second.idx = string_idx; in Build()
106 entry.second.data_offset = data_section_size; in Build()
107 data_section_size += entry.first.length() + 1u /* length */ + 1u /* null-terminator */; in Build()
114 for (auto& entry : types_) { in Build()
115 entry.second = type_idx; in Build()
123 for (auto& entry : protos_) { in Build()
124 entry.second.idx = proto_idx; in Build()
126 size_t num_args = entry.first.args.size(); in Build()
128 entry.second.data_offset = RoundUp(data_section_size, 4u); in Build()
[all …]
|
| D | swap_space.cc | 39 for (const auto& entry : free_by_size) { in DumpFreeMap() local
40 if (last_size != entry.size) { in DumpFreeMap()
41 last_size = entry.size; in DumpFreeMap()
44 LOG(INFO) << " 0x" << std::hex << entry.free_by_start_entry->Start() in DumpFreeMap()
45 << " size=" << std::dec << entry.free_by_start_entry->size; in DumpFreeMap()
92 for (const auto& entry : free_by_size) { in CollectFree() local
93 sum1 += entry.free_by_start_entry->size; in CollectFree()
98 for (const auto& entry : free_by_start) { in CollectFree() local
99 sum2 += entry.size; in CollectFree()
118 auto entry = it->free_by_start_entry; in Alloc() local
[all …]
|
| /art/runtime/ |
| D | type_lookup_table.cc | 85 Entry entry; in TypeLookupTable() local
86 entry.str_offset = str_id.string_data_off_; in TypeLookupTable()
87 entry.data = MakeData(i, hash, GetSizeMask()); in TypeLookupTable()
88 if (!SetOnInitialPos(entry, hash)) { in TypeLookupTable()
99 Entry entry; in TypeLookupTable() local
100 entry.str_offset = str_id.string_data_off_; in TypeLookupTable()
101 entry.data = MakeData(class_def_idx, hash, GetSizeMask()); in TypeLookupTable()
102 Insert(entry, hash); in TypeLookupTable()
115 bool TypeLookupTable::SetOnInitialPos(const Entry& entry, uint32_t hash) { in SetOnInitialPos() argument
120 entries_[pos] = entry; in SetOnInitialPos()
[all …]
|
| D | type_lookup_table.h | 48 const Entry* entry = &entries_[pos]; in Lookup() local
49 while (!entry->IsEmpty()) { in Lookup()
50 if (CmpHashBits(entry->data, hash) && IsStringsEquals(str, entry->str_offset)) { in Lookup()
51 return GetClassDefIdx(entry->data); in Lookup()
53 if (entry->IsLast()) { in Lookup()
56 pos = (pos + entry->next_pos_delta) & GetSizeMask(); in Lookup()
57 entry = &entries_[pos]; in Lookup()
153 bool SetOnInitialPos(const Entry& entry, uint32_t hash);
156 void Insert(const Entry& entry, uint32_t hash);
|
| /art/compiler/ |
| D | verifier_deps_test.cc | 258 for (dex::TypeIndex entry : dex_dep.second->unverified_classes_) { in HasUnverifiedClass() local
259 if (index == entry) { in HasUnverifiedClass()
276 for (auto& entry : storage) { in HasAssignable() local
278 verifier_deps_->GetStringFromId(dex_file, entry.GetDestination()); in HasAssignable()
279 std::string actual_source = verifier_deps_->GetStringFromId(dex_file, entry.GetSource()); in HasAssignable()
294 for (auto& entry : dex_dep.second->classes_) { in HasClass() local
295 if (expected_resolved != entry.IsResolved()) { in HasClass()
299 std::string actual_klass = dex_dep.first->StringByTypeIdx(entry.GetDexTypeIndex()); in HasClass()
307 std::string actual_access_flags = PrettyJavaAccessFlags(entry.GetAccessFlags()); in HasClass()
328 for (auto& entry : dex_dep.second->fields_) { in HasField() local
[all …]
|
| /art/runtime/verifier/ |
| D | reg_type_cache.cc | 38 ALWAYS_INLINE static inline bool MatchingPrecisionForClass(const RegType* entry, bool precise) in MatchingPrecisionForClass() argument
40 if (entry->IsPreciseReference() == precise) { in MatchingPrecisionForClass()
44 if (!precise && entry->GetClass()->CannotBeAssignedFromOtherTypes()) { in MatchingPrecisionForClass()
133 const RegType* entry = entries_[idx]; in MatchDescriptor() local
134 if (descriptor != entry->descriptor_) { in MatchDescriptor()
137 if (entry->HasClass()) { in MatchDescriptor()
138 return MatchingPrecisionForClass(entry, precise); in MatchDescriptor()
142 DCHECK(entry->IsUnresolvedReference()); in MatchDescriptor()
195 RegType* entry; in From() local
200 entry = new (&arena_) PreciseReferenceType(klass, AddString(sp_descriptor), entries_.size()); in From()
[all …]
|
| D | verifier_deps.cc | 628 for (const T& entry : set) { in EncodeSet() local
629 EncodeTuple(out, entry); in EncodeSet()
637 for (const T& entry : vector) { in EncodeUint16Vector() local
638 EncodeUnsignedLeb128(out, Encode(entry)); in EncodeUint16Vector()
781 for (const TypeAssignability& entry : dep.second->assignable_types_) { in Dump() local
783 << GetStringFromId(dex_file, entry.GetSource()) in Dump()
785 << GetStringFromId(dex_file, entry.GetDestination()) in Dump()
789 for (const TypeAssignability& entry : dep.second->unassignable_types_) { in Dump() local
791 << GetStringFromId(dex_file, entry.GetSource()) in Dump()
793 << GetStringFromId(dex_file, entry.GetDestination()) in Dump()
[all …]
|
| /art/imgdiag/ |
| D | imgdiag.cc | 203 template <typename T> size_t EntrySize(T* entry);
239 T* entry = dirty_entries_[i]; in DumpSamplesAndOffsetCount() local
240 os_ << reinterpret_cast<void*>(entry) << ", "; in DumpSamplesAndOffsetCount()
261 bool IsEntryOnDirtyPage(T* entry, const std::set<size_t>& dirty_pages) const in IsEntryOnDirtyPage()
263 size_t size = EntrySize(entry); in IsEntryOnDirtyPage()
266 uintptr_t entry_address = reinterpret_cast<uintptr_t>(entry); in IsEntryOnDirtyPage()
279 void AddZygoteDirtyEntry(T* entry) REQUIRES_SHARED(Locks::mutator_lock_) { in AddZygoteDirtyEntry()
280 zygote_dirty_entries_.insert(entry); in AddZygoteDirtyEntry()
283 void AddImageDirtyEntry(T* entry) REQUIRES_SHARED(Locks::mutator_lock_) { in AddImageDirtyEntry()
284 image_dirty_entries_.insert(entry); in AddImageDirtyEntry()
[all …]
|
| /art/tools/checker/file_format/c1visualizer/ |
| D | struct.py | 28 for entry in self.passes:
29 if entry.name == name:
30 return entry
|
| /art/tools/ahat/src/ |
| D | Query.java | 94 for (Map.Entry<String, String> entry : params.entrySet()) { in with()
96 newQuery.append(entry.getKey()); in with()
98 newQuery.append(entry.getValue()); in with()
|
| /art/test/063-process-manager/src/ |
| D | Main.java | 29 for (Map.Entry<Thread, StackTraceElement[]> entry : in checkManager()
31 Thread t = entry.getKey(); in checkManager()
|
| /art/test/543-checker-dce-trycatch/smali/ |
| D | TestCase.smali | 33 ## CHECK: TryBoundary kind:entry
34 ## CHECK: TryBoundary kind:entry
35 ## CHECK-NOT: TryBoundary kind:entry
41 ## CHECK: TryBoundary kind:entry
42 ## CHECK-NOT: TryBoundary kind:entry
121 ## CHECK: TryBoundary kind:entry
122 ## CHECK: TryBoundary kind:entry
123 ## CHECK-NOT: TryBoundary kind:entry
131 ## CHECK: TryBoundary kind:entry
132 ## CHECK-NOT: TryBoundary kind:entry
[all …]
|
| /art/test/098-ddmc/ |
| D | expected.txt | 2 empty=Allocations[message header len: 15 entry header len: 9 stack frame len: 8 number of entries: …
14 reset=Allocations[message header len: 15 entry header len: 9 stack frame len: 8 number of entries: …
23 goodbye=Allocations[message header len: 15 entry header len: 9 stack frame len: 8 number of entries…
|
| /art/test/559-checker-irreducible-loop/smali/ |
| D | IrreducibleLoop.smali | 23 # entry
51 # entry
96 # entry
131 # entry
165 # "const-class 1" in entry.
167 # entry
208 # entry
237 # entry
266 # entry
312 # entry
[all …]
|
| /art/test/523-checker-can-throw-regression/smali/ |
| D | Test.smali | 21 ## CHECK: TryBoundary kind:entry
22 ## CHECK: TryBoundary kind:entry
23 ## CHECK-NOT: TryBoundary kind:entry
|