Home
last modified time | relevance | path

Searched refs:POS1 (Results 1 – 13 of 13) sorted by relevance

/external/jemalloc/test/include/test/
DSFMT-sse2.h91 for (i = 0; i < N - POS1; i++) { in gen_rand_all()
92 r = mm_recursion(&ctx->sfmt[i].si, &ctx->sfmt[i + POS1].si, r1, r2, in gen_rand_all()
99 r = mm_recursion(&ctx->sfmt[i].si, &ctx->sfmt[i + POS1 - N].si, r1, r2, in gen_rand_all()
121 for (i = 0; i < N - POS1; i++) { in gen_rand_array()
122 r = mm_recursion(&ctx->sfmt[i].si, &ctx->sfmt[i + POS1].si, r1, r2, in gen_rand_array()
129 r = mm_recursion(&ctx->sfmt[i].si, &array[i + POS1 - N].si, r1, r2, in gen_rand_array()
137 r = mm_recursion(&array[i - N].si, &array[i + POS1 - N].si, r1, r2, in gen_rand_array()
148 r = mm_recursion(&array[i - N].si, &array[i + POS1 - N].si, r1, r2, in gen_rand_array()
DSFMT-alti.h104 for (i = 0; i < N - POS1; i++) { in gen_rand_all()
105 r = vec_recursion(ctx->sfmt[i].s, ctx->sfmt[i + POS1].s, r1, r2); in gen_rand_all()
111 r = vec_recursion(ctx->sfmt[i].s, ctx->sfmt[i + POS1 - N].s, r1, r2); in gen_rand_all()
131 for (i = 0; i < N - POS1; i++) { in gen_rand_array()
132 r = vec_recursion(ctx->sfmt[i].s, ctx->sfmt[i + POS1].s, r1, r2); in gen_rand_array()
138 r = vec_recursion(ctx->sfmt[i].s, array[i + POS1 - N].s, r1, r2); in gen_rand_array()
145 r = vec_recursion(array[i - N].s, array[i + POS1 - N].s, r1, r2); in gen_rand_array()
154 r = vec_recursion(array[i - N].s, array[i + POS1 - N].s, r1, r2); in gen_rand_array()
DSFMT-params19937.h39 #define POS1 122 macro
DSFMT-params2281.h39 #define POS1 12 macro
DSFMT-params11213.h39 #define POS1 68 macro
DSFMT-params4253.h39 #define POS1 17 macro
DSFMT-params132049.h39 #define POS1 110 macro
DSFMT-params607.h39 #define POS1 2 macro
DSFMT-params44497.h39 #define POS1 330 macro
DSFMT-params216091.h39 #define POS1 627 macro
DSFMT-params86243.h39 #define POS1 366 macro
DSFMT-params1279.h39 #define POS1 7 macro
/external/jemalloc/test/src/
DSFMT.c291 for (i = 0; i < N - POS1; i++) { in gen_rand_all()
292 do_recursion(&ctx->sfmt[i], &ctx->sfmt[i], &ctx->sfmt[i + POS1], r1, in gen_rand_all()
298 do_recursion(&ctx->sfmt[i], &ctx->sfmt[i], &ctx->sfmt[i + POS1 - N], r1, in gen_rand_all()
318 for (i = 0; i < N - POS1; i++) { in gen_rand_array()
319 do_recursion(&array[i], &ctx->sfmt[i], &ctx->sfmt[i + POS1], r1, r2); in gen_rand_array()
324 do_recursion(&array[i], &ctx->sfmt[i], &array[i + POS1 - N], r1, r2); 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()