/dalvik/libcore/nio/src/main/java/java/nio/ |
H A D | ShortBuffer.java | 69 * The new buffer's position will be {@code start}, limit will be 70 * {@code start + len}, capacity will be the length of the array. 74 * @param start 75 * the start index, must not be negative and not greater than 79 * {@code array.length - start}. 82 * if either {@code start} or {@code len} is invalid. 84 public static ShortBuffer wrap(short[] array, int start, int len) { argument 88 if (start < 0 || len < 0 || (long) start + (long) len > array.length) { 93 buf.position = start; [all...] |
H A D | CharToByteBufferAdapter.java | 210 public CharSequence subSequence(int start, int end) { argument 211 if (start < 0 || end < start || end > remaining()) { 217 result.position(position + start);
|
/dalvik/libcore/concurrent/src/test/java/tests/api/java/util/concurrent/ |
H A D | FutureTaskTest.java | 171 t.start(); 200 t.start(); 239 t.start(); 278 t.start(); 316 t1.start(); 317 t2.start(); 355 t1.start(); 356 t2.start(); 427 t.start(); 453 t.start(); [all...] |
H A D | ReentrantLockTest.java | 132 t1.start(); 135 t2.start(); 161 t1.start(); 164 t2.start(); 190 t1.start(); 193 t2.start(); 232 t1.start(); 235 t2.start(); 267 t1.start(); 270 t2.start(); [all...] |
H A D | ThreadLocalTest.java | 70 child.start(); 98 progenitor.start();
|
/dalvik/libcore/xml/src/main/java/org/apache/xpath/objects/ |
H A D | XStringForFSB.java | 37 /** The start position in the fsb. */ 53 * @param start The start position in the array. 56 public XStringForFSB(FastStringBuffer val, int start, int length) argument 61 m_start = start; 240 * @param dstBegin the start offset in the destination array. 701 * @param fromIndex the index to start the search from. 761 int start = m_start + beginIndex; 763 return new XStringForFSB(fsb(), start, len); 795 int start [all...] |
/dalvik/vm/ |
H A D | LinearAlloc.c | 123 * Note we leave the first page empty (see below), and start the 175 * pages start out PROT_NONE, become read/write while we access them, 332 * page-align the start address, but don't have to make the length a 348 int cc, start, len; local 350 start = firstWriteOff; 351 assert(start <= nextOffset); 354 LOGVV("--- calling mprotect(start=%d len=%d RW)\n", start, len); 355 cc = mprotect(pHdr->mapAddr + start, len, PROT_READ | PROT_WRITE); 358 start, le 366 int i, start, end; local 697 dvmLinearAllocContains(const void* start, size_t length) argument [all...] |
H A D | LinearAlloc.h | 29 * Linear allocation state. We could tuck this into the start of the 37 char* mapAddr; /* start of mmap()ed region */ 115 * Determine if [start, start+length) is contained in the in-use area of 118 bool dvmLinearAllocContains(const void* start, size_t length);
|
H A D | UtfString.h | 113 void dvmCreateCstrFromStringRegion(StringObject* jstr, int start, int len,
|
/dalvik/libcore/icu/src/main/native/ |
H A D | BidiWrapper.cpp | 65 static jlong BidiWrapper_ubidi_setLine(JNIEnv* env, jclass, jlong ptr, jint start, jint limit) { argument 67 UBiDi* sized = ubidi_openSized(limit - start, 0, &err); 73 ubidi_setLine(data->mBiDi, start, limit, lineData->mBiDi, &err); 122 int start = 0; local 125 ubidi_getLogicalRun(data->mBiDi, start, &limit, &level); 126 jobject run = env->NewObject(bidiRunClass, bidiRunConstructor, start, limit, level); 128 start = limit;
|
/dalvik/libcore/luni/src/main/java/java/util/ |
H A D | EnumSet.java | 269 * @param start 277 public static <E extends Enum<E>> EnumSet<E> of(E start, E... others) { argument 278 EnumSet<E> set = of(start); 287 * by {@code start} and {@code end} (inclusive). All the elements must be in 290 * @param start 294 * @return an enum set with elements in the range from start to end. 296 * if any one of {@code start} or {@code end} is {@code null}. 298 * if {@code start} is behind {@code end}. 300 public static <E extends Enum<E>> EnumSet<E> range(E start, E end) { argument 301 if (start 309 setRange(E start, E end) argument [all...] |
/dalvik/libcore/luni/src/test/java/tests/api/java/io/ |
H A D | PipedReaderTest.java | 149 t.start(); 150 Thread.sleep(500); // Allow writer to start 179 t.start(); 180 Thread.sleep(500); // Allow writer to start 207 t.start(); 208 Thread.sleep(500); // Allow writer to start 250 writerThread.start(); 251 Thread.sleep(500); // Allow writer to start 272 t.start(); 273 Thread.sleep(500); // Allow writer to start [all...] |
H A D | PipedWriterTest.java | 136 readerThread.start(); 197 readerThread.start(); 228 readerThread.start(); 281 readerThread.start(); 368 writeThread.start(); 369 readThread.start(); 404 readerThread.start(); 469 writeThread.start(); 470 readThread.start();
|
/dalvik/libdex/ |
H A D | DexCatch.h | 132 u4 start = tries[0].startAddr; local 134 if (address < start) { 138 u4 end = start + tries[0].insnCount;
|
/dalvik/libcore/regex/src/test/java/org/apache/harmony/regex/tests/java/util/regex/ |
H A D | MatcherTest.java | 425 * @test java.util.regex.Matcher#start(int) 426 * test start(int) method. 430 notes = "Verifies the start(int group) method.", 431 method = "start", 439 int start = 3; 444 while (mat.find(start + j - 2)) { 446 assertEquals("Start is wrong for group " + i + " :" + mat.group(i), start, mat.start(i)); 448 assertEquals("Start is wrong for group " + i + " :" + mat.group(i), start + 4, mat.start( [all...] |
/dalvik/dx/src/junit/extensions/ |
H A D | ActiveTestSuite.java | 47 t.start();
|
/dalvik/libcore/icu/src/main/java/com/ibm/icu4jni/regex/ |
H A D | NativeRegEx.java | 80 public static native void setRegion(int regex, int start, int end); argument 83 * Queries the start of the region of the input to be considered during 127 * position at which a subsequent findNext() would start.
|
/dalvik/libcore/junit/src/main/java/junit/extensions/ |
H A D | ActiveTestSuite.java | 47 t.start();
|
/dalvik/libcore/xml/src/main/java/org/apache/xml/serializer/ |
H A D | SerializerTraceWriter.java | 208 * @param start Offset from which to start writing characters 215 public void write(final char chars[], final int start, final int length) argument 220 m_writer.write(chars, start, length); 242 final int n = length + start; 243 for (int i = start; i < n; i++)
|
/dalvik/libcore/xml/src/main/java/org/xml/sax/helpers/ |
H A D | XMLReaderAdapter.java | 298 * Adapt a SAX2 start prefix mapping event. 321 * Adapt a SAX2 start element event. 365 * @param start The starting position in the array. 371 public void characters (char ch[], int start, int length) 375 documentHandler.characters(ch, start, length); 383 * @param start The starting position in the array. 389 public void ignorableWhitespace (char ch[], int start, int length) 393 documentHandler.ignorableWhitespace(ch, start, length); 369 characters(char ch[], int start, int length) argument 387 ignorableWhitespace(char ch[], int start, int length) argument
|
/dalvik/tests/054-uncaught/src/ |
H A D | Main.java | 17 t.start();
|
/dalvik/tests/063-process-manager/src/ |
H A D | Main.java | 18 Process proc = pb.start();
|
/dalvik/libcore/luni/src/main/java/java/net/ |
H A D | InetAddress.java | 906 }.start(); 1116 * array starting with the high order byte at the index start. This method 1119 static void intToBytes(int value, byte bytes[], int start) { argument 1122 bytes[start] = (byte) ((value >> 24) & 255); 1123 bytes[start + 1] = (byte) ((value >> 16) & 255); 1124 bytes[start + 2] = (byte) ((value >> 8) & 255); 1125 bytes[start + 3] = (byte) (value & 255); 1130 * start as the high-order byte. This method makes no checks on the validity 1133 static int bytesToInt(byte bytes[], int start) { argument 1140 int value = ((bytes[start [all...] |
/dalvik/dx/tests/098-dex-jsr-ret-throw/ |
H A D | ViewDebug$ViewServer.class | ... defs= " () java.io.IOException e
public void start () public void stop () java.io.IOException e
public ... |
/dalvik/libcore/archive/src/main/java/java/util/zip/ |
H A D | ZipInputStream.java | 298 * @param start 305 public int read(byte[] buffer, int start, int length) throws IOException { argument 313 if (start > buffer.length || length < 0 || start < 0 314 || buffer.length - start < length) { 335 System.arraycopy(buf, lastRead, buffer, start, toRead); 338 crc.update(buffer, start, toRead); 349 read = inf.inflate(buffer, start, length); 356 crc.update(buffer, start, read);
|