/system/core/adb/ |
commandline.h | 30 virtual void OnStdout(const char* buffer, int length) = 0; 33 virtual void OnStderr(const char* buffer, int length) = 0; 43 static void OnStream(std::string* string, FILE* stream, const char* buffer, int length) { 45 string->append(buffer, length); 47 fwrite(buffer, 1, length, stream); 67 void OnStdout(const char* buffer, int length) { 68 OnStream(stdout_str_, stdout, buffer, length); 71 void OnStderr(const char* buffer, int length) { 72 OnStream(stderr_str_, stderr, buffer, length);
|
/system/libhidl/transport/memory/1.0/ |
IMemory.hal | 29 * start + length must be < size 32 * @param length Number of bytes to be updated. 34 updateRange(uint64_t start, uint64_t length); 45 * @param length Number of bytes to be read. 47 readRange(uint64_t start, uint64_t length);
|
/system/nfc/utils/include/ |
ringbuffer.h | 45 // Attempts to insert up to |length| bytes of data at |p| into the buffer 46 // Return actual number of bytes added. Can be less than |length| if buffer 48 size_t ringbuffer_insert(ringbuffer_t* rb, const uint8_t* p, size_t length); 50 // Peek |length| number of bytes from the ringbuffer, starting at |offset|, 52 // than |length| if there is less than |length| data available. |offset| must 55 size_t length); 58 size_t ringbuffer_pop(ringbuffer_t* rb, uint8_t* p, size_t length); 60 // Deletes |length| bytes from the ringbuffer starting from the head 62 size_t ringbuffer_delete(ringbuffer_t* rb, size_t length); [all...] |
/system/security/keystore/include/keystore/ |
keystore_get.h | 30 * length. The third argument is a pointer to an array that will be malloc() 33 ssize_t keystore_get(const char* key, size_t length, uint8_t** value);
|
/toolchain/binutils/binutils-2.27/ld/testsuite/ld-mmix/ |
bspec808.s | 2 TETRA 2 % Decent section length name (in 32-bit words). 5 TETRA 0xff00,0 % Indecent section length
|
/tools/apksig/src/main/java/com/android/apksig/internal/util/ |
RandomAccessFileDataSink.java | 66 public void consume(byte[] buf, int offset, int length) throws IOException { 69 // is negative but length is 0 72 if (offset > buf.length) { 74 // is too large but length is 0 76 "offset: " + offset + ", buf.length: " + buf.length); 78 if (length == 0) { 84 mFile.write(buf, offset, length); 85 mPosition += length; 91 int length = buf.remaining() local [all...] |
/tools/apkzlib/src/main/java/com/android/tools/build/apkzlib/zip/utils/ |
RandomAccessFileUtils.java | 43 while ((r = raf.read(data, p, data.length - p)) > 0) { 45 if (p == data.length) { 50 if (p < data.length) { 53 + data.length
|
/external/caliper/examples/src/main/java/examples/ |
StringBuilderBenchmark.java | 29 @Param({"1", "10", "100"}) private int length; field in class:StringBuilderBenchmark 35 for (int j = 0; j < length; ++j) { 45 for (int j = 0; j < length; ++j) { 55 for (int j = 0; j < length; ++j) { 65 for (int j = 0; j < length; ++j) { 75 for (int j = 0; j < length; ++j) { 85 for (int j = 0; j < length; ++j) { 95 for (int j = 0; j < length; ++j) { 105 for (int j = 0; j < length; ++j) { 115 for (int j = 0; j < length; ++j) 144 final int length = Math.min(this.length, MIN_SURROGATE); local 160 final int length = Math.min(this.length, MIN_SURROGATE); local 177 final int length = Math.min(this.length, MIN_SURROGATE); local [all...] |
/external/syslinux/com32/gpllib/acpi/ |
madt.c | 41 uint8_t length = *q; local 57 sla->length = length; 66 sio->length = length; 78 siso->length = length; 90 snmi->length = length; 98 slan->length = length [all...] |
/frameworks/opt/chips/tests/src/com/android/ex/chips/ |
ChipsTest.java | 112 public int length() { method in class:ChipsTest.MockRecipientEditTextView 113 return mEditable != null ? mEditable.length() : 0; 190 int firstEnd = firstStart + first.trim().length(); 192 int secondEnd = secondStart + second.trim().length(); 193 mEditable.setSpan(mMockRecips[mMockRecips.length - 2], firstStart, firstEnd, 0); 194 mEditable.setSpan(mMockRecips[mMockRecips.length - 1], secondStart, secondEnd, 0); 199 assertEquals(editableString.indexOf(second), secondStart - extra.length()); 208 firstEnd = firstStart + first.length(); 209 mEditable.setSpan(mMockRecips[mMockRecips.length - 1], firstStart, firstEnd, 0); 212 assertEquals(mEditable.getSpanStart(mMockRecips[mMockRecips.length - 1]), firstStar 809 .length(), DrawableRecipientChip.class).length, 0); method 831 .length(), DrawableRecipientChip.class).length, 0); method 843 .length(), DrawableRecipientChip.class).length, 1); method [all...] |
/art/test/525-checker-arrays-fields1/src/ |
Main.java | 67 for (int i = 0; i < sArrZ.length; i++) { 81 for (int i = 0; i < sArrB.length; i++) { 95 for (int i = 0; i < sArrC.length; i++) { 109 for (int i = 0; i < sArrS.length; i++) { 123 for (int i = 0; i < sArrI.length; i++) { 137 for (int i = 0; i < sArrJ.length; i++) { 151 for (int i = 0; i < sArrF.length; i++) { 165 for (int i = 0; i < sArrD.length; i++) { 179 for (int i = 0; i < sArrL.length; i++) { 190 for (int i = 0; i < sArrZ.length; i++) [all...] |
/art/test/525-checker-arrays-fields2/src/ |
Main.java | 67 for (int i = 0; i < mArrZ.length; i++) { 81 for (int i = 0; i < mArrB.length; i++) { 95 for (int i = 0; i < mArrC.length; i++) { 109 for (int i = 0; i < mArrS.length; i++) { 123 for (int i = 0; i < mArrI.length; i++) { 137 for (int i = 0; i < mArrJ.length; i++) { 151 for (int i = 0; i < mArrF.length; i++) { 165 for (int i = 0; i < mArrD.length; i++) { 179 for (int i = 0; i < mArrL.length; i++) { 190 for (int i = 0; i < mArrZ.length; i++) [all...] |
/cts/tests/tests/renderscriptlegacy/src/android/renderscriptlegacy/cts/ |
RSUtils.java | 56 for (int i = 0; i < array.length; i++) { 68 for (int i = 0; i < array.length; i++) { 74 for (int i = 0; i < sInterestingDoubles.length; i++) { 77 array[r.nextInt(array.length)] = d; 80 array[r.nextInt(array.length)] = min; 81 array[r.nextInt(array.length)] = max; 83 array[r.nextInt(array.length)] = Double.NaN; 84 array[r.nextInt(array.length)] = Double.POSITIVE_INFINITY; 85 array[r.nextInt(array.length)] = Double.NEGATIVE_INFINITY; 86 array[r.nextInt(array.length)] = Double.MIN_VALUE [all...] |
/external/icu/icu4c/source/common/ |
bytestrie.cpp | 81 BytesTrie::branchNext(const uint8_t *pos, int32_t length, int32_t inByte) { 83 if(length==0) { 84 length=*pos++; 86 ++length; 87 // The length of the branch is the number of bytes to select from. 89 while(length>kMaxBranchLinearSubNodeLength) { 91 length>>=1; 94 length=length-(length>>1) 158 int32_t length=node-kMinLinearMatch; \/\/ Actual match length minus 1. local [all...] |
ucharstrie.cpp | 62 UCharsTrie::branchNext(const UChar *pos, int32_t length, int32_t uchar) { 64 if(length==0) { 65 length=*pos++; 67 ++length; 68 // The length of the branch is the number of units to select from. 70 while(length>kMaxBranchLinearSubNodeLength) { 72 length>>=1; 75 length=length-(length>>1) 131 int32_t length=node-kMinLinearMatch; \/\/ Actual match length minus 1. local 160 int32_t length=remainingMatchLength_; \/\/ Actual remaining match length minus 1. local 188 int32_t length=remainingMatchLength_; \/\/ Actual remaining match length minus 1. local 403 getNextBranchUChars(jumpByDelta(pos), length>>1, out); local [all...] |
udataswp.cpp | 34 const void *inData, int32_t length, void *outData, 44 if(ds==NULL || inData==NULL || length<0 || (length&1)!=0 || outData==NULL) { 52 count=length/2; 59 return length; 64 const void *inData, int32_t length, void *outData, 69 if(ds==NULL || inData==NULL || length<0 || (length&1)!=0 || outData==NULL) { 74 if(length>0 && inData!=outData) { 75 uprv_memcpy(outData, inData, length); [all...] |
/frameworks/base/tests/HwAccelerationTest/src/com/android/test/hwui/ |
Lines2Activity.java | 89 private void drawVerticalLine(Canvas canvas, Paint p, float length, float x, float y) { 90 canvas.drawLine(x, y, x, y + length, p); 93 private void drawDiagonalLine(Canvas canvas, Paint p, float length, float x, float y) { 94 canvas.drawLine(x, y, x + length, y + length, p); 161 for (float length = 1; length <= 10; length +=1 ) { 163 drawVerticalLine(canvas, p, length, x, yOffset); 166 drawVerticalLine(canvas, p, length, x, yOffset) [all...] |
/device/linaro/bootloader/arm-trusted-firmware/lib/semihosting/ |
semihosting.c | 28 size_t length; member in struct:__anon4080 75 long semihosting_file_read(long file_handle, size_t *length, uintptr_t buffer) 80 if ((length == NULL) || (buffer == (uintptr_t)NULL)) 85 read_block.length = *length; 90 if (result == *length) { 92 } else if (result < *length) { 93 *length -= result; 100 size_t *length, 106 if ((length == NULL) || (buffer == (uintptr_t)NULL) 162 size_t length; local 181 size_t length; local [all...] |
/external/icu/android_icu4j/src/main/java/android/icu/util/ |
BytesTrie.java | 220 int length=remainingMatchLength_; // Actual remaining match length minus 1. local 221 if(length>=0) { 224 remainingMatchLength_=--length; 227 return (length<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ? 261 int length=remainingMatchLength_; // Actual remaining match length minus 1. local 268 remainingMatchLength_=length; 271 return (length<0 && (node=(bytes_[pos]&0xff))>=kMinValueLead) ? 275 if(length<0) 521 int length=remainingMatchLength_+1; \/\/ Remaining match length. local 558 int length=(int)top; local 602 int length=node-kMinLinearMatch+1; local 827 int length=node-kMinLinearMatch; \/\/ Actual match length minus 1. local [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
BytesTrie.java | 237 int length=remainingMatchLength_; // Actual remaining match length minus 1. local 238 if(length>=0) { 241 remainingMatchLength_=--length; 244 return (length<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ? 279 int length=remainingMatchLength_; // Actual remaining match length minus 1. local 286 remainingMatchLength_=length; 289 return (length<0 && (node=(bytes_[pos]&0xff))>=kMinValueLead) ? 293 if(length<0) 553 int length=remainingMatchLength_+1; \/\/ Remaining match length. local 592 int length=(int)top; local 636 int length=node-kMinLinearMatch+1; local 862 int length=node-kMinLinearMatch; \/\/ Actual match length minus 1. local [all...] |
/external/oj-libjdwp/src/share/back/ |
ArrayReferenceImpl.c | 32 length(PacketInputStream *in, PacketOutputStream *out) function 48 newComponents(PacketOutputStream *out, jint length, size_t nbytes) 52 if ( length > 0 ) { 53 ptr = jvmtiAllocate(length*((jint)nbytes)); 57 (void)memset(ptr, 0, length*nbytes); 71 jarray array, jint index, jint length) 75 components = newComponents(out, length, sizeof(jboolean)); 78 JNI_FUNC_PTR(env,GetBooleanArrayRegion)(env, array, index, length, components); 79 for (i = 0; i < length; i++) { 88 jarray array, jint index, jint length) 235 jint length; local 483 jint length; local [all...] |
/frameworks/base/core/java/android/ddm/ |
DdmHandleHello.java | 68 new Chunk(ChunkHandler.type("TEST"), data, 1, data.length-2); 134 if (vmInstructionSet != null && vmInstructionSet.length() > 0) { 142 + vmIdent.length() * 2 143 + appName.length() * 2 144 + instructionSetDescription.length() * 2 145 + vmFlags.length() * 2 150 out.putInt(vmIdent.length()); 151 out.putInt(appName.length()); 155 out.putInt(instructionSetDescription.length()); 157 out.putInt(vmFlags.length()); [all...] |
/libcore/luni/src/test/java/libcore/java/lang/ |
StringBuilderTest.java | 28 sb.deleteCharAt(sb.length() - 1); 56 sb.delete(sb.length() - 3, sb.length()); 71 sb.deleteCharAt(sb.length()); 89 sb.delete(sb.length(), sb.length() + 2); 90 sb.delete(sb.length(), sb.length()); 97 sb.delete(sb.length() + 2, sb.length() + 3) [all...] |
/dalvik/libdex/ |
SysUtil.cpp | 37 * Create an anonymous shared memory segment large enough to hold "length" 41 static void* sysCreateAnonShmem(size_t length) 46 ptr = mmap(NULL, length, PROT_READ | PROT_WRITE, 49 ALOGW("mmap(%d, RW, SHARED|ANON) failed: %s", (int) length, 64 int sysCreatePrivateMap(size_t length, MemMapping* pMap) 68 memPtr = sysCreateAnonShmem(length); 73 pMap->length = pMap->baseLength = length; 78 * Determine the current offset and remaining length of the open file. 83 size_t length; local 117 size_t length; local 155 size_t length; local [all...] |
/frameworks/base/core/java/com/android/internal/database/ |
SortCursor.java | 59 int length = mCursors.length; local 60 mSortColumns = new int[length]; 61 for (int i = 0 ; i < length ; i++) { 74 for (int j = 0 ; j < length; j++) { 84 for (int i = mRowNumCache.length - 1; i >= 0; i--) { 87 mCurRowNumCache = new int[ROWCACHESIZE][length]; 94 int length = mCursors.length; local 95 for (int i = 0 ; i < length ; i++) 132 int length = mCursors.length; local 245 int length = mCursors.length; local 258 int length = mCursors.length; local 267 int length = mCursors.length; local 276 int length = mCursors.length; local 286 int length = mCursors.length; local 297 int length = mCursors.length; local [all...] |