mirror of
https://github.com/openssl/openssl.git
synced 2024-11-27 05:21:51 +08:00
217 lines
5.7 KiB
C
217 lines
5.7 KiB
C
/* crypto/bn/bn_lcl.h */
|
|
/* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
|
|
* All rights reserved.
|
|
*
|
|
* This package is an SSL implementation written
|
|
* by Eric Young (eay@cryptsoft.com).
|
|
* The implementation was written so as to conform with Netscapes SSL.
|
|
*
|
|
* This library is free for commercial and non-commercial use as long as
|
|
* the following conditions are aheared to. The following conditions
|
|
* apply to all code found in this distribution, be it the RC4, RSA,
|
|
* lhash, DES, etc., code; not just the SSL code. The SSL documentation
|
|
* included with this distribution is covered by the same copyright terms
|
|
* except that the holder is Tim Hudson (tjh@cryptsoft.com).
|
|
*
|
|
* Copyright remains Eric Young's, and as such any Copyright notices in
|
|
* the code are not to be removed.
|
|
* If this package is used in a product, Eric Young should be given attribution
|
|
* as the author of the parts of the library used.
|
|
* This can be in the form of a textual message at program startup or
|
|
* in documentation (online or textual) provided with the package.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* "This product includes cryptographic software written by
|
|
* Eric Young (eay@cryptsoft.com)"
|
|
* The word 'cryptographic' can be left out if the rouines from the library
|
|
* being used are not cryptographic related :-).
|
|
* 4. If you include any Windows specific code (or a derivative thereof) from
|
|
* the apps directory (application code) you must include an acknowledgement:
|
|
* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* The licence and distribution terms for any publically available version or
|
|
* derivative of this code cannot be changed. i.e. this code cannot simply be
|
|
* copied and put under another distribution licence
|
|
* [including the GNU Public Licence.]
|
|
*/
|
|
|
|
#ifndef HEADER_BN_LCL_H
|
|
#define HEADER_BN_LCL_H
|
|
|
|
#include "bn.h"
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
/*************************************************************
|
|
* Using the long long type
|
|
*/
|
|
#define Lw(t) (((BN_ULONG)(t))&BN_MASK2)
|
|
#define Hw(t) (((BN_ULONG)((t)>>BN_BITS2))&BN_MASK2)
|
|
|
|
#define bn_fix_top(a) \
|
|
{ \
|
|
BN_ULONG *fix_top_l; \
|
|
for (fix_top_l= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \
|
|
if (*(fix_top_l--)) break; \
|
|
}
|
|
|
|
#define bn_expand(n,b) ((((b)/BN_BITS2) <= (n)->max)?(n):bn_expand2((n),(b)))
|
|
|
|
#ifdef BN_LLONG
|
|
#define mul_add(r,a,w,c) { \
|
|
BN_ULLONG t; \
|
|
t=(BN_ULLONG)w * (a) + (r) + (c); \
|
|
(r)=Lw(t); \
|
|
(c)= Hw(t); \
|
|
}
|
|
|
|
#define mul(r,a,w,c) { \
|
|
BN_ULLONG t; \
|
|
t=(BN_ULLONG)w * (a) + (c); \
|
|
(r)=Lw(t); \
|
|
(c)= Hw(t); \
|
|
}
|
|
|
|
#define bn_mul_words(r1,r2,a,b) \
|
|
{ \
|
|
BN_ULLONG t; \
|
|
t=(BN_ULLONG)(a)*(b); \
|
|
r1=Lw(t); \
|
|
r2=Hw(t); \
|
|
}
|
|
|
|
#else
|
|
/*************************************************************
|
|
* No long long type
|
|
*/
|
|
|
|
#define LBITS(a) ((a)&BN_MASK2l)
|
|
#define HBITS(a) (((a)>>BN_BITS4)&BN_MASK2l)
|
|
#define L2HBITS(a) ((BN_ULONG)((a)&BN_MASK2l)<<BN_BITS4)
|
|
|
|
#define LLBITS(a) ((a)&BN_MASKl)
|
|
#define LHBITS(a) (((a)>>BN_BITS2)&BN_MASKl)
|
|
#define LL2HBITS(a) ((BN_ULLONG)((a)&BN_MASKl)<<BN_BITS2)
|
|
|
|
#define mul64(l,h,bl,bh) \
|
|
{ \
|
|
BN_ULONG m,m1,lt,ht; \
|
|
\
|
|
lt=l; \
|
|
ht=h; \
|
|
m =(bh)*(lt); \
|
|
lt=(bl)*(lt); \
|
|
m1=(bl)*(ht); \
|
|
ht =(bh)*(ht); \
|
|
m+=m1; if ((m&BN_MASK2) < m1) ht+=L2HBITS(1L); \
|
|
ht+=HBITS(m); \
|
|
m1=L2HBITS(m); \
|
|
lt+=m1; if ((lt&BN_MASK2) < m1) ht++; \
|
|
(l)=lt; \
|
|
(h)=ht; \
|
|
}
|
|
|
|
#define sqr64(lo,ho,in) \
|
|
{ \
|
|
BN_ULONG l,h,m; \
|
|
\
|
|
h=(in); \
|
|
l=LBITS(h); \
|
|
h=HBITS(h); \
|
|
m =(l)*(h); \
|
|
l*=l; \
|
|
h*=h; \
|
|
h+=(m&BN_MASK2h1)>>(BN_BITS4-1); \
|
|
m =(m&BN_MASK2l)<<(BN_BITS4+1); \
|
|
l+=m; if ((l&BN_MASK2) < m) h++; \
|
|
(lo)=l; \
|
|
(ho)=h; \
|
|
}
|
|
|
|
#define mul_add(r,a,bl,bh,c) { \
|
|
BN_ULONG l,h; \
|
|
\
|
|
h= (a); \
|
|
l=LBITS(h); \
|
|
h=HBITS(h); \
|
|
mul64(l,h,(bl),(bh)); \
|
|
\
|
|
/* non-multiply part */ \
|
|
l+=(c); if ((l&BN_MASK2) < (c)) h++; \
|
|
(c)=(r); \
|
|
l+=(c); if ((l&BN_MASK2) < (c)) h++; \
|
|
(c)=h&BN_MASK2; \
|
|
(r)=l&BN_MASK2; \
|
|
}
|
|
|
|
#define mul(r,a,bl,bh,c) { \
|
|
BN_ULONG l,h; \
|
|
\
|
|
h= (a); \
|
|
l=LBITS(h); \
|
|
h=HBITS(h); \
|
|
mul64(l,h,(bl),(bh)); \
|
|
\
|
|
/* non-multiply part */ \
|
|
l+=(c); if ((l&BN_MASK2) < (c)) h++; \
|
|
(c)=h&BN_MASK2; \
|
|
(r)=l&BN_MASK2; \
|
|
}
|
|
|
|
#define bn_mul_words(r1,r2,a,b) \
|
|
{ \
|
|
BN_ULONG l,h,bl,bh; \
|
|
\
|
|
h=(a); \
|
|
l=LBITS(h); \
|
|
h=HBITS(h); \
|
|
bh=(b); \
|
|
bl=LBITS(bh); \
|
|
bh=HBITS(bh); \
|
|
\
|
|
mul64(l,h,bl,bh); \
|
|
\
|
|
(r1)=l; \
|
|
(r2)=h; \
|
|
}
|
|
#endif
|
|
|
|
#ifndef NOPROTO
|
|
|
|
BIGNUM *bn_expand2(BIGNUM *b, int bits);
|
|
|
|
#else
|
|
|
|
BIGNUM *bn_expand2();
|
|
|
|
#endif
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif
|