Home
last modified time | relevance | path

Searched refs:table_ (Results 1 – 10 of 10) sorted by relevance

/art/runtime/
Dmapping_table.h69 table_(table), element_(element), end_(table_->DexToPcSize()), encoded_table_ptr_(nullptr), in DexToPcIterator()
73 encoded_table_ptr_ = table_->FirstDexToPcPtr(); in DexToPcIterator()
79 DCHECK_EQ(table_->DexToPcSize(), element); in DexToPcIterator()
97 CHECK(table_ == rhs.table_);
101 CHECK(table_ == rhs.table_);
106 const MappingTable* const table_; // The original table.
146 table_(table), element_(element), end_(table_->PcToDexSize()), encoded_table_ptr_(nullptr), in PcToDexIterator()
150 encoded_table_ptr_ = table_->FirstPcToDexPtr(); in PcToDexIterator()
156 DCHECK_EQ(table_->PcToDexSize(), element); in PcToDexIterator()
174 CHECK(table_ == rhs.table_);
[all …]
Dindirect_reference_table.cc92 table_ = reinterpret_cast<IrtEntry*>(table_mem_map_.Begin()); in IndirectReferenceTable()
94 table_ = nullptr; in IndirectReferenceTable()
184 size_t count = CountNullEntries(table_, prev_state.top_index, top_index); in RecoverHoles()
235 table_ = reinterpret_cast<IrtEntry*>(table_mem_map_.Begin()); in Resize()
255 DCHECK(table_ != nullptr); in Add()
291 CheckHoleCount(table_, current_num_holes_, previous_state, segment_state_); in Add()
301 IrtEntry* p_scan = &table_[top_index - 1]; in Add()
305 DCHECK_GE(p_scan, table_ + previous_state.top_index); in Add()
308 index = p_scan - table_; in Add()
315 table_[index].Add(obj); in Add()
[all …]
Dindirect_reference_table.h188 : table_(table), i_(i), capacity_(capacity) { in IrtIterator()
200 return table_[i_].GetReference(); in REQUIRES_SHARED()
204 return (i_ == rhs.i_ && table_ == rhs.table_); in equals()
208 IrtEntry* const table_;
303 return IrtIterator(table_, 0, Capacity()); in begin()
307 return IrtIterator(table_, Capacity(), Capacity()); in end()
380 uint32_t serial = table_[table_index].GetSerial(); in ToIndirectRef()
403 IrtEntry* table_; variable
Dindirect_reference_table-inl.h59 if (UNLIKELY(table_[idx].GetReference()->IsNull())) { in GetChecked()
95 ObjPtr<mirror::Object> obj = table_[idx].GetReference()->Read<kReadBarrierOption>(); in Get()
106 table_[idx].SetReference(obj); in Update()
Ddebugger.cc4925 if (table_.find(entry) != table_.end()) { in Add()
4937 table_.insert(entry); in Add()
4949 for (auto& entry : table_) { in Finish()
4958 auto it = table_.find(entry); in IndexOf()
4959 if (it == table_.end()) { in IndexOf()
4966 return table_.size(); in Size()
4972 for (const auto& entry : table_) { in WriteTo()
4983 std::unordered_set<Entry, EntryHash> table_; member in art::StringTable
/art/libdexfile/dex/
Dbytecode_utils.h107 : table_(table), in DexSwitchTableIterator()
108 num_entries_(static_cast<size_t>(table_.GetNumEntries())), in DexSwitchTableIterator()
109 first_target_offset_(table_.GetFirstValueIndex()), in DexSwitchTableIterator()
121 return table_.IsSparse() ? table_.GetEntryAt(index_) : table_.GetEntryAt(0) + index_; in CurrentKey()
125 return table_.GetEntryAt(index_ + first_target_offset_); in CurrentTargetOffset()
128 uint32_t GetDexPcForCurrentIndex() const { return table_.GetDexPcForIndex(index_); } in GetDexPcForCurrentIndex()
131 const DexSwitchTable& table_;
Dcompact_offset_table.cc29 : table_(reinterpret_cast<const uint32_t*>(data_begin + table_offset)), in Accessor()
39 const uint32_t offset = table_[index / kElementsPerIndex]; in GetOffset()
Dcompact_offset_table.h49 const uint32_t* const table_;
/art/libartbase/base/
Dbit_table.h113 : table_(table), row_(row) { in BitTableAccessor()
114 DCHECK(table_ != nullptr); in BitTableAccessor()
119 ALWAYS_INLINE bool IsValid() const { return row_ < table_->NumRows(); } in IsValid()
122 return this->table_ == other.table_ && this->row_ == other.row_; in Equals()
134 ALWAYS_INLINE uint32_t Get##NAME() const { return table_->Get(row_, COLUMN); } \
141 const BitTableBase<kNumColumns>* table_ = nullptr;
164 const_iterator(const BitTable* table, uint32_t row) : table_(table), row_(row) {} in const_iterator()
165 const_iterator operator+(difference_type n) { return const_iterator(table_, row_ + n); }
166 const_iterator operator-(difference_type n) { return const_iterator(table_, row_ - n); }
170 const_iterator operator++() { return const_iterator(table_, ++row_); }
[all …]
/art/runtime/native/
Ddalvik_system_VMRuntime.cc362 explicit PreloadDexCachesStringsVisitor(StringTable* table) : table_(table) { } in PreloadDexCachesStringsVisitor()
367 table_->operator[](string->ToModifiedUtf8()) = string; in VisitRoot()
371 StringTable* const table_; member in art::PreloadDexCachesStringsVisitor