| /external/perfetto/test/trace_processor/tables/ |
| D | trace_metadata.json.out | 5 …n size_kb: 32768\n fill_policy: UNSPECIFIED\n}\ndata_sources: {\n config: {\n name: \"linux.…
|
| /external/perfetto/test/trace_processor/memory/ |
| D | trace_metadata.out | 4 …n size_kb: 32768\n fill_policy: UNSPECIFIED\n}\ndata_sources: {\n config: {\n name: \"linux.…
|
| /external/XNNPACK/test/ |
| D | x32-zip.cc | 19 .n(4) in TEST()
26 for (size_t n = 4; n < 64; n += 4) { in TEST() local
28 .n(n) in TEST()
36 for (size_t n = 5; n < 8; n++) { in TEST() local
38 .n(n) in TEST()
46 for (size_t n = 1; n < 4; n++) { in TEST() local
48 .n(n) in TEST()
57 .n(4) in TEST()
64 for (size_t n = 4; n < 64; n += 4) { in TEST() local
66 .n(n) in TEST()
[all …]
|
| D | x8-zip.cc | 22 .n(8) in TEST()
29 for (size_t n = 8; n < 128; n += 8) { in TEST() local
31 .n(n) in TEST()
39 for (size_t n = 9; n < 16; n++) { in TEST() local
41 .n(n) in TEST()
49 for (size_t n = 1; n < 8; n++) { in TEST() local
51 .n(n) in TEST()
60 .n(9) in TEST()
67 for (size_t n = 8; n < 128; n += 8) { in TEST() local
69 .n(n) in TEST()
[all …]
|
| D | f32-rmax.cc | 18 for (size_t n = 1; n < 16; n++) { in TEST() local
20 .n(n) in TEST()
28 .n(16) in TEST()
34 for (size_t n = 16; n < 128; n += 16) { in TEST() local
36 .n(n) in TEST()
43 for (size_t n = 16; n < 32; n++) { in TEST() local
45 .n(n) in TEST()
54 for (size_t n = 1; n < 16; n++) { in TEST() local
56 .n(n) in TEST()
64 .n(16) in TEST()
[all …]
|
| D | f32-spmm-minmax.cc | 27 .n(1) in TEST()
40 .n(1) in TEST()
49 for (uint32_t n = 2; n < 10; n++) { in TEST() local
55 .n(n) in TEST()
66 for (uint32_t n = 1; n < 10; n += 2) { in TEST() local
72 .n(n) in TEST()
84 for (uint32_t n = 1; n < 10; n += 2) { in TEST() local
90 .n(n) in TEST()
102 for (uint32_t n = 1; n < 10; n += 2) { in TEST() local
108 .n(n) in TEST()
[all …]
|
| /external/llvm-project/libcxx/test/std/localization/locale.stdcvt/ |
| D | codecvt_utf16_length.pass.cpp | 32 char n[4] = {char(0xD8), char(0xC0), char(0xDC), char(0x03)}; in main() local
34 int r = c.length(m, n, n+4, 2); in main()
37 n[0] = char(0x10); in main()
38 n[1] = char(0x05); in main()
39 r = c.length(m, n, n+2, 2); in main()
42 n[0] = char(0x04); in main()
43 n[1] = char(0x53); in main()
44 r = c.length(m, n, n+2, 2); in main()
47 n[0] = char(0x00); in main()
48 n[1] = char(0x56); in main()
[all …]
|
| D | codecvt_utf8_length.pass.cpp | 32 char n[4] = {char(0xF1), char(0x80), char(0x80), char(0x83)}; in main() local
34 int r = c.length(m, n, n+4, 1); in main()
37 n[0] = char(0xE1); in main()
38 n[1] = char(0x80); in main()
39 n[2] = char(0x85); in main()
40 r = c.length(m, n, n+3, 2); in main()
43 n[0] = char(0xD1); in main()
44 n[1] = char(0x93); in main()
45 r = c.length(m, n, n+2, 3); in main()
48 n[0] = char(0x56); in main()
[all …]
|
| D | codecvt_utf8_utf16_length.pass.cpp | 32 char n[4] = {char(0xF1), char(0x80), char(0x80), char(0x83)}; in main() local
34 int r = c.length(m, n, n+4, 2); in main()
37 n[0] = char(0xE1); in main()
38 n[1] = char(0x80); in main()
39 n[2] = char(0x85); in main()
40 r = c.length(m, n, n+3, 2); in main()
43 n[0] = char(0xD1); in main()
44 n[1] = char(0x93); in main()
45 r = c.length(m, n, n+2, 2); in main()
48 n[0] = char(0x56); in main()
[all …]
|
| /external/libcxx/test/std/localization/locale.stdcvt/ |
| D | codecvt_utf16_length.pass.cpp | 31 char n[4] = {char(0xD8), char(0xC0), char(0xDC), char(0x03)}; in main() local
33 int r = c.length(m, n, n+4, 2); in main()
36 n[0] = char(0x10); in main()
37 n[1] = char(0x05); in main()
38 r = c.length(m, n, n+2, 2); in main()
41 n[0] = char(0x04); in main()
42 n[1] = char(0x53); in main()
43 r = c.length(m, n, n+2, 2); in main()
46 n[0] = char(0x00); in main()
47 n[1] = char(0x56); in main()
[all …]
|
| D | codecvt_utf8_length.pass.cpp | 31 char n[4] = {char(0xF1), char(0x80), char(0x80), char(0x83)}; in main() local
33 int r = c.length(m, n, n+4, 1); in main()
36 n[0] = char(0xE1); in main()
37 n[1] = char(0x80); in main()
38 n[2] = char(0x85); in main()
39 r = c.length(m, n, n+3, 2); in main()
42 n[0] = char(0xD1); in main()
43 n[1] = char(0x93); in main()
44 r = c.length(m, n, n+2, 3); in main()
47 n[0] = char(0x56); in main()
[all …]
|
| D | codecvt_utf8_utf16_length.pass.cpp | 31 char n[4] = {char(0xF1), char(0x80), char(0x80), char(0x83)}; in main() local
33 int r = c.length(m, n, n+4, 2); in main()
36 n[0] = char(0xE1); in main()
37 n[1] = char(0x80); in main()
38 n[2] = char(0x85); in main()
39 r = c.length(m, n, n+3, 2); in main()
42 n[0] = char(0xD1); in main()
43 n[1] = char(0x93); in main()
44 r = c.length(m, n, n+2, 2); in main()
47 n[0] = char(0x56); in main()
[all …]
|
| /external/igt-gpu-tools/benchmarks/ |
| D | ilog2.h | 21 int __ilog2_u32(uint32_t n) in __ilog2_u32() argument
23 return fls(n) - 1; in __ilog2_u32()
27 int __ilog2_u64(uint64_t n) in __ilog2_u64() argument
29 return fls64(n) - 1; in __ilog2_u64()
32 #define ilog2(n) \ argument
34 __builtin_constant_p(n) ? ( \
35 (n) < 2 ? 0 : \
36 (n) & (1ULL << 63) ? 63 : \
37 (n) & (1ULL << 62) ? 62 : \
38 (n) & (1ULL << 61) ? 61 : \
[all …]
|
| /external/flac/src/libFLAC/ |
| D | window.c | 49 FLAC__int32 n; in FLAC__window_bartlett() local
52 for (n = 0; n <= N/2; n++) in FLAC__window_bartlett()
53 window[n] = 2.0f * n / (float)N; in FLAC__window_bartlett()
54 for (; n <= N; n++) in FLAC__window_bartlett()
55 window[n] = 2.0f - 2.0f * n / (float)N; in FLAC__window_bartlett()
58 for (n = 0; n <= L/2-1; n++) in FLAC__window_bartlett()
59 window[n] = 2.0f * n / (float)N; in FLAC__window_bartlett()
60 for (; n <= N; n++) in FLAC__window_bartlett()
61 window[n] = 2.0f - 2.0f * n / (float)N; in FLAC__window_bartlett()
68 FLAC__int32 n; in FLAC__window_bartlett_hann() local
[all …]
|
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/visitor/ |
| D | HashCodeVisitor.java | 49 public Integer visit(final AnnotationDeclaration n, final Void arg) { in visit() argument
50 …n.getMembers().accept(this, arg)) * 31 + (n.getModifiers().accept(this, arg)) * 31 + (n.getName().… in visit()
53 public Integer visit(final AnnotationMemberDeclaration n, final Void arg) { in visit() argument
54 …n.getDefaultValue().isPresent() ? n.getDefaultValue().get().accept(this, arg) : 0) * 31 + (n.getMo… in visit()
57 public Integer visit(final ArrayAccessExpr n, final Void arg) { in visit() argument
58 …return (n.getIndex().accept(this, arg)) * 31 + (n.getName().accept(this, arg)) * 31 + (n.getCommen… in visit()
61 public Integer visit(final ArrayCreationExpr n, final Void arg) { in visit() argument
62 …n.getElementType().accept(this, arg)) * 31 + (n.getInitializer().isPresent() ? n.getInitializer().… in visit()
65 public Integer visit(final ArrayCreationLevel n, final Void arg) { in visit() argument
66 …n.getAnnotations().accept(this, arg)) * 31 + (n.getDimension().isPresent() ? n.getDimension().get(… in visit()
[all …]
|
| D | NoCommentHashCodeVisitor.java | 41 public Integer visit(final AnnotationDeclaration n, final Void arg) { in visit() argument
42 …return (n.getMembers().accept(this, arg)) * 31 + (n.getModifiers().accept(this, arg)) * 31 + (n.ge… in visit()
45 public Integer visit(final AnnotationMemberDeclaration n, final Void arg) { in visit() argument
46 …n.getDefaultValue().isPresent() ? n.getDefaultValue().get().accept(this, arg) : 0) * 31 + (n.getMo… in visit()
49 public Integer visit(final ArrayAccessExpr n, final Void arg) { in visit() argument
50 return (n.getIndex().accept(this, arg)) * 31 + (n.getName().accept(this, arg)); in visit()
53 public Integer visit(final ArrayCreationExpr n, final Void arg) { in visit() argument
54 …return (n.getElementType().accept(this, arg)) * 31 + (n.getInitializer().isPresent() ? n.getInitia… in visit()
57 public Integer visit(final ArrayCreationLevel n, final Void arg) { in visit() argument
58 …return (n.getAnnotations().accept(this, arg)) * 31 + (n.getDimension().isPresent() ? n.getDimensio… in visit()
[all …]
|
| D | ObjectIdentityHashCodeVisitor.java | 45 public Integer visit(final AnnotationDeclaration n, final Void arg) { in visit() argument
46 return n.hashCode(); in visit()
49 public Integer visit(final AnnotationMemberDeclaration n, final Void arg) { in visit() argument
50 return n.hashCode(); in visit()
53 public Integer visit(final ArrayAccessExpr n, final Void arg) { in visit() argument
54 return n.hashCode(); in visit()
57 public Integer visit(final ArrayCreationExpr n, final Void arg) { in visit() argument
58 return n.hashCode(); in visit()
61 public Integer visit(final ArrayCreationLevel n, final Void arg) { in visit() argument
62 return n.hashCode(); in visit()
[all …]
|
| /external/javaparser/javaparser-core-testing-bdd/src/test/java/com/github/javaparser/visitors/ |
| D | PositionTestVisitor.java | 45 public void visit(final AnnotationDeclaration n, final Object arg) { in visit() argument
46 doTest(n); in visit()
47 doTest(n.getName()); in visit()
48 super.visit(n, arg); in visit()
52 public void visit(final AnnotationMemberDeclaration n, final Object arg) { in visit() argument
53 doTest(n); in visit()
54 super.visit(n, arg); in visit()
58 public void visit(final ArrayAccessExpr n, final Object arg) { in visit() argument
59 doTest(n); in visit()
60 super.visit(n, arg); in visit()
[all …]
|
| /external/llvm-project/libcxx/src/ |
| D | hash.cpp | 170 __next_prime(size_t n) in __next_prime() argument
175 if (n <= small_primes[N-1]) in __next_prime()
176 return *std::lower_bound(small_primes, small_primes + N, n); in __next_prime()
179 __check_for_overflow(n); in __next_prime()
184 size_t k0 = n / L; in __next_prime()
185 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) in __next_prime()
187 n = L * k0 + indices[in]; in __next_prime()
200 const std::size_t q = n / p; in __next_prime()
202 return n; in __next_prime()
203 if (n == q * p) in __next_prime()
[all …]
|
| /external/libcxx/src/ |
| D | hash.cpp | 179 __next_prime(size_t n) in __next_prime() argument
184 if (n <= small_primes[N-1]) in __next_prime()
185 return *std::lower_bound(small_primes, small_primes + N, n); in __next_prime()
188 __check_for_overflow(n); in __next_prime()
193 size_t k0 = n / L; in __next_prime()
194 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) in __next_prime()
196 n = L * k0 + indices[in]; in __next_prime()
209 const std::size_t q = n / p; in __next_prime()
211 return n; in __next_prime()
212 if (n == q * p) in __next_prime()
[all …]
|
| /external/javaparser/javaparser-core-testing-bdd/src/test/java/com/github/javaparser/steps/ |
| D | ExistenceOfParentNodeVerifier.java | 49 private static void assertParentIsSet(HasParentNode<?> n) { in assertParentIsSet() argument
50 … assertThat(n + " has no parent set!", n.getParentNode().orElse(null), is(notNullValue())); in assertParentIsSet()
54 public void visit(AnnotationDeclaration n, Void arg) { in visit() argument
55 assertParentIsSet(n); in visit()
56 super.visit(n, arg); in visit()
60 public void visit(AnnotationMemberDeclaration n, Void arg) { in visit() argument
61 assertParentIsSet(n); in visit()
62 super.visit(n, arg); in visit()
66 public void visit(ArrayAccessExpr n, Void arg) { in visit() argument
67 assertParentIsSet(n); in visit()
[all …]
|
| /external/skia/resources/sksl/dslfp/ |
| D | GrDSLFPTest_Builtins.fp | 6 half4 n = half4(zero);
9 n.x = abs(n.x);
12 n.xy = atan(n.xy);
13 n.zwx = atan(n.yyy, n.zzz);
14 n.xyzw = ceil(n.xyzw);
15 n.x = clamp(n.y, n.z, n.w);
16 n.y = cos(n.y);
17 n.w = cross(n.xy, n.zw);
18 n.xyz = degrees(n.xyz);
19 n.w = distance(n.xz, n.yw);
[all …]
|
| /external/bcc/src/cc/frontends/b/ |
| D | type_check.cc | 29 StatusTuple TypeCheck::visit_block_stmt_node(BlockStmtNode *n) { in visit_block_stmt_node() argument
31 if (n->scope_) in visit_block_stmt_node()
32 scopes_->push_var(n->scope_); in visit_block_stmt_node()
33 if (!n->stmts_.empty()) { in visit_block_stmt_node()
34 for (auto it = n->stmts_.begin(); it != n->stmts_.end(); ++it) in visit_block_stmt_node()
38 if (n->scope_) in visit_block_stmt_node()
43 StatusTuple TypeCheck::visit_if_stmt_node(IfStmtNode *n) { in visit_if_stmt_node() argument
44 TRY2(n->cond_->accept(this)); in visit_if_stmt_node()
47 TRY2(n->true_block_->accept(this)); in visit_if_stmt_node()
48 if (n->false_block_) { in visit_if_stmt_node()
[all …]
|
| /external/llvm-project/clang/test/SemaCXX/ |
| D | switch-implicit-fallthrough.cpp | 4 int fallthrough(int n) { in fallthrough() argument
5 switch (n / 10) { in fallthrough()
6 if (n - 1) { in fallthrough()
7 n = 100; in fallthrough()
8 } else if (n - 2) { in fallthrough()
9 n = 101; in fallthrough()
10 } else if (n - 3) { in fallthrough()
11 n = 102; in fallthrough()
18 n += 100 ; in fallthrough()
20 if (n > 0) in fallthrough()
[all …]
|
| /external/flatbuffers/go/ |
| D | encode.go | 32 func GetUint8(buf []byte) (n uint8) {
33 n = uint8(buf[0])
38 func GetUint16(buf []byte) (n uint16) {
40 n |= uint16(buf[0])
41 n |= uint16(buf[1]) << 8
46 func GetUint32(buf []byte) (n uint32) {
48 n |= uint32(buf[0])
49 n |= uint32(buf[1]) << 8
50 n |= uint32(buf[2]) << 16
51 n |= uint32(buf[3]) << 24
[all …]
|