Lines Matching refs:n2
204 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t)
206 int n = n2 / 2;
211 fprintf(stderr, " bn_sqr_recursive %d * %d\n", n2, n2);
213 if (n2 == 4) {
220 } else if (n2 == 8) {
228 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) {
229 bn_sqr_normal(r, a, n2, t);
243 p = &(t[n2 * 2]);
246 bn_sqr_recursive(&(t[n2]), t, n, p);
248 memset(&(t[n2]), 0, n2 * sizeof(BN_ULONG));
250 bn_sqr_recursive(&(r[n2]), &(a[n]), n, p);
258 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2));
261 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2));
269 c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2));
271 p = &(r[n + n2]);