HomeSort by relevance Sort by last modified time
    Searched refs:Np (Results 1 - 23 of 23) sorted by null

  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/
get_param.pass.cpp 27 const size_t Np = sizeof(p) / sizeof(p[0]);
28 P pa(b, b+Np+1, p);
max.pass.cpp 26 const size_t Np = sizeof(p) / sizeof(p[0]);
27 D d(b, b+Np+1, p);
min.pass.cpp 26 const size_t Np = sizeof(p) / sizeof(p[0]);
27 D d(b, b+Np+1, p);
param_assign.pass.cpp 28 const size_t Np = sizeof(p) / sizeof(p[0]);
29 P p0(b, b+Np+1, p);
param_copy.pass.cpp 28 const size_t Np = sizeof(p) / sizeof(p[0]);
29 P p0(b, b+Np+1, p);
io.pass.cpp 35 const size_t Np = sizeof(p) / sizeof(p[0]);
36 D d1(b, b+Np+1, p);
eval_param.pass.cpp 40 const size_t Np = sizeof(p) / sizeof(p[0]);
42 P pa(b, b+Np+1, p);
56 for (int i = 0; i < Np; ++i)
eval.pass.cpp 39 const size_t Np = sizeof(p) / sizeof(p[0]);
40 D d(b, b+Np+1, p);
54 for (int i = 0; i < Np; ++i)
99 const size_t Np = sizeof(p) / sizeof(p[0]);
100 D d(b, b+Np+1, p);
114 for (int i = 0; i < Np; ++i)
159 const size_t Np = sizeof(p) / sizeof(p[0]);
160 D d(b, b+Np+1, p);
174 for (int i = 0; i < Np; ++i)
219 const size_t Np = sizeof(p) / sizeof(p[0])
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/
get_param.pass.cpp 27 const size_t Np = sizeof(p) / sizeof(p[0]);
28 P pa(b, b+Np, p);
max.pass.cpp 26 const size_t Np = sizeof(p) / sizeof(p[0]);
27 D d(b, b+Np, p);
min.pass.cpp 26 const size_t Np = sizeof(p) / sizeof(p[0]);
27 D d(b, b+Np, p);
param_assign.pass.cpp 28 const size_t Np = sizeof(p) / sizeof(p[0]);
29 P p0(b, b+Np, p);
param_copy.pass.cpp 28 const size_t Np = sizeof(p) / sizeof(p[0]);
29 P p0(b, b+Np, p);
io.pass.cpp 35 const size_t Np = sizeof(p) / sizeof(p[0]);
36 D d1(b, b+Np, p);
eval.pass.cpp 48 const size_t Np = sizeof(p) / sizeof(p[0]) - 1;
49 D d(b, b+Np+1, p);
64 std::vector<double> areas(Np);
73 for (int i = 0; i < Np+1; ++i)
77 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
98 const size_t Np = sizeof(p) / sizeof(p[0]) - 1;
99 D d(b, b+Np+1, p);
114 std::vector<double> areas(Np);
123 for (int i = 0; i < Np+1; ++i)
127 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1
    [all...]
eval_param.pass.cpp 46 const size_t Np = sizeof(p) / sizeof(p[0]) - 1;
48 P pa(b, b+Np+1, p);
63 std::vector<double> areas(Np);
72 for (int i = 0; i < Np+1; ++i)
76 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1;
  /external/flac/libFLAC/
window.c 199 const FLAC__int32 Np = (FLAC__int32)(p / 2.0f * L) - 1;
204 if (Np > 0) {
205 for (n = 0; n <= Np; n++) {
206 window[n] = (FLAC__real)(0.5f - 0.5f * cos(M_PI * n / Np));
207 window[L-Np-1+n] = (FLAC__real)(0.5f - 0.5f * cos(M_PI * (n+Np) / Np));
  /external/chromium_org/third_party/openssl/openssl/crypto/md5/asm/
md5-586.pl 25 %Ltmp1=("R0",&Np($C), "R1",&Np($C), "R2",&Np($C), "R3",&Np($D));
36 sub Np
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($c))
    [all...]
  /external/openssl/crypto/md5/asm/
md5-586.pl 25 %Ltmp1=("R0",&Np($C), "R1",&Np($C), "R2",&Np($C), "R3",&Np($D));
36 sub Np
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($c))
    [all...]
  /external/bison/src/
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;
  /external/chromium_org/third_party/openssl/openssl/crypto/ripemd/asm/
rmd-586.pl 70 sub Np
91 &mov($tmp1, &Np($c)); # NEXT
102 &mov($tmp1, &Np($c)) if $o <= 0;
107 &xor($tmp1, &Np($d)) if $o <= 0;
157 &sub($tmp2, &Np($c)) if $o == 1;
160 &mov($tmp1, &Np($c));
163 &xor($tmp1, &Np($d));
187 &sub($tmp1, &Np($c)) if $o <= 0; # NEXT
203 &sub($tmp2, &Np($c)) if $o <= 0; # NEXT
204 &mov($tmp1, &Np($d)) if $o == 1
    [all...]
  /external/openssl/crypto/ripemd/asm/
rmd-586.pl 70 sub Np
91 &mov($tmp1, &Np($c)); # NEXT
102 &mov($tmp1, &Np($c)) if $o <= 0;
107 &xor($tmp1, &Np($d)) if $o <= 0;
157 &sub($tmp2, &Np($c)) if $o == 1;
160 &mov($tmp1, &Np($c));
163 &xor($tmp1, &Np($d));
187 &sub($tmp1, &Np($c)) if $o <= 0; # NEXT
203 &sub($tmp2, &Np($c)) if $o <= 0; # NEXT
204 &mov($tmp1, &Np($d)) if $o == 1
    [all...]
  /external/chromium_org/third_party/libjingle/source/talk/media/testdata/
h264-svc-99-640x360.rtpdump     [all...]

Completed in 247 milliseconds