/art/compiler/dex/ |
H A D | dex_to_dex_decompiler_test.cc | 98 ArrayRef<const uint8_t> table; local 100 table = compiled_method->GetVmapTable(); 104 table,
|
/art/runtime/ |
H A D | image-inl.h | 74 auto* table = reinterpret_cast<ImtConflictTable*>(base + section.Offset() + pos); local 75 table->Visit([&visitor](const std::pair<ArtMethod*, ArtMethod*>& methods) { 78 pos += table->ComputeSize(pointer_size);
|
H A D | class_table_test.cc | 84 ClassTable table; local 85 EXPECT_EQ(table.NumZygoteClasses(class_loader.Get()), 0u); 86 EXPECT_EQ(table.NumNonZygoteClasses(class_loader.Get()), 0u); 88 // Add h_X to the class table. 89 table.Insert(h_X.Get()); 90 EXPECT_EQ(table.LookupByDescriptor(h_X.Get()), h_X.Get()); 91 EXPECT_EQ(table.Lookup(descriptor_x, ComputeModifiedUtf8Hash(descriptor_x)), h_X.Get()); 92 EXPECT_EQ(table.Lookup("NOT_THERE", ComputeModifiedUtf8Hash("NOT_THERE")), nullptr); 93 EXPECT_EQ(table.NumZygoteClasses(class_loader.Get()), 0u); 94 EXPECT_EQ(table [all...] |
H A D | debug_print.cc | 80 ClassTable* table = Runtime::Current()->GetClassLinker()->ClassTableForClassLoader(loader); local 82 << "/" << static_cast<const void*>(table); 87 (table != nullptr) ? table->Lookup(class_descriptor, hash) : nullptr; 161 LOG(ERROR) << " in interface table for " << source_descriptor
|
H A D | imt_conflict_table.h | 30 // Table to resolve IMT conflicts at runtime. The table is attached to 32 // The table contains a list of pairs of { interface_method, implementation_method } 43 // Build a new table copying `other` and adding the new entry formed of 149 // Compute the number of entries in this table. 158 // Compute the size in bytes taken by this table. 164 // Compute the size in bytes needed for copying the given `table` and add 166 static size_t ComputeSizeWithOneMoreEntry(ImtConflictTable* table, PointerSize pointer_size) { argument 167 return table->ComputeSize(pointer_size) + EntrySize(pointer_size);
|
H A D | mapping_table.h | 25 // A utility for processing the raw uleb128 encoded mapping table created by the quick compiler. 32 const uint8_t* table = encoded_table_; variable 33 if (table == nullptr) { 36 return DecodeUnsignedLeb128(&table); 41 const uint8_t* table = encoded_table_; variable 42 if (table == nullptr) { 45 uint32_t total_size = DecodeUnsignedLeb128(&table); 46 uint32_t pc_to_dex_size = DecodeUnsignedLeb128(&table); 52 const uint8_t* table = encoded_table_; local 53 if (table ! 68 DexToPcIterator(const MappingTable* table, uint32_t element) argument 124 const uint8_t* table = encoded_table_; variable 128 DecodeUnsignedLeb128(&table); // Total_size, unused. variable 135 const uint8_t* table = encoded_table_; local 145 PcToDexIterator(const MappingTable* table, uint32_t element) argument [all...] |
H A D | indirect_reference_table.cc | 37 // Maximum table size we allow. 81 table_mem_map_.reset(MemMap::MapAnonymous("indirect ref table", nullptr, table_bytes, 84 *error_msg = "Unable to map memory for indirect ref table"; 136 // are usually near the end of the table (see the header, TODO: verify this assumption). To avoid 166 static size_t CountNullEntries(const IrtEntry* table, size_t from, size_t to) { argument 169 if (table[index].GetReference()->IsNull()) { 198 static inline void CheckHoleCount(IrtEntry* table, argument 203 size_t count = CountNullEntries(table, prev_state.top_index, cur_state.top_index); 220 std::unique_ptr<MemMap> new_map(MemMap::MapAnonymous("indirect ref table", 258 oss << "JNI ERROR (app bug): " << kind_ << " table overflo [all...] |
H A D | art_method.h | 469 ALWAYS_INLINE void SetImtConflictTable(ImtConflictTable* table, PointerSize pointer_size) { argument 471 SetDataPtrSize(table, pointer_size); 771 // Entry within a dispatch table for this method. For static/direct methods the index is into
|
/art/tools/ahat/src/main/com/android/ahat/ |
H A D | SizeTable.java | 25 * Class for rendering a table that includes all categories of Size. 26 * Two table formats are supported, one where a custom left column can be 35 * Start a size table with a custom left column. 39 * This should be followed by calls to the 'row' method to fill in the table 40 * contents and the 'end' method to end the table. 44 static void table(Doc doc, Column left, boolean showDiff, Column... columns) { method in class:SizeTable 54 doc.table(cols.toArray(new Column[cols.size()])); 58 * Add a row to the currently active size table with custom left column. 60 * currently active table. 77 * Start a size table withou 85 static void table(Doc doc, boolean showDiff, Column... columns) { method in class:SizeTable [all...] |
H A D | Doc.java | 51 * Start a table with the given columns. 55 * This should be followed by calls to the 'row' method to fill in the table 56 * contents and the 'end' method to end the table. 58 void table(Column... columns); method in interface:Doc 61 * Start a table with the following heading structure: 68 * This should be followed by calls to the 'row' method to fill in the table 69 * contents and the 'end' method to end the table. 71 void table(DocString description, List<Column> subcols, List<Column> cols); method in interface:Doc 74 * Add a row to the currently active table. 76 * currently active table [all...] |
H A D | HtmlDoc.java | 81 public void table(Column... columns) { method in class:HtmlDoc 87 ps.println("<table>"); 102 public void table(DocString description, List<Column> subcols, List<Column> cols) { method in class:HtmlDoc 118 ps.println("<table>"); 147 throw new IllegalStateException("table method must be called before row"); 171 ps.println("<table>"); 181 ps.println("</table>");
|
/art/libdexfile/dex/ |
H A D | bytecode_utils.h | 34 const uint16_t* table = reinterpret_cast<const uint16_t*>(&instruction) + table_offset; local 35 DCHECK_EQ(table[0], sparse_ ? static_cast<uint16_t>(Instruction::kSparseSwitchSignature) 37 num_entries_ = table[1]; 38 values_ = reinterpret_cast<const int32_t*>(&table[2]); 47 // In a sparse table, we have num_entries_ keys and num_entries_ values, in that order. 50 // In a packed table, we have the starting key and num_entries_ values. 67 // Index of the first value in the table. 70 // In a sparse table, we have num_entries_ keys and num_entries_ values, in that order. 73 // In a packed table, we have the starting key and num_entries_ values. 88 // Whether this is a sparse-switch table (o 106 DexSwitchTableIterator(const DexSwitchTable& table) argument [all...] |
/art/compiler/driver/ |
H A D | compiled_method_storage.cc | 170 dedupe_vmap_table_("dedupe vmap table", 189 os << "\nVmap table dedupe: " << dedupe_vmap_table_.DumpStats(self); 213 const ArrayRef<const uint8_t>& table) { 214 return AllocateOrDeduplicateArray(table, &dedupe_vmap_table_); 217 void CompiledMethodStorage::ReleaseVMapTable(const LengthPrefixedArray<uint8_t>* table) { argument 218 ReleaseArrayIfNotDeduplicated(table); 212 DeduplicateVMapTable( const ArrayRef<const uint8_t>& table) argument
|
H A D | compiler_driver.cc | 1835 // TODO: we could resolve strings here, although the string table is largely filled with class 2853 // The table doesn't know if something wasn't inserted. For this case it will return 2890 ClassStateTable* table = &compiled_classes_; local 2893 if (!table->Get(ref, &existing)) { 2906 table = &classpath_classes_; 2907 table->Get(ref, &existing); 2915 result = table->Insert(ref, existing, status);
|
/art/runtime/gc/collector/ |
H A D | mark_compact.cc | 177 // Clear the whole card table since we cannot get any additional dirty cards during the 216 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local 217 if (table != nullptr) { 222 table->UpdateAndMarkReferences(this); 352 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local 353 if (table != nullptr) { 359 table->UpdateAndMarkReferences(this); 361 // No mod union table, so we need to scan the space using bitmap visit.
|
H A D | semi_space.cc | 231 // Clear the whole card table since we cannot get any additional dirty cards during the 341 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local 342 if (table != nullptr) { 348 table->UpdateAndMarkReferences(this); 352 // If the space has no mod union table (the non-moving space, app image spaces, main spaces 383 // card table) didn't miss any from-space references in the
|
H A D | concurrent_copying.cc | 53 // union table. Disabled since it does not seem to help the pause much. 108 "The region space size and the read barrier table region size must match"); 646 // Mod union table VisitObjects may visit the same object multiple times so we can't check 672 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local 677 if (table != nullptr) { 678 table->ProcessCards(); 679 table->VisitObjects(&VisitorType::Callback, &visitor); 683 // Keep cards aged if we don't have a mod-union table since we may need to scan them in future 712 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local 715 // also handles the mod-union table card 804 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local 2684 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local [all...] |
/art/runtime/jit/ |
H A D | profile_saver.cc | 340 ClassTable* table = class_linker->ClassTableForClassLoader(class_loader.Get()); local 341 if (table == nullptr) { 342 // If the class loader has not loaded any classes, it may have a null table. 348 // table lock. We want to avoid blocking class loading in other threads as much as 350 ScopedTrace trace3("Visiting class table"); 351 table->Visit(get_classes_visitor);
|
/art/runtime/native/ |
H A D | dalvik_system_VMRuntime.cc | 331 explicit PreloadDexCachesStringsVisitor(StringTable* table) : table_(table) { } argument
|
/art/runtime/mirror/ |
H A D | class.cc | 231 // so that they can grab the new version of the class from the class linker's table. 1127 PointerArray* table = GetVTableDuringLinking(); local 1128 CHECK(table != nullptr) << PrettyClass(); 1129 const size_t table_length = table->GetLength(); 1132 SetEmbeddedVTableEntry(i, table->GetElementPtrSize<ArtMethod*>(i, pointer_size), pointer_size);
|
/art/dex2oat/linker/ |
H A D | image_writer.cc | 569 // Add non-embedded vtable to the pointer array table if there is one. 833 // Circular dependencies, return false but do not store the result in the memoization table. 1154 [&](ClassTable* table) REQUIRES_SHARED(Locks::mutator_lock_) { 1155 table->RemoveStrongRoots( 1242 // If we found it in the runtime intern table it could either be in the boot image or interned 1360 // Not in another image space, insert to our table. 1481 // Register the class loader if it has a class table. 1491 // image_info.class_table_ table is only accessed from the image writer 1518 // If the method is a conflict method we also want to assign the conflict table offset. 1531 void ImageWriter::TryAssignConflictTableOffset(ImtConflictTable* table, size_ argument 2145 ClassTable* table = image_info.class_table_.get(); local [all...] |
H A D | oat_writer.cc | 302 // Whether to create the type lookup table. 325 // The lookup table offset in the oat file. Set in WriteTypeLookupTables. 838 // The dextodexcompiler puts the quickening info table into the CompiledMethod 1305 // The code offset was 0 when the mapping/vmap table offset was set, so it's set 2643 // Use method index order to minimize the encoded size of the offset table. 2724 PLOG(ERROR) << "Failed to write quickening offset table for " << dex_file->GetLocation() 2754 // Make sure the table is properly aligned. 2782 PLOG(ERROR) << "Failed to seek to quickening offset table section. Actual: " << actual_offset 2804 // Store the offset table offset as a preheader for each dex. 2811 PLOG(ERROR) << "Failed to seek to before dex file for writing offset table offse 3977 TypeLookupTable* const table = type_lookup_table_oat_dex_files_.back()->GetTypeLookupTable(); local 4404 ClassTable* table = Runtime::Current()->GetClassLinker()->boot_class_table_.get(); variable [all...] |
/art/runtime/entrypoints/quick/ |
H A D | quick_trampoline_entrypoints.cc | 1238 // Log the outer method and its associated dex file and class table pointer which can be used 1245 << " class table: " << class_linker->ClassTableForClassLoader(outer_method->GetClassLoader()); 1279 << " class table: " 2508 HandleScope* table = reinterpret_cast<HandleScope*>(reinterpret_cast<uint8_t*>(sp) + sizeof(*sp)); local 2509 return GenericJniMethodEnd(self, cookie, result, result_f, called, table); 2715 // We create a new table with the new pair { interface_method, method }.
|
/art/runtime/gc/space/ |
H A D | image_space.cc | 1150 ImtConflictTable* table = method->GetImtConflictTable(pointer_size_); variable 1151 if (table != nullptr) { 1152 ImtConflictTable* new_table = ForwardObject(table); 1153 if (table != new_table) {
|
/art/compiler/optimizing/ |
H A D | code_generator_mips.cc | 9340 // instruction to simulate PC-relative addressing when accessing the jump table. 9389 // Create a jump table. 9395 JumpTable* table = __ CreateJumpTable(std::move(labels)); local 9407 // We are in the range of the table. 9408 // Load the target address from the jump table, indexing by the value. 9409 __ LoadLabelAddress(AT, constant_area, table->GetLabel()); 9412 // Compute the absolute target address by adding the table start address 9413 // (the table contains offsets to targets relative to its start). 9429 // R6 uses PC-relative addressing to access the jump table. 9432 // to access the jump table an [all...] |