]>
Commit | Line | Data |
---|---|---|
d02b48c6 | 1 | /* crypto/bn/bn_lcl.h */ |
58964a49 | 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
d02b48c6 RE |
3 | * All rights reserved. |
4 | * | |
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. | |
8 | * | |
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). | |
15 | * | |
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. | |
22 | * | |
23 | * Redistribution and use in source and binary forms, with or without | |
24 | * modification, are permitted provided that the following conditions | |
25 | * are met: | |
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)" | |
40 | * | |
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 | |
51 | * SUCH DAMAGE. | |
52 | * | |
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.] | |
57 | */ | |
58 | ||
59 | #ifndef HEADER_BN_LCL_H | |
60 | #define HEADER_BN_LCL_H | |
61 | ||
62 | #include "bn.h" | |
63 | ||
64 | #ifdef __cplusplus | |
65 | extern "C" { | |
66 | #endif | |
67 | ||
68 | /************************************************************* | |
69 | * Using the long long type | |
70 | */ | |
71 | #define Lw(t) (((BN_ULONG)(t))&BN_MASK2) | |
72 | #define Hw(t) (((BN_ULONG)((t)>>BN_BITS2))&BN_MASK2) | |
73 | ||
74 | #define bn_fix_top(a) \ | |
75 | { \ | |
76 | BN_ULONG *fix_top_l; \ | |
77 | for (fix_top_l= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \ | |
78 | if (*(fix_top_l--)) break; \ | |
79 | } | |
80 | ||
58964a49 | 81 | /* #define bn_expand(n,b) ((((b)/BN_BITS2) <= (n)->max)?(n):bn_expand2((n),(b))) */ |
d02b48c6 RE |
82 | |
83 | #ifdef BN_LLONG | |
84 | #define mul_add(r,a,w,c) { \ | |
85 | BN_ULLONG t; \ | |
86 | t=(BN_ULLONG)w * (a) + (r) + (c); \ | |
58964a49 | 87 | (r)= Lw(t); \ |
d02b48c6 RE |
88 | (c)= Hw(t); \ |
89 | } | |
90 | ||
91 | #define mul(r,a,w,c) { \ | |
92 | BN_ULLONG t; \ | |
93 | t=(BN_ULLONG)w * (a) + (c); \ | |
58964a49 | 94 | (r)= Lw(t); \ |
d02b48c6 RE |
95 | (c)= Hw(t); \ |
96 | } | |
97 | ||
d02b48c6 RE |
98 | #else |
99 | /************************************************************* | |
100 | * No long long type | |
101 | */ | |
102 | ||
103 | #define LBITS(a) ((a)&BN_MASK2l) | |
104 | #define HBITS(a) (((a)>>BN_BITS4)&BN_MASK2l) | |
105 | #define L2HBITS(a) ((BN_ULONG)((a)&BN_MASK2l)<<BN_BITS4) | |
106 | ||
107 | #define LLBITS(a) ((a)&BN_MASKl) | |
108 | #define LHBITS(a) (((a)>>BN_BITS2)&BN_MASKl) | |
109 | #define LL2HBITS(a) ((BN_ULLONG)((a)&BN_MASKl)<<BN_BITS2) | |
110 | ||
111 | #define mul64(l,h,bl,bh) \ | |
112 | { \ | |
113 | BN_ULONG m,m1,lt,ht; \ | |
114 | \ | |
115 | lt=l; \ | |
116 | ht=h; \ | |
117 | m =(bh)*(lt); \ | |
118 | lt=(bl)*(lt); \ | |
119 | m1=(bl)*(ht); \ | |
120 | ht =(bh)*(ht); \ | |
58964a49 | 121 | m=(m+m1)&BN_MASK2; if (m < m1) ht+=L2HBITS(1L); \ |
d02b48c6 RE |
122 | ht+=HBITS(m); \ |
123 | m1=L2HBITS(m); \ | |
58964a49 | 124 | lt=(lt+m1)&BN_MASK2; if (lt < m1) ht++; \ |
d02b48c6 RE |
125 | (l)=lt; \ |
126 | (h)=ht; \ | |
127 | } | |
128 | ||
129 | #define sqr64(lo,ho,in) \ | |
130 | { \ | |
131 | BN_ULONG l,h,m; \ | |
132 | \ | |
133 | h=(in); \ | |
134 | l=LBITS(h); \ | |
135 | h=HBITS(h); \ | |
136 | m =(l)*(h); \ | |
137 | l*=l; \ | |
138 | h*=h; \ | |
139 | h+=(m&BN_MASK2h1)>>(BN_BITS4-1); \ | |
140 | m =(m&BN_MASK2l)<<(BN_BITS4+1); \ | |
58964a49 | 141 | l=(l+m)&BN_MASK2; if (l < m) h++; \ |
d02b48c6 RE |
142 | (lo)=l; \ |
143 | (ho)=h; \ | |
144 | } | |
145 | ||
146 | #define mul_add(r,a,bl,bh,c) { \ | |
147 | BN_ULONG l,h; \ | |
148 | \ | |
149 | h= (a); \ | |
150 | l=LBITS(h); \ | |
151 | h=HBITS(h); \ | |
152 | mul64(l,h,(bl),(bh)); \ | |
153 | \ | |
154 | /* non-multiply part */ \ | |
58964a49 | 155 | l=(l+(c))&BN_MASK2; if (l < (c)) h++; \ |
d02b48c6 | 156 | (c)=(r); \ |
58964a49 | 157 | l=(l+(c))&BN_MASK2; if (l < (c)) h++; \ |
d02b48c6 | 158 | (c)=h&BN_MASK2; \ |
58964a49 | 159 | (r)=l; \ |
d02b48c6 RE |
160 | } |
161 | ||
162 | #define mul(r,a,bl,bh,c) { \ | |
163 | BN_ULONG l,h; \ | |
164 | \ | |
165 | h= (a); \ | |
166 | l=LBITS(h); \ | |
167 | h=HBITS(h); \ | |
168 | mul64(l,h,(bl),(bh)); \ | |
169 | \ | |
170 | /* non-multiply part */ \ | |
171 | l+=(c); if ((l&BN_MASK2) < (c)) h++; \ | |
172 | (c)=h&BN_MASK2; \ | |
173 | (r)=l&BN_MASK2; \ | |
174 | } | |
175 | ||
d02b48c6 RE |
176 | #endif |
177 | ||
178 | #ifndef NOPROTO | |
179 | ||
180 | BIGNUM *bn_expand2(BIGNUM *b, int bits); | |
181 | ||
58964a49 RE |
182 | #ifdef X86_ASM |
183 | void bn_add_words(BN_ULONG *r,BN_ULONG *a,int num); | |
184 | #endif | |
185 | ||
d02b48c6 RE |
186 | #else |
187 | ||
188 | BIGNUM *bn_expand2(); | |
58964a49 RE |
189 | #ifdef X86_ASM |
190 | BN_ULONG bn_add_words(); | |
191 | #endif | |
d02b48c6 RE |
192 | |
193 | #endif | |
194 | ||
195 | #ifdef __cplusplus | |
196 | } | |
197 | #endif | |
198 | ||
199 | #endif |