| /libcore/ojluni/src/main/native/ |
| D | jni_util.c | 198 jmethodID mid; in JNU_CallStaticMethodByName() local
216 mid = (*env)->GetStaticMethodID(env, clazz, name, signature); in JNU_CallStaticMethodByName()
217 if (mid == 0) in JNU_CallStaticMethodByName()
222 (*env)->CallStaticVoidMethodV(env, clazz, mid, args); in JNU_CallStaticMethodByName()
226 result.l = (*env)->CallStaticObjectMethodV(env, clazz, mid, args); in JNU_CallStaticMethodByName()
229 result.z = (*env)->CallStaticBooleanMethodV(env, clazz, mid, args); in JNU_CallStaticMethodByName()
232 result.b = (*env)->CallStaticByteMethodV(env, clazz, mid, args); in JNU_CallStaticMethodByName()
235 result.c = (*env)->CallStaticCharMethodV(env, clazz, mid, args); in JNU_CallStaticMethodByName()
238 result.s = (*env)->CallStaticShortMethodV(env, clazz, mid, args); in JNU_CallStaticMethodByName()
241 result.i = (*env)->CallStaticIntMethodV(env, clazz, mid, args); in JNU_CallStaticMethodByName()
[all …]
|
| D | net_util_md.c | 210 int mid = a + (b-a)/2; in findMaxBuf() local
211 if (setsockopt(fd, SOL_SOCKET, opt, &mid, sizeof(int)) == 0) { in findMaxBuf()
212 limit = mid; in findMaxBuf()
213 a = mid + 1; in findMaxBuf()
216 b = mid - 1; in findMaxBuf()
734 jmethodID mid; in parseExclusiveBindProperty() local
740 mid = (*env)->GetStaticMethodID(env, iCls, "getProperty", in parseExclusiveBindProperty()
742 CHECK_NULL(mid); in parseExclusiveBindProperty()
743 flagSet = (*env)->CallStaticObjectMethod(env, iCls, mid, s); in parseExclusiveBindProperty()
|
| /libcore/ojluni/src/main/java/java/nio/ |
| D | CharBufferSpliterator.java | 57 int lo = index, mid = (lo + limit) >>> 1; in trySplit() local
58 return (lo >= mid) in trySplit()
60 : new CharBufferSpliterator(buffer, lo, index = mid); in trySplit()
|
| /libcore/ojluni/src/main/java/java/util/ |
| D | Arrays.java | 1344 int mid = (low + high) >>> 1; in mergeSort() local
1345 mergeSort(dest, src, low, mid, -off); in mergeSort()
1346 mergeSort(dest, src, mid, high, -off); in mergeSort()
1350 if (((Comparable)src[mid-1]).compareTo(src[mid]) <= 0) { in mergeSort()
1356 for(int i = destLow, p = low, q = mid; i < destHigh; i++) { in mergeSort()
1357 if (q >= high || p < mid && ((Comparable)src[p]).compareTo(src[q])<=0) in mergeSort()
1756 int mid = (low + high) >>> 1; in binarySearch0() local
1757 long midVal = a[mid]; in binarySearch0()
1760 low = mid + 1; in binarySearch0()
1762 high = mid - 1; in binarySearch0()
[all …]
|
| D | ArrayPrefixHelpers.java | 147 int mid = (l + h) >>> 1; in compute() local
149 new CumulateTask<T>(t, fn, a, org, fnc, th, mid, h); in compute()
151 new CumulateTask<T>(t, fn, a, org, fnc, th, l, mid); in compute()
299 int mid = (l + h) >>> 1; in compute() local
301 new LongCumulateTask(t, fn, a, org, fnc, th, mid, h); in compute()
303 new LongCumulateTask(t, fn, a, org, fnc, th, l, mid); in compute()
449 int mid = (l + h) >>> 1; in compute() local
451 new DoubleCumulateTask(t, fn, a, org, fnc, th, mid, h); in compute()
453 new DoubleCumulateTask(t, fn, a, org, fnc, th, l, mid); in compute()
599 int mid = (l + h) >>> 1; in compute() local
[all …]
|
| D | Spliterators.java | 934 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
935 return (lo >= mid) in trySplit()
937 : new ArraySpliterator<>(array, lo, index = mid, characteristics); in trySplit()
1019 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
1020 return (lo >= mid) in trySplit()
1022 : new IntArraySpliterator(array, lo, index = mid, characteristics); in trySplit()
1102 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
1103 return (lo >= mid) in trySplit()
1105 : new LongArraySpliterator(array, lo, index = mid, characteristics); in trySplit()
1185 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
[all …]
|
| D | Collections.java | 271 int mid = (low + high) >>> 1; in indexedBinarySearch() local
272 Comparable<? super T> midVal = list.get(mid); in indexedBinarySearch()
276 low = mid + 1; in indexedBinarySearch()
278 high = mid - 1; in indexedBinarySearch()
280 return mid; // key found in indexedBinarySearch()
293 int mid = (low + high) >>> 1; in iteratorBinarySearch() local
294 Comparable<? super T> midVal = get(i, mid); in iteratorBinarySearch()
298 low = mid + 1; in iteratorBinarySearch()
300 high = mid - 1; in iteratorBinarySearch()
302 return mid; // key found in iteratorBinarySearch()
[all …]
|
| D | ComparableTimSort.java | 261 int mid = (left + right) >>> 1; in binarySort() local
262 if (pivot.compareTo(a[mid]) < 0) in binarySort()
263 right = mid; in binarySort()
265 left = mid + 1; in binarySort()
|
| D | TimSort.java | 295 int mid = (left + right) >>> 1; in binarySort() local
296 if (c.compare(pivot, a[mid]) < 0) in binarySort()
297 right = mid; in binarySort()
299 left = mid + 1; in binarySort()
|
| D | PriorityQueue.java | 848 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
849 return (lo >= mid) ? null : in trySplit()
850 new PriorityQueueSpliterator<>(pq, lo, index = mid, in trySplit()
|
| D | AbstractList.java | 695 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
696 return (lo >= mid) ? null : // divide range in half unless too small in trySplit()
697 new RandomAccessSpliterator<>(this, lo, index = mid); in trySplit()
|
| D | Vector.java | 1393 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1394 return (lo >= mid) ? null : in trySplit()
1395 new VectorSpliterator<E>(list, array, lo, index = mid, in trySplit()
|
| D | ArrayList.java | 1354 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1355 return (lo >= mid) ? null : // divide range in half unless too small in trySplit()
1356 new ArrayListSpliterator<E>(list, lo, index = mid, in trySplit()
|
| D | TreeMap.java | 2577 int mid = (lo + hi) >>> 1; in buildFromSorted() local
2580 if (lo < mid) in buildFromSorted()
2581 left = buildFromSorted(level+1, lo, mid - 1, redLevel, in buildFromSorted()
2612 if (mid < hi) { in buildFromSorted()
2613 TreeMapEntry<K,V> right = buildFromSorted(level+1, mid+1, hi, redLevel, in buildFromSorted()
|
| /libcore/luni/src/test/java/libcore/java/util/concurrent/ |
| D | CountedCompleterTest.java | 57 int mid = (lo + hi) >>> 1; in chooseOne() local
60 new Task(this, mid, hi).fork(); // right child in chooseOne()
61 new Task(this, lo, mid).fork(); // left child in chooseOne()
|
| /libcore/ojluni/src/main/java/java/awt/font/ |
| D | NumericShaper.java | 576 int mid = (lo + hi) / 2; in rangeForCodePoint() local
577 Range range = ranges[mid]; in rangeForCodePoint()
579 hi = mid - 1; in rangeForCodePoint()
581 lo = mid + 1; in rangeForCodePoint()
|
| /libcore/ojluni/src/test/java/util/concurrent/tck/ |
| D | RecursiveActionTest.java | 1229 int mid = (lo + hi) >>> 1; in compute() local
1230 invokeAll(new SortTask(array, lo, mid), in compute()
1231 new SortTask(array, mid, hi)); in compute()
1232 merge(lo, mid, hi); in compute()
1240 void merge(int lo, int mid, int hi) { in merge() argument
1241 long[] buf = Arrays.copyOfRange(array, lo, mid); in merge()
1242 for (int i = 0, j = lo, k = mid; i < buf.length; j++) in merge()
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| D | RecursiveActionTest.java | 1217 int mid = (lo + hi) >>> 1; in compute() local
1218 invokeAll(new SortTask(array, lo, mid), in compute()
1219 new SortTask(array, mid, hi)); in compute()
1220 merge(lo, mid, hi); in compute()
1228 void merge(int lo, int mid, int hi) { in merge() argument
1229 long[] buf = Arrays.copyOfRange(array, lo, mid); in merge()
1230 for (int i = 0, j = lo, k = mid; i < buf.length; j++) in merge()
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | PriorityBlockingQueue.java | 957 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
958 return (lo >= mid) ? null : in trySplit()
959 new PBQSpliterator<E>(queue, array, lo, index = mid); in trySplit()
|