HomeSort by relevance Sort by last modified time
    Searched refs:IrtEntry (Results 1 - 3 of 3) sorted by null

  /art/runtime/
indirect_reference_table.h 151 // Try to choose kIRTPrevCount so that sizeof(IrtEntry) is a power of 2.
156 class IrtEntry {
180 static_assert(sizeof(IrtEntry) == (1 + kIRTPrevCount) * sizeof(uint32_t),
181 "Unexpected sizeof(IrtEntry)");
182 static_assert(IsPowerOfTwo(sizeof(IrtEntry)), "Unexpected sizeof(IrtEntry)");
186 IrtIterator(IrtEntry* table, size_t i, size_t capacity) REQUIRES_SHARED(Locks::mutator_lock_)
205 IrtEntry* const table_;
396 IrtEntry* table_;
indirect_reference_table.cc 78 CHECK_LE(max_count, kMaxTableSizeInBytes / sizeof(IrtEntry));
80 const size_t table_bytes = max_count * sizeof(IrtEntry);
88 table_ = reinterpret_cast<IrtEntry*>(table_mem_map_->Begin());
166 static size_t CountNullEntries(const IrtEntry* table, size_t from, size_t to) {
198 static inline void CheckHoleCount(IrtEntry* table,
212 constexpr size_t kMaxEntries = kMaxTableSizeInBytes / sizeof(IrtEntry);
219 const size_t table_bytes = new_size * sizeof(IrtEntry);
233 table_ = reinterpret_cast<IrtEntry*>(table_mem_map_->Begin());
292 IrtEntry* p_scan = &table_[top_index - 1];
indirect_reference_table-inl.h 109 inline void IrtEntry::Add(ObjPtr<mirror::Object> obj) {
117 inline void IrtEntry::SetReference(ObjPtr<mirror::Object> obj) {

Completed in 67 milliseconds