Home
last modified time | relevance | path

Searched refs:N (Results 1 – 14 of 14) sorted by relevance

/third_party/ulib/jemalloc/test/include/test/
A DSFMT-sse2.h89 r1 = _mm_load_si128(&ctx->sfmt[N - 2].si); in gen_rand_all()
90 r2 = _mm_load_si128(&ctx->sfmt[N - 1].si); in gen_rand_all()
91 for (i = 0; i < N - POS1; i++) { in gen_rand_all()
98 for (; i < N; i++) { in gen_rand_all()
121 for (i = 0; i < N - POS1; i++) { in gen_rand_array()
128 for (; i < N; i++) { in gen_rand_array()
136 for (; i < size - N; i++) { in gen_rand_array()
137 r = mm_recursion(&array[i - N].si, &array[i + POS1 - N].si, r1, r2, in gen_rand_array()
143 for (j = 0; j < 2 * N - size; j++) { in gen_rand_array()
144 r = _mm_load_si128(&array[j + size - N].si); in gen_rand_array()
[all …]
A DSFMT-alti.h102 r1 = ctx->sfmt[N - 2].s; in gen_rand_all()
103 r2 = ctx->sfmt[N - 1].s; in gen_rand_all()
104 for (i = 0; i < N - POS1; i++) { in gen_rand_all()
110 for (; i < N; i++) { in gen_rand_all()
129 r1 = ctx->sfmt[N - 2].s; in gen_rand_array()
130 r2 = ctx->sfmt[N - 1].s; in gen_rand_array()
131 for (i = 0; i < N - POS1; i++) { in gen_rand_array()
137 for (; i < N; i++) { in gen_rand_array()
144 for (; i < size - N; i++) { in gen_rand_array()
145 r = vec_recursion(array[i - N].s, array[i + POS1 - N].s, r1, r2); in gen_rand_array()
[all …]
A DSFMT-params.h53 #define N (MEXP / 128 + 1) macro
56 #define N32 (N * 4)
59 #define N64 (N * 2)
/third_party/ulib/musl/src/multibyte/
A Dwcsrtombs.c6 size_t N = n, l; in wcsrtombs() local
24 return N - n; in wcsrtombs()
42 return N - n; in wcsrtombs()
48 return N - n; in wcsrtombs()
58 return N; in wcsrtombs()
A Dmbrtowc.c10 const unsigned N = n; in mbrtowc() local
46 return N - n; in mbrtowc()
/third_party/ulib/musl/src/math/
A Dtgamma.c57 #define N 12 macro
60 static const double Snum[N + 1] = {
75 static const double Sden[N + 1] = {
113 for (i = N; i >= 0; i--) { in S()
118 for (i = 0; i <= N; i++) { in S()
/third_party/ulib/jemalloc/test/src/
A DSFMT.c101 w128_t sfmt[N];
289 r1 = &ctx->sfmt[N - 2]; in gen_rand_all()
290 r2 = &ctx->sfmt[N - 1]; in gen_rand_all()
297 for (; i < N; i++) { in gen_rand_all()
316 r1 = &ctx->sfmt[N - 2]; in gen_rand_array()
317 r2 = &ctx->sfmt[N - 1]; in gen_rand_array()
323 for (; i < N; i++) { in gen_rand_array()
328 for (; i < size - N; i++) { in gen_rand_array()
329 do_recursion(&array[i], &array[i - N], &array[i + POS1 - N], r1, r2); in gen_rand_array()
337 do_recursion(&array[i], &array[i - N], &array[i + POS1 - N], r1, r2); in gen_rand_array()
[all …]
/third_party/lib/acpica/source/include/acpica/platform/
A Dacefi.h121 _0,_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,N,...) N
/third_party/ulib/jemalloc/m4/
A Dax_cxx_compile_stdcxx.m4304 template < int N >
307 static constexpr int value = N;
/third_party/ulib/uboringssl/include/openssl/
A Devp.h475 uint64_t N, uint64_t r, uint64_t p,
/third_party/ulib/jemalloc/
A Dconfigure.ac963 backtrace_method="N/A"
/third_party/ulib/musl/
A DWHATSNEW139 fixed broken %N$ positional argument specifiers in printf.
/third_party/lib/acpica/tests/misc/
A Dgrammar.asl8462 If (LNotEqual (Local0, 0x4E)) // 'N'
/third_party/lib/acpica/
A Dchanges.txt3784 AccessAs: AttribBytes (n) // Read/Write N-Bytes Protocol
3785 AccessAs: AttribRawBytes (n) // Raw Read/Write N-Bytes
11296 U is an uppercase letter and N is a hex digit.

Completed in 56 milliseconds