| /external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/ |
| D | eval.pass.cpp | 51 const size_t Np = sizeof(p) / sizeof(p[0]) - 1; in test1() local
52 D d(b, b+Np+1, p); in test1()
67 std::vector<double> areas(Np); in test1()
76 for (size_t i = 0; i < Np+1; ++i) in test1()
80 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test1()
103 const size_t Np = sizeof(p) / sizeof(p[0]) - 1; in test2() local
104 D d(b, b+Np+1, p); in test2()
119 std::vector<double> areas(Np); in test2()
128 for (size_t i = 0; i < Np+1; ++i) in test2()
132 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test2()
[all …]
|
| D | eval_param.pass.cpp | 50 const size_t Np = sizeof(p) / sizeof(p[0]) - 1; in main() local
52 P pa(b, b+Np+1, p); in main()
67 std::vector<double> areas(Np); in main()
76 for (size_t i = 0; i < Np+1; ++i) in main()
80 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in main()
|
| D | max.pass.cpp | 26 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
27 D d(b, b+Np, p); in main()
|
| D | min.pass.cpp | 26 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
27 D d(b, b+Np, p); in main()
|
| D | param_copy.pass.cpp | 28 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
29 P p0(b, b+Np, p); in main()
|
| /external/llvm-project/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/ |
| D | eval.pass.cpp | 50 const size_t Np = sizeof(p) / sizeof(p[0]) - 1; in test1() local
51 D d(b, b+Np+1, p); in test1()
66 std::vector<double> areas(Np); in test1()
75 for (size_t i = 0; i < Np+1; ++i) in test1()
79 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test1()
102 const size_t Np = sizeof(p) / sizeof(p[0]) - 1; in test2() local
103 D d(b, b+Np+1, p); in test2()
118 std::vector<double> areas(Np); in test2()
127 for (size_t i = 0; i < Np+1; ++i) in test2()
131 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test2()
[all …]
|
| D | eval_param.pass.cpp | 51 const size_t Np = sizeof(p) / sizeof(p[0]) - 1; in main() local
53 P pa(b, b+Np+1, p); in main()
68 std::vector<double> areas(Np); in main()
77 for (size_t i = 0; i < Np+1; ++i) in main()
81 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in main()
|
| D | min.pass.cpp | 27 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
28 D d(b, b+Np, p); in main()
|
| D | max.pass.cpp | 27 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
28 D d(b, b+Np, p); in main()
|
| D | param_copy.pass.cpp | 29 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
30 P p0(b, b+Np, p); in main()
|
| D | get_param.pass.cpp | 28 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
29 P pa(b, b+Np, p); in main()
|
| /external/flac/src/libFLAC/ |
| D | window.c | 196 const FLAC__int32 Np = (FLAC__int32)(p / 2.0f * L) - 1; in FLAC__window_tukey() local
201 if (Np > 0) { in FLAC__window_tukey()
202 for (n = 0; n <= Np; n++) { in FLAC__window_tukey()
203 window[n] = (FLAC__real)(0.5f - 0.5f * cosf(M_PI * n / Np)); in FLAC__window_tukey()
204 window[L-Np-1+n] = (FLAC__real)(0.5f - 0.5f * cosf(M_PI * (n+Np) / Np)); in FLAC__window_tukey()
215 FLAC__int32 Np, n, i; in FLAC__window_partial_tukey() local
223 Np = (FLAC__int32)(p / 2.0f * N); in FLAC__window_partial_tukey()
227 for (i = 1; n < (start_n+Np) && n < L; n++, i++) in FLAC__window_partial_tukey()
228 window[n] = (FLAC__real)(0.5f - 0.5f * cosf(M_PI * i / Np)); in FLAC__window_partial_tukey()
229 for (; n < (end_n-Np) && n < L; n++) in FLAC__window_partial_tukey()
[all …]
|
| /external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/ |
| D | eval.pass.cpp | 42 const size_t Np = sizeof(p) / sizeof(p[0]); in test1() local
43 D d(b, b+Np+1, p); in test1()
57 for (std::size_t i = 0; i < Np; ++i) in test1()
105 const size_t Np = sizeof(p) / sizeof(p[0]); in test2() local
106 D d(b, b+Np+1, p); in test2()
120 for (std::size_t i = 0; i < Np; ++i) in test2()
168 const size_t Np = sizeof(p) / sizeof(p[0]); in test3() local
169 D d(b, b+Np+1, p); in test3()
183 for (std::size_t i = 0; i < Np; ++i) in test3()
231 const size_t Np = sizeof(p) / sizeof(p[0]); in test4() local
[all …]
|
| D | max.pass.cpp | 26 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
27 D d(b, b+Np+1, p); in main()
|
| D | min.pass.cpp | 26 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
27 D d(b, b+Np+1, p); in main()
|
| D | param_copy.pass.cpp | 28 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
29 P p0(b, b+Np+1, p); in main()
|
| D | get_param.pass.cpp | 27 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
28 P pa(b, b+Np+1, p); in main()
|
| D | param_assign.pass.cpp | 28 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
29 P p0(b, b+Np+1, p); in main()
|
| /external/llvm-project/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/ |
| D | eval.pass.cpp | 43 const size_t Np = sizeof(p) / sizeof(p[0]); in test1() local
44 D d(b, b+Np+1, p); in test1()
58 for (std::size_t i = 0; i < Np; ++i) in test1()
106 const size_t Np = sizeof(p) / sizeof(p[0]); in test2() local
107 D d(b, b+Np+1, p); in test2()
121 for (std::size_t i = 0; i < Np; ++i) in test2()
169 const size_t Np = sizeof(p) / sizeof(p[0]); in test3() local
170 D d(b, b+Np+1, p); in test3()
184 for (std::size_t i = 0; i < Np; ++i) in test3()
232 const size_t Np = sizeof(p) / sizeof(p[0]); in test4() local
[all …]
|
| D | max.pass.cpp | 27 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
28 D d(b, b+Np+1, p); in main()
|
| D | min.pass.cpp | 27 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
28 D d(b, b+Np+1, p); in main()
|
| D | param_copy.pass.cpp | 29 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
30 P p0(b, b+Np+1, p); in main()
|
| D | get_param.pass.cpp | 28 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
29 P pa(b, b+Np+1, p); in main()
|
| D | param_assign.pass.cpp | 29 const size_t Np = sizeof(p) / sizeof(p[0]); in main() local
30 P p0(b, b+Np+1, p); in main()
|
| /external/boringssl/src/crypto/fipsmodule/md5/asm/ |
| D | md5-586.pl | 28 %Ltmp1=("R0",&Np($C), "R1",&Np($C), "R2",&Np($C), "R3",&Np($D));
41 sub Np subroutine
66 &mov($tmp1,&Np($c)) if $pos < 1; # next tmp1 for R0
67 &mov($tmp1,&Np($c)) if $pos == 1; # next tmp1 for R1
91 &mov($tmp1,&Np($c)) if $pos < 1; # G function - part 1
92 &mov($tmp1,&Np($c)) if $pos == 1; # G function - part 1
120 &mov($tmp1,&Np($c));
137 &mov($tmp1,&Np($c)) if $pos < 1; # H function - part 1
168 &xor($tmp1,&Np($d)) if $pos <= 0; # I function - part = first time
|