Home | History | Annotate | Download | only in bn

Lines Matching refs:BN_ULONG

80 BN_ULONG bn_sub_part_words(BN_ULONG *r,
81 const BN_ULONG *a, const BN_ULONG *b,
84 BN_ULONG c, t;
207 BN_ULONG bn_add_part_words(BN_ULONG *r,
208 const BN_ULONG *a, const BN_ULONG *b,
211 BN_ULONG c, l, t;
393 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
394 int dna, int dnb, BN_ULONG *t)
399 BN_ULONG ln,lo,*p;
427 sizeof(BN_ULONG) * -(dna + dnb));
474 memset(&(t[n2]),0,8*sizeof(BN_ULONG));
486 memset(&(t[n2]),0,16*sizeof(BN_ULONG));
498 memset(&(t[n2]),0,n2*sizeof(BN_ULONG));
535 if (ln < (BN_ULONG)c1)
550 void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
551 int tna, int tnb, BN_ULONG *t)
555 BN_ULONG ln,lo,*p;
608 memset(&(r[n2+tn*2]),0,sizeof(BN_ULONG)*(n2-tn*2));
617 memset(&(r[n2+tna+tnb]),0,sizeof(BN_ULONG)*(n2-tna-tnb));
635 memset(&(r[n2+i*2]),0,sizeof(BN_ULONG)*(n2-i*2));
642 sizeof(BN_ULONG)*(n2-tna-tnb));
646 memset(&(r[n2]),0,sizeof(BN_ULONG)*n2);
711 if (ln < (BN_ULONG)c1)
726 void bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
727 BN_ULONG *t)
757 void bn_mul_high(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, BN_ULONG *l, int n2,
758 BN_ULONG *t)
763 BN_ULONG ll,lc,*lp,*mp;
1016 j = BN_num_bits_word((BN_ULONG)al);
1020 j = BN_num_bits_word((BN_ULONG)bl);
1066 j=BN_num_bits_word((BN_ULONG)al);
1104 void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
1106 BN_ULONG *rr;
1115 BN_ULONG *ltmp;
1146 void bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)