| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/visitor/ |
| D | EqualsVisitor.java | 44 public static boolean equals(final Node n, final Node n2) { in equals() argument
45 return SINGLETON.nodeEquals(n, n2); in equals()
56 private boolean commonNodeEquality(Node n, Node n2) { in commonNodeEquality() argument
57 if (!nodeEquals(n.getComment(), n2.getComment())) { in commonNodeEquality()
60 return nodesEquals(n.getOrphanComments(), n2.getOrphanComments()); in commonNodeEquality()
80 private <N extends Node> boolean nodesEquals(NodeList<N> n, NodeList<N> n2) { in nodesEquals() argument
81 if (n == n2) { in nodesEquals()
84 if (n == null || n2 == null) { in nodesEquals()
87 if (n.size() != n2.size()) { in nodesEquals()
91 if (!nodeEquals(n.get(i), n2.get(i))) { in nodesEquals()
[all …]
|
| D | NoCommentEqualsVisitor.java | 38 public static boolean equals(final Node n, final Node n2) { in equals() argument
39 return SINGLETON.nodeEquals(n, n2); in equals()
42 private <N extends Node> boolean nodesEquals(NodeList<N> n, NodeList<N> n2) { in nodesEquals() argument
43 if (n == n2) { in nodesEquals()
46 if (n == null || n2 == null) { in nodesEquals()
49 if (n.size() != n2.size()) { in nodesEquals()
53 if (!nodeEquals(n.get(i), n2.get(i))) { in nodesEquals()
60 private <T extends Node> boolean nodeEquals(final T n, final T n2) { in nodeEquals() argument
61 if (n == n2) { in nodeEquals()
64 if (n == null || n2 == null) { in nodeEquals()
[all …]
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/visitor/ |
| D | EqualsVisitor.java | 110 public static boolean equals(final Node n1, final Node n2) { in equals() argument
111 return SINGLETON.nodeEquals(n1, n2); in equals()
122 private boolean commonNodeEquality(Node n1, Node n2) { in commonNodeEquality() argument
123 if (!nodeEquals(n1.getComment(), n2.getComment())) { in commonNodeEquality()
126 return nodesEquals(n1.getOrphanComments(), n2.getOrphanComments()); in commonNodeEquality()
146 private <T extends Node> boolean nodeEquals(final T n1, final T n2) { in nodeEquals() argument
147 if (n1 == n2) { in nodeEquals()
150 if (n1 == null || n2 == null) { in nodeEquals()
153 if (n1.getClass() != n2.getClass()) { in nodeEquals()
156 if (!commonNodeEquality(n1, n2)){ in nodeEquals()
[all …]
|
| /external/fft2d/src/fft2d/fft2d/ |
| D | fftsg2d.f | 312 subroutine cdft2d(n1max, n1, n2, isgn, a, t, ip, w) argument
313 integer n1max, n1, n2, isgn, ip(0 : *), n, j local
314 real*8 a(0 : n1max - 1, 0 : n2 - 1), t(0 : 8 * n2 - 1),
316 n = max(n1, 2 * n2)
320 do j = 0, n2 - 1
323 call cdft2d_sub(n1max, n1, n2, isgn, a, t, ip, w)
326 subroutine rdft2d(n1max, n1, n2, isgn, a, t, ip, w) argument
327 integer n1max, n1, n2, isgn, ip(0 : *), n, nw, nc, j local
328 real*8 a(0 : n1max - 1, 0 : n2 - 1), t(0 : 8 * n2 - 1),
330 n = max(n1, 2 * n2)
[all …]
|
| D | fftsg3d.c | 493 void cdft3d(int n1, int n2, int n3, int isgn, double ***a, in cdft3d() argument
497 void xdft3da_sub(int n1, int n2, int n3, int icr, int isgn, in cdft3d()
499 void cdft3db_sub(int n1, int n2, int n3, int isgn, double ***a, in cdft3d()
502 void xdft3da_subth(int n1, int n2, int n3, int icr, int isgn, in cdft3d()
504 void cdft3db_subth(int n1, int n2, int n3, int isgn, double ***a, in cdft3d()
510 if (n < n2) { in cdft3d()
511 n = n2; in cdft3d()
524 if (nt < n2) { in cdft3d()
525 nt = n2; in cdft3d()
540 if ((double) n1 * n2 * n3 >= (double) FFT3D_THREADS_BEGIN_N) { in cdft3d()
[all …]
|
| D | fftsg3d.f | 400 subroutine cdft3d(n1max, n2max, n1, n2, n3, isgn, a, argument
402 integer n1max, n2max, n1, n2, n3, isgn, ip(0 : *), n local
405 n = 2 * max(n2, n3)
410 call xdft3da_sub(n1max, n2max, n1, n2, n3, 0,
412 call cdft3db_sub(n1max, n2max, n1, n2, n3,
416 subroutine rdft3d(n1max, n2max, n1, n2, n3, isgn, a, argument
418 integer n1max, n2max, n1, n2, n3, isgn, ip(0 : *), local
422 n = 2 * max(n2, n3)
435 call rdft3d_sub(n1max, n2max, n1, n2, n3, isgn, a)
436 call cdft3db_sub(n1max, n2max, n1, n2, n3,
[all …]
|
| D | fftsg2d.c | 397 void cdft2d(int n1, int n2, int isgn, double **a, double *t, in cdft2d() argument
402 void cdft2d_sub(int n1, int n2, int isgn, double **a, double *t, in cdft2d()
405 void xdft2d0_subth(int n1, int n2, int icr, int isgn, double **a, in cdft2d()
407 void cdft2d_subth(int n1, int n2, int isgn, double **a, double *t, in cdft2d()
413 if (n < n2) { in cdft2d()
414 n = n2; in cdft2d()
427 if (n2 == 4 * nthread) { in cdft2d()
429 } else if (n2 < 4 * nthread) { in cdft2d()
436 if ((double) n1 * n2 >= (double) FFT2D_THREADS_BEGIN_N) { in cdft2d()
437 xdft2d0_subth(n1, n2, 0, isgn, a, ip, w); in cdft2d()
[all …]
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/ast/visitor/ |
| D | EqualsVisitor.java | 82 public static boolean equals(final Node n1, final Node n2) { in equals() argument
83 return SINGLETON.nodeEquals(n1, n2); in equals()
94 private boolean commonNodeEquality(Node n1, Node n2) { in commonNodeEquality() argument
95 if (!nodeEquals(n1.getComment(), n2.getComment())) { in commonNodeEquality()
98 if (!nodesEquals(n1.getOrphanComments(), n2.getOrphanComments())){ in commonNodeEquality()
124 private <T extends Node> boolean nodeEquals(final T n1, final T n2) { in nodeEquals() argument
125 if (n1 == n2) { in nodeEquals()
129 if (n2 == null) { in nodeEquals()
133 } else if (n2 == null) { in nodeEquals()
136 if (n1.getClass() != n2.getClass()) { in nodeEquals()
[all …]
|
| /external/fft2d/src/fft2d/fft2d/sample2d/ |
| D | fft4f2dt.c | 18 void putdata2d(int n1, int n2, double **a); in main()
19 double errorcheck2d(int n1, int n2, double scale, double **a); in main()
20 int *ip, n1, n2, n, i; in main() local
26 scanf("%d", &n2); in main()
28 a = alloc_2d_double(n1, n2); in main()
29 t = alloc_2d_double(n1, n2); in main()
30 n = MAX(n1, n2 / 2); in main()
32 n = MAX(n1 / 2, n2 / 4) + MAX(n1, n2); in main()
37 putdata2d(n1, n2, a); in main()
38 cdft2d(n1, n2, 1, a, ip, w); in main()
[all …]
|
| D | fftsg2dt.c | 18 void putdata2d(int n1, int n2, double **a); in main()
19 double errorcheck2d(int n1, int n2, double scale, double **a); in main()
20 int *ip, n1, n2, n, i; in main() local
26 scanf("%d", &n2); in main()
28 a = alloc_2d_double(n1, n2); in main()
29 n = MAX(n1, n2 / 2); in main()
31 n = MAX(n1, n2) * 3 / 2; in main()
36 putdata2d(n1, n2, a); in main()
37 cdft2d(n1, n2, 1, a, NULL, ip, w); in main()
38 cdft2d(n1, n2, -1, a, NULL, ip, w); in main()
[all …]
|
| D | fftsg2dt.f | 7 integer ip(0 : nmaxsqrt + 1), n1, n2, i variable
14 read (*, *) n2
18 call putdata2d(nmax, n1, n2, a)
19 call cdft2d(nmax, n1, n2, 1, a, t, ip, w)
20 call cdft2d(nmax, n1, n2, -1, a, t, ip, w)
21 err = errorcheck2d(nmax, n1, n2, 2.0d0 / n1 / n2, a)
25 call putdata2d(nmax, n1, n2, a)
26 call rdft2d(nmax, n1, n2, 1, a, t, ip, w)
27 call rdft2d(nmax, n1, n2, -1, a, t, ip, w)
28 err = errorcheck2d(nmax, n1, n2, 2.0d0 / n1 / n2, a)
[all …]
|
| D | fft4f2dt.f | 7 integer ip(0 : nmaxsqrt + 1), n1, n2, i variable
15 read (*, *) n2
19 call putdata2d(nmax, n1, n2, a)
20 call cdft2d(nmax, n1, n2, 1, a, ip, w)
21 call cdft2d(nmax, n1, n2, -1, a, ip, w)
22 err = errorcheck2d(nmax, n1, n2, 2.0d0 / n1 / n2, a)
26 call putdata2d(nmax, n1, n2, a)
27 call rdft2d(nmax, n1, n2, 1, a, ip, w)
28 call rdft2d(nmax, n1, n2, -1, a, ip, w)
29 err = errorcheck2d(nmax, n1, n2, 2.0d0 / n1 / n2, a)
[all …]
|
| D | fftsg3dt.c | 18 void putdata3d(int n1, int n2, int n3, double ***a); in main()
19 double errorcheck3d(int n1, int n2, int n3, double scale, double ***a); in main()
20 int *ip, n1, n2, n3, n, nt, i, j; in main() local
26 scanf("%d", &n2); in main()
30 a = alloc_3d_double(n1, n2, n3); in main()
31 nt = MAX(n1, n2); in main()
39 putdata3d(n1, n2, n3, a); in main()
40 cdft3d(n1, n2, n3, 1, a, NULL, ip, w); in main()
41 cdft3d(n1, n2, n3, -1, a, NULL, ip, w); in main()
42 err = errorcheck3d(n1, n2, n3, 2.0 / n1 / n2 / n3, a); in main()
[all …]
|
| D | fftsg3dt.f | 7 integer ip(0 : nmaxsqrt + 1), n1, n2, n3, i, j variable
15 read (*, *) n2
21 call putdata3d(nmax, nmax, n1, n2, n3, a)
22 call cdft3d(nmax, nmax, n1, n2, n3, 1, a, t, ip, w)
23 call cdft3d(nmax, nmax, n1, n2, n3, -1, a, t, ip, w)
24 err = errorcheck3d(nmax, nmax, n1, n2, n3,
25 & 2.0d0 / n1 / n2 / n3, a)
29 call putdata3d(nmax, nmax, n1, n2, n3, a)
30 call rdft3d(nmax, nmax, n1, n2, n3, 1, a, t, ip, w)
31 call rdft3d(nmax, nmax, n1, n2, n3, -1, a, t, ip, w)
[all …]
|
| /external/strace/tests-m32/ |
| D | rt_sigaction.awk | 31 n1[1][1] = n2[1][1] = "SIG_IGN"
32 n1[1][2] = n2[1][2] = "\\[HUP INT\\]"
34 n2[1][3] = "SA_RESTART"
36 n2[1][4] = ""
38 n1[2][1] = n2[2][1] = "0x[0-9a-f]+"
39 n1[2][2] = n2[2][2] = "\\[QUIT TERM\\]"
41 n2[2][3] = "SA_SIGINFO"
43 n2[2][4] = ""
45 n1[3][1] = n2[3][1] = "SIG_DFL"
46 n1[3][2] = n2[3][2] = "\\[\\]"
[all …]
|
| /external/strace/tests-mx32/ |
| D | rt_sigaction.awk | 31 n1[1][1] = n2[1][1] = "SIG_IGN"
32 n1[1][2] = n2[1][2] = "\\[HUP INT\\]"
34 n2[1][3] = "SA_RESTART"
36 n2[1][4] = ""
38 n1[2][1] = n2[2][1] = "0x[0-9a-f]+"
39 n1[2][2] = n2[2][2] = "\\[QUIT TERM\\]"
41 n2[2][3] = "SA_SIGINFO"
43 n2[2][4] = ""
45 n1[3][1] = n2[3][1] = "SIG_DFL"
46 n1[3][2] = n2[3][2] = "\\[\\]"
[all …]
|
| /external/strace/tests/ |
| D | rt_sigaction.awk | 31 n1[1][1] = n2[1][1] = "SIG_IGN"
32 n1[1][2] = n2[1][2] = "\\[HUP INT\\]"
34 n2[1][3] = "SA_RESTART"
36 n2[1][4] = ""
38 n1[2][1] = n2[2][1] = "0x[0-9a-f]+"
39 n1[2][2] = n2[2][2] = "\\[QUIT TERM\\]"
41 n2[2][3] = "SA_SIGINFO"
43 n2[2][4] = ""
45 n1[3][1] = n2[3][1] = "SIG_DFL"
46 n1[3][2] = n2[3][2] = "\\[\\]"
[all …]
|
| /external/libaom/libaom/aom_dsp/x86/ |
| D | fft_sse2.c | 40 const int n2 = n / 2; in aom_fft_unpack_2d_output_sse2() local
43 output[2 * (n2 * n)] = packed[n2 * n]; in aom_fft_unpack_2d_output_sse2()
44 output[2 * (n2 * n) + 1] = 0; in aom_fft_unpack_2d_output_sse2()
46 output[2 * n2] = packed[n2]; in aom_fft_unpack_2d_output_sse2()
47 output[2 * n2 + 1] = 0; in aom_fft_unpack_2d_output_sse2()
48 output[2 * (n2 * n + n2)] = packed[n2 * n + n2]; in aom_fft_unpack_2d_output_sse2()
49 output[2 * (n2 * n + n2) + 1] = 0; in aom_fft_unpack_2d_output_sse2()
51 for (int c = 1; c < n2; ++c) { in aom_fft_unpack_2d_output_sse2()
53 output[2 * (0 * n + c) + 1] = packed[c + n2]; in aom_fft_unpack_2d_output_sse2()
54 output[2 * (n2 * n + c) + 0] = packed[n2 * n + c]; in aom_fft_unpack_2d_output_sse2()
[all …]
|
| /external/rust/crates/quiche/deps/boringssl/src/crypto/fipsmodule/bn/ |
| D | mul.c | 212 int n2, int dna, int dnb, BN_ULONG *t) { in bn_mul_recursive() argument
214 assert(n2 != 0 && (n2 & (n2 - 1)) == 0); in bn_mul_recursive()
221 if (n2 == 8 && dna == 0 && dnb == 0) { in bn_mul_recursive()
227 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) { in bn_mul_recursive()
228 bn_mul_normal(r, a, n2 + dna, b, n2 + dnb); in bn_mul_recursive()
230 OPENSSL_memset(&r[2 * n2 + dna + dnb], 0, in bn_mul_recursive()
246 int n = n2 / 2, tna = n + dna, tnb = n + dnb; in bn_mul_recursive()
251 BN_ULONG neg = bn_abs_sub_part_words(t, a, &a[n], tna, n - tna, &t[n2]); in bn_mul_recursive()
252 neg ^= bn_abs_sub_part_words(&t[n], &b[n], b, tnb, tnb - n, &t[n2]); in bn_mul_recursive()
259 bn_mul_comba4(&t[n2], t, &t[n]); in bn_mul_recursive()
[all …]
|
| /external/boringssl/src/crypto/fipsmodule/bn/ |
| D | mul.c | 212 int n2, int dna, int dnb, BN_ULONG *t) { in bn_mul_recursive() argument
214 assert(n2 != 0 && (n2 & (n2 - 1)) == 0); in bn_mul_recursive()
221 if (n2 == 8 && dna == 0 && dnb == 0) { in bn_mul_recursive()
227 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) { in bn_mul_recursive()
228 bn_mul_normal(r, a, n2 + dna, b, n2 + dnb); in bn_mul_recursive()
230 OPENSSL_memset(&r[2 * n2 + dna + dnb], 0, in bn_mul_recursive()
246 int n = n2 / 2, tna = n + dna, tnb = n + dnb; in bn_mul_recursive()
251 BN_ULONG neg = bn_abs_sub_part_words(t, a, &a[n], tna, n - tna, &t[n2]); in bn_mul_recursive()
252 neg ^= bn_abs_sub_part_words(&t[n], &b[n], b, tnb, tnb - n, &t[n2]); in bn_mul_recursive()
259 bn_mul_comba4(&t[n2], t, &t[n]); in bn_mul_recursive()
[all …]
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/expected_output/ |
| D | com_github_javaparser_ast_visitor_EqualsVisitor.txt | 6 Line 83) SINGLETON.nodeEquals(n1, n2) ==> boolean
7 Line 95) !nodeEquals(n1.getComment(), n2.getComment()) ==> boolean
9 Line 98) !nodesEquals(n1.getOrphanComments(), n2.getOrphanComments()) ==> boolean
27 Line 125) n1 == n2 ==> boolean
30 Line 129) n2 == null ==> boolean
33 Line 133) n2 == null ==> boolean
35 Line 136) n1.getClass() != n2.getClass() ==> boolean
37 Line 139) !commonNodeEquality(n1, n2) ==> boolean
39 Line 142) n1.accept(this, n2).booleanValue() ==> boolean
40 Line 146) n1 == n2 ==> boolean
[all …]
|
| /external/igt-gpu-tools/tools/ |
| D | hsw_compute_wrpll.c | 49 unsigned p, n2, r2; member
127 unsigned r2, unsigned n2, unsigned p, in wrpll_update_rnp() argument
135 best->n2 = n2; in wrpll_update_rnp()
156 diff = ABS_DIFF((freq2k * p * r2), (LC_FREQ_2K * n2)); in wrpll_update_rnp()
158 (LC_FREQ_2K * best->n2)); in wrpll_update_rnp()
166 best->n2 = n2; in wrpll_update_rnp()
172 best->n2 = n2; in wrpll_update_rnp()
176 if (n2 * best->r2 * best->r2 > best->n2 * r2 * r2) { in wrpll_update_rnp()
178 best->n2 = n2; in wrpll_update_rnp()
190 unsigned p, n2, r2; in wrpll_compute_rnp() local
[all …]
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/expected_output/ |
| D | com_github_javaparser_ast_visitor_EqualsVisitor.txt | 1 …Line 111) SINGLETON.nodeEquals(n1, n2) ==> com.github.javaparser.ast.visitor.EqualsVisitor.nodeEqu…
2 …Line 123) nodeEquals(n1.getComment(), n2.getComment()) ==> com.github.javaparser.ast.visitor.Equal…
4 Line 123) n2.getComment() ==> com.github.javaparser.ast.Node.getComment()
5 …Line 126) nodesEquals(n1.getOrphanComments(), n2.getOrphanComments()) ==> com.github.javaparser.as…
7 Line 126) n2.getOrphanComments() ==> com.github.javaparser.ast.Node.getOrphanComments()
15 Line 153) n2.getClass() ==> java.lang.Object.getClass()
16 …Line 156) commonNodeEquality(n1, n2) ==> com.github.javaparser.ast.visitor.EqualsVisitor.commonNod…
17 …Line 159) n1.accept(this, n2) ==> com.github.javaparser.ast.Node.accept(com.github.javaparser.ast.…
18 Line 169) n1.equals(n2) ==> java.lang.Object.equals(java.lang.Object)
19 …Line 175) nodeEquals(n1.getPackage(), n2.getPackage()) ==> com.github.javaparser.ast.visitor.Equal…
[all …]
|
| /external/tensorflow/tensorflow/compiler/xla/ |
| D | array3d_test.cc | 29 EXPECT_EQ(uninit.n2(), 3); in TEST()
38 EXPECT_EQ(fullof7.n2(), 3); in TEST()
42 for (int64 n2 = 0; n2 < fullof7.n2(); ++n2) { in TEST() local
44 EXPECT_EQ(fullof7(n1, n2, n3), 7); in TEST()
56 EXPECT_EQ(arr.n2(), 4); in TEST()
79 EXPECT_EQ(arr.n2(), 4); in TEST()
98 for (int64 n2 = 0; n2 < fullof7.n2(); ++n2) { in TEST() local
100 EXPECT_EQ(fullof7(n1, n2, n3), 7); in TEST()
107 for (int64 n2 = 0; n2 < fullof7.n2(); ++n2) { in TEST() local
109 EXPECT_EQ(fullof7(n1, n2, n3), 11); in TEST()
|
| /external/igt-gpu-tools/lib/ |
| D | igt_core.h | 577 #define igt_assert_cmpint(n1, cmp, ncmp, n2) \ argument
579 int __n1 = (n1), __n2 = (n2); \
582 #n1 " " #cmp " " #n2, \
595 #define igt_assert_cmpuint(n1, cmp, ncmp, n2) \ argument
597 uint32_t __n1 = (n1), __n2 = (n2); \
600 #n1 " " #cmp " " #n2, \
613 #define igt_assert_cmps64(n1, cmp, ncmp, n2) \ argument
615 int64_t __n1 = (n1), __n2 = (n2); \
618 #n1 " " #cmp " " #n2, \
631 #define igt_assert_cmpu64(n1, cmp, ncmp, n2) \ argument
[all …]
|