538       for (int j = nfactors - 1; j > i; j--)  in factor_insert_multiplicity()  local
540           p[j + 1] = p[j];  in factor_insert_multiplicity()
541           e[j + 1] = e[j];  in factor_insert_multiplicity()
636       for (ptrdiff_t j = nfactors - 1; j > i; j--)  in mp_factor_insert()  local
638           mpz_set (p[j + 1], p[j]);  in mp_factor_insert()
639           e[j + 1] = e[j];  in mp_factor_insert()
717   for (int j = 0; j < off; j++)  in factor_insert_refind()  local
718     p += primes_diff[i + j];  in factor_insert_refind()
2118                   for (int j = 0; j < qpos; j++)  in factor_using_squfof()  local
2120                       if (queue[j].Q == r)  in factor_using_squfof()
2127                           if (P >= queue[j].P)  in factor_using_squfof()
2128                             t = P - queue[j].P;  in factor_using_squfof()
2130                             t = queue[j].P - P;  in factor_using_squfof()
2135                               memmove (queue, queue + j + 1,  in factor_using_squfof()
2136                                        (qpos - j - 1) * sizeof (queue[0]));  in factor_using_squfof()
2137                               qpos -= (j + 1);  in factor_using_squfof()
2456   for (int j = 0; j < factors.nfactors; j++)  in print_factors_single()  local
2457     for (int k = 0; k < factors.e[j]; k++)  in print_factors_single()
2460         print_uintmaxes (0, factors.p[j]);  in print_factors_single()
2461         if (print_exponents && factors.e[j] > 1)  in print_factors_single()
2464             lbuf_putint (factors.e[j], 0);  in print_factors_single()
2530   for (idx_t j = 0; j < factors.nfactors; j++)  in print_factors()  local
2531     for (unsigned long int k = 0; k < factors.e[j]; k++)  in print_factors()
2534         mpz_out_str (stdout, 10, factors.p[j]);  in print_factors()
2535         if (print_exponents && factors.e[j] > 1)  in print_factors()
2537             printf ("^%lu", factors.e[j]);  in print_factors()