Lines Matching refs:count_in
581 u_int32_t count_in = 0, count_out = 0, count_possible = 0; in prime_test() local
620 while (fgets(lp, QLINESIZE + 1, in) != NULL && count_in < end_lineno) { in prime_test()
621 count_in++; in prime_test()
622 if (count_in <= last_processed) { in prime_test()
624 "specified start line", count_in); in prime_test()
628 write_checkpoint(checkpoint_file, count_in); in prime_test()
629 print_progress(start_lineno, count_in, end_lineno); in prime_test()
631 debug2("%10u: comment or short line", count_in); in prime_test()
646 debug2("%10u: known composite", count_in); in prime_test()
665 debug2("%10u: (%u) Sophie-Germain", count_in, in_type); in prime_test()
682 debug2("%10u: (%u)", count_in, in_type); in prime_test()
700 debug2("%10u: bit size %u mismatch", count_in, in_size); in prime_test()
704 debug2("%10u: bit size %u too short", count_in, in_size); in prime_test()
734 count_in, generator_known, generator_wanted); in prime_test()
743 debug2("%10u: no known generator", count_in); in prime_test()
758 count_in); in prime_test()
770 debug("%10u: p is not prime", count_in); in prime_test()
773 debug("%10u: p is almost certainly prime", count_in); in prime_test()
777 debug("%10u: q is not prime", count_in); in prime_test()
780 debug("%10u: q is almost certainly prime", count_in); in prime_test()