/art/compiler/utils/ |
H A D | dex_cache_arrays_layout.h | 43 return Size() != 0u; 46 size_t Size() const { function in class:art::DexCacheArraysLayout
|
H A D | growable_array.h | 87 DCHECK(index <= Size()); 89 for (size_t i = Size() - 1; i > index; --i) { 144 size_t Size() const { return num_used_; } function in class:art::GrowableArray
|
H A D | assembler.h | 193 CHECK_LE(position, Size() - static_cast<int>(sizeof(T))); 198 CHECK_LE(position, Size() - static_cast<int>(sizeof(T))); 206 size_t nbytes = Size() - oldposition; 214 fixup->set_position(Size()); 240 size_t Size() const { function in class:art::AssemblerBuffer 294 int ComputeGap() { return buffer_->Capacity() - buffer_->Size(); } 382 // Size of generated code 383 virtual size_t CodeSize() const { return buffer_.Size(); }
|
/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 | 410 size_t Size() const { function in struct:art::ParseStringList
|
/art/runtime/ |
H A D | vmap_table.h | 47 size_t Size() const { function in class:art::VmapTable
|
H A D | elf_file_impl.h | 68 size_t Size() const { function in class:art::ElfFileImpl 69 return map_->Size();
|
H A D | mem_map.h | 113 size_t Size() const { function in class:art::MemMap 121 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 | 228 size_t Size() const { function in class:art::FINAL
|
H A D | reference_table.cc | 109 size_t ReferenceTable::Size() const { function in class:art::ReferenceTable
|
H A D | image.h | 38 uint32_t Size() const { function 43 return Offset() + Size();
|
H A D | intern_table.cc | 38 size_t InternTable::Size() const { function in class:art::InternTable 40 return strong_interns_.Size() + weak_interns_.Size(); 45 return strong_interns_.Size(); 50 return weak_interns_.Size(); 158 if (section.Size() > 0) { 302 CHECK_LE(offset, intern_section.Size()); 335 CHECK_EQ(pre_zygote_table_.Size(), 0u); 372 VLOG(heap) << "Swapping " << pre_zygote_table_.Size() << " interns to the pre zygote table"; 415 size_t InternTable::Table::Size() cons function in class:art::InternTable::Table [all...] |
H A D | elf_file.cc | 587 if (header_->e_phoff >= Size()) { 590 Size(), 594 if (header_->e_shoff >= Size()) { 597 Size(), 1493 jit_gdb_entry_ = CreateCodeEntry(all.Begin(), all.Size()); 1780 if (map == nullptr && map->Size() != EI_NIDENT) { 1814 if (map == nullptr && map->Size() != EI_NIDENT) { 1855 size_t ElfFile::Size() const { function in class:art::ElfFile 1856 DELEGATE_TO_IMPL(Size);
|
H A D | stack_map.h | 26 // Size of a frame slot, in bytes. This constant is a signed value, 31 // Size of Dex virtual registers. 396 size_t Size() const { function in class:art::DexRegisterLocation::DexRegisterLocationCatalog 640 size_t Size() const { function in class:art::DexRegisterLocation::DexRegisterMap 1052 // TODO: Ideally, we would like to use art::DexRegisterLocationCatalog::Size or
|
H A D | dex_file.h | 240 uint32_t Size() const { function in class:art::DexFile::TypeList 249 // Size in bytes of the part of the list that is common. 254 // Size in bytes of the whole type list including all the stored elements. 891 size_t Size() const { function in class:art::DexFile 1070 size_ = type_list_->Size(); 1345 size_t array_size_; // Size of array.
|
H A D | debugger.cc | 4532 JDWP::Write1BE(&p_, 8); // Size of allocation unit, in bytes. 5012 size_t Size() const { function in class:art::StringTable 5139 JDWP::Append2BE(bytes, class_names.Size()); 5140 JDWP::Append2BE(bytes, method_names.Size()); 5141 JDWP::Append2BE(bytes, filenames.Size());
|
/art/runtime/gc/accounting/ |
H A D | space_bitmap.h | 153 // Size of our internal storage 154 size_t Size() const { function in class:art::gc::accounting::SpaceBitmap 158 // Size in bytes of the memory that the bitmaps spans. 160 return IndexToOffset<uint64_t>(Size() / sizeof(intptr_t)); 219 // Size of this bitmap.
|
H A D | atomic_stack.h | 151 DCHECK_GE(Size(), static_cast<size_t>(n)); 156 return Size() == 0; 159 size_t Size() const { function in class:art::gc::accounting::AtomicStack 236 // 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/compiler/utils/arm/ |
H A D | assembler_thumb2.h | 516 enum Size { enum in class:art::arm::FINAL::Branch 556 Size newsize = CalculateSize(); 589 Size newsize = CalculateSize(); 597 Size GetSize() const { 626 void ResetSize(Size size) { 632 Size CalculateSize() const { 681 Size size_; 689 Branch::Size AddBranch(Branch::Type type, uint32_t location, uint32_t target,
|
/art/runtime/base/ |
H A D | variant_map.h | 313 size_t Size() const { function in struct:art::VariantMap
|
H A D | arena_allocator.h | 133 size_t Size() const { function in class:art::Arena 138 return Size() - bytes_allocated_;
|
H A D | hash_set.h | 240 return Size() == 0; 337 size_t Size() const { function in class:art::HashSet 342 Resize(Size() / max_load_factor_); 365 return static_cast<double>(Size()) / static_cast<double>(NumBuckets()); 466 size_t min_index = static_cast<size_t>(Size() / min_load_factor_); 478 DCHECK_GE(new_size, Size());
|