65 void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb) {  in bn_mul_normal()
66   BN_ULONG *rr;  in bn_mul_normal()
70     BN_ULONG *ltmp;  in bn_mul_normal()
110 void bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n) {  in bn_mul_low_normal()
146 static BN_ULONG bn_sub_part_words(BN_ULONG *r, const BN_ULONG *a,  in bn_sub_part_words()
147                                   const BN_ULONG *b, int cl, int dl) {  in bn_sub_part_words()
148   BN_ULONG c, t;  in bn_sub_part_words()
298 BN_ULONG bn_sub_part_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b,
316 static void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,  in bn_mul_recursive()
317                              int dna, int dnb, BN_ULONG *t) {  in bn_mul_recursive()
321   BN_ULONG ln, lo, *p;  in bn_mul_recursive()
335       memset(&r[2 * n2 + dna + dnb], 0, sizeof(BN_ULONG) * -(dna + dnb));  in bn_mul_recursive()
381       memset(&(t[n2]), 0, 8 * sizeof(BN_ULONG));  in bn_mul_recursive()
391       memset(&(t[n2]), 0, 16 * sizeof(BN_ULONG));  in bn_mul_recursive()
401       memset(&(t[n2]), 0, n2 * sizeof(BN_ULONG));  in bn_mul_recursive()
434     if (ln < (BN_ULONG)c1) {  in bn_mul_recursive()
448 static void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,  in bn_mul_part_recursive()
449                                   int tna, int tnb, BN_ULONG *t) {  in bn_mul_part_recursive()
452   BN_ULONG ln, lo, *p;  in bn_mul_part_recursive()
496     memset(&(r[n2 + tna + tnb]), 0, sizeof(BN_ULONG) * (n2 - tna - tnb));  in bn_mul_part_recursive()
512       memset(&(r[n2 + i * 2]), 0, sizeof(BN_ULONG) * (n2 - i * 2));  in bn_mul_part_recursive()
516       memset(&(r[n2 + tna + tnb]), 0, sizeof(BN_ULONG) * (n2 - tna - tnb));  in bn_mul_part_recursive()
519       memset(&(r[n2]), 0, sizeof(BN_ULONG) * n2);  in bn_mul_part_recursive()
571     if (ln < (BN_ULONG)c1) {  in bn_mul_part_recursive()
626         j = BN_num_bits_word((BN_ULONG)al);  in BN_mul()
629         j = BN_num_bits_word((BN_ULONG)bl);  in BN_mul()
680 static void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp) {  in bn_sqr_normal()
682   const BN_ULONG *ap;  in bn_sqr_normal()
683   BN_ULONG *rp;  in bn_sqr_normal()
724 static void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) {  in bn_sqr_recursive()
727   BN_ULONG ln, lo, *p;  in bn_sqr_recursive()
757     memset(&(t[n2]), 0, n2 * sizeof(BN_ULONG));  in bn_sqr_recursive()
784     if (ln < (BN_ULONG)c1) {  in bn_sqr_recursive()
795 int BN_mul_word(BIGNUM *bn, BN_ULONG w) {  in BN_mul_word()
796   BN_ULONG ll;  in BN_mul_word()
849       BN_ULONG t[BN_SQR_RECURSIVE_SIZE_NORMAL * 2];  in BN_sqr()
854       j = BN_num_bits_word((BN_ULONG)al);  in BN_sqr()