Searched refs:size (Results 226 - 250 of 559) sorted by relevance

1234567891011>>

/art/runtime/dex/
H A Ddex_file_annotations.cc209 uint32_t size = DecodeUnsignedLeb128(&annotation); local
210 while (size--) {
221 uint32_t size = DecodeUnsignedLeb128(&annotation); local
222 while (size--) {
250 uint32_t size = DecodeUnsignedLeb128(&annotation); local
252 while (size != 0) {
260 size--;
339 uint32_t size = DecodeUnsignedLeb128(annotation); local
365 if (size > 0) {
367 mirror::ObjectArray<mirror::Object>::Alloc(self, annotation_member_array_class, size);
589 uint32_t size = DecodeUnsignedLeb128(&annotation); local
917 uint32_t size = annotation_set->size_; local
1120 uint32_t size = set_ref_list->size_; local
[all...]
H A Dart_dex_file_loader_test.cc72 ASSERT_EQ(1U, checksums.size());
86 ASSERT_EQ(2U, dexes.size());
87 ASSERT_EQ(2U, checksums.size());
333 ASSERT_GE(dex_files.size(), 1u);
361 ASSERT_GE(dex_files.size(), 1u);
389 ASSERT_GE(dex_files.size(), 1u);
417 ASSERT_GT(dex_files.size(), 1u);
446 ASSERT_GT(dex_files.size(), 1u);
475 ASSERT_GT(dex_files.size(), 1u);
/art/compiler/linker/arm/
H A Drelative_patcher_thumb2.cc59 DCHECK_LE(literal_offset + 4u, code->size());
109 DCHECK_LT(literal_offset, code->size());
121 DCHECK_GE(code->size() - literal_offset, 8u);
128 DCHECK_GE(code->size() - literal_offset, 6u);
138 DCHECK_GE(code->size() - literal_offset, 8u);
380 MemoryRegion code(thunk_code.data(), thunk_code.size());
444 DCHECK_LE(offset + 4u, code->size());
454 DCHECK_LE(offset + 4u, code.size());
471 DCHECK_LE(offset + 2u, code.size());
/art/compiler/utils/
H A Dassembler_test.h222 if (str.size() > 0) {
284 if (str.size() > 0) {
307 WarnOnCombinations(reg1_registers.size() * reg2_registers.size() * imms.size());
339 if (str.size() > 0) {
383 if (str.size() > 0) {
564 WarnOnCombinations(imms.size());
581 if (str.size() > 0) {
1132 WarnOnCombinations(addresses.size());
[all...]
/art/runtime/mirror/
H A Darray-inl.h57 << "Array data offset isn't aligned with component size";
77 size_t size = header_size + data_size; local
83 // component size is 8.
95 return size;
119 // Similar to SetLengthVisitor, used for setting the array length to fill the usable size of an
164 size_t size = ComputeArraySize(component_count, component_size_shift); local
167 DCHECK_NE(size, 0U);
170 if (UNLIKELY(size == 0)) {
182 heap->AllocObjectWithAllocator<kIsInstrumented, true>(self, array_class, size,
189 heap->AllocObjectWithAllocator<kIsInstrumented, true>(self, array_class, size,
[all...]
H A Dstring-inl.h199 size_t size = sizeof(String); local
201 size += (sizeof(uint8_t) * GetLength<kVerifyFlags>());
203 size += (sizeof(uint16_t) * GetLength<kVerifyFlags>());
209 return RoundUp(size, kObjectAlignment);
223 size_t size = header_size + data_size; local
227 size_t alloc_size = RoundUp(size, kObjectAlignment);
276 // It is a caller error to have a count less than the actual array's size.
/art/tools/dexfuzz/src/dexfuzz/program/
H A DCodeTranslator.java220 if ((index == uniqueOffsets.size())
242 for (int i = 0; i < uniqueOffsets.size(); i++) {
263 // The instructions vary in size, so we have to find the last instruction in the block in a
289 if (encodedCatchHandler.size <= 0) {
303 for (int i = 0; i < Math.abs(encodedCatchHandler.size); i++) {
334 for (int i = 0; i < mutatableCode.mutatableTries.size() - 1; i++) {
374 if (encodedCatchHandler.size <= 0) {
377 for (int i = 0; i < Math.abs(encodedCatchHandler.size); i++) {
463 int targetsSize = switchInsn.targets.size();
480 // Write out the size
[all...]
/art/compiler/debug/
H A Delf_debug_info_writer.h142 info_.WriteSecOffset(DW_AT_ranges, owner_->debug_ranges_.size());
181 size_t type_attrib_offset = info_.size();
241 if (i < param_names.size()) {
296 buffer.reserve(info_.data()->size() + KB);
301 owner_->builder_->GetDebugInfo()->WriteFully(buffer.data(), buffer.size());
391 base_class_references.emplace(info_.size(), base_class);
461 buffer.reserve(info_.data()->size() + KB);
466 owner_->builder_->GetDebugInfo()->WriteFully(buffer.data(), buffer.size());
515 lazy_types_.emplace(std::string(type_descriptor), info_.size());
568 DCHECK_EQ(desc.size(),
[all...]
/art/dex2oat/linker/
H A Doat_writer_test.cc82 size_t code_size = quick_code.size() * sizeof(quick_code[0]);
286 bool AddFile(const char* location, const void* data, size_t size) { argument
293 file_header.crc32 = crc32(0u, reinterpret_cast<const Bytef*>(data), size);
294 file_header.compressed_size = size;
295 file_header.uncompressed_size = size;
300 !zip_file_->WriteFully(data, size)) {
306 cdfh.compressed_size = size;
307 cdfh.uncompressed_size = size;
329 eocd_record.number_of_central_directory_records_on_this_disk = file_data_.size();
330 eocd_record.total_number_of_central_directory_records = file_data_.size();
[all...]
/art/compiler/optimizing/
H A Dgraph_test.cc165 ASSERT_EQ(if_block->GetPredecessors().size(), 2u);
197 ASSERT_EQ(if_block->GetPredecessors().size(), 2u);
234 ASSERT_EQ(loop_block->GetPredecessors().size(), 2u);
237 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors().size(), 1u);
269 ASSERT_EQ(loop_block->GetPredecessors().size(), 2u);
272 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors().size(), 1u);
H A Dinduction_var_analysis.cc35 const size_t size = scc->size(); local
36 for (size_t i = 0; i < size; i++) {
47 for (size_t i = 0; i < size; i++) {
49 if (++phi_pos >= size) phi_pos = 0;
51 DCHECK_EQ(size, new_scc->size());
114 while (guard->GetPredecessors().size() == 1 &&
115 guard->GetSuccessors().size() == 1) {
326 if (scc_.size()
393 const size_t size = scc_.size(); local
[all...]
H A Dload_store_analysis.h206 return heap_locations_.size();
226 for (size_t i = 0; i < ref_info_array_.size(); i++) {
286 for (size_t i = 0; i < heap_locations_.size(); i++) {
312 const size_t number_of_locations = heap_locations_.size();
366 const size_t number_of_locations = heap_locations_.size();
412 size_t pos = ref_info_array_.size();
H A Ddata_type_test.cc87 static_assert(arraysize(kIntegralTypes) == arraysize(kImplicitIntegralConversions), "size check");
89 for (size_t input_index = 0; input_index != kIntegralInputTypes.size(); ++input_index) {
91 for (size_t result_index = 1u; result_index != kIntegralResultTypes.size(); ++result_index) {
H A Dselect_generator.cc37 if (block->GetPredecessors().size() != 1u) {
164 bool only_two_predecessors = (merge_block->GetPredecessors().size() == 2u);
/art/libartbase/base/
H A Dleb128_test.cc100 EXPECT_EQ(UnsignedLeb128Size(uleb128_tests[i].decoded), builder.GetData().size());
104 if (j < builder.GetData().size()) {
150 EXPECT_EQ(builder.GetData().size(),
181 EXPECT_EQ(SignedLeb128Size(sleb128_tests[i].decoded), builder.GetData().size());
185 if (j < builder.GetData().size()) {
231 EXPECT_EQ(builder.GetData().size(),
/art/runtime/gc/space/
H A Drosalloc_space.cc72 // Protect memory beyond the starting size. MoreCore will add r/w permissions when necessory
112 // size of the large allocation) will be greater than the footprint limit.
117 LOG(ERROR) << "Failed to create mem map for alloc space (" << name << ") of size "
125 // We start out with only the initial size possibly containing objects.
232 size_t size = rosalloc_->UsableSize(ptrs[i]); local
233 memset(ptrs[i], 0xEF, size);
282 // grown all the way to the allowed size yet.
380 // obj is a valid object. Use its class in the header to get the size.
382 size_t size = obj->SizeOf<kVerifyNone>(); local
387 size
[all...]
/art/runtime/
H A Dreference_table.cc52 if (entries_.size() >= max_size_) {
61 for (int i = entries_.size() - 1; i >= 0; --i) {
117 return entries_.size();
126 // Compare GC roots, first by class, then size, then address.
147 // ...then by size...
165 size_t count = entries.size();
183 size_t size = ref->SizeOf(); local
184 os << StringPrintf(" %5d: %p (raw) (%zd bytes)\n", idx, ref.Ptr(), size);
323 // then by class (and size and address).
H A Dclass_loader_context_test.cc43 ASSERT_EQ(expected_size, context->class_loader_chain_.size());
95 ASSERT_EQ(all_dex_files->size(), info.classpath.size());
96 ASSERT_EQ(all_dex_files->size(), info.opened_dex_files.size());
98 for (size_t k = 0; k < all_dex_files->size(); k++) {
150 ASSERT_EQ(expected_dex_files.size(), class_loader_dex_files.size());
152 for (size_t i = 0; i < expected_dex_files.size(); i++) {
171 ASSERT_GT(context->class_loader_chain_.size(), inde
[all...]
/art/tools/wrapagentproperties/
H A Dwrapagentproperties.cc145 jvmtiError res = env->Allocate(val.size() + 1, reinterpret_cast<unsigned char**>(out));
174 *cnt = all_props.size();
175 res = env->Allocate(all_props.size() * sizeof(char*),
183 res = env->Allocate(p.size() + 1, reinterpret_cast<unsigned char**>(&out_prop_ptr[i]));
259 end = s.size();
269 if (line.size() == 0 || line[0] == '#') {
/art/dexlayout/
H A Ddex_ir.cc284 const uint32_t size = DecodeUnsignedLeb128(data); local
286 for (uint32_t i = 0; i < size; i++) {
299 const uint32_t size = DecodeUnsignedLeb128(data); local
301 for (uint32_t i = 0; i < size; i++) {
397 uint32_t size = dex_type_list->Size(); local
398 for (uint32_t index = 0; index < size; ++index) {
415 uint32_t size = DecodeUnsignedLeb128(&static_data); local
417 for (uint32_t i = 0; i < size; ++i) {
420 // TODO: Calculate the size of the encoded array.
540 // TODO: Calculate the size o
647 int32_t size = DecodeSignedLeb128(&handlers_data); local
679 uint32_t size = dex_file.GetCodeItemSize(*disk_code_item); local
[all...]
/art/profman/
H A Dprofman.cc400 if (dex_locations_.size() != apks_fd_.size()) {
408 } else if (dex_locations_.size() != apk_files_.size()) {
417 for (size_t i = 0; i < dex_locations_.size(); ++i) {
456 // We can't use a char array of PATH_MAX size without exceeding the frame size.
459 for (size_t i = 0; i < apks_fd_.size(); ++i) {
461 ssize_t len = readlink(fd_path.c_str(), buffer.data(), buffer.size() - 1);
788 if (name_and_signature.size() !
[all...]
/art/cmdline/detail/
H A Dcmdline_parser_detail.h106 for (size_t i = 0; i < value.size(); ++i) {
109 if (i != value.size() - 1) {
/art/compiler/
H A Dcompiled_method.cc41 } else if (quick_code_->size() != rhs.quick_code_->size()) {
/art/compiler/dex/
H A Dverification_results.cc91 CHECK((ex_set == nullptr) || (ex_set->size() == ve_set->size()));
/art/compiler/jni/quick/mips64/
H A Dcalling_convention_mips64.cc127 if ((entry_spills_.size() == 0) && (NumArgs() > 0)) {
130 // We need to choose the correct register size since the managed
181 // ArtMethod*, RA and callee save area size, local reference segment state.
183 size_t ra_and_callee_save_area_size = (CalleeSaveRegisters().size() + 1) * kFramePointerSize;
196 total_size += handle_scope_size; // Handle scope size.
199 // Plus return value spill area size.

Completed in 530 milliseconds

1234567891011>>