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

/art/runtime/
H A Dimage-inl.h72 auto* table = reinterpret_cast<ImtConflictTable*>(base + section.Offset() + pos); local
73 table->Visit([&visitor](const std::pair<ArtMethod*, ArtMethod*>& methods) {
76 pos += table->ComputeSize(pointer_size);
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 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.
276 // If the given method has an entry in the profile table it updates the data
H A Dart_method.h48 // Table to resolve IMT conflicts at runtime. The table is attached to
50 // The table contains a list of pairs of { interface_method, implementation_method }
61 // Build a new table copying `other` and adding the new entry formed of
159 // Compute the number of entries in this table.
168 // Compute the size in bytes taken by this table.
174 // Compute the size in bytes needed for copying the given `table` and add
176 static size_t ComputeSizeWithOneMoreEntry(ImtConflictTable* table, size_t pointer_size) { argument
177 return table->ComputeSize(pointer_size) + EntrySize(pointer_size);
527 ALWAYS_INLINE void SetImtConflictTable(ImtConflictTable* table, size_t pointer_size) { argument
528 SetEntryPointFromJniPtrSize(table, pointer_siz
[all...]
H A Dclass_linker.cc1196 explicit VerifyClassInTableArtMethodVisitor(ClassTable* table) : table_(table) {} argument
1240 // Add image classes into the class table for the class loader, and fixup the dex caches and
1243 ClassTable* table = InsertClassTableForClassLoader(class_loader.Get()); local
1369 mirror::Class* existing = table->LookupByDescriptor(klass);
1373 table->Insert(klass);
1376 table->Insert(klass);
1417 DCHECK_EQ(table->LookupByDescriptor(klass), klass);
1420 CHECK_EQ(table->LookupByDescriptor(super_class), super_class);
1752 // If we have a class table sectio
3261 ClassTable* table; local
5193 ClassTable* const table = InsertClassTableForClassLoader(class_loader); local
6331 ImtConflictTable* table = imt[imt_index]->GetImtConflictTable(image_pointer_size_); local
8236 ClassTable* const table = ClassTableForClassLoader(class_loader); local
[all...]
/art/tools/ahat/src/
H A DDoc.java51 * 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 DHtmlDoc.java81 public void table(Column... columns) { method in class:HtmlDoc
87 ps.println("<table>");
98 public void table(DocString description, List<Column> subcols, List<Column> cols) { method in class:HtmlDoc
110 ps.println("<table>");
133 throw new IllegalStateException("table method must be called before row");
155 ps.println("<table>");
165 ps.println("</table>");
/art/compiler/driver/
H A Dcompiled_method_storage.cc175 dedupe_src_mapping_table_("dedupe source mapping table",
177 dedupe_vmap_table_("dedupe vmap table",
196 os << "\nVmap table dedupe: " << dedupe_vmap_table_.DumpStats(self);
220 const ArrayRef<const uint8_t>& table) {
221 return AllocateOrDeduplicateArray(table, &dedupe_vmap_table_);
224 void CompiledMethodStorage::ReleaseVMapTable(const LengthPrefixedArray<uint8_t>* table) { argument
225 ReleaseArrayIfNotDeduplicated(table);
219 DeduplicateVMapTable( const ArrayRef<const uint8_t>& table) argument
/art/compiler/optimizing/
H A Dbytecode_utils.h62 const uint16_t* table = reinterpret_cast<const uint16_t*>(&instruction) + table_offset; local
63 DCHECK_EQ(table[0], sparse_ ? static_cast<uint16_t>(Instruction::kSparseSwitchSignature)
65 num_entries_ = table[1];
66 values_ = reinterpret_cast<const int32_t*>(&table[2]);
75 // In a sparse table, we have num_entries_ keys and num_entries_ values, in that order.
78 // In a packed table, we have the starting key and num_entries_ values.
95 // Index of the first value in the table.
98 // In a sparse table, we have num_entries_ keys and num_entries_ values, in that order.
101 // In a packed table, we have the starting key and num_entries_ values.
116 // Whether this is a sparse-switch table (o
134 DexSwitchTableIterator(const DexSwitchTable& table) argument
[all...]
/art/runtime/gc/collector/
H A Dmark_compact.cc170 // Clear the whole card table since we cannot get any additional dirty cards during the
209 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local
210 if (table != nullptr) {
215 table->UpdateAndMarkReferences(this);
344 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local
345 if (table != nullptr) {
351 table->UpdateAndMarkReferences(this);
353 // No mod union table, so we need to scan the space using bitmap visit.
H A Dsemi_space.cc230 // Clear the whole card table since we cannot get any additional dirty cards during the
337 accounting::ModUnionTable* table = heap_->FindModUnionTableFromSpace(space); local
338 if (table != nullptr) {
344 table->UpdateAndMarkReferences(this);
348 // If the space has no mod union table (the non-moving space, app image spaces, main spaces
379 // card table) didn't miss any from-space references in the
/art/runtime/native/
H A Ddalvik_system_VMRuntime.cc269 explicit PreloadDexCachesStringsVisitor(StringTable* table) : table_(table) { } argument
/art/runtime/mirror/
H A Dclass.cc117 // so that they can grab the new version of the class from the class linker's table.
918 PointerArray* table = GetVTableDuringLinking(); local
919 CHECK(table != nullptr) << PrettyClass(this);
920 const size_t table_length = table->GetLength();
923 SetEmbeddedVTableEntry(i, table->GetElementPtrSize<ArtMethod*>(i, pointer_size), pointer_size);
/art/runtime/entrypoints/quick/
H A Dquick_trampoline_entrypoints.cc2031 HandleScope* table = reinterpret_cast<HandleScope*>(reinterpret_cast<uint8_t*>(sp) + sizeof(*sp)); local
2032 return GenericJniMethodEnd(self, cookie, result, result_f, called, table);
2224 // We create a new table with the new pair { interface_method, method }.
/art/runtime/gc/space/
H A Dimage_space.cc907 ImtConflictTable* table = method->GetImtConflictTable(pointer_size_); variable
908 if (table != nullptr) {
909 ImtConflictTable* new_table = ForwardObject(table);
910 if (table != new_table) {
/art/compiler/
H A Dimage_writer.cc541 // Add non-embedded vtable to the pointer array table if there is one.
732 // Circular dependencies, return false but do not store the result in the memoization table.
847 // Clear class table strong roots so that dex caches can get pruned. We require pruning the class
900 // Check that the class is still in the classes table.
902 << PrettyClass(declaring_class) << " not in class linker table";
965 // If we found it in the runtime intern table it could either be in the boot image or interned
1078 // Not in another image space, insert to our table.
1101 // Note: This table is only accessed from the image writer, avoid locking to prevent lock
1194 // Register the class loader if it has a class table.
1224 // If the method is a conflict method we also want to assign the conflict table offse
1236 TryAssignConflictTableOffset(ImtConflictTable* table, size_t oat_index) argument
1820 ClassTable* table = image_info.class_table_.get(); local
[all...]
/art/compiler/utils/arm/
H A Dassembler_thumb2.cc117 for (JumpTable& table : jump_tables_) {
118 Label* label = table.GetLabel();
120 code_size += table.GetSize();
196 for (JumpTable& table : jump_tables_) {
197 Label* label = table.GetLabel();
267 for (JumpTable& table : jump_tables_) {
270 size_t required_capacity = orig_size + table.GetSize();
278 DCHECK_EQ(static_cast<size_t>(table.GetLabel()->Position()), buffer_.Size());
279 int32_t anchor_position = table.GetAnchorLabel()->Position() + 4;
281 for (Label* target : table
3852 JumpTable* table = &jump_tables_.back(); local
[all...]
/art/oatdump/
H A Doatdump.cc595 // Print lookup table, if it exists.
600 os << StringPrintf("type-table: 0x%08x..0x%08x\n",
882 "vmap table offset 0x%08x is past end of file 0x%08zx. "
883 "vmap table offset was loaded from offset 0x%08x.\n",
1003 // The optimizing compiler outputs its CodeInfo data in the vmap table.
1012 // We don't encode the size in the table, so just emit that we have quickened
1103 // null, and the vmap table is not null, then this method has been compiled
1228 // The optimizing compiler outputs its CodeInfo data in the vmap table.
1495 // Intern table is 8-byte aligned.
1500 // Add space between intern table an
1816 ImtConflictTable* table = method->GetImtConflictTable(image_header_.GetPointerSize()); local
1818 indent_os << "IMT conflict table " << table << " method: "; local
[all...]
/art/runtime/gc/
H A Dheap.cc451 // TODO: Place bump-pointer spaces somewhere to minimize size of card table.
519 // Allocate the card table.
520 // We currently don't support dynamically resizing the card table.
521 // Since we don't know where in the low_4gb the app image will be located, make the card table
522 // cover the whole low_4gb. TODO: Extend the card table in AddSpace.
529 CHECK(card_table_.get() != nullptr) << "Failed to create card table";
535 // Don't add the image mod union table if we are running without an image, this can crash if
539 "Image mod-union table", this, image_space);
540 CHECK(mod_union_table != nullptr) << "Failed to create image mod-union table";
1412 // Trim globals indirect reference table
3287 accounting::ModUnionTable* table = FindModUnionTableFromSpace(space); local
[all...]

Completed in 552 milliseconds