/art/compiler/dex/ |
H A D | vreg_analysis.cc | 28 void MIRGraph::DumpRegLocTable(RegLocation* table, int count) { argument 31 table[i].orig_sreg, storage_name[table[i].location], 32 table[i].wide ? 'W' : 'N', table[i].defined ? 'D' : 'U', 33 table[i].fp ? 'F' : table[i].ref ? 'R' :'C', 34 table[i].is_const ? 'c' : 'n', 35 table[i].high_word ? 'H' : 'L', table[ [all...] |
/art/compiler/ |
H A D | gc_map_builder.h | 30 GcMapBuilder(std::vector<uint8_t, Alloc>* table, size_t entries, uint32_t max_native_offset, argument 37 // Resize table and set up header. 38 table->resize((EntryWidth() * entries) + sizeof(uint32_t)); 39 table_ = table->data(); 41 (*table)[0] = native_offset_width_ & 7; 43 (*table)[0] |= (references_width_ << 3) & 0xFF; 44 (*table)[1] = (references_width_ >> 5) & 0xFF; 46 (*table)[2] = entries & 0xFF; 47 (*table)[3] = (entries >> 8) & 0xFF; 91 // Number of entries in the table [all...] |
/art/runtime/ |
H A D | vmap_table.h | 32 explicit VmapTable(const uint8_t* table) : table_(table) { argument 37 const uint8_t* table = table_; local 38 size_t size = DecodeUnsignedLeb128(&table); 40 uint16_t adjusted_entry = DecodeUnsignedLeb128(&table); 42 adjusted_entry = DecodeUnsignedLeb128(&table); 48 const uint8_t* table = table_; local 49 return DecodeUnsignedLeb128(&table); 64 const uint8_t* table = table_; local 66 size_t end = DecodeUnsignedLeb128(&table); 101 const uint8_t* table = table_; local [all...] |
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 | profiler.h | 125 Map *table[kHashSize]; member in class:art::ProfileSampleResults 155 // table. 164 // apart. At the end of a run, it writes the results table to a file and goes back to sleep. 272 // If the given method has an entry in the profile table it updates the data
|
/art/compiler/dex/quick/x86/ |
H A D | call_x86.cc | 35 * The sparse table in the literal pool is an array of <key,displacement> 59 const uint16_t* table = mir_graph_->GetTable(mir, table_offset); local 60 // Add the table to the list - we'll process it later 64 tab_rec->table = table; 66 int size = table[1]; 72 int low_key = s4FromSwitchData(&table[2]); 89 // Load the address of the table into table_base. 95 // Load the offset from the table out of the table [all...] |
/art/compiler/dex/quick/arm/ |
H A D | call_arm.cc | 38 * The sparse table in the literal pool is an array of <key,displacement> 45 * adr r_base, <table> 57 const uint16_t* table = mir_graph_->GetTable(mir, table_offset); local 58 // Add the table to the list - we'll process it later 62 tab_rec->table = table; 64 uint32_t size = table[1]; 79 // Materialize a pointer to the switch table 102 const uint16_t* table = mir_graph_->GetTable(mir, table_offset); local 103 // Add the table t [all...] |
/art/compiler/dex/quick/arm64/ |
H A D | call_arm64.cc | 37 * The sparse table in the literal pool is an array of <key,displacement> 41 * adr r_base, <table> 56 const uint16_t* table = mir_graph_->GetTable(mir, table_offset); local 57 // Add the table to the list - we'll process it later 61 tab_rec->table = table; 63 uint32_t size = table[1]; 72 // Materialize a pointer to the switch table 105 const uint16_t* table = mir_graph_->GetTable(mir, table_offset); local 106 // Add the table t [all...] |
/art/compiler/dex/quick/mips/ |
H A D | call_mips.cc | 43 * for our PIC switch table strategy. To materialize the current location 46 * locate the switch table data and as the reference base for the switch 47 * target offsets stored in the table. We'll use a special pseudo-instruction 49 * switch table offsets (which will happen after final assembly and all 58 * addiu r_base, rRA, <table> - <BaseLabel> ; table relative to BaseLabel 59 addu r_end, r_end, r_base ; end of table 73 const uint16_t* table = mir_graph_->GetTable(mir, table_offset); local 74 // Add the table to the list - we'll process it later. 78 tab_rec->table 146 const uint16_t* table = mir_graph_->GetTable(mir, table_offset); local [all...] |
/art/runtime/gc/collector/ |
H A D | mark_compact.cc | 199 // Clear the whole card table since we can not Get any additional dirty cards during the 237 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local 238 if (table != nullptr) { 243 table->UpdateAndMarkReferences(MarkHeapReferenceCallback, this); 383 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local 384 if (table != nullptr) { 390 table->UpdateAndMarkReferences(&UpdateHeapReferenceCallback, this); 392 // No mod union table, so we need to scan the space using bitmap visit.
|
H A D | semi_space.cc | 220 // Clear the whole card table since we can not Get any additional dirty cards during the 332 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local 333 if (table != nullptr) { 339 table->UpdateAndMarkReferences(MarkHeapReferenceCallback, this); 342 // If the space has no mod union table (the non-moving space and main spaces when the bump 359 // card table) didn't miss any from-space references in the
|
/art/runtime/native/ |
H A D | dalvik_system_VMRuntime.cc | 262 explicit PreloadDexCachesStringsVisitor(StringTable* table) : table_(table) { } argument
|
/art/runtime/mirror/ |
H A D | class.cc | 128 // so that they can grab the new version of the class from the class linker's table. 813 PointerArray* table = GetVTableDuringLinking(); local 814 CHECK(table != nullptr) << PrettyClass(this); 815 const size_t table_length = table->GetLength(); 818 SetEmbeddedVTableEntry(i, table->GetElementPtrSize<ArtMethod*>(i, pointer_size), pointer_size);
|
/art/compiler/dex/quick/ |
H A D | codegen_util.cc | 41 /* Dump a mapping table */ 381 MappingTable table(&encoded_mapping_table_[0]); 383 table.PcToDexSize(), table.PcToDexBegin()); 385 table.DexToPcSize(), table.DexToPcBegin()); 545 // RIP relative to switch table. 557 LOG(INFO) << "Switch table for offset 0x" << std::hex << bx_offset; 559 if (tab_rec->table[0] == Instruction::kSparseSwitchSignature) { 579 DCHECK_EQ(elems, tab_rec->table[ 946 DumpSparseSwitchTable(const uint16_t* table) argument 967 DumpPackedSwitchTable(const uint16_t* table) argument [all...] |
H A D | gen_common.cc | 665 * Array data table format: 667 * ushort width width of each element in the table 668 * uint size number of elements in the table 669 * ubyte data[size*width] table of data values (may contain a single-byte 676 const uint16_t* table = mir_graph_->GetTable(mir, table_offset); local 678 reinterpret_cast<const Instruction::ArrayDataPayload*>(table); 2163 const uint16_t* table = mir_graph_->GetTable(mir, table_offset); local 2164 const uint16_t entries = table[1]; 2166 const int32_t* as_int32 = reinterpret_cast<const int32_t*>(&table[2]); 2213 const uint16_t* table local 2230 const uint16_t* table = mir_graph_->GetTable(mir, table_offset); local 2245 const uint16_t* table = mir_graph_->GetTable(mir, table_offset); local [all...] |
H A D | mir_to_lir.h | 223 const uint16_t* table; // Original dex data. member in struct:art::Mir2Lir::EmbeddedData 668 void DumpSparseSwitchTable(const uint16_t* table); 669 void DumpPackedSwitchTable(const uint16_t* table); 1815 // The source mapping table data (pc -> dex). More entries than in encoded_mapping_table_ 1817 // The encoding mapping table data (dex -> pc offset and pc offset -> dex) with a size prefix.
|
/art/compiler/optimizing/ |
H A D | builder.cc | 77 const uint16_t* table = reinterpret_cast<const uint16_t*>(&instruction) + table_offset; local 79 CHECK_EQ(table[0], static_cast<uint16_t>(Instruction::kSparseSwitchSignature)); 81 CHECK_EQ(table[0], static_cast<uint16_t>(Instruction::kPackedSwitchSignature)); 83 num_entries_ = table[1]; 84 values_ = reinterpret_cast<const int32_t*>(&table[2]); 93 // In a sparse table, we have num_entries_ keys and num_entries_ values, in that order. 96 // In a packed table, we have the starting key and num_entries_ values. 113 // Index of the first value in the table. 116 // In a sparse table, we have num_entries_ keys and num_entries_ values, in that order. 119 // In a packed table, w 1257 BuildSwitchCaseHelper(const Instruction& instruction, size_t index, bool is_last_case, const SwitchTable& table, HInstruction* value, int32_t case_value_int, int32_t target_offset, uint32_t dex_pc) argument [all...] |
/art/runtime/entrypoints/quick/ |
H A D | quick_trampoline_entrypoints.cc | 1892 HandleScope* table = reinterpret_cast<HandleScope*>(reinterpret_cast<uint8_t*>(sp) local 1894 lock = table->GetHandle(0).ToJObject();
|
/art/runtime/gc/ |
H A D | heap.cc | 361 // TODO: Place bump-pointer spaces somewhere to minimize size of card table. 430 // Allocate the card table. 431 ATRACE_BEGIN("Create card table"); 433 CHECK(card_table_.get() != nullptr) << "Failed to create card table"; 440 // Don't add the image mod union table if we are running without an image, this can crash if 443 "Image mod-union table", this, GetImageSpace()); 444 CHECK(mod_union_table != nullptr) << "Failed to create image mod-union table"; 1202 ATRACE_BEGIN("Trimming reference table"); 1220 // Trim globals indirect reference table. 2279 // needed. The zygote space will instead have a mod-union table 3018 accounting::ModUnionTable* table = FindModUnionTableFromSpace(space); local [all...] |