Lines Matching refs:r

27 BN_ULONG bn_sub_part_words(BN_ULONG *r,  in bn_sub_part_words()  argument
34 c = bn_sub_words(r, a, b, cl); in bn_sub_part_words()
39 r += cl; in bn_sub_part_words()
46 r[0] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()
53 r[1] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()
60 r[2] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()
67 r[3] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()
74 r += 4; in bn_sub_part_words()
80 r[0] = (t - c) & BN_MASK2; in bn_sub_part_words()
87 r[1] = (t - c) & BN_MASK2; in bn_sub_part_words()
94 r[2] = (t - c) & BN_MASK2; in bn_sub_part_words()
101 r[3] = (t - c) & BN_MASK2; in bn_sub_part_words()
109 r += 4; in bn_sub_part_words()
115 r[1] = a[1]; in bn_sub_part_words()
120 r[2] = a[2]; in bn_sub_part_words()
125 r[3] = a[3]; in bn_sub_part_words()
130 r += 4; in bn_sub_part_words()
135 r[0] = a[0]; in bn_sub_part_words()
138 r[1] = a[1]; in bn_sub_part_words()
141 r[2] = a[2]; in bn_sub_part_words()
144 r[3] = a[3]; in bn_sub_part_words()
149 r += 4; in bn_sub_part_words()
175 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, in bn_mul_recursive() argument
186 bn_mul_comba4(r, a, b); in bn_mul_recursive()
195 bn_mul_comba8(r, a, b); 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()
251 bn_mul_comba4(r, a, b); in bn_mul_recursive()
252 bn_mul_comba4(&(r[n2]), &(a[n]), &(b[n])); in bn_mul_recursive()
261 bn_mul_comba8(r, a, b); in bn_mul_recursive()
262 bn_mul_comba8(&(r[n2]), &(a[n]), &(b[n])); in bn_mul_recursive()
271 bn_mul_recursive(r, a, b, n, 0, 0, p); 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()
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()
322 void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n, in bn_mul_part_recursive() argument
330 bn_mul_normal(r, a, n + tna, b, n + tnb); in bn_mul_part_recursive()
370 bn_mul_comba4(r, a, b); 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()
377 bn_mul_comba8(r, a, b); 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()
383 bn_mul_recursive(r, a, b, 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()
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()
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
482 bn_mul_recursive(r, a, b, n, 0, 0, &(t[0])); in bn_mul_low_recursive()
485 bn_add_words(&(r[n]), &(r[n]), &(t[0]), n); in bn_mul_low_recursive()
487 bn_add_words(&(r[n]), &(r[n]), &(t[0]), n); in bn_mul_low_recursive()
491 bn_add_words(&(r[n]), &(r[n]), &(t[0]), n); in bn_mul_low_recursive()
492 bn_add_words(&(r[n]), &(r[n]), &(t[n]), n); in bn_mul_low_recursive()
497 int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx) in BN_mul() argument
499 int ret = bn_mul_fixed_top(r, a, b, ctx); in BN_mul()
501 bn_correct_top(r); in BN_mul()
502 bn_check_top(r); in BN_mul()
507 int bn_mul_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx) in bn_mul_fixed_top() argument
522 bn_check_top(r); in bn_mul_fixed_top()
528 BN_zero(r); in bn_mul_fixed_top()
534 if ((r == a) || (r == b)) { in bn_mul_fixed_top()
538 rr = r; in bn_mul_fixed_top()
612 if (r != rr && BN_copy(r, rr) == NULL) in bn_mul_fixed_top()
617 bn_check_top(r); in bn_mul_fixed_top()
622 void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb) in bn_mul_normal() argument
638 rr = &(r[na]); in bn_mul_normal()
640 (void)bn_mul_words(r, a, na, 0); in bn_mul_normal()
643 rr[0] = bn_mul_words(r, a, na, b[0]); in bn_mul_normal()
648 rr[1] = bn_mul_add_words(&(r[1]), a, na, b[1]); in bn_mul_normal()
651 rr[2] = bn_mul_add_words(&(r[2]), a, na, b[2]); in bn_mul_normal()
654 rr[3] = bn_mul_add_words(&(r[3]), a, na, b[3]); in bn_mul_normal()
657 rr[4] = bn_mul_add_words(&(r[4]), a, na, b[4]); in bn_mul_normal()
659 r += 4; in bn_mul_normal()
664 void bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n) in bn_mul_low_normal() argument
666 bn_mul_words(r, a, n, b[0]); in bn_mul_low_normal()
671 bn_mul_add_words(&(r[1]), a, n, b[1]); in bn_mul_low_normal()
674 bn_mul_add_words(&(r[2]), a, n, b[2]); in bn_mul_low_normal()
677 bn_mul_add_words(&(r[3]), a, n, b[3]); in bn_mul_low_normal()
680 bn_mul_add_words(&(r[4]), a, n, b[4]); in bn_mul_low_normal()
681 r += 4; in bn_mul_low_normal()