Home
last modified time | relevance | path

Searched refs:entries (Results 1 – 21 of 21) sorted by relevance

/art/libdexfile/dex/
Dtype_lookup_table.cc41 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 …]
Dtype_lookup_table.h167 const Entry* entries,
/art/tools/dexfuzz/src/dexfuzz/rawdex/
DAnnotationSetItem.java23 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/
Dprofiling_info.cc28 ProfilingInfo::ProfilingInfo(ArtMethod* method, const std::vector<uint32_t>& entries) in ProfilingInfo() argument
32 number_of_inline_caches_(entries.size()), in ProfilingInfo()
36 cache_[i].dex_pc_ = entries[i]; in ProfilingInfo()
45 std::vector<uint32_t> entries; in Create() local
54 entries.push_back(inst.DexPc()); in Create()
67 return code_cache->AddProfilingInfo(self, method, entries, retry_allocation) != nullptr; in Create()
Ddebugger_interface.cc496 std::vector<const JITCodeEntry*> entries; in RepackEntries() local
497 entries.reserve(2 * kJitRepackFrequency); in RepackEntries()
506 entries.push_back(it); in RepackEntries()
510 std::sort(entries.begin(), entries.end(), cmp); // Sort by address. in RepackEntries()
513 for (auto group_it = entries.begin(); group_it != entries.end();) { in RepackEntries()
519 auto end = std::find_if(begin, entries.end(), [=](auto* e) { return e->addr_ >= group_end; }); in RepackEntries()
530 bool compress = compress_entries && end != entries.end(); in RepackEntries()
Dprofiling_info.h127 ProfilingInfo(ArtMethod* method, const std::vector<uint32_t>& entries);
Djit_code_cache.h321 const std::vector<uint32_t>& entries,
418 const std::vector<uint32_t>& entries)
Djit_code_cache.cc1550 const std::vector<uint32_t>& entries, in AddProfilingInfo() argument
1560 info = AddProfilingInfoInternal(self, method, entries); in AddProfilingInfo()
1566 info = AddProfilingInfoInternal(self, method, entries); in AddProfilingInfo()
1572 info = AddProfilingInfoInternal(self, method, entries); in AddProfilingInfo()
1580 const std::vector<uint32_t>& entries) { in AddProfilingInfoInternal() argument
1582 sizeof(ProfilingInfo) + sizeof(InlineCache) * entries.size(), in AddProfilingInfoInternal()
1596 info = new (writable_data) ProfilingInfo(method, entries); in AddProfilingInfoInternal()
/art/test/098-ddmc/
Dexpected.txt2 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/
Dinfo.txt1 We used to put wrong entries in the dex cache, which would
/art/test/2036-structural-subclass-shadow/
Dinfo.txt4 failing to invalidate some dex-cache entries causing incorrect field/method
/art/libelffile/dwarf/
Dheaders.h96 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/
Dreference_table.cc125 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()
Dreference_table.h60 static void Dump(std::ostream& os, Table& entries)
Dindirect_reference_table.cc465 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/
DOptions.java278 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/
Dpublic_libraries.cpp489 std::map<std::string, std::string> entries; in ParseJniConfig() local
501 entries[tokens[0]] = tokens[1]; in ParseJniConfig()
503 return entries; in ParseJniConfig()
/art/runtime/interpreter/mterp/
Dmterp.cc65 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/
Dinterpreter_common.h937 const int32_t* entries = keys + size; in DoSparseSwitch() local
938 DCHECK_ALIGNED(entries, 4); in DoSparseSwitch()
949 return entries[mid]; in DoSparseSwitch()
/art/tools/ahat/
DREADME.txt123 Fix page loading performance by showing a limited number of entries by default.
/art/imgdiag/
Dimgdiag.cc1045 const std::set<T*>& entries = in DiffDirtyEntries() local
1049 for (T* entry : entries) { in DiffDirtyEntries()