Lines Matching refs:a
28 void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b);
29 void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b);
30 void bn_sqr_comba4(BN_ULONG *r, BN_ULONG *a);
31 void bn_sqr_comba8(BN_ULONG *r, BN_ULONG *a);
33 int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n);
35 void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b,
37 void bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n);
38 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
40 void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b,
42 void bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b,
45 void bn_sqr_normal(BN_ULONG *r, BN_ULONG *a, int n, BN_ULONG *tmp);
46 void bn_sqr_recursive(BN_ULONG *r, BN_ULONG *a, int n2, BN_ULONG *tmp);
48 void mul(BN_ULONG r, BN_ULONG a, BN_ULONG w, BN_ULONG c);
49 void mul_add(BN_ULONG r, BN_ULONG a, BN_ULONG w, BN_ULONG c);
50 void sqr(BN_ULONG r0, BN_ULONG r1, BN_ULONG a);
52 BIGNUM *bn_expand(BIGNUM *a, int bits);
53 BIGNUM *bn_wexpand(BIGNUM *a, int n);
54 BIGNUM *bn_expand2(BIGNUM *a, int n);
55 void bn_fix_top(BIGNUM *a);
57 void bn_check_top(BIGNUM *a);
58 void bn_print(BIGNUM *a);
60 void bn_set_max(BIGNUM *a);
61 void bn_set_high(BIGNUM *r, BIGNUM *a, int n);
62 void bn_set_low(BIGNUM *r, BIGNUM *a, int n);
86 The integer value is stored in B<d>, a malloc()ed array of words (B<BN_ULONG>),
92 is the number of words being used, so for a value of 4, bn.d[0]=4 and
93 bn.top=1. B<neg> is 1 if the number is negative. When a B<BIGNUM> is
96 B<flags> is a bit field of flags which are defined in C<openssl/bn.h>. The
137 bn_mul_comba4(B<r>, B<a>, B<b>) operates on the 4 word arrays B<a> and
138 B<b> and the 8 word array B<r>. It computes B<a>*B<b> and places the
141 bn_mul_comba8(B<r>, B<a>, B<b>) operates on the 8 word arrays B<a> and
142 B<b> and the 16 word array B<r>. It computes B<a>*B<b> and places the
145 bn_sqr_comba4(B<r>, B<a>, B<b>) operates on the 4 word arrays B<a> and
148 bn_sqr_comba8(B<r>, B<a>, B<b>) operates on the 8 word arrays B<a> and
153 bn_cmp_words(B<a>, B<b>, B<n>) operates on the B<n> word arrays B<a>
154 and B<b>. It returns 1, 0 and -1 if B<a> is greater than, equal and
157 bn_mul_normal(B<r>, B<a>, B<na>, B<b>, B<nb>) operates on the B<na>
158 word array B<a>, the B<nb> word array B<b> and the B<na>+B<nb> word
159 array B<r>. It computes B<a>*B<b> and places the result in B<r>.
161 bn_mul_low_normal(B<r>, B<a>, B<b>, B<n>) operates on the B<n> word
162 arrays B<r>, B<a> and B<b>. It computes the B<n> low words of
163 B<a>*B<b> and places the result in B<r>.
165 bn_mul_recursive(B<r>, B<a>, B<b>, B<n2>, B<dna>, B<dnb>, B<t>) operates
166 on the word arrays B<a> and B<b> of length B<n2>+B<dna> and B<n2>+B<dnb>
168 word arrays B<r> and B<t>. B<n2> must be a power of 2. It computes
169 B<a>*B<b> and places the result in B<r>.
171 bn_mul_part_recursive(B<r>, B<a>, B<b>, B<n>, B<tna>, B<tnb>, B<tmp>)
172 operates on the word arrays B<a> and B<b> of length B<n>+B<tna> and
175 bn_mul_low_recursive(B<r>, B<a>, B<b>, B<n2>, B<tmp>) operates on the
176 B<n2> word arrays B<r> and B<tmp> and the B<n2>/2 word arrays B<a>
186 bn_sqr_normal(B<r>, B<a>, B<n>, B<tmp>) operates on the B<n> word array
187 B<a> and the 2*B<n> word arrays B<tmp> and B<r>.
193 mul(B<r>, B<a>, B<w>, B<c>) computes B<w>*B<a>+B<c> and places the
196 mul_add(B<r>, B<a>, B<w>, B<c>) computes B<w>*B<a>+B<r>+B<c> and
199 sqr(B<r0>, B<r1>, B<a>) computes B<a>*B<a> and places the low word
204 bn_expand() ensures that B<b> has enough space for a B<bits> bit
207 call bn_expand2(), which allocates a new B<d> array and copies the
210 The bn_fix_top() macro reduces B<a-E<gt>top> to point to the most
211 significant non-zero word plus one when B<a> has shrunk.
215 bn_check_top() verifies that C<((a)-E<gt>top E<gt>= 0 && (a)-E<gt>top
216 E<lt>= (a)-E<gt>dmax)>. A violation will cause the program to abort.
218 bn_print() prints B<a> to stderr. bn_dump() prints B<n> words at B<d>
221 bn_set_max() makes B<a> a static number with a B<dmax> of its current size.
222 This is used by bn_set_low() and bn_set_high() to make B<r> a read-only
223 B<BIGNUM> that contains the B<n> low or high words of B<a>.
237 this file except in compliance with the License. You can obtain a copy
