/aosp14/frameworks/base/errorprone/refaster/ |
H A D | EfficientXml.java | 43 XmlUtils.writeIntAttribute(out, n, v); in beforeUtils() 53 out.attributeInt(null, n, v); in after() 70 out.attributeIntHex(null, n, v); in after() 92 return in.getAttributeInt(null, n); in after() 143 out.attributeLong(null, n, v); in after() 160 out.attributeLongHex(null, n, v); in after() 228 out.attributeFloat(null, n, v); in after() 262 out.attributeDouble(null, n, v); in after() 291 out.attributeBoolean(null, n, v); in after() 298 out.attribute(null, n, "true"); in before() [all …]
|
/aosp14/frameworks/base/core/java/android/hardware/ |
H A D | GeomagneticField.java | 202 for (int n = 1; n < MAX_N; n++) { in GeomagneticField() 367 for (int n = 1; n <= maxN; n++) { in LegendreTable() 368 mP[n] = new float[n + 1]; in LegendreTable() 369 mPDeriv[n] = new float[n + 1]; in LegendreTable() 375 } else if (n == 1 || m == n - 1) { in LegendreTable() 376 mP[n][m] = cos * mP[n - 1][m]; in LegendreTable() 380 assert n > 1 && m < n - 1; in LegendreTable() 383 mP[n][m] = cos * mP[n - 1][m] - k * mP[n - 2][m]; in LegendreTable() 400 for (int n = 1; n <= maxN; n++) { 401 schmidtQuasiNorm[n] = new float[n + 1]; [all …]
|
/aosp14/system/core/libutils/include/utils/ |
H A D | BitSet.h | 67 inline bool hasBit(uint32_t n) const { return hasBit(value, n); } in hasBit() 72 inline void markBit(uint32_t n) { markBit(value, n); } in markBit() 77 inline void clearBit(uint32_t n) { clearBit(value, n); } in clearBit() 106 return n; in clearFirstMarkedBit() 116 return n; in markFirstUnmarkedBit() 126 return n; in clearLastMarkedBit() 216 inline void markBit(uint32_t n) { markBit(value, n); } in markBit() 221 inline void clearBit(uint32_t n) { clearBit(value, n); } in clearBit() 256 return n; in clearFirstMarkedBit() 266 return n; in markFirstUnmarkedBit() [all …]
|
H A D | FastStrcmp.h | 44 const ssize_t n = s; // To help reject negative sizes, treat like zero in fastcmp() local 45 return __predict_true(n > 0) && in fastcmp() 46 ((*l != *r) || (__predict_true(n > 1) && cmp(l + 1, r + 1, n - 1))); in fastcmp() 51 const ssize_t n = s; // To help reject negative sizes, treat like zero in fasticmp() local 52 return __predict_true(n > 0) && in fasticmp() 53 ((tolower(*l) != tolower(*r)) || (__predict_true(n > 1) && cmp(l + 1, r + 1, n - 1))); in fasticmp() 60 const ssize_t n = s; // To help reject negative sizes, treat like zero in fastcmp() local 61 return __predict_true(n > 0) && in fastcmp() 62 ((*l != *r) || (__predict_true(n > 1) && cmp(l + 1, r + 1, n - 1))); in fastcmp()
|
H A D | TypeHelpers.h | 137 n--; 147 n--; 165 while (n > 0) { 166 n--; 176 n--; 182 n--; 205 d += n; 206 s += n; 207 while (n > 0) { 208 n--; [all …]
|
/aosp14/frameworks/base/core/java/android/text/format/ |
H A D | Time.java | 436 year = n; in parseInternal() 441 n--; in parseInternal() 442 month = n; in parseInternal() 447 monthDay = n; in parseInternal() 462 hour = n; in parseInternal() 565 year = n; in parse3339Internal() 572 --n; in parse3339Internal() 573 month = n; in parse3339Internal() 1144 n %= 100; in format2445() 1146 n %= 10; in format2445() [all …]
|
/aosp14/frameworks/base/core/tests/coretests/src/android/app/ |
H A D | NotificationHistoryTest.java | 119 history.addNotificationToWrite(n); in testAddNotificationToWrite() 134 history.addNotificationToWrite(n); in testAddNotificationsToWrite() 170 history.addNotificationToWrite(n); in testPoolStringsFromNotifications() 200 history.addNotificationToWrite(n); in testAddPooledStrings() 225 HistoricalNotification n = in testRemoveNotificationsFromWrite() local 238 history.addNotificationToWrite(n); in testRemoveNotificationsFromWrite() 275 history.addNotificationToWrite(n); in testRemoveNotificationFromWrite() 312 history.addNotificationToWrite(n); in testRemoveConversationNotificationFromWrite() 351 history.addNotificationToWrite(n); in testRemoveChannelFromWrite() 380 expectedEntries.add(n); in testParceling() [all …]
|
/aosp14/frameworks/base/tests/StatusBar/src/com/android/statusbartest/ |
H A D | NotificationTestList.java | 124 mNM.notify(7001, n); 456 mNM.notify(1, n); 483 mNM.notify(1, n); 501 mNM.notify(1, n); 516 mNM.notify(1, n); 568 mNM.notify(1, n); 581 mNM.notify(1, n); 594 mNM.notify(1, n); 608 mNM.notify(1, n); 622 mNM.notify(1, n); [all …]
|
/aosp14/frameworks/base/services/tests/uiservicestests/src/com/android/server/notification/ |
H A D | NotificationHistoryProtoHelperTest.java | 88 expectedEntries.add(n); in testReadWriteNotifications() 89 history.addNotificationToWrite(n); in testReadWriteNotifications() 115 expectedEntries.add(n); in testReadWriteNotifications_stringFieldsPersistedEvenIfNoPool() 116 history.addNotificationToWrite(n); in testReadWriteNotifications_stringFieldsPersistedEvenIfNoPool() 141 HistoricalNotification n = in testReadNotificationsWithPkgFilter() local 151 expectedEntries.add(n); in testReadNotificationsWithPkgFilter() 153 history.addNotificationToWrite(n); in testReadNotificationsWithPkgFilter() 193 expectedEntries.add(n); in testReadNotificationsWithNumberFilter() 245 expectedEntries.add(n); in testReadNotificationsWithNumberFilter_preExistingNotifs() 278 expectedEntries.add(n); in testReadMergeIntoExistingHistory() [all …]
|
/aosp14/frameworks/base/core/java/android/os/ |
H A D | MessageQueue.java | 687 p = n; in removeMessages() 694 if (n.target == h && n.what == what in removeMessages() 702 p = n; in removeMessages() 721 p = n; in removeEqualMessages() 728 if (n.target == h && n.what == what in removeEqualMessages() 736 p = n; in removeEqualMessages() 755 p = n; in removeMessages() 762 if (n.target == h && n.callback == r in removeMessages() 796 if (n.target == h && n.callback == r in removeEqualMessages() 881 p = n; in removeAllMessagesLocked() [all …]
|
H A D | HwBlob.java | 346 final int n = array.length; in wrapArray() local 348 for (int i = 0; i < n; ++i) { in wrapArray() 361 final int n = array.length; in wrapArray() local 363 for (int i = 0; i < n; ++i) { in wrapArray() 376 final int n = array.length; in wrapArray() local 378 for (int i = 0; i < n; ++i) { in wrapArray() 391 final int n = array.length; in wrapArray() local 393 for (int i = 0; i < n; ++i) { in wrapArray() 406 final int n = array.length; in wrapArray() local 421 final int n = array.length; in wrapArray() local [all …]
|
H A D | RevocableFileDescriptor.java | 130 int n = 0; 131 while (n < size) { 133 n += Os.pread(mInner, data, n, size - n, offset + n); 136 n += e.bytesTransferred; 139 return n; 145 int n = 0; 146 while (n < size) { 148 n += Os.pwrite(mInner, data, n, size - n, offset + n); 151 n += e.bytesTransferred; 154 return n;
|
H A D | RedactingFileDescriptor.java | 157 int n = 0; 158 while (n < size) { 160 final int res = Os.pread(mInner, data, n, size - n, offset + n); 164 n += res; 167 n += e.bytesTransferred; 189 return n; 194 int n = 0; 195 while (n < size) { 197 final int res = Os.pwrite(mInner, data, n, size - n, offset + n); 201 n += res; [all …]
|
H A D | HwParcel.java | 209 final int n = val.size(); in writeBoolVector() local 211 for (int i = 0; i < n; ++i) { in writeBoolVector() 223 final int n = val.size(); in writeInt8Vector() local 224 byte[] array = new byte[n]; in writeInt8Vector() 237 final int n = val.size(); in writeInt16Vector() local 251 final int n = val.size(); in writeInt32Vector() local 252 int[] array = new int[n]; in writeInt32Vector() 265 final int n = val.size(); in writeInt64Vector() local 266 long[] array = new long[n]; in writeInt64Vector() 279 final int n = val.size(); in writeFloatVector() local [all …]
|
/aosp14/frameworks/base/tests/JankBench/scripts/external/ |
H A D | statistics.py | 329 if n < 1: 352 if n == 0: 354 if n%2 == 1: 357 i = n//2 375 if n == 0: 377 if n%2 == 1: 397 if n == 0: 430 if n == 0: 432 elif n == 1: 554 if n < 2: [all …]
|
/aosp14/frameworks/base/core/java/android/app/ |
H A D | WindowConfiguration.java | 659 if (n != 0) return n; in compareTo() 661 if (n != 0) return n; in compareTo() 663 if (n != 0) return n; in compareTo() 665 if (n != 0) return n; in compareTo() 668 if (n != 0) return n; in compareTo() 670 if (n != 0) return n; in compareTo() 672 if (n != 0) return n; in compareTo() 674 if (n != 0) return n; in compareTo() 677 if (n != 0) return n; in compareTo() 679 if (n != 0) return n; in compareTo() [all …]
|
/aosp14/frameworks/base/core/java/android/util/ |
H A D | SparseSetArray.java | 49 public boolean add(int n, T value) { in add() argument 50 ArraySet<T> set = mData.get(n); in add() 53 mData.put(n, set); in add() 66 ArraySet<T> set = mData.get(n); in addAll() 69 mData.put(n, set); in addAll() 96 public ArraySet<T> get(int n) { in get() argument 97 return mData.get(n); in get() 104 public boolean remove(int n, T value) { in remove() argument 111 mData.remove(n); in remove() 119 public void remove(int n) { in remove() argument [all …]
|
H A D | Spline.java | 135 final int n = x.length; in MonotoneCubicSpline() local 137 float[] m = new float[n]; in MonotoneCubicSpline() 154 m[n - 1] = d[n - 2]; in MonotoneCubicSpline() 185 final int n = mX.length; in interpolate() local 192 if (x >= mX[n - 1]) { in interpolate() 193 return mY[n - 1]; in interpolate() 217 final int n = mX.length; in toString() local 254 final int n = mX.length; in interpolate() local 261 if (x >= mX[n - 1]) { in interpolate() 262 return mY[n - 1]; in interpolate() [all …]
|
/aosp14/frameworks/base/services/backup/java/com/android/server/backup/transport/ |
H A D | TransportStats.java | 80 pw.println(String.format(Locale.US, "%sNumber of connections: %d ", prefix, stats.n)); in dumpStats() 86 a.n + b.n, in merge() 87 (a.average * a.n + b.average * b.n) / (a.n + b.n), in merge() 92 public int n; field in TransportStats.Stats 98 n = 0; in Stats() 104 private Stats(int n, double average, long max, long min) { in Stats() argument 105 this.n = n; in Stats() 112 this(original.n, original.average, original.max, original.min); in Stats() 116 average = (average * n + sample) / (n + 1); in register() 117 n++; in register()
|
/aosp14/frameworks/base/core/jni/android/opengl/ |
H A D | poly_clip.cpp | 43 if ((q)->n==0) {p1->n = 0; return POLY_CLIP_OUT;} \ 67 q->n = 0; in poly_clip_to_halfspace() 70 u = &p->vert[p->n-1]; in poly_clip_to_halfspace() 72 for (v= &p->vert[0], i=p->n; i>0; i--, u=v, tu=tv, v++) { in poly_clip_to_halfspace() 81 wp = (float *)&q->vert[q->n].sx; in poly_clip_to_halfspace() 85 q->n++; in poly_clip_to_halfspace() 88 q->vert[q->n++] = *v; in poly_clip_to_halfspace() 114 for (v=p1->vert, i=p1->n; i>0; i--, v++) { in poly_clip_to_frustum() 129 if (x0out==p1->n || x1out==p1->n || y0out==p1->n || in poly_clip_to_frustum() 130 y1out==p1->n || z0out==p1->n || z1out==p1->n) { in poly_clip_to_frustum() [all …]
|
/aosp14/frameworks/base/services/core/java/com/android/server/utils/ |
H A D | WatchedSparseSetArray.java | 61 public boolean add(int n, T value) { in add() argument 62 final boolean res = mStorage.add(n, value); in add() 71 mStorage.addAll(n, values); in addAll() 86 public boolean contains(int n, T value) { in contains() argument 87 return mStorage.contains(n, value); in contains() 93 public ArraySet<T> get(int n) { in get() argument 94 return mStorage.get(n); in get() 101 public boolean remove(int n, T value) { in remove() argument 102 if (mStorage.remove(n, value)) { in remove() 112 public void remove(int n) { in remove() argument [all …]
|
/aosp14/frameworks/base/libs/hwui/tests/scripts/ |
H A D | skp-capture.sh | 69 printf '\n=====================\n' 71 printf '\n=====================\n' 87 printf '\bTimed out.\n' 116 printf '\bTimed out.\n' 133 printf '\nSKP saved to file:\n %s\n\n' "$local_path"
|
/aosp14/frameworks/base/core/tests/coretests/src/android/util/ |
H A D | LongArrayQueueTest.java | 66 int n = 890; in addLastRemoveFirstFifo() local 68 for (int i = 0; i < n; i++) { in addLastRemoveFirstFifo() 74 while (removes < n) { in addLastRemoveFirstFifo() 151 int n = 25; in peekFirstVsRemoveFirst() local 152 for (int i = 0; i < n; i++) { in peekFirstVsRemoveFirst() 155 for (int i = 0; i < n; i++) { in peekFirstVsRemoveFirst() 199 int n = 520; in getInvalidPositions() local 203 for (int i = 0; i < n; i++) { in getInvalidPositions() 213 mQueueUnderTest.get(n); in getInvalidPositions() 214 fail("get(" + n + ") succeeded on a queue with " + n + " elements"); in getInvalidPositions() [all …]
|
/aosp14/frameworks/base/identity/java/android/security/identity/ |
H A D | Util.java | 40 int n = 0; in stripLeadingZeroes() local 41 while (n < value.length && value[n] == 0) { in stripLeadingZeroes() 42 n++; in stripLeadingZeroes() 44 int newLen = value.length - n; in stripLeadingZeroes() 47 while (n < value.length) { in stripLeadingZeroes() 48 ret[m++] = value[n++]; in stripLeadingZeroes() 83 for (int n = 0; n < 32 - xBytes.length; n++) { in publicKeyEncodeUncompressedForm() 92 for (int n = 0; n < 32 - yBytes.length; n++) { in publicKeyEncodeUncompressedForm()
|
/aosp14/frameworks/base/packages/WallpaperCropper/src/com/android/gallery3d/common/ |
H A D | Utils.java | 79 public static int nextPowerOf2(int n) { in nextPowerOf2() argument 80 if (n <= 0 || n > (1 << 30)) throw new IllegalArgumentException("n is invalid: " + n); in nextPowerOf2() 81 n -= 1; in nextPowerOf2() 82 n |= n >> 16; in nextPowerOf2() 83 n |= n >> 8; in nextPowerOf2() 84 n |= n >> 4; in nextPowerOf2() 85 n |= n >> 2; in nextPowerOf2() 86 n |= n >> 1; in nextPowerOf2() 87 return n + 1; in nextPowerOf2() 95 return Integer.highestOneBit(n); in prevPowerOf2() [all …]
|