Searched refs:j (Results 1 – 12 of 12) sorted by relevance
| /stdlib/ |
| A D | tst-makecontext2.c | 29 cf (int i, int j) in cf() argument
31 if (i != 78 || j != 274) in cf()
33 printf ("i %d j %d\n", i, j); in cf()
46 for (size_t j = 32; j < 64; j += sizeof (long)) in do_test() local
61 ucp.uc_stack.ss_size = sizeof (st1) - j; in do_test()
62 memset (&st1[sizeof (st1) - j], 0x55, j); in do_test()
70 for (size_t i = j; i > 0; i--) in do_test()
71 if (st1[sizeof (st1) - j + i - 1] != 0x55) in do_test()
72 { printf ("fail %zd %zd\n", i, j); break; } in do_test()
|
| A D | sub_n.c | 28 register mp_size_t j; in mpn_sub_n() local
32 j = -size; in mpn_sub_n()
35 s1_ptr -= j; in mpn_sub_n()
36 s2_ptr -= j; in mpn_sub_n()
37 res_ptr -= j; in mpn_sub_n()
42 y = s2_ptr[j]; in mpn_sub_n()
43 x = s1_ptr[j]; in mpn_sub_n()
48 res_ptr[j] = y; in mpn_sub_n()
50 while (++j != 0); in mpn_sub_n()
|
| A D | add_n.c | 28 register mp_size_t j; in mpn_add_n() local
32 j = -size; in mpn_add_n()
35 s1_ptr -= j; in mpn_add_n()
36 s2_ptr -= j; in mpn_add_n()
37 res_ptr -= j; in mpn_add_n()
42 y = s2_ptr[j]; in mpn_add_n()
43 x = s1_ptr[j]; in mpn_add_n()
48 res_ptr[j] = y; in mpn_add_n()
50 while (++j != 0); in mpn_add_n()
|
| A D | mul_1.c | 31 register mp_size_t j; in mpn_mul_1() local
36 j = -s1_size; in mpn_mul_1()
39 s1_ptr -= j; in mpn_mul_1()
40 res_ptr -= j; in mpn_mul_1()
45 umul_ppmm (prod_high, prod_low, s1_ptr[j], s2_limb); in mpn_mul_1()
50 res_ptr[j] = prod_low; in mpn_mul_1()
52 while (++j != 0); in mpn_mul_1()
|
| A D | submul_1.c | 33 register mp_size_t j; in mpn_submul_1() local
39 j = -s1_size; in mpn_submul_1()
42 res_ptr -= j; in mpn_submul_1()
43 s1_ptr -= j; in mpn_submul_1()
48 umul_ppmm (prod_high, prod_low, s1_ptr[j], s2_limb); in mpn_submul_1()
53 x = res_ptr[j]; in mpn_submul_1()
56 res_ptr[j] = prod_low; in mpn_submul_1()
58 while (++j != 0); in mpn_submul_1()
|
| A D | addmul_1.c | 33 register mp_size_t j; in mpn_addmul_1() local
39 j = -s1_size; in mpn_addmul_1()
42 res_ptr -= j; in mpn_addmul_1()
43 s1_ptr -= j; in mpn_addmul_1()
48 umul_ppmm (prod_high, prod_low, s1_ptr[j], s2_limb); in mpn_addmul_1()
53 x = res_ptr[j]; in mpn_addmul_1()
56 res_ptr[j] = prod_low; in mpn_addmul_1()
58 while (++j != 0); in mpn_addmul_1()
|
| A D | testdiv.c | 25 int i, j; in main() local
26 while (scanf ("%d %d\n", &i, &j) == 2) in main()
28 div_t d = div (i, j); in main()
29 printf ("%d / %d = %d + %d/%d", i, j, d.quot, d.rem, j); in main()
30 if (i == d.quot * j + d.rem) in main()
|
| A D | testsort.c | 17 size_t i, j; in main() local
25 for (j = 0; j < lens[i]; ++j) in main()
26 lines[i][j] = random() % 26 + 'a'; in main()
27 lines[i][j] = '\0'; in main()
|
| A D | tst-random2.c | 33 int j; in do_test() local
34 for (j = 0; j < 3; ++j) in do_test()
|
| A D | gen-fpioconst.c | 42 int j = 1 << i; in main() local
43 mpz_ui_pow_ui (p, 10, j - 1); in main()
45 mpz_ui_pow_ui (p, 10, j); in main()
|
| A D | msort.c | 262 size_t j = i; in __qsort_r() local
269 tp[j] = jp; in __qsort_r()
271 j = k; in __qsort_r()
277 tp[j] = jp; in __qsort_r()
|
| A D | strtol_l.c | 380 unsigned long int j = 0; in INTERNAL() local
418 else if (j >= jmax) in INTERNAL()
421 i = (unsigned LONG int) j; in INTERNAL()
425 j = j * (unsigned long int) base + c; in INTERNAL()
428 i = (unsigned LONG int) j; in INTERNAL()
|
Completed in 22 milliseconds