Searched refs:entries_ (Results 1 - 12 of 12) sorted by relevance
/art/runtime/ |
H A D | type_lookup_table.cc | 37 entries_.release(); 75 entries_(storage != nullptr ? reinterpret_cast<Entry*>(storage) : new Entry[mask_ + 1]), 112 entries_(reinterpret_cast<Entry*>(const_cast<uint8_t*>(raw_data))), 117 if (!entries_[pos].IsEmpty()) { 120 entries_[pos] = entry; 121 entries_[pos].next_pos_delta = 0; 128 while (!entries_[next_pos].IsEmpty()) { 132 entries_[pos].next_pos_delta = delta; 133 entries_[next_pos] = entry; 134 entries_[next_po [all...] |
H A D | type_lookup_table.h | 48 const Entry* entry = &entries_[pos]; 57 entry = &entries_[pos]; 70 return reinterpret_cast<const uint8_t*>(entries_.get()); 159 std::unique_ptr<Entry[]> entries_; member in class:art::TypeLookupTable 160 // owns_entries_ specifies if the lookup table owns the entries_ array.
|
H A D | reference_table.cc | 36 entries_.reserve(initial_size); 45 if (entries_.size() >= max_size_) { 49 entries_.push_back(GcRoot<mirror::Object>(obj)); 54 for (int i = entries_.size() - 1; i >= 0; --i) { 55 mirror::Object* entry = entries_[i].Read(); 57 entries_.erase(entries_.begin() + i); 110 return entries_.size(); 115 Dump(os, entries_); 303 for (GcRoot<mirror::Object>& root : entries_) { [all...] |
H A D | reference_table.h | 63 Table entries_; member in class:art::ReferenceTable
|
H A D | dex_file.h | 387 uint32_t entries_[1]; member in struct:art::DexFile::AnnotationSetItem 958 uint32_t offset = set_item->entries_[index];
|
H A D | dex_file_verifier.cc | 2107 const uint32_t* offsets = set->entries_;
|
/art/runtime/verifier/ |
H A D | reg_type_cache.cc | 54 entries_.push_back(UndefinedType::GetInstance()); 55 entries_.push_back(ConflictType::GetInstance()); 56 entries_.push_back(BooleanType::GetInstance()); 57 entries_.push_back(ByteType::GetInstance()); 58 entries_.push_back(ShortType::GetInstance()); 59 entries_.push_back(CharType::GetInstance()); 60 entries_.push_back(IntegerType::GetInstance()); 61 entries_.push_back(LongLoType::GetInstance()); 62 entries_.push_back(LongHiType::GetInstance()); 63 entries_ [all...] |
H A D | reg_type_cache-inl.h | 31 DCHECK_LT(id, entries_.size()); 32 const RegType* result = entries_[id]; 124 entries_.push_back(new_entry);
|
H A D | reg_type_cache.h | 89 return entries_.size(); 194 ScopedArenaVector<const RegType*> entries_; member in class:art::verifier::RegTypeCache
|
/art/runtime/gc/ |
H A D | allocation_record.h | 226 if (entries_.size() == alloc_record_max_) { 227 entries_.pop_front(); 229 entries_.push_back(EntryPair(GcRoot<mirror::Object>(obj), std::move(record))); 233 return entries_.size(); 238 size_t sz = entries_.size(); 266 // TODO: Is there a better way to hide the entries_'s type? 270 return entries_.begin(); 276 return entries_.end(); 282 return entries_.rbegin(); 288 return entries_ [all...] |
H A D | allocation_record.cc | 102 // Only visit the last recent_record_max_ number of allocation records in entries_ and mark the 104 for (auto it = entries_.rbegin(), end = entries_.rend(); it != end; ++it) { 141 const size_t delete_bound = std::max(entries_.size(), recent_record_max_) - recent_record_max_; 142 for (auto it = entries_.begin(), end = entries_.end(); it != end;) { 154 it = entries_.erase(it); 312 entries_.clear();
|
/art/compiler/debug/dwarf/ |
H A D | debug_info_entry_writer.h | 204 : Writer<Vector>(&entries_), 206 entries_(alloc), 217 Vector entries_; member in class:art::dwarf::FINAL
|
Completed in 1888 milliseconds