Searched refs:size (Results 451 - 475 of 559) sorted by relevance

<<11121314151617181920>>

/art/test/924-threads/
H A Dthreads.cc266 static_cast<jint>(gEvents.size()),
/art/tools/ahat/src/main/com/android/ahat/heapdump/
H A DParser.java60 * <li> The ID size used in the heap dump is 4 bytes.
98 * <li> The ID size used in the heap dump is 4 bytes.
131 throw new HprofFormatException("Id size " + idSize + " not supported.");
306 hprof.skip(type.size);
318 staticFieldsSize += type.size;
573 // Compute the size of the fields array in advance to avoid
722 current = new AhatHeap(name, heaps.size());
857 mBuffer = channel.map(FileChannel.MapMode.READ_ONLY, 0, channel.size());
/art/tools/dexfuzz/src/dexfuzz/program/mutators/
H A DNewInstanceChanger.java117 int newInstanceIdxInCache = rng.nextInt(newInstanceCachedInsns.size());
/art/compiler/optimizing/
H A Dcode_generator_vector_x86.cc1112 static Address VecAddress(LocationSummary* locations, size_t size, bool is_string_char_at) { argument
1116 switch (size) {
1125 : mirror::Array::DataOffset(size).Uint32Value();
1139 size_t size = DataType::Size(instruction->GetPackedType()); local
1140 Address address = VecAddress(locations, size, instruction->IsStringCharAt());
1198 size_t size = DataType::Size(instruction->GetPackedType()); local
1199 Address address = VecAddress(locations, size, /*is_string_char_at*/ false);
H A Dcode_generator_vector_x86_64.cc1085 static Address VecAddress(LocationSummary* locations, size_t size, bool is_string_char_at) { argument
1089 switch (size) {
1098 : mirror::Array::DataOffset(size).Uint32Value();
1112 size_t size = DataType::Size(instruction->GetPackedType()); local
1113 Address address = VecAddress(locations, size, instruction->IsStringCharAt());
1171 size_t size = DataType::Size(instruction->GetPackedType()); local
1172 Address address = VecAddress(locations, size, /*is_string_char_at*/ false);
H A Dcode_generator_vector_arm64.cc1251 size_t size,
1265 : mirror::Array::DataOffset(size).Uint32Value();
1266 size_t shift = ComponentSizeShiftWidth(size);
1287 size_t size = DataType::Size(instruction->GetPackedType()); local
1316 __ Ldr(reg, VecAddress(instruction, &temps, size, /*is_string_char_at*/ true, &scratch));
1331 __ Ldr(reg, VecAddress(instruction, &temps, size, instruction->IsStringCharAt(), &scratch));
1345 size_t size = DataType::Size(instruction->GetPackedType()); local
1362 __ Str(reg, VecAddress(instruction, &temps, size, /*is_string_char_at*/ false, &scratch));
1248 VecAddress( HVecMemoryOperation* instruction, UseScratchRegisterScope* temps_scope, size_t size, bool is_string_char_at, Register* scratch) argument
H A Dlocations.h520 return inputs_.size();
562 return temps_.size();
H A Dloop_optimization_test.cc298 EXPECT_EQ(header->GetPredecessors().size(), 2u);
H A Dscheduler.h404 size_t select = rand_r(&seed_) % nodes->size();
/art/runtime/
H A Druntime.cc282 static_cast<uint32_t>(CalleeSaveType::kLastCalleeSaveType), "Unexpected size");
971 for (size_t index = 0; index < image_locations.size(); ++index) {
1080 for (size_t i = 0; i < dex_filenames.size(); i++) {
1436 CHECK_GE(GetHeap()->GetContinuousSpaces().size(), 1U);
1457 dex_locations.reserve(boot_class_path.size());
1481 CHECK_EQ(dex_filenames.size(), dex_locations.size());
2052 for (int32_t i = 0, size = image_header.GetImageRoots()->GetLength(); i != size; ++i) {
2551 c_env_vector_.reset(new char*[name_value_pairs_.size()
[all...]
H A Dthread_list.cc258 os << "DALVIK THREADS (" << list_.size() << "):\n";
333 count = list_.size();
637 return runnable_thread_count + other_threads.size() + 1; // +1 for self.
735 pending_threads.StoreRelaxed(list_.size() - num_ignored);
1552 for (size_t i = 0; i < allocated_ids_.size(); ++i) {
H A Dclass_linker_test.cc478 // Classes have a different size due to padding field. Strings are variable length.
487 LOG(ERROR) << "Class size mismatch:"
496 if (offsets.size() != num_fields) {
500 << " C++=" << offsets.size();
504 for (size_t i = 0; i < offsets.size(); i++) {
512 for (size_t i = 0; i < offsets.size(); i++) {
526 for (size_t i = 0; i < offsets.size(); i++) {
534 for (size_t i = 0; i < offsets.size(); i++) {
863 ASSERT_EQ(dex_files.size(), 1U);
868 ASSERT_EQ(dex_files2.size(),
[all...]
/art/compiler/utils/mips/
H A Dassembler_mips_test.cc61 if (registers_.size() == 0) {
478 WarnOnCombinations(regs.size() * regs.size() * 33 * 16);
483 for (int32_t size = 1; pos + size <= 32; size++) {
484 __ Ins(*reg1, *reg2, pos, size);
486 instr << "ins $" << *reg1 << ", $" << *reg2 << ", " << pos << ", " << size << "\n"; local
497 WarnOnCombinations(regs.size() * regs.size() * 3
505 instr << "ext $" << *reg1 << ", $" << *reg2 << ", " << pos << ", " << size << "\\n"; local
[all...]
/art/runtime/gc/
H A Dheap.cc113 // Default mark stack size in bytes.
126 // Verify objet has a small allocation stack size since searching the allocation stack is slow.
242 * verification is enabled, we limit the size of allocation stacks to speed up their
425 const size_t size = non_moving_space_mem_map->Size(); local
428 initial_size, size, size, false);
448 // TODO: Place bump-pointer spaces somewhere to minimize size of card table.
1008 os << "Mean GC size throughput: "
1023 os << "Zygote space size " << PrettySize(zygote_space_->Size()) << "\n";
1647 // or the requested size i
2215 AddBin(size_t size, uintptr_t position) argument
2217 MEMORY_TOOL_MAKE_DEFINED(reinterpret_cast<void*>(position), size); local
2249 size_t size = it->first; local
[all...]
/art/dexdump/
H A Ddexdump.cc510 const u4 size = DecodeUnsignedLeb128(data); local
511 for (u4 i = 0; i < size; i++) {
522 const u4 size = DecodeUnsignedLeb128(data); local
523 for (u4 i = 0; i < size; i++) {
784 * Returns a pointer to a buffer of sufficient size.
936 // The buffer wasn't big enough; retry with computed size. Note: snprintf()
937 // doesn't count/ the '\0' as part of its returned size, so we add explicit
1201 fprintf(gOutFile, " insns size : %d 16-bit code units\n",
1899 content.size(),
1916 for (size_t i = 0, n = dex_files.size();
[all...]
/art/runtime/verifier/
H A Dmethod_verifier.cc411 if (verifier.failures_.size() != 0) {
449 CHECK_NE(verifier.failures_.size(), 0U);
483 verifier.failure_messages_[verifier.failure_messages_.size() - 1]->str();
894 size_t failure_num = failure_messages_.size();
903 size_t failure_num = failure_messages_.size();
913 // We can't assume the instruction is well formed, handle the case where calculating the size
970 << " endAddr=" << end << " (size=" << insns_size << ")";
1026 DCHECK_NE(failures_.size(), 0U);
1566 DCHECK_NE(failures_.size(), 0U);
1577 DCHECK_NE(failures_.size(),
[all...]
/art/cmdline/
H A Dcmdline_parser.h343 std::vector<Unit> values(names_.size(), Unit{});
488 return completed_arguments_.size();
H A Dcmdline_types.h123 // Returns 0 (a useless size) if "s" is malformed or specifies a low or
376 return list_.size();
544 for (size_t j = 0; j < verbose_options.size(); ++j) {
/art/dex2oat/linker/
H A Dimage_writer.h97 CHECK_EQ(class_loaders_.size(), compile_app_image_ ? 1u : 0u);
244 // The struct size must be exactly sizeof(LockWord), currently 32-bits, since this will end up
252 // The offset in bytes from the beginning of the bin. Aligned to object size.
260 // Must be the same size as LockWord, any larger and we would truncate the data.
268 // Create the image sections into the out sections variable, returns the size of the image
312 // Offset to the free space in image_, initially size of image header.
317 // Image size is the *address space* covered by this image. As the live bitmap is aligned
318 // to the page size, the live bitmap will cover more address space than necessary. But live
319 // bitmaps may not overlap, so an image has a "shadow," which is accounted for in the size.
350 // Cached size o
[all...]
/art/libdexfile/dex/
H A Ddex_file-inl.h190 DCHECK_EQ(params_size, rhs_params->Size()); // Parameter list size must match.
258 if (parameters_size != arg_descriptors.size()) {
263 for (i = 0; i < parameters_size && i < arg_descriptors.size(); ++i) {
265 LOG(ERROR) << "invalid stream - arg reg >= reg size (" << arg_reg
311 LOG(ERROR) << "invalid stream - reg >= reg size (" << reg << " >= "
340 LOG(ERROR) << "invalid stream - reg >= reg size (" << reg << " >= "
356 LOG(ERROR) << "invalid stream - reg >= reg size (" << reg << " >= "
H A Ddex_file.h88 uint32_t file_size_ = 0; // size of entire file
106 uint32_t data_size_ = 0; // size of data section
277 uint32_t size_; // size of the list, in entries
463 // Returns the maximum size in bytes needed to store an equivalent dex file strictly conforming to
464 // the dex file specification. That is the size if we wanted to get rid of all the
467 // TODO This should really be an exact size! b/72402467
715 return FindProtoId(return_type_idx, &signature_type_idxs[0], signature_type_idxs.size());
975 static uint32_t CalculateChecksum(const uint8_t* begin, size_t size);
976 static uint32_t ChecksumMemoryRange(const uint8_t* begin, size_t size);
1023 size_t size,
[all...]
/art/runtime/jdwp/
H A Djdwp_main.cc266 return TEMP_FAILURE_RETRY(writev(clientSock, &iov[0], iov.size()));
281 for (size_t i = 0; i < iov.size(); ++i) {
/art/compiler/debug/dwarf/
H A Ddwarf_test.cc275 EXPECT_LT(opcodes.data()->size(), num_rows * 3);
/art/libartbase/base/
H A Dvariant_map.h328 return storage_map_.size();
/art/openjdkjvmti/
H A Dti_method.cc243 jlong table_size = sizeof(jvmtiLocalVariableEntry) * variables_.size();
250 *out_entry_count_ptr = variables_.size();
497 jlong mem_size = context.size() * sizeof(jvmtiLineNumberEntry);
504 *entry_count_ptr = static_cast<jint>(context.size());

Completed in 397 milliseconds

<<11121314151617181920>>