Lines Matching +full:0 +full:x256
29 #define HAVE_BN_SQRT 0
51 static int p0[] = { 163, 7, 6, 3, 0, -1 };
52 static int p1[] = { 193, 15, 0, -1 };
63 for ( ; --i >= 0; pp++) in findattr()
64 if (OPENSSL_strcasecmp(pp->key, key) == 0) in findattr()
117 int st = 0; in getint()
132 if (BN_cmp(expected, actual) == 0) in equalBN()
137 return 0; in equalBN()
145 static unsigned int neg = 0; in rand_neg()
146 static int sign[8] = { 0, 0, 0, 1, 1, 0, 1, 1 }; in rand_neg()
154 int top, cond, st = 0; in test_swap()
162 if (!(TEST_true(BN_bntest_rand(a, 1024, 1, 0)) in test_swap()
163 && TEST_true(BN_bntest_rand(b, 1024, 1, 0)) in test_swap()
193 cond = 0; in test_swap()
222 cond = 0; in test_swap()
242 int i, st = 0; in test_sub()
249 for (i = 0; i < NUM0 + NUM1; i++) { in test_sub()
251 if (!(TEST_true(BN_bntest_rand(a, 512, 0, 0))) in test_sub()
253 && TEST_int_ne(BN_set_bit(a, i), 0) in test_sub()
257 if (!TEST_true(BN_bntest_rand(b, 400 + i - NUM1, 0, 0))) in test_sub()
280 int st = 0, i; in test_div_recip()
290 for (i = 0; i < NUM0 + NUM1; i++) { in test_div_recip()
292 if (!(TEST_true(BN_bntest_rand(a, 400, 0, 0)) in test_div_recip()
298 if (!(TEST_true(BN_bntest_rand(b, 50 + 3 * (i - NUM1), 0, 0)))) in test_div_recip()
337 if (!BN_set_word(bn, value < 0 ? -value : value)) { in set_signed_bn()
341 BN_set_negative(bn, value < 0); in set_signed_bn()
348 int st = 0; in test_signed_mod_replace_ab()
371 int st = 0; in test_signed_mod_replace_ba()
394 int st = 0, i; in test_mod()
403 if (!(TEST_true(BN_bntest_rand(a, 1024, 0, 0)))) in test_mod()
405 for (i = 0; i < NUM0; i++) { in test_mod()
406 if (!(TEST_true(BN_bntest_rand(b, 450 + i * 10, 0, 0)))) in test_mod()
477 int st = 0; in test_modexp_mont5()
491 if (!(TEST_true(BN_bntest_rand(m, 1024, 0, 1)) in test_modexp_mont5()
493 && TEST_true(BN_bntest_rand(a, 1024, 0, 0)))) in test_modexp_mont5()
691 if (!TEST_true(BN_bntest_rand(p, 1024, 0, 0))) in test_modexp_mont5()
713 if (!(TEST_true(BN_bntest_rand(e, 1024, 0, 0)) in test_modexp_mont5()
738 int i, st = 0; in test_gf2m_add()
745 for (i = 0; i < NUM0; i++) { in test_gf2m_add()
746 if (!(TEST_true(BN_rand(a, 512, 0, 0)) in test_gf2m_add()
757 /* Test that c + c = 0. */ in test_gf2m_add()
772 int i, j, st = 0; in test_gf2m_mod()
775 || !TEST_ptr(b[0] = BN_new()) in test_gf2m_mod()
782 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0])) in test_gf2m_mod()
786 for (i = 0; i < NUM0; i++) { in test_gf2m_mod()
787 if (!TEST_true(BN_bntest_rand(a, 1024, 0, 0))) in test_gf2m_mod()
789 for (j = 0; j < 2; j++) { in test_gf2m_mod()
793 /* Test that a + (a mod p) mod p == 0. */ in test_gf2m_mod()
801 BN_free(b[0]); in test_gf2m_mod()
813 int i, j, st = 0; in test_gf2m_mul()
816 || !TEST_ptr(b[0] = BN_new()) in test_gf2m_mul()
826 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0])) in test_gf2m_mul()
830 for (i = 0; i < NUM0; i++) { in test_gf2m_mul()
831 if (!(TEST_true(BN_bntest_rand(a, 1024, 0, 0)) in test_gf2m_mul()
832 && TEST_true(BN_bntest_rand(c, 1024, 0, 0)) in test_gf2m_mul()
833 && TEST_true(BN_bntest_rand(d, 1024, 0, 0)))) in test_gf2m_mul()
835 for (j = 0; j < 2; j++) { in test_gf2m_mul()
851 BN_free(b[0]); in test_gf2m_mul()
865 int i, j, st = 0; in test_gf2m_sqr()
868 || !TEST_ptr(b[0] = BN_new()) in test_gf2m_sqr()
874 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0])) in test_gf2m_sqr()
878 for (i = 0; i < NUM0; i++) { in test_gf2m_sqr()
879 if (!TEST_true(BN_bntest_rand(a, 1024, 0, 0))) in test_gf2m_sqr()
881 for (j = 0; j < 2; j++) { in test_gf2m_sqr()
894 BN_free(b[0]); in test_gf2m_sqr()
904 int i, j, st = 0; in test_gf2m_modinv()
907 || !TEST_ptr(b[0] = BN_new()) in test_gf2m_modinv()
914 if (!TEST_true(BN_one(b[0]))) in test_gf2m_modinv()
916 if (!TEST_true(BN_bntest_rand(a, 512, 0, 0))) in test_gf2m_modinv()
918 if (!TEST_false(BN_GF2m_mod_inv(c, a, b[0], ctx))) in test_gf2m_modinv()
921 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0])) in test_gf2m_modinv()
925 for (i = 0; i < NUM0; i++) { in test_gf2m_modinv()
926 if (!TEST_true(BN_bntest_rand(a, 512, 0, 0))) in test_gf2m_modinv()
928 for (j = 0; j < 2; j++) { in test_gf2m_modinv()
939 BN_free(b[0]); in test_gf2m_modinv()
950 int i, j, st = 0; in test_gf2m_moddiv()
953 || !TEST_ptr(b[0] = BN_new()) in test_gf2m_moddiv()
961 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0])) in test_gf2m_moddiv()
965 for (i = 0; i < NUM0; i++) { in test_gf2m_moddiv()
966 if (!(TEST_true(BN_bntest_rand(a, 512, 0, 0)) in test_gf2m_moddiv()
967 && TEST_true(BN_bntest_rand(c, 512, 0, 0)))) in test_gf2m_moddiv()
969 for (j = 0; j < 2; j++) { in test_gf2m_moddiv()
981 BN_free(b[0]); in test_gf2m_moddiv()
994 int i, j, st = 0; in test_gf2m_modexp()
997 || !TEST_ptr(b[0] = BN_new()) in test_gf2m_modexp()
1005 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0])) in test_gf2m_modexp()
1009 for (i = 0; i < NUM0; i++) { in test_gf2m_modexp()
1010 if (!(TEST_true(BN_bntest_rand(a, 512, 0, 0)) in test_gf2m_modexp()
1011 && TEST_true(BN_bntest_rand(c, 512, 0, 0)) in test_gf2m_modexp()
1012 && TEST_true(BN_bntest_rand(d, 512, 0, 0)))) in test_gf2m_modexp()
1014 for (j = 0; j < 2; j++) { in test_gf2m_modexp()
1029 BN_free(b[0]); in test_gf2m_modexp()
1042 int i, j, st = 0; in test_gf2m_modsqrt()
1045 || !TEST_ptr(b[0] = BN_new()) in test_gf2m_modsqrt()
1053 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0])) in test_gf2m_modsqrt()
1057 for (i = 0; i < NUM0; i++) { in test_gf2m_modsqrt()
1058 if (!TEST_true(BN_bntest_rand(a, 512, 0, 0))) in test_gf2m_modsqrt()
1061 for (j = 0; j < 2; j++) { in test_gf2m_modsqrt()
1074 BN_free(b[0]); in test_gf2m_modsqrt()
1087 int i, j, s = 0, t, st = 0; in test_gf2m_modsolvequad()
1090 || !TEST_ptr(b[0] = BN_new()) in test_gf2m_modsolvequad()
1097 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0])) in test_gf2m_modsolvequad()
1101 for (i = 0; i < NUM0; i++) { in test_gf2m_modsolvequad()
1102 if (!TEST_true(BN_bntest_rand(a, 512, 0, 0))) in test_gf2m_modsolvequad()
1104 for (j = 0; j < 2; j++) { in test_gf2m_modsolvequad()
1121 if (!TEST_int_ge(s, 0)) { in test_gf2m_modsolvequad()
1128 BN_free(b[0]); in test_gf2m_modsolvequad()
1140 int i, legendre, kronecker, st = 0; in test_kronecker()
1158 if (!TEST_true(BN_generate_prime_ex(b, 512, 0, NULL, NULL, NULL))) in test_kronecker()
1162 for (i = 0; i < NUM0; i++) { in test_kronecker()
1163 if (!TEST_true(BN_bntest_rand(a, 512, 0, 0))) in test_kronecker()
1170 BN_set_negative(t, 0); in test_kronecker()
1176 BN_set_negative(b, 0); in test_kronecker()
1185 legendre = 0; in test_kronecker()
1189 if (!TEST_int_eq(BN_ucmp(r, b), 0)) { in test_kronecker()
1219 int st = 0; in file_sum()
1266 if (!BN_is_negative(a) && !BN_is_negative(b) && BN_cmp(a, b) >= 0) { in file_sum()
1328 int st = 0; in file_lshift1()
1357 if (!TEST_true(BN_set_bit(lshift1, 0)) in file_lshift1()
1379 int n = 0, st = 0; in file_lshift()
1404 int n = 0, st = 0; in file_rshift()
1435 int st = 0; in file_square()
1455 BN_set_negative(a, 0); in file_square()
1467 if (!TEST_int_eq(BN_sqrt(ret, tmp, ctx), 0)) in file_square()
1471 BN_set_negative(tmp, 0); in file_square()
1495 int st = 0; in file_product()
1533 int st = 0; in file_quotient()
1615 int st = 0; in file_modmul()
1644 st = 0; in file_modmul()
1650 if (st == 0) in file_modmul()
1668 int st = 0; in file_modexp()
1722 int st = 0; in file_exp()
1746 int st = 0; in file_modsqrt()
1770 if (BN_cmp(ret2, mod_sqrt) != 0 in file_modsqrt()
1787 int st = 0; in file_gcd()
1813 int st = 0; in test_bn2padded()
1815 /* Test edge case at 0. */ in test_bn2padded()
1818 if (!TEST_int_eq(BN_bn2binpad(n, NULL, 0), 0)) in test_bn2padded()
1823 memset(zeros, 0, sizeof(zeros)); in test_bn2padded()
1829 # define TOP_BIT_ON 0 in test_bn2padded()
1830 # define BOTTOM_BIT_NOTOUCH 0 in test_bn2padded()
1837 if (!TEST_int_eq(BN_bn2binpad(n, NULL, 0), -1)) in test_bn2padded()
1868 {"0", "", 0},
1923 for (dst += len - 1; len > 0; src++, dst--, len--) in copy_reversed()
1933 int st = 0; in test_bn2signed()
2000 int st = 0; in test_dec2bn()
2002 if (!TEST_int_eq(parsedecBN(&bn, "0"), 1) in test_dec2bn()
2003 || !TEST_BN_eq_word(bn, 0) in test_dec2bn()
2043 if (!TEST_int_eq(parsedecBN(&bn, "-0"), 2) in test_dec2bn()
2069 int st = 0; in test_hex2bn()
2071 if (!TEST_int_eq(parseBN(&bn, "0"), 1) in test_hex2bn()
2080 || !TEST_BN_eq_word(bn, 0x256) in test_hex2bn()
2090 || !TEST_BN_abs_eq_word(bn, 0x42) in test_hex2bn()
2100 || !TEST_BN_eq_word(bn, 0xCB) in test_hex2bn()
2109 if (!TEST_int_eq(parseBN(&bn, "-0"), 2) in test_hex2bn()
2119 || !TEST_BN_eq_word(bn, 0xabc) in test_hex2bn()
2135 int st = 0; in test_asc2bn()
2140 if (!TEST_true(BN_asc2bn(&bn, "0")) in test_asc2bn()
2155 if (!TEST_true(BN_asc2bn(&bn, "0x1234")) in test_asc2bn()
2156 || !TEST_BN_eq_word(bn, 0x1234) in test_asc2bn()
2160 if (!TEST_true(BN_asc2bn(&bn, "0X1234")) in test_asc2bn()
2161 || !TEST_BN_eq_word(bn, 0x1234) in test_asc2bn()
2165 if (!TEST_true(BN_asc2bn(&bn, "-0xabcd")) in test_asc2bn()
2166 || !TEST_BN_abs_eq_word(bn, 0xabcd) in test_asc2bn()
2170 if (!TEST_true(BN_asc2bn(&bn, "-0")) in test_asc2bn()
2187 {"0", "\x00\x00\x00\x00", 4},
2202 int st = 0; in test_mpi()
2232 unsigned char input[] = { 0 }; in test_bin2zero()
2234 int ret = 0; in test_bin2zero()
2242 || !TEST_ptr(fn(input, 0, zbn)) \ in test_bin2zero()
2244 || !TEST_ptr(fn(NULL, 0, zbn)) \ in test_bin2zero()
2265 int ret = 0; in test_bin2bn_lengths()
2269 || !TEST_true(BN_set_word(bn_expected_be, 0x102)) in test_bin2bn_lengths()
2272 || !TEST_true(BN_set_word(bn_expected_le, 0x201))) in test_bin2bn_lengths()
2277 || !TEST_ptr(fn(input, 0, bn_##e)) \ in test_bin2bn_lengths()
2280 || !TEST_int_eq(BN_cmp(bn_##e, bn_expected_##e), 0)) \ in test_bin2bn_lengths()
2301 int st = 0; in test_rand()
2304 return 0; in test_rand()
2307 if (!TEST_false(BN_rand(bn, 0, 0 /* top */ , 0 /* bottom */ )) in test_rand()
2308 || !TEST_false(BN_rand(bn, 0, 1 /* top */ , 1 /* bottom */ )) in test_rand()
2309 || !TEST_true(BN_rand(bn, 1, 0 /* top */ , 0 /* bottom */ )) in test_rand()
2311 || !TEST_false(BN_rand(bn, 1, 1 /* top */ , 0 /* bottom */ )) in test_rand()
2314 || !TEST_true(BN_rand(bn, 2, 1 /* top */ , 0 /* bottom */ )) in test_rand()
2352 double sum = 0; in test_rand_range_single()
2356 int res = 0; in test_rand_range_single()
2363 for (i = 0; i < iterations; i++) { in test_rand_range_single()
2370 for (i = 0; i < range; i++) { in test_rand_range_single()
2393 int n_success = 0; in test_rand_range()
2396 for (i = 0; i < OSSL_NELEM(rand_range_cases); i++) in test_rand_range()
2401 return 0; in test_rand_range()
2408 int consttime, st = 0; in test_negzero()
2427 for (consttime = 0; consttime < 2; consttime++) { in test_negzero()
2477 int st = 0; in test_badmod()
2542 int st = 0; in test_expmodzero()
2574 int ret = 0, i; in test_expmodone()
2586 || !TEST_true(BN_set_word(p, 0)) in test_expmodone()
2590 /* Calculate r = 1 ^ 0 mod 1, and check the result is always 0 */ in test_expmodone()
2591 for (i = 0; i < 2; i++) { in test_expmodone()
2605 /* Repeat for r = 1 ^ 0 mod -1 */ in test_expmodone()
2606 if (i == 0) in test_expmodone()
2622 int st = 0; in test_smallprime()
2628 if (!TEST_false(BN_generate_prime_ex(r, kBits, 0, in test_smallprime()
2632 if (!TEST_true(BN_generate_prime_ex(r, kBits, 0, in test_smallprime()
2647 int st = 0; in test_smallsafeprime()
2673 int ret = 0; in test_is_prime()
2680 for (trial = 0; trial <= 1; ++trial) { in test_is_prime()
2693 static int not_primes[] = { -1, 0, 1, 4 };
2697 int ret = 0; in test_not_prime()
2704 for (trial = 0; trial <= 1; ++trial) { in test_not_prime()
2706 || !TEST_int_eq(BN_check_prime(r, ctx, NULL), 0)) in test_not_prime()
2718 int st = 0; in test_ctx_set_ct_flag()
2723 for (i = 0; i < OSSL_NELEM(b); i++) { in test_ctx_set_ct_flag()
2738 int st = 0; in test_ctx_check_ct_flag()
2743 for (i = 0; i < OSSL_NELEM(b); i++) { in test_ctx_check_ct_flag()
2781 size_t i = 0; in test_ctx_consttime_flag()
2782 int st = 0; in test_ctx_consttime_flag()
2788 for (i = 0; i < 2; i++) { in test_ctx_consttime_flag()
2789 BN_CTX *c = i == 0 ? nctx : sctx; in test_ctx_consttime_flag()
2805 int ret = 0; in test_coprime()
2811 && TEST_int_eq(BN_are_coprime(a, b, ctx), 0) in test_coprime()
2812 && TEST_int_eq(BN_are_coprime(b, a, ctx), 0) in test_coprime()
2824 int i, st = 0; in test_gcd_prime()
2831 if (!TEST_true(BN_generate_prime_ex(a, 1024, 0, NULL, NULL, NULL))) in test_gcd_prime()
2833 for (i = 0; i < NUM_PRIME_TESTS; i++) { in test_gcd_prime()
2834 if (!TEST_true(BN_generate_prime_ex(b, 1024, 0, in test_gcd_prime()
3062 int res = 0; in test_mod_exp()
3096 int res = 0; in test_mod_exp_consttime()
3137 int res = 0; in test_mod_exp2_mont()
3158 /* input of 0 is even, so must fail */ in test_mod_exp2_mont()
3160 exp_p2, exp_m, ctx, NULL), 0)) in test_mod_exp2_mont()
3177 int res = 0; in test_mod_inverse()
3193 if (!TEST_int_eq(strcmp(str, "2609653924"), 0)) in test_mod_inverse()
3212 int res = 0; in test_mod_exp_alias()
3228 if (!TEST_int_eq((idx == 0 ? BN_mod_exp_simple in test_mod_exp_alias()
3242 if (!TEST_int_eq((idx == 0 ? BN_mod_exp_simple in test_mod_exp_alias()
3254 if (idx == 0) { in test_mod_exp_alias()
3255 if (!TEST_int_eq(BN_mod_exp_simple(c, a, b, c, ctx), 0)) in test_mod_exp_alias()
3296 for ( ; --numtests >= 0; tp++) { in file_test_run()
3301 return 0; in file_test_run()
3307 return 0; in file_test_run()
3317 return 0; in run_file_tests()
3320 return 0; in run_file_tests()
3325 if (s->numpairs == 0) in run_file_tests()
3336 return c == 0; in run_file_tests()
3341 OPT_EOF = 0,
3361 int n, stochastic = 0; in setup_tests()
3372 return 0; in setup_tests()
3378 return 0; in setup_tests()
3380 if (n == 0) { in setup_tests()