| /art/libdexfile/dex/ |
| D | type_lookup_table.cc | 40 std::unique_ptr<Entry[]> owned_entries(new Entry[size]); in Create()
41 Entry* entries = owned_entries.get(); in Create()
43 static_assert(alignof(Entry) == 4u, "Expecting Entry to be 4-byte aligned."); in Create()
44 const uint32_t mask = Entry::GetMask(mask_bits); in Create()
56 entries[pos] = Entry(str_id.string_data_off_, hash, class_def_idx, mask_bits); in Create()
82 entries[insert_pos] = Entry(str_id.string_data_off_, hash, class_def_idx, mask_bits); in Create()
94 DCHECK_ALIGNED(raw_data, alignof(Entry)); in Open()
95 const Entry* entries = reinterpret_cast<const Entry*>(raw_data); in Open()
101 uint32_t mask = Entry::GetMask(mask_bits_); in Lookup()
105 const Entry* entry = &entries_[pos]; in Lookup()
[all …]
|
| D | type_lookup_table.h | 84 return Size() * sizeof(Entry); in RawDataLength()
112 class Entry {
114 Entry() : str_offset_(0u), data_(0u) {} in Entry() function
115 Entry(uint32_t str_offset, uint32_t hash, uint32_t class_def_index, uint32_t mask_bits) in Entry() function
169 const Entry* entries,
170 std::unique_ptr<Entry[]> owned_entries);
172 const char* GetStringData(const Entry& entry) const;
176 const Entry* entries_;
178 std::unique_ptr<Entry[]> owned_entries_;
|
| /art/runtime/interpreter/ |
| D | interpreter_cache.h | 50 using Entry ALIGNED(2 * sizeof(size_t)) = std::pair<const void*, size_t>;
59 data_.fill(Entry{}); in InterpreterCache()
69 std::array<Entry, kSize>& GetArray() { in GetArray()
81 std::array<Entry, kSize> data_;
|
| D | interpreter_cache-inl.h | 28 Entry& entry = data_[IndexOf(key)]; in Get()
40 data_[IndexOf(key)] = Entry{key, value}; in Set()
|
| D | interpreter_cache.cc | 27 for (Entry& entry : data_) { in Clear()
|
| /art/libartbase/base/ |
| D | bit_table.h | 261 class Entry {
263 Entry() { in Entry() function
270 Entry(std::initializer_list<uint32_t> values) { in Entry() function
294 Entry& operator[](size_t row) { return rows_[row]; }
295 const Entry& operator[](size_t row) const { return rows_[row]; }
296 const Entry& back() const { return rows_.back(); } in back()
301 void Add(Entry value) { in Add()
307 uint32_t Dedup(Entry* values, size_t count = 1) {
309 uint32_t hash = hasher(MemoryRegion(values, sizeof(Entry) * count));
319 [](const Entry& lhs, const Entry& rhs) {
[all …]
|
| D | bit_table_test.cc | 128 BitTableBuilderBase<2>::Entry value0{1, 2}; in TEST()
129 BitTableBuilderBase<2>::Entry value1{3, 4}; in TEST()
173 BitTableBuilderBase<2>::Entry value0{56948505, 0}; in TEST()
174 BitTableBuilderBase<2>::Entry value1{67108869, 0}; in TEST()
|
| /art/compiler/optimizing/ |
| D | stack_map_stream.h | 149 BitTableBuilder<StackMap>::Entry current_stack_map_;
150 ScopedArenaVector<BitTableBuilder<InlineInfo>::Entry> current_inline_infos_;
159 ScopedArenaVector<BitTableBuilder<DexRegisterMapInfo>::Entry> temp_dex_register_map_;
|
| D | stack_map_stream.cc | 120 current_stack_map_ = BitTableBuilder<StackMap>::Entry(); in BeginStackMapEntry()
137 BitTableBuilder<RegisterMask>::Entry entry; in BeginStackMapEntry()
222 BitTableBuilder<InlineInfo>::Entry entry; in BeginInlineInfoEntry()
327 BitTableBuilder<DexRegisterInfo>::Entry entry; in CreateDexRegisterMap()
|
| /art/runtime/ |
| D | debugger.cc | 783 struct Entry { struct in art::StringTable
784 explicit Entry(const char* data_in) in Entry() argument
787 Entry(const Entry& entry) = default;
788 Entry(Entry&& entry) = default;
800 bool operator==(const Entry& other) const { in operator ==() argument
805 size_t operator()(const Entry& entry) const { in operator ()()
818 Entry entry(str); in Add()
830 Entry entry(str); in Add()
851 Entry entry(s); in IndexOf()
877 std::unordered_set<Entry, EntryHash> table_;
|
| /art/runtime/jit/ |
| D | jit_code_cache.h | 109 struct Entry { struct
154 ArrayRef<const Entry>::const_iterator cbegin() const { in cbegin()
157 ArrayRef<const Entry>::iterator begin() { in begin()
160 ArrayRef<const Entry>::const_iterator cend() const { in cend()
163 ArrayRef<const Entry>::iterator end() { in end()
169 ArrayRef<const Entry> map_;
|
| D | jit_code_cache.cc | 1972 capacity * sizeof(Entry) + sizeof(ZygoteCompilationState)); in Initialize()
1977 const Entry* data = reinterpret_cast<const Entry*>(memory); in Initialize()
1978 region_->FillData(data, capacity, Entry { nullptr, nullptr }); in Initialize()
1981 memory + capacity * sizeof(Entry)); in Initialize()
1993 for (const Entry& entry : map_) { in GetCodeFor()
2013 const Entry& entry = map_[index]; in GetCodeFor()
2046 const Entry* entry = &map_[index]; in Put()
2050 region_->WriteData(entry, Entry { method, code }); in Put()
|
| /art/test/062-character-encodings/src/ |
| D | Main.java | 19 for (Map.Entry<String, Charset> e : all.entrySet()) { in main()
|
| /art/tools/cpp-define-generator/ |
| D | thread.def | 35 (sizeof(art::InterpreterCache::Entry) * (art::InterpreterCache::kSize - 1)))
37 (art::WhichPowerOf2(sizeof(art::InterpreterCache::Entry)) - 2))
|
| /art/test/129-ThreadGetId/src/ |
| D | Main.java | 66 for (Map.Entry<Thread, StackTraceElement[]> pair : map.entrySet()) { in test_getStackTraces()
|
| /art/test/063-process-manager/src/ |
| D | Main.java | 44 for (Map.Entry<Thread, StackTraceElement[]> entry : in checkManager()
|
| /art/tools/ahat/src/main/com/android/ahat/ |
| D | Query.java | 96 for (Map.Entry<String, String> entry : params.entrySet()) { in with()
|
| /art/test/168-vmstack-annotated/src/ |
| D | Main.java | 100 for (Map.Entry<Thread,StackTraceElement[]> entry : stacks.entrySet()) { in main()
|
| /art/libartservice/service/java/com/android/server/art/ |
| D | DexUseManagerLocal.java | 660 Map.Entry<String, PackageDexUse> entry = it.next(); in cleanup()
694 Map.Entry<String, PrimaryDexUse> entry = it.next(); in cleanupPrimaryDexUsesLocked()
730 Map.Entry<String, SecondaryDexUse> entry = it.next(); in cleanupSecondaryDexUsesLocked()
764 Map.Entry<DexLoader, ?> entry = it.next(); in cleanupRecordsLocked()
|
| D | DumpHelper.java | 134 for (Map.Entry<String, List<DexContainerFileDexoptStatus>> entry : in dumpPackage()
|
| /art/runtime/mirror/ |
| D | dex_cache.h | 453 type* Get ##getter_setter ##Entry(uint32_t index) REQUIRES_SHARED(Locks::mutator_lock_) { \
465 void Set ##getter_setter ##Entry(uint32_t index, type* resolved) \
|
| /art/compiler/utils/ |
| D | assembler.h | 73 Label* Entry() { return &entry_; } in Entry() function
|
| /art/test/VerifierDeps/ |
| D | Main.smali | 316 invoke-static {}, Ljava/util/Map$Entry;->comparingByKey()Ljava/util/Comparator;
322 # AbstractMap$SimpleEntry implements Map$Entry
|
| /art/test/924-threads/src/art/ |
| D | Test924.java | 431 for (Map.Entry<Integer, Integer> e : states.entrySet()) { in printMajorityThreadState()
|
| /art/build/boot/ |
| D | preloaded-classes | 62 com.android.okhttp.Cache$Entry
111 com.android.okhttp.internal.DiskLruCache$Entry
682 java.lang.ClassValue$Entry
798 java.lang.ThreadLocal$ThreadLocalMap$Entry
1228 java.security.KeyStore$Entry
1631 java.util.EnumMap$EntryIterator$Entry
1678 java.util.IdentityHashMap$EntryIterator$Entry
1743 java.util.Map$Entry
1848 java.util.WeakHashMap$Entry
2885 sun.security.util.ManifestDigester$Entry
[all …]
|