| /art/libdexfile/dex/ |
| D | type_lookup_table.cc | 41 Entry* entries = owned_entries.get(); in Create() local
55 if (entries[pos].IsEmpty()) { in Create()
56 entries[pos] = Entry(str_id.string_data_off_, hash, class_def_idx, mask_bits); in Create()
57 DCHECK(entries[pos].IsLast(mask_bits)); in Create()
71 DCHECK(!entries[tail_pos].IsEmpty()); in Create()
72 while (!entries[tail_pos].IsLast(mask_bits)) { in Create()
73 tail_pos = (tail_pos + entries[tail_pos].GetNextPosDelta(mask_bits)) & mask; in Create()
74 DCHECK(!entries[tail_pos].IsEmpty()); in Create()
80 } while (!entries[insert_pos].IsEmpty()); in Create()
82 entries[insert_pos] = Entry(str_id.string_data_off_, hash, class_def_idx, mask_bits); in Create()
[all …]
|
| D | type_lookup_table.h | 167 const Entry* entries,
|
| /art/tools/dexfuzz/src/dexfuzz/rawdex/ |
| D | AnnotationSetItem.java | 23 public AnnotationOffItem[] entries; field in AnnotationSetItem
30 entries = new AnnotationOffItem[size]; in read()
32 (entries[i] = new AnnotationOffItem()).read(file); in read()
41 for (AnnotationOffItem annotationOffItem : entries) { in write()
|
| /art/runtime/jit/ |
| D | profiling_info.cc | 28 ProfilingInfo::ProfilingInfo(ArtMethod* method, const std::vector<uint32_t>& entries) in ProfilingInfo() argument
31 number_of_inline_caches_(entries.size()), in ProfilingInfo()
37 cache_[i].dex_pc_ = entries[i]; in ProfilingInfo()
46 std::vector<uint32_t> entries; in Create() local
55 entries.push_back(inst.DexPc()); in Create()
68 return code_cache->AddProfilingInfo(self, method, entries, retry_allocation) != nullptr; in Create()
|
| D | profiling_info.h | 133 ProfilingInfo(ArtMethod* method, const std::vector<uint32_t>& entries);
|
| D | jit_code_cache.h | 213 const std::vector<uint32_t>& entries,
315 const std::vector<uint32_t>& entries)
|
| D | jit_code_cache.cc | 1881 const std::vector<uint32_t>& entries, in AddProfilingInfo() argument
1890 info = AddProfilingInfoInternal(self, method, entries); in AddProfilingInfo()
1896 info = AddProfilingInfoInternal(self, method, entries); in AddProfilingInfo()
1902 info = AddProfilingInfoInternal(self, method, entries); in AddProfilingInfo()
1910 const std::vector<uint32_t>& entries) { in AddProfilingInfoInternal() argument
1912 sizeof(ProfilingInfo) + sizeof(InlineCache) * entries.size(), in AddProfilingInfoInternal()
1925 info = new (data) ProfilingInfo(method, entries); in AddProfilingInfoInternal()
|
| /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/666-dex-cache-itf/ |
| D | info.txt | 1 We used to put wrong entries in the dex cache, which would
|
| /art/libelffile/dwarf/ |
| D | headers.h | 96 const DebugInfoEntryWriter<Vector>& entries, in WriteDebugInfoCU() argument
105 writer.PushUint8(entries.Is64bit() ? 8 : 4); in WriteDebugInfoCU()
108 writer.PushData(entries.data()); in WriteDebugInfoCU()
|
| /art/runtime/ |
| D | reference_table.cc | 125 void ReferenceTable::Dump(std::ostream& os, Table& entries) { in Dump() argument
158 if (entries.empty()) { in Dump()
165 size_t count = entries.size(); in Dump()
173 ObjPtr<mirror::Object> ref = entries[idx].Read(); in Dump()
263 for (GcRoot<mirror::Object>& root : entries) { in Dump()
|
| D | reference_table.h | 60 static void Dump(std::ostream& os, Table& entries)
|
| D | indirect_reference_table.cc | 465 ReferenceTable::Table entries; in Dump() local
470 entries.push_back(GcRoot<mirror::Object>(obj)); in Dump()
473 ReferenceTable::Dump(os, entries); in Dump()
|
| /art/tools/dexfuzz/src/dexfuzz/ |
| D | Options.java | 286 String[] entries = line.split(" "); in setupMutationLikelihoodTable() local
287 String name = entries[0].toLowerCase(); in setupMutationLikelihoodTable()
288 int likelihood = Integer.parseInt(entries[1]); in setupMutationLikelihoodTable()
|
| /art/runtime/interpreter/mterp/ |
| D | mterp.cc | 65 const int32_t* entries; in MterpDoSparseSwitch() local
90 entries = keys + size; in MterpDoSparseSwitch()
107 return entries[mid]; in MterpDoSparseSwitch()
142 const int32_t* entries = reinterpret_cast<const int32_t*>(switchData); in MterpDoPackedSwitch() local
143 return entries[index]; in MterpDoPackedSwitch()
|
| /art/runtime/interpreter/ |
| D | interpreter_common.h | 546 const int32_t* entries = keys + size; in DoSparseSwitch() local
547 DCHECK_ALIGNED(entries, 4); in DoSparseSwitch()
558 return entries[mid]; in DoSparseSwitch()
|
| /art/tools/ahat/ |
| D | README.txt | 119 Fix page loading performance by showing a limited number of entries by default.
|
| /art/imgdiag/ |
| D | imgdiag.cc | 1039 const std::set<T*>& entries = in DiffDirtyEntries() local
1043 for (T* entry : entries) { in DiffDirtyEntries()
|
| /art/runtime/arch/mips64/ |
| D | quick_entrypoints_mips64.S | 2075 # Iterate over the entries of the ImtConflictTable.
|
| /art/runtime/arch/mips/ |
| D | quick_entrypoints_mips.S | 2183 # Iterate over the entries of the ImtConflictTable.
|