Searched refs:Size (Results 1 - 25 of 126) sorted by relevance

123456

/art/runtime/
H A Dreference_table_test.cc42 EXPECT_EQ(0U, rt.Size());
47 EXPECT_EQ(0U, rt.Size());
51 EXPECT_EQ(0U, rt.Size());
56 EXPECT_EQ(1U, rt.Size());
67 EXPECT_EQ(i + 2, rt.Size());
86 EXPECT_EQ(10U, rt.Size());
95 EXPECT_EQ(9 - i, rt.Size());
H A Dimage-inl.h53 for (size_t pos = 0; pos < section.Size();) {
71 for (size_t pos = 0; pos < section.Size(); ) {
H A Dintern_table_test.cc51 TEST_F(InternTableTest, Size) {
54 EXPECT_EQ(0U, t.Size());
60 EXPECT_EQ(1U, t.Size());
62 EXPECT_EQ(2U, t.Size());
105 EXPECT_EQ(4U, t.Size());
116 EXPECT_EQ(2U, t.Size());
122 EXPECT_EQ(3U, t.Size());
H A Dimage.cc147 return os << "size=" << section.Size() << " range=" << section.Offset() << "-" << section.End();
152 for (size_t pos = 0; pos < fields.Size(); ) {
165 const size_t method_size = ArtMethod::Size(pointer_size);
167 for (size_t pos = 0; pos < methods.Size(); ) {
175 for (size_t pos = 0; pos < runtime_methods.Size(); ) {
H A Dreference_table.h48 size_t Size() const;
H A Ddex_file-inl.h99 uint32_t params_size = params->Size();
100 DCHECK_EQ(params_size, rhs_params->Size()); // Parameter list size must match.
H A Dintern_table.cc42 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 Dmem_map.h143 size_t Size() const { function in class:art::MemMap
151 return Begin() + Size();
H A Delf_file.h60 size_t Size() const;
H A Doat_file.cc323 if (UNLIKELY(dex_file_offset > Size())) {
330 Size());
333 if (UNLIKELY(Size() - dex_file_offset < sizeof(DexFile::Header))) {
340 Size(),
365 if (Size() - dex_file_offset < header->file_size_) {
373 Size());
386 if (UNLIKELY(class_offsets_offset > Size()) ||
387 UNLIKELY((Size() - class_offsets_offset) / sizeof(uint32_t) < header->class_defs_size_)) {
394 Size(),
423 (UNLIKELY(lookup_table_offset > Size()) ||
[all...]
/art/runtime/base/
H A Dvariant_map_test.cc70 EXPECT_EQ(size_t(2), fm.Size());
77 EXPECT_EQ(size_t(0), fm.Size());
102 EXPECT_EQ(size_t(0), fmEmpty.Size());
108 EXPECT_EQ(size_t(2), fmFilled.Size());
112 EXPECT_EQ(size_t(0), fmEmptyCopy.Size());
116 EXPECT_EQ(size_t(2), fmFilledCopy.Size());
123 EXPECT_EQ(size_t(2), fmFilledCopy2.Size());
129 EXPECT_EQ(size_t(0), fmFilledCopy.Size());
130 EXPECT_EQ(size_t(2), fmMoved.Size());
139 EXPECT_EQ(size_t(0), fmFilledCopy2.Size());
[all...]
H A Dhash_set_test.cc70 ASSERT_EQ(hash_set.Size(), 0U);
77 ASSERT_EQ(hash_set.Size(), 0U);
94 ASSERT_EQ(strings.size(), hash_set.Size());
231 ASSERT_EQ(hash_set.Size(), std_set.size());
233 static_cast<ssize_t>(hash_set.Size()));
346 while (hash_set.Size() < size) {
347 hash_set.Insert(std::to_string(hash_set.Size()));
H A Darena_allocator.cc123 malloc_bytes += arena->Size();
179 size_ = map_->Size();
236 if (free_arenas_ != nullptr && LIKELY(free_arenas_->Size() >= size)) {
359 DCHECK_LE(bytes, new_arena->Size());
360 if (static_cast<size_t>(end_ - ptr_) > new_arena->Size() - bytes) {
/art/cmdline/
H A Dtoken_range.h154 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...]
/art/runtime/utils/
H A Ddex_cache_arrays_layout.h48 return Size() != 0u;
51 size_t Size() const { function in class:art::DexCacheArraysLayout
/art/runtime/gc/space/
H A Dspace_test.h164 EXPECT_LE(space->Size(), growth_limit);
168 EXPECT_GE(space->Size(), footprint);
205 EXPECT_GE(space->Size(), footprint); // invariant
232 EXPECT_LE(space->Size(), growth_limit);
236 EXPECT_GE(space->Size(), amount_allocated);
252 EXPECT_GE(space->Size(), amount_allocated);
253 EXPECT_LE(space->Size(), growth_limit);
275 EXPECT_GE(space->Size(), footprint); // invariant
307 EXPECT_GE(space->Size(), footprint);
308 EXPECT_LE(space->Size(), growth_limi
[all...]
H A Dmalloc_space.cc125 if (Size() > growth_limit_) {
171 size_t size = RoundUp(Size(), kPageSize);
180 << "Size " << size << "\n"
187 VLOG(heap) << "Size " << GetMemMap()->Size();
226 << ",size=" << PrettySize(Size()) << ",capacity=" << PrettySize(Capacity())
H A Dzygote_space.h66 return Size();
/art/runtime/gc/collector/
H A Dimmune_region.h69 size_t Size() const { function in class:art::gc::collector::ImmuneRegion
/art/compiler/utils/
H A Dassembler.cc62 CHECK_EQ(Size(), 0U);
84 MemoryRegion from(reinterpret_cast<void*>(contents()), Size());
95 size_t old_size = Size();
111 CHECK_EQ(Size(), old_size);
H A Dassembler.h105 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/accounting/
H A Datomic_stack.h150 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.
H A Dspace_bitmap.cc106 DCHECK_EQ(Size(), source_bitmap->Size());
107 std::copy(source_bitmap->Begin(), source_bitmap->Begin() + source_bitmap->Size() / sizeof(intptr_t), Begin());
162 CHECK_LT(end, live_bitmap.Size() / sizeof(intptr_t));
251 uintptr_t end = Size() / sizeof(intptr_t);
/art/cmdline/detail/
H A Dcmdline_parse_argument_detail.h76 // wildcard present). 0 means no match. If the Size() tokens are returned.
215 return std::min(min, cur.Size());
220 return std::max(max, cur.Size());
314 assert(arguments.Size() > 0);
321 if (best_match_size > arguments.Size()) {
324 return CmdlineResult(CmdlineResult::kUnknown, "Size mismatch");
328 *consumed_tokens = best_match_arg_def->Size();
368 sub_idx < def_split_wildcards.Size() && sub_idx < arg_matches->Size(); ++sub_idx) {
/art/compiler/optimizing/
H A Dlicm.cc45 for (size_t i = 0, e = environment->Size(); i < e; ++i) {
68 for (size_t i = 0, e = environment->Size(); i < e; ++i) {

Completed in 380 milliseconds

123456