/frameworks/ml/nn/tools/systrace_parser/parser/test/ |
D | omr1.txt | 8 Application n/a n/a n/a n/a n/a n/a … 11 Driver 74.51 - 544.97 n/a n/a n/a … 15 * This total ignores missing (n/a) values and thus is not necessarily consistent with the rest of t… 23 Application n/a n/a n/a n/a n/a n/a … 26 Driver - - 522.53 n/a n/a n/a … 30 * This total ignores missing (n/a) values and thus is not necessarily consistent with the rest of t… 38 Application n/a n/a n/a n/a n/a n/a … 41 Driver - - 544.36 n/a n/a n/a … 45 * This total ignores missing (n/a) values and thus is not necessarily consistent with the rest of t… 53 Application n/a n/a n/a n/a n/a n/a … [all …]
|
D | unittest.txt | 8 Application n/a 0.46 1.77 n/a n/a 6.58 … 11 Driver 1.04 - 1779.21 n/a n/a n/a … 15 * This total ignores missing (n/a) values and thus is not necessarily consistent with the rest of t… 23 Application n/a 1.46 0.01 n/a n/a 2.54 … 26 Driver - - - n/a n/a n/a … 31 * This total ignores missing (n/a) values and thus is not necessarily consistent with the rest of t…
|
D | old.txt | 8 …ication n/a n/a n/a n/a n/a n/a … 11 Driver 0.06 - 69.54 n/a n/a n/a … 15 * This total ignores missing (n/a) values and thus is not necessarily consistent with the rest of t…
|
D | cpu.txt | 8 Application n/a n/a n/a n/a n/a n/a … 11 Driver 0.90 - - n/a n/a n/a … 16 * This total ignores missing (n/a) values and thus is not necessarily consistent with the rest of t…
|
D | hdrnet.txt | 8 Application n/a n/a n/a n/a n/a n/a … 11 Driver 0.91 - 204.60 n/a n/a n/a … 15 * This total ignores missing (n/a) values and thus is not necessarily consistent with the rest of t…
|
/frameworks/base/core/java/android/hardware/ |
D | GeomagneticField.java | 202 for (int n = 1; n < MAX_N; n++) { in GeomagneticField() 203 for (int m = 0; m <= n; m++) { in GeomagneticField() 205 float g = G_COEFF[n][m] + yearsSinceBase * DELTA_G[n][m]; in GeomagneticField() 206 float h = H_COEFF[n][m] + yearsSinceBase * DELTA_H[n][m]; in GeomagneticField() 213 gcX += relativeRadiusPower[n+2] in GeomagneticField() 215 * legendre.mPDeriv[n][m] in GeomagneticField() 216 * SCHMIDT_QUASI_NORM_FACTORS[n][m]; in GeomagneticField() 220 gcY += relativeRadiusPower[n+2] * m in GeomagneticField() 222 * legendre.mP[n][m] in GeomagneticField() 223 * SCHMIDT_QUASI_NORM_FACTORS[n][m] in GeomagneticField() [all …]
|
/frameworks/av/media/libstagefright/codecs/m4v_h263/enc/src/ |
D | rate_control.cpp | 60 Int n; in RC_Initialize() local 62 for (n = 0; n < numLayers; n++) in RC_Initialize() 65 rc[n]->fine_frame_skip = encParams->FineFrameSkip_Enabled; in RC_Initialize() 66 rc[n]->no_frame_skip = encParams->NoFrameSkip_Enabled; in RC_Initialize() 67 rc[n]->no_pre_skip = encParams->NoPreSkip_Enabled; in RC_Initialize() 68 rc[n]->skip_next_frame = 0; /* must be initialized */ in RC_Initialize() 71 rc[n]->Bs = video->encParams->BufferSize[n]; in RC_Initialize() 72 rc[n]->TMN_W = 0; in RC_Initialize() 73 rc[n]->VBV_fullness = (Int)(rc[n]->Bs * 0.5); /* rc[n]->Bs */ in RC_Initialize() 74 rc[n]->encoded_frames = 0; in RC_Initialize() [all …]
|
/frameworks/opt/net/wifi/service/java/com/android/server/wifi/util/ |
D | Matrix.java | 23 public final int n; field in Matrix 34 n = rows; in Matrix() 49 n = (values.length + stride - 1) / stride; in Matrix() 52 if (mem.length != n * m) throw new IllegalArgumentException(); in Matrix() 61 n = that.n; in Matrix() 78 if (!(0 <= i && i < n && 0 <= j && j < m)) throw new IndexOutOfBoundsException(); in get() 91 if (!(0 <= i && i < n && 0 <= j && j < m)) throw new IndexOutOfBoundsException(); in put() 103 return plus(that, new Matrix(n, m)); in plus() 116 if (!(this.n == that.n && this.m == that.m && this.n == result.n && this.m == result.m)) { in plus() 133 return minus(that, new Matrix(n, m)); in minus() [all …]
|
/frameworks/base/core/java/android/text/format/ |
D | Time.java | 268 int n = DAYS_PER_MONTH[this.month]; in getActualMaximum() local 269 if (n != 28) { in getActualMaximum() 270 return n; in getActualMaximum() 431 int n = getChar(s, 0, 1000); in parseInternal() local 432 n += getChar(s, 1, 100); in parseInternal() 433 n += getChar(s, 2, 10); in parseInternal() 434 n += getChar(s, 3, 1); in parseInternal() 435 year = n; in parseInternal() 438 n = getChar(s, 4, 10); in parseInternal() 439 n += getChar(s, 5, 1); in parseInternal() [all …]
|
/frameworks/libs/net/common/device/android/net/ |
D | NetworkFactory.java | 207 NetworkRequestInfo n = mNetworkRequests.get(request); in handleAddRequest() local 208 if (n == null) { in handleAddRequest() 213 n = new NetworkRequestInfo(request, score, servingProviderId); in handleAddRequest() 214 mNetworkRequests.put(n.request, n); in handleAddRequest() 220 n.score = score; in handleAddRequest() 221 n.providerId = servingProviderId; in handleAddRequest() 225 evalRequest(n); in handleAddRequest() 230 NetworkRequestInfo n = mNetworkRequests.get(request); in handleRemoveRequest() local 231 if (n != null) { in handleRemoveRequest() 233 if (n.requested) releaseNetworkFor(n.request); in handleRemoveRequest() [all …]
|
/frameworks/base/tests/StatusBar/src/com/android/statusbartest/ |
D | NotificationTestList.java | 124 Notification n = new Notification.Builder(NotificationTestList.this, 129 mNM.notify(7001, n); 136 Notification n = new Notification.Builder(NotificationTestList.this, 141 mNM.notify("default", 7004, n); 154 Notification n = new Notification.Builder(NotificationTestList.this, 159 mNM.notify("default", 7004, n); 171 Notification n = new Notification.Builder(NotificationTestList.this, "min") 176 mNM.notify(6000, n); 177 n = new Notification.Builder(NotificationTestList.this, "low") 182 mNM.notify(6001, n); [all …]
|
/frameworks/av/media/libstagefright/foundation/ |
D | ABitReader.cpp | 54 uint32_t ABitReader::getBits(size_t n) { in getBits() argument 56 CHECK(getBitsGraceful(n, &ret)); in getBits() 60 uint32_t ABitReader::getBitsWithFallback(size_t n, uint32_t fallback) { in getBitsWithFallback() argument 62 (void)getBitsGraceful(n, &ret); in getBitsWithFallback() 66 bool ABitReader::getBitsGraceful(size_t n, uint32_t *out) { in getBitsGraceful() argument 67 if (n > 32) { in getBitsGraceful() 72 while (n > 0) { in getBitsGraceful() 79 size_t m = n; in getBitsGraceful() 88 n -= m; in getBitsGraceful() 95 bool ABitReader::skipBits(size_t n) { in skipBits() argument [all …]
|
/frameworks/base/core/java/android/os/ |
D | MessageQueue.java | 683 Message n = p.next; in removeMessages() local 684 mMessages = n; in removeMessages() 686 p = n; in removeMessages() 691 Message n = p.next; in removeMessages() local 692 if (n != null) { in removeMessages() 693 if (n.target == h && n.what == what in removeMessages() 694 && (object == null || n.obj == object)) { in removeMessages() 695 Message nn = n.next; in removeMessages() 696 n.recycleUnchecked(); in removeMessages() 701 p = n; in removeMessages() [all …]
|
D | HwBlob.java | 348 final int n = array.length; in wrapArray() local 349 Boolean[] wrappedArray = new Boolean[n]; in wrapArray() 350 for (int i = 0; i < n; ++i) { in wrapArray() 363 final int n = array.length; in wrapArray() local 364 Long[] wrappedArray = new Long[n]; in wrapArray() 365 for (int i = 0; i < n; ++i) { in wrapArray() 378 final int n = array.length; in wrapArray() local 379 Byte[] wrappedArray = new Byte[n]; in wrapArray() 380 for (int i = 0; i < n; ++i) { in wrapArray() 393 final int n = array.length; in wrapArray() local [all …]
|
D | RevocableFileDescriptor.java | 120 int n = 0; 121 while (n < size) { 123 n += Os.pread(mInner, data, n, size - n, offset + n); 126 n += e.bytesTransferred; 129 return n; 135 int n = 0; 136 while (n < size) { 138 n += Os.pwrite(mInner, data, n, size - n, offset + n); 141 n += e.bytesTransferred; 144 return n;
|
/frameworks/base/tests/JankBench/scripts/external/ |
D | statistics.py | 155 n, d = _exact_ratio(start) 156 partials = {d: n} 161 for n,d in map(_exact_ratio, values): 163 partials[d] = partials_get(d, 0) + n 172 total = sum(Fraction(n, d) for d, n in sorted(partials.items())) 328 n = len(data) 329 if n < 1: 332 assert count == n 333 return _convert(total/n, T) 351 n = len(data) [all …]
|
/frameworks/av/media/libstagefright/webm/ |
D | EbmlUtil.cpp | 38 uint64_t highestOneBit(uint64_t n) { in highestOneBit() argument 39 n |= (n >> 1); in highestOneBit() 40 n |= (n >> 2); in highestOneBit() 41 n |= (n >> 4); in highestOneBit() 42 n |= (n >> 8); in highestOneBit() 43 n |= (n >> 16); in highestOneBit() 44 n |= (n >> 32); in highestOneBit() 45 return n - (n >> 1); in highestOneBit()
|
/frameworks/opt/telephony/tests/telephonytests/src/com/android/internal/telephony/uicc/euicc/data/ |
D | EuiccNotificationTest.java | 31 EuiccNotification n = in testEqualsHashCode() local 33 assertTrue(n.equals(n)); in testEqualsHashCode() 34 assertFalse(n.equals(new Object())); in testEqualsHashCode() 37 assertFalse(n.equals(t)); in testEqualsHashCode() 40 assertTrue(n.equals(t)); in testEqualsHashCode() 41 assertEquals(n.hashCode(), t.hashCode()); in testEqualsHashCode() 44 assertFalse(n.equals(t)); in testEqualsHashCode() 45 assertNotEquals(n.hashCode(), t.hashCode()); in testEqualsHashCode() 48 assertFalse(n.equals(t)); in testEqualsHashCode() 49 assertNotEquals(n.hashCode(), t.hashCode()); in testEqualsHashCode() [all …]
|
/frameworks/rs/ |
D | rsScriptGroup.cpp | 63 Node *n = mNodes[ct]; in findNode() local 64 for (size_t ct2=0; ct2 < n->mKernels.size(); ct2++) { in findNode() 65 if (n->mKernels[ct2]->mScript == s) { in findNode() 66 return n; in findNode() 74 bool ScriptGroup::calcOrderRecurse(Node *n, int depth) { in calcOrderRecurse() argument 75 n->mSeen = true; in calcOrderRecurse() 76 if (n->mOrder < depth) { in calcOrderRecurse() 77 n->mOrder = depth; in calcOrderRecurse() 81 for (size_t ct=0; ct < n->mOutputs.size(); ct++) { in calcOrderRecurse() 82 const Link *l = n->mOutputs[ct]; in calcOrderRecurse() [all …]
|
/frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
D | convolve.c | 37 Word32 i, n; in Convolve() local 42 for (n = 0; n < 64;) in Convolve() 44 tmpH = h+n; in Convolve() 46 i=n+1; in Convolve() 56 y[n] = voround(L_shl(s, 1)); in Convolve() 57 n++; in Convolve() 59 tmpH = h+n; in Convolve() 61 i=n+1; in Convolve() 75 y[n] = voround(L_shl(s, 1)); in Convolve() 76 n++; in Convolve() [all …]
|
/frameworks/av/media/libeffects/lvm/lib/Common/lib/ |
D | VectorArithmetic.h | 29 LVM_INT16 n ); 33 LVM_INT16 n ); 57 LVM_INT16 n); 70 LVM_INT16 n); 76 LVM_INT16 n) ; /* Number of stereo samples */ 81 LVM_INT16 n); 84 LVM_INT16 n ); 88 LVM_INT16 n); 95 LVM_INT16 n); 103 LVM_INT16 n); [all …]
|
/frameworks/base/core/java/android/app/ |
D | WindowConfiguration.java | 494 int n = 0; in compareTo() local 500 n = mAppBounds.left - that.mAppBounds.left; in compareTo() 501 if (n != 0) return n; in compareTo() 502 n = mAppBounds.top - that.mAppBounds.top; in compareTo() 503 if (n != 0) return n; in compareTo() 504 n = mAppBounds.right - that.mAppBounds.right; in compareTo() 505 if (n != 0) return n; in compareTo() 506 n = mAppBounds.bottom - that.mAppBounds.bottom; in compareTo() 507 if (n != 0) return n; in compareTo() 510 n = mBounds.left - that.mBounds.left; in compareTo() [all …]
|
/frameworks/av/media/libeffects/lvm/lib/Common/src/ |
D | JoinTo2i_32x32.cpp | 31 LVM_INT16 n ) in JoinTo2i_32x32() argument 35 srcL += n-1; in JoinTo2i_32x32() 36 srcR += n-1; in JoinTo2i_32x32() 37 dst += ((2*n)-1); in JoinTo2i_32x32() 39 for (ii = n; ii != 0; ii--) in JoinTo2i_32x32() 55 LVM_INT16 n ) in JoinTo2i_Float() argument 59 srcL += n - 1; in JoinTo2i_Float() 60 srcR += n - 1; in JoinTo2i_Float() 61 dst += ((2 * n) - 1); in JoinTo2i_Float() 63 for (ii = n; ii != 0; ii--) in JoinTo2i_Float()
|
/frameworks/opt/calendar/src/com/android/calendarcommon2/ |
D | Duration.java | 92 int n = 0; in parse() local 96 n *= 10; in parse() 97 n += ((int)(c-'0')); in parse() 100 weeks = n; in parse() 101 n = 0; in parse() 104 hours = n; in parse() 105 n = 0; in parse() 108 minutes = n; in parse() 109 n = 0; in parse() 112 seconds = n; in parse() [all …]
|
/frameworks/base/core/java/android/util/ |
D | SparseSetArray.java | 33 public boolean add(int n, T value) { in add() argument 34 ArraySet<T> set = mData.get(n); in add() 37 mData.put(n, set); in add() 56 public boolean contains(int n, T value) { in contains() argument 57 final ArraySet<T> set = mData.get(n); in contains() 67 public ArraySet<T> get(int n) { in get() argument 68 return mData.get(n); in get() 75 public boolean remove(int n, T value) { in remove() argument 76 final ArraySet<T> set = mData.get(n); in remove() 82 mData.remove(n); in remove() [all …]
|