/external/skia/src/xml/ |
SkXMLWriter.h | 25 void addAttributeLen(const char name[], const char value[], size_t length); 28 void addText(const char text[], size_t length); 31 void startElementLen(const char elem[], size_t length); 37 virtual void onStartElementLen(const char elem[], size_t length) = 0; 38 virtual void onAddAttributeLen(const char name[], const char value[], size_t length) = 0; 39 virtual void onAddText(const char text[], size_t length) = 0; 53 bool doStart(const char name[], size_t length); 71 void onStartElementLen(const char elem[], size_t length) override; 73 void onAddAttributeLen(const char name[], const char value[], size_t length) override; 74 void onAddText(const char text[], size_t length) override [all...] |
/external/skqp/src/xml/ |
SkXMLWriter.h | 25 void addAttributeLen(const char name[], const char value[], size_t length); 28 void addText(const char text[], size_t length); 31 void startElementLen(const char elem[], size_t length); 37 virtual void onStartElementLen(const char elem[], size_t length) = 0; 38 virtual void onAddAttributeLen(const char name[], const char value[], size_t length) = 0; 39 virtual void onAddText(const char text[], size_t length) = 0; 53 bool doStart(const char name[], size_t length); 71 void onStartElementLen(const char elem[], size_t length) override; 73 void onAddAttributeLen(const char name[], const char value[], size_t length) override; 74 void onAddText(const char text[], size_t length) override [all...] |
/frameworks/native/libs/binder/ |
IProcessInfoService.cpp | 31 virtual status_t getProcessStatesFromPids(size_t length, /*in*/ int32_t* pids, 36 data.writeInt32Array(length, pids); 37 data.writeInt32(length); // write length of output array, used by java AIDL stubs 43 if (static_cast<size_t>(replyLen) != length) { 46 if (replyLen > 0 && (err = reply.read(states, length * sizeof(*states))) != NO_ERROR) { 52 virtual status_t getProcessStatesAndOomScoresFromPids(size_t length, 57 data.writeInt32Array(length, pids); 58 // write length of output arrays, used by java AIDL stubs 59 data.writeInt32(length); [all...] |
/libcore/ojluni/src/main/java/java/lang/ |
CharSequence.java | 62 * Returns the length of this character sequence. The length is the number 67 int length(); method in interface:CharSequence 71 * to <tt>length() - 1</tt>. The first <code>char</code> value of the sequence is at 85 * <tt>length()</tt> 92 * ends with the <code>char</code> value at index <tt>end - 1</tt>. The length 104 * if <tt>end</tt> is greater than <tt>length()</tt>, 111 * order as this sequence. The length of the string will be the length of 135 return cur < length(); 183 final int length = length(); local 210 final int length = length(); local [all...] |
/libcore/ojluni/src/main/java/java/nio/charset/ |
CoderResult.java | 59 * <tt>true</tt> and whose {@link #length() length} method returns the length 61 * all malformed-input errors of a given length. </p></li> 67 * whose {@link #length() length} method returns the length of the input 69 * of this class for all unmappable-character errors of a given length. 97 private final int length; field in class:CoderResult 99 private CoderResult(int type, int length) { 173 public int length() { method in class:CoderResult [all...] |
/external/icu/icu4j/perf-tests/src/com/ibm/icu/dev/test/perf/ |
NormalizerPerformanceTest.java | 34 for (int i = 0; i < NFDFileLines.length; i++) { 41 for (int i = 0; i < NFDFileLines.length; i++) { 42 totalChars = totalChars + NFDFileLines[i].length(); 52 for (int i = 0; i < NFCFileLines.length; i++) { 59 for (int i = 0; i < NFCFileLines.length; i++) { 60 totalChars = totalChars + NFCFileLines[i].length(); 70 for (int i = 0; i < fileLines.length; i++) { 77 for (int i = 0; i < fileLines.length; i++) { 78 totalChars = totalChars + fileLines[i].length(); 89 for (int i = 0; i < NFDFileLines.length; i++) [all...] |
/external/guava/guava/src/com/google/common/base/ |
Ascii.java | 353 * and US is least inclusive. (The content and length of a File, Group, 364 * and US is least inclusive. (The content and length of a File, Group, 375 * and US is least inclusive. (The content and length of a File, Group, 386 * and US is least inclusive. (The content and length of a File, Group, 438 int length = string.length(); local 439 for (int i = 0; i < length; i++) { 442 for (; i < length; i++) { 465 int length = chars.length(); local 487 int length = string.length(); local 514 int length = chars.length(); local 634 int length = s1.length(); local [all...] |
/external/python/cpython3/Modules/_sha3/kcp/ |
SnP-Relaned.h | 19 #define SnP_AddBytes(state, data, offset, length, SnP_AddLanes, SnP_AddBytesInLane, SnP_laneLengthInBytes) \ 22 SnP_AddLanes(state, data, (length)/SnP_laneLengthInBytes); \ 24 (length)/SnP_laneLengthInBytes, \ 25 (data)+((length)/SnP_laneLengthInBytes)*SnP_laneLengthInBytes, \ 27 (length)%SnP_laneLengthInBytes); \ 30 unsigned int _sizeLeft = (length); \ 47 #define SnP_OverwriteBytes(state, data, offset, length, SnP_OverwriteLanes, SnP_OverwriteBytesInLane, SnP_laneLengthInBytes) \ 50 SnP_OverwriteLanes(state, data, (length)/SnP_laneLengthInBytes); \ 52 (length)/SnP_laneLengthInBytes, \ 53 (data)+((length)/SnP_laneLengthInBytes)*SnP_laneLengthInBytes, [all...] |
/frameworks/base/libs/common_time/ |
common_time_server_packets.cpp | 42 if ((offset + sizeof(field_name)) > length) \ 53 if ((offset + sizeof(field_name)) > length) \ 79 uint32_t length) { 91 uint32_t length) { 104 uint32_t length) { 107 ret = serializeHeader(data, length); 112 length -= ret; 117 length); 121 length); 124 tmp =((SyncRequestPacket*)(this))->serializePacket(data, length); [all...] |
/external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
CollationDataReader.java | 60 // Each item's byte length is given by the difference between its offset and 70 /** Byte offset to the collation trie. Its length is a multiple of 8 bytes. */ 117 for(int i = 1; i < indexesLength && i < inIndexes.length; ++i) { 120 for(int i = indexesLength; i < inIndexes.length; ++i) { 123 if(indexesLength > inIndexes.length) { 124 ICUBinary.skipBytes(inBytes, (indexesLength - inIndexes.length) * 4); 135 int length; // number of bytes in the index part local 138 length = inIndexes[IX_TOTAL_SIZE]; 140 length = inIndexes[indexesLength - 1]; 142 length = 0; // only indexes, and inLength was already checked for the [all...] |
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
CollationDataReader.java | 59 // Each item's byte length is given by the difference between its offset and 69 /** Byte offset to the collation trie. Its length is a multiple of 8 bytes. */ 116 for(int i = 1; i < indexesLength && i < inIndexes.length; ++i) { 119 for(int i = indexesLength; i < inIndexes.length; ++i) { 122 if(indexesLength > inIndexes.length) { 123 ICUBinary.skipBytes(inBytes, (indexesLength - inIndexes.length) * 4); 134 int length; // number of bytes in the index part local 137 length = inIndexes[IX_TOTAL_SIZE]; 139 length = inIndexes[indexesLength - 1]; 141 length = 0; // only indexes, and inLength was already checked for the [all...] |
/external/icu/icu4c/source/i18n/ |
number_padding.cpp | 56 rightIndex == string.length()); // fix the previous line to remove this assertion 58 int length = 0; local 61 length += mod1.apply(string, leftIndex, rightIndex, status); 62 length += mod2.apply(string, leftIndex, rightIndex + length, status); 63 return length; 69 length += addPaddingHelper(paddingCp, requiredPadding, string, leftIndex, status); 71 length += addPaddingHelper(paddingCp, requiredPadding, string, rightIndex + length, status); 73 length += mod1.apply(string, leftIndex, rightIndex + length, status) [all...] |
/frameworks/opt/bitmap/src/com/android/bitmap/util/ |
Exif.java | 35 * @param byteSize Recommended parameter declaring the length of the input stream. If you 62 has(jpeg, byteSize, offset + length - 1) 64 where length is a variable int (around 30KB above) read from the EXIF headers. 74 int length = 0; local 106 // Get the length and check if it is reasonable. 107 length = pack(jpeg, offset, 2, false); 108 if (length < 2 || !has(jpeg, byteSize, offset + length - 1)) { 109 Log.e(TAG, "Invalid length"); 114 if (marker == 0xE1 && length >= 8 & [all...] |
/frameworks/opt/photoviewer/src/com/android/ex/photo/util/ |
Exif.java | 30 * @param byteSize Recommended parameter declaring the length of the input stream. If you 57 has(jpeg, byteSize, offset + length - 1) 59 where length is a variable int (around 30KB above) read from the EXIF headers. 69 int length = 0; local 101 // Get the length and check if it is reasonable. 102 length = pack(jpeg, offset, 2, false); 103 if (length < 2 || !has(jpeg, byteSize, offset + length - 1)) { 104 Log.e(TAG, "Invalid length"); 109 if (marker == 0xE1 && length >= 8 & [all...] |
/libcore/luni/src/main/java/libcore/io/ |
NioBufferIterator.java | 29 private final int length; field in class:NioBufferIterator 34 NioBufferIterator(MemoryMappedFile file, long address, int length, boolean swap) { 40 if (length < 0) { 41 throw new IllegalArgumentException("length < 0"); 44 if (Long.compareUnsigned(address, MAX_VALID_ADDRESS - length) > 0) { 46 "length " + length + " would overflow 64-bit address space"); 48 this.length = length; 67 checkDstBounds(dstOffset, dst.length, byteCount) [all...] |
/toolchain/binutils/binutils-2.27/opcodes/ |
cgen-bitset.c | 43 mask->length = (bit_count / 8) + 1; 44 mask->bits = xmalloc (mask->length); 58 for (i = 0; i < mask->length; ++i) 117 if (mask1->length != mask2->length) 119 return memcmp (mask1->bits, mask2->bits, mask1->length); 134 limit = mask1->length < mask2->length ? mask1->length : mask2->length; [all...] |
/cts/tests/sensor/src/android/hardware/cts/helpers/sensorverification/ |
AbstractMeanVerification.java | 36 mSums = new float[event.values.length]; 38 Assert.assertEquals(mSums.length, event.values.length); 39 for (int i = 0; i < mSums.length; i++) { 60 float[] means = new float[mSums.length]; 61 for (int i = 0; i < mSums.length; i++) {
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/random/ |
UncorrelatedRandomVectorGenerator.java | 56 if (mean.length != standardDeviation.length) { 57 throw new DimensionMismatchException(mean.length, standardDeviation.length); 84 double[] random = new double[mean.length]; 85 for (int i = 0; i < random.length; ++i) {
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/paddings/ |
PKCS7Padding.java | 42 byte code = (byte)(in.length - inOff); 44 while (inOff < in.length) 59 int count = in[in.length - 1] & 0xff; 63 boolean failed = (count > in.length | count == 0); 65 for (int i = 0; i < in.length; i++) 67 failed |= (in.length - i <= count) & (in[i] != countAsbyte);
|
TBCPadding.java | 52 int count = in.length - inOff; 61 code = (byte)((in[in.length - 1] & 0x01) == 0 ? 0xff : 0x00); 64 while (inOff < in.length) 79 byte code = in[in.length - 1]; 81 int index = in.length - 1; 87 return in.length - index;
|
/external/brotli/csharp/org/brotli/dec/ |
Utils.cs | 20 /// , so it should be used for length not
25 /// <param name="length">number of bytes to change</param>
26 internal static void FillWithZeroes(byte[] dest, int offset, int length)
29 while (cursor < length)
31 int step = System.Math.Min(cursor + 1024, length) - cursor;
42 /// , so it should be used for length not
47 /// <param name="length">number of item to change</param>
48 internal static void FillWithZeroes(int[] dest, int offset, int length)
51 while (cursor < length)
53 int step = System.Math.Min(cursor + 1024, length) - cursor; [all...] |
/external/compiler-rt/lib/dfsan/ |
dfsan_interceptors.cc | 19 INTERCEPTOR(void *, mmap, void *addr, SIZE_T length, int prot, int flags, 21 void *res = REAL(mmap)(addr, length, prot, flags, fd, offset); 23 dfsan_set_label(0, res, RoundUpTo(length, GetPageSize())); 27 INTERCEPTOR(void *, mmap64, void *addr, SIZE_T length, int prot, int flags, 29 void *res = REAL(mmap64)(addr, length, prot, flags, fd, offset); 31 dfsan_set_label(0, res, RoundUpTo(length, GetPageSize()));
|
/external/libchrome/base/strings/ |
string_util_win.h | 26 int length = vsnprintf_s(buffer, size, size - 1, format, arguments); local 27 if (length < 0) 29 return length; 36 int length = _vsnwprintf_s(buffer, size, size - 1, format, arguments); local 37 if (length < 0) 39 return length;
|
/external/replicaisland/src/com/replica/replicaisland/ |
InputKeyboard.java | 35 assert keycode >= 0 && keycode < mKeys.length; 36 if (keycode >= 0 && keycode < mKeys.length){ 42 assert keycode >= 0 && keycode < mKeys.length; 43 if (keycode >= 0 && keycode < mKeys.length){ 49 final int count = mKeys.length; 60 final int count = mKeys.length;
|
/external/skia/src/core/ |
SkScalar.cpp | 13 const SkScalar values[], int length) { 14 SkASSERT(length > 0); 18 for (int i = 1; i < length; i++) 22 while (right < length && searchKey > keys[right]) 26 if (length == right) 27 return values[length-1];
|