Searched refs:length (Results 151 - 175 of 231) sorted by relevance

12345678910

/art/runtime/
H A Dprofiler.cc300 size_t length = data.length(); local
301 size_t full_length = length;
303 int n = ::write(fd, p, length);
305 length -= n;
306 } while (length > 0);
308 // Truncate the file to the new length.
H A Dtrace.cc723 if (!file.WriteFully(header.c_str(), header.length())) {
736 iov[0].iov_len = header.length();
746 if (!trace_file_->WriteFully(header.c_str(), header.length()) ||
982 Append2LE(buf2 + 3, static_cast<uint16_t>(method_line.length()));
984 WriteToBuf(reinterpret_cast<const uint8_t*>(method_line.c_str()), method_line.length());
994 Append2LE(buf2 + 5, static_cast<uint16_t>(thread_name.length()));
996 WriteToBuf(reinterpret_cast<const uint8_t*>(thread_name.c_str()), thread_name.length());
H A Ddebugger.cc1153 JDWP::JdwpError Dbg::GetArrayLength(JDWP::ObjectId array_id, int32_t* length) { argument
1159 *length = a->GetLength();
1310 JDWP::JdwpError Dbg::CreateArrayObject(JDWP::RefTypeId array_class_id, uint32_t length, argument
1320 mirror::Array* new_array = mirror::Array::Alloc<true>(self, c, length,
4166 VLOG(jdwp) << StringPrintf("REPLY INVOKE id=0x%06x (length=%zu)",
4181 * and includes the chunk type/length, followed by the data.
4191 uint32_t length = request->ReadUnsigned32("length"); local
4207 if (length != request_length) {
4208 LOG(WARNING) << StringPrintf("bad chunk found (len=%u pktLen=%zd)", length, request_lengt
[all...]
H A Ddex_file_verifier_test.cc129 size_t length; local
130 std::unique_ptr<uint8_t[]> dex_bytes = DecodeBase64(dex_file_base64_content, &length);
134 new DexFile(dex_bytes.get(), length, "tmp", 0, nullptr, nullptr));
160 size_t length; local
161 std::unique_ptr<uint8_t[]> dex_bytes(DecodeBase64(base64, &length));
167 if (!file->WriteFully(dex_bytes.get(), length)) {
H A Ddex_instruction.cc107 // Handle special NOP encoded variable length sequences.
115 uint32_t length = insns[2] | (((uint32_t)insns[3]) << 16); local
117 return (4 + (element_size * length + 1) / 2);
H A Dutils.cc571 if (descriptor.length() > 0 && descriptor[0] != '[') {
578 size_t length = strlen(descriptor); local
579 if (length > 1) {
580 if (descriptor[0] == 'L' && descriptor[length - 1] == ';') {
582 std::string result(descriptor + 1, length - 2);
597 size_t length = strlen(descriptor); local
598 if (descriptor[0] == 'L' && descriptor[length - 1] == ';') {
599 std::string result(descriptor + 1, length - 2);
H A Dcommon_throws.h48 void ThrowArrayIndexOutOfBoundsException(int index, int length)
/art/compiler/optimizing/
H A Dbounds_check_elimination.cc32 * e.g. array.length - 1.
108 // a constant or array length related value.
120 // Try to detect (array.length + c) format.
159 * (leading to the actual length). This makes it more likely related
245 // Favor array length as upper bound.
266 // (array.length + non-positive-constant) won't overflow an int.
280 // Regardless of the value new_constant, (array.length+new_constant) will
281 // never underflow since array.length is no less than 0.
377 * the variable i in "for (int i=0; i<array.length; i++)".
433 // We currently conservatively assume max array length i
1327 HInstruction* length = instruction->InputAt(1); local
1421 CanHandleLength(HLoopInformation* loop, HInstruction* length, bool needs_taken_test) argument
[all...]
H A Dinstruction_builder.cc1462 HInstruction* length = new (arena_) HArrayLength(object, dex_pc); local
1463 AppendInstruction(length);
1465 index = new (arena_) HBoundsCheck(index, length, dex_pc);
1488 HInstruction* length = graph_->GetIntConstant(number_of_vreg_arguments, dex_pc); local
1493 HInstruction* object = new (arena_) HNewArray(length,
1537 HInstruction* length = new (arena_) HArrayLength(array, dex_pc); local
1538 AppendInstruction(length);
1549 AppendInstruction(new (arena_) HBoundsCheck(last_index, length, dex_pc));
2421 HInstruction* length = LoadLocal(instruction.VRegB_22c(), Primitive::kPrimInt); local
2426 AppendInstruction(new (arena_) HNewArray(length,
[all...]
H A Dintrinsics_x86.cc1076 // We need at least two of the positions or length to be an integer constant,
1080 HIntConstant* length = invoke->InputAt(4)->AsIntConstant(); local
1085 + ((length != nullptr) ? 1 : 0);
1100 // And since we are already checking, check the length too.
1101 if (length != nullptr) {
1102 int32_t len = length->GetValue();
1112 // arraycopy(Object src, int srcPos, Object dest, int destPos, int length).
1128 Register length,
1132 // Where is the length in the String?
1138 // Check that length(inpu
1125 CheckPosition(X86Assembler* assembler, Location pos, Register input, Register length, SlowPathCode* slow_path, Register input_len, Register temp) argument
1139 __ cmpl(Address(input, length_offset), length); local
1178 Location length = locations->InAt(4); local
[all...]
/art/compiler/
H A Delf_builder.h251 Elf_Word Add(const void* data, size_t length) { argument
254 cache_.insert(cache_.end(), d, d + length);
298 return CachedSection::Add(name.c_str(), name.length() + 1);
325 this->WriteFully(name.c_str(), name.length() + 1);
326 current_offset_ += name.length() + 1;
/art/runtime/interpreter/
H A Dinterpreter_common.cc828 const int32_t length = is_range ? inst->VRegA_3rc() : inst->VRegA_35c(); local
830 // Checks FILLED_NEW_ARRAY's length does not exceed 5 arguments.
831 CHECK_LE(length, 5);
833 if (UNLIKELY(length < 0)) {
834 ThrowNegativeArraySizeException(length);
858 Object* new_array = Array::Alloc<true>(self, array_class, length,
872 for (int32_t i = 0; i < length; ++i) {
H A Dunstarted_runtime_test.cc116 int32_t length)
123 tmp->SetVReg(4, length);
141 int32_t length,
160 length);
/art/runtime/gc/space/
H A Dspace_test.h107 // Note the minimum size, which is the size of a zero-length byte array.
121 int32_t length = size - header_size; local
122 arr->SetLength(length);
187 // Note the minimum size, which is the size of a zero-length byte array.
/art/tools/dexfuzz/src/dexfuzz/rawdex/
H A DRawDexFile.java313 while (file.getFilePointer() < file.length()) {
325 int newFileSize = (int) file.length();
/art/runtime/base/
H A Dstringpiece.h63 size_type length() const { return length_; } function in class:art::StringPiece
194 // this observation to fold the odd-length case into the even-length case.
/art/test/005-annotations/src/android/test/anno/
H A DTestAnnotations.java51 "(" + annos.length + "):");
/art/test/021-string2/src/junit/framework/
H A DAssert.java292 if (message != null && message.length() > 0)
/art/test/055-enum-performance/src/
H A DMain.java28 boolean timing = (args.length >= 1) && args[0].equals("--timing");
/art/test/082-inline-execute/src/junit/framework/
H A DAssert.java292 if (message != null && message.length() > 0)
/art/test/401-optimizing-compiler/src/
H A DMain.java97 // Test that we do NPE checks on array length.
235 return array.length;
/art/tools/ahat/src/
H A DAhatSnapshot.java117 if (frames != null && frames.length > 0) {
/art/oatdump/
H A Doatdump.cc515 // We don't know the length of the code for each method, but we need to know where to stop
517 // region, so if we keep a sorted sequence of the start of each region, we can infer the length
690 if (out_dex_path.length() > PATH_MAX) {
1671 os << StringPrintf("%p: %s length:%d\n", obj, PrettyDescriptor(obj_class).c_str(),
1688 for (int32_t i = 0, length = obj_array->GetLength(); i < length; i++) {
1691 for (int32_t j = i + 1; j < length; j++) {
1729 for (size_t i = 0, length = dex_cache->NumResolvedMethods(); i < length; ++i) {
1735 j != length
[all...]
/art/test/082-inline-execute/src/
H A DMain.java111 Assert.assertEquals(str0.length(), 0);
112 Assert.assertEquals(str1.length(), 1);
113 Assert.assertEquals(str80.length(), 80);
117 strNull.length();
144 Assert.assertEquals(testStr.length() - 1, 33); // 33 = testStr.length()-1 as a constant.
154 Assert.assertEquals(d, testStr.charAt(testStr.length()-1));
172 if (testStr.length() == 34) {
173 testStr.charAt(34); // 34 = "Now is the time to test some stuff".length()
175 Assert.assertEquals(testStr.length(), 1
[all...]
/art/compiler/utils/
H A Dtest_dex_file_builder.h41 CHECK_LT(it->first.length(), 128u); // Don't allow multi-byte length in uleb128.
107 data_section_size += entry.first.length() + 1u /* length */ + 1u /* null-terminator */;

Completed in 3936 milliseconds

12345678910