Lines Matching refs:n2
175 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, in bn_mul_recursive() argument
178 int n = n2 / 2, c1, c2; in bn_mul_recursive()
185 if (n2 == 4) { in bn_mul_recursive()
194 if (n2 == 8 && dna == 0 && dnb == 0) { in bn_mul_recursive()
200 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) { in bn_mul_recursive()
201 bn_mul_normal(r, a, n2 + dna, b, n2 + dnb); in bn_mul_recursive()
203 memset(&r[2 * n2 + dna + dnb], 0, in bn_mul_recursive()
247 bn_mul_comba4(&(t[n2]), t, &(t[n])); in bn_mul_recursive()
249 memset(&t[n2], 0, sizeof(*t) * 8); in bn_mul_recursive()
252 bn_mul_comba4(&(r[n2]), &(a[n]), &(b[n])); in bn_mul_recursive()
257 bn_mul_comba8(&(t[n2]), t, &(t[n])); in bn_mul_recursive()
259 memset(&t[n2], 0, sizeof(*t) * 16); in bn_mul_recursive()
262 bn_mul_comba8(&(r[n2]), &(a[n]), &(b[n])); in bn_mul_recursive()
266 p = &(t[n2 * 2]); in bn_mul_recursive()
268 bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p); in bn_mul_recursive()
270 memset(&t[n2], 0, sizeof(*t) * n2); in bn_mul_recursive()
272 bn_mul_recursive(&(r[n2]), &(a[n]), &(b[n]), n, dna, dnb, p); 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()
298 p = &(r[n + n2]); in bn_mul_recursive()
325 int i, j, n2 = n * 2; in bn_mul_part_recursive() local
369 bn_mul_comba4(&(t[n2]), t, &(t[n])); in bn_mul_part_recursive()
371 bn_mul_normal(&(r[n2]), &(a[n]), tn, &(b[n]), tn); in bn_mul_part_recursive()
372 memset(&r[n2 + tn * 2], 0, sizeof(*r) * (n2 - tn * 2)); in bn_mul_part_recursive()
376 bn_mul_comba8(&(t[n2]), t, &(t[n])); in bn_mul_part_recursive()
378 bn_mul_normal(&(r[n2]), &(a[n]), tna, &(b[n]), tnb); in bn_mul_part_recursive()
379 memset(&r[n2 + tna + tnb], 0, sizeof(*r) * (n2 - tna - tnb)); in bn_mul_part_recursive()
381 p = &(t[n2 * 2]); in bn_mul_part_recursive()
382 bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p); in bn_mul_part_recursive()
393 bn_mul_recursive(&(r[n2]), &(a[n]), &(b[n]), in bn_mul_part_recursive()
395 memset(&r[n2 + i * 2], 0, sizeof(*r) * (n2 - i * 2)); in bn_mul_part_recursive()
397 bn_mul_part_recursive(&(r[n2]), &(a[n]), &(b[n]), in bn_mul_part_recursive()
399 memset(&(r[n2 + tna + tnb]), 0, in bn_mul_part_recursive()
400 sizeof(BN_ULONG) * (n2 - tna - tnb)); in bn_mul_part_recursive()
403 memset(&r[n2], 0, sizeof(*r) * n2); in bn_mul_part_recursive()
406 bn_mul_normal(&(r[n2]), &(a[n]), tna, &(b[n]), tnb); in bn_mul_part_recursive()
415 bn_mul_part_recursive(&(r[n2]), in bn_mul_part_recursive()
420 bn_mul_recursive(&(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()
451 c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2)); in bn_mul_part_recursive()
453 p = &(r[n + n2]); in bn_mul_part_recursive()
477 void bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, in bn_mul_low_recursive() argument
480 int n = n2 / 2; in bn_mul_low_recursive()
484 bn_mul_low_recursive(&(t[0]), &(a[0]), &(b[n]), n, &(t[n2])); in bn_mul_low_recursive()
486 bn_mul_low_recursive(&(t[0]), &(a[n]), &(b[0]), n, &(t[n2])); in bn_mul_low_recursive()