Home
last modified time | relevance | path

Searched refs:n (Results 1 – 25 of 548) sorted by relevance

12345678910>>...22

/packages/modules/NeuralNetworks/tools/systrace_parser/parser/test/
Domr1.txt8 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 …]
Dunittest.txt8 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…
Dold.txt8 …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…
Dcpu.txt8 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…
Dhdrnet.txt8 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…
/packages/modules/Wifi/service/java/com/android/server/wifi/util/
DMatrix.java23 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 …]
/packages/modules/DnsResolver/
Dgethnamaddr.cpp117 int n; in getanswer() local
159 n = dn_expand(answer->buf, eom, cp, bp, (int) (ep - bp)); in getanswer()
160 if ((n < 0) || !name_ok(bp)) goto no_recovery; in getanswer()
162 BOUNDED_INCR(n + QFIXEDSZ); in getanswer()
168 n = (int) strlen(bp) + 1; /* for the \0 */ in getanswer()
169 if (n >= MAXHOSTNAMELEN) goto no_recovery; in getanswer()
171 bp += n; in getanswer()
180 n = dn_expand(answer->buf, eom, cp, bp, (int) (ep - bp)); in getanswer()
181 if ((n < 0) || !name_ok(bp)) { in getanswer()
185 cp += n; /* name */ in getanswer()
[all …]
Dres_query.cpp110 int n; in res_nquery() local
118 n = res_nmkquery(QUERY, name, cl, type, {}, buf, statp->netcontext_flags); in res_nquery()
119 if (n > 0 && in res_nquery()
123 n = res_nopt(statp, n, buf, answer.size()); in res_nquery()
124 if (n <= 0) { in res_nquery()
127 return n; in res_nquery()
129 n = res_nsend(statp, {buf, n}, answer, &rcode, 0); in res_nquery()
130 if (n < 0) { in res_nquery()
165 return n; in res_nquery()
192 return n; in res_nquery()
[all …]
/packages/apps/Gallery2/src/com/android/photos/data/
DSparseArrayBitmapPool.java85 private void unlinkAndRecycleNode(Node n, boolean recycleBitmap) { in unlinkAndRecycleNode() argument
87 if (n.prevInBucket != null) { in unlinkAndRecycleNode()
89 n.prevInBucket.nextInBucket = n.nextInBucket; in unlinkAndRecycleNode()
92 mStore.put(n.bitmap.getWidth(), n.nextInBucket); in unlinkAndRecycleNode()
94 if (n.nextInBucket != null) { in unlinkAndRecycleNode()
96 n.nextInBucket.prevInBucket = n.prevInBucket; in unlinkAndRecycleNode()
100 if (n.prevInPool != null) { in unlinkAndRecycleNode()
102 n.prevInPool.nextInPool = n.nextInPool; in unlinkAndRecycleNode()
105 mPoolNodesHead = n.nextInPool; in unlinkAndRecycleNode()
107 if (n.nextInPool != null) { in unlinkAndRecycleNode()
[all …]
/packages/modules/Bluetooth/system/embdrv/lc3/src/
Dbits.c72 int n = end > start ? (int)(end - start) : -(int)(start - end); in get_bits_left() local
74 return 8 * n - (accu->n + accu->nover + ac_get_pending_bits(ac)); in get_bits_left()
86 .n = mode == LC3_BITS_MODE_READ ? LC3_ACCU_BITS : 0, in lc3_setup_bits()
142 int nbytes = LC3_MIN(accu->n >> 3, in accu_flush()
145 accu->n -= 8 * nbytes; in accu_flush()
150 if (accu->n >= 8) in accu_flush()
151 accu->n = 0; in accu_flush()
253 for (int n = 8 * nleft - accu->n; n > 0; n -= 32) in lc3_flush_bits() local
254 lc3_put_bits(bits, 0, LC3_MIN(n, 32)); in lc3_flush_bits()
265 LC3_HOT void lc3_put_bits_generic(struct lc3_bits *bits, unsigned v, int n) in lc3_put_bits_generic() argument
[all …]
Dbits.h102 int n, nover; member
161 static inline void lc3_put_bits(lc3_bits_t *bits, unsigned v, int n);
189 static inline unsigned lc3_get_bits(lc3_bits_t *bits, int n);
206 void lc3_put_bits_generic(lc3_bits_t *bits, unsigned v, int n);
207 unsigned lc3_get_bits_generic(struct lc3_bits *bits, int n);
225 struct lc3_bits *bits, unsigned v, int n) in lc3_put_bits() argument
229 if (accu->n + n <= LC3_ACCU_BITS) { in lc3_put_bits()
230 accu->v |= v << accu->n; in lc3_put_bits()
231 accu->n += n; in lc3_put_bits()
233 lc3_put_bits_generic(bits, v, n); in lc3_put_bits()
[all …]
Dltpf.c184 struct lc3_ltpf_hp50_state *hp50, const int16_t *x, int16_t *y, int n) in resample_x64k_12k8() argument
190 for (int i = 0; i < 5*n; i += 5) { in resample_x64k_12k8()
228 struct lc3_ltpf_hp50_state *hp50, const int16_t *x, int16_t *y, int n) in resample_x192k_12k8() argument
234 for (int i = 0; i < 15*n; i += 15) { in resample_x192k_12k8()
273 struct lc3_ltpf_hp50_state *hp50, const int16_t *x, int16_t *y, int n) in resample_8k_12k8() argument
275 resample_x64k_12k8(8, h_8k_12k8_q15, hp50, x, y, n); in resample_8k_12k8()
289 struct lc3_ltpf_hp50_state *hp50, const int16_t *x, int16_t *y, int n) in resample_16k_12k8() argument
291 resample_x64k_12k8(4, h_16k_12k8_q15, hp50, x, y, n); in resample_16k_12k8()
305 struct lc3_ltpf_hp50_state *hp50, const int16_t *x, int16_t *y, int n) in resample_32k_12k8() argument
307 resample_x64k_12k8(2, h_32k_12k8_q15, hp50, x, y, n); in resample_32k_12k8()
[all …]
Dltpf_arm.h49 struct lc3_ltpf_hp50_state *hp50, const int16x2_t *x, int16_t *y, int n) in arm_resample_x64k_12k8() argument
55 for (int i = 0; i < 5*n; i += 5) { in arm_resample_x64k_12k8()
80 struct lc3_ltpf_hp50_state *hp50, const int16x2_t *x, int16_t *y, int n) in arm_resample_x192k_12k8() argument
86 for (int i = 0; i < 15*n; i += 15) { in arm_resample_x192k_12k8()
122 struct lc3_ltpf_hp50_state *hp50, const int16_t *x, int16_t *y, int n) in arm_resample_8k_12k8() argument
144 8, (const int16x2_t *)h, hp50, (int16x2_t *)x, y, n); in arm_resample_8k_12k8()
154 struct lc3_ltpf_hp50_state *hp50, const int16_t *x, int16_t *y, int n) in arm_resample_16k_12k8() argument
197 4, (const int16x2_t *)h, hp50, (int16x2_t *)x, y, n); in arm_resample_16k_12k8()
207 struct lc3_ltpf_hp50_state *hp50, const int16_t *x, int16_t *y, int n) in arm_resample_32k_12k8() argument
241 2, (const int16x2_t *)h, hp50, (int16x2_t *)x, y, n); in arm_resample_32k_12k8()
[all …]
/packages/modules/Bluetooth/tools/pdl/src/
Dparser.rs189 self.into_inner().filter((|n| n.as_rule() != Rule::COMMENT) as fn(&Self) -> bool).peekable() in children()
235 iter.next_if(|n| n.as_rule() == rule) in maybe()
239 expect(iter, Rule::identifier).map(|n| n.as_string()) in parse_identifier()
243 expect(iter, Rule::integer).and_then(|n| n.as_usize()) in parse_integer()
247 Ok(maybe(iter, Rule::identifier).map(|n| n.as_string())) in parse_identifier_opt()
251 maybe(iter, Rule::integer).map(|n| n.as_usize()).transpose() in parse_integer_opt()
258 Some(n) if n.as_rule() == Rule::identifier => Ok((Some(n.as_string()), None)), in parse_identifier_or_integer()
259 Some(n) if n.as_rule() == Rule::integer => Ok((None, Some(n.as_usize()?))), in parse_identifier_or_integer()
260 Some(n) => Err(format!( in parse_identifier_or_integer()
264 n.as_rule() in parse_identifier_or_integer()
[all …]
/packages/modules/Wifi/service/java/com/android/server/wifi/hotspot2/
DUtils.java53 for (int n = 0; n < s.length(); n++) { in parseMac()
54 int nibble = Utils.fromHex(s.charAt(n), true); // Set lenient to not blow up on ':' in parseMac()
73 for (int n = BYTES_IN_EUI48 - 1; n >= 0; n--) { in macToSimpleString()
74 long b = (mac >>> (n * Byte.SIZE)) & BYTE_MASK; in macToSimpleString()
89 for (int n = (len - 1) * Byte.SIZE; n >= 0; n -= Byte.SIZE) { in macToString()
95 long b = (mac >>> n) & Constants.BYTE_MASK; in macToString()
106 for (int n = 0; n < PLMNText.length; n++ ) { in getMccMnc()
107 String expect = PLMNText[n]; in getMccMnc()
109 if (!domain.get(n).regionMatches(0, expect, 0, len)) { in getMccMnc()
115 for (int n = 0; n < prefix.length(); n++) { in getMccMnc()
[all …]
/packages/apps/WallpaperPicker/src/com/android/gallery3d/common/
DUtils.java41 public static int nextPowerOf2(int n) { in nextPowerOf2() argument
42 if (n <= 0 || n > (1 << 30)) throw new IllegalArgumentException("n is invalid: " + n); in nextPowerOf2()
43 n -= 1; in nextPowerOf2()
44 n |= n >> 16; in nextPowerOf2()
45 n |= n >> 8; in nextPowerOf2()
46 n |= n >> 4; in nextPowerOf2()
47 n |= n >> 2; in nextPowerOf2()
48 n |= n >> 1; in nextPowerOf2()
49 return n + 1; in nextPowerOf2()
55 public static int prevPowerOf2(int n) { in prevPowerOf2() argument
[all …]
/packages/modules/AdServices/adservices/tests/perf/src/android/adservices/test/scenario/adservices/fledge/
DLimitPerfTests.java82 private void auctionNBigCas(int n) throws Exception { in auctionNBigCas() argument
83 nAuctionsMBigCas(1, n); in auctionNBigCas()
86 private void nAuctionsMBigCas(int n, int m) throws Exception { in nAuctionsMBigCas() argument
91 for (int i = 0; i < n; i++) { in nAuctionsMBigCas()
112 private void joinAndLeaveNBigCas(int n) throws Exception { in joinAndLeaveNBigCas() argument
113 List<CustomAudience> caList = createNBigCas(n); in joinAndLeaveNBigCas()
134 private List<CustomAudience> createNBigCas(int n) { in createNBigCas() argument
136 for (int i = 0; i < n; i++) { in createNBigCas()
188 private AdSelectionSignals nBitAdSelectionSignals(int n) { in nBitAdSelectionSignals() argument
189 return AdSelectionSignals.fromString(nBitJson(n)); in nBitAdSelectionSignals()
[all …]
/packages/services/Car/tools/telemetry/lua-interpreter/
Djson.lua48 local n = 0
53 n = n + 1
55 if n ~= #val then
167 local function codepoint_to_utf8(n)
170 if n <= 0x7f then
171 return string.char(n)
172 elseif n <= 0x7ff then
173 return string.char(f(n / 64) + 192, n % 64 + 128)
174 elseif n <= 0xffff then
175 return string.char(f(n / 4096) + 224, f(n % 4096 / 64) + 128, n % 64 + 128)
[all …]
/packages/modules/Bluetooth/system/gd/packet/parser/
Dlanguage_y.yy106 %destructor { std::cout << "DESTROYING STRING " << *$$ << "\n"; delete $$; } IDENTIFIER STRING SIZE…
128 DEBUG() << "FOUND ENUM\n\n";
133 DEBUG() << "FOUND PACKET\n\n";
138 DEBUG() << "FOUND STRUCT\n\n";
162 << " size=" << $4 << "\n";
175 DEBUG() << "Enumerator with comma\n";
182 DEBUG() << "Enumerator with list\n";
192 << " value=" << $3 << "\n";
207 DEBUG() << "Checksum field defined\n";
231 DEBUG() << "Test Declared: name=" << *$2 << "\n";
[all …]
/packages/modules/Bluetooth/tools/pdl/scripts/
Dpacket_runtime.h62 for (size_t n = 0; n < N; n++) { in read_le() local
63 value |= (T)at(n) << (8 * n); in read_le()
78 for (size_t n = 0; n < N; n++) { in read_be() local
79 value = (value << 8) | (T)at(n); in read_be()
135 for (size_t n = 0; n < N; n++) { in write_le() local
136 output.push_back(value >> (8 * n)); in write_le()
144 for (size_t n = 0; n < N; n++) { in write_be() local
145 output.push_back(value >> (8 * (N - 1 - n))); in write_be()
/packages/modules/Bluetooth/system/embdrv/lc3/test/
Dltpf.py33 self.n = ((T.DT_MS[dt] * 128) / 10).astype(int)
37 self.u = np.zeros(self.n + 2)
38 self.y = np.zeros(self.n + self.d + history)
45 n = self.n
53 if len(self.y) > 2*n + d:
54 self.y[n+d:-n] = self.y[d+2*n:]
55 if len(self.y) > n + d:
56 self.y[-n:] = self.y[:n]
57 self.y[:d] = self.y[n:d+n]
68 for i in range(n):
[all …]
/packages/apps/Gallery2/gallerycommon/src/com/android/gallery3d/common/
DUtils.java79 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()
93 public static int prevPowerOf2(int n) { in prevPowerOf2() argument
[all …]
/packages/modules/Bluetooth/system/osi/src/
Dcompat.cc67 size_t n = siz; in strlcpy() local
70 if (n != 0) { in strlcpy()
71 while (--n != 0) { in strlcpy()
77 if (n == 0) { in strlcpy()
98 size_t n = siz; in strlcat() local
102 while (n-- != 0 && *d != '\0') d++; in strlcat()
104 n = siz - dlen; in strlcat()
106 if (n == 0) return (dlen + strlen(s)); in strlcat()
109 if (n != 1) { in strlcat()
111 n--; in strlcat()
/packages/services/Car/tools/GenericCarApiBuilder/src/com/android/car/tool/apibuilder/
DParsedDataBuilder.java67 public void visit(ClassOrInterfaceDeclaration n, PackageData packageData) { in populateParsedDataForFile() argument
69 ClassData classData = getClassData(n, packageName); in populateParsedDataForFile()
72 super.visit(n, packageData); in populateParsedDataForFile()
77 List<ConstructorDeclaration> constructors = n.getConstructors(); in populateParsedDataForFile()
80 ConstructorData constructorData = getConstructorData(n, constructor); in populateParsedDataForFile()
92 List<FieldDeclaration> fields = n.getFields(); in populateParsedDataForFile()
95 FieldData fieldData = getFieldData(n, field); in populateParsedDataForFile()
105 List<MethodDeclaration> methods = n.getMethods(); in populateParsedDataForFile()
108 MethodData methodData = getMethodData(n, method); in populateParsedDataForFile()
120 super.visit(n, packageData); in populateParsedDataForFile()
[all …]
/packages/modules/ExtServices/java/tests/src/android/ext/services/notification/
DNotificationEntryTest.java76 Notification n = new Notification.Builder(mContext, channelId) in generateSbn() local
80 return new StatusBarNotification(mPkg, mPkg, 0, "tag", mUid, mUid, 0, n, in generateSbn()
85 Notification n = new Notification.Builder(mContext, channelId) in generateSbn() local
89 return new StatusBarNotification(packageName, packageName, 0, "tag", mUid, mUid, 0, n, in generateSbn()
93 private StatusBarNotification generateSbn(Notification n) { in generateSbn() argument
94 return new StatusBarNotification(mPkg, mPkg, 0, "tag", mUid, mUid, 0, n, in generateSbn()
153 Notification n = new Notification.Builder(mContext, channel.getId()) in testIsInboxStyle() local
157 mContext, mPackageManager, generateSbn(n), channel, mSmsHelper); in testIsInboxStyle()
165 Notification n = new Notification.Builder(mContext, channel.getId()) in testIsMessagingStyle() local
169 mContext, mPackageManager, generateSbn(n), channel, mSmsHelper); in testIsMessagingStyle()
[all …]

12345678910>>...22