/art/runtime/utils/ |
H A D | dex_cache_arrays_layout.h | 48 return Size() != 0u; 51 size_t Size() const { function in class:art::DexCacheArraysLayout
|
/art/runtime/gc/collector/ |
H A D | immune_region.h | 69 size_t Size() const { function in class:art::gc::collector::ImmuneRegion
|
/art/cmdline/ |
H A D | token_range.h | 154 size_t Size() const { function in struct:art::TokenRange 160 return Size() > 0; 165 assert(offset < Size()); 177 if (Size() != other.Size()) { 186 assert(index >= 0 && static_cast<size_t>(index) < Size()); 196 if (Size() < other.Size()) { 200 auto& smaller = Size() < other.Size() [all...] |
H A D | cmdline_types.h | 411 size_t Size() const { function in struct:art::ParseStringList
|
/art/runtime/ |
H A D | elf_file_impl.h | 76 size_t Size() const { function in class:art::ElfFileImpl 77 return map_->Size();
|
H A D | type_lookup_table.h | 38 uint32_t Size() const { function in class:art::TypeLookupTable
|
H A D | mem_map.h | 143 size_t Size() const { function in class:art::MemMap 151 return Begin() + Size();
|
H A D | transaction.h | 121 size_t Size() const { function in class:art::FINAL::ObjectLog 156 size_t Size() const { function in class:art::FINAL::ArrayLog
|
H A D | oat_file.h | 225 size_t Size() const { function in class:art::OatFile
|
H A D | reference_table.cc | 109 size_t ReferenceTable::Size() const { function in class:art::ReferenceTable
|
H A D | image.h | 55 uint32_t Size() const { function 60 return Offset() + Size();
|
H A D | intern_table.cc | 42 size_t InternTable::Size() const { function in class:art::InternTable 44 return strong_interns_.Size() + weak_interns_.Size(); 49 return strong_interns_.Size(); 54 return weak_interns_.Size(); 182 if (section.Size() > 0) { 505 size_t InternTable::Table::Size() const { function in class:art::InternTable::Table 510 return sum + set.Size();
|
H A D | art_method.h | 640 // Size of an instance of this native class. 641 static size_t Size(size_t pointer_size) { function in class:art::FINAL
|
H A D | elf_file.cc | 533 if (header_->e_phoff >= Size()) { 536 Size(), 540 if (header_->e_shoff >= Size()) { 543 Size(), 1696 if (map == nullptr && map->Size() != EI_NIDENT) { 1746 if (map == nullptr && map->Size() != EI_NIDENT) { 1795 size_t ElfFile::Size() const { function in class:art::ElfFile 1796 DELEGATE_TO_IMPL(Size);
|
H A D | stack_map.h | 29 // Size of a frame slot, in bytes. This constant is a signed value, 34 // Size of Dex virtual registers. 362 size_t Size() const { function in class:art::DexRegisterLocation::DexRegisterLocationCatalog 621 size_t Size() const { function in class:art::DexRegisterLocation::DexRegisterMap 1288 // TODO: Ideally, we would like to use art::DexRegisterLocationCatalog::Size or
|
H A D | dex_file.h | 255 uint32_t Size() const { function in class:art::DexFile::TypeList 264 // Size in bytes of the part of the list that is common. 269 // Size in bytes of the whole type list including all the stored elements. 1141 size_t Size() const { function in class:art::DexFile 1297 size_ = type_list_->Size(); 1301 size_t Size() const { return size_; } function in class:art::DexFileParameterIterator 1595 size_t array_size_; // Size of array.
|
/art/runtime/gc/accounting/ |
H A D | space_bitmap.h | 154 // Size of our internal storage 155 size_t Size() const { function in class:art::gc::accounting::SpaceBitmap 159 // Size in bytes of the memory that the bitmaps spans. 161 return IndexToOffset<uint64_t>(Size() / sizeof(intptr_t)); 220 // Size of this bitmap.
|
H A D | atomic_stack.h | 150 DCHECK_GE(Size(), static_cast<size_t>(n)); 155 return Size() == 0; 159 return Size() == growth_limit_; 162 size_t Size() const { function in class:art::gc::accounting::AtomicStack 239 // Size in number of elements.
|
/art/runtime/gc/space/ |
H A D | large_object_space.h | 90 size_t Size() const { function in class:art::gc::space::LargeObjectSpace
|
H A D | space.h | 295 size_t Size() const { function in class:art::gc::space::ContinuousSpace 374 // Size of the space without a limit on its growth. By default this is just the Capacity, but
|
/art/runtime/base/ |
H A D | variant_map.h | 317 size_t Size() const { function in struct:art::VariantMap
|
H A D | hash_set.h | 300 return Size() == 0; 402 size_t Size() const { function in class:art::HashSet 427 Resize(Size() / max_load_factor_); 430 // Reserve enough room to insert until Size() == num_elements without requiring to grow the hash 463 return static_cast<double>(Size()) / static_cast<double>(NumBuckets()); 507 Resize(Size() / ((min_load_factor_ + max_load_factor_) * 0.5)); 511 // The hash set expands when Size() reaches ElementsUntilExpand(). 602 size_t min_index = static_cast<size_t>(Size() / min_load_factor_); 612 DCHECK_GE(new_size, Size());
|
H A D | arena_allocator.h | 209 size_t Size() const { function in class:art::Arena 214 return Size() - bytes_allocated_;
|
/art/compiler/utils/ |
H A D | assembler.h | 105 CHECK_LE(position, Size() - static_cast<int>(sizeof(T))); 110 CHECK_LE(position, Size() - static_cast<int>(sizeof(T))); 123 DCHECK_LE(oldposition + size, Size()); 124 DCHECK_LE(newposition + size, Size()); 131 fixup->set_position(Size()); 157 size_t Size() const { function in class:art::AssemblerBuffer 182 buffer->ExtendCapacity(buffer->Size() + kMinimumGap); 211 int ComputeGap() { return buffer_->Capacity() - buffer_->Size(); } 223 buffer->ExtendCapacity(buffer->Size() + kMinimumGap); 363 // Size o [all...] |
/art/runtime/gc/allocator/ |
H A D | rosalloc.h | 152 size_t Size() const { function in class:art::gc::allocator::RosAlloc::SlotFreeList 232 if (list->Size() == 0) { 244 size_ = list->Size(); 252 size_ += list->Size(); 430 return free_list_.Size() == numOfSlots[size_bracket_idx_]; 434 return free_list_.Size(); 440 return bulk_free_list_.Size() == 0; 444 return thread_local_free_list_.Size() == 0;
|