Lines Matching full:printf
16 printf("%s: ", name);
18 printf("%s\n", buf);
73 printf("Testing montgomery...\n");
75 printf("Testing digit size: %d\n", i);
95 printf("d = e mod a, c = e MOD a\n");
96 mp_todecimal(&a, buf); printf("a = %s\n", buf);
97 mp_todecimal(&e, buf); printf("e = %s\n", buf);
98 mp_todecimal(&d, buf); printf("d = %s\n", buf);
99 mp_todecimal(&c, buf); printf("c = %s\n", buf);
100 printf("compare no compare!\n"); exit(EXIT_FAILURE); }
104 printf("done\n");
107 printf("Testing: mp_get_int\n");
112 printf("mp_get_int() bad result!\n");
118 printf("mp_get_int() bad result!\n");
123 printf("mp_get_int() bad result!\n");
127 printf("Testing: mp_sqrt\n");
129 printf("%6d\r", i);
134 printf("mp_sqrt() error!\n");
139 printf("mp_sqrt() bad result!\n");
144 printf("\nTesting: mp_is_square\n");
146 printf("%6d\r", i);
154 printf("fn:mp_is_square() error!\n");
158 printf("fn:mp_is_square() bad result!\n");
165 printf("fp:mp_is_square() error!\n");
169 printf("fp:mp_is_square() bad result!\n");
174 printf("\n\n");
178 printf("Testing (not safe-prime): %9d bits \r", ix);
185 printf("failed with err code %d\n", err);
189 printf("Prime is %d not %d bits!!!\n", mp_count_bits(&a), ix);
195 printf("Testing ( safe-prime): %9d bits \r", ix);
203 printf("failed with err code %d\n", err);
207 printf("Prime is %d not %d bits!!!\n", mp_count_bits(&a), ix);
215 printf("sub is not prime!\n");
220 printf("\n\n");
224 printf("a == %s\n", buf);
226 printf("a == %s\n", buf);
228 printf("a == %s\n", buf);
237 printf("%s, %lu\n", buf, a.dp[0] & 3);
242 printf("testing mp_cnt_lsb...\n");
246 printf("Failed at %d, %d\n", ix, mp_cnt_lsb(&a));
253 printf("Testing mp_reduce_2k...\n");
261 printf("\nTesting %4d bits", cnt);
262 printf("(%d)", mp_reduce_is_2k(&a));
264 printf("(%d)", tmp);
267 printf(".");
275 printf("FAILED\n");
282 printf("Testing mp_div_3...\n");
288 printf("%9d\r", cnt);
294 printf("\n\nmp_div_3 => Failure\n");
297 printf("\n\nPassed div_3 testing\n");
300 printf("testing mp_dr_reduce...\n");
302 printf("%d digit modulus\n", cnt);
317 printf("%9lu\r", rr);
328 printf("Failed on trial %lu\n", rr);
333 printf("Passed DR test for %d digits\n", cnt);
355 printf("p==%s\n", buf);
358 printf("mp_reduce_is_2k_l() return 0, should be 1\n");
366 printf("testing mp_reduce_2k_l...");
376 printf("mp_reduce_2k_l() failed at step %lu\n", cnt);
378 printf("b == %s\n", buf);
380 printf("c == %s\n", buf);
384 printf("...Passed\n");
427 printf
433 printf("%s ]\r", cmd);
447 printf("mul2d failed, rr == %d\n", rr);
467 printf("div2d failed, rr == %d\n", rr);
483 printf("add %lu failure!\n", add_n);
498 printf("mp_signed_bin failure!\n");
510 printf("mp_unsigned_bin failure!\n");
527 printf("sub %lu failure!\n", sub_n);
545 printf("mul %lu failure!\n", mul_n);
565 printf("div %lu %d, %d, failure!\n", div_n, mp_cmp(&c, &e),
585 printf("sqr %lu failure!\n", sqr_n);
603 printf("gcd %lu failure!\n", gcd_n);
622 printf("lcm %lu failure!\n", lcm_n);
642 printf("expt %lu failure!\n", expt_n);
661 printf("inv [wrong value from MPI?!] failure\n");
679 printf("div_2 %lu failure\n", div2_n);
693 printf("mul_2 %lu failure\n", mul2_n);
709 printf("add_d %lu failure\n", add_d_n);
713 printf("d == %d\n", ix);
726 printf("sub_d %lu failure\n", sub_d_n);
730 printf("d == %d\n", ix);
