/external/u-boot/include/linux/ |
D | log2.h | 27 int __ilog2_u32(u32 n) in __ilog2_u32() argument 29 return fls(n) - 1; in __ilog2_u32() 35 int __ilog2_u64(u64 n) in __ilog2_u64() argument 37 return fls64(n) - 1; in __ilog2_u64() 50 bool is_power_of_2(unsigned long n) in is_power_of_2() argument 52 return (n != 0 && ((n & (n - 1)) == 0)); in is_power_of_2() 60 unsigned long __roundup_pow_of_two(unsigned long n) in __roundup_pow_of_two() argument 62 return 1UL << fls_long(n - 1); in __roundup_pow_of_two() 70 unsigned long __rounddown_pow_of_two(unsigned long n) in __rounddown_pow_of_two() argument 72 return 1UL << (fls_long(n) - 1); in __rounddown_pow_of_two() [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/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 | f32-clamp.cc | 19 .n(4) in TEST() 25 for (size_t n = 4; n < 256; n += 4) { in TEST() local 27 .n(n) in TEST() 34 for (size_t n = 5; n < 8; n++) { in TEST() local 36 .n(n) in TEST() 43 for (size_t n = 1; n < 4; n++) { in TEST() local 45 .n(n) in TEST() 52 for (size_t n = 1; n < 64; n += 3) { in TEST() local 55 .n(n) in TEST() 63 for (size_t n = 1; n < 64; n += 5) { in TEST() local [all …]
|
D | f32-gavgpool.cc | 20 .n(4) in TEST() 29 .n(4) in TEST() 38 .n(4) in TEST() 47 .n(4) in TEST() 56 .n(4) in TEST() 63 for (size_t n = 4; n < 64; n += 12) { in TEST() local 66 .n(n) in TEST() 73 for (size_t n = 4; n < 64; n += 12) { in TEST() local 77 .n(n) in TEST() 85 for (size_t n = 1; n < 4; n++) { in TEST() local [all …]
|
D | q8-vadd.cc | 22 .n(8) in TEST() 28 for (size_t n = 8; n < 128; n += 24) { in TEST() local 30 .n(n) in TEST() 37 for (size_t n = 9; n < 16; n++) { in TEST() local 39 .n(n) in TEST() 46 for (size_t n = 1; n < 8; n++) { in TEST() local 48 .n(n) in TEST() 55 for (size_t n = 1; n < 128; n += 11) { in TEST() local 58 .n(n) in TEST() 66 for (size_t n = 1; n < 128; n += 11) { in TEST() local [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 | q8-gavgpool.cc | 23 .n(8) in TEST() 32 .n(8) in TEST() 41 .n(8) in TEST() 51 .n(8) in TEST() 62 .n(8) in TEST() 73 .n(8) in TEST() 84 .n(8) in TEST() 94 .n(8) in TEST() 107 .n(8) in TEST() 118 for (size_t n = 8; n < 128; n += 24) { in TEST() local [all …]
|
D | f32-spmm.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/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/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 …]
|
D | ModifierVisitor.java | 54 public Visitable visit(final AnnotationDeclaration n, final A arg) { in visit() argument 55 NodeList<BodyDeclaration<?>> members = modifyList(n.getMembers(), arg); in visit() 56 NodeList<Modifier> modifiers = modifyList(n.getModifiers(), arg); in visit() 57 SimpleName name = (SimpleName) n.getName().accept(this, arg); in visit() 58 NodeList<AnnotationExpr> annotations = modifyList(n.getAnnotations(), arg); in visit() 59 Comment comment = n.getComment().map(s -> (Comment) s.accept(this, arg)).orElse(null); in visit() 62 n.setMembers(members); in visit() 63 n.setModifiers(modifiers); in visit() 64 n.setName(name); in visit() 65 n.setAnnotations(annotations); in visit() [all …]
|
D | VoidVisitorWithDefaults.java | 42 public void defaultAction(Node n, A arg) { in defaultAction() argument 48 public void defaultAction(NodeList n, A arg) { in defaultAction() argument 52 public void visit(final AnnotationDeclaration n, final A arg) { in visit() argument 53 defaultAction(n, arg); in visit() 57 public void visit(final AnnotationMemberDeclaration n, final A arg) { in visit() argument 58 defaultAction(n, arg); in visit() 62 public void visit(final ArrayAccessExpr n, final A arg) { in visit() argument 63 defaultAction(n, arg); in visit() 67 public void visit(final ArrayCreationExpr n, final A arg) { in visit() argument 68 defaultAction(n, arg); in visit() [all …]
|
D | ObjectIdentityEqualsVisitor.java | 42 public static boolean equals(final Node n, final Node n2) { in equals() argument 43 return n.accept(SINGLETON, n2); in equals() 47 public Boolean visit(final CompilationUnit n, final Visitable arg) { in visit() argument 48 return n == arg; in visit() 52 public Boolean visit(final PackageDeclaration n, final Visitable arg) { in visit() argument 53 return n == arg; in visit() 57 public Boolean visit(final TypeParameter n, final Visitable arg) { in visit() argument 58 return n == arg; in visit() 62 public Boolean visit(final LineComment n, final Visitable arg) { in visit() argument 63 return n == arg; 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/libunwind/tests/ |
D | Lrs-race.c | 50 int n; in foo_0() local 52 if ((n = unw_backtrace (buf, 20)) < 3) in foo_0() 60 int n; in foo_1() local 62 if ((n = unw_backtrace (buf, 20)) < 3) in foo_1() 70 int n; in foo_2() local 72 if ((n = unw_backtrace (buf, 20)) < 3) in foo_2() 80 int n; in foo_3() local 82 if ((n = unw_backtrace (buf, 20)) < 3) in foo_3() 90 int n; in foo_4() local 92 if ((n = unw_backtrace (buf, 20)) < 3) in foo_4() [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/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/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/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 …]
|