| /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 (GetAllocator()) HBasicBlock(graph); in TEST_F() local
35 graph->AddBlock(entry); in TEST_F()
36 graph->SetEntryBlock(entry); in TEST_F()
39 entry->AddInstruction(parameter); in TEST_F()
40 entry->AddInstruction(new (GetAllocator()) HGoto()); in TEST_F()
44 entry->AddSuccessor(first_block); in TEST_F()
74 HBasicBlock* entry = new (GetAllocator()) HBasicBlock(graph); in TEST_F() local
75 graph->AddBlock(entry); in TEST_F()
76 graph->SetEntryBlock(entry); in TEST_F()
81 entry->AddInstruction(parameter1); in TEST_F()
[all …]
|
| D | load_store_analysis_test.cc | 33 HBasicBlock* entry = new (GetAllocator()) HBasicBlock(graph_); in TEST_F() local
34 graph_->AddBlock(entry); in TEST_F()
35 graph_->SetEntryBlock(entry); in TEST_F()
60 entry->AddInstruction(array); in TEST_F()
61 entry->AddInstruction(index); in TEST_F()
62 entry->AddInstruction(array_get1); in TEST_F()
63 entry->AddInstruction(array_get2); in TEST_F()
64 entry->AddInstruction(array_set1); in TEST_F()
65 entry->AddInstruction(array_set2); in TEST_F()
75 heap_location_collector.VisitBasicBlock(entry); in TEST_F()
[all …]
|
| D | gvn_test.cc | 31 HBasicBlock* entry = new (GetAllocator()) HBasicBlock(graph); in TEST_F() local
32 graph->AddBlock(entry); in TEST_F()
33 graph->SetEntryBlock(entry); in TEST_F()
38 entry->AddInstruction(parameter); in TEST_F()
42 entry->AddSuccessor(block); in TEST_F()
112 HBasicBlock* entry = new (GetAllocator()) HBasicBlock(graph); in TEST_F() local
113 graph->AddBlock(entry); in TEST_F()
114 graph->SetEntryBlock(entry); in TEST_F()
119 entry->AddInstruction(parameter); in TEST_F()
123 entry->AddSuccessor(block); in TEST_F()
[all …]
|
| D | stack_map_stream.cc | 97 BitTableBuilder<RegisterMask>::Entry entry; in BeginStackMapEntry() local
98 entry[RegisterMask::kValue] = register_mask >> shift; in BeginStackMapEntry()
99 entry[RegisterMask::kShift] = shift; in BeginStackMapEntry()
100 current_stack_map_[StackMap::kRegisterMaskIndex] = register_masks_.Dedup(&entry); in BeginStackMapEntry()
180 BitTableBuilder<InlineInfo>::Entry entry; in BeginInlineInfoEntry() local
181 entry[InlineInfo::kIsLast] = InlineInfo::kMore; in BeginInlineInfoEntry()
182 entry[InlineInfo::kDexPc] = dex_pc; in BeginInlineInfoEntry()
183 entry[InlineInfo::kNumberOfDexRegisters] = static_cast<uint32_t>(expected_num_dex_registers_); in BeginInlineInfoEntry()
185 entry[InlineInfo::kArtMethodHi] = High32Bits(reinterpret_cast<uintptr_t>(method)); in BeginInlineInfoEntry()
186 entry[InlineInfo::kArtMethodLo] = Low32Bits(reinterpret_cast<uintptr_t>(method)); in BeginInlineInfoEntry()
[all …]
|
| D | bounds_check_elimination_test.cc | 67 HBasicBlock* entry = new (GetAllocator()) HBasicBlock(graph_); in TEST_F() local
68 graph_->AddBlock(entry); in TEST_F()
69 graph_->SetEntryBlock(entry); in TEST_F()
74 entry->AddInstruction(parameter1); in TEST_F()
75 entry->AddInstruction(parameter2); in TEST_F()
86 entry->AddSuccessor(block1); in TEST_F()
164 HBasicBlock* entry = new (GetAllocator()) HBasicBlock(graph_); in TEST_F() local
165 graph_->AddBlock(entry); in TEST_F()
166 graph_->SetEntryBlock(entry); in TEST_F()
171 entry->AddInstruction(parameter1); in TEST_F()
[all …]
|
| D | register_allocator_test.cc | 490 HBasicBlock* entry = new (GetAllocator()) HBasicBlock(graph); in BuildIfElseWithPhi() local
491 graph->AddBlock(entry); in BuildIfElseWithPhi()
492 graph->SetEntryBlock(entry); in BuildIfElseWithPhi()
495 entry->AddInstruction(parameter); in BuildIfElseWithPhi()
499 entry->AddSuccessor(block); in BuildIfElseWithPhi()
640 HBasicBlock* entry = new (GetAllocator()) HBasicBlock(graph); in BuildFieldReturn() local
641 graph->AddBlock(entry); in BuildFieldReturn()
642 graph->SetEntryBlock(entry); in BuildFieldReturn()
645 entry->AddInstruction(parameter); in BuildFieldReturn()
649 entry->AddSuccessor(block); in BuildFieldReturn()
[all …]
|
| /art/runtime/jit/ |
| D | debugger_interface.cc | 181 JITCodeEntry* entry = new JITCodeEntry; in CreateJITCodeEntryInternal() local
182 CHECK(entry != nullptr); in CreateJITCodeEntryInternal()
183 entry->symfile_addr_ = symfile.data(); in CreateJITCodeEntryInternal()
184 entry->symfile_size_ = symfile.size(); in CreateJITCodeEntryInternal()
185 entry->prev_ = nullptr; in CreateJITCodeEntryInternal()
186 entry->next_.store(head, std::memory_order_relaxed); in CreateJITCodeEntryInternal()
187 entry->register_timestamp_ = timestamp; in CreateJITCodeEntryInternal()
192 head->prev_ = entry; in CreateJITCodeEntryInternal()
194 descriptor.head_.store(entry, std::memory_order_relaxed); in CreateJITCodeEntryInternal()
195 descriptor.relevant_entry_ = entry; in CreateJITCodeEntryInternal()
[all …]
|
| /art/libdexfile/dex/ |
| D | test_dex_file_builder.h | 106 for (auto& entry : strings_) { in Build()
107 entry.second.idx = string_idx; in Build()
109 entry.second.data_offset = data_section_size; in Build()
110 data_section_size += entry.first.length() + 1u /* length */ + 1u /* null-terminator */; in Build()
117 for (auto& entry : types_) { in Build()
118 entry.second = type_idx; in Build()
126 for (auto& entry : protos_) { in Build()
127 entry.second.idx = proto_idx; in Build()
129 size_t num_args = entry.first.args.size(); in Build()
131 entry.second.data_offset = RoundUp(data_section_size, 4u); in Build()
[all …]
|
| D | type_lookup_table.cc | 105 const Entry* entry = &entries_[pos]; in Lookup() local
106 if (entry->IsEmpty()) { in Lookup()
111 while (compared_hash_bits != entry->GetHashBits(mask_bits_)) { in Lookup()
112 if (entry->IsLast(mask_bits_)) { in Lookup()
115 pos = (pos + entry->GetNextPosDelta(mask_bits_)) & mask; in Lookup()
116 entry = &entries_[pos]; in Lookup()
117 DCHECK(!entry->IsEmpty()); in Lookup()
120 const char* first_checked_str = GetStringData(*entry); in Lookup()
122 return entry->GetClassDefIdx(mask_bits_); in Lookup()
125 if (entry->IsLast(mask_bits_)) { in Lookup()
[all …]
|
| D | dex_file-inl.h | 379 PositionInfo entry; in DecodeDebugPositionInfo() local
380 entry.line_ = DecodeDebugInfoParameterNames(&stream, VoidFunctor()); in DecodeDebugPositionInfo()
388 entry.address_ += DecodeUnsignedLeb128(&stream); in DecodeDebugPositionInfo()
391 entry.line_ += DecodeSignedLeb128(&stream); in DecodeDebugPositionInfo()
409 entry.prologue_end_ = true; in DecodeDebugPositionInfo()
412 entry.epilogue_begin_ = true; in DecodeDebugPositionInfo()
416 entry.source_file_ = index_to_string_data(name_idx); in DecodeDebugPositionInfo()
421 entry.address_ += adjopcode / DBG_LINE_RANGE; in DecodeDebugPositionInfo()
422 entry.line_ += DBG_LINE_BASE + (adjopcode % DBG_LINE_RANGE); in DecodeDebugPositionInfo()
423 if (position_functor(entry)) { in DecodeDebugPositionInfo()
[all …]
|
| /art/dex2oat/ |
| D | verifier_deps_test.cc | 282 for (auto& entry : storage) { in HasAssignable() local
284 verifier_deps_->GetStringFromId(dex_file, entry.GetDestination()); in HasAssignable()
285 std::string actual_source = verifier_deps_->GetStringFromId(dex_file, entry.GetSource()); in HasAssignable()
300 for (auto& entry : dex_dep.second->classes_) { in HasClass() local
301 if (expected_resolved != entry.IsResolved()) { in HasClass()
305 std::string actual_klass = dex_dep.first->StringByTypeIdx(entry.GetDexTypeIndex()); in HasClass()
313 std::string actual_access_flags = PrettyJavaAccessFlags(entry.GetAccessFlags()); in HasClass()
334 for (auto& entry : dex_dep.second->fields_) { in HasField() local
335 if (expected_resolved != entry.IsResolved()) { in HasField()
339 const dex::FieldId& field_id = dex_dep.first->GetFieldId(entry.GetDexFieldIndex()); in HasField()
[all …]
|
| /art/runtime/verifier/ |
| D | reg_type_cache.cc | 42 ALWAYS_INLINE static inline bool MatchingPrecisionForClass(const RegType* entry, bool precise) in MatchingPrecisionForClass() argument
44 if (entry->IsPreciseReference() == precise) { in MatchingPrecisionForClass()
48 if (!precise && entry->GetClass()->CannotBeAssignedFromOtherTypes()) { in MatchingPrecisionForClass()
139 const RegType* entry = entries_[idx]; in MatchDescriptor() local
140 if (descriptor != entry->descriptor_) { in MatchDescriptor()
143 if (entry->HasClass()) { in MatchDescriptor()
144 return MatchingPrecisionForClass(entry, precise); in MatchDescriptor()
148 DCHECK(entry->IsUnresolvedReference()); in MatchDescriptor()
202 RegType* entry; in From() local
207 entry = in From()
[all …]
|
| D | verifier_deps.cc | 650 for (const T& entry : set) { in EncodeSet() local
651 EncodeTuple(out, entry); in EncodeSet()
846 for (const TypeAssignability& entry : dep.second->assignable_types_) { in Dump() local
848 << GetStringFromId(dex_file, entry.GetSource()) in Dump()
850 << GetStringFromId(dex_file, entry.GetDestination()) in Dump()
854 for (const TypeAssignability& entry : dep.second->unassignable_types_) { in Dump() local
856 << GetStringFromId(dex_file, entry.GetSource()) in Dump()
858 << GetStringFromId(dex_file, entry.GetDestination()) in Dump()
862 for (const ClassResolution& entry : dep.second->classes_) { in Dump() local
864 << dex_file.StringByTypeIdx(entry.GetDexTypeIndex()) in Dump()
[all …]
|
| /art/runtime/ |
| D | index_bss_mapping.cc | 62 [=](const struct IndexBssMappingEntry& entry) { in GetBssOffset() argument
63 return (entry.index_and_mask & index_mask) < index; in GetBssOffset()
68 const IndexBssMappingEntry& entry = *it; in GetBssOffset() local
69 return entry.GetBssOffset(index_bits, index, slot_size); in GetBssOffset()
|
| /art/compiler/utils/ |
| 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()
|
| /art/imgdiag/ |
| D | imgdiag.cc | 212 template <typename T> size_t EntrySize(T* entry);
252 T* entry = dirty_entries_[i]; in DumpSamplesAndOffsetCount() local
253 os_ << reinterpret_cast<void*>(entry) << ", "; in DumpSamplesAndOffsetCount()
274 bool IsEntryOnDirtyPage(T* entry, const std::set<size_t>& dirty_pages) const in IsEntryOnDirtyPage()
276 size_t size = EntrySize(entry); in IsEntryOnDirtyPage()
279 uintptr_t entry_address = reinterpret_cast<uintptr_t>(entry); in IsEntryOnDirtyPage()
292 void AddZygoteDirtyEntry(T* entry) REQUIRES_SHARED(Locks::mutator_lock_) { in AddZygoteDirtyEntry()
293 zygote_dirty_entries_.insert(entry); in AddZygoteDirtyEntry()
296 void AddImageDirtyEntry(T* entry) REQUIRES_SHARED(Locks::mutator_lock_) { in AddImageDirtyEntry()
297 image_dirty_entries_.insert(entry); in AddImageDirtyEntry()
[all …]
|
| /art/runtime/interpreter/ |
| D | interpreter_cache.h | 67 Entry& entry = data_[IndexOf(key)]; in Get() local
68 if (LIKELY(entry.first == key)) { in Get()
69 *value = entry.second; in Get()
|
| /art/tools/ahat/src/main/com/android/ahat/ |
| D | Query.java | 96 for (Map.Entry<String, String> entry : params.entrySet()) { in with()
97 if (entry.getValue() != null) { in with()
99 newQuery.append(entry.getKey()); in with()
101 newQuery.append(entry.getValue()); in with()
|
| /art/tools/checker/file_format/c1visualizer/ |
| D | struct.py | 28 for entry in self.passes:
29 if entry.name == name:
30 return entry
|
| /art/test/063-process-manager/src/ |
| D | Main.java | 44 for (Map.Entry<Thread, StackTraceElement[]> entry : in checkManager()
46 Thread t = entry.getKey(); in checkManager()
51 for (StackTraceElement e : entry.getValue()) { 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 …]
|