/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() 110 class Entry { 112 Entry() : str_offset_(0u), data_(0u) {} in Entry() function 113 Entry(uint32_t str_offset, uint32_t hash, uint32_t class_def_index, uint32_t mask_bits) in Entry() function 167 const Entry* entries, 168 std::unique_ptr<Entry[]> owned_entries); 170 const char* GetStringData(const Entry& entry) const; 174 const Entry* entries_; 176 std::unique_ptr<Entry[]> owned_entries_;
|
/art/runtime/interpreter/ |
D | interpreter_cache.h | 49 typedef std::pair<const void*, size_t> Entry ALIGNED(2 * sizeof(size_t)); 59 data_.fill(Entry{}); in InterpreterCache() 67 Entry& entry = data_[IndexOf(key)]; in Get() 77 data_[IndexOf(key)] = Entry{key, value}; in Set() 90 std::array<Entry, kSize> data_;
|
D | interpreter_cache.cc | 25 data_.fill(Entry{}); 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 | 121 BitTableBuilder<StackMap>::Entry current_stack_map_; 122 ScopedArenaVector<BitTableBuilder<InlineInfo>::Entry> current_inline_infos_; 131 ScopedArenaVector<BitTableBuilder<DexRegisterMapInfo>::Entry> temp_dex_register_map_;
|
D | stack_map_stream.cc | 80 current_stack_map_ = BitTableBuilder<StackMap>::Entry(); in BeginStackMapEntry() 97 BitTableBuilder<RegisterMask>::Entry entry; in BeginStackMapEntry() 180 BitTableBuilder<InlineInfo>::Entry entry; in BeginInlineInfoEntry() 241 BitTableBuilder<DexRegisterInfo>::Entry entry; in CreateDexRegisterMap()
|
/art/test/062-character-encodings/src/ |
D | Main.java | 19 for (Map.Entry<String, Charset> e : all.entrySet()) { in main()
|
/art/test/063-process-manager/src/ |
D | Main.java | 44 for (Map.Entry<Thread, StackTraceElement[]> entry : in checkManager()
|
/art/test/129-ThreadGetId/src/ |
D | Main.java | 66 for (Map.Entry<Thread, StackTraceElement[]> pair : map.entrySet()) { in test_getStackTraces()
|
/art/tools/ahat/src/main/com/android/ahat/ |
D | Query.java | 96 for (Map.Entry<String, String> entry : params.entrySet()) { in with()
|
/art/compiler/utils/arm/ |
D | jni_macro_assembler_arm_vixl.h | 213 vixl32::Label* Entry() { return &exception_entry_; } in Entry() function
|
D | jni_macro_assembler_arm_vixl.cc | 625 vixl32::Label* label = exception_blocks_.back()->Entry(); in ExceptionPoll() 667 ___ Bind(exception->Entry()); in EmitExceptionPoll()
|
/art/test/168-vmstack-annotated/src/ |
D | Main.java | 96 for (Map.Entry<Thread,StackTraceElement[]> entry : stacks.entrySet()) { in main()
|
/art/compiler/utils/arm64/ |
D | jni_macro_assembler_arm64.h | 189 vixl::aarch64::Label* Entry() { return &exception_entry_; } in Entry() function
|
D | jni_macro_assembler_arm64.cc | 629 ___ Cbnz(reg_x(scratch.AsXRegister()), exception_blocks_.back()->Entry()); in ExceptionPoll() 670 ___ Bind(exception->Entry()); in EmitExceptionPoll()
|
/art/compiler/utils/ |
D | assembler.h | 74 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/tools/ahat/src/main/com/android/ahat/proguard/ |
D | ProguardMap.java | 47 Map.Entry<Integer, LineNumber> lineNumberEntry = lineNumbers.floorEntry(obfuscatedLine); in getClearLine()
|
/art/test/924-threads/src/art/ |
D | Test924.java | 415 for (Map.Entry<Integer, Integer> e : states.entrySet()) { in printMajorityThreadState()
|
/art/runtime/ |
D | debugger.cc | 4889 struct Entry { struct in art::StringTable 4890 explicit Entry(const char* data_in) in Entry() function 4893 Entry(const Entry& entry) = default; 4894 Entry(Entry&& entry) = default; 4906 bool operator==(const Entry& other) const { in operator ==() argument 4911 size_t operator()(const Entry& entry) const { in operator ()() 4924 Entry entry(str); in Add() 4936 Entry entry(str); in Add() 4957 Entry entry(s); in IndexOf() 4983 std::unordered_set<Entry, EntryHash> table_;
|
/art/compiler/utils/x86/ |
D | jni_macro_assembler_x86.cc | 523 __ j(kNotEqual, slow->Entry()); in ExceptionPoll()
|
/art/compiler/utils/x86_64/ |
D | jni_macro_assembler_x86_64.cc | 590 __ j(kNotEqual, slow->Entry()); in ExceptionPoll()
|
/art/runtime/arch/mips64/ |
D | quick_entrypoints_mips64.S | 2756 # Entry points for offsets/indices not fitting into int16_t and for variable indices. 2778 # Entry points for offsets/indices fitting into int16_t. 2802 # Entry points for GC roots.
|