/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() 35 cache_[i].dex_pc_ = entries[i]; in ProfilingInfo() 44 std::vector<uint32_t> entries; in Create() local 51 entries.push_back(inst.DexPc()); in Create() 64 return code_cache->AddProfilingInfo(self, method, entries); in Create()
|
D | debugger_interface.cc | 499 std::vector<const JITCodeEntry*> entries; in RepackEntries() local 500 entries.reserve(2 * kJitRepackFrequency); in RepackEntries() 509 entries.push_back(it); in RepackEntries() 513 std::sort(entries.begin(), entries.end(), cmp); // Sort by address. in RepackEntries() 516 for (auto group_it = entries.begin(); group_it != entries.end();) { in RepackEntries() 522 auto end = std::find_if(begin, entries.end(), [=](auto* e) { return e->addr_ >= group_end; }); in RepackEntries() 533 bool compress = compress_entries && end != entries.end(); in RepackEntries()
|
D | profiling_info.h | 118 ProfilingInfo(ArtMethod* method, const std::vector<uint32_t>& entries);
|
D | jit_code_cache.h | 317 const std::vector<uint32_t>& entries) 407 const std::vector<uint32_t>& entries)
|
D | jit_code_cache.cc | 1439 const std::vector<uint32_t>& entries) { in AddProfilingInfo() argument 1444 info = AddProfilingInfoInternal(self, method, entries); in AddProfilingInfo() 1450 info = AddProfilingInfoInternal(self, method, entries); in AddProfilingInfo() 1457 const std::vector<uint32_t>& entries) { in AddProfilingInfoInternal() argument 1465 sizeof(ProfilingInfo) + sizeof(InlineCache) * entries.size(), in AddProfilingInfoInternal() 1473 ProfilingInfo* info = new (writable_data) ProfilingInfo(method, entries); in AddProfilingInfoInternal()
|
/art/odrefresh/ |
D | odr_compilation_log_test.cc | 55 const OdrCompilationLogEntry entries[] = { in TEST() local 70 for (const auto& entry : entries) { in TEST() 261 std::vector<OdrCompilationLogEntry> entries = { in TEST_F() local 271 for (size_t i = 0; i < entries.size(); ++i) { in TEST_F() 272 OdrCompilationLogEntry& e = entries[i]; in TEST_F() 287 const OdrCompilationLogEntry& expected = entries[i + 1 - ocl.NumberOfEntries() + j]; in TEST_F() 294 std::vector<OdrCompilationLogEntry> entries = { in TEST_F() local 307 for (size_t i = 0; i < entries.size(); ++i) { in TEST_F() 310 OdrCompilationLogEntry& e = entries[i]; in TEST_F() 329 const OdrCompilationLogEntry& expected = entries[i + 1 - ocl.NumberOfEntries() + j]; in TEST_F()
|
/art/tools/create_minidebuginfo/ |
D | create_minidebuginfo.cc | 99 std::deque<std::pair<const FDE*, const CIE*>> entries; in WriteMinidebugInfo() local 111 entries.emplace_back(std::make_pair(fde, cie)); in WriteMinidebugInfo() 114 std::stable_sort(entries.begin(), entries.end(), [](const auto& lhs, const auto& rhs) { in WriteMinidebugInfo() 121 for (const auto& entry : entries) { in WriteMinidebugInfo()
|
/art/test/666-dex-cache-itf/ |
D | info.txt | 1 We used to put wrong entries in the dex cache, which would
|
/art/test/2036-structural-subclass-shadow/ |
D | info.txt | 4 failing to invalidate some dex-cache entries causing incorrect field/method
|
/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 | 479 ReferenceTable::Table entries; in Dump() local 484 entries.push_back(GcRoot<mirror::Object>(obj)); in Dump() 487 ReferenceTable::Dump(os, entries); in Dump()
|
/art/tools/dexfuzz/src/dexfuzz/ |
D | Options.java | 278 String[] entries = line.split(" "); in setupMutationLikelihoodTable() local 279 String name = entries[0].toLowerCase(); in setupMutationLikelihoodTable() 280 int likelihood = Integer.parseInt(entries[1]); in setupMutationLikelihoodTable()
|
/art/libnativeloader/ |
D | public_libraries.cpp | 432 std::map<std::string, std::string> entries; in ParseApexLibrariesConfig() local 446 entries[config_line->apex_namespace] = config_line->library_list; in ParseApexLibrariesConfig() 448 return entries; in ParseApexLibrariesConfig()
|
/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 | 776 const int32_t* entries = keys + size; in DoSparseSwitch() local 777 DCHECK_ALIGNED(entries, 4); in DoSparseSwitch() 788 return entries[mid]; in DoSparseSwitch()
|
/art/tools/ahat/ |
D | README.txt | 126 Fix page loading performance by showing a limited number of entries by default.
|
/art/imgdiag/ |
D | imgdiag.cc | 1046 const std::set<T*>& entries = in DiffDirtyEntries() local 1050 for (T* entry : entries) { in DiffDirtyEntries()
|
/art/build/boot/hiddenapi/ |
D | hiddenapi-max-target-o-low-priority.txt | 1860 Ljava/io/ObjectInputStream$HandleTable;->entries:[Ljava/lang/Object; 8900 Ljava/util/jar/Manifest;->entries:Ljava/util/Map; 11454 Lsun/security/util/ManifestDigester;->entries:Ljava/util/HashMap;
|
/art/build/boot/ |
D | boot-image-profile.txt | 7826 HSPLjava/util/zip/ZipFile;->entries()Ljava/util/Enumeration;
|