Home
last modified time | relevance | path

Searched refs:n2 (Results 1 – 15 of 15) sorted by relevance

/openssl-master/crypto/bn/
A Dbn_mul.c201 bn_mul_normal(r, a, n2 + dna, b, n2 + dnb); in bn_mul_recursive()
270 memset(&t[n2], 0, sizeof(*t) * n2); in bn_mul_recursive()
281 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2)); in bn_mul_recursive()
284 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2)); in bn_mul_recursive()
287 c1 += (int)(bn_add_words(&(t[n2]), &(t[n2]), t, n2)); in bn_mul_recursive()
296 c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2)); in bn_mul_recursive()
403 memset(&r[n2], 0, sizeof(*r) * n2); in bn_mul_part_recursive()
436 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2)); in bn_mul_part_recursive()
439 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2)); in bn_mul_part_recursive()
442 c1 += (int)(bn_add_words(&(t[n2]), &(t[n2]), t, n2)); in bn_mul_part_recursive()
[all …]
A Dbn_sqr.c158 int n = n2 / 2; in bn_sqr_recursive()
162 if (n2 == 4) { in bn_sqr_recursive()
169 } else if (n2 == 8) { in bn_sqr_recursive()
177 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) { in bn_sqr_recursive()
178 bn_sqr_normal(r, a, n2, t); in bn_sqr_recursive()
192 p = &(t[n2 * 2]); in bn_sqr_recursive()
197 memset(&t[n2], 0, sizeof(*t) * n2); in bn_sqr_recursive()
207 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2)); in bn_sqr_recursive()
210 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2)); in bn_sqr_recursive()
218 c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2)); in bn_sqr_recursive()
[all …]
A DREADME.pod38 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
43 int n2, BN_ULONG *tmp);
46 void bn_sqr_recursive(BN_ULONG *r, BN_ULONG *a, int n2, BN_ULONG *tmp);
165 bn_mul_recursive(B<r>, B<a>, B<b>, B<n2>, B<dna>, B<dnb>, B<t>) operates
166 on the word arrays B<a> and B<b> of length B<n2>+B<dna> and B<n2>+B<dnb>
167 (B<dna> and B<dnb> are currently allowed to be 0 or negative) and the 2*B<n2>
168 word arrays B<r> and B<t>. B<n2> must be a power of 2. It computes
175 bn_mul_low_recursive(B<r>, B<a>, B<b>, B<n2>, B<tmp>) operates on the
176 B<n2> word arrays B<r> and B<tmp> and the B<n2>/2 word arrays B<a>
A Dbn_div.c355 BN_ULONG n2 = (wnumtop == wnum) ? 0 : wnumtop[-2]; in bn_div_fixed_top() local
375 if (t2 <= ((((BN_ULLONG) rem) << BN_BITS2) | n2)) in bn_div_fixed_top()
408 if ((t2h < rem) || ((t2h == rem) && (t2l <= n2))) in bn_div_fixed_top()
A Dbn_local.h647 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
651 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t);
653 void bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
/openssl-master/test/testutil/
A Dformat_output.c49 size_t n1, n2, i; in test_fail_string_common() local
72 n1 = n2 = 0; in test_fail_string_common()
86 const size_t j = n1 < n2 ? n1 : n2; in test_fail_string_common()
106 else if (n2 > 0) in test_fail_string_common()
114 m2 += n2; in test_fail_string_common()
116 l2 -= n2; in test_fail_string_common()
434 size_t n1, n2, i; in test_fail_memory_common() local
457 n1 = n2 = 0; in test_fail_memory_common()
471 const size_t j = n1 < n2 ? n1 : n2; in test_fail_memory_common()
505 m2 += n2; in test_fail_memory_common()
[all …]
A Dtests.c305 const char *s1, size_t n1, const char *s2, size_t n2) in test_strn_eq() argument
309 if (n1 != n2 || s1 == NULL || s2 == NULL || strncmp(s1, s2, n1) != 0) { in test_strn_eq()
312 s2, s2 == NULL ? 0 : OPENSSL_strnlen(s2, n2)); in test_strn_eq()
319 const char *s1, size_t n1, const char *s2, size_t n2) in test_strn_ne() argument
323 if (n1 != n2 || s1 == NULL || strncmp(s1, s2, n1) == 0) { in test_strn_ne()
333 const void *s1, size_t n1, const void *s2, size_t n2) in test_mem_eq() argument
337 if (n1 != n2 || s1 == NULL || s2 == NULL || memcmp(s1, s2, n1) != 0) { in test_mem_eq()
339 s1, n1, s2, n2); in test_mem_eq()
346 const void *s1, size_t n1, const void *s2, size_t n2) in test_mem_ne() argument
350 if (n1 != n2) in test_mem_ne()
[all …]
/openssl-master/crypto/idea/
A Di_skey.c93 long n1, n2, q, r, b1, b2, t; in inverse() local
99 n2 = xin; in inverse()
104 r = (n1 % n2); in inverse()
105 q = (n1 - r) / n2; in inverse()
110 n1 = n2; in inverse()
111 n2 = r; in inverse()
/openssl-master/ms/
A Dcmp.pl21 $n2=sysread(IN1,$b2,4096);
23 last if ($n1 != $n2);
/openssl-master/crypto/lhash/
A Dlhash.c225 OPENSSL_LH_NODE **n, **n1, **n2, *np; in expand() local
252 n2 = &(lh->b[p + pmax]); in expand()
253 *n2 = NULL; in expand()
259 np->next = *n2; in expand()
260 *n2 = np; in expand()
/openssl-master/crypto/ec/
A Decp_smpl.c621 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; in ossl_ec_GFp_simple_add() local
644 n2 = BN_CTX_get(ctx); in ossl_ec_GFp_simple_add()
662 if (!BN_copy(n2, a->Y)) in ossl_ec_GFp_simple_add()
705 if (!BN_mod_sub_quick(n6, n2, n4, p)) in ossl_ec_GFp_simple_add()
729 if (!BN_mod_add_quick(n2, n2, n4, p)) in ossl_ec_GFp_simple_add()
778 if (!field_mul(group, n1, n2, n5, ctx)) in ossl_ec_GFp_simple_add()
806 BIGNUM *n0, *n1, *n2, *n3; in ossl_ec_GFp_simple_dbl() local
828 n2 = BN_CTX_get(ctx); in ossl_ec_GFp_simple_dbl()
903 if (!BN_mod_lshift_quick(n2, n2, 2, p)) in ossl_ec_GFp_simple_dbl()
908 if (!BN_mod_lshift1_quick(n0, n2, p)) in ossl_ec_GFp_simple_dbl()
[all …]
/openssl-master/test/
A Dcms-examples.pl348 $n2 = sysread $fp2, $rd2, 4096;
349 last if ( $n1 != $n2 );
A Dectest.c41 BIGNUM *n1 = NULL, *n2 = NULL, *order = NULL; in group_order_tests() local
48 || !TEST_ptr(n2 = BN_new()) in group_order_tests()
96 || !TEST_true(BN_add(n2, order, BN_value_one())) in group_order_tests()
97 || !TEST_true(EC_POINT_mul(group, Q, NULL, P, n2, ctx)) in group_order_tests()
101 || !TEST_true(BN_mul(n2, n1, n2, ctx)) in group_order_tests()
107 BN_set_negative(n2, 0); in group_order_tests()
108 if (!TEST_true(EC_POINT_mul(group, Q, NULL, P, n2, ctx)) in group_order_tests()
127 scalars[1] = n2; in group_order_tests()
131 scalars[3] = n2; in group_order_tests()
135 scalars[5] = n2; in group_order_tests()
[all …]
/openssl-master/crypto/objects/
A Do_names.c334 const OBJ_NAME *const *n2 = n2_; in do_all_sorted_cmp() local
336 return strcmp((*n1)->name, (*n2)->name); in do_all_sorted_cmp()
/openssl-master/
A DCHANGES.md11910 n2 elements) and fallback to bn_mul_normal if either is not zero.

Completed in 48 milliseconds