1 /* crypto/bn/bn_lcl.h */
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.]
59 #ifndef HEADER_BN_LCL_H
60 #define HEADER_BN_LCL_H
68 /* Pentium pro 16,16,16,32,64 */
69 /* Alpha 16,16,16,16.64 */
70 #define BN_MULL_SIZE_NORMAL (16) // 32
71 #define BN_MUL_RECURSIVE_SIZE_NORMAL (16) // 32 /* less than */
72 #define BN_SQR_RECURSIVE_SIZE_NORMAL (16) // 32
73 #define BN_MUL_LOW_RECURSIVE_SIZE_NORMAL (32) // 32
74 #define BN_MONT_CTX_SET_SIZE_WORD (64) // 32
77 #define bn_mul_comba8(r,a,b) bn_mul_normal(r,a,8,b,8)
78 #define bn_mul_comba4(r,a,b) bn_mul_normal(r,a,4,b,4)
79 /* This is probably faster than using the C code - I need to check */
80 #define bn_sqr_comba8(r,a) bn_mul_normal(r,a,8,a,8)
81 #define bn_sqr_comba4(r,a) bn_mul_normal(r,a,4,a,4)
84 /*************************************************************
85 * Using the long long type
87 #define Lw(t) (((BN_ULONG)(t))&BN_MASK2)
88 #define Hw(t) (((BN_ULONG)((t)>>BN_BITS2))&BN_MASK2)
90 /* These are used for internal error checking and are not normally used */
92 #define bn_check_top(a) \
93 { if (((a)->top < 0) || ((a)->top > (a)->max)) \
94 { char *nullp=NULL; *nullp='z'; } }
95 #define bn_check_num(a) if ((a) < 0) { char *nullp=NULL; *nullp='z'; }
97 #define bn_check_top(a)
98 #define bn_check_num(a)
101 /* This macro is to add extra stuff for development checking */
103 #define bn_set_max(r) ((r)->max=(r)->top,BN_set_flags((r),BN_FLG_STATIC_DATA))
105 #define bn_set_max(r)
108 /* These macros are used to 'take' a section of a bignum for read only use */
109 #define bn_set_low(r,a,n) \
111 (r)->top=((a)->top > (n))?(n):(a)->top; \
114 (r)->flags|=BN_FLG_STATIC_DATA; \
118 #define bn_set_high(r,a,n) \
120 if ((a)->top > (n)) \
122 (r)->top=(a)->top-n; \
123 (r)->d= &((a)->d[n]); \
128 (r)->flags|=BN_FLG_STATIC_DATA; \
132 /* #define bn_expand(n,b) ((((b)/BN_BITS2) <= (n)->max)?(n):bn_expand2((n),(b))) */
135 #define mul_add(r,a,w,c) { \
137 t=(BN_ULLONG)w * (a) + (r) + (c); \
142 #define mul(r,a,w,c) { \
144 t=(BN_ULLONG)w * (a) + (c); \
150 /*************************************************************
154 #define LBITS(a) ((a)&BN_MASK2l)
155 #define HBITS(a) (((a)>>BN_BITS4)&BN_MASK2l)
156 #define L2HBITS(a) ((BN_ULONG)((a)&BN_MASK2l)<<BN_BITS4)
158 #define LLBITS(a) ((a)&BN_MASKl)
159 #define LHBITS(a) (((a)>>BN_BITS2)&BN_MASKl)
160 #define LL2HBITS(a) ((BN_ULLONG)((a)&BN_MASKl)<<BN_BITS2)
162 #define mul64(l,h,bl,bh) \
164 BN_ULONG m,m1,lt,ht; \
172 m=(m+m1)&BN_MASK2; if (m < m1) ht+=L2HBITS(1L); \
175 lt=(lt+m1)&BN_MASK2; if (lt < m1) ht++; \
180 #define sqr64(lo,ho,in) \
190 h+=(m&BN_MASK2h1)>>(BN_BITS4-1); \
191 m =(m&BN_MASK2l)<<(BN_BITS4+1); \
192 l=(l+m)&BN_MASK2; if (l < m) h++; \
197 #define mul_add(r,a,bl,bh,c) { \
203 mul64(l,h,(bl),(bh)); \
205 /* non-multiply part */ \
206 l=(l+(c))&BN_MASK2; if (l < (c)) h++; \
208 l=(l+(c))&BN_MASK2; if (l < (c)) h++; \
213 #define mul(r,a,bl,bh,c) { \
219 mul64(l,h,(bl),(bh)); \
221 /* non-multiply part */ \
222 l+=(c); if ((l&BN_MASK2) < (c)) h++; \
229 extern int bn_limit_bits;
230 extern int bn_limit_num; /* (1<<bn_limit_bits) */
231 /* Recursive 'low' limit */
232 extern int bn_limit_bits_low;
233 extern int bn_limit_num_low; /* (1<<bn_limit_bits_low) */
234 /* Do modified 'high' part calculation' */
235 extern int bn_limit_bits_high;
236 extern int bn_limit_num_high; /* (1<<bn_limit_bits_high) */
237 extern int bn_limit_bits_mont;
238 extern int bn_limit_num_mont; /* (1<<bn_limit_bits_mont) */
242 BIGNUM *bn_expand2(BIGNUM *b, int bits);
245 void bn_add_words(BN_ULONG *r,BN_ULONG *a,int num);
250 BIGNUM *bn_expand2();
252 BN_ULONG bn_add_words();
263 void bn_mul_low_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2,BN_ULONG *t);
264 void bn_mul_high(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,BN_ULONG *l,int n2, BN_ULONG *t);