Home
last modified time | relevance | path

Searched refs:table (Results 1 – 25 of 68) sorted by relevance

123

/art/runtime/
Dmapping_table.h32 const uint8_t* table = encoded_table_; in TotalSize() local
33 if (table == nullptr) { in TotalSize()
36 return DecodeUnsignedLeb128(&table); in TotalSize()
41 const uint8_t* table = encoded_table_; in DexToPcSize() local
42 if (table == nullptr) { in DexToPcSize()
45 uint32_t total_size = DecodeUnsignedLeb128(&table); in DexToPcSize()
46 uint32_t pc_to_dex_size = DecodeUnsignedLeb128(&table); in DexToPcSize()
52 const uint8_t* table = encoded_table_; in FirstDexToPcPtr() local
53 if (table != nullptr) { in FirstDexToPcPtr()
54 uint32_t total_size = DecodeUnsignedLeb128(&table); in FirstDexToPcPtr()
[all …]
Dclass_table_test.cc84 ClassTable table; in TEST_F() local
85 EXPECT_EQ(table.NumZygoteClasses(class_loader.Get()), 0u); in TEST_F()
86 EXPECT_EQ(table.NumNonZygoteClasses(class_loader.Get()), 0u); in TEST_F()
89 table.Insert(h_X.Get()); in TEST_F()
90 EXPECT_EQ(table.LookupByDescriptor(h_X.Get()), h_X.Get()); in TEST_F()
91 EXPECT_EQ(table.Lookup(descriptor_x, ComputeModifiedUtf8Hash(descriptor_x)), h_X.Get()); in TEST_F()
92 EXPECT_EQ(table.Lookup("NOT_THERE", ComputeModifiedUtf8Hash("NOT_THERE")), nullptr); in TEST_F()
93 EXPECT_EQ(table.NumZygoteClasses(class_loader.Get()), 0u); in TEST_F()
94 EXPECT_EQ(table.NumNonZygoteClasses(class_loader.Get()), 1u); in TEST_F()
97 table.FreezeSnapshot(); in TEST_F()
[all …]
Dstack_map.cc36 ALWAYS_INLINE static bool DecodeTable(BitTable<Accessor>& table, BitMemoryReader& reader) { in DecodeTable() argument
41 table.Decode(reader2); in DecodeTable()
43 table.Decode(reader); in DecodeTable()
192 auto& table = code_info.*member_pointer; in CollectSizeStats() local
194 bool deduped = DecodeTable(table, reader); in CollectSizeStats()
198 Stats* table_stats = codeinfo_stats->Child(table.GetName()); in CollectSizeStats()
200 const char* const* column_names = table.GetColumnNames(); in CollectSizeStats()
201 for (size_t c = 0; c < table.NumColumns(); c++) { in CollectSizeStats()
202 if (table.NumColumnBits(c) > 0) { in CollectSizeStats()
204 column_stats->AddBits(table.NumRows() * table.NumColumnBits(c), table.NumRows()); in CollectSizeStats()
[all …]
Dintern_table-inl.h81 for (Table::InternalTable& table : tables) { in VisitInterns()
84 (visit_boot_images && table.IsBootImage()) || in VisitInterns()
85 (visit_non_boot_images && !table.IsBootImage()); in VisitInterns()
87 for (auto& intern : table.set_) { in VisitInterns()
102 for (const Table::InternalTable& table : tables) { in CountInterns() local
105 (visit_boot_images && table.IsBootImage()) || in CountInterns()
106 (visit_non_boot_images && !table.IsBootImage()); in CountInterns()
108 ret += table.set_.size(); in CountInterns()
Dintern_table.cc354 for (InternalTable& table : tables_) { in WriteToMemory()
355 for (GcRoot<mirror::String>& string : table.set_) { in WriteToMemory()
366 for (InternalTable& table : tables_) { in Remove()
367 auto it = table.set_.find(GcRoot<mirror::String>(s)); in Remove()
368 if (it != table.set_.end()) { in Remove()
369 table.set_.erase(it); in Remove()
378 for (InternalTable& table : tables_) { in Find()
379 auto it = table.set_.find(GcRoot<mirror::String>(s)); in Find()
380 if (it != table.set_.end()) { in Find()
389 for (InternalTable& table : tables_) { in Find()
[all …]
Dquicken_info.h68 QuickenInfoTable table(data); in SizeInBytes()
69 return table.data_ + table.NumIndices() * 2 - data.data(); in SizeInBytes()
Ddebug_print.cc80 ClassTable* table = Runtime::Current()->GetClassLinker()->ClassTableForClassLoader(loader); in DescribeLoaders() local
82 << "/" << static_cast<const void*>(table); in DescribeLoaders()
87 (table != nullptr) ? table->Lookup(class_descriptor, hash) : nullptr; in DescribeLoaders()
Dimage-inl.h110 auto* table = reinterpret_cast<ImtConflictTable*>(base + section.Offset() + pos); in VisitPackedImtConflictTables() local
111 table->Visit([&visitor](const std::pair<ArtMethod*, ArtMethod*>& methods) { in VisitPackedImtConflictTables()
114 pos += table->ComputeSize(pointer_size); in VisitPackedImtConflictTables()
/art/libartbase/base/
Dbit_table_test.cc40 BitTableBase<1> table(reader); in TEST() local
42 EXPECT_EQ(0u, table.NumRows()); in TEST()
61 BitTableBase<1> table(reader); in TEST() local
63 EXPECT_EQ(4u, table.NumRows()); in TEST()
64 EXPECT_EQ(42u, table.Get(0)); in TEST()
65 EXPECT_EQ(kNoValue, table.Get(1)); in TEST()
66 EXPECT_EQ(1000u, table.Get(2)); in TEST()
67 EXPECT_EQ(kNoValue, table.Get(3)); in TEST()
68 EXPECT_EQ(10u, table.NumColumnBits(0)); in TEST()
84 BitTableBase<1> table(reader); in TEST() local
[all …]
Dmemory_type_table_test.cc294 MemoryTypeTable<int> table = builder.Build(); in TEST() local
295 EXPECT_TRUE(table.Lookup(0x0000u) == nullptr); in TEST()
296 EXPECT_TRUE(table.Lookup(0x0800u) == nullptr); in TEST()
297 EXPECT_TRUE(table.Lookup(0x3000u) == nullptr); in TEST()
298 EXPECT_TRUE(table.Lookup(0x3fffu) == nullptr); in TEST()
299 EXPECT_TRUE(table.Lookup(0x5000u) == nullptr); in TEST()
300 EXPECT_TRUE(table.Lookup(~0u) == nullptr); in TEST()
302 ASSERT_TRUE(table.Lookup(0x1000u) != nullptr); in TEST()
303 ASSERT_TRUE(table.Lookup(0x1fffu) != nullptr); in TEST()
304 EXPECT_EQ(*table.Lookup(0x1000u), MemoryTypeRange<int>(0x1000u, 0x2000u, 0)); in TEST()
[all …]
Dmemory_type_table.h88 MemoryTypeTable(MemoryTypeTable&& table) : ranges_(std::move(table.ranges_)) {} in MemoryTypeTable() argument
90 MemoryTypeTable& operator=(MemoryTypeTable&& table) {
91 ranges_ = std::move(table.ranges_);
152 MemoryTypeTable table; in Build() local
154 table.ranges_.push_back(it.second); in Build()
156 return table; in Build()
186 std::ostream& operator<<(std::ostream& os, const MemoryTypeTable<T>& table) {
187 table.Print(os);
Dbit_table.h112 BitTableAccessor(const BitTableBase<kNumColumns>* table, uint32_t row) in BitTableAccessor() argument
113 : table_(table), row_(row) { in BitTableAccessor()
164 const_iterator(const BitTable* table, uint32_t row) : table_(table), row_(row) {} in const_iterator() argument
375 BitTableBase<kNumColumns> table; in Encode() local
377 table.Decode(reader); in Encode()
378 DCHECK_EQ(size(), table.NumRows()); in Encode()
380 DCHECK_EQ(column_bits[c], table.NumColumnBits(c)); in Encode()
384 DCHECK_EQ(rows_[r][c], table.Get(r, c)) << " (" << r << ", " << c << ")"; in Encode()
461 BitTableBase<1> table; in Encode() local
463 table.Decode(reader); in Encode()
[all …]
/art/libdexfile/dex/
Dtype_lookup_table_test.cc33 TypeLookupTable table = TypeLookupTable::Create(*dex_file); in TEST_F() local
34 ASSERT_TRUE(table.Valid()); in TEST_F()
35 ASSERT_NE(nullptr, table.RawData()); in TEST_F()
36 ASSERT_EQ(32U, table.RawDataLength()); in TEST_F()
41 TypeLookupTable table(TypeLookupTable::Create(*dex_file)); in TEST_P() local
42 ASSERT_TRUE(table.Valid()); in TEST_P()
46 uint32_t class_def_idx = table.Lookup(descriptor, hash); in TEST_P()
Dbytecode_utils.h34 const uint16_t* table = reinterpret_cast<const uint16_t*>(&instruction) + table_offset; in DexSwitchTable() local
35 DCHECK_EQ(table[0], sparse_ ? static_cast<uint16_t>(Instruction::kSparseSwitchSignature) in DexSwitchTable()
37 num_entries_ = table[1]; in DexSwitchTable()
38 values_ = reinterpret_cast<const int32_t*>(&table[2]); in DexSwitchTable()
106 explicit DexSwitchTableIterator(const DexSwitchTable& table) in DexSwitchTableIterator() argument
107 : table_(table), in DexSwitchTableIterator()
/art/runtime/gc/accounting/
Dmod_union_table_test.cc195 std::unique_ptr<ModUnionTable> table(ModUnionTableFactory::Create( in RunTest() local
197 ASSERT_TRUE(table.get() != nullptr); in RunTest()
219 table->ProcessCards(); in RunTest()
222 table->UpdateAndMarkReferences(&collector_before); in RunTest()
230 ASSERT_TRUE(table->ContainsCardFor(reinterpret_cast<uintptr_t>(obj1))); in RunTest()
231 ASSERT_TRUE(table->ContainsCardFor(reinterpret_cast<uintptr_t>(obj2))); in RunTest()
234 ASSERT_FALSE(table->ContainsCardFor(reinterpret_cast<uintptr_t>(obj3))); in RunTest()
235 ASSERT_FALSE(table->ContainsCardFor(reinterpret_cast<uintptr_t>(obj4))); in RunTest()
239 table->Verify(); in RunTest()
243 table->Dump(oss); in RunTest()
[all …]
/art/tools/ahat/src/main/com/android/ahat/
DSizeTable.java44 static void table(Doc doc, Column left, boolean showDiff, Column... columns) { in table() method in SizeTable
54 doc.table(cols.toArray(new Column[cols.size()])); in table()
85 static void table(Doc doc, boolean showDiff, Column... columns) { in table() method in SizeTable
88 table(doc, new Column("", Column.Align.LEFT, false), showDiff, columns); in table()
DDoc.java58 void table(Column... columns); in table() method
71 void table(DocString description, List<Column> subcols, List<Column> cols); in table() method
DSitePrinter.java35 HeapTable.TableConfig<Site> table = new HeapTable.TableConfig<Site>() { in printSite() local
61 HeapTable.render(doc, query, id, table, snapshot, path); in printSite()
DSiteHandler.java58 HeapTable.TableConfig<Site> table = new HeapTable.TableConfig<Site>() { in handle() local
80 HeapTable.render(doc, query, SITES_CALLED_ID, table, mSnapshot, children); in handle()
84 SizeTable.table(doc, mSnapshot.isDiffed(), in handle()
/art/dex2oat/dex/
Ddex_to_dex_decompiler_test.cc90 ArrayRef<const uint8_t> table; in RunTest() local
92 table = compiled_method->GetVmapTable(); in RunTest()
96 table, in RunTest()
/art/test/098-ddmc/
Dexpected.txt2 …ry header len: 9 stack frame len: 8 number of entries: 0 offset to string table from start of mess…
14 …ry header len: 9 stack frame len: 8 number of entries: 0 offset to string table from start of mess…
23 …ry header len: 9 stack frame len: 8 number of entries: 0 offset to string table from start of mess…
/art/test/1911-get-local-var-table/
Dinfo.txt1 Tests getting local variable table from JVMTI
/art/tools/ahat/etc/
Dstyle.css32 table td {
38 table th {
/art/test/423-invoke-interface/
Dinfo.txt2 a conflict in our imt table.
/art/test/589-super-imt/
Dinfo.txt2 subclass won't use the ImtConflictTable table of its super class.

123