| /external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/ |
| H A D | max.pass.cpp | 26 const size_t Np = sizeof(p) / sizeof(p[0]); local
27 D d(b, b+Np+1, p);
|
| H A D | min.pass.cpp | 26 const size_t Np = sizeof(p) / sizeof(p[0]); local
27 D d(b, b+Np+1, p);
|
| H A D | get_param.pass.cpp | 27 const size_t Np = sizeof(p) / sizeof(p[0]); local
28 P pa(b, b+Np+1, p);
|
| H A D | param_assign.pass.cpp | 28 const size_t Np = sizeof(p) / sizeof(p[0]); local
29 P p0(b, b+Np+1, p);
|
| H A D | param_copy.pass.cpp | 28 const size_t Np = sizeof(p) / sizeof(p[0]); local
29 P p0(b, b+Np+1, p);
|
| H A D | io.pass.cpp | 35 const size_t Np = sizeof(p) / sizeof(p[0]); local
36 D d1(b, b+Np+1, p);
|
| H A D | eval.pass.cpp | 41 const size_t Np = sizeof(p) / sizeof(p[0]); local
42 D d(b, b+Np+1, p);
56 for (int i = 0; i < Np; ++i)
101 const size_t Np = sizeof(p) / sizeof(p[0]);
102 D d(b, b+Np+1, p);
116 for (int i = 0; i < Np; ++i)
161 const size_t Np = sizeof(p) / sizeof(p[0]);
162 D d(b, b+Np+1, p);
176 for (int i = 0; i < Np; ++i)
221 const size_t Np
[all...] |
| H A D | eval_param.pass.cpp | 42 const size_t Np = sizeof(p) / sizeof(p[0]); local
44 P pa(b, b+Np+1, p);
58 for (int i = 0; i < Np; ++i)
|
| /external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/ |
| H A D | max.pass.cpp | 26 const size_t Np = sizeof(p) / sizeof(p[0]); local
27 D d(b, b+Np, p);
|
| H A D | min.pass.cpp | 26 const size_t Np = sizeof(p) / sizeof(p[0]); local
27 D d(b, b+Np, p);
|
| H A D | get_param.pass.cpp | 27 const size_t Np = sizeof(p) / sizeof(p[0]); local
28 P pa(b, b+Np, p);
|
| H A D | param_assign.pass.cpp | 28 const size_t Np = sizeof(p) / sizeof(p[0]); local
29 P p0(b, b+Np, p);
|
| H A D | param_copy.pass.cpp | 28 const size_t Np = sizeof(p) / sizeof(p[0]); local
29 P p0(b, b+Np, p);
|
| H A D | io.pass.cpp | 35 const size_t Np = sizeof(p) / sizeof(p[0]); local
36 D d1(b, b+Np, p);
|
| H A D | eval.pass.cpp | 50 const size_t Np = sizeof(p) / sizeof(p[0]) - 1; local
51 D d(b, b+Np+1, p);
66 std::vector<double> areas(Np);
75 for (int i = 0; i < Np+1; ++i)
79 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
100 const size_t Np = sizeof(p) / sizeof(p[0]) - 1;
101 D d(b, b+Np+1, p);
116 std::vector<double> areas(Np);
125 for (int i = 0; i < Np+1; ++i)
129 int k = std::lower_bound(b, b+Np
[all...] |
| H A D | eval_param.pass.cpp | 48 const size_t Np = sizeof(p) / sizeof(p[0]) - 1; local
50 P pa(b, b+Np+1, p);
65 std::vector<double> areas(Np);
74 for (int i = 0; i < Np+1; ++i)
78 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
|
| /external/boringssl/src/crypto/md5/asm/ |
| H A D | md5-586.pl | 25 %Ltmp1=("R0",&Np($C), "R1",&Np($C), "R2",&Np($C), "R3",&Np($D));
36 sub Np subroutine
61 &mov($tmp1,&Np($c)) if $pos < 1; # next tmp1 for R0
62 &mov($tmp1,&Np($c)) if $pos == 1; # next tmp1 for R1
86 &mov($tmp1,&Np($c)) if $pos < 1; # G function - part 1
87 &mov($tmp1,&Np($c)) if $pos == 1; # G function - part 1
115 &mov($tmp1,&Np(
[all...] |
| /external/bison/src/ |
| H A D | reduce.c | 89 bitset Np, Ns;
92 /* N is set as built. Np is set being built this iteration. P is
95 Np = bitset_create (nvars, BITSET_FIXED);
116 bitset_copy (Np, N);
121 bitset_set (Np, rules[r].lhs->number - ntokens);
124 if (bitset_equal_p (N, Np))
126 Ns = Np;
127 Np = N;
131 N = Np;
88 bitset Np, Ns; local
|
| /external/flac/libFLAC/ |
| H A D | window.c | 196 const FLAC__int32 Np = (FLAC__int32)(p / 2.0f * L) - 1; local
201 if (Np > 0) {
202 for (n = 0; n <= Np; n++) {
203 window[n] = (FLAC__real)(0.5f - 0.5f * cos(M_PI * n / Np));
204 window[L-Np-1+n] = (FLAC__real)(0.5f - 0.5f * cos(M_PI * (n+Np) / Np));
215 FLAC__int32 Np, n, i; local
223 Np = (FLAC__int32)(p / 2.0f * N);
227 for (i = 1; n < (start_n+Np)
[all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| H A D | ThreadSafetyTIL.h | 1042 auto Np = Vs.traverse(Ptr, Vs.subExprCtx(Ctx)); local
1043 return Vs.reduceLoad(*this, Np);
1073 auto Np = Vs.traverse(Dest, Vs.subExprCtx(Ctx)); local
1075 return Vs.reduceStore(*this, Np, Nv);
|