/art/openjdkjvmti/ |
H A D | fixed_up_dex_file.h | 63 size_t Size() { function in class:openjdkjvmti::FixedUpDexFile
|
/art/runtime/gc/collector/ |
H A D | immune_region.h | 69 size_t Size() const { function in class:art::gc::collector::ImmuneRegion
|
/art/runtime/utils/ |
H A D | dex_cache_arrays_layout.h | 53 return Size() != 0u; 56 size_t Size() const { function in class:art::DexCacheArraysLayout
|
/art/tools/ahat/src/main/com/android/ahat/heapdump/ |
H A D | Size.java | 26 * Size objects are immutable. 28 public class Size { class 33 * An instance of Size with 0 for all categories. 35 public static Size ZERO = new Size(0, 0); 38 * Constructs a new instance of Size. 44 public Size(long javaSize, long registeredNativeSize) { method in class:Size 86 * Returns a new Size object that is the sum of this size and the other. 91 public Size plus(Size othe [all...] |
/art/cmdline/ |
H A D | token_range.h | 156 size_t Size() const { function in struct:art::TokenRange 162 return Size() > 0; 167 assert(offset < Size()); 179 if (Size() != other.Size()) { 188 assert(index >= 0 && static_cast<size_t>(index) < Size()); 198 if (Size() < other.Size()) { 202 auto& smaller = Size() < other.Size() [all...] |
H A D | cmdline_types.h | 375 size_t Size() const { function in struct:art::ParseStringList
|
/art/runtime/ |
H A D | elf_file_impl.h | 72 size_t Size() const { function in class:art::ElfFileImpl 73 return map_->Size();
|
H A D | type_lookup_table.h | 40 uint32_t Size() const { function in class:art::TypeLookupTable
|
H A D | mem_map.h | 65 // * The range [dest->Begin, dest->Begin() + source->Size()] must not overlap with 173 size_t Size() const { function in class:art::MemMap 181 return Begin() + Size();
|
H A D | transaction.h | 160 size_t Size() const { function in class:art::FINAL::ObjectLog 207 size_t Size() const { function in class:art::FINAL::ArrayLog
|
H A D | reference_table.cc | 116 size_t ReferenceTable::Size() const { function in class:art::ReferenceTable
|
H A D | vdex_file.h | 220 size_t Size() const { return mmap_->Size(); } function in class:art::VdexFile 263 return mmap_->Size() >= sizeof(VerifierDepsHeader) && GetVerifierDepsHeader().IsValid();
|
H A D | intern_table.cc | 43 size_t InternTable::Size() const { function in class:art::InternTable 45 return strong_interns_.Size() + weak_interns_.Size(); 50 return strong_interns_.Size(); 55 return weak_interns_.Size(); 186 if (section.Size() > 0) { 478 size_t InternTable::Table::Size() const { function in class:art::InternTable::Table 483 return sum + set.Size();
|
H A D | oat_file.h | 278 size_t Size() const { function in class:art::OatFile
|
/art/compiler/optimizing/ |
H A D | data_type.h | 76 static constexpr size_t Size(Type type) { function in class:art::DataType::Type
|
H A D | scheduler.h | 296 size_t Size() const { function in class:art::SchedulingGraph 297 return nodes_map_.Size();
|
/art/libdexfile/dex/ |
H A D | dex_file_layout.h | 80 bool Size() const { function in class:art::DexLayoutSection::Subsection
|
/art/runtime/gc/accounting/ |
H A D | atomic_stack.h | 160 DCHECK_GE(Size(), static_cast<size_t>(n)); 165 return Size() == 0; 169 return Size() == growth_limit_; 172 size_t Size() const { function in class:art::gc::accounting::AtomicStack 249 // Size in number of elements.
|
H A D | space_bitmap.h | 171 // Size of our internal storage 172 size_t Size() const { function in class:art::gc::accounting::SpaceBitmap 176 // Size in bytes of the memory that the bitmaps spans. 178 return IndexToOffset<uint64_t>(Size() / sizeof(intptr_t)); 235 // Size of this bitmap.
|
/art/runtime/gc/space/ |
H A D | large_object_space.h | 91 size_t Size() const { function in class:art::gc::space::LargeObjectSpace
|
H A D | space.h | 294 size_t Size() const { function in class:art::gc::space::ContinuousSpace 373 // Size of the space without a limit on its growth. By default this is just the Capacity, but
|
/art/libartbase/base/ |
H A D | variant_map.h | 327 size_t Size() const { function in struct:art::VariantMap
|
H A D | hash_set.h | 304 return Size() == 0; 408 size_t Size() const { function in class:art::HashSet 433 Resize(Size() / max_load_factor_); 436 // Reserve enough room to insert until Size() == num_elements without requiring to grow the hash 469 return static_cast<double>(Size()) / static_cast<double>(NumBuckets()); 513 Resize(Size() / ((min_load_factor_ + max_load_factor_) * 0.5)); 517 // The hash set expands when Size() reaches ElementsUntilExpand(). 608 size_t min_index = static_cast<size_t>(Size() / min_load_factor_); 618 DCHECK_GE(new_size, Size());
|
/art/tools/titrace/ |
H A D | titrace.cc | 81 size_t Size() { function in struct:titrace::TiMemory 160 CHECK_LE(actual_location, bytecode.bytecode_.Size());
|
/art/compiler/utils/ |
H A D | assembler.h | 108 CHECK_LE(position, Size() - static_cast<int>(sizeof(T))); 113 CHECK_LE(position, Size() - static_cast<int>(sizeof(T))); 126 DCHECK_LE(oldposition + size, Size()); 127 DCHECK_LE(newposition + size, Size()); 134 fixup->set_position(Size()); 160 size_t Size() const { function in class:art::AssemblerBuffer 185 buffer->ExtendCapacity(buffer->Size() + kMinimumGap); 214 int ComputeGap() { return buffer_->Capacity() - buffer_->Size(); } 226 buffer->ExtendCapacity(buffer->Size() + kMinimumGap); 363 // Size o [all...] |