*/\r
\r
#ifndef HEADER_BN_H\r
-#define HEADER_BN_H\r
+# define HEADER_BN_H\r
\r
-#include <openssl/e_os2.h>\r
-#ifndef OPENSSL_NO_FP_API\r
-#include <stdio.h> /* FILE */\r
-#endif\r
-#include <openssl/ossl_typ.h>\r
-#include <openssl/crypto.h>\r
+# include <openssl/e_os2.h>\r
+# ifndef OPENSSL_NO_FP_API\r
+# include <stdio.h> /* FILE */\r
+# endif\r
+# include <openssl/ossl_typ.h>\r
+# include <openssl/crypto.h>\r
\r
#ifdef __cplusplus\r
extern "C" {\r
#endif\r
\r
-/* These preprocessor symbols control various aspects of the bignum headers and\r
- * library code. They're not defined by any "normal" configuration, as they are\r
- * intended for development and testing purposes. NB: defining all three can be\r
- * useful for debugging application code as well as openssl itself.\r
- *\r
- * BN_DEBUG - turn on various debugging alterations to the bignum code\r
- * BN_DEBUG_RAND - uses random poisoning of unused words to trip up\r
+/*\r
+ * These preprocessor symbols control various aspects of the bignum headers\r
+ * and library code. They're not defined by any "normal" configuration, as\r
+ * they are intended for development and testing purposes. NB: defining all\r
+ * three can be useful for debugging application code as well as openssl\r
+ * itself. BN_DEBUG - turn on various debugging alterations to the bignum\r
+ * code BN_DEBUG_RAND - uses random poisoning of unused words to trip up\r
* mismanagement of bignum internals. You must also define BN_DEBUG.\r
*/\r
/* #define BN_DEBUG */\r
/* #define BN_DEBUG_RAND */\r
\r
-#ifndef OPENSSL_SMALL_FOOTPRINT\r
-#define BN_MUL_COMBA\r
-#define BN_SQR_COMBA\r
-#define BN_RECURSION\r
-#endif\r
+# ifndef OPENSSL_SMALL_FOOTPRINT\r
+# define BN_MUL_COMBA\r
+# define BN_SQR_COMBA\r
+# define BN_RECURSION\r
+# endif\r
\r
-/* This next option uses the C libraries (2 word)/(1 word) function.\r
- * If it is not defined, I use my C version (which is slower).\r
- * The reason for this flag is that when the particular C compiler\r
- * library routine is used, and the library is linked with a different\r
- * compiler, the library is missing. This mostly happens when the\r
- * library is built with gcc and then linked using normal cc. This would\r
- * be a common occurrence because gcc normally produces code that is\r
- * 2 times faster than system compilers for the big number stuff.\r
- * For machines with only one compiler (or shared libraries), this should\r
- * be on. Again this in only really a problem on machines\r
- * using "long long's", are 32bit, and are not using my assembler code. */\r
-#if defined(OPENSSL_SYS_MSDOS) || defined(OPENSSL_SYS_WINDOWS) || \\r
+/*\r
+ * This next option uses the C libraries (2 word)/(1 word) function. If it is\r
+ * not defined, I use my C version (which is slower). The reason for this\r
+ * flag is that when the particular C compiler library routine is used, and\r
+ * the library is linked with a different compiler, the library is missing.\r
+ * This mostly happens when the library is built with gcc and then linked\r
+ * using normal cc. This would be a common occurrence because gcc normally\r
+ * produces code that is 2 times faster than system compilers for the big\r
+ * number stuff. For machines with only one compiler (or shared libraries),\r
+ * this should be on. Again this in only really a problem on machines using\r
+ * "long long's", are 32bit, and are not using my assembler code.\r
+ */\r
+# if defined(OPENSSL_SYS_MSDOS) || defined(OPENSSL_SYS_WINDOWS) || \\r
defined(OPENSSL_SYS_WIN32) || defined(linux)\r
-# ifndef BN_DIV2W\r
-# define BN_DIV2W\r
+# ifndef BN_DIV2W\r
+# define BN_DIV2W\r
+# endif\r
# endif\r
-#endif\r
\r
-/* assuming long is 64bit - this is the DEC Alpha\r
- * unsigned long long is only 64 bits :-(, don't define\r
- * BN_LLONG for the DEC Alpha */\r
-#ifdef SIXTY_FOUR_BIT_LONG\r
-#define BN_ULLONG unsigned long long\r
-#define BN_ULONG unsigned long\r
-#define BN_LONG long\r
-#define BN_BITS 128\r
-#define BN_BYTES 8\r
-#define BN_BITS2 64\r
-#define BN_BITS4 32\r
-#define BN_MASK (0xffffffffffffffffffffffffffffffffLL)\r
-#define BN_MASK2 (0xffffffffffffffffL)\r
-#define BN_MASK2l (0xffffffffL)\r
-#define BN_MASK2h (0xffffffff00000000L)\r
-#define BN_MASK2h1 (0xffffffff80000000L)\r
-#define BN_TBIT (0x8000000000000000L)\r
-#define BN_DEC_CONV (10000000000000000000UL)\r
-#define BN_DEC_FMT1 "%lu"\r
-#define BN_DEC_FMT2 "%019lu"\r
-#define BN_DEC_NUM 19\r
-#define BN_HEX_FMT1 "%lX"\r
-#define BN_HEX_FMT2 "%016lX"\r
-#endif\r
+/*\r
+ * assuming long is 64bit - this is the DEC Alpha unsigned long long is only\r
+ * 64 bits :-(, don't define BN_LLONG for the DEC Alpha\r
+ */\r
+# ifdef SIXTY_FOUR_BIT_LONG\r
+# define BN_ULLONG unsigned long long\r
+# define BN_ULONG unsigned long\r
+# define BN_LONG long\r
+# define BN_BITS 128\r
+# define BN_BYTES 8\r
+# define BN_BITS2 64\r
+# define BN_BITS4 32\r
+# define BN_MASK (0xffffffffffffffffffffffffffffffffLL)\r
+# define BN_MASK2 (0xffffffffffffffffL)\r
+# define BN_MASK2l (0xffffffffL)\r
+# define BN_MASK2h (0xffffffff00000000L)\r
+# define BN_MASK2h1 (0xffffffff80000000L)\r
+# define BN_TBIT (0x8000000000000000L)\r
+# define BN_DEC_CONV (10000000000000000000UL)\r
+# define BN_DEC_FMT1 "%lu"\r
+# define BN_DEC_FMT2 "%019lu"\r
+# define BN_DEC_NUM 19\r
+# define BN_HEX_FMT1 "%lX"\r
+# define BN_HEX_FMT2 "%016lX"\r
+# endif\r
\r
-/* This is where the long long data type is 64 bits, but long is 32.\r
- * For machines where there are 64bit registers, this is the mode to use.\r
- * IRIX, on R4000 and above should use this mode, along with the relevant\r
- * assembler code :-). Do NOT define BN_LLONG.\r
+/*\r
+ * This is where the long long data type is 64 bits, but long is 32. For\r
+ * machines where there are 64bit registers, this is the mode to use. IRIX,\r
+ * on R4000 and above should use this mode, along with the relevant assembler\r
+ * code :-). Do NOT define BN_LLONG.\r
*/\r
-#ifdef SIXTY_FOUR_BIT\r
-#undef BN_LLONG\r
-#undef BN_ULLONG\r
-#define BN_ULONG unsigned long long\r
-#define BN_LONG long long\r
-#define BN_BITS 128\r
-#define BN_BYTES 8\r
-#define BN_BITS2 64\r
-#define BN_BITS4 32\r
-#define BN_MASK2 (0xffffffffffffffffLL)\r
-#define BN_MASK2l (0xffffffffL)\r
-#define BN_MASK2h (0xffffffff00000000LL)\r
-#define BN_MASK2h1 (0xffffffff80000000LL)\r
-#define BN_TBIT (0x8000000000000000LL)\r
-#define BN_DEC_CONV (10000000000000000000ULL)\r
-#define BN_DEC_FMT1 "%llu"\r
-#define BN_DEC_FMT2 "%019llu"\r
-#define BN_DEC_NUM 19\r
-#define BN_HEX_FMT1 "%llX"\r
-#define BN_HEX_FMT2 "%016llX"\r
-#endif\r
+# ifdef SIXTY_FOUR_BIT\r
+# undef BN_LLONG\r
+# undef BN_ULLONG\r
+# define BN_ULONG unsigned long long\r
+# define BN_LONG long long\r
+# define BN_BITS 128\r
+# define BN_BYTES 8\r
+# define BN_BITS2 64\r
+# define BN_BITS4 32\r
+# define BN_MASK2 (0xffffffffffffffffLL)\r
+# define BN_MASK2l (0xffffffffL)\r
+# define BN_MASK2h (0xffffffff00000000LL)\r
+# define BN_MASK2h1 (0xffffffff80000000LL)\r
+# define BN_TBIT (0x8000000000000000LL)\r
+# define BN_DEC_CONV (10000000000000000000ULL)\r
+# define BN_DEC_FMT1 "%llu"\r
+# define BN_DEC_FMT2 "%019llu"\r
+# define BN_DEC_NUM 19\r
+# define BN_HEX_FMT1 "%llX"\r
+# define BN_HEX_FMT2 "%016llX"\r
+# endif\r
\r
-#ifdef THIRTY_TWO_BIT\r
-#ifdef BN_LLONG\r
-# if defined(_WIN32) && !defined(__GNUC__)\r
-# define BN_ULLONG unsigned __int64\r
-# define BN_MASK (0xffffffffffffffffI64)\r
-# else\r
-# define BN_ULLONG unsigned long long\r
-# define BN_MASK (0xffffffffffffffffLL)\r
+# ifdef THIRTY_TWO_BIT\r
+# ifdef BN_LLONG\r
+# if defined(_WIN32) && !defined(__GNUC__)\r
+# define BN_ULLONG unsigned __int64\r
+# define BN_MASK (0xffffffffffffffffI64)\r
+# else\r
+# define BN_ULLONG unsigned long long\r
+# define BN_MASK (0xffffffffffffffffLL)\r
+# endif\r
+# endif\r
+# define BN_ULONG unsigned int\r
+# define BN_LONG int\r
+# define BN_BITS 64\r
+# define BN_BYTES 4\r
+# define BN_BITS2 32\r
+# define BN_BITS4 16\r
+# define BN_MASK2 (0xffffffffL)\r
+# define BN_MASK2l (0xffff)\r
+# define BN_MASK2h1 (0xffff8000L)\r
+# define BN_MASK2h (0xffff0000L)\r
+# define BN_TBIT (0x80000000L)\r
+# define BN_DEC_CONV (1000000000L)\r
+# define BN_DEC_FMT1 "%u"\r
+# define BN_DEC_FMT2 "%09u"\r
+# define BN_DEC_NUM 9\r
+# define BN_HEX_FMT1 "%X"\r
+# define BN_HEX_FMT2 "%08X"\r
# endif\r
-#endif\r
-#define BN_ULONG unsigned int\r
-#define BN_LONG int\r
-#define BN_BITS 64\r
-#define BN_BYTES 4\r
-#define BN_BITS2 32\r
-#define BN_BITS4 16\r
-#define BN_MASK2 (0xffffffffL)\r
-#define BN_MASK2l (0xffff)\r
-#define BN_MASK2h1 (0xffff8000L)\r
-#define BN_MASK2h (0xffff0000L)\r
-#define BN_TBIT (0x80000000L)\r
-#define BN_DEC_CONV (1000000000L)\r
-#define BN_DEC_FMT1 "%u"\r
-#define BN_DEC_FMT2 "%09u"\r
-#define BN_DEC_NUM 9\r
-#define BN_HEX_FMT1 "%X"\r
-#define BN_HEX_FMT2 "%08X"\r
-#endif\r
\r
-/* 2011-02-22 SMS.\r
- * In various places, a size_t variable or a type cast to size_t was\r
- * used to perform integer-only operations on pointers. This failed on\r
- * VMS with 64-bit pointers (CC /POINTER_SIZE = 64) because size_t is\r
- * still only 32 bits. What's needed in these cases is an integer type\r
- * with the same size as a pointer, which size_t is not certain to be.\r
- * The only fix here is VMS-specific.\r
+# define BN_DEFAULT_BITS 1280\r
+\r
+# define BN_FLG_MALLOCED 0x01\r
+# define BN_FLG_STATIC_DATA 0x02\r
+\r
+/*\r
+ * avoid leaking exponent information through timing,\r
+ * BN_mod_exp_mont() will call BN_mod_exp_mont_consttime,\r
+ * BN_div() will call BN_div_no_branch,\r
+ * BN_mod_inverse() will call BN_mod_inverse_no_branch.\r
*/\r
-#if defined(OPENSSL_SYS_VMS)\r
-# if __INITIAL_POINTER_SIZE == 64\r
-# define PTR_SIZE_INT long long\r
-# else /* __INITIAL_POINTER_SIZE == 64 */\r
-# define PTR_SIZE_INT int\r
-# endif /* __INITIAL_POINTER_SIZE == 64 [else] */\r
-#else /* defined(OPENSSL_SYS_VMS) */\r
-# define PTR_SIZE_INT size_t\r
-#endif /* defined(OPENSSL_SYS_VMS) [else] */\r
-\r
-#define BN_DEFAULT_BITS 1280\r
-\r
-#define BN_FLG_MALLOCED 0x01\r
-#define BN_FLG_STATIC_DATA 0x02\r
-#define BN_FLG_CONSTTIME 0x04 /* avoid leaking exponent information through timing,\r
- * BN_mod_exp_mont() will call BN_mod_exp_mont_consttime,\r
- * BN_div() will call BN_div_no_branch,\r
- * BN_mod_inverse() will call BN_mod_inverse_no_branch.\r
- */\r
-\r
-#ifndef OPENSSL_NO_DEPRECATED\r
-#define BN_FLG_EXP_CONSTTIME BN_FLG_CONSTTIME /* deprecated name for the flag */\r
- /* avoid leaking exponent information through timings\r
- * (BN_mod_exp_mont() will call BN_mod_exp_mont_consttime) */\r
-#endif\r
+# define BN_FLG_CONSTTIME 0x04\r
+\r
+# ifdef OPENSSL_NO_DEPRECATED\r
+/* deprecated name for the flag */\r
+# define BN_FLG_EXP_CONSTTIME BN_FLG_CONSTTIME\r
+/*\r
+ * avoid leaking exponent information through timings\r
+ * (BN_mod_exp_mont() will call BN_mod_exp_mont_consttime)\r
+ */\r
+# endif\r
\r
-#ifndef OPENSSL_NO_DEPRECATED\r
-#define BN_FLG_FREE 0x8000 /* used for debuging */\r
-#endif\r
-#define BN_set_flags(b,n) ((b)->flags|=(n))\r
-#define BN_get_flags(b,n) ((b)->flags&(n))\r
+# ifndef OPENSSL_NO_DEPRECATED\r
+# define BN_FLG_FREE 0x8000\r
+ /* used for debuging */\r
+# endif\r
+# define BN_set_flags(b,n) ((b)->flags|=(n))\r
+# define BN_get_flags(b,n) ((b)->flags&(n))\r
\r
-/* get a clone of a BIGNUM with changed flags, for *temporary* use only\r
- * (the two BIGNUMs cannot not be used in parallel!) */\r
-#define BN_with_flags(dest,b,n) ((dest)->d=(b)->d, \\r
+/*\r
+ * get a clone of a BIGNUM with changed flags, for *temporary* use only (the\r
+ * two BIGNUMs cannot not be used in parallel!)\r
+ */\r
+# define BN_with_flags(dest,b,n) ((dest)->d=(b)->d, \\r
(dest)->top=(b)->top, \\r
(dest)->dmax=(b)->dmax, \\r
(dest)->neg=(b)->neg, \\r
| (n)))\r
\r
/* Already declared in ossl_typ.h */\r
-#if 0\r
+# if 0\r
typedef struct bignum_st BIGNUM;\r
/* Used for temp variables (declaration hidden in bn_lcl.h) */\r
typedef struct bignum_ctx BN_CTX;\r
typedef struct bn_mont_ctx_st BN_MONT_CTX;\r
typedef struct bn_recp_ctx_st BN_RECP_CTX;\r
typedef struct bn_gencb_st BN_GENCB;\r
-#endif\r
+# endif\r
\r
-struct bignum_st\r
- {\r
- BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks. */\r
- int top; /* Index of last used d +1. */\r
- /* The next are internal book keeping for bn_expand. */\r
- int dmax; /* Size of the d array. */\r
- int neg; /* one if the number is negative */\r
- int flags;\r
- };\r
+struct bignum_st {\r
+ BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit\r
+ * chunks. */\r
+ int top; /* Index of last used d +1. */\r
+ /* The next are internal book keeping for bn_expand. */\r
+ int dmax; /* Size of the d array. */\r
+ int neg; /* one if the number is negative */\r
+ int flags;\r
+};\r
\r
/* Used for montgomery multiplication */\r
-struct bn_mont_ctx_st\r
- {\r
- int ri; /* number of bits in R */\r
- BIGNUM RR; /* used to convert to montgomery form */\r
- BIGNUM N; /* The modulus */\r
- BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1\r
- * (Ni is only stored for bignum algorithm) */\r
- BN_ULONG n0[2];/* least significant word(s) of Ni;\r
- (type changed with 0.9.9, was "BN_ULONG n0;" before) */\r
- int flags;\r
- };\r
-\r
-/* Used for reciprocal division/mod functions\r
- * It cannot be shared between threads\r
+struct bn_mont_ctx_st {\r
+ int ri; /* number of bits in R */\r
+ BIGNUM RR; /* used to convert to montgomery form */\r
+ BIGNUM N; /* The modulus */\r
+ BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1 (Ni is only\r
+ * stored for bignum algorithm) */\r
+ BN_ULONG n0[2]; /* least significant word(s) of Ni; (type\r
+ * changed with 0.9.9, was "BN_ULONG n0;"\r
+ * before) */\r
+ int flags;\r
+};\r
+\r
+/*\r
+ * Used for reciprocal division/mod functions It cannot be shared between\r
+ * threads\r
*/\r
-struct bn_recp_ctx_st\r
- {\r
- BIGNUM N; /* the divisor */\r
- BIGNUM Nr; /* the reciprocal */\r
- int num_bits;\r
- int shift;\r
- int flags;\r
- };\r
+struct bn_recp_ctx_st {\r
+ BIGNUM N; /* the divisor */\r
+ BIGNUM Nr; /* the reciprocal */\r
+ int num_bits;\r
+ int shift;\r
+ int flags;\r
+};\r
\r
/* Used for slow "generation" functions. */\r
-struct bn_gencb_st\r
- {\r
- unsigned int ver; /* To handle binary (in)compatibility */\r
- void *arg; /* callback-specific data */\r
- union\r
- {\r
- /* if(ver==1) - handles old style callbacks */\r
- void (*cb_1)(int, int, void *);\r
- /* if(ver==2) - new callback style */\r
- int (*cb_2)(int, int, BN_GENCB *);\r
- } cb;\r
- };\r
+struct bn_gencb_st {\r
+ unsigned int ver; /* To handle binary (in)compatibility */\r
+ void *arg; /* callback-specific data */\r
+ union {\r
+ /* if(ver==1) - handles old style callbacks */\r
+ void (*cb_1) (int, int, void *);\r
+ /* if(ver==2) - new callback style */\r
+ int (*cb_2) (int, int, BN_GENCB *);\r
+ } cb;\r
+};\r
/* Wrapper function to make using BN_GENCB easier, */\r
int BN_GENCB_call(BN_GENCB *cb, int a, int b);\r
/* Macro to populate a BN_GENCB structure with an "old"-style callback */\r
-#define BN_GENCB_set_old(gencb, callback, cb_arg) { \\r
- BN_GENCB *tmp_gencb = (gencb); \\r
- tmp_gencb->ver = 1; \\r
- tmp_gencb->arg = (cb_arg); \\r
- tmp_gencb->cb.cb_1 = (callback); }\r
+# define BN_GENCB_set_old(gencb, callback, cb_arg) { \\r
+ BN_GENCB *tmp_gencb = (gencb); \\r
+ tmp_gencb->ver = 1; \\r
+ tmp_gencb->arg = (cb_arg); \\r
+ tmp_gencb->cb.cb_1 = (callback); }\r
/* Macro to populate a BN_GENCB structure with a "new"-style callback */\r
-#define BN_GENCB_set(gencb, callback, cb_arg) { \\r
- BN_GENCB *tmp_gencb = (gencb); \\r
- tmp_gencb->ver = 2; \\r
- tmp_gencb->arg = (cb_arg); \\r
- tmp_gencb->cb.cb_2 = (callback); }\r
-\r
-#define BN_prime_checks 0 /* default: select number of iterations\r
- based on the size of the number */\r
-\r
-/* number of Miller-Rabin iterations for an error rate of less than 2^-80\r
- * for random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook\r
- * of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996];\r
- * original paper: Damgaard, Landrock, Pomerance: Average case error estimates\r
- * for the strong probable prime test. -- Math. Comp. 61 (1993) 177-194) */\r
-#define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \\r
+# define BN_GENCB_set(gencb, callback, cb_arg) { \\r
+ BN_GENCB *tmp_gencb = (gencb); \\r
+ tmp_gencb->ver = 2; \\r
+ tmp_gencb->arg = (cb_arg); \\r
+ tmp_gencb->cb.cb_2 = (callback); }\r
+\r
+# define BN_prime_checks 0 /* default: select number of iterations based\r
+ * on the size of the number */\r
+\r
+/*\r
+ * number of Miller-Rabin iterations for an error rate of less than 2^-80 for\r
+ * random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook of\r
+ * Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996];\r
+ * original paper: Damgaard, Landrock, Pomerance: Average case error\r
+ * estimates for the strong probable prime test. -- Math. Comp. 61 (1993)\r
+ * 177-194)\r
+ */\r
+# define BN_prime_checks_for_size(b) ((b) >= 1300 ? 2 : \\r
(b) >= 850 ? 3 : \\r
(b) >= 650 ? 4 : \\r
(b) >= 550 ? 5 : \\r
(b) >= 150 ? 18 : \\r
/* b >= 100 */ 27)\r
\r
-#define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)\r
+# define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)\r
\r
/* Note that BN_abs_is_word didn't work reliably for w == 0 until 0.9.8 */\r
-#define BN_abs_is_word(a,w) ((((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w))) || \\r
- (((w) == 0) && ((a)->top == 0)))\r
-#define BN_is_zero(a) ((a)->top == 0)\r
-#define BN_is_one(a) (BN_abs_is_word((a),1) && !(a)->neg)\r
-#define BN_is_word(a,w) (BN_abs_is_word((a),(w)) && (!(w) || !(a)->neg))\r
-#define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))\r
-\r
-#define BN_one(a) (BN_set_word((a),1))\r
-#define BN_zero_ex(a) \\r
- do { \\r
- BIGNUM *_tmp_bn = (a); \\r
- _tmp_bn->top = 0; \\r
- _tmp_bn->neg = 0; \\r
- } while(0)\r
-#ifdef OPENSSL_NO_DEPRECATED\r
-#define BN_zero(a) BN_zero_ex(a)\r
-#else\r
-#define BN_zero(a) (BN_set_word((a),0))\r
-#endif\r
+# define BN_abs_is_word(a,w) ((((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w))) || \\r
+ (((w) == 0) && ((a)->top == 0)))\r
+# define BN_is_zero(a) ((a)->top == 0)\r
+# define BN_is_one(a) (BN_abs_is_word((a),1) && !(a)->neg)\r
+# define BN_is_word(a,w) (BN_abs_is_word((a),(w)) && (!(w) || !(a)->neg))\r
+# define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))\r
+\r
+# define BN_one(a) (BN_set_word((a),1))\r
+# define BN_zero_ex(a) \\r
+ do { \\r
+ BIGNUM *_tmp_bn = (a); \\r
+ _tmp_bn->top = 0; \\r
+ _tmp_bn->neg = 0; \\r
+ } while(0)\r
+# ifdef OPENSSL_NO_DEPRECATED\r
+# define BN_zero(a) BN_zero_ex(a)\r
+# else\r
+# define BN_zero(a) (BN_set_word((a),0))\r
+# endif\r
\r
const BIGNUM *BN_value_one(void);\r
-char * BN_options(void);\r
+char *BN_options(void);\r
BN_CTX *BN_CTX_new(void);\r
-#ifndef OPENSSL_NO_DEPRECATED\r
-void BN_CTX_init(BN_CTX *c);\r
-#endif\r
-void BN_CTX_free(BN_CTX *c);\r
-void BN_CTX_start(BN_CTX *ctx);\r
+# ifndef OPENSSL_NO_DEPRECATED\r
+void BN_CTX_init(BN_CTX *c);\r
+# endif\r
+void BN_CTX_free(BN_CTX *c);\r
+void BN_CTX_start(BN_CTX *ctx);\r
BIGNUM *BN_CTX_get(BN_CTX *ctx);\r
-void BN_CTX_end(BN_CTX *ctx);\r
-int BN_rand(BIGNUM *rnd, int bits, int top,int bottom);\r
-int BN_pseudo_rand(BIGNUM *rnd, int bits, int top,int bottom);\r
-int BN_rand_range(BIGNUM *rnd, const BIGNUM *range);\r
-int BN_pseudo_rand_range(BIGNUM *rnd, const BIGNUM *range);\r
-int BN_num_bits(const BIGNUM *a);\r
-int BN_num_bits_word(BN_ULONG);\r
+void BN_CTX_end(BN_CTX *ctx);\r
+int BN_rand(BIGNUM *rnd, int bits, int top, int bottom);\r
+int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom);\r
+int BN_rand_range(BIGNUM *rnd, const BIGNUM *range);\r
+int BN_pseudo_rand_range(BIGNUM *rnd, const BIGNUM *range);\r
+int BN_num_bits(const BIGNUM *a);\r
+int BN_num_bits_word(BN_ULONG);\r
BIGNUM *BN_new(void);\r
-void BN_init(BIGNUM *);\r
-void BN_clear_free(BIGNUM *a);\r
+void BN_init(BIGNUM *);\r
+void BN_clear_free(BIGNUM *a);\r
BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b);\r
-void BN_swap(BIGNUM *a, BIGNUM *b);\r
-BIGNUM *BN_bin2bn(const unsigned char *s,int len,BIGNUM *ret);\r
-int BN_bn2bin(const BIGNUM *a, unsigned char *to);\r
-BIGNUM *BN_mpi2bn(const unsigned char *s,int len,BIGNUM *ret);\r
-int BN_bn2mpi(const BIGNUM *a, unsigned char *to);\r
-int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);\r
-int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);\r
-int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);\r
-int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);\r
-int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);\r
-int BN_sqr(BIGNUM *r, const BIGNUM *a,BN_CTX *ctx);\r
+void BN_swap(BIGNUM *a, BIGNUM *b);\r
+BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret);\r
+int BN_bn2bin(const BIGNUM *a, unsigned char *to);\r
+BIGNUM *BN_mpi2bn(const unsigned char *s, int len, BIGNUM *ret);\r
+int BN_bn2mpi(const BIGNUM *a, unsigned char *to);\r
+int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);\r
+int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);\r
+int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);\r
+int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);\r
+int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);\r
+int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx);\r
/** BN_set_negative sets sign of a BIGNUM\r
* \param b pointer to the BIGNUM object\r
* \param n 0 if the BIGNUM b should be positive and a value != 0 otherwise\r
*/\r
-void BN_set_negative(BIGNUM *b, int n);\r
+void BN_set_negative(BIGNUM *b, int n);\r
/** BN_is_negative returns 1 if the BIGNUM is negative\r
* \param a pointer to the BIGNUM object\r
* \return 1 if a < 0 and 0 otherwise\r
*/\r
-#define BN_is_negative(a) ((a)->neg != 0)\r
-\r
-int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,\r
- BN_CTX *ctx);\r
-#define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))\r
-int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx);\r
-int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx);\r
-int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m);\r
-int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx);\r
-int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m);\r
-int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
- const BIGNUM *m, BN_CTX *ctx);\r
-int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);\r
-int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);\r
-int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m);\r
-int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m, BN_CTX *ctx);\r
-int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m);\r
+# define BN_is_negative(a) ((a)->neg != 0)\r
+\r
+int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,\r
+ BN_CTX *ctx);\r
+# define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))\r
+int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx);\r
+int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,\r
+ BN_CTX *ctx);\r
+int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
+ const BIGNUM *m);\r
+int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,\r
+ BN_CTX *ctx);\r
+int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
+ const BIGNUM *m);\r
+int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,\r
+ BN_CTX *ctx);\r
+int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);\r
+int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);\r
+int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m);\r
+int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m,\r
+ BN_CTX *ctx);\r
+int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m);\r
\r
BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);\r
BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);\r
-int BN_mul_word(BIGNUM *a, BN_ULONG w);\r
-int BN_add_word(BIGNUM *a, BN_ULONG w);\r
-int BN_sub_word(BIGNUM *a, BN_ULONG w);\r
-int BN_set_word(BIGNUM *a, BN_ULONG w);\r
+int BN_mul_word(BIGNUM *a, BN_ULONG w);\r
+int BN_add_word(BIGNUM *a, BN_ULONG w);\r
+int BN_sub_word(BIGNUM *a, BN_ULONG w);\r
+int BN_set_word(BIGNUM *a, BN_ULONG w);\r
BN_ULONG BN_get_word(const BIGNUM *a);\r
\r
-int BN_cmp(const BIGNUM *a, const BIGNUM *b);\r
-void BN_free(BIGNUM *a);\r
-int BN_is_bit_set(const BIGNUM *a, int n);\r
-int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);\r
-int BN_lshift1(BIGNUM *r, const BIGNUM *a);\r
-int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,BN_CTX *ctx);\r
-\r
-int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\r
- const BIGNUM *m,BN_CTX *ctx);\r
-int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\r
- const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);\r
+int BN_cmp(const BIGNUM *a, const BIGNUM *b);\r
+void BN_free(BIGNUM *a);\r
+int BN_is_bit_set(const BIGNUM *a, int n);\r
+int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);\r
+int BN_lshift1(BIGNUM *r, const BIGNUM *a);\r
+int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);\r
+\r
+int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\r
+ const BIGNUM *m, BN_CTX *ctx);\r
+int BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\r
+ const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);\r
int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,\r
- const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont);\r
-int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,\r
- const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);\r
-int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1,\r
- const BIGNUM *a2, const BIGNUM *p2,const BIGNUM *m,\r
- BN_CTX *ctx,BN_MONT_CTX *m_ctx);\r
-int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\r
- const BIGNUM *m,BN_CTX *ctx);\r
-\r
-int BN_mask_bits(BIGNUM *a,int n);\r
-#ifndef OPENSSL_NO_FP_API\r
-int BN_print_fp(FILE *fp, const BIGNUM *a);\r
-#endif\r
-#ifdef HEADER_BIO_H\r
-int BN_print(BIO *fp, const BIGNUM *a);\r
-#else\r
-int BN_print(void *fp, const BIGNUM *a);\r
-#endif\r
-int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx);\r
-int BN_rshift(BIGNUM *r, const BIGNUM *a, int n);\r
-int BN_rshift1(BIGNUM *r, const BIGNUM *a);\r
-void BN_clear(BIGNUM *a);\r
+ const BIGNUM *m, BN_CTX *ctx,\r
+ BN_MONT_CTX *in_mont);\r
+int BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,\r
+ const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);\r
+int BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1,\r
+ const BIGNUM *a2, const BIGNUM *p2, const BIGNUM *m,\r
+ BN_CTX *ctx, BN_MONT_CTX *m_ctx);\r
+int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\r
+ const BIGNUM *m, BN_CTX *ctx);\r
+\r
+int BN_mask_bits(BIGNUM *a, int n);\r
+# ifndef OPENSSL_NO_FP_API\r
+int BN_print_fp(FILE *fp, const BIGNUM *a);\r
+# endif\r
+# ifdef HEADER_BIO_H\r
+int BN_print(BIO *fp, const BIGNUM *a);\r
+# else\r
+int BN_print(void *fp, const BIGNUM *a);\r
+# endif\r
+int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx);\r
+int BN_rshift(BIGNUM *r, const BIGNUM *a, int n);\r
+int BN_rshift1(BIGNUM *r, const BIGNUM *a);\r
+void BN_clear(BIGNUM *a);\r
BIGNUM *BN_dup(const BIGNUM *a);\r
-int BN_ucmp(const BIGNUM *a, const BIGNUM *b);\r
-int BN_set_bit(BIGNUM *a, int n);\r
-int BN_clear_bit(BIGNUM *a, int n);\r
-char * BN_bn2hex(const BIGNUM *a);\r
-char * BN_bn2dec(const BIGNUM *a);\r
-int BN_hex2bn(BIGNUM **a, const char *str);\r
-int BN_dec2bn(BIGNUM **a, const char *str);\r
-int BN_asc2bn(BIGNUM **a, const char *str);\r
-int BN_gcd(BIGNUM *r,const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx);\r
-int BN_kronecker(const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx); /* returns -2 for error */\r
+int BN_ucmp(const BIGNUM *a, const BIGNUM *b);\r
+int BN_set_bit(BIGNUM *a, int n);\r
+int BN_clear_bit(BIGNUM *a, int n);\r
+char *BN_bn2hex(const BIGNUM *a);\r
+char *BN_bn2dec(const BIGNUM *a);\r
+int BN_hex2bn(BIGNUM **a, const char *str);\r
+int BN_dec2bn(BIGNUM **a, const char *str);\r
+int BN_asc2bn(BIGNUM **a, const char *str);\r
+int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);\r
+int BN_kronecker(const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); /* returns\r
+ * -2 for\r
+ * error */\r
BIGNUM *BN_mod_inverse(BIGNUM *ret,\r
- const BIGNUM *a, const BIGNUM *n,BN_CTX *ctx);\r
+ const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);\r
BIGNUM *BN_mod_sqrt(BIGNUM *ret,\r
- const BIGNUM *a, const BIGNUM *n,BN_CTX *ctx);\r
+ const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);\r
\r
-void BN_consttime_swap(BN_ULONG swap, BIGNUM *a, BIGNUM *b, int nwords);\r
+void BN_consttime_swap(BN_ULONG swap, BIGNUM *a, BIGNUM *b, int nwords);\r
\r
/* Deprecated versions */\r
-#ifndef OPENSSL_NO_DEPRECATED\r
-BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int safe,\r
- const BIGNUM *add, const BIGNUM *rem,\r
- void (*callback)(int,int,void *),void *cb_arg);\r
-int BN_is_prime(const BIGNUM *p,int nchecks,\r
- void (*callback)(int,int,void *),\r
- BN_CTX *ctx,void *cb_arg);\r
-int BN_is_prime_fasttest(const BIGNUM *p,int nchecks,\r
- void (*callback)(int,int,void *),BN_CTX *ctx,void *cb_arg,\r
- int do_trial_division);\r
-#endif /* !defined(OPENSSL_NO_DEPRECATED) */\r
+# ifndef OPENSSL_NO_DEPRECATED\r
+BIGNUM *BN_generate_prime(BIGNUM *ret, int bits, int safe,\r
+ const BIGNUM *add, const BIGNUM *rem,\r
+ void (*callback) (int, int, void *), void *cb_arg);\r
+int BN_is_prime(const BIGNUM *p, int nchecks,\r
+ void (*callback) (int, int, void *),\r
+ BN_CTX *ctx, void *cb_arg);\r
+int BN_is_prime_fasttest(const BIGNUM *p, int nchecks,\r
+ void (*callback) (int, int, void *), BN_CTX *ctx,\r
+ void *cb_arg, int do_trial_division);\r
+# endif /* !defined(OPENSSL_NO_DEPRECATED) */\r
\r
/* Newer versions */\r
-int BN_generate_prime_ex(BIGNUM *ret,int bits,int safe, const BIGNUM *add,\r
- const BIGNUM *rem, BN_GENCB *cb);\r
-int BN_is_prime_ex(const BIGNUM *p,int nchecks, BN_CTX *ctx, BN_GENCB *cb);\r
-int BN_is_prime_fasttest_ex(const BIGNUM *p,int nchecks, BN_CTX *ctx,\r
- int do_trial_division, BN_GENCB *cb);\r
+int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe, const BIGNUM *add,\r
+ const BIGNUM *rem, BN_GENCB *cb);\r
+int BN_is_prime_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx, BN_GENCB *cb);\r
+int BN_is_prime_fasttest_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx,\r
+ int do_trial_division, BN_GENCB *cb);\r
\r
int BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx);\r
\r
int BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,\r
- const BIGNUM *Xp, const BIGNUM *Xp1, const BIGNUM *Xp2,\r
- const BIGNUM *e, BN_CTX *ctx, BN_GENCB *cb);\r
-int BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,\r
- BIGNUM *Xp1, BIGNUM *Xp2,\r
- const BIGNUM *Xp,\r
- const BIGNUM *e, BN_CTX *ctx,\r
- BN_GENCB *cb);\r
-\r
-BN_MONT_CTX *BN_MONT_CTX_new(void );\r
+ const BIGNUM *Xp, const BIGNUM *Xp1,\r
+ const BIGNUM *Xp2, const BIGNUM *e, BN_CTX *ctx,\r
+ BN_GENCB *cb);\r
+int BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2, BIGNUM *Xp1,\r
+ BIGNUM *Xp2, const BIGNUM *Xp, const BIGNUM *e,\r
+ BN_CTX *ctx, BN_GENCB *cb);\r
+\r
+BN_MONT_CTX *BN_MONT_CTX_new(void);\r
void BN_MONT_CTX_init(BN_MONT_CTX *ctx);\r
-int BN_mod_mul_montgomery(BIGNUM *r,const BIGNUM *a,const BIGNUM *b,\r
- BN_MONT_CTX *mont, BN_CTX *ctx);\r
-#define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\\r
- (r),(a),&((mont)->RR),(mont),(ctx))\r
-int BN_from_montgomery(BIGNUM *r,const BIGNUM *a,\r
- BN_MONT_CTX *mont, BN_CTX *ctx);\r
+int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
+ BN_MONT_CTX *mont, BN_CTX *ctx);\r
+# define BN_to_montgomery(r,a,mont,ctx) BN_mod_mul_montgomery(\\r
+ (r),(a),&((mont)->RR),(mont),(ctx))\r
+int BN_from_montgomery(BIGNUM *r, const BIGNUM *a,\r
+ BN_MONT_CTX *mont, BN_CTX *ctx);\r
void BN_MONT_CTX_free(BN_MONT_CTX *mont);\r
-int BN_MONT_CTX_set(BN_MONT_CTX *mont,const BIGNUM *mod,BN_CTX *ctx);\r
-BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,BN_MONT_CTX *from);\r
+int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx);\r
+BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, BN_MONT_CTX *from);\r
BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, int lock,\r
- const BIGNUM *mod, BN_CTX *ctx);\r
+ const BIGNUM *mod, BN_CTX *ctx);\r
\r
/* BN_BLINDING flags */\r
-#define BN_BLINDING_NO_UPDATE 0x00000001\r
-#define BN_BLINDING_NO_RECREATE 0x00000002\r
+# define BN_BLINDING_NO_UPDATE 0x00000001\r
+# define BN_BLINDING_NO_RECREATE 0x00000002\r
\r
BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod);\r
void BN_BLINDING_free(BN_BLINDING *b);\r
-int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx);\r
+int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx);\r
int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);\r
int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);\r
int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *);\r
-int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b, BN_CTX *);\r
-#ifndef OPENSSL_NO_DEPRECATED\r
+int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b,\r
+ BN_CTX *);\r
+# ifndef OPENSSL_NO_DEPRECATED\r
unsigned long BN_BLINDING_get_thread_id(const BN_BLINDING *);\r
void BN_BLINDING_set_thread_id(BN_BLINDING *, unsigned long);\r
-#endif\r
+# endif\r
CRYPTO_THREADID *BN_BLINDING_thread_id(BN_BLINDING *);\r
unsigned long BN_BLINDING_get_flags(const BN_BLINDING *);\r
void BN_BLINDING_set_flags(BN_BLINDING *, unsigned long);\r
BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b,\r
- const BIGNUM *e, BIGNUM *m, BN_CTX *ctx,\r
- int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\r
- const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx),\r
- BN_MONT_CTX *m_ctx);\r
-\r
-#ifndef OPENSSL_NO_DEPRECATED\r
-void BN_set_params(int mul,int high,int low,int mont);\r
-int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */\r
-#endif\r
+ const BIGNUM *e, BIGNUM *m, BN_CTX *ctx,\r
+ int (*bn_mod_exp) (BIGNUM *r,\r
+ const BIGNUM *a,\r
+ const BIGNUM *p,\r
+ const BIGNUM *m,\r
+ BN_CTX *ctx,\r
+ BN_MONT_CTX *m_ctx),\r
+ BN_MONT_CTX *m_ctx);\r
+\r
+# ifndef OPENSSL_NO_DEPRECATED\r
+void BN_set_params(int mul, int high, int low, int mont);\r
+int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */\r
+# endif\r
\r
-void BN_RECP_CTX_init(BN_RECP_CTX *recp);\r
+void BN_RECP_CTX_init(BN_RECP_CTX *recp);\r
BN_RECP_CTX *BN_RECP_CTX_new(void);\r
-void BN_RECP_CTX_free(BN_RECP_CTX *recp);\r
-int BN_RECP_CTX_set(BN_RECP_CTX *recp,const BIGNUM *rdiv,BN_CTX *ctx);\r
-int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,\r
- BN_RECP_CTX *recp,BN_CTX *ctx);\r
-int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\r
- const BIGNUM *m, BN_CTX *ctx);\r
-int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,\r
- BN_RECP_CTX *recp, BN_CTX *ctx);\r
-\r
-#ifndef OPENSSL_NO_EC2M\r
-\r
-/* Functions for arithmetic over binary polynomials represented by BIGNUMs.\r
- *\r
+void BN_RECP_CTX_free(BN_RECP_CTX *recp);\r
+int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *rdiv, BN_CTX *ctx);\r
+int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,\r
+ BN_RECP_CTX *recp, BN_CTX *ctx);\r
+int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\r
+ const BIGNUM *m, BN_CTX *ctx);\r
+int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,\r
+ BN_RECP_CTX *recp, BN_CTX *ctx);\r
+\r
+# ifndef OPENSSL_NO_EC2M\r
+\r
+/*\r
+ * Functions for arithmetic over binary polynomials represented by BIGNUMs.\r
* The BIGNUM::neg property of BIGNUMs representing binary polynomials is\r
- * ignored.\r
- *\r
- * Note that input arguments are not const so that their bit arrays can\r
- * be expanded to the appropriate size if needed.\r
+ * ignored. Note that input arguments are not const so that their bit arrays\r
+ * can be expanded to the appropriate size if needed.\r
*/\r
\r
-int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); /*r = a + b*/\r
-#define BN_GF2m_sub(r, a, b) BN_GF2m_add(r, a, b)\r
-int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p); /*r=a mod p*/\r
-int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
- const BIGNUM *p, BN_CTX *ctx); /* r = (a * b) mod p */\r
-int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\r
- BN_CTX *ctx); /* r = (a * a) mod p */\r
-int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *b, const BIGNUM *p,\r
- BN_CTX *ctx); /* r = (1 / b) mod p */\r
-int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
- const BIGNUM *p, BN_CTX *ctx); /* r = (a / b) mod p */\r
-int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
- const BIGNUM *p, BN_CTX *ctx); /* r = (a ^ b) mod p */\r
-int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\r
- BN_CTX *ctx); /* r = sqrt(a) mod p */\r
-int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\r
- BN_CTX *ctx); /* r^2 + r = a mod p */\r
-#define BN_GF2m_cmp(a, b) BN_ucmp((a), (b))\r
-/* Some functions allow for representation of the irreducible polynomials\r
+/*\r
+ * r = a + b\r
+ */\r
+int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);\r
+# define BN_GF2m_sub(r, a, b) BN_GF2m_add(r, a, b)\r
+/*\r
+ * r=a mod p\r
+ */\r
+int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p);\r
+/* r = (a * b) mod p */\r
+int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
+ const BIGNUM *p, BN_CTX *ctx);\r
+/* r = (a * a) mod p */\r
+int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);\r
+/* r = (1 / b) mod p */\r
+int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *b, const BIGNUM *p, BN_CTX *ctx);\r
+/* r = (a / b) mod p */\r
+int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
+ const BIGNUM *p, BN_CTX *ctx);\r
+/* r = (a ^ b) mod p */\r
+int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
+ const BIGNUM *p, BN_CTX *ctx);\r
+/* r = sqrt(a) mod p */\r
+int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\r
+ BN_CTX *ctx);\r
+/* r^2 + r = a mod p */\r
+int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\r
+ BN_CTX *ctx);\r
+# define BN_GF2m_cmp(a, b) BN_ucmp((a), (b))\r
+/*-\r
+ * Some functions allow for representation of the irreducible polynomials\r
* as an unsigned int[], say p. The irreducible f(t) is then of the form:\r
* t^p[0] + t^p[1] + ... + t^p[k]\r
* where m = p[0] > p[1] > ... > p[k] = 0.\r
*/\r
-int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[]);\r
- /* r = a mod p */\r
-int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
- const int p[], BN_CTX *ctx); /* r = (a * b) mod p */\r
-int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],\r
- BN_CTX *ctx); /* r = (a * a) mod p */\r
-int BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *b, const int p[],\r
- BN_CTX *ctx); /* r = (1 / b) mod p */\r
-int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
- const int p[], BN_CTX *ctx); /* r = (a / b) mod p */\r
-int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
- const int p[], BN_CTX *ctx); /* r = (a ^ b) mod p */\r
-int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a,\r
- const int p[], BN_CTX *ctx); /* r = sqrt(a) mod p */\r
-int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a,\r
- const int p[], BN_CTX *ctx); /* r^2 + r = a mod p */\r
-int BN_GF2m_poly2arr(const BIGNUM *a, int p[], int max);\r
-int BN_GF2m_arr2poly(const int p[], BIGNUM *a);\r
+/* r = a mod p */\r
+int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[]);\r
+/* r = (a * b) mod p */\r
+int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
+ const int p[], BN_CTX *ctx);\r
+/* r = (a * a) mod p */\r
+int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],\r
+ BN_CTX *ctx);\r
+/* r = (1 / b) mod p */\r
+int BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *b, const int p[],\r
+ BN_CTX *ctx);\r
+/* r = (a / b) mod p */\r
+int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
+ const int p[], BN_CTX *ctx);\r
+/* r = (a ^ b) mod p */\r
+int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\r
+ const int p[], BN_CTX *ctx);\r
+/* r = sqrt(a) mod p */\r
+int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a,\r
+ const int p[], BN_CTX *ctx);\r
+/* r^2 + r = a mod p */\r
+int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a,\r
+ const int p[], BN_CTX *ctx);\r
+int BN_GF2m_poly2arr(const BIGNUM *a, int p[], int max);\r
+int BN_GF2m_arr2poly(const int p[], BIGNUM *a);\r
\r
-#endif\r
+# endif\r
\r
-/* faster mod functions for the 'NIST primes'\r
- * 0 <= a < p^2 */\r
+/*\r
+ * faster mod functions for the 'NIST primes' 0 <= a < p^2\r
+ */\r
int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);\r
int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);\r
int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);\r
\r
/* library internal functions */\r
\r
-#define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\\r
- (a):bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2))\r
-#define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words)))\r
+# define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\\r
+ (a):bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2))\r
+# define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words)))\r
BIGNUM *bn_expand2(BIGNUM *a, int words);\r
-#ifndef OPENSSL_NO_DEPRECATED\r
+# ifndef OPENSSL_NO_DEPRECATED\r
BIGNUM *bn_dup_expand(const BIGNUM *a, int words); /* unused */\r
-#endif\r
+# endif\r
\r
-/* Bignum consistency macros\r
+/*-\r
+ * Bignum consistency macros\r
* There is one "API" macro, bn_fix_top(), for stripping leading zeroes from\r
* bignum data after direct manipulations on the data. There is also an\r
* "internal" macro, bn_check_top(), for verifying that there are no leading\r
* coverage for openssl's own code.\r
*/\r
\r
-#ifdef BN_DEBUG\r
+# ifdef BN_DEBUG\r
\r
/* We only need assert() when debugging */\r
-#include <assert.h>\r
\r
-#ifdef BN_DEBUG_RAND\r
+# ifdef BN_DEBUG_RAND\r
/* To avoid "make update" cvs wars due to BN_DEBUG, use some tricks */\r
-#ifndef RAND_pseudo_bytes\r
-int RAND_pseudo_bytes(unsigned char *buf,int num);\r
-#define BN_DEBUG_TRIX\r
-#endif\r
-#define bn_pollute(a) \\r
- do { \\r
- const BIGNUM *_bnum1 = (a); \\r
- if(_bnum1->top < _bnum1->dmax) { \\r
- unsigned char _tmp_char; \\r
- /* We cast away const without the compiler knowing, any \\r
- * *genuinely* constant variables that aren't mutable \\r
- * wouldn't be constructed with top!=dmax. */ \\r
- BN_ULONG *_not_const; \\r
- memcpy(&_not_const, &_bnum1->d, sizeof(BN_ULONG*)); \\r
- RAND_pseudo_bytes(&_tmp_char, 1); \\r
- memset((unsigned char *)(_not_const + _bnum1->top), _tmp_char, \\r
- (_bnum1->dmax - _bnum1->top) * sizeof(BN_ULONG)); \\r
- } \\r
- } while(0)\r
-#ifdef BN_DEBUG_TRIX\r
-#undef RAND_pseudo_bytes\r
-#endif\r
-#else\r
-#define bn_pollute(a)\r
-#endif\r
-#define bn_check_top(a) \\r
- do { \\r
- const BIGNUM *_bnum2 = (a); \\r
- if (_bnum2 != NULL) { \\r
- assert((_bnum2->top == 0) || \\r
- (_bnum2->d[_bnum2->top - 1] != 0)); \\r
- bn_pollute(_bnum2); \\r
- } \\r
- } while(0)\r
-\r
-#define bn_fix_top(a) bn_check_top(a)\r
-\r
-#define bn_check_size(bn, bits) bn_wcheck_size(bn, ((bits+BN_BITS2-1))/BN_BITS2)\r
-#define bn_wcheck_size(bn, words) \\r
- do { \\r
- const BIGNUM *_bnum2 = (bn); \\r
- assert((words) <= (_bnum2)->dmax && (words) >= (_bnum2)->top); \\r
- /* avoid unused variable warning with NDEBUG */ \\r
- (void)(_bnum2); \\r
- } while(0)\r
-\r
-#else /* !BN_DEBUG */\r
-\r
-#define bn_pollute(a)\r
-#define bn_check_top(a)\r
-#define bn_fix_top(a) bn_correct_top(a)\r
-#define bn_check_size(bn, bits)\r
-#define bn_wcheck_size(bn, words)\r
+# ifndef RAND_pseudo_bytes\r
+int RAND_pseudo_bytes(unsigned char *buf, int num);\r
+# define BN_DEBUG_TRIX\r
+# endif\r
+# define bn_pollute(a) \\r
+ do { \\r
+ const BIGNUM *_bnum1 = (a); \\r
+ if(_bnum1->top < _bnum1->dmax) { \\r
+ unsigned char _tmp_char; \\r
+ /* We cast away const without the compiler knowing, any \\r
+ * *genuinely* constant variables that aren't mutable \\r
+ * wouldn't be constructed with top!=dmax. */ \\r
+ BN_ULONG *_not_const; \\r
+ memcpy(&_not_const, &_bnum1->d, sizeof(BN_ULONG*)); \\r
+ RAND_pseudo_bytes(&_tmp_char, 1); \\r
+ memset((unsigned char *)(_not_const + _bnum1->top), _tmp_char, \\r
+ (_bnum1->dmax - _bnum1->top) * sizeof(BN_ULONG)); \\r
+ } \\r
+ } while(0)\r
+# ifdef BN_DEBUG_TRIX\r
+# undef RAND_pseudo_bytes\r
+# endif\r
+# else\r
+# define bn_pollute(a)\r
+# endif\r
+# define bn_check_top(a) \\r
+ do { \\r
+ const BIGNUM *_bnum2 = (a); \\r
+ if (_bnum2 != NULL) { \\r
+ assert((_bnum2->top == 0) || \\r
+ (_bnum2->d[_bnum2->top - 1] != 0)); \\r
+ bn_pollute(_bnum2); \\r
+ } \\r
+ } while(0)\r
+\r
+# define bn_fix_top(a) bn_check_top(a)\r
+\r
+# define bn_check_size(bn, bits) bn_wcheck_size(bn, ((bits+BN_BITS2-1))/BN_BITS2)\r
+# define bn_wcheck_size(bn, words) \\r
+ do { \\r
+ const BIGNUM *_bnum2 = (bn); \\r
+ assert((words) <= (_bnum2)->dmax && (words) >= (_bnum2)->top); \\r
+ /* avoid unused variable warning with NDEBUG */ \\r
+ (void)(_bnum2); \\r
+ } while(0)\r
+\r
+# else /* !BN_DEBUG */\r
+\r
+# define bn_pollute(a)\r
+# define bn_check_top(a)\r
+# define bn_fix_top(a) bn_correct_top(a)\r
+# define bn_check_size(bn, bits)\r
+# define bn_wcheck_size(bn, words)\r
\r
-#endif\r
+# endif\r
\r
-#define bn_correct_top(a) \\r
+# define bn_correct_top(a) \\r
{ \\r
BN_ULONG *ftl; \\r
- int tmp_top = (a)->top; \\r
- if (tmp_top > 0) \\r
- { \\r
- for (ftl= &((a)->d[tmp_top-1]); tmp_top > 0; tmp_top--) \\r
- if (*(ftl--)) break; \\r
- (a)->top = tmp_top; \\r
- } \\r
- bn_pollute(a); \\r
- }\r
-\r
-BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);\r
+ int tmp_top = (a)->top; \\r
+ if (tmp_top > 0) \\r
+ { \\r
+ for (ftl= &((a)->d[tmp_top-1]); tmp_top > 0; tmp_top--) \\r
+ if (*(ftl--)) break; \\r
+ (a)->top = tmp_top; \\r
+ } \\r
+ bn_pollute(a); \\r
+ }\r
+\r
+BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num,\r
+ BN_ULONG w);\r
BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);\r
-void bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num);\r
+void bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num);\r
BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);\r
-BN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num);\r
-BN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num);\r
+BN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,\r
+ int num);\r
+BN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,\r
+ int num);\r
\r
/* Primes from RFC 2409 */\r
BIGNUM *get_rfc2409_prime_768(BIGNUM *bn);\r
BIGNUM *get_rfc3526_prime_6144(BIGNUM *bn);\r
BIGNUM *get_rfc3526_prime_8192(BIGNUM *bn);\r
\r
-int BN_bntest_rand(BIGNUM *rnd, int bits, int top,int bottom);\r
+int BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom);\r
\r
/* BEGIN ERROR CODES */\r
-/* The following lines are auto generated by the script mkerr.pl. Any changes\r
+/*\r
+ * The following lines are auto generated by the script mkerr.pl. Any changes\r
* made after this point may be overwritten when the script is next run.\r
*/\r
void ERR_load_BN_strings(void);\r
/* Error codes for the BN functions. */\r
\r
/* Function codes. */\r
-#define BN_F_BNRAND 127\r
-#define BN_F_BN_BLINDING_CONVERT_EX 100\r
-#define BN_F_BN_BLINDING_CREATE_PARAM 128\r
-#define BN_F_BN_BLINDING_INVERT_EX 101\r
-#define BN_F_BN_BLINDING_NEW 102\r
-#define BN_F_BN_BLINDING_UPDATE 103\r
-#define BN_F_BN_BN2DEC 104\r
-#define BN_F_BN_BN2HEX 105\r
-#define BN_F_BN_CTX_GET 116\r
-#define BN_F_BN_CTX_NEW 106\r
-#define BN_F_BN_CTX_START 129\r
-#define BN_F_BN_DIV 107\r
-#define BN_F_BN_DIV_NO_BRANCH 138\r
-#define BN_F_BN_DIV_RECP 130\r
-#define BN_F_BN_EXP 123\r
-#define BN_F_BN_EXPAND2 108\r
-#define BN_F_BN_EXPAND_INTERNAL 120\r
-#define BN_F_BN_GF2M_MOD 131\r
-#define BN_F_BN_GF2M_MOD_EXP 132\r
-#define BN_F_BN_GF2M_MOD_MUL 133\r
-#define BN_F_BN_GF2M_MOD_SOLVE_QUAD 134\r
-#define BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR 135\r
-#define BN_F_BN_GF2M_MOD_SQR 136\r
-#define BN_F_BN_GF2M_MOD_SQRT 137\r
-#define BN_F_BN_MOD_EXP2_MONT 118\r
-#define BN_F_BN_MOD_EXP_MONT 109\r
-#define BN_F_BN_MOD_EXP_MONT_CONSTTIME 124\r
-#define BN_F_BN_MOD_EXP_MONT_WORD 117\r
-#define BN_F_BN_MOD_EXP_RECP 125\r
-#define BN_F_BN_MOD_EXP_SIMPLE 126\r
-#define BN_F_BN_MOD_INVERSE 110\r
-#define BN_F_BN_MOD_INVERSE_NO_BRANCH 139\r
-#define BN_F_BN_MOD_LSHIFT_QUICK 119\r
-#define BN_F_BN_MOD_MUL_RECIPROCAL 111\r
-#define BN_F_BN_MOD_SQRT 121\r
-#define BN_F_BN_MPI2BN 112\r
-#define BN_F_BN_NEW 113\r
-#define BN_F_BN_RAND 114\r
-#define BN_F_BN_RAND_RANGE 122\r
-#define BN_F_BN_USUB 115\r
+# define BN_F_BNRAND 127\r
+# define BN_F_BN_BLINDING_CONVERT_EX 100\r
+# define BN_F_BN_BLINDING_CREATE_PARAM 128\r
+# define BN_F_BN_BLINDING_INVERT_EX 101\r
+# define BN_F_BN_BLINDING_NEW 102\r
+# define BN_F_BN_BLINDING_UPDATE 103\r
+# define BN_F_BN_BN2DEC 104\r
+# define BN_F_BN_BN2HEX 105\r
+# define BN_F_BN_CTX_GET 116\r
+# define BN_F_BN_CTX_NEW 106\r
+# define BN_F_BN_CTX_START 129\r
+# define BN_F_BN_DIV 107\r
+# define BN_F_BN_DIV_NO_BRANCH 138\r
+# define BN_F_BN_DIV_RECP 130\r
+# define BN_F_BN_EXP 123\r
+# define BN_F_BN_EXPAND2 108\r
+# define BN_F_BN_EXPAND_INTERNAL 120\r
+# define BN_F_BN_GF2M_MOD 131\r
+# define BN_F_BN_GF2M_MOD_EXP 132\r
+# define BN_F_BN_GF2M_MOD_MUL 133\r
+# define BN_F_BN_GF2M_MOD_SOLVE_QUAD 134\r
+# define BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR 135\r
+# define BN_F_BN_GF2M_MOD_SQR 136\r
+# define BN_F_BN_GF2M_MOD_SQRT 137\r
+# define BN_F_BN_MOD_EXP2_MONT 118\r
+# define BN_F_BN_MOD_EXP_MONT 109\r
+# define BN_F_BN_MOD_EXP_MONT_CONSTTIME 124\r
+# define BN_F_BN_MOD_EXP_MONT_WORD 117\r
+# define BN_F_BN_MOD_EXP_RECP 125\r
+# define BN_F_BN_MOD_EXP_SIMPLE 126\r
+# define BN_F_BN_MOD_INVERSE 110\r
+# define BN_F_BN_MOD_INVERSE_NO_BRANCH 139\r
+# define BN_F_BN_MOD_LSHIFT_QUICK 119\r
+# define BN_F_BN_MOD_MUL_RECIPROCAL 111\r
+# define BN_F_BN_MOD_SQRT 121\r
+# define BN_F_BN_MPI2BN 112\r
+# define BN_F_BN_NEW 113\r
+# define BN_F_BN_RAND 114\r
+# define BN_F_BN_RAND_RANGE 122\r
+# define BN_F_BN_USUB 115\r
\r
/* Reason codes. */\r
-#define BN_R_ARG2_LT_ARG3 100\r
-#define BN_R_BAD_RECIPROCAL 101\r
-#define BN_R_BIGNUM_TOO_LONG 114\r
-#define BN_R_CALLED_WITH_EVEN_MODULUS 102\r
-#define BN_R_DIV_BY_ZERO 103\r
-#define BN_R_ENCODING_ERROR 104\r
-#define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105\r
-#define BN_R_INPUT_NOT_REDUCED 110\r
-#define BN_R_INVALID_LENGTH 106\r
-#define BN_R_INVALID_RANGE 115\r
-#define BN_R_NOT_A_SQUARE 111\r
-#define BN_R_NOT_INITIALIZED 107\r
-#define BN_R_NO_INVERSE 108\r
-#define BN_R_NO_SOLUTION 116\r
-#define BN_R_P_IS_NOT_PRIME 112\r
-#define BN_R_TOO_MANY_ITERATIONS 113\r
-#define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109\r
+# define BN_R_ARG2_LT_ARG3 100\r
+# define BN_R_BAD_RECIPROCAL 101\r
+# define BN_R_BIGNUM_TOO_LONG 114\r
+# define BN_R_CALLED_WITH_EVEN_MODULUS 102\r
+# define BN_R_DIV_BY_ZERO 103\r
+# define BN_R_ENCODING_ERROR 104\r
+# define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105\r
+# define BN_R_INPUT_NOT_REDUCED 110\r
+# define BN_R_INVALID_LENGTH 106\r
+# define BN_R_INVALID_RANGE 115\r
+# define BN_R_NOT_A_SQUARE 111\r
+# define BN_R_NOT_INITIALIZED 107\r
+# define BN_R_NO_INVERSE 108\r
+# define BN_R_NO_SOLUTION 116\r
+# define BN_R_P_IS_NOT_PRIME 112\r
+# define BN_R_TOO_MANY_ITERATIONS 113\r
+# define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109\r
\r
#ifdef __cplusplus\r
}\r
OSDN Git Service
