Lines Matching refs:i

120 JEMALLOC_INLINE_C int idxof(int i);
145 JEMALLOC_INLINE_C int idxof(int i) { in idxof() argument
146 return i ^ 1; in idxof()
149 JEMALLOC_INLINE_C int idxof(int i) { in idxof() argument
150 return i; in idxof()
286 int i; in gen_rand_all() local
291 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()
295 r2 = &ctx->sfmt[i]; in gen_rand_all()
297 for (; i < N; i++) { in gen_rand_all()
298 do_recursion(&ctx->sfmt[i], &ctx->sfmt[i], &ctx->sfmt[i + POS1 - N], r1, in gen_rand_all()
301 r2 = &ctx->sfmt[i]; in gen_rand_all()
313 int i, j; in gen_rand_array() local
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()
321 r2 = &array[i]; in gen_rand_array()
323 for (; i < N; i++) { in gen_rand_array()
324 do_recursion(&array[i], &ctx->sfmt[i], &array[i + POS1 - N], r1, r2); in gen_rand_array()
326 r2 = &array[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()
331 r2 = &array[i]; in gen_rand_array()
336 for (; i < size; i++, j++) { in gen_rand_array()
337 do_recursion(&array[i], &array[i - N], &array[i + POS1 - N], r1, r2); in gen_rand_array()
339 r2 = &array[i]; in gen_rand_array()
340 ctx->sfmt[j] = array[i]; in gen_rand_array()
347 int i; in swap() local
350 for (i = 0; i < size; i++) { in swap()
351 x = array[i].u[0]; in swap()
352 y = array[i].u[2]; in swap()
353 array[i].u[0] = array[i].u[1]; in swap()
354 array[i].u[2] = array[i].u[3]; in swap()
355 array[i].u[1] = x; in swap()
356 array[i].u[3] = y; in swap()
385 int i, j; in period_certification() local
389 for (i = 0; i < 4; i++) in period_certification()
390 inner ^= psfmt32[idxof(i)] & parity[i]; in period_certification()
391 for (i = 16; i > 0; i >>= 1) in period_certification()
392 inner ^= inner >> i; in period_certification()
399 for (i = 0; i < 4; i++) { in period_certification()
402 if ((work & parity[i]) != 0) { in period_certification()
403 psfmt32[idxof(i)] ^= work; in period_certification()
610 int i; in init_gen_rand() local
620 for (i = 1; i < N32; i++) { in init_gen_rand()
621 psfmt32[idxof(i)] = 1812433253UL * (psfmt32[idxof(i - 1)] in init_gen_rand()
622 ^ (psfmt32[idxof(i - 1)] >> 30)) in init_gen_rand()
623 + i; in init_gen_rand()
641 int i, j, count; in init_by_array() local
679 for (i = 1, j = 0; (j < count) && (j < key_length); j++) { in init_by_array()
680 r = func1(psfmt32[idxof(i)] ^ psfmt32[idxof((i + mid) % N32)] in init_by_array()
681 ^ psfmt32[idxof((i + N32 - 1) % N32)]); in init_by_array()
682 psfmt32[idxof((i + mid) % N32)] += r; in init_by_array()
683 r += init_key[j] + i; in init_by_array()
684 psfmt32[idxof((i + mid + lag) % N32)] += r; in init_by_array()
685 psfmt32[idxof(i)] = r; in init_by_array()
686 i = (i + 1) % N32; in init_by_array()
689 r = func1(psfmt32[idxof(i)] ^ psfmt32[idxof((i + mid) % N32)] in init_by_array()
690 ^ psfmt32[idxof((i + N32 - 1) % N32)]); in init_by_array()
691 psfmt32[idxof((i + mid) % N32)] += r; in init_by_array()
692 r += i; in init_by_array()
693 psfmt32[idxof((i + mid + lag) % N32)] += r; in init_by_array()
694 psfmt32[idxof(i)] = r; in init_by_array()
695 i = (i + 1) % N32; in init_by_array()
698 r = func2(psfmt32[idxof(i)] + psfmt32[idxof((i + mid) % N32)] in init_by_array()
699 + psfmt32[idxof((i + N32 - 1) % N32)]); in init_by_array()
700 psfmt32[idxof((i + mid) % N32)] ^= r; in init_by_array()
701 r -= i; in init_by_array()
702 psfmt32[idxof((i + mid + lag) % N32)] ^= r; in init_by_array()
703 psfmt32[idxof(i)] = r; in init_by_array()
704 i = (i + 1) % N32; in init_by_array()