Searched defs:table (Results 1 - 19 of 19) sorted by relevance

/art/compiler/
H A Dgc_map_builder.h29 GcMapBuilder(std::vector<uint8_t>* table, size_t entries, uint32_t max_native_offset, argument
35 in_use_(entries), table_(table) {
36 // Resize table and set up header.
37 table->resize((EntryWidth() * entries) + sizeof(uint32_t));
39 (*table)[0] = native_offset_width_ & 7;
41 (*table)[0] |= (references_width_ << 3) & 0xFF;
42 (*table)[1] = (references_width_ >> 5) & 0xFF;
44 (*table)[2] = entries & 0xFF;
45 (*table)[3] = (entries >> 8) & 0xFF;
89 // Number of entries in the table
[all...]
/art/runtime/
H A Dvmap_table.h32 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 Dmapping_table.h25 // 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 Dintern_table.cc53 os << "Intern table: " << strong_interns_.size() << " strong; "
90 // Note: we deliberately don't visit the weak_interns_ table and the immutable image roots.
102 mirror::String* InternTable::Lookup(Table* table, mirror::String* s) { argument
104 auto it = table->find(GcRoot<mirror::String>(s));
105 if (LIKELY(it != table->end())) {
144 void InternTable::Remove(Table* table, mirror::String* s) { argument
145 auto it = table->find(GcRoot<mirror::String>(s));
146 DCHECK(it != table->end());
147 table->erase(it);
217 // Check the strong table fo
[all...]
H A Dprofiler.h125 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/mips/
H A Dcall_mips.cc35 * for our PIC switch table strategy. To materialize the current location
38 * locate the switch table data and as the reference base for the switch
39 * target offsets stored in the table. We'll use a special pseudo-instruction
41 * switch table offsets (which will happen after final assembly and all
50 * addiu r_base, rRA, <table> - <BaseLabel> ; table relative to BaseLabel
51 addu r_end, r_end, r_base ; end of table
65 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
67 DumpSparseSwitchTable(table);
69 // Add the table t
142 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
224 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
[all...]
/art/compiler/dex/quick/x86/
H A Dcall_x86.cc27 * The sparse table in the literal pool is an array of <key,displacement>
31 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
33 DumpSparseSwitchTable(table);
35 int entries = table[1];
36 const int32_t* keys = reinterpret_cast<const int32_t*>(&table[2]);
64 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
66 DumpPackedSwitchTable(table);
68 // Add the table to the list - we'll process it later
71 tab_rec->table = table;
138 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
[all...]
/art/compiler/dex/
H A Dvreg_analysis.cc406 void MIRGraph::DumpRegLocTable(RegLocation* table, int count) { argument
412 table[i].orig_sreg, storage_name[table[i].location],
413 table[i].wide ? 'W' : 'N', table[i].defined ? 'D' : 'U',
414 table[i].fp ? 'F' : table[i].ref ? 'R' :'C',
415 table[i].is_const ? 'c' : 'n',
416 table[i].high_word ? 'H' : 'L', table[
[all...]
/art/compiler/dex/quick/arm/
H A Dcall_arm.cc28 * The sparse table in the literal pool is an array of <key,displacement>
35 * adr r_base, <table>
47 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
49 DumpSparseSwitchTable(table);
51 // Add the table to the list - we'll process it later
54 tab_rec->table = table;
56 uint32_t size = table[1];
72 // Materialize a pointer to the switch table
95 const uint16_t* table local
151 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
[all...]
/art/compiler/dex/quick/arm64/
H A Dcall_arm64.cc28 * The sparse table in the literal pool is an array of <key,displacement>
32 * adr r_base, <table>
47 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
49 DumpSparseSwitchTable(table);
51 // Add the table to the list - we'll process it later
54 tab_rec->table = table;
56 uint32_t size = table[1];
66 // Materialize a pointer to the switch table
99 const uint16_t* table local
160 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
[all...]
/art/runtime/gc/collector/
H A Dmark_compact.cc201 // Clear the whole card table since we can not Get any additional dirty cards during the
239 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local
240 if (table != nullptr) {
245 table->UpdateAndMarkReferences(MarkHeapReferenceCallback, this);
348 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local
349 if (table != nullptr) {
355 table->UpdateAndMarkReferences(&UpdateHeapReferenceCallback, this);
357 // No mod union table, so we need to scan the space using bitmap visit.
H A Dsemi_space.cc219 // Clear the whole card table since we can not Get any additional dirty cards during the
321 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local
322 if (table != nullptr) {
328 table->UpdateAndMarkReferences(MarkHeapReferenceCallback, this);
331 // If the space has no mod union table (the non-moving space and main spaces when the bump
348 // card table) didn't miss any from-space references in the
/art/runtime/mirror/
H A Dclass.cc136 // so that they can grab the new version of the class from the class linker's table.
830 ObjectArray<ArtMethod>* table = GetImTable(); local
831 if (table != nullptr) {
833 SetEmbeddedImTableEntry(i, table->Get(i));
837 table = GetVTableDuringLinking();
838 CHECK(table != nullptr) << PrettyClass(this);
839 SetEmbeddedVTableLength(table->GetLength());
840 for (int32_t i = 0; i < table->GetLength(); i++) {
841 SetEmbeddedVTableEntry(i, table->Get(i));
/art/runtime/native/
H A Ddalvik_system_VMRuntime.cc221 StringTable& table = *reinterpret_cast<StringTable*>(arg); local
223 table[string->ToModifiedUtf8()] = string;
/art/compiler/dex/quick/
H A Dcodegen_util.cc35 /* Dump a mapping table */
351 MappingTable table(&encoded_mapping_table_[0]);
353 table.PcToDexSize(), table.PcToDexBegin());
355 table.DexToPcSize(), table.DexToPcBegin());
544 LOG(INFO) << "Switch table for offset 0x" << std::hex << bx_offset;
546 if (tab_rec->table[0] == Instruction::kSparseSwitchSignature) {
547 const int32_t* keys = reinterpret_cast<const int32_t*>(&(tab_rec->table[2]));
548 for (int elems = 0; elems < tab_rec->table[
830 const uint16_t* table = tab_rec->table; local
841 const uint16_t* table = tab_rec->table; local
866 DumpSparseSwitchTable(const uint16_t* table) argument
887 DumpPackedSwitchTable(const uint16_t* table) argument
[all...]
H A Dgen_common.cc2012 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
2013 const uint16_t entries = table[1];
2015 const int32_t* as_int32 = reinterpret_cast<const int32_t*>(&table[2]);
2055 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
2057 DumpSparseSwitchTable(table);
2060 const uint16_t entries = table[1];
2070 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset; local
2071 const uint16_t entries = table[1];
2073 const int32_t* keys = reinterpret_cast<const int32_t*>(&table[2]);
2085 const uint16_t* table local
[all...]
H A Dmir_to_lir.h241 const uint16_t* table; // Original dex data. member in struct:art::Mir2Lir::EmbeddedData
691 void DumpSparseSwitchTable(const uint16_t* table);
692 void DumpPackedSwitchTable(const uint16_t* table);
1715 // The encoding mapping table data (dex -> pc offset and pc offset -> dex) with a size prefix.
/art/runtime/entrypoints/quick/
H A Dquick_trampoline_entrypoints.cc1279 void LayoutCalleeSaveFrame(StackReference<mirror::ArtMethod>** m, void* sp, HandleScope** table,
1304 *table = reinterpret_cast<HandleScope*>(sp8_table);
1305 (*table)->SetNumberOfReferences(num_handle_scope_references_);
1323 uint8_t* LayoutJNISaveFrame(StackReference<mirror::ArtMethod>** m, void* sp, HandleScope** table,
1328 LayoutCalleeSaveFrame(m, sp, table, handle_scope_entries);
1341 uint32_t shorty_len, HandleScope** table, uint32_t* handle_scope_entries,
1347 uint8_t* sp8 = LayoutJNISaveFrame(m, reinterpret_cast<void*>(*m), table, handle_scope_entries);
1689 HandleScope* table = reinterpret_cast<HandleScope*>(reinterpret_cast<uint8_t*>(sp) local
1691 lock = table->GetHandle(0).ToJObject();
/art/runtime/gc/
H A Dheap.cc300 // TODO: Place bump-pointer spaces somewhere to minimize size of card table.
359 // Allocate the card table.
361 CHECK(card_table_.get() != NULL) << "Failed to create card table";
365 new accounting::ModUnionTableToZygoteAllocspace("Image mod-union table", this,
367 CHECK(mod_union_table != nullptr) << "Failed to create image mod-union table";
1979 // needed. The zygote space will instead have a mod-union table
1999 // Create the zygote space mod union table.
2001 new accounting::ModUnionTableCardCache("zygote space mod-union table", this, zygote_space);
2002 CHECK(mod_union_table != nullptr) << "Failed to create zygote space mod-union table";
2345 // Attempt to see if the card table misse
2632 accounting::ModUnionTable* table = FindModUnionTableFromSpace(space); local
[all...]

Completed in 278 milliseconds