Lines Matching refs:t
31 BN_ULONG c, t; in bn_sub_part_words() local
45 t = b[0]; in bn_sub_part_words()
46 r[0] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()
47 if (t != 0) in bn_sub_part_words()
52 t = b[1]; in bn_sub_part_words()
53 r[1] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()
54 if (t != 0) in bn_sub_part_words()
59 t = b[2]; in bn_sub_part_words()
60 r[2] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()
61 if (t != 0) in bn_sub_part_words()
66 t = b[3]; in bn_sub_part_words()
67 r[3] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()
68 if (t != 0) in bn_sub_part_words()
79 t = a[0]; in bn_sub_part_words()
80 r[0] = (t - c) & BN_MASK2; in bn_sub_part_words()
81 if (t != 0) in bn_sub_part_words()
86 t = a[1]; in bn_sub_part_words()
87 r[1] = (t - c) & BN_MASK2; in bn_sub_part_words()
88 if (t != 0) in bn_sub_part_words()
93 t = a[2]; in bn_sub_part_words()
94 r[2] = (t - c) & BN_MASK2; in bn_sub_part_words()
95 if (t != 0) in bn_sub_part_words()
100 t = a[3]; in bn_sub_part_words()
101 r[3] = (t - c) & BN_MASK2; in bn_sub_part_words()
102 if (t != 0) in bn_sub_part_words()
176 int dna, int dnb, BN_ULONG *t) in bn_mul_recursive() argument
213 bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */ in bn_mul_recursive()
214 bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */ in bn_mul_recursive()
220 bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */ in bn_mul_recursive()
221 bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n); /* + */ in bn_mul_recursive()
230 bn_sub_part_words(t, a, &(a[n]), tna, n - tna); /* + */ in bn_mul_recursive()
231 bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */ in bn_mul_recursive()
238 bn_sub_part_words(t, a, &(a[n]), tna, n - tna); in bn_mul_recursive()
239 bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n); 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()
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()
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()
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()
323 int tna, int tnb, BN_ULONG *t) in bn_mul_part_recursive() argument
340 bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */ in bn_mul_part_recursive()
341 bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */ in bn_mul_part_recursive()
345 bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */ in bn_mul_part_recursive()
346 bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n); /* + */ in bn_mul_part_recursive()
353 bn_sub_part_words(t, a, &(a[n]), tna, n - tna); /* + */ in bn_mul_part_recursive()
354 bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */ in bn_mul_part_recursive()
359 bn_sub_part_words(t, a, &(a[n]), tna, n - tna); in bn_mul_part_recursive()
360 bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n); in bn_mul_part_recursive()
369 bn_mul_comba4(&(t[n2]), t, &(t[n])); in bn_mul_part_recursive()
376 bn_mul_comba8(&(t[n2]), t, &(t[n])); 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()
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()
478 BN_ULONG *t) in bn_mul_low_recursive() argument
482 bn_mul_recursive(r, a, b, n, 0, 0, &(t[0])); in bn_mul_low_recursive()
484 bn_mul_low_recursive(&(t[0]), &(a[0]), &(b[n]), n, &(t[n2])); in bn_mul_low_recursive()
485 bn_add_words(&(r[n]), &(r[n]), &(t[0]), n); in bn_mul_low_recursive()
486 bn_mul_low_recursive(&(t[0]), &(a[n]), &(b[0]), n, &(t[n2])); in bn_mul_low_recursive()
487 bn_add_words(&(r[n]), &(r[n]), &(t[0]), n); in bn_mul_low_recursive()
489 bn_mul_low_normal(&(t[0]), &(a[0]), &(b[n]), n); in bn_mul_low_recursive()
490 bn_mul_low_normal(&(t[n]), &(a[n]), &(b[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()
516 BIGNUM *t = NULL; in bn_mul_fixed_top() local
579 t = BN_CTX_get(ctx); in bn_mul_fixed_top()
580 if (t == NULL) in bn_mul_fixed_top()
583 if (bn_wexpand(t, k * 4) == NULL) in bn_mul_fixed_top()
588 j, al - j, bl - j, t->d); in bn_mul_fixed_top()
591 if (bn_wexpand(t, k * 2) == NULL) in bn_mul_fixed_top()
595 bn_mul_recursive(rr->d, a->d, b->d, j, al - j, bl - j, t->d); in bn_mul_fixed_top()
