Searched refs:Size (Results 26 - 50 of 138) sorted by relevance

123456

/art/compiler/utils/
H A Dassembler.h193 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/compiler/optimizing/
H A Dgvn.cc309 sets_(allocator, graph->GetBlocks().Size(), nullptr) {}
344 if (predecessors.Size() == 0 || predecessors.Get(0)->IsEntryBlock()) {
352 if (dominator->GetSuccessors().Size() == 1) {
364 } else if (predecessors.Size() > 1) {
365 for (size_t i = 0, e = predecessors.Size(); i < e; ++i) {
H A Dssa_builder.cc240 for (size_t i = 0; i < loop_headers_.Size(); i++) {
244 for (size_t pred = 0; pred < block->GetPredecessors().Size(); pred++) {
358 for (size_t local = 0; local < current_locals_->Size(); local++) {
370 } else if (block->GetPredecessors().Size() > 0) {
373 for (size_t local = 0; local < current_locals_->Size(); local++) {
378 for (size_t i = 0, e = block->GetPredecessors().Size(); i < e; ++i) {
396 GetGraph()->GetArena(), local, block->GetPredecessors().Size(), Primitive::kPrimVoid);
397 for (size_t i = 0; i < block->GetPredecessors().Size(); i++) {
559 current_locals_->Size(),
H A Dssa_liveness_analysis.cc47 size_t insert_at = worklist->Size();
72 GrowableArray<uint32_t> forward_predecessors(graph_->GetArena(), graph_->GetBlocks().Size());
73 forward_predecessors.SetSize(graph_->GetBlocks().Size());
76 size_t number_of_forward_predecessors = block->GetPredecessors().Size();
92 for (size_t i = 0, e = current->GetSuccessors().Size(); i < e; ++i) {
188 for (size_t i = 0, e = block->GetSuccessors().Size(); i < e; ++i) {
226 for (size_t i = 0, e = environment->Size(); i < e; ++i) {
299 for (size_t i = 0, e = block.GetSuccessors().Size(); i < e; ++i) {
344 for (size_t i = 0; i < block->GetPredecessors().Size(); ++i) {
H A Dgraph_test.cc166 ASSERT_EQ(if_block->GetPredecessors().Size(), 2u);
201 ASSERT_EQ(if_block->GetPredecessors().Size(), 2u);
241 ASSERT_EQ(loop_block->GetPredecessors().Size(), 2u);
244 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors().Size(), 1u);
279 ASSERT_EQ(loop_block->GetPredecessors().Size(), 2u);
282 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors().Size(), 1u);
H A Dfind_loops_test.cc49 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) {
62 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) {
78 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) {
95 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) {
110 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) {
H A Doptimizing_unit_test.h63 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) {
H A Dstack_map_test.cc65 ASSERT_EQ(expected_location_catalog_size, location_catalog.Size());
87 ASSERT_EQ(expected_dex_register_map_size, dex_register_map.Size());
159 ASSERT_EQ(expected_location_catalog_size, location_catalog.Size());
183 ASSERT_EQ(expected_dex_register_map_size, dex_register_map.Size());
240 ASSERT_EQ(expected_dex_register_map_size, dex_register_map.Size());
300 ASSERT_EQ(expected_location_catalog_size, location_catalog.Size());
319 ASSERT_EQ(expected_dex_register_map_size, dex_register_map.Size());
403 ASSERT_EQ(255u, dex_register_map0.Size());
490 ASSERT_EQ(0u, location_catalog.Size());
/art/runtime/base/
H A Dhash_set_test.cc68 ASSERT_EQ(hash_set.Size(), 0U);
75 ASSERT_EQ(hash_set.Size(), 0U);
92 ASSERT_EQ(strings.size(), hash_set.Size());
173 ASSERT_EQ(hash_set.Size(), std_set.size());
175 static_cast<ssize_t>(hash_set.Size()));
H A Dhash_set.h240 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());
H A Darena_allocator.cc99 malloc_bytes += arena->Size();
142 size_ = map_->Size();
187 if (free_arenas_ != nullptr && LIKELY(free_arenas_->Size() >= size)) {
/art/runtime/gc/accounting/
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));
255 uintptr_t end = Size() / sizeof(intptr_t);
H A Datomic_stack.h151 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.
H A Dread_barrier_table.h70 memset(mem_map_->Begin(), kSetEntryValue, mem_map_->Size());
/art/runtime/
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 Dimage.h38 uint32_t Size() const { function
43 return Offset() + Size();
H A Dmem_map.h113 size_t Size() const { function in class:art::MemMap
121 return Begin() + Size();
H A Dparsed_options_test.cc65 ASSERT_NE(0u, map.Size());
107 ASSERT_NE(0u, map.Size());
H A Dmem_map_test.cc51 size_t size0 = m0->Size();
52 EXPECT_EQ(m0->Size(), 2 * page_size);
63 EXPECT_EQ(m0->Size(), page_size);
67 size_t size1 = m1->Size();
/art/runtime/gc/space/
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();
H A Dspace_test.h423 EXPECT_LE(space->Size(), growth_limit);
427 EXPECT_GE(space->Size(), footprint);
464 EXPECT_GE(space->Size(), footprint); // invariant
491 EXPECT_LE(space->Size(), growth_limit);
495 EXPECT_GE(space->Size(), amount_allocated);
511 EXPECT_GE(space->Size(), amount_allocated);
512 EXPECT_LE(space->Size(), growth_limit);
534 EXPECT_GE(space->Size(), footprint); // invariant
566 EXPECT_GE(space->Size(), footprint);
567 EXPECT_LE(space->Size(), growth_limi
[all...]
/art/oatdump/
H A Doatdump.cc452 os << oat_file_.Size() << "\n\n";
565 offsets_.insert(oat_file_.Size());
822 if (oat_method_offsets_offset > oat_file_.Size()) {
825 oat_method_offsets_offset, oat_file_.Size());
833 if (aligned_code_begin > oat_file_.Size()) {
836 aligned_code_begin, oat_file_.Size());
847 if (gc_map_offset > oat_file_.Size()) {
850 gc_map_offset, oat_file_.Size());
867 if (method_header_offset > oat_file_.Size()) {
870 method_header_offset, oat_file_.Size());
[all...]
/art/cmdline/
H A Dcmdline_parser_test.cc152 EXPECT_EQ(0u, parser_->GetArgumentsMap().Size()); \
159 EXPECT_EQ(1u, args.Size()); \
178 EXPECT_EQ(0u, args.Size()); \
190 EXPECT_EQ(0u, args.Size());
547 EXPECT_EQ(5u, map.Size());
/art/runtime/native/
H A Djava_lang_DexCache.cc39 jobject byte_buffer = env->NewDirectByteBuffer(address, dex_file->Size());

Completed in 399 milliseconds

123456