Searched refs:table (Results 1 - 25 of 54) sorted by relevance

123

/art/runtime/
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 Dclass_table_test.cc84 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 Dtype_lookup_table_test.cc34 std::unique_ptr<TypeLookupTable> table(TypeLookupTable::Create(*dex_file));
35 ASSERT_NE(nullptr, table.get());
36 ASSERT_NE(nullptr, table->RawData());
37 ASSERT_EQ(32U, table->RawDataLength());
43 std::unique_ptr<TypeLookupTable> table(TypeLookupTable::Create(*dex_file));
44 ASSERT_NE(nullptr, table.get());
48 uint32_t class_def_idx = table->Lookup(descriptor, hash);
H A Dquicken_info.h27 // QuickenInfoTable is a table of 16 bit dex indices. There is one slot for every instruction that
58 // Returns true if the dex instruction has an index in the table. (maybe dequickenable).
68 QuickenInfoTable table(data);
69 return table.data_ + table.NumIndices() * 2 - data.data();
H A Dimage-inl.h74 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 Dintern_table.cc59 os << "Intern table: " << StrongSize() << " strong; " << WeakSize() << " weak\n";
88 // Note: we deliberately don't visit the weak_interns_ table and the immutable image roots.
231 // Check the strong table for a match.
253 // There is no match in the strong table, check the weak table.
257 // A match was found in the weak table. Promote to the strong table.
263 // No match in the strong table or the weak table. Insert into the strong / weak table
[all...]
H A Ddebug_print.cc80 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 Dindirect_reference_table.cc37 // 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 Dimt_conflict_table.h30 // 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);
/art/tools/ahat/etc/
H A Dstyle.css32 table td {
38 table th {
/art/tools/ahat/src/main/com/android/ahat/
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 DSizeTable.java25 * 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 DSitePrinter.java35 HeapTable.TableConfig<Site> table = new HeapTable.TableConfig<Site>() {
61 HeapTable.render(doc, query, id, table, snapshot, path);
H A DSiteHandler.java58 HeapTable.TableConfig<Site> table = new HeapTable.TableConfig<Site>() {
80 HeapTable.render(doc, query, SITES_CALLED_ID, table, mSnapshot, children);
84 SizeTable.table(doc, mSnapshot.isDiffed(),
H A DObjectHandler.java97 SizeTable.table(doc, new Column(""), inst != base && !base.isPlaceHolder());
127 doc.table(
171 doc.table(
229 doc.table(new Column("Object"));
241 doc.table(new Column("Object"));
276 HeapTable.TableConfig<PathElement> table = new HeapTable.TableConfig<PathElement>() {
311 HeapTable.render(doc, query, DOMINATOR_PATH_ID, table, mSnapshot, path);
H A DHtmlDoc.java81 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>");
H A DObjectsHandler.java50 SizeTable.table(doc, mSnapshot.isDiffed(),
H A DOverviewHandler.java59 SizeTable.table(doc, new Column("Heap"), mSnapshot.isDiffed());
/art/libdexfile/dex/
H A Dbytecode_utils.h34 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/runtime/gc/accounting/
H A Dmod_union_table_test.cc76 // inside the card cache mod-union table and causes the check
77 // ASSERT_FALSE(table->ContainsCardFor(reinterpret_cast<uintptr_t>(obj3)));
117 // A mod union table that only holds references to a specified target space.
153 name << "Mod union table: " << type;
194 std::unique_ptr<ModUnionTable> table(ModUnionTableFactory::Create(
196 ASSERT_TRUE(table.get() != nullptr);
218 table->ProcessCards();
221 table->UpdateAndMarkReferences(&collector_before);
227 // obj1, obj2 cards should still be in mod union table since they have references to other
229 ASSERT_TRUE(table
[all...]
/art/compiler/dex/
H A Ddex_to_dex_decompiler_test.cc98 ArrayRef<const uint8_t> table; local
100 table = compiled_method->GetVmapTable();
104 table,
/art/compiler/driver/
H A Dcompiled_method_storage.h60 const LengthPrefixedArray<uint8_t>* DeduplicateVMapTable(const ArrayRef<const uint8_t>& table);
61 void ReleaseVMapTable(const LengthPrefixedArray<uint8_t>* table);
H A Dcompiled_method_storage.cc170 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
/art/compiler/optimizing/
H A Dblock_builder.cc111 DexSwitchTable table(instruction, dex_pc);
112 for (DexSwitchTableIterator s_it(table); !s_it.Done(); s_it.Advance()) {
117 if (table.ShouldBuildDecisionTree() && !s_it.IsLast()) {
194 DexSwitchTable table(instruction, dex_pc);
195 for (DexSwitchTableIterator s_it(table); !s_it.Done(); s_it.Advance()) {
199 if (table.ShouldBuildDecisionTree() && !s_it.IsLast()) {
/art/runtime/gc/collector/
H A Dmark_compact.cc177 // 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.

Completed in 326 milliseconds

123