1 /* crypto/bn/bn_asm.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
5 * This package is an SSL implementation written
6 * by Eric Young (eay@cryptsoft.com).
7 * The implementation was written so as to conform with Netscapes SSL.
9 * This library is free for commercial and non-commercial use as long as
10 * the following conditions are aheared to. The following conditions
11 * apply to all code found in this distribution, be it the RC4, RSA,
12 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
13 * included with this distribution is covered by the same copyright terms
14 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
16 * Copyright remains Eric Young's, and as such any Copyright notices in
17 * the code are not to be removed.
18 * If this package is used in a product, Eric Young should be given attribution
19 * as the author of the parts of the library used.
20 * This can be in the form of a textual message at program startup or
21 * in documentation (online or textual) provided with the package.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
26 * 1. Redistributions of source code must retain the copyright
27 * notice, this list of conditions and the following disclaimer.
28 * 2. Redistributions in binary form must reproduce the above copyright
29 * notice, this list of conditions and the following disclaimer in the
30 * documentation and/or other materials provided with the distribution.
31 * 3. All advertising materials mentioning features or use of this software
32 * must display the following acknowledgement:
33 * "This product includes cryptographic software written by
34 * Eric Young (eay@cryptsoft.com)"
35 * The word 'cryptographic' can be left out if the rouines from the library
36 * being used are not cryptographic related :-).
37 * 4. If you include any Windows specific code (or a derivative thereof) from
38 * the apps directory (application code) you must include an acknowledgement:
39 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
41 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
53 * The licence and distribution terms for any publically available version or
54 * derivative of this code cannot be changed. i.e. this code cannot simply be
55 * copied and put under another distribution licence
56 * [including the GNU Public Licence.]
60 # undef NDEBUG /* avoid conflicting definitions */
68 #if defined(BN_LLONG) || defined(BN_UMULT_HIGH)
70 BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
75 if (num <= 0) return(c1);
79 mul_add(rp[0],ap[0],w,c1);
80 mul_add(rp[1],ap[1],w,c1);
81 mul_add(rp[2],ap[2],w,c1);
82 mul_add(rp[3],ap[3],w,c1);
87 mul_add(rp[0],ap[0],w,c1); if (--num==0) return c1;
88 mul_add(rp[1],ap[1],w,c1); if (--num==0) return c1;
89 mul_add(rp[2],ap[2],w,c1); return c1;
95 BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
100 if (num <= 0) return(c1);
104 mul(rp[0],ap[0],w,c1);
105 mul(rp[1],ap[1],w,c1);
106 mul(rp[2],ap[2],w,c1);
107 mul(rp[3],ap[3],w,c1);
108 ap+=4; rp+=4; num-=4;
112 mul(rp[0],ap[0],w,c1); if (--num == 0) return c1;
113 mul(rp[1],ap[1],w,c1); if (--num == 0) return c1;
114 mul(rp[2],ap[2],w,c1);
119 void bn_sqr_words(BN_ULONG *r, BN_ULONG *a, int n)
133 sqr(r[0],r[1],a[0]); if (--n == 0) return;
134 sqr(r[2],r[3],a[1]); if (--n == 0) return;
139 #else /* !(defined(BN_LLONG) || defined(BN_UMULT_HIGH)) */
141 BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
147 if (num <= 0) return((BN_ULONG)0);
154 mul_add(rp[0],ap[0],bl,bh,c);
155 if (--num == 0) break;
156 mul_add(rp[1],ap[1],bl,bh,c);
157 if (--num == 0) break;
158 mul_add(rp[2],ap[2],bl,bh,c);
159 if (--num == 0) break;
160 mul_add(rp[3],ap[3],bl,bh,c);
161 if (--num == 0) break;
168 BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
174 if (num <= 0) return((BN_ULONG)0);
181 mul(rp[0],ap[0],bl,bh,carry);
182 if (--num == 0) break;
183 mul(rp[1],ap[1],bl,bh,carry);
184 if (--num == 0) break;
185 mul(rp[2],ap[2],bl,bh,carry);
186 if (--num == 0) break;
187 mul(rp[3],ap[3],bl,bh,carry);
188 if (--num == 0) break;
195 void bn_sqr_words(BN_ULONG *r, BN_ULONG *a, int n)
201 sqr64(r[0],r[1],a[0]);
204 sqr64(r[2],r[3],a[1]);
207 sqr64(r[4],r[5],a[2]);
210 sqr64(r[6],r[7],a[3]);
218 #endif /* !(defined(BN_LLONG) || defined(BN_UMULT_HIGH)) */
220 #if defined(BN_LLONG) && defined(BN_DIV2W)
222 BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d)
224 return((BN_ULONG)(((((BN_ULLONG)h)<<BN_BITS2)|l)/(BN_ULLONG)d));
229 /* Divide h,l by d and return the result. */
230 /* I need to test this some more :-( */
231 BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d)
233 BN_ULONG dh,dl,q,ret=0,th,tl,t;
236 if (d == 0) return(BN_MASK2);
238 i=BN_num_bits_word(d);
239 assert((i == BN_BITS2) || (h > (BN_ULONG)1<<i));
247 h=(h<<i)|(l>>(BN_BITS2-i));
250 dh=(d&BN_MASK2h)>>BN_BITS4;
254 if ((h>>BN_BITS4) == dh)
267 ((l&BN_MASK2h)>>BN_BITS4))))
274 tl=(tl<<BN_BITS4)&BN_MASK2h;
286 if (--count == 0) break;
289 h=((h<<BN_BITS4)|(l>>BN_BITS4))&BN_MASK2;
290 l=(l&BN_MASK2l)<<BN_BITS4;
295 #endif /* !defined(BN_LLONG) && defined(BN_DIV2W) */
298 BN_ULONG bn_add_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
303 if (n <= 0) return((BN_ULONG)0);
307 ll+=(BN_ULLONG)a[0]+b[0];
308 r[0]=(BN_ULONG)ll&BN_MASK2;
312 ll+=(BN_ULLONG)a[1]+b[1];
313 r[1]=(BN_ULONG)ll&BN_MASK2;
317 ll+=(BN_ULLONG)a[2]+b[2];
318 r[2]=(BN_ULONG)ll&BN_MASK2;
322 ll+=(BN_ULLONG)a[3]+b[3];
323 r[3]=(BN_ULONG)ll&BN_MASK2;
331 return((BN_ULONG)ll);
333 #else /* !BN_LLONG */
334 BN_ULONG bn_add_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
339 if (n <= 0) return((BN_ULONG)0);
382 #endif /* !BN_LLONG */