[ { "path": "README.md", "content": "# RfTPM: A Firmware TPM Implementation for RISC-V\n\nRfTPM is the first firmware TPM (fTPM) architecture designed for RISC-V platforms. It provides secure TPM functionalities, including isolated execution, secure storage, secure boot, and remote attestation, without requiring additional hardware costs. \n\n## Features\n- **Firmware TPM for RISC-V**: Implements TPM functionalities without dedicated hardware.\n- **Isolated Execution**: Runs as an OpenSBI extension in machine mode (M-mode) on RISC-V.\n- **Secure Storage**: Ensures the integrity and confidentiality of TPM persistent data.\n- **Efficient Communication**: Securely interacts with higher-level TPM applications.\n\n## Build and Installation\n### Prerequisites\nEnsure that your environment includes:\n- A RISC-V toolchain\n- QEMU or a real RISC-V platform for testing\n\n### Building and Installing\n#### 1. Set Up Environment Variables\nBefore compiling, define the necessary paths:\n```sh\nexport BUILD_DIR=/path/to/build-linux-stable-host\nexport FTPM_DIR=/path/to/rfTPM\nexport RISCV_TOOLCHAIN=/opt/riscv/bin\n```\n#### 2. Compile libcryptomini\n```sh\nmake\n```\n#### 3. Compile ftpm-opensbi\n```sh\nmake CROSS_COMPILE=$RISCV_TOOLCHAIN/riscv64-unknown-elf- \\\n PLATFORM=generic \\\n FW_PAYLOAD_PATH=$BUILD_DIR/arch/riscv/boot/Image \\\n FW_PAYLOAD=y \\\n PLATFORM_RISCV_XLEN=64 \\\n PLATFORM_RISCV_ISA=rv64imafdc \\\n PLATFORM_RISCV_ABI=lp64d\n```\n#### 4. Compile ftpm-driver\n```sh\nmake -C $BUILD_DIR \\\n O=$BUILD_DIR \\\n ARCH=riscv \\\n CROSS_COMPILE=$RISCV_TOOLCHAIN/riscv64-unknown-linux-gnu- \\\n M=$FTPM_DIR/ftpm-driver modules\n```\n#### 5. Compile ibmtss-ftpm\n```sh\nmake -f makefiletpm20\n```\n\n\n" }, { "path": "cryptomini/.vscode/settings.json", "content": "{\n \"files.associations\": {\n \"intercept.h\": \"c\"\n }\n}" }, { "path": "cryptomini/README.md", "content": "# CRYPTOMINI\n\npruned libcrypto for vTPM on RISC-V\n" }, { "path": "cryptomini/aes/aes_cbc.c", "content": "/*\n * Copyright 2002-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the Apache License 2.0 (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * AES low level APIs are deprecated for public use, but still ok for internal\n * use where we're using them to implement the higher level EVP interface, as is\n * the case here.\n */\n// #include \"internal/deprecated.h\"\n\n#include \n#include \n#include \n\n\nvoid CRYPTO_cbc128_encrypt(const unsigned char *in, unsigned char *out,\n size_t len, const void *key,\n unsigned char ivec[16], block128_f block)\n{\n size_t n;\n const unsigned char *iv = ivec;\n\n if (len == 0)\n return;\n\n// #if !defined(OPENSSL_SMALL_FOOTPRINT)\n// if (STRICT_ALIGNMENT &&\n// ((size_t)in | (size_t)out | (size_t)ivec) % sizeof(size_t) != 0) {\n// while (len >= 16) {\n// for (n = 0; n < 16; ++n)\n// out[n] = in[n] ^ iv[n];\n// (*block) (out, out, key);\n// iv = out;\n// len -= 16;\n// in += 16;\n// out += 16;\n// }\n// } else {\n// while (len >= 16) {\n// for (n = 0; n < 16; n += sizeof(size_t))\n// *(size_t_aX *)(out + n) =\n// *(size_t_aX *)(in + n) ^ *(size_t_aX *)(iv + n);\n// (*block) (out, out, key);\n// iv = out;\n// len -= 16;\n// in += 16;\n// out += 16;\n// }\n// }\n// #endif\n while (len) {\n for (n = 0; n < 16 && n < len; ++n)\n out[n] = in[n] ^ iv[n];\n for (; n < 16; ++n)\n out[n] = iv[n];\n (*block) (out, out, key);\n iv = out;\n if (len <= 16)\n break;\n len -= 16;\n in += 16;\n out += 16;\n }\n if (ivec != iv)\n memcpy(ivec, iv, 16);\n}\n\nvoid CRYPTO_cbc128_decrypt(const unsigned char *in, unsigned char *out,\n size_t len, const void *key,\n unsigned char ivec[16], block128_f block)\n{\n size_t n;\n union {\n size_t t[16 / sizeof(size_t)];\n unsigned char c[16];\n } tmp;\n\n if (len == 0)\n return;\n\n// #if !defined(OPENSSL_SMALL_FOOTPRINT)\n// if (in != out) {\n// const unsigned char *iv = ivec;\n\n// if (STRICT_ALIGNMENT &&\n// ((size_t)in | (size_t)out | (size_t)ivec) % sizeof(size_t) != 0) {\n// while (len >= 16) {\n// (*block) (in, out, key);\n// for (n = 0; n < 16; ++n)\n// out[n] ^= iv[n];\n// iv = in;\n// len -= 16;\n// in += 16;\n// out += 16;\n// }\n// } else if (16 % sizeof(size_t) == 0) { /* always true */\n// while (len >= 16) {\n// size_t_aX *out_t = (size_t_aX *)out;\n// size_t_aX *iv_t = (size_t_aX *)iv;\n\n// (*block) (in, out, key);\n// for (n = 0; n < 16 / sizeof(size_t); n++)\n// out_t[n] ^= iv_t[n];\n// iv = in;\n// len -= 16;\n// in += 16;\n// out += 16;\n// }\n// }\n// if (ivec != iv)\n// memcpy(ivec, iv, 16);\n// } else {\n// if (STRICT_ALIGNMENT &&\n// ((size_t)in | (size_t)out | (size_t)ivec) % sizeof(size_t) != 0) {\n// unsigned char c;\n// while (len >= 16) {\n// (*block) (in, tmp.c, key);\n// for (n = 0; n < 16; ++n) {\n// c = in[n];\n// out[n] = tmp.c[n] ^ ivec[n];\n// ivec[n] = c;\n// }\n// len -= 16;\n// in += 16;\n// out += 16;\n// }\n// } else if (16 % sizeof(size_t) == 0) { /* always true */\n// while (len >= 16) {\n// size_t c;\n// size_t_aX *out_t = (size_t_aX *)out;\n// size_t_aX *ivec_t = (size_t_aX *)ivec;\n// const size_t_aX *in_t = (const size_t_aX *)in;\n\n// (*block) (in, tmp.c, key);\n// for (n = 0; n < 16 / sizeof(size_t); n++) {\n// c = in_t[n];\n// out_t[n] = tmp.t[n] ^ ivec_t[n];\n// ivec_t[n] = c;\n// }\n// len -= 16;\n// in += 16;\n// out += 16;\n// }\n// }\n// }\n// #endif\n while (len) {\n unsigned char c;\n (*block) (in, tmp.c, key);\n for (n = 0; n < 16 && n < len; ++n) {\n c = in[n];\n out[n] = tmp.c[n] ^ ivec[n];\n ivec[n] = c;\n }\n if (len <= 16) {\n for (; n < 16; ++n)\n ivec[n] = in[n];\n break;\n }\n len -= 16;\n in += 16;\n out += 16;\n }\n}\n\n\nvoid AES_cbc_encrypt(const unsigned char *in, unsigned char *out,\n size_t len, const AES_KEY *key,\n unsigned char *ivec, const int enc)\n{\n\n if (enc)\n CRYPTO_cbc128_encrypt(in, out, len, key, ivec,\n (block128_f) AES_encrypt);\n else\n CRYPTO_cbc128_decrypt(in, out, len, key, ivec,\n (block128_f) AES_decrypt);\n}\n" }, { "path": "cryptomini/aes/aes_core.c", "content": "/*\n * Copyright 2002-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/**\n * rijndael-alg-fst.c\n *\n * @version 3.0 (December 2000)\n *\n * Optimised ANSI C code for the Rijndael cipher (now AES)\n *\n * @author Vincent Rijmen\n * @author Antoon Bosselaers\n * @author Paulo Barreto\n *\n * This code is hereby placed in the public domain.\n *\n * THIS SOFTWARE IS PROVIDED BY THE AUTHORS ''AS IS'' AND ANY EXPRESS\n * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR\n * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\n * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/* Note: rewritten a little bit to provide error control and an OpenSSL-\n compatible API */\n\n#include \n\n#include \n#include \n#include \n#include \"aes_local.h\"\n\n#if defined(OPENSSL_AES_CONST_TIME) && !defined(AES_ASM)\ntypedef union {\n unsigned char b[8];\n u32 w[2];\n u64 d;\n} uni;\n\n/*\n * Compute w := (w * x) mod (x^8 + x^4 + x^3 + x^1 + 1)\n * Therefore the name \"xtime\".\n */\nstatic void XtimeWord(u32 *w)\n{\n u32 a, b;\n\n a = *w;\n b = a & 0x80808080u;\n a ^= b;\n b -= b >> 7;\n b &= 0x1B1B1B1Bu;\n b ^= a << 1;\n *w = b;\n}\n\nstatic void XtimeLong(u64 *w)\n{\n u64 a, b;\n\n a = *w;\n b = a & 0x8080808080808080uLL;\n a ^= b;\n b -= b >> 7;\n b &= 0x1B1B1B1B1B1B1B1BuLL;\n b ^= a << 1;\n *w = b;\n}\n\n/*\n * This computes w := S * w ^ -1 + c, where c = {01100011}.\n * Instead of using GF(2^8) mod (x^8+x^4+x^3+x+1} we do the inversion\n * in GF(GF(GF(2^2)^2)^2) mod (X^2+X+8)\n * and GF(GF(2^2)^2) mod (X^2+X+2)\n * and GF(2^2) mod (X^2+X+1)\n * The first part of the algorithm below transfers the coordinates\n * {0x01,0x02,0x04,0x08,0x10,0x20,0x40,0x80} =>\n * {1,Y,Y^2,Y^3,Y^4,Y^5,Y^6,Y^7} with Y=0x41:\n * {0x01,0x41,0x66,0x6c,0x56,0x9a,0x58,0xc4}\n * The last part undoes the coordinate transfer and the final affine\n * transformation S:\n * b[i] = b[i] + b[(i+4)%8] + b[(i+5)%8] + b[(i+6)%8] + b[(i+7)%8] + c[i]\n * in one step.\n * The multiplication in GF(2^2^2^2) is done in ordinary coords:\n * A = (a0*1 + a1*x^4)\n * B = (b0*1 + b1*x^4)\n * AB = ((a0*b0 + 8*a1*b1)*1 + (a1*b0 + (a0+a1)*b1)*x^4)\n * When A = (a0,a1) is given we want to solve AB = 1:\n * (a) 1 = a0*b0 + 8*a1*b1\n * (b) 0 = a1*b0 + (a0+a1)*b1\n * => multiply (a) by a1 and (b) by a0\n * (c) a1 = a1*a0*b0 + (8*a1*a1)*b1\n * (d) 0 = a1*a0*b0 + (a0*a0+a1*a0)*b1\n * => add (c) + (d)\n * (e) a1 = (a0*a0 + a1*a0 + 8*a1*a1)*b1\n * => therefore\n * b1 = (a0*a0 + a1*a0 + 8*a1*a1)^-1 * a1\n * => and adding (a1*b0) to (b) we get\n * (f) a1*b0 = (a0+a1)*b1\n * => therefore\n * b0 = (a0*a0 + a1*a0 + 8*a1*a1)^-1 * (a0+a1)\n * Note this formula also works for the case\n * (a0+a1)*a0 + 8*a1*a1 = 0\n * if the inverse element for 0^-1 is mapped to 0.\n * Repeat the same for GF(2^2^2) and GF(2^2).\n * We get the following algorithm:\n * inv8(a0,a1):\n * x0 = a0^a1\n * [y0,y1] = mul4([x0,a1],[a0,a1]); (*)\n * y1 = mul4(8,y1);\n * t = inv4(y0^y1);\n * [b0,b1] = mul4([x0,a1],[t,t]); (*)\n * return [b0,b1];\n * The non-linear multiplies (*) can be done in parallel at no extra cost.\n */\nstatic void SubWord(u32 *w)\n{\n u32 x, y, a1, a2, a3, a4, a5, a6;\n\n x = *w;\n y = ((x & 0xFEFEFEFEu) >> 1) | ((x & 0x01010101u) << 7);\n x &= 0xDDDDDDDDu;\n x ^= y & 0x57575757u;\n y = ((y & 0xFEFEFEFEu) >> 1) | ((y & 0x01010101u) << 7);\n x ^= y & 0x1C1C1C1Cu;\n y = ((y & 0xFEFEFEFEu) >> 1) | ((y & 0x01010101u) << 7);\n x ^= y & 0x4A4A4A4Au;\n y = ((y & 0xFEFEFEFEu) >> 1) | ((y & 0x01010101u) << 7);\n x ^= y & 0x42424242u;\n y = ((y & 0xFEFEFEFEu) >> 1) | ((y & 0x01010101u) << 7);\n x ^= y & 0x64646464u;\n y = ((y & 0xFEFEFEFEu) >> 1) | ((y & 0x01010101u) << 7);\n x ^= y & 0xE0E0E0E0u;\n a1 = x;\n a1 ^= (x & 0xF0F0F0F0u) >> 4;\n a2 = ((x & 0xCCCCCCCCu) >> 2) | ((x & 0x33333333u) << 2);\n a3 = x & a1;\n a3 ^= (a3 & 0xAAAAAAAAu) >> 1;\n a3 ^= (((x << 1) & a1) ^ ((a1 << 1) & x)) & 0xAAAAAAAAu;\n a4 = a2 & a1;\n a4 ^= (a4 & 0xAAAAAAAAu) >> 1;\n a4 ^= (((a2 << 1) & a1) ^ ((a1 << 1) & a2)) & 0xAAAAAAAAu;\n a5 = (a3 & 0xCCCCCCCCu) >> 2;\n a3 ^= ((a4 << 2) ^ a4) & 0xCCCCCCCCu;\n a4 = a5 & 0x22222222u;\n a4 |= a4 >> 1;\n a4 ^= (a5 << 1) & 0x22222222u;\n a3 ^= a4;\n a5 = a3 & 0xA0A0A0A0u;\n a5 |= a5 >> 1;\n a5 ^= (a3 << 1) & 0xA0A0A0A0u;\n a4 = a5 & 0xC0C0C0C0u;\n a6 = a4 >> 2;\n a4 ^= (a5 << 2) & 0xC0C0C0C0u;\n a5 = a6 & 0x20202020u;\n a5 |= a5 >> 1;\n a5 ^= (a6 << 1) & 0x20202020u;\n a4 |= a5;\n a3 ^= a4 >> 4;\n a3 &= 0x0F0F0F0Fu;\n a2 = a3;\n a2 ^= (a3 & 0x0C0C0C0Cu) >> 2;\n a4 = a3 & a2;\n a4 ^= (a4 & 0x0A0A0A0A0Au) >> 1;\n a4 ^= (((a3 << 1) & a2) ^ ((a2 << 1) & a3)) & 0x0A0A0A0Au;\n a5 = a4 & 0x08080808u;\n a5 |= a5 >> 1;\n a5 ^= (a4 << 1) & 0x08080808u;\n a4 ^= a5 >> 2;\n a4 &= 0x03030303u;\n a4 ^= (a4 & 0x02020202u) >> 1;\n a4 |= a4 << 2;\n a3 = a2 & a4;\n a3 ^= (a3 & 0x0A0A0A0Au) >> 1;\n a3 ^= (((a2 << 1) & a4) ^ ((a4 << 1) & a2)) & 0x0A0A0A0Au;\n a3 |= a3 << 4;\n a2 = ((a1 & 0xCCCCCCCCu) >> 2) | ((a1 & 0x33333333u) << 2);\n x = a1 & a3;\n x ^= (x & 0xAAAAAAAAu) >> 1;\n x ^= (((a1 << 1) & a3) ^ ((a3 << 1) & a1)) & 0xAAAAAAAAu;\n a4 = a2 & a3;\n a4 ^= (a4 & 0xAAAAAAAAu) >> 1;\n a4 ^= (((a2 << 1) & a3) ^ ((a3 << 1) & a2)) & 0xAAAAAAAAu;\n a5 = (x & 0xCCCCCCCCu) >> 2;\n x ^= ((a4 << 2) ^ a4) & 0xCCCCCCCCu;\n a4 = a5 & 0x22222222u;\n a4 |= a4 >> 1;\n a4 ^= (a5 << 1) & 0x22222222u;\n x ^= a4;\n y = ((x & 0xFEFEFEFEu) >> 1) | ((x & 0x01010101u) << 7);\n x &= 0x39393939u;\n x ^= y & 0x3F3F3F3Fu;\n y = ((y & 0xFCFCFCFCu) >> 2) | ((y & 0x03030303u) << 6);\n x ^= y & 0x97979797u;\n y = ((y & 0xFEFEFEFEu) >> 1) | ((y & 0x01010101u) << 7);\n x ^= y & 0x9B9B9B9Bu;\n y = ((y & 0xFEFEFEFEu) >> 1) | ((y & 0x01010101u) << 7);\n x ^= y & 0x3C3C3C3Cu;\n y = ((y & 0xFEFEFEFEu) >> 1) | ((y & 0x01010101u) << 7);\n x ^= y & 0xDDDDDDDDu;\n y = ((y & 0xFEFEFEFEu) >> 1) | ((y & 0x01010101u) << 7);\n x ^= y & 0x72727272u;\n x ^= 0x63636363u;\n *w = x;\n}\n\nstatic void SubLong(u64 *w)\n{\n u64 x, y, a1, a2, a3, a4, a5, a6;\n\n x = *w;\n y = ((x & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((x & 0x0101010101010101uLL) << 7);\n x &= 0xDDDDDDDDDDDDDDDDuLL;\n x ^= y & 0x5757575757575757uLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0x1C1C1C1C1C1C1C1CuLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0x4A4A4A4A4A4A4A4AuLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0x4242424242424242uLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0x6464646464646464uLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0xE0E0E0E0E0E0E0E0uLL;\n a1 = x;\n a1 ^= (x & 0xF0F0F0F0F0F0F0F0uLL) >> 4;\n a2 = ((x & 0xCCCCCCCCCCCCCCCCuLL) >> 2) | ((x & 0x3333333333333333uLL) << 2);\n a3 = x & a1;\n a3 ^= (a3 & 0xAAAAAAAAAAAAAAAAuLL) >> 1;\n a3 ^= (((x << 1) & a1) ^ ((a1 << 1) & x)) & 0xAAAAAAAAAAAAAAAAuLL;\n a4 = a2 & a1;\n a4 ^= (a4 & 0xAAAAAAAAAAAAAAAAuLL) >> 1;\n a4 ^= (((a2 << 1) & a1) ^ ((a1 << 1) & a2)) & 0xAAAAAAAAAAAAAAAAuLL;\n a5 = (a3 & 0xCCCCCCCCCCCCCCCCuLL) >> 2;\n a3 ^= ((a4 << 2) ^ a4) & 0xCCCCCCCCCCCCCCCCuLL;\n a4 = a5 & 0x2222222222222222uLL;\n a4 |= a4 >> 1;\n a4 ^= (a5 << 1) & 0x2222222222222222uLL;\n a3 ^= a4;\n a5 = a3 & 0xA0A0A0A0A0A0A0A0uLL;\n a5 |= a5 >> 1;\n a5 ^= (a3 << 1) & 0xA0A0A0A0A0A0A0A0uLL;\n a4 = a5 & 0xC0C0C0C0C0C0C0C0uLL;\n a6 = a4 >> 2;\n a4 ^= (a5 << 2) & 0xC0C0C0C0C0C0C0C0uLL;\n a5 = a6 & 0x2020202020202020uLL;\n a5 |= a5 >> 1;\n a5 ^= (a6 << 1) & 0x2020202020202020uLL;\n a4 |= a5;\n a3 ^= a4 >> 4;\n a3 &= 0x0F0F0F0F0F0F0F0FuLL;\n a2 = a3;\n a2 ^= (a3 & 0x0C0C0C0C0C0C0C0CuLL) >> 2;\n a4 = a3 & a2;\n a4 ^= (a4 & 0x0A0A0A0A0A0A0A0AuLL) >> 1;\n a4 ^= (((a3 << 1) & a2) ^ ((a2 << 1) & a3)) & 0x0A0A0A0A0A0A0A0AuLL;\n a5 = a4 & 0x0808080808080808uLL;\n a5 |= a5 >> 1;\n a5 ^= (a4 << 1) & 0x0808080808080808uLL;\n a4 ^= a5 >> 2;\n a4 &= 0x0303030303030303uLL;\n a4 ^= (a4 & 0x0202020202020202uLL) >> 1;\n a4 |= a4 << 2;\n a3 = a2 & a4;\n a3 ^= (a3 & 0x0A0A0A0A0A0A0A0AuLL) >> 1;\n a3 ^= (((a2 << 1) & a4) ^ ((a4 << 1) & a2)) & 0x0A0A0A0A0A0A0A0AuLL;\n a3 |= a3 << 4;\n a2 = ((a1 & 0xCCCCCCCCCCCCCCCCuLL) >> 2) | ((a1 & 0x3333333333333333uLL) << 2);\n x = a1 & a3;\n x ^= (x & 0xAAAAAAAAAAAAAAAAuLL) >> 1;\n x ^= (((a1 << 1) & a3) ^ ((a3 << 1) & a1)) & 0xAAAAAAAAAAAAAAAAuLL;\n a4 = a2 & a3;\n a4 ^= (a4 & 0xAAAAAAAAAAAAAAAAuLL) >> 1;\n a4 ^= (((a2 << 1) & a3) ^ ((a3 << 1) & a2)) & 0xAAAAAAAAAAAAAAAAuLL;\n a5 = (x & 0xCCCCCCCCCCCCCCCCuLL) >> 2;\n x ^= ((a4 << 2) ^ a4) & 0xCCCCCCCCCCCCCCCCuLL;\n a4 = a5 & 0x2222222222222222uLL;\n a4 |= a4 >> 1;\n a4 ^= (a5 << 1) & 0x2222222222222222uLL;\n x ^= a4;\n y = ((x & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((x & 0x0101010101010101uLL) << 7);\n x &= 0x3939393939393939uLL;\n x ^= y & 0x3F3F3F3F3F3F3F3FuLL;\n y = ((y & 0xFCFCFCFCFCFCFCFCuLL) >> 2) | ((y & 0x0303030303030303uLL) << 6);\n x ^= y & 0x9797979797979797uLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0x9B9B9B9B9B9B9B9BuLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0x3C3C3C3C3C3C3C3CuLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0xDDDDDDDDDDDDDDDDuLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0x7272727272727272uLL;\n x ^= 0x6363636363636363uLL;\n *w = x;\n}\n\n/*\n * This computes w := (S^-1 * (w + c))^-1\n */\nstatic void InvSubLong(u64 *w)\n{\n u64 x, y, a1, a2, a3, a4, a5, a6;\n\n x = *w;\n x ^= 0x6363636363636363uLL;\n y = ((x & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((x & 0x0101010101010101uLL) << 7);\n x &= 0xFDFDFDFDFDFDFDFDuLL;\n x ^= y & 0x5E5E5E5E5E5E5E5EuLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0xF3F3F3F3F3F3F3F3uLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0xF5F5F5F5F5F5F5F5uLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0x7878787878787878uLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0x7777777777777777uLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0x1515151515151515uLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0xA5A5A5A5A5A5A5A5uLL;\n a1 = x;\n a1 ^= (x & 0xF0F0F0F0F0F0F0F0uLL) >> 4;\n a2 = ((x & 0xCCCCCCCCCCCCCCCCuLL) >> 2) | ((x & 0x3333333333333333uLL) << 2);\n a3 = x & a1;\n a3 ^= (a3 & 0xAAAAAAAAAAAAAAAAuLL) >> 1;\n a3 ^= (((x << 1) & a1) ^ ((a1 << 1) & x)) & 0xAAAAAAAAAAAAAAAAuLL;\n a4 = a2 & a1;\n a4 ^= (a4 & 0xAAAAAAAAAAAAAAAAuLL) >> 1;\n a4 ^= (((a2 << 1) & a1) ^ ((a1 << 1) & a2)) & 0xAAAAAAAAAAAAAAAAuLL;\n a5 = (a3 & 0xCCCCCCCCCCCCCCCCuLL) >> 2;\n a3 ^= ((a4 << 2) ^ a4) & 0xCCCCCCCCCCCCCCCCuLL;\n a4 = a5 & 0x2222222222222222uLL;\n a4 |= a4 >> 1;\n a4 ^= (a5 << 1) & 0x2222222222222222uLL;\n a3 ^= a4;\n a5 = a3 & 0xA0A0A0A0A0A0A0A0uLL;\n a5 |= a5 >> 1;\n a5 ^= (a3 << 1) & 0xA0A0A0A0A0A0A0A0uLL;\n a4 = a5 & 0xC0C0C0C0C0C0C0C0uLL;\n a6 = a4 >> 2;\n a4 ^= (a5 << 2) & 0xC0C0C0C0C0C0C0C0uLL;\n a5 = a6 & 0x2020202020202020uLL;\n a5 |= a5 >> 1;\n a5 ^= (a6 << 1) & 0x2020202020202020uLL;\n a4 |= a5;\n a3 ^= a4 >> 4;\n a3 &= 0x0F0F0F0F0F0F0F0FuLL;\n a2 = a3;\n a2 ^= (a3 & 0x0C0C0C0C0C0C0C0CuLL) >> 2;\n a4 = a3 & a2;\n a4 ^= (a4 & 0x0A0A0A0A0A0A0A0AuLL) >> 1;\n a4 ^= (((a3 << 1) & a2) ^ ((a2 << 1) & a3)) & 0x0A0A0A0A0A0A0A0AuLL;\n a5 = a4 & 0x0808080808080808uLL;\n a5 |= a5 >> 1;\n a5 ^= (a4 << 1) & 0x0808080808080808uLL;\n a4 ^= a5 >> 2;\n a4 &= 0x0303030303030303uLL;\n a4 ^= (a4 & 0x0202020202020202uLL) >> 1;\n a4 |= a4 << 2;\n a3 = a2 & a4;\n a3 ^= (a3 & 0x0A0A0A0A0A0A0A0AuLL) >> 1;\n a3 ^= (((a2 << 1) & a4) ^ ((a4 << 1) & a2)) & 0x0A0A0A0A0A0A0A0AuLL;\n a3 |= a3 << 4;\n a2 = ((a1 & 0xCCCCCCCCCCCCCCCCuLL) >> 2) | ((a1 & 0x3333333333333333uLL) << 2);\n x = a1 & a3;\n x ^= (x & 0xAAAAAAAAAAAAAAAAuLL) >> 1;\n x ^= (((a1 << 1) & a3) ^ ((a3 << 1) & a1)) & 0xAAAAAAAAAAAAAAAAuLL;\n a4 = a2 & a3;\n a4 ^= (a4 & 0xAAAAAAAAAAAAAAAAuLL) >> 1;\n a4 ^= (((a2 << 1) & a3) ^ ((a3 << 1) & a2)) & 0xAAAAAAAAAAAAAAAAuLL;\n a5 = (x & 0xCCCCCCCCCCCCCCCCuLL) >> 2;\n x ^= ((a4 << 2) ^ a4) & 0xCCCCCCCCCCCCCCCCuLL;\n a4 = a5 & 0x2222222222222222uLL;\n a4 |= a4 >> 1;\n a4 ^= (a5 << 1) & 0x2222222222222222uLL;\n x ^= a4;\n y = ((x & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((x & 0x0101010101010101uLL) << 7);\n x &= 0xB5B5B5B5B5B5B5B5uLL;\n x ^= y & 0x4040404040404040uLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0x8080808080808080uLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0x1616161616161616uLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0xEBEBEBEBEBEBEBEBuLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0x9797979797979797uLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0xFBFBFBFBFBFBFBFBuLL;\n y = ((y & 0xFEFEFEFEFEFEFEFEuLL) >> 1) | ((y & 0x0101010101010101uLL) << 7);\n x ^= y & 0x7D7D7D7D7D7D7D7DuLL;\n *w = x;\n}\n\nstatic void ShiftRows(u64 *state)\n{\n unsigned char s[4];\n unsigned char *s0;\n int r;\n\n s0 = (unsigned char *)state;\n for (r = 0; r < 4; r++) {\n s[0] = s0[0*4 + r];\n s[1] = s0[1*4 + r];\n s[2] = s0[2*4 + r];\n s[3] = s0[3*4 + r];\n s0[0*4 + r] = s[(r+0) % 4];\n s0[1*4 + r] = s[(r+1) % 4];\n s0[2*4 + r] = s[(r+2) % 4];\n s0[3*4 + r] = s[(r+3) % 4];\n }\n}\n\nstatic void InvShiftRows(u64 *state)\n{\n unsigned char s[4];\n unsigned char *s0;\n int r;\n\n s0 = (unsigned char *)state;\n for (r = 0; r < 4; r++) {\n s[0] = s0[0*4 + r];\n s[1] = s0[1*4 + r];\n s[2] = s0[2*4 + r];\n s[3] = s0[3*4 + r];\n s0[0*4 + r] = s[(4-r) % 4];\n s0[1*4 + r] = s[(5-r) % 4];\n s0[2*4 + r] = s[(6-r) % 4];\n s0[3*4 + r] = s[(7-r) % 4];\n }\n}\n\nstatic void MixColumns(u64 *state)\n{\n uni s1;\n uni s;\n int c;\n\n for (c = 0; c < 2; c++) {\n s1.d = state[c];\n s.d = s1.d;\n s.d ^= ((s.d & 0xFFFF0000FFFF0000uLL) >> 16)\n | ((s.d & 0x0000FFFF0000FFFFuLL) << 16);\n s.d ^= ((s.d & 0xFF00FF00FF00FF00uLL) >> 8)\n | ((s.d & 0x00FF00FF00FF00FFuLL) << 8);\n s.d ^= s1.d;\n XtimeLong(&s1.d);\n s.d ^= s1.d;\n s.b[0] ^= s1.b[1];\n s.b[1] ^= s1.b[2];\n s.b[2] ^= s1.b[3];\n s.b[3] ^= s1.b[0];\n s.b[4] ^= s1.b[5];\n s.b[5] ^= s1.b[6];\n s.b[6] ^= s1.b[7];\n s.b[7] ^= s1.b[4];\n state[c] = s.d;\n }\n}\n\nstatic void InvMixColumns(u64 *state)\n{\n uni s1;\n uni s;\n int c;\n\n for (c = 0; c < 2; c++) {\n s1.d = state[c];\n s.d = s1.d;\n s.d ^= ((s.d & 0xFFFF0000FFFF0000uLL) >> 16)\n | ((s.d & 0x0000FFFF0000FFFFuLL) << 16);\n s.d ^= ((s.d & 0xFF00FF00FF00FF00uLL) >> 8)\n | ((s.d & 0x00FF00FF00FF00FFuLL) << 8);\n s.d ^= s1.d;\n XtimeLong(&s1.d);\n s.d ^= s1.d;\n s.b[0] ^= s1.b[1];\n s.b[1] ^= s1.b[2];\n s.b[2] ^= s1.b[3];\n s.b[3] ^= s1.b[0];\n s.b[4] ^= s1.b[5];\n s.b[5] ^= s1.b[6];\n s.b[6] ^= s1.b[7];\n s.b[7] ^= s1.b[4];\n XtimeLong(&s1.d);\n s1.d ^= ((s1.d & 0xFFFF0000FFFF0000uLL) >> 16)\n | ((s1.d & 0x0000FFFF0000FFFFuLL) << 16);\n s.d ^= s1.d;\n XtimeLong(&s1.d);\n s1.d ^= ((s1.d & 0xFF00FF00FF00FF00uLL) >> 8)\n | ((s1.d & 0x00FF00FF00FF00FFuLL) << 8);\n s.d ^= s1.d;\n state[c] = s.d;\n }\n}\n\nstatic void AddRoundKey(u64 *state, const u64 *w)\n{\n state[0] ^= w[0];\n state[1] ^= w[1];\n}\n\nstatic void Cipher(const unsigned char *in, unsigned char *out,\n const u64 *w, int nr)\n{\n u64 state[2];\n int i;\n\n memcpy(state, in, 16);\n\n AddRoundKey(state, w);\n\n for (i = 1; i < nr; i++) {\n SubLong(&state[0]);\n SubLong(&state[1]);\n ShiftRows(state);\n MixColumns(state);\n AddRoundKey(state, w + i*2);\n }\n\n SubLong(&state[0]);\n SubLong(&state[1]);\n ShiftRows(state);\n AddRoundKey(state, w + nr*2);\n\n memcpy(out, state, 16);\n}\n\nstatic void InvCipher(const unsigned char *in, unsigned char *out,\n const u64 *w, int nr)\n\n{\n u64 state[2];\n int i;\n\n memcpy(state, in, 16);\n\n AddRoundKey(state, w + nr*2);\n\n for (i = nr - 1; i > 0; i--) {\n InvShiftRows(state);\n InvSubLong(&state[0]);\n InvSubLong(&state[1]);\n AddRoundKey(state, w + i*2);\n InvMixColumns(state);\n }\n\n InvShiftRows(state);\n InvSubLong(&state[0]);\n InvSubLong(&state[1]);\n AddRoundKey(state, w);\n\n memcpy(out, state, 16);\n}\n\nstatic void RotWord(u32 *x)\n{\n unsigned char *w0;\n unsigned char tmp;\n\n w0 = (unsigned char *)x;\n tmp = w0[0];\n w0[0] = w0[1];\n w0[1] = w0[2];\n w0[2] = w0[3];\n w0[3] = tmp;\n}\n\nstatic void KeyExpansion(const unsigned char *key, u64 *w,\n int nr, int nk)\n{\n u32 rcon;\n uni prev;\n u32 temp;\n int i, n;\n\n memcpy(w, key, nk*4);\n memcpy(&rcon, \"\\1\\0\\0\\0\", 4);\n n = nk/2;\n prev.d = w[n-1];\n for (i = n; i < (nr+1)*2; i++) {\n temp = prev.w[1];\n if (i % n == 0) {\n RotWord(&temp);\n SubWord(&temp);\n temp ^= rcon;\n XtimeWord(&rcon);\n } else if (nk > 6 && i % n == 2) {\n SubWord(&temp);\n }\n prev.d = w[i-n];\n prev.w[0] ^= temp;\n prev.w[1] ^= prev.w[0];\n w[i] = prev.d;\n }\n}\n\n/**\n * Expand the cipher key into the encryption key schedule.\n */\nint AES_set_encrypt_key(const unsigned char *userKey, const int bits,\n AES_KEY *key)\n{\n u64 *rk;\n\n if (!userKey || !key)\n return -1;\n if (bits != 128 && bits != 192 && bits != 256)\n return -2;\n\n rk = (u64*)key->rd_key;\n\n if (bits == 128)\n key->rounds = 10;\n else if (bits == 192)\n key->rounds = 12;\n else\n key->rounds = 14;\n\n KeyExpansion(userKey, rk, key->rounds, bits/32);\n return 0;\n}\n\n/**\n * Expand the cipher key into the decryption key schedule.\n */\nint AES_set_decrypt_key(const unsigned char *userKey, const int bits,\n AES_KEY *key)\n{\n return AES_set_encrypt_key(userKey, bits, key);\n}\n\n/*\n * Encrypt a single block\n * in and out can overlap\n */\nvoid AES_encrypt(const unsigned char *in, unsigned char *out,\n const AES_KEY *key)\n{\n const u64 *rk;\n\n assert(in && out && key);\n rk = (u64*)key->rd_key;\n\n Cipher(in, out, rk, key->rounds);\n}\n\n/*\n * Decrypt a single block\n * in and out can overlap\n */\nvoid AES_decrypt(const unsigned char *in, unsigned char *out,\n const AES_KEY *key)\n{\n const u64 *rk;\n\n assert(in && out && key);\n rk = (u64*)key->rd_key;\n\n InvCipher(in, out, rk, key->rounds);\n}\n#elif !defined(AES_ASM)\n/*-\nTe0[x] = S [x].[02, 01, 01, 03];\nTe1[x] = S [x].[03, 02, 01, 01];\nTe2[x] = S [x].[01, 03, 02, 01];\nTe3[x] = S [x].[01, 01, 03, 02];\n\nTd0[x] = Si[x].[0e, 09, 0d, 0b];\nTd1[x] = Si[x].[0b, 0e, 09, 0d];\nTd2[x] = Si[x].[0d, 0b, 0e, 09];\nTd3[x] = Si[x].[09, 0d, 0b, 0e];\nTd4[x] = Si[x].[01];\n*/\n\nstatic const u32 Te0[256] = {\n 0xc66363a5U, 0xf87c7c84U, 0xee777799U, 0xf67b7b8dU,\n 0xfff2f20dU, 0xd66b6bbdU, 0xde6f6fb1U, 0x91c5c554U,\n 0x60303050U, 0x02010103U, 0xce6767a9U, 0x562b2b7dU,\n 0xe7fefe19U, 0xb5d7d762U, 0x4dababe6U, 0xec76769aU,\n 0x8fcaca45U, 0x1f82829dU, 0x89c9c940U, 0xfa7d7d87U,\n 0xeffafa15U, 0xb25959ebU, 0x8e4747c9U, 0xfbf0f00bU,\n 0x41adadecU, 0xb3d4d467U, 0x5fa2a2fdU, 0x45afafeaU,\n 0x239c9cbfU, 0x53a4a4f7U, 0xe4727296U, 0x9bc0c05bU,\n 0x75b7b7c2U, 0xe1fdfd1cU, 0x3d9393aeU, 0x4c26266aU,\n 0x6c36365aU, 0x7e3f3f41U, 0xf5f7f702U, 0x83cccc4fU,\n 0x6834345cU, 0x51a5a5f4U, 0xd1e5e534U, 0xf9f1f108U,\n 0xe2717193U, 0xabd8d873U, 0x62313153U, 0x2a15153fU,\n 0x0804040cU, 0x95c7c752U, 0x46232365U, 0x9dc3c35eU,\n 0x30181828U, 0x379696a1U, 0x0a05050fU, 0x2f9a9ab5U,\n 0x0e070709U, 0x24121236U, 0x1b80809bU, 0xdfe2e23dU,\n 0xcdebeb26U, 0x4e272769U, 0x7fb2b2cdU, 0xea75759fU,\n 0x1209091bU, 0x1d83839eU, 0x582c2c74U, 0x341a1a2eU,\n 0x361b1b2dU, 0xdc6e6eb2U, 0xb45a5aeeU, 0x5ba0a0fbU,\n 0xa45252f6U, 0x763b3b4dU, 0xb7d6d661U, 0x7db3b3ceU,\n 0x5229297bU, 0xdde3e33eU, 0x5e2f2f71U, 0x13848497U,\n 0xa65353f5U, 0xb9d1d168U, 0x00000000U, 0xc1eded2cU,\n 0x40202060U, 0xe3fcfc1fU, 0x79b1b1c8U, 0xb65b5bedU,\n 0xd46a6abeU, 0x8dcbcb46U, 0x67bebed9U, 0x7239394bU,\n 0x944a4adeU, 0x984c4cd4U, 0xb05858e8U, 0x85cfcf4aU,\n 0xbbd0d06bU, 0xc5efef2aU, 0x4faaaae5U, 0xedfbfb16U,\n 0x864343c5U, 0x9a4d4dd7U, 0x66333355U, 0x11858594U,\n 0x8a4545cfU, 0xe9f9f910U, 0x04020206U, 0xfe7f7f81U,\n 0xa05050f0U, 0x783c3c44U, 0x259f9fbaU, 0x4ba8a8e3U,\n 0xa25151f3U, 0x5da3a3feU, 0x804040c0U, 0x058f8f8aU,\n 0x3f9292adU, 0x219d9dbcU, 0x70383848U, 0xf1f5f504U,\n 0x63bcbcdfU, 0x77b6b6c1U, 0xafdada75U, 0x42212163U,\n 0x20101030U, 0xe5ffff1aU, 0xfdf3f30eU, 0xbfd2d26dU,\n 0x81cdcd4cU, 0x180c0c14U, 0x26131335U, 0xc3ecec2fU,\n 0xbe5f5fe1U, 0x359797a2U, 0x884444ccU, 0x2e171739U,\n 0x93c4c457U, 0x55a7a7f2U, 0xfc7e7e82U, 0x7a3d3d47U,\n 0xc86464acU, 0xba5d5de7U, 0x3219192bU, 0xe6737395U,\n 0xc06060a0U, 0x19818198U, 0x9e4f4fd1U, 0xa3dcdc7fU,\n 0x44222266U, 0x542a2a7eU, 0x3b9090abU, 0x0b888883U,\n 0x8c4646caU, 0xc7eeee29U, 0x6bb8b8d3U, 0x2814143cU,\n 0xa7dede79U, 0xbc5e5ee2U, 0x160b0b1dU, 0xaddbdb76U,\n 0xdbe0e03bU, 0x64323256U, 0x743a3a4eU, 0x140a0a1eU,\n 0x924949dbU, 0x0c06060aU, 0x4824246cU, 0xb85c5ce4U,\n 0x9fc2c25dU, 0xbdd3d36eU, 0x43acacefU, 0xc46262a6U,\n 0x399191a8U, 0x319595a4U, 0xd3e4e437U, 0xf279798bU,\n 0xd5e7e732U, 0x8bc8c843U, 0x6e373759U, 0xda6d6db7U,\n 0x018d8d8cU, 0xb1d5d564U, 0x9c4e4ed2U, 0x49a9a9e0U,\n 0xd86c6cb4U, 0xac5656faU, 0xf3f4f407U, 0xcfeaea25U,\n 0xca6565afU, 0xf47a7a8eU, 0x47aeaee9U, 0x10080818U,\n 0x6fbabad5U, 0xf0787888U, 0x4a25256fU, 0x5c2e2e72U,\n 0x381c1c24U, 0x57a6a6f1U, 0x73b4b4c7U, 0x97c6c651U,\n 0xcbe8e823U, 0xa1dddd7cU, 0xe874749cU, 0x3e1f1f21U,\n 0x964b4bddU, 0x61bdbddcU, 0x0d8b8b86U, 0x0f8a8a85U,\n 0xe0707090U, 0x7c3e3e42U, 0x71b5b5c4U, 0xcc6666aaU,\n 0x904848d8U, 0x06030305U, 0xf7f6f601U, 0x1c0e0e12U,\n 0xc26161a3U, 0x6a35355fU, 0xae5757f9U, 0x69b9b9d0U,\n 0x17868691U, 0x99c1c158U, 0x3a1d1d27U, 0x279e9eb9U,\n 0xd9e1e138U, 0xebf8f813U, 0x2b9898b3U, 0x22111133U,\n 0xd26969bbU, 0xa9d9d970U, 0x078e8e89U, 0x339494a7U,\n 0x2d9b9bb6U, 0x3c1e1e22U, 0x15878792U, 0xc9e9e920U,\n 0x87cece49U, 0xaa5555ffU, 0x50282878U, 0xa5dfdf7aU,\n 0x038c8c8fU, 0x59a1a1f8U, 0x09898980U, 0x1a0d0d17U,\n 0x65bfbfdaU, 0xd7e6e631U, 0x844242c6U, 0xd06868b8U,\n 0x824141c3U, 0x299999b0U, 0x5a2d2d77U, 0x1e0f0f11U,\n 0x7bb0b0cbU, 0xa85454fcU, 0x6dbbbbd6U, 0x2c16163aU,\n};\nstatic const u32 Te1[256] = {\n 0xa5c66363U, 0x84f87c7cU, 0x99ee7777U, 0x8df67b7bU,\n 0x0dfff2f2U, 0xbdd66b6bU, 0xb1de6f6fU, 0x5491c5c5U,\n 0x50603030U, 0x03020101U, 0xa9ce6767U, 0x7d562b2bU,\n 0x19e7fefeU, 0x62b5d7d7U, 0xe64dababU, 0x9aec7676U,\n 0x458fcacaU, 0x9d1f8282U, 0x4089c9c9U, 0x87fa7d7dU,\n 0x15effafaU, 0xebb25959U, 0xc98e4747U, 0x0bfbf0f0U,\n 0xec41adadU, 0x67b3d4d4U, 0xfd5fa2a2U, 0xea45afafU,\n 0xbf239c9cU, 0xf753a4a4U, 0x96e47272U, 0x5b9bc0c0U,\n 0xc275b7b7U, 0x1ce1fdfdU, 0xae3d9393U, 0x6a4c2626U,\n 0x5a6c3636U, 0x417e3f3fU, 0x02f5f7f7U, 0x4f83ccccU,\n 0x5c683434U, 0xf451a5a5U, 0x34d1e5e5U, 0x08f9f1f1U,\n 0x93e27171U, 0x73abd8d8U, 0x53623131U, 0x3f2a1515U,\n 0x0c080404U, 0x5295c7c7U, 0x65462323U, 0x5e9dc3c3U,\n 0x28301818U, 0xa1379696U, 0x0f0a0505U, 0xb52f9a9aU,\n 0x090e0707U, 0x36241212U, 0x9b1b8080U, 0x3ddfe2e2U,\n 0x26cdebebU, 0x694e2727U, 0xcd7fb2b2U, 0x9fea7575U,\n 0x1b120909U, 0x9e1d8383U, 0x74582c2cU, 0x2e341a1aU,\n 0x2d361b1bU, 0xb2dc6e6eU, 0xeeb45a5aU, 0xfb5ba0a0U,\n 0xf6a45252U, 0x4d763b3bU, 0x61b7d6d6U, 0xce7db3b3U,\n 0x7b522929U, 0x3edde3e3U, 0x715e2f2fU, 0x97138484U,\n 0xf5a65353U, 0x68b9d1d1U, 0x00000000U, 0x2cc1ededU,\n 0x60402020U, 0x1fe3fcfcU, 0xc879b1b1U, 0xedb65b5bU,\n 0xbed46a6aU, 0x468dcbcbU, 0xd967bebeU, 0x4b723939U,\n 0xde944a4aU, 0xd4984c4cU, 0xe8b05858U, 0x4a85cfcfU,\n 0x6bbbd0d0U, 0x2ac5efefU, 0xe54faaaaU, 0x16edfbfbU,\n 0xc5864343U, 0xd79a4d4dU, 0x55663333U, 0x94118585U,\n 0xcf8a4545U, 0x10e9f9f9U, 0x06040202U, 0x81fe7f7fU,\n 0xf0a05050U, 0x44783c3cU, 0xba259f9fU, 0xe34ba8a8U,\n 0xf3a25151U, 0xfe5da3a3U, 0xc0804040U, 0x8a058f8fU,\n 0xad3f9292U, 0xbc219d9dU, 0x48703838U, 0x04f1f5f5U,\n 0xdf63bcbcU, 0xc177b6b6U, 0x75afdadaU, 0x63422121U,\n 0x30201010U, 0x1ae5ffffU, 0x0efdf3f3U, 0x6dbfd2d2U,\n 0x4c81cdcdU, 0x14180c0cU, 0x35261313U, 0x2fc3ececU,\n 0xe1be5f5fU, 0xa2359797U, 0xcc884444U, 0x392e1717U,\n 0x5793c4c4U, 0xf255a7a7U, 0x82fc7e7eU, 0x477a3d3dU,\n 0xacc86464U, 0xe7ba5d5dU, 0x2b321919U, 0x95e67373U,\n 0xa0c06060U, 0x98198181U, 0xd19e4f4fU, 0x7fa3dcdcU,\n 0x66442222U, 0x7e542a2aU, 0xab3b9090U, 0x830b8888U,\n 0xca8c4646U, 0x29c7eeeeU, 0xd36bb8b8U, 0x3c281414U,\n 0x79a7dedeU, 0xe2bc5e5eU, 0x1d160b0bU, 0x76addbdbU,\n 0x3bdbe0e0U, 0x56643232U, 0x4e743a3aU, 0x1e140a0aU,\n 0xdb924949U, 0x0a0c0606U, 0x6c482424U, 0xe4b85c5cU,\n 0x5d9fc2c2U, 0x6ebdd3d3U, 0xef43acacU, 0xa6c46262U,\n 0xa8399191U, 0xa4319595U, 0x37d3e4e4U, 0x8bf27979U,\n 0x32d5e7e7U, 0x438bc8c8U, 0x596e3737U, 0xb7da6d6dU,\n 0x8c018d8dU, 0x64b1d5d5U, 0xd29c4e4eU, 0xe049a9a9U,\n 0xb4d86c6cU, 0xfaac5656U, 0x07f3f4f4U, 0x25cfeaeaU,\n 0xafca6565U, 0x8ef47a7aU, 0xe947aeaeU, 0x18100808U,\n 0xd56fbabaU, 0x88f07878U, 0x6f4a2525U, 0x725c2e2eU,\n 0x24381c1cU, 0xf157a6a6U, 0xc773b4b4U, 0x5197c6c6U,\n 0x23cbe8e8U, 0x7ca1ddddU, 0x9ce87474U, 0x213e1f1fU,\n 0xdd964b4bU, 0xdc61bdbdU, 0x860d8b8bU, 0x850f8a8aU,\n 0x90e07070U, 0x427c3e3eU, 0xc471b5b5U, 0xaacc6666U,\n 0xd8904848U, 0x05060303U, 0x01f7f6f6U, 0x121c0e0eU,\n 0xa3c26161U, 0x5f6a3535U, 0xf9ae5757U, 0xd069b9b9U,\n 0x91178686U, 0x5899c1c1U, 0x273a1d1dU, 0xb9279e9eU,\n 0x38d9e1e1U, 0x13ebf8f8U, 0xb32b9898U, 0x33221111U,\n 0xbbd26969U, 0x70a9d9d9U, 0x89078e8eU, 0xa7339494U,\n 0xb62d9b9bU, 0x223c1e1eU, 0x92158787U, 0x20c9e9e9U,\n 0x4987ceceU, 0xffaa5555U, 0x78502828U, 0x7aa5dfdfU,\n 0x8f038c8cU, 0xf859a1a1U, 0x80098989U, 0x171a0d0dU,\n 0xda65bfbfU, 0x31d7e6e6U, 0xc6844242U, 0xb8d06868U,\n 0xc3824141U, 0xb0299999U, 0x775a2d2dU, 0x111e0f0fU,\n 0xcb7bb0b0U, 0xfca85454U, 0xd66dbbbbU, 0x3a2c1616U,\n};\nstatic const u32 Te2[256] = {\n 0x63a5c663U, 0x7c84f87cU, 0x7799ee77U, 0x7b8df67bU,\n 0xf20dfff2U, 0x6bbdd66bU, 0x6fb1de6fU, 0xc55491c5U,\n 0x30506030U, 0x01030201U, 0x67a9ce67U, 0x2b7d562bU,\n 0xfe19e7feU, 0xd762b5d7U, 0xabe64dabU, 0x769aec76U,\n 0xca458fcaU, 0x829d1f82U, 0xc94089c9U, 0x7d87fa7dU,\n 0xfa15effaU, 0x59ebb259U, 0x47c98e47U, 0xf00bfbf0U,\n 0xadec41adU, 0xd467b3d4U, 0xa2fd5fa2U, 0xafea45afU,\n 0x9cbf239cU, 0xa4f753a4U, 0x7296e472U, 0xc05b9bc0U,\n 0xb7c275b7U, 0xfd1ce1fdU, 0x93ae3d93U, 0x266a4c26U,\n 0x365a6c36U, 0x3f417e3fU, 0xf702f5f7U, 0xcc4f83ccU,\n 0x345c6834U, 0xa5f451a5U, 0xe534d1e5U, 0xf108f9f1U,\n 0x7193e271U, 0xd873abd8U, 0x31536231U, 0x153f2a15U,\n 0x040c0804U, 0xc75295c7U, 0x23654623U, 0xc35e9dc3U,\n 0x18283018U, 0x96a13796U, 0x050f0a05U, 0x9ab52f9aU,\n 0x07090e07U, 0x12362412U, 0x809b1b80U, 0xe23ddfe2U,\n 0xeb26cdebU, 0x27694e27U, 0xb2cd7fb2U, 0x759fea75U,\n 0x091b1209U, 0x839e1d83U, 0x2c74582cU, 0x1a2e341aU,\n 0x1b2d361bU, 0x6eb2dc6eU, 0x5aeeb45aU, 0xa0fb5ba0U,\n 0x52f6a452U, 0x3b4d763bU, 0xd661b7d6U, 0xb3ce7db3U,\n 0x297b5229U, 0xe33edde3U, 0x2f715e2fU, 0x84971384U,\n 0x53f5a653U, 0xd168b9d1U, 0x00000000U, 0xed2cc1edU,\n 0x20604020U, 0xfc1fe3fcU, 0xb1c879b1U, 0x5bedb65bU,\n 0x6abed46aU, 0xcb468dcbU, 0xbed967beU, 0x394b7239U,\n 0x4ade944aU, 0x4cd4984cU, 0x58e8b058U, 0xcf4a85cfU,\n 0xd06bbbd0U, 0xef2ac5efU, 0xaae54faaU, 0xfb16edfbU,\n 0x43c58643U, 0x4dd79a4dU, 0x33556633U, 0x85941185U,\n 0x45cf8a45U, 0xf910e9f9U, 0x02060402U, 0x7f81fe7fU,\n 0x50f0a050U, 0x3c44783cU, 0x9fba259fU, 0xa8e34ba8U,\n 0x51f3a251U, 0xa3fe5da3U, 0x40c08040U, 0x8f8a058fU,\n 0x92ad3f92U, 0x9dbc219dU, 0x38487038U, 0xf504f1f5U,\n 0xbcdf63bcU, 0xb6c177b6U, 0xda75afdaU, 0x21634221U,\n 0x10302010U, 0xff1ae5ffU, 0xf30efdf3U, 0xd26dbfd2U,\n 0xcd4c81cdU, 0x0c14180cU, 0x13352613U, 0xec2fc3ecU,\n 0x5fe1be5fU, 0x97a23597U, 0x44cc8844U, 0x17392e17U,\n 0xc45793c4U, 0xa7f255a7U, 0x7e82fc7eU, 0x3d477a3dU,\n 0x64acc864U, 0x5de7ba5dU, 0x192b3219U, 0x7395e673U,\n 0x60a0c060U, 0x81981981U, 0x4fd19e4fU, 0xdc7fa3dcU,\n 0x22664422U, 0x2a7e542aU, 0x90ab3b90U, 0x88830b88U,\n 0x46ca8c46U, 0xee29c7eeU, 0xb8d36bb8U, 0x143c2814U,\n 0xde79a7deU, 0x5ee2bc5eU, 0x0b1d160bU, 0xdb76addbU,\n 0xe03bdbe0U, 0x32566432U, 0x3a4e743aU, 0x0a1e140aU,\n 0x49db9249U, 0x060a0c06U, 0x246c4824U, 0x5ce4b85cU,\n 0xc25d9fc2U, 0xd36ebdd3U, 0xacef43acU, 0x62a6c462U,\n 0x91a83991U, 0x95a43195U, 0xe437d3e4U, 0x798bf279U,\n 0xe732d5e7U, 0xc8438bc8U, 0x37596e37U, 0x6db7da6dU,\n 0x8d8c018dU, 0xd564b1d5U, 0x4ed29c4eU, 0xa9e049a9U,\n 0x6cb4d86cU, 0x56faac56U, 0xf407f3f4U, 0xea25cfeaU,\n 0x65afca65U, 0x7a8ef47aU, 0xaee947aeU, 0x08181008U,\n 0xbad56fbaU, 0x7888f078U, 0x256f4a25U, 0x2e725c2eU,\n 0x1c24381cU, 0xa6f157a6U, 0xb4c773b4U, 0xc65197c6U,\n 0xe823cbe8U, 0xdd7ca1ddU, 0x749ce874U, 0x1f213e1fU,\n 0x4bdd964bU, 0xbddc61bdU, 0x8b860d8bU, 0x8a850f8aU,\n 0x7090e070U, 0x3e427c3eU, 0xb5c471b5U, 0x66aacc66U,\n 0x48d89048U, 0x03050603U, 0xf601f7f6U, 0x0e121c0eU,\n 0x61a3c261U, 0x355f6a35U, 0x57f9ae57U, 0xb9d069b9U,\n 0x86911786U, 0xc15899c1U, 0x1d273a1dU, 0x9eb9279eU,\n 0xe138d9e1U, 0xf813ebf8U, 0x98b32b98U, 0x11332211U,\n 0x69bbd269U, 0xd970a9d9U, 0x8e89078eU, 0x94a73394U,\n 0x9bb62d9bU, 0x1e223c1eU, 0x87921587U, 0xe920c9e9U,\n 0xce4987ceU, 0x55ffaa55U, 0x28785028U, 0xdf7aa5dfU,\n 0x8c8f038cU, 0xa1f859a1U, 0x89800989U, 0x0d171a0dU,\n 0xbfda65bfU, 0xe631d7e6U, 0x42c68442U, 0x68b8d068U,\n 0x41c38241U, 0x99b02999U, 0x2d775a2dU, 0x0f111e0fU,\n 0xb0cb7bb0U, 0x54fca854U, 0xbbd66dbbU, 0x163a2c16U,\n};\nstatic const u32 Te3[256] = {\n 0x6363a5c6U, 0x7c7c84f8U, 0x777799eeU, 0x7b7b8df6U,\n 0xf2f20dffU, 0x6b6bbdd6U, 0x6f6fb1deU, 0xc5c55491U,\n 0x30305060U, 0x01010302U, 0x6767a9ceU, 0x2b2b7d56U,\n 0xfefe19e7U, 0xd7d762b5U, 0xababe64dU, 0x76769aecU,\n 0xcaca458fU, 0x82829d1fU, 0xc9c94089U, 0x7d7d87faU,\n 0xfafa15efU, 0x5959ebb2U, 0x4747c98eU, 0xf0f00bfbU,\n 0xadadec41U, 0xd4d467b3U, 0xa2a2fd5fU, 0xafafea45U,\n 0x9c9cbf23U, 0xa4a4f753U, 0x727296e4U, 0xc0c05b9bU,\n 0xb7b7c275U, 0xfdfd1ce1U, 0x9393ae3dU, 0x26266a4cU,\n 0x36365a6cU, 0x3f3f417eU, 0xf7f702f5U, 0xcccc4f83U,\n 0x34345c68U, 0xa5a5f451U, 0xe5e534d1U, 0xf1f108f9U,\n 0x717193e2U, 0xd8d873abU, 0x31315362U, 0x15153f2aU,\n 0x04040c08U, 0xc7c75295U, 0x23236546U, 0xc3c35e9dU,\n 0x18182830U, 0x9696a137U, 0x05050f0aU, 0x9a9ab52fU,\n 0x0707090eU, 0x12123624U, 0x80809b1bU, 0xe2e23ddfU,\n 0xebeb26cdU, 0x2727694eU, 0xb2b2cd7fU, 0x75759feaU,\n 0x09091b12U, 0x83839e1dU, 0x2c2c7458U, 0x1a1a2e34U,\n 0x1b1b2d36U, 0x6e6eb2dcU, 0x5a5aeeb4U, 0xa0a0fb5bU,\n 0x5252f6a4U, 0x3b3b4d76U, 0xd6d661b7U, 0xb3b3ce7dU,\n 0x29297b52U, 0xe3e33eddU, 0x2f2f715eU, 0x84849713U,\n 0x5353f5a6U, 0xd1d168b9U, 0x00000000U, 0xeded2cc1U,\n 0x20206040U, 0xfcfc1fe3U, 0xb1b1c879U, 0x5b5bedb6U,\n 0x6a6abed4U, 0xcbcb468dU, 0xbebed967U, 0x39394b72U,\n 0x4a4ade94U, 0x4c4cd498U, 0x5858e8b0U, 0xcfcf4a85U,\n 0xd0d06bbbU, 0xefef2ac5U, 0xaaaae54fU, 0xfbfb16edU,\n 0x4343c586U, 0x4d4dd79aU, 0x33335566U, 0x85859411U,\n 0x4545cf8aU, 0xf9f910e9U, 0x02020604U, 0x7f7f81feU,\n 0x5050f0a0U, 0x3c3c4478U, 0x9f9fba25U, 0xa8a8e34bU,\n 0x5151f3a2U, 0xa3a3fe5dU, 0x4040c080U, 0x8f8f8a05U,\n 0x9292ad3fU, 0x9d9dbc21U, 0x38384870U, 0xf5f504f1U,\n 0xbcbcdf63U, 0xb6b6c177U, 0xdada75afU, 0x21216342U,\n 0x10103020U, 0xffff1ae5U, 0xf3f30efdU, 0xd2d26dbfU,\n 0xcdcd4c81U, 0x0c0c1418U, 0x13133526U, 0xecec2fc3U,\n 0x5f5fe1beU, 0x9797a235U, 0x4444cc88U, 0x1717392eU,\n 0xc4c45793U, 0xa7a7f255U, 0x7e7e82fcU, 0x3d3d477aU,\n 0x6464acc8U, 0x5d5de7baU, 0x19192b32U, 0x737395e6U,\n 0x6060a0c0U, 0x81819819U, 0x4f4fd19eU, 0xdcdc7fa3U,\n 0x22226644U, 0x2a2a7e54U, 0x9090ab3bU, 0x8888830bU,\n 0x4646ca8cU, 0xeeee29c7U, 0xb8b8d36bU, 0x14143c28U,\n 0xdede79a7U, 0x5e5ee2bcU, 0x0b0b1d16U, 0xdbdb76adU,\n 0xe0e03bdbU, 0x32325664U, 0x3a3a4e74U, 0x0a0a1e14U,\n 0x4949db92U, 0x06060a0cU, 0x24246c48U, 0x5c5ce4b8U,\n 0xc2c25d9fU, 0xd3d36ebdU, 0xacacef43U, 0x6262a6c4U,\n 0x9191a839U, 0x9595a431U, 0xe4e437d3U, 0x79798bf2U,\n 0xe7e732d5U, 0xc8c8438bU, 0x3737596eU, 0x6d6db7daU,\n 0x8d8d8c01U, 0xd5d564b1U, 0x4e4ed29cU, 0xa9a9e049U,\n 0x6c6cb4d8U, 0x5656faacU, 0xf4f407f3U, 0xeaea25cfU,\n 0x6565afcaU, 0x7a7a8ef4U, 0xaeaee947U, 0x08081810U,\n 0xbabad56fU, 0x787888f0U, 0x25256f4aU, 0x2e2e725cU,\n 0x1c1c2438U, 0xa6a6f157U, 0xb4b4c773U, 0xc6c65197U,\n 0xe8e823cbU, 0xdddd7ca1U, 0x74749ce8U, 0x1f1f213eU,\n 0x4b4bdd96U, 0xbdbddc61U, 0x8b8b860dU, 0x8a8a850fU,\n 0x707090e0U, 0x3e3e427cU, 0xb5b5c471U, 0x6666aaccU,\n 0x4848d890U, 0x03030506U, 0xf6f601f7U, 0x0e0e121cU,\n 0x6161a3c2U, 0x35355f6aU, 0x5757f9aeU, 0xb9b9d069U,\n 0x86869117U, 0xc1c15899U, 0x1d1d273aU, 0x9e9eb927U,\n 0xe1e138d9U, 0xf8f813ebU, 0x9898b32bU, 0x11113322U,\n 0x6969bbd2U, 0xd9d970a9U, 0x8e8e8907U, 0x9494a733U,\n 0x9b9bb62dU, 0x1e1e223cU, 0x87879215U, 0xe9e920c9U,\n 0xcece4987U, 0x5555ffaaU, 0x28287850U, 0xdfdf7aa5U,\n 0x8c8c8f03U, 0xa1a1f859U, 0x89898009U, 0x0d0d171aU,\n 0xbfbfda65U, 0xe6e631d7U, 0x4242c684U, 0x6868b8d0U,\n 0x4141c382U, 0x9999b029U, 0x2d2d775aU, 0x0f0f111eU,\n 0xb0b0cb7bU, 0x5454fca8U, 0xbbbbd66dU, 0x16163a2cU,\n};\n\nstatic const u32 Td0[256] = {\n 0x51f4a750U, 0x7e416553U, 0x1a17a4c3U, 0x3a275e96U,\n 0x3bab6bcbU, 0x1f9d45f1U, 0xacfa58abU, 0x4be30393U,\n 0x2030fa55U, 0xad766df6U, 0x88cc7691U, 0xf5024c25U,\n 0x4fe5d7fcU, 0xc52acbd7U, 0x26354480U, 0xb562a38fU,\n 0xdeb15a49U, 0x25ba1b67U, 0x45ea0e98U, 0x5dfec0e1U,\n 0xc32f7502U, 0x814cf012U, 0x8d4697a3U, 0x6bd3f9c6U,\n 0x038f5fe7U, 0x15929c95U, 0xbf6d7aebU, 0x955259daU,\n 0xd4be832dU, 0x587421d3U, 0x49e06929U, 0x8ec9c844U,\n 0x75c2896aU, 0xf48e7978U, 0x99583e6bU, 0x27b971ddU,\n 0xbee14fb6U, 0xf088ad17U, 0xc920ac66U, 0x7dce3ab4U,\n 0x63df4a18U, 0xe51a3182U, 0x97513360U, 0x62537f45U,\n 0xb16477e0U, 0xbb6bae84U, 0xfe81a01cU, 0xf9082b94U,\n 0x70486858U, 0x8f45fd19U, 0x94de6c87U, 0x527bf8b7U,\n 0xab73d323U, 0x724b02e2U, 0xe31f8f57U, 0x6655ab2aU,\n 0xb2eb2807U, 0x2fb5c203U, 0x86c57b9aU, 0xd33708a5U,\n 0x302887f2U, 0x23bfa5b2U, 0x02036abaU, 0xed16825cU,\n 0x8acf1c2bU, 0xa779b492U, 0xf307f2f0U, 0x4e69e2a1U,\n 0x65daf4cdU, 0x0605bed5U, 0xd134621fU, 0xc4a6fe8aU,\n 0x342e539dU, 0xa2f355a0U, 0x058ae132U, 0xa4f6eb75U,\n 0x0b83ec39U, 0x4060efaaU, 0x5e719f06U, 0xbd6e1051U,\n 0x3e218af9U, 0x96dd063dU, 0xdd3e05aeU, 0x4de6bd46U,\n 0x91548db5U, 0x71c45d05U, 0x0406d46fU, 0x605015ffU,\n 0x1998fb24U, 0xd6bde997U, 0x894043ccU, 0x67d99e77U,\n 0xb0e842bdU, 0x07898b88U, 0xe7195b38U, 0x79c8eedbU,\n 0xa17c0a47U, 0x7c420fe9U, 0xf8841ec9U, 0x00000000U,\n 0x09808683U, 0x322bed48U, 0x1e1170acU, 0x6c5a724eU,\n 0xfd0efffbU, 0x0f853856U, 0x3daed51eU, 0x362d3927U,\n 0x0a0fd964U, 0x685ca621U, 0x9b5b54d1U, 0x24362e3aU,\n 0x0c0a67b1U, 0x9357e70fU, 0xb4ee96d2U, 0x1b9b919eU,\n 0x80c0c54fU, 0x61dc20a2U, 0x5a774b69U, 0x1c121a16U,\n 0xe293ba0aU, 0xc0a02ae5U, 0x3c22e043U, 0x121b171dU,\n 0x0e090d0bU, 0xf28bc7adU, 0x2db6a8b9U, 0x141ea9c8U,\n 0x57f11985U, 0xaf75074cU, 0xee99ddbbU, 0xa37f60fdU,\n 0xf701269fU, 0x5c72f5bcU, 0x44663bc5U, 0x5bfb7e34U,\n 0x8b432976U, 0xcb23c6dcU, 0xb6edfc68U, 0xb8e4f163U,\n 0xd731dccaU, 0x42638510U, 0x13972240U, 0x84c61120U,\n 0x854a247dU, 0xd2bb3df8U, 0xaef93211U, 0xc729a16dU,\n 0x1d9e2f4bU, 0xdcb230f3U, 0x0d8652ecU, 0x77c1e3d0U,\n 0x2bb3166cU, 0xa970b999U, 0x119448faU, 0x47e96422U,\n 0xa8fc8cc4U, 0xa0f03f1aU, 0x567d2cd8U, 0x223390efU,\n 0x87494ec7U, 0xd938d1c1U, 0x8ccaa2feU, 0x98d40b36U,\n 0xa6f581cfU, 0xa57ade28U, 0xdab78e26U, 0x3fadbfa4U,\n 0x2c3a9de4U, 0x5078920dU, 0x6a5fcc9bU, 0x547e4662U,\n 0xf68d13c2U, 0x90d8b8e8U, 0x2e39f75eU, 0x82c3aff5U,\n 0x9f5d80beU, 0x69d0937cU, 0x6fd52da9U, 0xcf2512b3U,\n 0xc8ac993bU, 0x10187da7U, 0xe89c636eU, 0xdb3bbb7bU,\n 0xcd267809U, 0x6e5918f4U, 0xec9ab701U, 0x834f9aa8U,\n 0xe6956e65U, 0xaaffe67eU, 0x21bccf08U, 0xef15e8e6U,\n 0xbae79bd9U, 0x4a6f36ceU, 0xea9f09d4U, 0x29b07cd6U,\n 0x31a4b2afU, 0x2a3f2331U, 0xc6a59430U, 0x35a266c0U,\n 0x744ebc37U, 0xfc82caa6U, 0xe090d0b0U, 0x33a7d815U,\n 0xf104984aU, 0x41ecdaf7U, 0x7fcd500eU, 0x1791f62fU,\n 0x764dd68dU, 0x43efb04dU, 0xccaa4d54U, 0xe49604dfU,\n 0x9ed1b5e3U, 0x4c6a881bU, 0xc12c1fb8U, 0x4665517fU,\n 0x9d5eea04U, 0x018c355dU, 0xfa877473U, 0xfb0b412eU,\n 0xb3671d5aU, 0x92dbd252U, 0xe9105633U, 0x6dd64713U,\n 0x9ad7618cU, 0x37a10c7aU, 0x59f8148eU, 0xeb133c89U,\n 0xcea927eeU, 0xb761c935U, 0xe11ce5edU, 0x7a47b13cU,\n 0x9cd2df59U, 0x55f2733fU, 0x1814ce79U, 0x73c737bfU,\n 0x53f7cdeaU, 0x5ffdaa5bU, 0xdf3d6f14U, 0x7844db86U,\n 0xcaaff381U, 0xb968c43eU, 0x3824342cU, 0xc2a3405fU,\n 0x161dc372U, 0xbce2250cU, 0x283c498bU, 0xff0d9541U,\n 0x39a80171U, 0x080cb3deU, 0xd8b4e49cU, 0x6456c190U,\n 0x7bcb8461U, 0xd532b670U, 0x486c5c74U, 0xd0b85742U,\n};\nstatic const u32 Td1[256] = {\n 0x5051f4a7U, 0x537e4165U, 0xc31a17a4U, 0x963a275eU,\n 0xcb3bab6bU, 0xf11f9d45U, 0xabacfa58U, 0x934be303U,\n 0x552030faU, 0xf6ad766dU, 0x9188cc76U, 0x25f5024cU,\n 0xfc4fe5d7U, 0xd7c52acbU, 0x80263544U, 0x8fb562a3U,\n 0x49deb15aU, 0x6725ba1bU, 0x9845ea0eU, 0xe15dfec0U,\n 0x02c32f75U, 0x12814cf0U, 0xa38d4697U, 0xc66bd3f9U,\n 0xe7038f5fU, 0x9515929cU, 0xebbf6d7aU, 0xda955259U,\n 0x2dd4be83U, 0xd3587421U, 0x2949e069U, 0x448ec9c8U,\n 0x6a75c289U, 0x78f48e79U, 0x6b99583eU, 0xdd27b971U,\n 0xb6bee14fU, 0x17f088adU, 0x66c920acU, 0xb47dce3aU,\n 0x1863df4aU, 0x82e51a31U, 0x60975133U, 0x4562537fU,\n 0xe0b16477U, 0x84bb6baeU, 0x1cfe81a0U, 0x94f9082bU,\n 0x58704868U, 0x198f45fdU, 0x8794de6cU, 0xb7527bf8U,\n 0x23ab73d3U, 0xe2724b02U, 0x57e31f8fU, 0x2a6655abU,\n 0x07b2eb28U, 0x032fb5c2U, 0x9a86c57bU, 0xa5d33708U,\n 0xf2302887U, 0xb223bfa5U, 0xba02036aU, 0x5ced1682U,\n 0x2b8acf1cU, 0x92a779b4U, 0xf0f307f2U, 0xa14e69e2U,\n 0xcd65daf4U, 0xd50605beU, 0x1fd13462U, 0x8ac4a6feU,\n 0x9d342e53U, 0xa0a2f355U, 0x32058ae1U, 0x75a4f6ebU,\n 0x390b83ecU, 0xaa4060efU, 0x065e719fU, 0x51bd6e10U,\n 0xf93e218aU, 0x3d96dd06U, 0xaedd3e05U, 0x464de6bdU,\n 0xb591548dU, 0x0571c45dU, 0x6f0406d4U, 0xff605015U,\n 0x241998fbU, 0x97d6bde9U, 0xcc894043U, 0x7767d99eU,\n 0xbdb0e842U, 0x8807898bU, 0x38e7195bU, 0xdb79c8eeU,\n 0x47a17c0aU, 0xe97c420fU, 0xc9f8841eU, 0x00000000U,\n 0x83098086U, 0x48322bedU, 0xac1e1170U, 0x4e6c5a72U,\n 0xfbfd0effU, 0x560f8538U, 0x1e3daed5U, 0x27362d39U,\n 0x640a0fd9U, 0x21685ca6U, 0xd19b5b54U, 0x3a24362eU,\n 0xb10c0a67U, 0x0f9357e7U, 0xd2b4ee96U, 0x9e1b9b91U,\n 0x4f80c0c5U, 0xa261dc20U, 0x695a774bU, 0x161c121aU,\n 0x0ae293baU, 0xe5c0a02aU, 0x433c22e0U, 0x1d121b17U,\n 0x0b0e090dU, 0xadf28bc7U, 0xb92db6a8U, 0xc8141ea9U,\n 0x8557f119U, 0x4caf7507U, 0xbbee99ddU, 0xfda37f60U,\n 0x9ff70126U, 0xbc5c72f5U, 0xc544663bU, 0x345bfb7eU,\n 0x768b4329U, 0xdccb23c6U, 0x68b6edfcU, 0x63b8e4f1U,\n 0xcad731dcU, 0x10426385U, 0x40139722U, 0x2084c611U,\n 0x7d854a24U, 0xf8d2bb3dU, 0x11aef932U, 0x6dc729a1U,\n 0x4b1d9e2fU, 0xf3dcb230U, 0xec0d8652U, 0xd077c1e3U,\n 0x6c2bb316U, 0x99a970b9U, 0xfa119448U, 0x2247e964U,\n 0xc4a8fc8cU, 0x1aa0f03fU, 0xd8567d2cU, 0xef223390U,\n 0xc787494eU, 0xc1d938d1U, 0xfe8ccaa2U, 0x3698d40bU,\n 0xcfa6f581U, 0x28a57adeU, 0x26dab78eU, 0xa43fadbfU,\n 0xe42c3a9dU, 0x0d507892U, 0x9b6a5fccU, 0x62547e46U,\n 0xc2f68d13U, 0xe890d8b8U, 0x5e2e39f7U, 0xf582c3afU,\n 0xbe9f5d80U, 0x7c69d093U, 0xa96fd52dU, 0xb3cf2512U,\n 0x3bc8ac99U, 0xa710187dU, 0x6ee89c63U, 0x7bdb3bbbU,\n 0x09cd2678U, 0xf46e5918U, 0x01ec9ab7U, 0xa8834f9aU,\n 0x65e6956eU, 0x7eaaffe6U, 0x0821bccfU, 0xe6ef15e8U,\n 0xd9bae79bU, 0xce4a6f36U, 0xd4ea9f09U, 0xd629b07cU,\n 0xaf31a4b2U, 0x312a3f23U, 0x30c6a594U, 0xc035a266U,\n 0x37744ebcU, 0xa6fc82caU, 0xb0e090d0U, 0x1533a7d8U,\n 0x4af10498U, 0xf741ecdaU, 0x0e7fcd50U, 0x2f1791f6U,\n 0x8d764dd6U, 0x4d43efb0U, 0x54ccaa4dU, 0xdfe49604U,\n 0xe39ed1b5U, 0x1b4c6a88U, 0xb8c12c1fU, 0x7f466551U,\n 0x049d5eeaU, 0x5d018c35U, 0x73fa8774U, 0x2efb0b41U,\n 0x5ab3671dU, 0x5292dbd2U, 0x33e91056U, 0x136dd647U,\n 0x8c9ad761U, 0x7a37a10cU, 0x8e59f814U, 0x89eb133cU,\n 0xeecea927U, 0x35b761c9U, 0xede11ce5U, 0x3c7a47b1U,\n 0x599cd2dfU, 0x3f55f273U, 0x791814ceU, 0xbf73c737U,\n 0xea53f7cdU, 0x5b5ffdaaU, 0x14df3d6fU, 0x867844dbU,\n 0x81caaff3U, 0x3eb968c4U, 0x2c382434U, 0x5fc2a340U,\n 0x72161dc3U, 0x0cbce225U, 0x8b283c49U, 0x41ff0d95U,\n 0x7139a801U, 0xde080cb3U, 0x9cd8b4e4U, 0x906456c1U,\n 0x617bcb84U, 0x70d532b6U, 0x74486c5cU, 0x42d0b857U,\n};\nstatic const u32 Td2[256] = {\n 0xa75051f4U, 0x65537e41U, 0xa4c31a17U, 0x5e963a27U,\n 0x6bcb3babU, 0x45f11f9dU, 0x58abacfaU, 0x03934be3U,\n 0xfa552030U, 0x6df6ad76U, 0x769188ccU, 0x4c25f502U,\n 0xd7fc4fe5U, 0xcbd7c52aU, 0x44802635U, 0xa38fb562U,\n 0x5a49deb1U, 0x1b6725baU, 0x0e9845eaU, 0xc0e15dfeU,\n 0x7502c32fU, 0xf012814cU, 0x97a38d46U, 0xf9c66bd3U,\n 0x5fe7038fU, 0x9c951592U, 0x7aebbf6dU, 0x59da9552U,\n 0x832dd4beU, 0x21d35874U, 0x692949e0U, 0xc8448ec9U,\n 0x896a75c2U, 0x7978f48eU, 0x3e6b9958U, 0x71dd27b9U,\n 0x4fb6bee1U, 0xad17f088U, 0xac66c920U, 0x3ab47dceU,\n 0x4a1863dfU, 0x3182e51aU, 0x33609751U, 0x7f456253U,\n 0x77e0b164U, 0xae84bb6bU, 0xa01cfe81U, 0x2b94f908U,\n 0x68587048U, 0xfd198f45U, 0x6c8794deU, 0xf8b7527bU,\n 0xd323ab73U, 0x02e2724bU, 0x8f57e31fU, 0xab2a6655U,\n 0x2807b2ebU, 0xc2032fb5U, 0x7b9a86c5U, 0x08a5d337U,\n 0x87f23028U, 0xa5b223bfU, 0x6aba0203U, 0x825ced16U,\n 0x1c2b8acfU, 0xb492a779U, 0xf2f0f307U, 0xe2a14e69U,\n 0xf4cd65daU, 0xbed50605U, 0x621fd134U, 0xfe8ac4a6U,\n 0x539d342eU, 0x55a0a2f3U, 0xe132058aU, 0xeb75a4f6U,\n 0xec390b83U, 0xefaa4060U, 0x9f065e71U, 0x1051bd6eU,\n 0x8af93e21U, 0x063d96ddU, 0x05aedd3eU, 0xbd464de6U,\n 0x8db59154U, 0x5d0571c4U, 0xd46f0406U, 0x15ff6050U,\n 0xfb241998U, 0xe997d6bdU, 0x43cc8940U, 0x9e7767d9U,\n 0x42bdb0e8U, 0x8b880789U, 0x5b38e719U, 0xeedb79c8U,\n 0x0a47a17cU, 0x0fe97c42U, 0x1ec9f884U, 0x00000000U,\n 0x86830980U, 0xed48322bU, 0x70ac1e11U, 0x724e6c5aU,\n 0xfffbfd0eU, 0x38560f85U, 0xd51e3daeU, 0x3927362dU,\n 0xd9640a0fU, 0xa621685cU, 0x54d19b5bU, 0x2e3a2436U,\n 0x67b10c0aU, 0xe70f9357U, 0x96d2b4eeU, 0x919e1b9bU,\n 0xc54f80c0U, 0x20a261dcU, 0x4b695a77U, 0x1a161c12U,\n 0xba0ae293U, 0x2ae5c0a0U, 0xe0433c22U, 0x171d121bU,\n 0x0d0b0e09U, 0xc7adf28bU, 0xa8b92db6U, 0xa9c8141eU,\n 0x198557f1U, 0x074caf75U, 0xddbbee99U, 0x60fda37fU,\n 0x269ff701U, 0xf5bc5c72U, 0x3bc54466U, 0x7e345bfbU,\n 0x29768b43U, 0xc6dccb23U, 0xfc68b6edU, 0xf163b8e4U,\n 0xdccad731U, 0x85104263U, 0x22401397U, 0x112084c6U,\n 0x247d854aU, 0x3df8d2bbU, 0x3211aef9U, 0xa16dc729U,\n 0x2f4b1d9eU, 0x30f3dcb2U, 0x52ec0d86U, 0xe3d077c1U,\n 0x166c2bb3U, 0xb999a970U, 0x48fa1194U, 0x642247e9U,\n 0x8cc4a8fcU, 0x3f1aa0f0U, 0x2cd8567dU, 0x90ef2233U,\n 0x4ec78749U, 0xd1c1d938U, 0xa2fe8ccaU, 0x0b3698d4U,\n 0x81cfa6f5U, 0xde28a57aU, 0x8e26dab7U, 0xbfa43fadU,\n 0x9de42c3aU, 0x920d5078U, 0xcc9b6a5fU, 0x4662547eU,\n 0x13c2f68dU, 0xb8e890d8U, 0xf75e2e39U, 0xaff582c3U,\n 0x80be9f5dU, 0x937c69d0U, 0x2da96fd5U, 0x12b3cf25U,\n 0x993bc8acU, 0x7da71018U, 0x636ee89cU, 0xbb7bdb3bU,\n 0x7809cd26U, 0x18f46e59U, 0xb701ec9aU, 0x9aa8834fU,\n 0x6e65e695U, 0xe67eaaffU, 0xcf0821bcU, 0xe8e6ef15U,\n 0x9bd9bae7U, 0x36ce4a6fU, 0x09d4ea9fU, 0x7cd629b0U,\n 0xb2af31a4U, 0x23312a3fU, 0x9430c6a5U, 0x66c035a2U,\n 0xbc37744eU, 0xcaa6fc82U, 0xd0b0e090U, 0xd81533a7U,\n 0x984af104U, 0xdaf741ecU, 0x500e7fcdU, 0xf62f1791U,\n 0xd68d764dU, 0xb04d43efU, 0x4d54ccaaU, 0x04dfe496U,\n 0xb5e39ed1U, 0x881b4c6aU, 0x1fb8c12cU, 0x517f4665U,\n 0xea049d5eU, 0x355d018cU, 0x7473fa87U, 0x412efb0bU,\n 0x1d5ab367U, 0xd25292dbU, 0x5633e910U, 0x47136dd6U,\n 0x618c9ad7U, 0x0c7a37a1U, 0x148e59f8U, 0x3c89eb13U,\n 0x27eecea9U, 0xc935b761U, 0xe5ede11cU, 0xb13c7a47U,\n 0xdf599cd2U, 0x733f55f2U, 0xce791814U, 0x37bf73c7U,\n 0xcdea53f7U, 0xaa5b5ffdU, 0x6f14df3dU, 0xdb867844U,\n 0xf381caafU, 0xc43eb968U, 0x342c3824U, 0x405fc2a3U,\n 0xc372161dU, 0x250cbce2U, 0x498b283cU, 0x9541ff0dU,\n 0x017139a8U, 0xb3de080cU, 0xe49cd8b4U, 0xc1906456U,\n 0x84617bcbU, 0xb670d532U, 0x5c74486cU, 0x5742d0b8U,\n};\nstatic const u32 Td3[256] = {\n 0xf4a75051U, 0x4165537eU, 0x17a4c31aU, 0x275e963aU,\n 0xab6bcb3bU, 0x9d45f11fU, 0xfa58abacU, 0xe303934bU,\n 0x30fa5520U, 0x766df6adU, 0xcc769188U, 0x024c25f5U,\n 0xe5d7fc4fU, 0x2acbd7c5U, 0x35448026U, 0x62a38fb5U,\n 0xb15a49deU, 0xba1b6725U, 0xea0e9845U, 0xfec0e15dU,\n 0x2f7502c3U, 0x4cf01281U, 0x4697a38dU, 0xd3f9c66bU,\n 0x8f5fe703U, 0x929c9515U, 0x6d7aebbfU, 0x5259da95U,\n 0xbe832dd4U, 0x7421d358U, 0xe0692949U, 0xc9c8448eU,\n 0xc2896a75U, 0x8e7978f4U, 0x583e6b99U, 0xb971dd27U,\n 0xe14fb6beU, 0x88ad17f0U, 0x20ac66c9U, 0xce3ab47dU,\n 0xdf4a1863U, 0x1a3182e5U, 0x51336097U, 0x537f4562U,\n 0x6477e0b1U, 0x6bae84bbU, 0x81a01cfeU, 0x082b94f9U,\n 0x48685870U, 0x45fd198fU, 0xde6c8794U, 0x7bf8b752U,\n 0x73d323abU, 0x4b02e272U, 0x1f8f57e3U, 0x55ab2a66U,\n 0xeb2807b2U, 0xb5c2032fU, 0xc57b9a86U, 0x3708a5d3U,\n 0x2887f230U, 0xbfa5b223U, 0x036aba02U, 0x16825cedU,\n 0xcf1c2b8aU, 0x79b492a7U, 0x07f2f0f3U, 0x69e2a14eU,\n 0xdaf4cd65U, 0x05bed506U, 0x34621fd1U, 0xa6fe8ac4U,\n 0x2e539d34U, 0xf355a0a2U, 0x8ae13205U, 0xf6eb75a4U,\n 0x83ec390bU, 0x60efaa40U, 0x719f065eU, 0x6e1051bdU,\n 0x218af93eU, 0xdd063d96U, 0x3e05aeddU, 0xe6bd464dU,\n 0x548db591U, 0xc45d0571U, 0x06d46f04U, 0x5015ff60U,\n 0x98fb2419U, 0xbde997d6U, 0x4043cc89U, 0xd99e7767U,\n 0xe842bdb0U, 0x898b8807U, 0x195b38e7U, 0xc8eedb79U,\n 0x7c0a47a1U, 0x420fe97cU, 0x841ec9f8U, 0x00000000U,\n 0x80868309U, 0x2bed4832U, 0x1170ac1eU, 0x5a724e6cU,\n 0x0efffbfdU, 0x8538560fU, 0xaed51e3dU, 0x2d392736U,\n 0x0fd9640aU, 0x5ca62168U, 0x5b54d19bU, 0x362e3a24U,\n 0x0a67b10cU, 0x57e70f93U, 0xee96d2b4U, 0x9b919e1bU,\n 0xc0c54f80U, 0xdc20a261U, 0x774b695aU, 0x121a161cU,\n 0x93ba0ae2U, 0xa02ae5c0U, 0x22e0433cU, 0x1b171d12U,\n 0x090d0b0eU, 0x8bc7adf2U, 0xb6a8b92dU, 0x1ea9c814U,\n 0xf1198557U, 0x75074cafU, 0x99ddbbeeU, 0x7f60fda3U,\n 0x01269ff7U, 0x72f5bc5cU, 0x663bc544U, 0xfb7e345bU,\n 0x4329768bU, 0x23c6dccbU, 0xedfc68b6U, 0xe4f163b8U,\n 0x31dccad7U, 0x63851042U, 0x97224013U, 0xc6112084U,\n 0x4a247d85U, 0xbb3df8d2U, 0xf93211aeU, 0x29a16dc7U,\n 0x9e2f4b1dU, 0xb230f3dcU, 0x8652ec0dU, 0xc1e3d077U,\n 0xb3166c2bU, 0x70b999a9U, 0x9448fa11U, 0xe9642247U,\n 0xfc8cc4a8U, 0xf03f1aa0U, 0x7d2cd856U, 0x3390ef22U,\n 0x494ec787U, 0x38d1c1d9U, 0xcaa2fe8cU, 0xd40b3698U,\n 0xf581cfa6U, 0x7ade28a5U, 0xb78e26daU, 0xadbfa43fU,\n 0x3a9de42cU, 0x78920d50U, 0x5fcc9b6aU, 0x7e466254U,\n 0x8d13c2f6U, 0xd8b8e890U, 0x39f75e2eU, 0xc3aff582U,\n 0x5d80be9fU, 0xd0937c69U, 0xd52da96fU, 0x2512b3cfU,\n 0xac993bc8U, 0x187da710U, 0x9c636ee8U, 0x3bbb7bdbU,\n 0x267809cdU, 0x5918f46eU, 0x9ab701ecU, 0x4f9aa883U,\n 0x956e65e6U, 0xffe67eaaU, 0xbccf0821U, 0x15e8e6efU,\n 0xe79bd9baU, 0x6f36ce4aU, 0x9f09d4eaU, 0xb07cd629U,\n 0xa4b2af31U, 0x3f23312aU, 0xa59430c6U, 0xa266c035U,\n 0x4ebc3774U, 0x82caa6fcU, 0x90d0b0e0U, 0xa7d81533U,\n 0x04984af1U, 0xecdaf741U, 0xcd500e7fU, 0x91f62f17U,\n 0x4dd68d76U, 0xefb04d43U, 0xaa4d54ccU, 0x9604dfe4U,\n 0xd1b5e39eU, 0x6a881b4cU, 0x2c1fb8c1U, 0x65517f46U,\n 0x5eea049dU, 0x8c355d01U, 0x877473faU, 0x0b412efbU,\n 0x671d5ab3U, 0xdbd25292U, 0x105633e9U, 0xd647136dU,\n 0xd7618c9aU, 0xa10c7a37U, 0xf8148e59U, 0x133c89ebU,\n 0xa927eeceU, 0x61c935b7U, 0x1ce5ede1U, 0x47b13c7aU,\n 0xd2df599cU, 0xf2733f55U, 0x14ce7918U, 0xc737bf73U,\n 0xf7cdea53U, 0xfdaa5b5fU, 0x3d6f14dfU, 0x44db8678U,\n 0xaff381caU, 0x68c43eb9U, 0x24342c38U, 0xa3405fc2U,\n 0x1dc37216U, 0xe2250cbcU, 0x3c498b28U, 0x0d9541ffU,\n 0xa8017139U, 0x0cb3de08U, 0xb4e49cd8U, 0x56c19064U,\n 0xcb84617bU, 0x32b670d5U, 0x6c5c7448U, 0xb85742d0U,\n};\nstatic const u8 Td4[256] = {\n 0x52U, 0x09U, 0x6aU, 0xd5U, 0x30U, 0x36U, 0xa5U, 0x38U,\n 0xbfU, 0x40U, 0xa3U, 0x9eU, 0x81U, 0xf3U, 0xd7U, 0xfbU,\n 0x7cU, 0xe3U, 0x39U, 0x82U, 0x9bU, 0x2fU, 0xffU, 0x87U,\n 0x34U, 0x8eU, 0x43U, 0x44U, 0xc4U, 0xdeU, 0xe9U, 0xcbU,\n 0x54U, 0x7bU, 0x94U, 0x32U, 0xa6U, 0xc2U, 0x23U, 0x3dU,\n 0xeeU, 0x4cU, 0x95U, 0x0bU, 0x42U, 0xfaU, 0xc3U, 0x4eU,\n 0x08U, 0x2eU, 0xa1U, 0x66U, 0x28U, 0xd9U, 0x24U, 0xb2U,\n 0x76U, 0x5bU, 0xa2U, 0x49U, 0x6dU, 0x8bU, 0xd1U, 0x25U,\n 0x72U, 0xf8U, 0xf6U, 0x64U, 0x86U, 0x68U, 0x98U, 0x16U,\n 0xd4U, 0xa4U, 0x5cU, 0xccU, 0x5dU, 0x65U, 0xb6U, 0x92U,\n 0x6cU, 0x70U, 0x48U, 0x50U, 0xfdU, 0xedU, 0xb9U, 0xdaU,\n 0x5eU, 0x15U, 0x46U, 0x57U, 0xa7U, 0x8dU, 0x9dU, 0x84U,\n 0x90U, 0xd8U, 0xabU, 0x00U, 0x8cU, 0xbcU, 0xd3U, 0x0aU,\n 0xf7U, 0xe4U, 0x58U, 0x05U, 0xb8U, 0xb3U, 0x45U, 0x06U,\n 0xd0U, 0x2cU, 0x1eU, 0x8fU, 0xcaU, 0x3fU, 0x0fU, 0x02U,\n 0xc1U, 0xafU, 0xbdU, 0x03U, 0x01U, 0x13U, 0x8aU, 0x6bU,\n 0x3aU, 0x91U, 0x11U, 0x41U, 0x4fU, 0x67U, 0xdcU, 0xeaU,\n 0x97U, 0xf2U, 0xcfU, 0xceU, 0xf0U, 0xb4U, 0xe6U, 0x73U,\n 0x96U, 0xacU, 0x74U, 0x22U, 0xe7U, 0xadU, 0x35U, 0x85U,\n 0xe2U, 0xf9U, 0x37U, 0xe8U, 0x1cU, 0x75U, 0xdfU, 0x6eU,\n 0x47U, 0xf1U, 0x1aU, 0x71U, 0x1dU, 0x29U, 0xc5U, 0x89U,\n 0x6fU, 0xb7U, 0x62U, 0x0eU, 0xaaU, 0x18U, 0xbeU, 0x1bU,\n 0xfcU, 0x56U, 0x3eU, 0x4bU, 0xc6U, 0xd2U, 0x79U, 0x20U,\n 0x9aU, 0xdbU, 0xc0U, 0xfeU, 0x78U, 0xcdU, 0x5aU, 0xf4U,\n 0x1fU, 0xddU, 0xa8U, 0x33U, 0x88U, 0x07U, 0xc7U, 0x31U,\n 0xb1U, 0x12U, 0x10U, 0x59U, 0x27U, 0x80U, 0xecU, 0x5fU,\n 0x60U, 0x51U, 0x7fU, 0xa9U, 0x19U, 0xb5U, 0x4aU, 0x0dU,\n 0x2dU, 0xe5U, 0x7aU, 0x9fU, 0x93U, 0xc9U, 0x9cU, 0xefU,\n 0xa0U, 0xe0U, 0x3bU, 0x4dU, 0xaeU, 0x2aU, 0xf5U, 0xb0U,\n 0xc8U, 0xebU, 0xbbU, 0x3cU, 0x83U, 0x53U, 0x99U, 0x61U,\n 0x17U, 0x2bU, 0x04U, 0x7eU, 0xbaU, 0x77U, 0xd6U, 0x26U,\n 0xe1U, 0x69U, 0x14U, 0x63U, 0x55U, 0x21U, 0x0cU, 0x7dU,\n};\nstatic const u32 rcon[] = {\n 0x01000000, 0x02000000, 0x04000000, 0x08000000,\n 0x10000000, 0x20000000, 0x40000000, 0x80000000,\n 0x1B000000, 0x36000000, /* for 128-bit blocks, Rijndael never uses more than 10 rcon values */\n};\n\n/**\n * Expand the cipher key into the encryption key schedule.\n */\nint AES_set_encrypt_key(const unsigned char *userKey, const int bits,\n AES_KEY *key)\n{\n\n u32 *rk;\n int i = 0;\n u32 temp;\n\n if (!userKey || !key)\n return -1;\n if (bits != 128 && bits != 192 && bits != 256)\n return -2;\n\n rk = key->rd_key;\n\n if (bits == 128)\n key->rounds = 10;\n else if (bits == 192)\n key->rounds = 12;\n else\n key->rounds = 14;\n\n rk[0] = GETU32(userKey );\n rk[1] = GETU32(userKey + 4);\n rk[2] = GETU32(userKey + 8);\n rk[3] = GETU32(userKey + 12);\n if (bits == 128) {\n while (1) {\n temp = rk[3];\n rk[4] = rk[0] ^\n (Te2[(temp >> 16) & 0xff] & 0xff000000) ^\n (Te3[(temp >> 8) & 0xff] & 0x00ff0000) ^\n (Te0[(temp ) & 0xff] & 0x0000ff00) ^\n (Te1[(temp >> 24) ] & 0x000000ff) ^\n rcon[i];\n rk[5] = rk[1] ^ rk[4];\n rk[6] = rk[2] ^ rk[5];\n rk[7] = rk[3] ^ rk[6];\n if (++i == 10) {\n return 0;\n }\n rk += 4;\n }\n }\n rk[4] = GETU32(userKey + 16);\n rk[5] = GETU32(userKey + 20);\n if (bits == 192) {\n while (1) {\n temp = rk[ 5];\n rk[ 6] = rk[ 0] ^\n (Te2[(temp >> 16) & 0xff] & 0xff000000) ^\n (Te3[(temp >> 8) & 0xff] & 0x00ff0000) ^\n (Te0[(temp ) & 0xff] & 0x0000ff00) ^\n (Te1[(temp >> 24) ] & 0x000000ff) ^\n rcon[i];\n rk[ 7] = rk[ 1] ^ rk[ 6];\n rk[ 8] = rk[ 2] ^ rk[ 7];\n rk[ 9] = rk[ 3] ^ rk[ 8];\n if (++i == 8) {\n return 0;\n }\n rk[10] = rk[ 4] ^ rk[ 9];\n rk[11] = rk[ 5] ^ rk[10];\n rk += 6;\n }\n }\n rk[6] = GETU32(userKey + 24);\n rk[7] = GETU32(userKey + 28);\n if (bits == 256) {\n while (1) {\n temp = rk[ 7];\n rk[ 8] = rk[ 0] ^\n (Te2[(temp >> 16) & 0xff] & 0xff000000) ^\n (Te3[(temp >> 8) & 0xff] & 0x00ff0000) ^\n (Te0[(temp ) & 0xff] & 0x0000ff00) ^\n (Te1[(temp >> 24) ] & 0x000000ff) ^\n rcon[i];\n rk[ 9] = rk[ 1] ^ rk[ 8];\n rk[10] = rk[ 2] ^ rk[ 9];\n rk[11] = rk[ 3] ^ rk[10];\n if (++i == 7) {\n return 0;\n }\n temp = rk[11];\n rk[12] = rk[ 4] ^\n (Te2[(temp >> 24) ] & 0xff000000) ^\n (Te3[(temp >> 16) & 0xff] & 0x00ff0000) ^\n (Te0[(temp >> 8) & 0xff] & 0x0000ff00) ^\n (Te1[(temp ) & 0xff] & 0x000000ff);\n rk[13] = rk[ 5] ^ rk[12];\n rk[14] = rk[ 6] ^ rk[13];\n rk[15] = rk[ 7] ^ rk[14];\n\n rk += 8;\n }\n }\n return 0;\n}\n\n/**\n * Expand the cipher key into the decryption key schedule.\n */\nint AES_set_decrypt_key(const unsigned char *userKey, const int bits,\n AES_KEY *key)\n{\n\n u32 *rk;\n int i, j, status;\n u32 temp;\n\n /* first, start with an encryption schedule */\n status = AES_set_encrypt_key(userKey, bits, key);\n if (status < 0)\n return status;\n\n rk = key->rd_key;\n\n /* invert the order of the round keys: */\n for (i = 0, j = 4*(key->rounds); i < j; i += 4, j -= 4) {\n temp = rk[i ]; rk[i ] = rk[j ]; rk[j ] = temp;\n temp = rk[i + 1]; rk[i + 1] = rk[j + 1]; rk[j + 1] = temp;\n temp = rk[i + 2]; rk[i + 2] = rk[j + 2]; rk[j + 2] = temp;\n temp = rk[i + 3]; rk[i + 3] = rk[j + 3]; rk[j + 3] = temp;\n }\n /* apply the inverse MixColumn transform to all round keys but the first and the last: */\n for (i = 1; i < (key->rounds); i++) {\n rk += 4;\n rk[0] =\n Td0[Te1[(rk[0] >> 24) ] & 0xff] ^\n Td1[Te1[(rk[0] >> 16) & 0xff] & 0xff] ^\n Td2[Te1[(rk[0] >> 8) & 0xff] & 0xff] ^\n Td3[Te1[(rk[0] ) & 0xff] & 0xff];\n rk[1] =\n Td0[Te1[(rk[1] >> 24) ] & 0xff] ^\n Td1[Te1[(rk[1] >> 16) & 0xff] & 0xff] ^\n Td2[Te1[(rk[1] >> 8) & 0xff] & 0xff] ^\n Td3[Te1[(rk[1] ) & 0xff] & 0xff];\n rk[2] =\n Td0[Te1[(rk[2] >> 24) ] & 0xff] ^\n Td1[Te1[(rk[2] >> 16) & 0xff] & 0xff] ^\n Td2[Te1[(rk[2] >> 8) & 0xff] & 0xff] ^\n Td3[Te1[(rk[2] ) & 0xff] & 0xff];\n rk[3] =\n Td0[Te1[(rk[3] >> 24) ] & 0xff] ^\n Td1[Te1[(rk[3] >> 16) & 0xff] & 0xff] ^\n Td2[Te1[(rk[3] >> 8) & 0xff] & 0xff] ^\n Td3[Te1[(rk[3] ) & 0xff] & 0xff];\n }\n return 0;\n}\n\n/*\n * Encrypt a single block\n * in and out can overlap\n */\nvoid AES_encrypt(const unsigned char *in, unsigned char *out,\n const AES_KEY *key) {\n\n const u32 *rk;\n u32 s0, s1, s2, s3, t0, t1, t2, t3;\n#ifndef FULL_UNROLL\n int r;\n#endif /* ?FULL_UNROLL */\n\n assert(in && out && key);\n rk = key->rd_key;\n\n /*\n * map byte array block to cipher state\n * and add initial round key:\n */\n s0 = GETU32(in ) ^ rk[0];\n s1 = GETU32(in + 4) ^ rk[1];\n s2 = GETU32(in + 8) ^ rk[2];\n s3 = GETU32(in + 12) ^ rk[3];\n#ifdef FULL_UNROLL\n /* round 1: */\n t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[ 4];\n t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[ 5];\n t2 = Te0[s2 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 & 0xff] ^ rk[ 6];\n t3 = Te0[s3 >> 24] ^ Te1[(s0 >> 16) & 0xff] ^ Te2[(s1 >> 8) & 0xff] ^ Te3[s2 & 0xff] ^ rk[ 7];\n /* round 2: */\n s0 = Te0[t0 >> 24] ^ Te1[(t1 >> 16) & 0xff] ^ Te2[(t2 >> 8) & 0xff] ^ Te3[t3 & 0xff] ^ rk[ 8];\n s1 = Te0[t1 >> 24] ^ Te1[(t2 >> 16) & 0xff] ^ Te2[(t3 >> 8) & 0xff] ^ Te3[t0 & 0xff] ^ rk[ 9];\n s2 = Te0[t2 >> 24] ^ Te1[(t3 >> 16) & 0xff] ^ Te2[(t0 >> 8) & 0xff] ^ Te3[t1 & 0xff] ^ rk[10];\n s3 = Te0[t3 >> 24] ^ Te1[(t0 >> 16) & 0xff] ^ Te2[(t1 >> 8) & 0xff] ^ Te3[t2 & 0xff] ^ rk[11];\n /* round 3: */\n t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[12];\n t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[13];\n t2 = Te0[s2 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 & 0xff] ^ rk[14];\n t3 = Te0[s3 >> 24] ^ Te1[(s0 >> 16) & 0xff] ^ Te2[(s1 >> 8) & 0xff] ^ Te3[s2 & 0xff] ^ rk[15];\n /* round 4: */\n s0 = Te0[t0 >> 24] ^ Te1[(t1 >> 16) & 0xff] ^ Te2[(t2 >> 8) & 0xff] ^ Te3[t3 & 0xff] ^ rk[16];\n s1 = Te0[t1 >> 24] ^ Te1[(t2 >> 16) & 0xff] ^ Te2[(t3 >> 8) & 0xff] ^ Te3[t0 & 0xff] ^ rk[17];\n s2 = Te0[t2 >> 24] ^ Te1[(t3 >> 16) & 0xff] ^ Te2[(t0 >> 8) & 0xff] ^ Te3[t1 & 0xff] ^ rk[18];\n s3 = Te0[t3 >> 24] ^ Te1[(t0 >> 16) & 0xff] ^ Te2[(t1 >> 8) & 0xff] ^ Te3[t2 & 0xff] ^ rk[19];\n /* round 5: */\n t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[20];\n t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[21];\n t2 = Te0[s2 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 & 0xff] ^ rk[22];\n t3 = Te0[s3 >> 24] ^ Te1[(s0 >> 16) & 0xff] ^ Te2[(s1 >> 8) & 0xff] ^ Te3[s2 & 0xff] ^ rk[23];\n /* round 6: */\n s0 = Te0[t0 >> 24] ^ Te1[(t1 >> 16) & 0xff] ^ Te2[(t2 >> 8) & 0xff] ^ Te3[t3 & 0xff] ^ rk[24];\n s1 = Te0[t1 >> 24] ^ Te1[(t2 >> 16) & 0xff] ^ Te2[(t3 >> 8) & 0xff] ^ Te3[t0 & 0xff] ^ rk[25];\n s2 = Te0[t2 >> 24] ^ Te1[(t3 >> 16) & 0xff] ^ Te2[(t0 >> 8) & 0xff] ^ Te3[t1 & 0xff] ^ rk[26];\n s3 = Te0[t3 >> 24] ^ Te1[(t0 >> 16) & 0xff] ^ Te2[(t1 >> 8) & 0xff] ^ Te3[t2 & 0xff] ^ rk[27];\n /* round 7: */\n t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[28];\n t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[29];\n t2 = Te0[s2 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 & 0xff] ^ rk[30];\n t3 = Te0[s3 >> 24] ^ Te1[(s0 >> 16) & 0xff] ^ Te2[(s1 >> 8) & 0xff] ^ Te3[s2 & 0xff] ^ rk[31];\n /* round 8: */\n s0 = Te0[t0 >> 24] ^ Te1[(t1 >> 16) & 0xff] ^ Te2[(t2 >> 8) & 0xff] ^ Te3[t3 & 0xff] ^ rk[32];\n s1 = Te0[t1 >> 24] ^ Te1[(t2 >> 16) & 0xff] ^ Te2[(t3 >> 8) & 0xff] ^ Te3[t0 & 0xff] ^ rk[33];\n s2 = Te0[t2 >> 24] ^ Te1[(t3 >> 16) & 0xff] ^ Te2[(t0 >> 8) & 0xff] ^ Te3[t1 & 0xff] ^ rk[34];\n s3 = Te0[t3 >> 24] ^ Te1[(t0 >> 16) & 0xff] ^ Te2[(t1 >> 8) & 0xff] ^ Te3[t2 & 0xff] ^ rk[35];\n /* round 9: */\n t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[36];\n t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[37];\n t2 = Te0[s2 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 & 0xff] ^ rk[38];\n t3 = Te0[s3 >> 24] ^ Te1[(s0 >> 16) & 0xff] ^ Te2[(s1 >> 8) & 0xff] ^ Te3[s2 & 0xff] ^ rk[39];\n if (key->rounds > 10) {\n /* round 10: */\n s0 = Te0[t0 >> 24] ^ Te1[(t1 >> 16) & 0xff] ^ Te2[(t2 >> 8) & 0xff] ^ Te3[t3 & 0xff] ^ rk[40];\n s1 = Te0[t1 >> 24] ^ Te1[(t2 >> 16) & 0xff] ^ Te2[(t3 >> 8) & 0xff] ^ Te3[t0 & 0xff] ^ rk[41];\n s2 = Te0[t2 >> 24] ^ Te1[(t3 >> 16) & 0xff] ^ Te2[(t0 >> 8) & 0xff] ^ Te3[t1 & 0xff] ^ rk[42];\n s3 = Te0[t3 >> 24] ^ Te1[(t0 >> 16) & 0xff] ^ Te2[(t1 >> 8) & 0xff] ^ Te3[t2 & 0xff] ^ rk[43];\n /* round 11: */\n t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[44];\n t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[45];\n t2 = Te0[s2 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 & 0xff] ^ rk[46];\n t3 = Te0[s3 >> 24] ^ Te1[(s0 >> 16) & 0xff] ^ Te2[(s1 >> 8) & 0xff] ^ Te3[s2 & 0xff] ^ rk[47];\n if (key->rounds > 12) {\n /* round 12: */\n s0 = Te0[t0 >> 24] ^ Te1[(t1 >> 16) & 0xff] ^ Te2[(t2 >> 8) & 0xff] ^ Te3[t3 & 0xff] ^ rk[48];\n s1 = Te0[t1 >> 24] ^ Te1[(t2 >> 16) & 0xff] ^ Te2[(t3 >> 8) & 0xff] ^ Te3[t0 & 0xff] ^ rk[49];\n s2 = Te0[t2 >> 24] ^ Te1[(t3 >> 16) & 0xff] ^ Te2[(t0 >> 8) & 0xff] ^ Te3[t1 & 0xff] ^ rk[50];\n s3 = Te0[t3 >> 24] ^ Te1[(t0 >> 16) & 0xff] ^ Te2[(t1 >> 8) & 0xff] ^ Te3[t2 & 0xff] ^ rk[51];\n /* round 13: */\n t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[52];\n t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[53];\n t2 = Te0[s2 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 & 0xff] ^ rk[54];\n t3 = Te0[s3 >> 24] ^ Te1[(s0 >> 16) & 0xff] ^ Te2[(s1 >> 8) & 0xff] ^ Te3[s2 & 0xff] ^ rk[55];\n }\n }\n rk += key->rounds << 2;\n#else /* !FULL_UNROLL */\n /*\n * Nr - 1 full rounds:\n */\n r = key->rounds >> 1;\n for (;;) {\n t0 =\n Te0[(s0 >> 24) ] ^\n Te1[(s1 >> 16) & 0xff] ^\n Te2[(s2 >> 8) & 0xff] ^\n Te3[(s3 ) & 0xff] ^\n rk[4];\n t1 =\n Te0[(s1 >> 24) ] ^\n Te1[(s2 >> 16) & 0xff] ^\n Te2[(s3 >> 8) & 0xff] ^\n Te3[(s0 ) & 0xff] ^\n rk[5];\n t2 =\n Te0[(s2 >> 24) ] ^\n Te1[(s3 >> 16) & 0xff] ^\n Te2[(s0 >> 8) & 0xff] ^\n Te3[(s1 ) & 0xff] ^\n rk[6];\n t3 =\n Te0[(s3 >> 24) ] ^\n Te1[(s0 >> 16) & 0xff] ^\n Te2[(s1 >> 8) & 0xff] ^\n Te3[(s2 ) & 0xff] ^\n rk[7];\n\n rk += 8;\n if (--r == 0) {\n break;\n }\n\n s0 =\n Te0[(t0 >> 24) ] ^\n Te1[(t1 >> 16) & 0xff] ^\n Te2[(t2 >> 8) & 0xff] ^\n Te3[(t3 ) & 0xff] ^\n rk[0];\n s1 =\n Te0[(t1 >> 24) ] ^\n Te1[(t2 >> 16) & 0xff] ^\n Te2[(t3 >> 8) & 0xff] ^\n Te3[(t0 ) & 0xff] ^\n rk[1];\n s2 =\n Te0[(t2 >> 24) ] ^\n Te1[(t3 >> 16) & 0xff] ^\n Te2[(t0 >> 8) & 0xff] ^\n Te3[(t1 ) & 0xff] ^\n rk[2];\n s3 =\n Te0[(t3 >> 24) ] ^\n Te1[(t0 >> 16) & 0xff] ^\n Te2[(t1 >> 8) & 0xff] ^\n Te3[(t2 ) & 0xff] ^\n rk[3];\n }\n#endif /* ?FULL_UNROLL */\n /*\n * apply last round and\n * map cipher state to byte array block:\n */\n s0 =\n (Te2[(t0 >> 24) ] & 0xff000000) ^\n (Te3[(t1 >> 16) & 0xff] & 0x00ff0000) ^\n (Te0[(t2 >> 8) & 0xff] & 0x0000ff00) ^\n (Te1[(t3 ) & 0xff] & 0x000000ff) ^\n rk[0];\n PUTU32(out , s0);\n s1 =\n (Te2[(t1 >> 24) ] & 0xff000000) ^\n (Te3[(t2 >> 16) & 0xff] & 0x00ff0000) ^\n (Te0[(t3 >> 8) & 0xff] & 0x0000ff00) ^\n (Te1[(t0 ) & 0xff] & 0x000000ff) ^\n rk[1];\n PUTU32(out + 4, s1);\n s2 =\n (Te2[(t2 >> 24) ] & 0xff000000) ^\n (Te3[(t3 >> 16) & 0xff] & 0x00ff0000) ^\n (Te0[(t0 >> 8) & 0xff] & 0x0000ff00) ^\n (Te1[(t1 ) & 0xff] & 0x000000ff) ^\n rk[2];\n PUTU32(out + 8, s2);\n s3 =\n (Te2[(t3 >> 24) ] & 0xff000000) ^\n (Te3[(t0 >> 16) & 0xff] & 0x00ff0000) ^\n (Te0[(t1 >> 8) & 0xff] & 0x0000ff00) ^\n (Te1[(t2 ) & 0xff] & 0x000000ff) ^\n rk[3];\n PUTU32(out + 12, s3);\n}\n\n/*\n * Decrypt a single block\n * in and out can overlap\n */\nvoid AES_decrypt(const unsigned char *in, unsigned char *out,\n const AES_KEY *key)\n{\n\n const u32 *rk;\n u32 s0, s1, s2, s3, t0, t1, t2, t3;\n#ifndef FULL_UNROLL\n int r;\n#endif /* ?FULL_UNROLL */\n\n assert(in && out && key);\n rk = key->rd_key;\n\n /*\n * map byte array block to cipher state\n * and add initial round key:\n */\n s0 = GETU32(in ) ^ rk[0];\n s1 = GETU32(in + 4) ^ rk[1];\n s2 = GETU32(in + 8) ^ rk[2];\n s3 = GETU32(in + 12) ^ rk[3];\n#ifdef FULL_UNROLL\n /* round 1: */\n t0 = Td0[s0 >> 24] ^ Td1[(s3 >> 16) & 0xff] ^ Td2[(s2 >> 8) & 0xff] ^ Td3[s1 & 0xff] ^ rk[ 4];\n t1 = Td0[s1 >> 24] ^ Td1[(s0 >> 16) & 0xff] ^ Td2[(s3 >> 8) & 0xff] ^ Td3[s2 & 0xff] ^ rk[ 5];\n t2 = Td0[s2 >> 24] ^ Td1[(s1 >> 16) & 0xff] ^ Td2[(s0 >> 8) & 0xff] ^ Td3[s3 & 0xff] ^ rk[ 6];\n t3 = Td0[s3 >> 24] ^ Td1[(s2 >> 16) & 0xff] ^ Td2[(s1 >> 8) & 0xff] ^ Td3[s0 & 0xff] ^ rk[ 7];\n /* round 2: */\n s0 = Td0[t0 >> 24] ^ Td1[(t3 >> 16) & 0xff] ^ Td2[(t2 >> 8) & 0xff] ^ Td3[t1 & 0xff] ^ rk[ 8];\n s1 = Td0[t1 >> 24] ^ Td1[(t0 >> 16) & 0xff] ^ Td2[(t3 >> 8) & 0xff] ^ Td3[t2 & 0xff] ^ rk[ 9];\n s2 = Td0[t2 >> 24] ^ Td1[(t1 >> 16) & 0xff] ^ Td2[(t0 >> 8) & 0xff] ^ Td3[t3 & 0xff] ^ rk[10];\n s3 = Td0[t3 >> 24] ^ Td1[(t2 >> 16) & 0xff] ^ Td2[(t1 >> 8) & 0xff] ^ Td3[t0 & 0xff] ^ rk[11];\n /* round 3: */\n t0 = Td0[s0 >> 24] ^ Td1[(s3 >> 16) & 0xff] ^ Td2[(s2 >> 8) & 0xff] ^ Td3[s1 & 0xff] ^ rk[12];\n t1 = Td0[s1 >> 24] ^ Td1[(s0 >> 16) & 0xff] ^ Td2[(s3 >> 8) & 0xff] ^ Td3[s2 & 0xff] ^ rk[13];\n t2 = Td0[s2 >> 24] ^ Td1[(s1 >> 16) & 0xff] ^ Td2[(s0 >> 8) & 0xff] ^ Td3[s3 & 0xff] ^ rk[14];\n t3 = Td0[s3 >> 24] ^ Td1[(s2 >> 16) & 0xff] ^ Td2[(s1 >> 8) & 0xff] ^ Td3[s0 & 0xff] ^ rk[15];\n /* round 4: */\n s0 = Td0[t0 >> 24] ^ Td1[(t3 >> 16) & 0xff] ^ Td2[(t2 >> 8) & 0xff] ^ Td3[t1 & 0xff] ^ rk[16];\n s1 = Td0[t1 >> 24] ^ Td1[(t0 >> 16) & 0xff] ^ Td2[(t3 >> 8) & 0xff] ^ Td3[t2 & 0xff] ^ rk[17];\n s2 = Td0[t2 >> 24] ^ Td1[(t1 >> 16) & 0xff] ^ Td2[(t0 >> 8) & 0xff] ^ Td3[t3 & 0xff] ^ rk[18];\n s3 = Td0[t3 >> 24] ^ Td1[(t2 >> 16) & 0xff] ^ Td2[(t1 >> 8) & 0xff] ^ Td3[t0 & 0xff] ^ rk[19];\n /* round 5: */\n t0 = Td0[s0 >> 24] ^ Td1[(s3 >> 16) & 0xff] ^ Td2[(s2 >> 8) & 0xff] ^ Td3[s1 & 0xff] ^ rk[20];\n t1 = Td0[s1 >> 24] ^ Td1[(s0 >> 16) & 0xff] ^ Td2[(s3 >> 8) & 0xff] ^ Td3[s2 & 0xff] ^ rk[21];\n t2 = Td0[s2 >> 24] ^ Td1[(s1 >> 16) & 0xff] ^ Td2[(s0 >> 8) & 0xff] ^ Td3[s3 & 0xff] ^ rk[22];\n t3 = Td0[s3 >> 24] ^ Td1[(s2 >> 16) & 0xff] ^ Td2[(s1 >> 8) & 0xff] ^ Td3[s0 & 0xff] ^ rk[23];\n /* round 6: */\n s0 = Td0[t0 >> 24] ^ Td1[(t3 >> 16) & 0xff] ^ Td2[(t2 >> 8) & 0xff] ^ Td3[t1 & 0xff] ^ rk[24];\n s1 = Td0[t1 >> 24] ^ Td1[(t0 >> 16) & 0xff] ^ Td2[(t3 >> 8) & 0xff] ^ Td3[t2 & 0xff] ^ rk[25];\n s2 = Td0[t2 >> 24] ^ Td1[(t1 >> 16) & 0xff] ^ Td2[(t0 >> 8) & 0xff] ^ Td3[t3 & 0xff] ^ rk[26];\n s3 = Td0[t3 >> 24] ^ Td1[(t2 >> 16) & 0xff] ^ Td2[(t1 >> 8) & 0xff] ^ Td3[t0 & 0xff] ^ rk[27];\n /* round 7: */\n t0 = Td0[s0 >> 24] ^ Td1[(s3 >> 16) & 0xff] ^ Td2[(s2 >> 8) & 0xff] ^ Td3[s1 & 0xff] ^ rk[28];\n t1 = Td0[s1 >> 24] ^ Td1[(s0 >> 16) & 0xff] ^ Td2[(s3 >> 8) & 0xff] ^ Td3[s2 & 0xff] ^ rk[29];\n t2 = Td0[s2 >> 24] ^ Td1[(s1 >> 16) & 0xff] ^ Td2[(s0 >> 8) & 0xff] ^ Td3[s3 & 0xff] ^ rk[30];\n t3 = Td0[s3 >> 24] ^ Td1[(s2 >> 16) & 0xff] ^ Td2[(s1 >> 8) & 0xff] ^ Td3[s0 & 0xff] ^ rk[31];\n /* round 8: */\n s0 = Td0[t0 >> 24] ^ Td1[(t3 >> 16) & 0xff] ^ Td2[(t2 >> 8) & 0xff] ^ Td3[t1 & 0xff] ^ rk[32];\n s1 = Td0[t1 >> 24] ^ Td1[(t0 >> 16) & 0xff] ^ Td2[(t3 >> 8) & 0xff] ^ Td3[t2 & 0xff] ^ rk[33];\n s2 = Td0[t2 >> 24] ^ Td1[(t1 >> 16) & 0xff] ^ Td2[(t0 >> 8) & 0xff] ^ Td3[t3 & 0xff] ^ rk[34];\n s3 = Td0[t3 >> 24] ^ Td1[(t2 >> 16) & 0xff] ^ Td2[(t1 >> 8) & 0xff] ^ Td3[t0 & 0xff] ^ rk[35];\n /* round 9: */\n t0 = Td0[s0 >> 24] ^ Td1[(s3 >> 16) & 0xff] ^ Td2[(s2 >> 8) & 0xff] ^ Td3[s1 & 0xff] ^ rk[36];\n t1 = Td0[s1 >> 24] ^ Td1[(s0 >> 16) & 0xff] ^ Td2[(s3 >> 8) & 0xff] ^ Td3[s2 & 0xff] ^ rk[37];\n t2 = Td0[s2 >> 24] ^ Td1[(s1 >> 16) & 0xff] ^ Td2[(s0 >> 8) & 0xff] ^ Td3[s3 & 0xff] ^ rk[38];\n t3 = Td0[s3 >> 24] ^ Td1[(s2 >> 16) & 0xff] ^ Td2[(s1 >> 8) & 0xff] ^ Td3[s0 & 0xff] ^ rk[39];\n if (key->rounds > 10) {\n /* round 10: */\n s0 = Td0[t0 >> 24] ^ Td1[(t3 >> 16) & 0xff] ^ Td2[(t2 >> 8) & 0xff] ^ Td3[t1 & 0xff] ^ rk[40];\n s1 = Td0[t1 >> 24] ^ Td1[(t0 >> 16) & 0xff] ^ Td2[(t3 >> 8) & 0xff] ^ Td3[t2 & 0xff] ^ rk[41];\n s2 = Td0[t2 >> 24] ^ Td1[(t1 >> 16) & 0xff] ^ Td2[(t0 >> 8) & 0xff] ^ Td3[t3 & 0xff] ^ rk[42];\n s3 = Td0[t3 >> 24] ^ Td1[(t2 >> 16) & 0xff] ^ Td2[(t1 >> 8) & 0xff] ^ Td3[t0 & 0xff] ^ rk[43];\n /* round 11: */\n t0 = Td0[s0 >> 24] ^ Td1[(s3 >> 16) & 0xff] ^ Td2[(s2 >> 8) & 0xff] ^ Td3[s1 & 0xff] ^ rk[44];\n t1 = Td0[s1 >> 24] ^ Td1[(s0 >> 16) & 0xff] ^ Td2[(s3 >> 8) & 0xff] ^ Td3[s2 & 0xff] ^ rk[45];\n t2 = Td0[s2 >> 24] ^ Td1[(s1 >> 16) & 0xff] ^ Td2[(s0 >> 8) & 0xff] ^ Td3[s3 & 0xff] ^ rk[46];\n t3 = Td0[s3 >> 24] ^ Td1[(s2 >> 16) & 0xff] ^ Td2[(s1 >> 8) & 0xff] ^ Td3[s0 & 0xff] ^ rk[47];\n if (key->rounds > 12) {\n /* round 12: */\n s0 = Td0[t0 >> 24] ^ Td1[(t3 >> 16) & 0xff] ^ Td2[(t2 >> 8) & 0xff] ^ Td3[t1 & 0xff] ^ rk[48];\n s1 = Td0[t1 >> 24] ^ Td1[(t0 >> 16) & 0xff] ^ Td2[(t3 >> 8) & 0xff] ^ Td3[t2 & 0xff] ^ rk[49];\n s2 = Td0[t2 >> 24] ^ Td1[(t1 >> 16) & 0xff] ^ Td2[(t0 >> 8) & 0xff] ^ Td3[t3 & 0xff] ^ rk[50];\n s3 = Td0[t3 >> 24] ^ Td1[(t2 >> 16) & 0xff] ^ Td2[(t1 >> 8) & 0xff] ^ Td3[t0 & 0xff] ^ rk[51];\n /* round 13: */\n t0 = Td0[s0 >> 24] ^ Td1[(s3 >> 16) & 0xff] ^ Td2[(s2 >> 8) & 0xff] ^ Td3[s1 & 0xff] ^ rk[52];\n t1 = Td0[s1 >> 24] ^ Td1[(s0 >> 16) & 0xff] ^ Td2[(s3 >> 8) & 0xff] ^ Td3[s2 & 0xff] ^ rk[53];\n t2 = Td0[s2 >> 24] ^ Td1[(s1 >> 16) & 0xff] ^ Td2[(s0 >> 8) & 0xff] ^ Td3[s3 & 0xff] ^ rk[54];\n t3 = Td0[s3 >> 24] ^ Td1[(s2 >> 16) & 0xff] ^ Td2[(s1 >> 8) & 0xff] ^ Td3[s0 & 0xff] ^ rk[55];\n }\n }\n rk += key->rounds << 2;\n#else /* !FULL_UNROLL */\n /*\n * Nr - 1 full rounds:\n */\n r = key->rounds >> 1;\n for (;;) {\n t0 =\n Td0[(s0 >> 24) ] ^\n Td1[(s3 >> 16) & 0xff] ^\n Td2[(s2 >> 8) & 0xff] ^\n Td3[(s1 ) & 0xff] ^\n rk[4];\n t1 =\n Td0[(s1 >> 24) ] ^\n Td1[(s0 >> 16) & 0xff] ^\n Td2[(s3 >> 8) & 0xff] ^\n Td3[(s2 ) & 0xff] ^\n rk[5];\n t2 =\n Td0[(s2 >> 24) ] ^\n Td1[(s1 >> 16) & 0xff] ^\n Td2[(s0 >> 8) & 0xff] ^\n Td3[(s3 ) & 0xff] ^\n rk[6];\n t3 =\n Td0[(s3 >> 24) ] ^\n Td1[(s2 >> 16) & 0xff] ^\n Td2[(s1 >> 8) & 0xff] ^\n Td3[(s0 ) & 0xff] ^\n rk[7];\n\n rk += 8;\n if (--r == 0) {\n break;\n }\n\n s0 =\n Td0[(t0 >> 24) ] ^\n Td1[(t3 >> 16) & 0xff] ^\n Td2[(t2 >> 8) & 0xff] ^\n Td3[(t1 ) & 0xff] ^\n rk[0];\n s1 =\n Td0[(t1 >> 24) ] ^\n Td1[(t0 >> 16) & 0xff] ^\n Td2[(t3 >> 8) & 0xff] ^\n Td3[(t2 ) & 0xff] ^\n rk[1];\n s2 =\n Td0[(t2 >> 24) ] ^\n Td1[(t1 >> 16) & 0xff] ^\n Td2[(t0 >> 8) & 0xff] ^\n Td3[(t3 ) & 0xff] ^\n rk[2];\n s3 =\n Td0[(t3 >> 24) ] ^\n Td1[(t2 >> 16) & 0xff] ^\n Td2[(t1 >> 8) & 0xff] ^\n Td3[(t0 ) & 0xff] ^\n rk[3];\n }\n#endif /* ?FULL_UNROLL */\n /*\n * apply last round and\n * map cipher state to byte array block:\n */\n s0 =\n ((u32)Td4[(t0 >> 24) ] << 24) ^\n ((u32)Td4[(t3 >> 16) & 0xff] << 16) ^\n ((u32)Td4[(t2 >> 8) & 0xff] << 8) ^\n ((u32)Td4[(t1 ) & 0xff]) ^\n rk[0];\n PUTU32(out , s0);\n s1 =\n ((u32)Td4[(t1 >> 24) ] << 24) ^\n ((u32)Td4[(t0 >> 16) & 0xff] << 16) ^\n ((u32)Td4[(t3 >> 8) & 0xff] << 8) ^\n ((u32)Td4[(t2 ) & 0xff]) ^\n rk[1];\n PUTU32(out + 4, s1);\n s2 =\n ((u32)Td4[(t2 >> 24) ] << 24) ^\n ((u32)Td4[(t1 >> 16) & 0xff] << 16) ^\n ((u32)Td4[(t0 >> 8) & 0xff] << 8) ^\n ((u32)Td4[(t3 ) & 0xff]) ^\n rk[2];\n PUTU32(out + 8, s2);\n s3 =\n ((u32)Td4[(t3 >> 24) ] << 24) ^\n ((u32)Td4[(t2 >> 16) & 0xff] << 16) ^\n ((u32)Td4[(t1 >> 8) & 0xff] << 8) ^\n ((u32)Td4[(t0 ) & 0xff]) ^\n rk[3];\n PUTU32(out + 12, s3);\n}\n\n#else /* AES_ASM */\n\nstatic const u8 Te4[256] = {\n 0x63U, 0x7cU, 0x77U, 0x7bU, 0xf2U, 0x6bU, 0x6fU, 0xc5U,\n 0x30U, 0x01U, 0x67U, 0x2bU, 0xfeU, 0xd7U, 0xabU, 0x76U,\n 0xcaU, 0x82U, 0xc9U, 0x7dU, 0xfaU, 0x59U, 0x47U, 0xf0U,\n 0xadU, 0xd4U, 0xa2U, 0xafU, 0x9cU, 0xa4U, 0x72U, 0xc0U,\n 0xb7U, 0xfdU, 0x93U, 0x26U, 0x36U, 0x3fU, 0xf7U, 0xccU,\n 0x34U, 0xa5U, 0xe5U, 0xf1U, 0x71U, 0xd8U, 0x31U, 0x15U,\n 0x04U, 0xc7U, 0x23U, 0xc3U, 0x18U, 0x96U, 0x05U, 0x9aU,\n 0x07U, 0x12U, 0x80U, 0xe2U, 0xebU, 0x27U, 0xb2U, 0x75U,\n 0x09U, 0x83U, 0x2cU, 0x1aU, 0x1bU, 0x6eU, 0x5aU, 0xa0U,\n 0x52U, 0x3bU, 0xd6U, 0xb3U, 0x29U, 0xe3U, 0x2fU, 0x84U,\n 0x53U, 0xd1U, 0x00U, 0xedU, 0x20U, 0xfcU, 0xb1U, 0x5bU,\n 0x6aU, 0xcbU, 0xbeU, 0x39U, 0x4aU, 0x4cU, 0x58U, 0xcfU,\n 0xd0U, 0xefU, 0xaaU, 0xfbU, 0x43U, 0x4dU, 0x33U, 0x85U,\n 0x45U, 0xf9U, 0x02U, 0x7fU, 0x50U, 0x3cU, 0x9fU, 0xa8U,\n 0x51U, 0xa3U, 0x40U, 0x8fU, 0x92U, 0x9dU, 0x38U, 0xf5U,\n 0xbcU, 0xb6U, 0xdaU, 0x21U, 0x10U, 0xffU, 0xf3U, 0xd2U,\n 0xcdU, 0x0cU, 0x13U, 0xecU, 0x5fU, 0x97U, 0x44U, 0x17U,\n 0xc4U, 0xa7U, 0x7eU, 0x3dU, 0x64U, 0x5dU, 0x19U, 0x73U,\n 0x60U, 0x81U, 0x4fU, 0xdcU, 0x22U, 0x2aU, 0x90U, 0x88U,\n 0x46U, 0xeeU, 0xb8U, 0x14U, 0xdeU, 0x5eU, 0x0bU, 0xdbU,\n 0xe0U, 0x32U, 0x3aU, 0x0aU, 0x49U, 0x06U, 0x24U, 0x5cU,\n 0xc2U, 0xd3U, 0xacU, 0x62U, 0x91U, 0x95U, 0xe4U, 0x79U,\n 0xe7U, 0xc8U, 0x37U, 0x6dU, 0x8dU, 0xd5U, 0x4eU, 0xa9U,\n 0x6cU, 0x56U, 0xf4U, 0xeaU, 0x65U, 0x7aU, 0xaeU, 0x08U,\n 0xbaU, 0x78U, 0x25U, 0x2eU, 0x1cU, 0xa6U, 0xb4U, 0xc6U,\n 0xe8U, 0xddU, 0x74U, 0x1fU, 0x4bU, 0xbdU, 0x8bU, 0x8aU,\n 0x70U, 0x3eU, 0xb5U, 0x66U, 0x48U, 0x03U, 0xf6U, 0x0eU,\n 0x61U, 0x35U, 0x57U, 0xb9U, 0x86U, 0xc1U, 0x1dU, 0x9eU,\n 0xe1U, 0xf8U, 0x98U, 0x11U, 0x69U, 0xd9U, 0x8eU, 0x94U,\n 0x9bU, 0x1eU, 0x87U, 0xe9U, 0xceU, 0x55U, 0x28U, 0xdfU,\n 0x8cU, 0xa1U, 0x89U, 0x0dU, 0xbfU, 0xe6U, 0x42U, 0x68U,\n 0x41U, 0x99U, 0x2dU, 0x0fU, 0xb0U, 0x54U, 0xbbU, 0x16U\n};\nstatic const u32 rcon[] = {\n 0x01000000, 0x02000000, 0x04000000, 0x08000000,\n 0x10000000, 0x20000000, 0x40000000, 0x80000000,\n 0x1B000000, 0x36000000, /* for 128-bit blocks, Rijndael never uses more than 10 rcon values */\n};\n\n/**\n * Expand the cipher key into the encryption key schedule.\n */\nint AES_set_encrypt_key(const unsigned char *userKey, const int bits,\n AES_KEY *key)\n{\n u32 *rk;\n int i = 0;\n u32 temp;\n\n if (!userKey || !key)\n return -1;\n if (bits != 128 && bits != 192 && bits != 256)\n return -2;\n\n rk = key->rd_key;\n\n if (bits == 128)\n key->rounds = 10;\n else if (bits == 192)\n key->rounds = 12;\n else\n key->rounds = 14;\n\n rk[0] = GETU32(userKey );\n rk[1] = GETU32(userKey + 4);\n rk[2] = GETU32(userKey + 8);\n rk[3] = GETU32(userKey + 12);\n if (bits == 128) {\n while (1) {\n temp = rk[3];\n rk[4] = rk[0] ^\n ((u32)Te4[(temp >> 16) & 0xff] << 24) ^\n ((u32)Te4[(temp >> 8) & 0xff] << 16) ^\n ((u32)Te4[(temp ) & 0xff] << 8) ^\n ((u32)Te4[(temp >> 24) ]) ^\n rcon[i];\n rk[5] = rk[1] ^ rk[4];\n rk[6] = rk[2] ^ rk[5];\n rk[7] = rk[3] ^ rk[6];\n if (++i == 10) {\n return 0;\n }\n rk += 4;\n }\n }\n rk[4] = GETU32(userKey + 16);\n rk[5] = GETU32(userKey + 20);\n if (bits == 192) {\n while (1) {\n temp = rk[ 5];\n rk[ 6] = rk[ 0] ^\n ((u32)Te4[(temp >> 16) & 0xff] << 24) ^\n ((u32)Te4[(temp >> 8) & 0xff] << 16) ^\n ((u32)Te4[(temp ) & 0xff] << 8) ^\n ((u32)Te4[(temp >> 24) ]) ^\n rcon[i];\n rk[ 7] = rk[ 1] ^ rk[ 6];\n rk[ 8] = rk[ 2] ^ rk[ 7];\n rk[ 9] = rk[ 3] ^ rk[ 8];\n if (++i == 8) {\n return 0;\n }\n rk[10] = rk[ 4] ^ rk[ 9];\n rk[11] = rk[ 5] ^ rk[10];\n rk += 6;\n }\n }\n rk[6] = GETU32(userKey + 24);\n rk[7] = GETU32(userKey + 28);\n if (bits == 256) {\n while (1) {\n temp = rk[ 7];\n rk[ 8] = rk[ 0] ^\n ((u32)Te4[(temp >> 16) & 0xff] << 24) ^\n ((u32)Te4[(temp >> 8) & 0xff] << 16) ^\n ((u32)Te4[(temp ) & 0xff] << 8) ^\n ((u32)Te4[(temp >> 24) ]) ^\n rcon[i];\n rk[ 9] = rk[ 1] ^ rk[ 8];\n rk[10] = rk[ 2] ^ rk[ 9];\n rk[11] = rk[ 3] ^ rk[10];\n if (++i == 7) {\n return 0;\n }\n temp = rk[11];\n rk[12] = rk[ 4] ^\n ((u32)Te4[(temp >> 24) ] << 24) ^\n ((u32)Te4[(temp >> 16) & 0xff] << 16) ^\n ((u32)Te4[(temp >> 8) & 0xff] << 8) ^\n ((u32)Te4[(temp ) & 0xff]);\n rk[13] = rk[ 5] ^ rk[12];\n rk[14] = rk[ 6] ^ rk[13];\n rk[15] = rk[ 7] ^ rk[14];\n\n rk += 8;\n }\n }\n return 0;\n}\n\n/**\n * Expand the cipher key into the decryption key schedule.\n */\nint AES_set_decrypt_key(const unsigned char *userKey, const int bits,\n AES_KEY *key)\n{\n\n u32 *rk;\n int i, j, status;\n u32 temp;\n\n /* first, start with an encryption schedule */\n status = AES_set_encrypt_key(userKey, bits, key);\n if (status < 0)\n return status;\n\n rk = key->rd_key;\n\n /* invert the order of the round keys: */\n for (i = 0, j = 4*(key->rounds); i < j; i += 4, j -= 4) {\n temp = rk[i ]; rk[i ] = rk[j ]; rk[j ] = temp;\n temp = rk[i + 1]; rk[i + 1] = rk[j + 1]; rk[j + 1] = temp;\n temp = rk[i + 2]; rk[i + 2] = rk[j + 2]; rk[j + 2] = temp;\n temp = rk[i + 3]; rk[i + 3] = rk[j + 3]; rk[j + 3] = temp;\n }\n /* apply the inverse MixColumn transform to all round keys but the first and the last: */\n for (i = 1; i < (key->rounds); i++) {\n rk += 4;\n for (j = 0; j < 4; j++) {\n u32 tp1, tp2, tp4, tp8, tp9, tpb, tpd, tpe, m;\n\n tp1 = rk[j];\n m = tp1 & 0x80808080;\n tp2 = ((tp1 & 0x7f7f7f7f) << 1) ^\n ((m - (m >> 7)) & 0x1b1b1b1b);\n m = tp2 & 0x80808080;\n tp4 = ((tp2 & 0x7f7f7f7f) << 1) ^\n ((m - (m >> 7)) & 0x1b1b1b1b);\n m = tp4 & 0x80808080;\n tp8 = ((tp4 & 0x7f7f7f7f) << 1) ^\n ((m - (m >> 7)) & 0x1b1b1b1b);\n tp9 = tp8 ^ tp1;\n tpb = tp9 ^ tp2;\n tpd = tp9 ^ tp4;\n tpe = tp8 ^ tp4 ^ tp2;\n#if defined(ROTATE)\n rk[j] = tpe ^ ROTATE(tpd,16) ^\n ROTATE(tp9,24) ^ ROTATE(tpb,8);\n#else\n rk[j] = tpe ^ (tpd >> 16) ^ (tpd << 16) ^\n (tp9 >> 8) ^ (tp9 << 24) ^\n (tpb >> 24) ^ (tpb << 8);\n#endif\n }\n }\n return 0;\n}\n\n#endif /* AES_ASM */\n" }, { "path": "cryptomini/aes/aes_local.h", "content": "/*\n * Copyright 2002-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_AES_LOCAL_H\n# define OSSL_CRYPTO_AES_LOCAL_H\n\n# include \n# include \n# include \n# include \n\n# if defined(_MSC_VER) && (defined(_M_IX86) || defined(_M_AMD64) || defined(_M_X64))\n# define SWAP(x) (_lrotl(x, 8) & 0x00ff00ff | _lrotr(x, 8) & 0xff00ff00)\n# define GETU32(p) SWAP(*((u32 *)(p)))\n# define PUTU32(ct, st) { *((u32 *)(ct)) = SWAP((st)); }\n# else\n# define GETU32(pt) (((u32)(pt)[0] << 24) ^ ((u32)(pt)[1] << 16) ^ ((u32)(pt)[2] << 8) ^ ((u32)(pt)[3]))\n# define PUTU32(ct, st) { (ct)[0] = (u8)((st) >> 24); (ct)[1] = (u8)((st) >> 16); (ct)[2] = (u8)((st) >> 8); (ct)[3] = (u8)(st); }\n# endif\n\ntypedef unsigned long long u64;\n# ifdef AES_LONG\ntypedef unsigned long u32;\n# else\ntypedef unsigned int u32;\n# endif\ntypedef unsigned short u16;\ntypedef unsigned char u8;\n\n# define MAXKC (256/32)\n# define MAXKB (256/8)\n# define MAXNR 14\n\n/* This controls loop-unrolling in aes_core.c */\n# undef FULL_UNROLL\n\n#endif /* !OSSL_CRYPTO_AES_LOCAL_H */\n" }, { "path": "cryptomini/bn/README.pod", "content": "=pod\n\n=head1 NAME\n\nbn_mul_words, bn_mul_add_words, bn_sqr_words, bn_div_words,\nbn_add_words, bn_sub_words, bn_mul_comba4, bn_mul_comba8,\nbn_sqr_comba4, bn_sqr_comba8, bn_cmp_words, bn_mul_normal,\nbn_mul_low_normal, bn_mul_recursive, bn_mul_part_recursive,\nbn_mul_low_recursive, bn_sqr_normal, bn_sqr_recursive,\nbn_expand, bn_wexpand, bn_expand2, bn_fix_top, bn_check_top,\nbn_print, bn_dump, bn_set_max, bn_set_high, bn_set_low - BIGNUM\nlibrary internal functions\n\n=head1 SYNOPSIS\n\n #include \n\n BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w);\n BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num,\n BN_ULONG w);\n void bn_sqr_words(BN_ULONG *rp, BN_ULONG *ap, int num);\n BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);\n BN_ULONG bn_add_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,\n int num);\n BN_ULONG bn_sub_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,\n int num);\n\n void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b);\n void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b);\n void bn_sqr_comba4(BN_ULONG *r, BN_ULONG *a);\n void bn_sqr_comba8(BN_ULONG *r, BN_ULONG *a);\n\n int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n);\n\n void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b,\n int nb);\n void bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n);\n void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,\n int dna, int dnb, BN_ULONG *tmp);\n void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b,\n int n, int tna, int tnb, BN_ULONG *tmp);\n void bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b,\n int n2, BN_ULONG *tmp);\n\n void bn_sqr_normal(BN_ULONG *r, BN_ULONG *a, int n, BN_ULONG *tmp);\n void bn_sqr_recursive(BN_ULONG *r, BN_ULONG *a, int n2, BN_ULONG *tmp);\n\n void mul(BN_ULONG r, BN_ULONG a, BN_ULONG w, BN_ULONG c);\n void mul_add(BN_ULONG r, BN_ULONG a, BN_ULONG w, BN_ULONG c);\n void sqr(BN_ULONG r0, BN_ULONG r1, BN_ULONG a);\n\n BIGNUM *bn_expand(BIGNUM *a, int bits);\n BIGNUM *bn_wexpand(BIGNUM *a, int n);\n BIGNUM *bn_expand2(BIGNUM *a, int n);\n void bn_fix_top(BIGNUM *a);\n\n void bn_check_top(BIGNUM *a);\n void bn_print(BIGNUM *a);\n void bn_dump(BN_ULONG *d, int n);\n void bn_set_max(BIGNUM *a);\n void bn_set_high(BIGNUM *r, BIGNUM *a, int n);\n void bn_set_low(BIGNUM *r, BIGNUM *a, int n);\n\n=head1 DESCRIPTION\n\nThis page documents the internal functions used by the OpenSSL\nB implementation. They are described here to facilitate\ndebugging and extending the library. They are I to be used by\napplications.\n\n=head2 The BIGNUM structure\n\n typedef struct bignum_st BIGNUM;\n\n struct bignum_st\n {\n BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit chunks. */\n int top; /* Index of last used d +1. */\n /* The next are internal book keeping for bn_expand. */\n int dmax; /* Size of the d array. */\n int neg; /* one if the number is negative */\n int flags;\n };\n\n\nThe integer value is stored in B, a malloc()ed array of words (B),\nleast significant word first. A B can be either 16, 32 or 64 bits\nin size, depending on the 'number of bits' (B) specified in\nC.\n\nB is the size of the B array that has been allocated. B\nis the number of words being used, so for a value of 4, bn.d[0]=4 and\nbn.top=1. B is 1 if the number is negative. When a B is\nB<0>, the B field can be B and B == B<0>.\n\nB is a bit field of flags which are defined in C. The\nflags begin with B. The macros BN_set_flags(b, n) and\nBN_get_flags(b, n) exist to enable or fetch flag(s) B from B\nstructure B.\n\nVarious routines in this library require the use of temporary\nB variables during their execution. Since dynamic memory\nallocation to create Bs is rather expensive when used in\nconjunction with repeated subroutine calls, the B structure is\nused. This structure contains B Bs, see\nL.\n\n=head2 Low-level arithmetic operations\n\nThese functions are implemented in C and for several platforms in\nassembly language:\n\nbn_mul_words(B, B, B, B) operates on the B word\narrays B and B. It computes B * B, places the result\nin B, and returns the high word (carry).\n\nbn_mul_add_words(B, B, B, B) operates on the B\nword arrays B and B. It computes B * B + B, places\nthe result in B, and returns the high word (carry).\n\nbn_sqr_words(B, B, B) operates on the B word array\nB and the 2*B word array B. It computes B * B\nword-wise, and places the low and high bytes of the result in B.\n\nbn_div_words(B, B, B) divides the two word number (B, B)\nby B and returns the result.\n\nbn_add_words(B, B, B, B) operates on the B word\narrays B, B and B. It computes B + B, places the\nresult in B, and returns the high word (carry).\n\nbn_sub_words(B, B, B, B) operates on the B word\narrays B, B and B. It computes B - B, places the\nresult in B, and returns the carry (1 if B E B, 0\notherwise).\n\nbn_mul_comba4(B, B, B) operates on the 4 word arrays B and\nB and the 8 word array B. It computes B*B and places the\nresult in B.\n\nbn_mul_comba8(B, B, B) operates on the 8 word arrays B and\nB and the 16 word array B. It computes B*B and places the\nresult in B.\n\nbn_sqr_comba4(B, B, B) operates on the 4 word arrays B and\nB and the 8 word array B.\n\nbn_sqr_comba8(B, B, B) operates on the 8 word arrays B and\nB and the 16 word array B.\n\nThe following functions are implemented in C:\n\nbn_cmp_words(B, B, B) operates on the B word arrays B\nand B. It returns 1, 0 and -1 if B is greater than, equal and\nless than B.\n\nbn_mul_normal(B, B, B, B, B) operates on the B\nword array B, the B word array B and the B+B word\narray B. It computes B*B and places the result in B.\n\nbn_mul_low_normal(B, B, B, B) operates on the B word\narrays B, B and B. It computes the B low words of\nB*B and places the result in B.\n\nbn_mul_recursive(B, B, B, B, B, B, B) operates\non the word arrays B and B of length B+B and B+B\n(B and B are currently allowed to be 0 or negative) and the 2*B\nword arrays B and B. B must be a power of 2. It computes\nB*B and places the result in B.\n\nbn_mul_part_recursive(B, B, B, B, B, B, B)\noperates on the word arrays B and B of length B+B and\nB+B and the 4*B word arrays B and B.\n\nbn_mul_low_recursive(B, B, B, B, B) operates on the\nB word arrays B and B and the B/2 word arrays B\nand B.\n\nBN_mul() calls bn_mul_normal(), or an optimized implementation if the\nfactors have the same size: bn_mul_comba8() is used if they are 8\nwords long, bn_mul_recursive() if they are larger than\nB and the size is an exact multiple of the word\nsize, and bn_mul_part_recursive() for others that are larger than\nB.\n\nbn_sqr_normal(B, B, B, B) operates on the B word array\nB and the 2*B word arrays B and B.\n\nThe implementations use the following macros which, depending on the\narchitecture, may use \"long long\" C operations or inline assembler.\nThey are defined in C.\n\nmul(B, B, B, B) computes B*B+B and places the\nlow word of the result in B and the high word in B.\n\nmul_add(B, B, B, B) computes B*B+B+B and\nplaces the low word of the result in B and the high word in B.\n\nsqr(B, B, B) computes B*B and places the low word\nof the result in B and the high word in B.\n\n=head2 Size changes\n\nbn_expand() ensures that B has enough space for a B bit\nnumber. bn_wexpand() ensures that B has enough space for an\nB word number. If the number has to be expanded, both macros\ncall bn_expand2(), which allocates a new B array and copies the\ndata. They return B on error, B otherwise.\n\nThe bn_fix_top() macro reduces Btop> to point to the most\nsignificant non-zero word plus one when B has shrunk.\n\n=head2 Debugging\n\nbn_check_top() verifies that C<((a)-Etop E= 0 && (a)-Etop\nE= (a)-Edmax)>. A violation will cause the program to abort.\n\nbn_print() prints B to stderr. bn_dump() prints B words at B\n(in reverse order, i.e. most significant word first) to stderr.\n\nbn_set_max() makes B a static number with a B of its current size.\nThis is used by bn_set_low() and bn_set_high() to make B a read-only\nB that contains the B low or high words of B.\n\nIf B is not defined, bn_check_top(), bn_print(), bn_dump()\nand bn_set_max() are defined as empty macros.\n\n=head1 SEE ALSO\n\nL\n\n=head1 COPYRIGHT\n\nCopyright 2000-2016 The OpenSSL Project Authors. All Rights Reserved.\n\nLicensed under the OpenSSL license (the \"License\"). You may not use\nthis file except in compliance with the License. You can obtain a copy\nin the file LICENSE in the source distribution or at\nL.\n\n=cut\n" }, { "path": "cryptomini/bn/bn_add.c", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \"internal/cryptlib.h\"\n#include \"bn_local.h\"\n\n/* signed add of b to a. */\nint BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)\n{\n int ret, r_neg, cmp_res;\n\n bn_check_top(a);\n bn_check_top(b);\n\n if (a->neg == b->neg) {\n r_neg = a->neg;\n ret = BN_uadd(r, a, b);\n } else {\n cmp_res = BN_ucmp(a, b);\n if (cmp_res > 0) {\n r_neg = a->neg;\n ret = BN_usub(r, a, b);\n } else if (cmp_res < 0) {\n r_neg = b->neg;\n ret = BN_usub(r, b, a);\n } else {\n r_neg = 0;\n BN_zero(r);\n ret = 1;\n }\n }\n\n r->neg = r_neg;\n bn_check_top(r);\n return ret;\n}\n\n/* signed sub of b from a. */\nint BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)\n{\n int ret, r_neg, cmp_res;\n\n bn_check_top(a);\n bn_check_top(b);\n\n if (a->neg != b->neg) {\n r_neg = a->neg;\n ret = BN_uadd(r, a, b);\n } else {\n cmp_res = BN_ucmp(a, b);\n if (cmp_res > 0) {\n r_neg = a->neg;\n ret = BN_usub(r, a, b);\n } else if (cmp_res < 0) {\n r_neg = !b->neg;\n ret = BN_usub(r, b, a);\n } else {\n r_neg = 0;\n BN_zero(r);\n ret = 1;\n }\n }\n\n r->neg = r_neg;\n bn_check_top(r);\n return ret;\n}\n\n/* unsigned add of b to a, r can be equal to a or b. */\nint BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)\n{\n int max, min, dif;\n const BN_ULONG *ap, *bp;\n BN_ULONG *rp, carry, t1, t2;\n\n bn_check_top(a);\n bn_check_top(b);\n\n if (a->top < b->top) {\n const BIGNUM *tmp;\n\n tmp = a;\n a = b;\n b = tmp;\n }\n max = a->top;\n min = b->top;\n dif = max - min;\n\n if (bn_wexpand(r, max + 1) == NULL)\n return 0;\n\n r->top = max;\n\n ap = a->d;\n bp = b->d;\n rp = r->d;\n\n carry = bn_add_words(rp, ap, bp, min);\n rp += min;\n ap += min;\n\n while (dif) {\n dif--;\n t1 = *(ap++);\n t2 = (t1 + carry) & BN_MASK2;\n *(rp++) = t2;\n carry &= (t2 == 0);\n }\n *rp = carry;\n r->top += carry;\n\n r->neg = 0;\n bn_check_top(r);\n return 1;\n}\n\n/* unsigned subtraction of b from a, a must be larger than b. */\nint BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)\n{\n int max, min, dif;\n BN_ULONG t1, t2, borrow, *rp;\n const BN_ULONG *ap, *bp;\n\n bn_check_top(a);\n bn_check_top(b);\n\n max = a->top;\n min = b->top;\n dif = max - min;\n\n if (dif < 0) { /* hmm... should not be happening */\n BNerr(BN_F_BN_USUB, BN_R_ARG2_LT_ARG3);\n return 0;\n }\n\n if (bn_wexpand(r, max) == NULL)\n return 0;\n\n ap = a->d;\n bp = b->d;\n rp = r->d;\n\n borrow = bn_sub_words(rp, ap, bp, min);\n ap += min;\n rp += min;\n\n while (dif) {\n dif--;\n t1 = *(ap++);\n t2 = (t1 - borrow) & BN_MASK2;\n *(rp++) = t2;\n borrow &= (t1 == 0);\n }\n\n while (max && *--rp == 0)\n max--;\n\n r->top = max;\n r->neg = 0;\n bn_pollute(r);\n\n return 1;\n}\n\n" }, { "path": "cryptomini/bn/bn_asm.c", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \n#include \"internal/cryptlib.h\"\n#include \"bn_local.h\"\n\n#if defined(BN_LLONG) || defined(BN_UMULT_HIGH)\n\nBN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num,\n BN_ULONG w)\n{\n BN_ULONG c1 = 0;\n\n assert(num >= 0);\n if (num <= 0)\n return c1;\n\n# ifndef OPENSSL_SMALL_FOOTPRINT\n while (num & ~3) {\n mul_add(rp[0], ap[0], w, c1);\n mul_add(rp[1], ap[1], w, c1);\n mul_add(rp[2], ap[2], w, c1);\n mul_add(rp[3], ap[3], w, c1);\n ap += 4;\n rp += 4;\n num -= 4;\n }\n# endif\n while (num) {\n mul_add(rp[0], ap[0], w, c1);\n ap++;\n rp++;\n num--;\n }\n\n return c1;\n}\n\nBN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w)\n{\n BN_ULONG c1 = 0;\n\n assert(num >= 0);\n if (num <= 0)\n return c1;\n\n# ifndef OPENSSL_SMALL_FOOTPRINT\n while (num & ~3) {\n mul(rp[0], ap[0], w, c1);\n mul(rp[1], ap[1], w, c1);\n mul(rp[2], ap[2], w, c1);\n mul(rp[3], ap[3], w, c1);\n ap += 4;\n rp += 4;\n num -= 4;\n }\n# endif\n while (num) {\n mul(rp[0], ap[0], w, c1);\n ap++;\n rp++;\n num--;\n }\n return c1;\n}\n\nvoid bn_sqr_words(BN_ULONG *r, const BN_ULONG *a, int n)\n{\n assert(n >= 0);\n if (n <= 0)\n return;\n\n# ifndef OPENSSL_SMALL_FOOTPRINT\n while (n & ~3) {\n sqr(r[0], r[1], a[0]);\n sqr(r[2], r[3], a[1]);\n sqr(r[4], r[5], a[2]);\n sqr(r[6], r[7], a[3]);\n a += 4;\n r += 8;\n n -= 4;\n }\n# endif\n while (n) {\n sqr(r[0], r[1], a[0]);\n a++;\n r += 2;\n n--;\n }\n}\n\n#else /* !(defined(BN_LLONG) ||\n * defined(BN_UMULT_HIGH)) */\n\nBN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num,\n BN_ULONG w)\n{\n BN_ULONG c = 0;\n BN_ULONG bl, bh;\n\n assert(num >= 0);\n if (num <= 0)\n return (BN_ULONG)0;\n\n bl = LBITS(w);\n bh = HBITS(w);\n\n# ifndef OPENSSL_SMALL_FOOTPRINT\n while (num & ~3) {\n mul_add(rp[0], ap[0], bl, bh, c);\n mul_add(rp[1], ap[1], bl, bh, c);\n mul_add(rp[2], ap[2], bl, bh, c);\n mul_add(rp[3], ap[3], bl, bh, c);\n ap += 4;\n rp += 4;\n num -= 4;\n }\n# endif\n while (num) {\n mul_add(rp[0], ap[0], bl, bh, c);\n ap++;\n rp++;\n num--;\n }\n return c;\n}\n\nBN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w)\n{\n BN_ULONG carry = 0;\n BN_ULONG bl, bh;\n\n assert(num >= 0);\n if (num <= 0)\n return (BN_ULONG)0;\n\n bl = LBITS(w);\n bh = HBITS(w);\n\n# ifndef OPENSSL_SMALL_FOOTPRINT\n while (num & ~3) {\n mul(rp[0], ap[0], bl, bh, carry);\n mul(rp[1], ap[1], bl, bh, carry);\n mul(rp[2], ap[2], bl, bh, carry);\n mul(rp[3], ap[3], bl, bh, carry);\n ap += 4;\n rp += 4;\n num -= 4;\n }\n# endif\n while (num) {\n mul(rp[0], ap[0], bl, bh, carry);\n ap++;\n rp++;\n num--;\n }\n return carry;\n}\n\nvoid bn_sqr_words(BN_ULONG *r, const BN_ULONG *a, int n)\n{\n assert(n >= 0);\n if (n <= 0)\n return;\n\n# ifndef OPENSSL_SMALL_FOOTPRINT\n while (n & ~3) {\n sqr64(r[0], r[1], a[0]);\n sqr64(r[2], r[3], a[1]);\n sqr64(r[4], r[5], a[2]);\n sqr64(r[6], r[7], a[3]);\n a += 4;\n r += 8;\n n -= 4;\n }\n# endif\n while (n) {\n sqr64(r[0], r[1], a[0]);\n a++;\n r += 2;\n n--;\n }\n}\n\n#endif /* !(defined(BN_LLONG) ||\n * defined(BN_UMULT_HIGH)) */\n\n#if defined(BN_LLONG) && defined(BN_DIV2W)\n\nBN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d)\n{\n return ((BN_ULONG)(((((BN_ULLONG) h) << BN_BITS2) | l) / (BN_ULLONG) d));\n}\n\n#else\n\n/* Divide h,l by d and return the result. */\n/* I need to test this some more :-( */\nBN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d)\n{\n BN_ULONG dh, dl, q, ret = 0, th, tl, t;\n int i, count = 2;\n\n if (d == 0)\n return BN_MASK2;\n\n i = BN_num_bits_word(d);\n assert((i == BN_BITS2) || (h <= (BN_ULONG)1 << i));\n\n i = BN_BITS2 - i;\n if (h >= d)\n h -= d;\n\n if (i) {\n d <<= i;\n h = (h << i) | (l >> (BN_BITS2 - i));\n l <<= i;\n }\n dh = (d & BN_MASK2h) >> BN_BITS4;\n dl = (d & BN_MASK2l);\n for (;;) {\n if ((h >> BN_BITS4) == dh)\n q = BN_MASK2l;\n else\n q = h / dh;\n\n th = q * dh;\n tl = dl * q;\n for (;;) {\n t = h - th;\n if ((t & BN_MASK2h) ||\n ((tl) <= ((t << BN_BITS4) | ((l & BN_MASK2h) >> BN_BITS4))))\n break;\n q--;\n th -= dh;\n tl -= dl;\n }\n t = (tl >> BN_BITS4);\n tl = (tl << BN_BITS4) & BN_MASK2h;\n th += t;\n\n if (l < tl)\n th++;\n l -= tl;\n if (h < th) {\n h += d;\n q--;\n }\n h -= th;\n\n if (--count == 0)\n break;\n\n ret = q << BN_BITS4;\n h = ((h << BN_BITS4) | (l >> BN_BITS4)) & BN_MASK2;\n l = (l & BN_MASK2l) << BN_BITS4;\n }\n ret |= q;\n return ret;\n}\n#endif /* !defined(BN_LLONG) && defined(BN_DIV2W) */\n\n#ifdef BN_LLONG\nBN_ULONG bn_add_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b,\n int n)\n{\n BN_ULLONG ll = 0;\n\n assert(n >= 0);\n if (n <= 0)\n return (BN_ULONG)0;\n\n# ifndef OPENSSL_SMALL_FOOTPRINT\n while (n & ~3) {\n ll += (BN_ULLONG) a[0] + b[0];\n r[0] = (BN_ULONG)ll & BN_MASK2;\n ll >>= BN_BITS2;\n ll += (BN_ULLONG) a[1] + b[1];\n r[1] = (BN_ULONG)ll & BN_MASK2;\n ll >>= BN_BITS2;\n ll += (BN_ULLONG) a[2] + b[2];\n r[2] = (BN_ULONG)ll & BN_MASK2;\n ll >>= BN_BITS2;\n ll += (BN_ULLONG) a[3] + b[3];\n r[3] = (BN_ULONG)ll & BN_MASK2;\n ll >>= BN_BITS2;\n a += 4;\n b += 4;\n r += 4;\n n -= 4;\n }\n# endif\n while (n) {\n ll += (BN_ULLONG) a[0] + b[0];\n r[0] = (BN_ULONG)ll & BN_MASK2;\n ll >>= BN_BITS2;\n a++;\n b++;\n r++;\n n--;\n }\n return (BN_ULONG)ll;\n}\n#else /* !BN_LLONG */\nBN_ULONG bn_add_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b,\n int n)\n{\n BN_ULONG c, l, t;\n\n assert(n >= 0);\n if (n <= 0)\n return (BN_ULONG)0;\n\n c = 0;\n# ifndef OPENSSL_SMALL_FOOTPRINT\n while (n & ~3) {\n t = a[0];\n t = (t + c) & BN_MASK2;\n c = (t < c);\n l = (t + b[0]) & BN_MASK2;\n c += (l < t);\n r[0] = l;\n t = a[1];\n t = (t + c) & BN_MASK2;\n c = (t < c);\n l = (t + b[1]) & BN_MASK2;\n c += (l < t);\n r[1] = l;\n t = a[2];\n t = (t + c) & BN_MASK2;\n c = (t < c);\n l = (t + b[2]) & BN_MASK2;\n c += (l < t);\n r[2] = l;\n t = a[3];\n t = (t + c) & BN_MASK2;\n c = (t < c);\n l = (t + b[3]) & BN_MASK2;\n c += (l < t);\n r[3] = l;\n a += 4;\n b += 4;\n r += 4;\n n -= 4;\n }\n# endif\n while (n) {\n t = a[0];\n t = (t + c) & BN_MASK2;\n c = (t < c);\n l = (t + b[0]) & BN_MASK2;\n c += (l < t);\n r[0] = l;\n a++;\n b++;\n r++;\n n--;\n }\n return (BN_ULONG)c;\n}\n#endif /* !BN_LLONG */\n\nBN_ULONG bn_sub_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b,\n int n)\n{\n BN_ULONG t1, t2;\n int c = 0;\n\n assert(n >= 0);\n if (n <= 0)\n return (BN_ULONG)0;\n\n#ifndef OPENSSL_SMALL_FOOTPRINT\n while (n & ~3) {\n t1 = a[0];\n t2 = b[0];\n r[0] = (t1 - t2 - c) & BN_MASK2;\n if (t1 != t2)\n c = (t1 < t2);\n t1 = a[1];\n t2 = b[1];\n r[1] = (t1 - t2 - c) & BN_MASK2;\n if (t1 != t2)\n c = (t1 < t2);\n t1 = a[2];\n t2 = b[2];\n r[2] = (t1 - t2 - c) & BN_MASK2;\n if (t1 != t2)\n c = (t1 < t2);\n t1 = a[3];\n t2 = b[3];\n r[3] = (t1 - t2 - c) & BN_MASK2;\n if (t1 != t2)\n c = (t1 < t2);\n a += 4;\n b += 4;\n r += 4;\n n -= 4;\n }\n#endif\n while (n) {\n t1 = a[0];\n t2 = b[0];\n r[0] = (t1 - t2 - c) & BN_MASK2;\n if (t1 != t2)\n c = (t1 < t2);\n a++;\n b++;\n r++;\n n--;\n }\n return c;\n}\n\n#if defined(BN_MUL_COMBA) && !defined(OPENSSL_SMALL_FOOTPRINT)\n\n# undef bn_mul_comba8\n# undef bn_mul_comba4\n# undef bn_sqr_comba8\n# undef bn_sqr_comba4\n\n/* mul_add_c(a,b,c0,c1,c2) -- c+=a*b for three word number c=(c2,c1,c0) */\n/* mul_add_c2(a,b,c0,c1,c2) -- c+=2*a*b for three word number c=(c2,c1,c0) */\n/* sqr_add_c(a,i,c0,c1,c2) -- c+=a[i]^2 for three word number c=(c2,c1,c0) */\n/*\n * sqr_add_c2(a,i,c0,c1,c2) -- c+=2*a[i]*a[j] for three word number\n * c=(c2,c1,c0)\n */\n\n# ifdef BN_LLONG\n/*\n * Keep in mind that additions to multiplication result can not\n * overflow, because its high half cannot be all-ones.\n */\n# define mul_add_c(a,b,c0,c1,c2) do { \\\n BN_ULONG hi; \\\n BN_ULLONG t = (BN_ULLONG)(a)*(b); \\\n t += c0; /* no carry */ \\\n c0 = (BN_ULONG)Lw(t); \\\n hi = (BN_ULONG)Hw(t); \\\n c1 = (c1+hi)&BN_MASK2; if (c1\n/*\n * This is essentially reference implementation, which may or may not\n * result in performance improvement. E.g. on IA-32 this routine was\n * observed to give 40% faster rsa1024 private key operations and 10%\n * faster rsa4096 ones, while on AMD64 it improves rsa1024 sign only\n * by 10% and *worsens* rsa4096 sign by 15%. Once again, it's a\n * reference implementation, one to be used as starting point for\n * platform-specific assembler. Mentioned numbers apply to compiler\n * generated code compiled with and without -DOPENSSL_BN_ASM_MONT and\n * can vary not only from platform to platform, but even for compiler\n * versions. Assembler vs. assembler improvement coefficients can\n * [and are known to] differ and are to be documented elsewhere.\n */\nint bn_mul_mont(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,\n const BN_ULONG *np, const BN_ULONG *n0p, int num)\n{\n BN_ULONG c0, c1, ml, *tp, n0;\n# ifdef mul64\n BN_ULONG mh;\n# endif\n volatile BN_ULONG *vp;\n int i = 0, j;\n\n# if 0 /* template for platform-specific\n * implementation */\n if (ap == bp)\n return bn_sqr_mont(rp, ap, np, n0p, num);\n# endif\n vp = tp = alloca((num + 2) * sizeof(BN_ULONG));\n\n n0 = *n0p;\n\n c0 = 0;\n ml = bp[0];\n# ifdef mul64\n mh = HBITS(ml);\n ml = LBITS(ml);\n for (j = 0; j < num; ++j)\n mul(tp[j], ap[j], ml, mh, c0);\n# else\n for (j = 0; j < num; ++j)\n mul(tp[j], ap[j], ml, c0);\n# endif\n\n tp[num] = c0;\n tp[num + 1] = 0;\n goto enter;\n\n for (i = 0; i < num; i++) {\n c0 = 0;\n ml = bp[i];\n# ifdef mul64\n mh = HBITS(ml);\n ml = LBITS(ml);\n for (j = 0; j < num; ++j)\n mul_add(tp[j], ap[j], ml, mh, c0);\n# else\n for (j = 0; j < num; ++j)\n mul_add(tp[j], ap[j], ml, c0);\n# endif\n c1 = (tp[num] + c0) & BN_MASK2;\n tp[num] = c1;\n tp[num + 1] = (c1 < c0 ? 1 : 0);\n enter:\n c1 = tp[0];\n ml = (c1 * n0) & BN_MASK2;\n c0 = 0;\n# ifdef mul64\n mh = HBITS(ml);\n ml = LBITS(ml);\n mul_add(c1, np[0], ml, mh, c0);\n# else\n mul_add(c1, ml, np[0], c0);\n# endif\n for (j = 1; j < num; j++) {\n c1 = tp[j];\n# ifdef mul64\n mul_add(c1, np[j], ml, mh, c0);\n# else\n mul_add(c1, ml, np[j], c0);\n# endif\n tp[j - 1] = c1 & BN_MASK2;\n }\n c1 = (tp[num] + c0) & BN_MASK2;\n tp[num - 1] = c1;\n tp[num] = tp[num + 1] + (c1 < c0 ? 1 : 0);\n }\n\n if (tp[num] != 0 || tp[num - 1] >= np[num - 1]) {\n c0 = bn_sub_words(rp, tp, np, num);\n if (tp[num] != 0 || c0 == 0) {\n for (i = 0; i < num + 2; i++)\n vp[i] = 0;\n return 1;\n }\n }\n for (i = 0; i < num; i++)\n rp[i] = tp[i], vp[i] = 0;\n vp[num] = 0;\n vp[num + 1] = 0;\n return 1;\n}\n# else\n/*\n * Return value of 0 indicates that multiplication/convolution was not\n * performed to signal the caller to fall down to alternative/original\n * code-path.\n */\nint bn_mul_mont(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,\n const BN_ULONG *np, const BN_ULONG *n0, int num)\n{\n return 0;\n}\n# endif /* OPENSSL_BN_ASM_MONT */\n# endif\n\n#else /* !BN_MUL_COMBA */\n\n/* hmm... is it faster just to do a multiply? */\n# undef bn_sqr_comba4\n# undef bn_sqr_comba8\nvoid bn_sqr_comba4(BN_ULONG *r, const BN_ULONG *a)\n{\n BN_ULONG t[8];\n bn_sqr_normal(r, a, 4, t);\n}\n\nvoid bn_sqr_comba8(BN_ULONG *r, const BN_ULONG *a)\n{\n BN_ULONG t[16];\n bn_sqr_normal(r, a, 8, t);\n}\n\nvoid bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)\n{\n r[4] = bn_mul_words(&(r[0]), a, 4, b[0]);\n r[5] = bn_mul_add_words(&(r[1]), a, 4, b[1]);\n r[6] = bn_mul_add_words(&(r[2]), a, 4, b[2]);\n r[7] = bn_mul_add_words(&(r[3]), a, 4, b[3]);\n}\n\nvoid bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)\n{\n r[8] = bn_mul_words(&(r[0]), a, 8, b[0]);\n r[9] = bn_mul_add_words(&(r[1]), a, 8, b[1]);\n r[10] = bn_mul_add_words(&(r[2]), a, 8, b[2]);\n r[11] = bn_mul_add_words(&(r[3]), a, 8, b[3]);\n r[12] = bn_mul_add_words(&(r[4]), a, 8, b[4]);\n r[13] = bn_mul_add_words(&(r[5]), a, 8, b[5]);\n r[14] = bn_mul_add_words(&(r[6]), a, 8, b[6]);\n r[15] = bn_mul_add_words(&(r[7]), a, 8, b[7]);\n}\n\n# ifdef OPENSSL_NO_ASM\n# ifdef OPENSSL_BN_ASM_MONT\n# include \nint bn_mul_mont(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,\n const BN_ULONG *np, const BN_ULONG *n0p, int num)\n{\n BN_ULONG c0, c1, *tp, n0 = *n0p;\n volatile BN_ULONG *vp;\n int i = 0, j;\n\n vp = tp = alloca((num + 2) * sizeof(BN_ULONG));\n\n for (i = 0; i <= num; i++)\n tp[i] = 0;\n\n for (i = 0; i < num; i++) {\n c0 = bn_mul_add_words(tp, ap, num, bp[i]);\n c1 = (tp[num] + c0) & BN_MASK2;\n tp[num] = c1;\n tp[num + 1] = (c1 < c0 ? 1 : 0);\n\n c0 = bn_mul_add_words(tp, np, num, tp[0] * n0);\n c1 = (tp[num] + c0) & BN_MASK2;\n tp[num] = c1;\n tp[num + 1] += (c1 < c0 ? 1 : 0);\n for (j = 0; j <= num; j++)\n tp[j] = tp[j + 1];\n }\n\n if (tp[num] != 0 || tp[num - 1] >= np[num - 1]) {\n c0 = bn_sub_words(rp, tp, np, num);\n if (tp[num] != 0 || c0 == 0) {\n for (i = 0; i < num + 2; i++)\n vp[i] = 0;\n return 1;\n }\n }\n for (i = 0; i < num; i++)\n rp[i] = tp[i], vp[i] = 0;\n vp[num] = 0;\n vp[num + 1] = 0;\n return 1;\n}\n# else\nint bn_mul_mont(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,\n const BN_ULONG *np, const BN_ULONG *n0, int num)\n{\n return 0;\n}\n# endif /* OPENSSL_BN_ASM_MONT */\n# endif\n\n#endif /* !BN_MUL_COMBA */\n" }, { "path": "cryptomini/bn/bn_ctx.c", "content": "/*\n * Copyright 2000-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \"internal/cryptlib.h\"\n#include \"bn_local.h\"\n\n/*-\n * TODO list\n *\n * 1. Check a bunch of \"(words+1)\" type hacks in various bignum functions and\n * check they can be safely removed.\n * - Check +1 and other ugliness in BN_from_montgomery()\n *\n * 2. Consider allowing a BN_new_ex() that, at least, lets you specify an\n * appropriate 'block' size that will be honoured by bn_expand_internal() to\n * prevent piddly little reallocations. OTOH, profiling bignum expansions in\n * BN_CTX doesn't show this to be a big issue.\n */\n\n/* How many bignums are in each \"pool item\"; */\n#define BN_CTX_POOL_SIZE 16\n/* The stack frame info is resizing, set a first-time expansion size; */\n#define BN_CTX_START_FRAMES 32\n\n/***********/\n/* BN_POOL */\n/***********/\n\n/* A bundle of bignums that can be linked with other bundles */\ntypedef struct bignum_pool_item {\n /* The bignum values */\n BIGNUM vals[BN_CTX_POOL_SIZE];\n /* Linked-list admin */\n struct bignum_pool_item *prev, *next;\n} BN_POOL_ITEM;\n/* A linked-list of bignums grouped in bundles */\ntypedef struct bignum_pool {\n /* Linked-list admin */\n BN_POOL_ITEM *head, *current, *tail;\n /* Stack depth and allocation size */\n unsigned used, size;\n} BN_POOL;\nstatic void BN_POOL_init(BN_POOL *);\nstatic void BN_POOL_finish(BN_POOL *);\nstatic BIGNUM *BN_POOL_get(BN_POOL *, int);\nstatic void BN_POOL_release(BN_POOL *, unsigned int);\n\n/************/\n/* BN_STACK */\n/************/\n\n/* A wrapper to manage the \"stack frames\" */\ntypedef struct bignum_ctx_stack {\n /* Array of indexes into the bignum stack */\n unsigned int *indexes;\n /* Number of stack frames, and the size of the allocated array */\n unsigned int depth, size;\n} BN_STACK;\nstatic void BN_STACK_init(BN_STACK *);\nstatic void BN_STACK_finish(BN_STACK *);\nstatic int BN_STACK_push(BN_STACK *, unsigned int);\nstatic unsigned int BN_STACK_pop(BN_STACK *);\n\n/**********/\n/* BN_CTX */\n/**********/\n\n/* The opaque BN_CTX type */\nstruct bignum_ctx {\n /* The bignum bundles */\n BN_POOL pool;\n /* The \"stack frames\", if you will */\n BN_STACK stack;\n /* The number of bignums currently assigned */\n unsigned int used;\n /* Depth of stack overflow */\n int err_stack;\n /* Block \"gets\" until an \"end\" (compatibility behaviour) */\n int too_many;\n /* Flags. */\n int flags;\n};\n\n/* Enable this to find BN_CTX bugs */\n#ifdef BN_CTX_DEBUG\nstatic const char *ctxdbg_cur = NULL;\nstatic void ctxdbg(BN_CTX *ctx)\n{\n unsigned int bnidx = 0, fpidx = 0;\n BN_POOL_ITEM *item = ctx->pool.head;\n BN_STACK *stack = &ctx->stack;\n fprintf(stderr, \"(%16p): \", ctx);\n while (bnidx < ctx->used) {\n fprintf(stderr, \"%03x \", item->vals[bnidx++ % BN_CTX_POOL_SIZE].dmax);\n if (!(bnidx % BN_CTX_POOL_SIZE))\n item = item->next;\n }\n fprintf(stderr, \"\\n\");\n bnidx = 0;\n fprintf(stderr, \" : \");\n while (fpidx < stack->depth) {\n while (bnidx++ < stack->indexes[fpidx])\n fprintf(stderr, \" \");\n fprintf(stderr, \"^^^ \");\n bnidx++;\n fpidx++;\n }\n fprintf(stderr, \"\\n\");\n}\n\n# define CTXDBG_ENTRY(str, ctx) do { \\\n ctxdbg_cur = (str); \\\n fprintf(stderr,\"Starting %s\\n\", ctxdbg_cur); \\\n ctxdbg(ctx); \\\n } while(0)\n# define CTXDBG_EXIT(ctx) do { \\\n fprintf(stderr,\"Ending %s\\n\", ctxdbg_cur); \\\n ctxdbg(ctx); \\\n } while(0)\n# define CTXDBG_RET(ctx,ret)\n#else\n# define CTXDBG_ENTRY(str, ctx)\n# define CTXDBG_EXIT(ctx)\n# define CTXDBG_RET(ctx,ret)\n#endif\n\n\nBN_CTX *BN_CTX_new(void)\n{\n BN_CTX *ret;\n\n if ((ret = OPENSSL_zalloc(sizeof(*ret))) == NULL) {\n BNerr(BN_F_BN_CTX_NEW, ERR_R_MALLOC_FAILURE);\n return NULL;\n }\n /* Initialise the structure */\n BN_POOL_init(&ret->pool);\n BN_STACK_init(&ret->stack);\n return ret;\n}\n\nBN_CTX *BN_CTX_secure_new(void)\n{\n BN_CTX *ret = BN_CTX_new();\n\n if (ret != NULL)\n ret->flags = BN_FLG_SECURE;\n return ret;\n}\n\nvoid BN_CTX_free(BN_CTX *ctx)\n{\n if (ctx == NULL)\n return;\n#ifdef BN_CTX_DEBUG\n {\n BN_POOL_ITEM *pool = ctx->pool.head;\n fprintf(stderr, \"BN_CTX_free, stack-size=%d, pool-bignums=%d\\n\",\n ctx->stack.size, ctx->pool.size);\n fprintf(stderr, \"dmaxs: \");\n while (pool) {\n unsigned loop = 0;\n while (loop < BN_CTX_POOL_SIZE)\n fprintf(stderr, \"%02x \", pool->vals[loop++].dmax);\n pool = pool->next;\n }\n fprintf(stderr, \"\\n\");\n }\n#endif\n BN_STACK_finish(&ctx->stack);\n BN_POOL_finish(&ctx->pool);\n OPENSSL_free(ctx);\n}\n\nvoid BN_CTX_start(BN_CTX *ctx)\n{\n CTXDBG_ENTRY(\"BN_CTX_start\", ctx);\n /* If we're already overflowing ... */\n if (ctx->err_stack || ctx->too_many)\n ctx->err_stack++;\n /* (Try to) get a new frame pointer */\n else if (!BN_STACK_push(&ctx->stack, ctx->used)) {\n BNerr(BN_F_BN_CTX_START, BN_R_TOO_MANY_TEMPORARY_VARIABLES);\n ctx->err_stack++;\n }\n CTXDBG_EXIT(ctx);\n}\n\nvoid BN_CTX_end(BN_CTX *ctx)\n{\n if (ctx == NULL)\n return;\n CTXDBG_ENTRY(\"BN_CTX_end\", ctx);\n if (ctx->err_stack)\n ctx->err_stack--;\n else {\n unsigned int fp = BN_STACK_pop(&ctx->stack);\n /* Does this stack frame have anything to release? */\n if (fp < ctx->used)\n BN_POOL_release(&ctx->pool, ctx->used - fp);\n ctx->used = fp;\n /* Unjam \"too_many\" in case \"get\" had failed */\n ctx->too_many = 0;\n }\n CTXDBG_EXIT(ctx);\n}\n\nBIGNUM *BN_CTX_get(BN_CTX *ctx)\n{\n BIGNUM *ret;\n\n CTXDBG_ENTRY(\"BN_CTX_get\", ctx);\n if (ctx->err_stack || ctx->too_many)\n return NULL;\n if ((ret = BN_POOL_get(&ctx->pool, ctx->flags)) == NULL) {\n /*\n * Setting too_many prevents repeated \"get\" attempts from cluttering\n * the error stack.\n */\n ctx->too_many = 1;\n BNerr(BN_F_BN_CTX_GET, BN_R_TOO_MANY_TEMPORARY_VARIABLES);\n return NULL;\n }\n /* OK, make sure the returned bignum is \"zero\" */\n BN_zero(ret);\n /* clear BN_FLG_CONSTTIME if leaked from previous frames */\n ret->flags &= (~BN_FLG_CONSTTIME);\n ctx->used++;\n CTXDBG_RET(ctx, ret);\n return ret;\n}\n\n/************/\n/* BN_STACK */\n/************/\n\nstatic void BN_STACK_init(BN_STACK *st)\n{\n st->indexes = NULL;\n st->depth = st->size = 0;\n}\n\nstatic void BN_STACK_finish(BN_STACK *st)\n{\n OPENSSL_free(st->indexes);\n st->indexes = NULL;\n}\n\n\nstatic int BN_STACK_push(BN_STACK *st, unsigned int idx)\n{\n if (st->depth == st->size) {\n /* Need to expand */\n unsigned int newsize =\n st->size ? (st->size * 3 / 2) : BN_CTX_START_FRAMES;\n unsigned int *newitems;\n\n if ((newitems = OPENSSL_malloc(sizeof(*newitems) * newsize)) == NULL) {\n BNerr(BN_F_BN_STACK_PUSH, ERR_R_MALLOC_FAILURE);\n return 0;\n }\n if (st->depth)\n memcpy(newitems, st->indexes, sizeof(*newitems) * st->depth);\n OPENSSL_free(st->indexes);\n st->indexes = newitems;\n st->size = newsize;\n }\n st->indexes[(st->depth)++] = idx;\n return 1;\n}\n\nstatic unsigned int BN_STACK_pop(BN_STACK *st)\n{\n return st->indexes[--(st->depth)];\n}\n\n/***********/\n/* BN_POOL */\n/***********/\n\nstatic void BN_POOL_init(BN_POOL *p)\n{\n p->head = p->current = p->tail = NULL;\n p->used = p->size = 0;\n}\n\nstatic void BN_POOL_finish(BN_POOL *p)\n{\n unsigned int loop;\n BIGNUM *bn;\n\n while (p->head) {\n for (loop = 0, bn = p->head->vals; loop++ < BN_CTX_POOL_SIZE; bn++)\n if (bn->d)\n BN_clear_free(bn);\n p->current = p->head->next;\n OPENSSL_free(p->head);\n p->head = p->current;\n }\n}\n\n\nstatic BIGNUM *BN_POOL_get(BN_POOL *p, int flag)\n{\n BIGNUM *bn;\n unsigned int loop;\n\n /* Full; allocate a new pool item and link it in. */\n if (p->used == p->size) {\n BN_POOL_ITEM *item;\n\n if ((item = OPENSSL_malloc(sizeof(*item))) == NULL) {\n BNerr(BN_F_BN_POOL_GET, ERR_R_MALLOC_FAILURE);\n return NULL;\n }\n for (loop = 0, bn = item->vals; loop++ < BN_CTX_POOL_SIZE; bn++) {\n bn_init(bn);\n if ((flag & BN_FLG_SECURE) != 0)\n BN_set_flags(bn, BN_FLG_SECURE);\n }\n item->prev = p->tail;\n item->next = NULL;\n\n if (p->head == NULL)\n p->head = p->current = p->tail = item;\n else {\n p->tail->next = item;\n p->tail = item;\n p->current = item;\n }\n p->size += BN_CTX_POOL_SIZE;\n p->used++;\n /* Return the first bignum from the new pool */\n return item->vals;\n }\n\n if (!p->used)\n p->current = p->head;\n else if ((p->used % BN_CTX_POOL_SIZE) == 0)\n p->current = p->current->next;\n return p->current->vals + ((p->used++) % BN_CTX_POOL_SIZE);\n}\n\nstatic void BN_POOL_release(BN_POOL *p, unsigned int num)\n{\n unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;\n\n p->used -= num;\n while (num--) {\n bn_check_top(p->current->vals + offset);\n if (offset == 0) {\n offset = BN_CTX_POOL_SIZE - 1;\n p->current = p->current->prev;\n } else\n offset--;\n }\n}\n" }, { "path": "cryptomini/bn/bn_div.c", "content": "/*\n * Copyright 1995-2022 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \n#include \"internal/cryptlib.h\"\n#include \"bn_local.h\"\n\n/* The old slow way */\n#if 0\nint BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,\n BN_CTX *ctx)\n{\n int i, nm, nd;\n int ret = 0;\n BIGNUM *D;\n\n bn_check_top(m);\n bn_check_top(d);\n if (BN_is_zero(d)) {\n BNerr(BN_F_BN_DIV, BN_R_DIV_BY_ZERO);\n return 0;\n }\n\n if (BN_ucmp(m, d) < 0) {\n if (rem != NULL) {\n if (BN_copy(rem, m) == NULL)\n return 0;\n }\n if (dv != NULL)\n BN_zero(dv);\n return 1;\n }\n\n BN_CTX_start(ctx);\n D = BN_CTX_get(ctx);\n if (dv == NULL)\n dv = BN_CTX_get(ctx);\n if (rem == NULL)\n rem = BN_CTX_get(ctx);\n if (D == NULL || dv == NULL || rem == NULL)\n goto end;\n\n nd = BN_num_bits(d);\n nm = BN_num_bits(m);\n if (BN_copy(D, d) == NULL)\n goto end;\n if (BN_copy(rem, m) == NULL)\n goto end;\n\n /*\n * The next 2 are needed so we can do a dv->d[0]|=1 later since\n * BN_lshift1 will only work once there is a value :-)\n */\n BN_zero(dv);\n if (bn_wexpand(dv, 1) == NULL)\n goto end;\n dv->top = 1;\n\n if (!BN_lshift(D, D, nm - nd))\n goto end;\n for (i = nm - nd; i >= 0; i--) {\n if (!BN_lshift1(dv, dv))\n goto end;\n if (BN_ucmp(rem, D) >= 0) {\n dv->d[0] |= 1;\n if (!BN_usub(rem, rem, D))\n goto end;\n }\n/* CAN IMPROVE (and have now :=) */\n if (!BN_rshift1(D, D))\n goto end;\n }\n rem->neg = BN_is_zero(rem) ? 0 : m->neg;\n dv->neg = m->neg ^ d->neg;\n ret = 1;\n end:\n BN_CTX_end(ctx);\n return ret;\n}\n\n#else\n\n# if defined(BN_DIV3W)\nBN_ULONG bn_div_3_words(const BN_ULONG *m, BN_ULONG d1, BN_ULONG d0);\n# elif 0\n/*\n * This is #if-ed away, because it's a reference for assembly implementations,\n * where it can and should be made constant-time. But if you want to test it,\n * just replace 0 with 1.\n */\n# if BN_BITS2 == 64 && defined(__SIZEOF_INT128__) && __SIZEOF_INT128__==16\n# undef BN_ULLONG\n# define BN_ULLONG __uint128_t\n# define BN_LLONG\n# endif\n\n# ifdef BN_LLONG\n# define BN_DIV3W\n/*\n * Interface is somewhat quirky, |m| is pointer to most significant limb,\n * and less significant limb is referred at |m[-1]|. This means that caller\n * is responsible for ensuring that |m[-1]| is valid. Second condition that\n * has to be met is that |d0|'s most significant bit has to be set. Or in\n * other words divisor has to be \"bit-aligned to the left.\" bn_div_fixed_top\n * does all this. The subroutine considers four limbs, two of which are\n * \"overlapping,\" hence the name...\n */\nstatic BN_ULONG bn_div_3_words(const BN_ULONG *m, BN_ULONG d1, BN_ULONG d0)\n{\n BN_ULLONG R = ((BN_ULLONG)m[0] << BN_BITS2) | m[-1];\n BN_ULLONG D = ((BN_ULLONG)d0 << BN_BITS2) | d1;\n BN_ULONG Q = 0, mask;\n int i;\n\n for (i = 0; i < BN_BITS2; i++) {\n Q <<= 1;\n if (R >= D) {\n Q |= 1;\n R -= D;\n }\n D >>= 1;\n }\n\n mask = 0 - (Q >> (BN_BITS2 - 1)); /* does it overflow? */\n\n Q <<= 1;\n Q |= (R >= D);\n\n return (Q | mask) & BN_MASK2;\n}\n# endif\n# endif\n\nstatic int bn_left_align(BIGNUM *num)\n{\n BN_ULONG *d = num->d, n, m, rmask;\n int top = num->top;\n int rshift = BN_num_bits_word(d[top - 1]), lshift, i;\n\n lshift = BN_BITS2 - rshift;\n rshift %= BN_BITS2; /* say no to undefined behaviour */\n rmask = (BN_ULONG)0 - rshift; /* rmask = 0 - (rshift != 0) */\n rmask |= rmask >> 8;\n\n for (i = 0, m = 0; i < top; i++) {\n n = d[i];\n d[i] = ((n << lshift) | m) & BN_MASK2;\n m = (n >> rshift) & rmask;\n }\n\n return lshift;\n}\n\n# if !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM) \\\n && !defined(PEDANTIC) && !defined(BN_DIV3W)\n# if defined(__GNUC__) && __GNUC__>=2\n# if defined(__i386) || defined (__i386__)\n /*-\n * There were two reasons for implementing this template:\n * - GNU C generates a call to a function (__udivdi3 to be exact)\n * in reply to ((((BN_ULLONG)n0)< */\n# endif /* __GNUC__ */\n# endif /* OPENSSL_NO_ASM */\n\n/*-\n * BN_div computes dv := num / divisor, rounding towards\n * zero, and sets up rm such that dv*divisor + rm = num holds.\n * Thus:\n * dv->neg == num->neg ^ divisor->neg (unless the result is zero)\n * rm->neg == num->neg (unless the remainder is zero)\n * If 'dv' or 'rm' is NULL, the respective value is not returned.\n */\nint BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,\n BN_CTX *ctx)\n{\n int ret;\n\n if (BN_is_zero(divisor)) {\n BNerr(BN_F_BN_DIV, BN_R_DIV_BY_ZERO);\n return 0;\n }\n\n /*\n * Invalid zero-padding would have particularly bad consequences so don't\n * just rely on bn_check_top() here (bn_check_top() works only for\n * BN_DEBUG builds)\n */\n if (divisor->d[divisor->top - 1] == 0) {\n BNerr(BN_F_BN_DIV, BN_R_NOT_INITIALIZED);\n return 0;\n }\n\n ret = bn_div_fixed_top(dv, rm, num, divisor, ctx);\n\n if (ret) {\n if (dv != NULL)\n bn_correct_top(dv);\n if (rm != NULL)\n bn_correct_top(rm);\n }\n\n return ret;\n}\n\n/*\n * It's argued that *length* of *significant* part of divisor is public.\n * Even if it's private modulus that is. Again, *length* is assumed\n * public, but not *value*. Former is likely to be pre-defined by\n * algorithm with bit granularity, though below subroutine is invariant\n * of limb length. Thanks to this assumption we can require that |divisor|\n * may not be zero-padded, yet claim this subroutine \"constant-time\"(*).\n * This is because zero-padded dividend, |num|, is tolerated, so that\n * caller can pass dividend of public length(*), but with smaller amount\n * of significant limbs. This naturally means that quotient, |dv|, would\n * contain correspongly less significant limbs as well, and will be zero-\n * padded accordingly. Returned remainder, |rm|, will have same bit length\n * as divisor, also zero-padded if needed. These actually leave sign bits\n * in ambiguous state. In sense that we try to avoid negative zeros, while\n * zero-padded zeros would retain sign.\n *\n * (*) \"Constant-time-ness\" has two pre-conditions:\n *\n * - availability of constant-time bn_div_3_words;\n * - dividend is at least as \"wide\" as divisor, limb-wise, zero-padded\n * if so required, which shouldn't be a privacy problem, because\n * divisor's length is considered public;\n */\nint bn_div_fixed_top(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num,\n const BIGNUM *divisor, BN_CTX *ctx)\n{\n int norm_shift, i, j, loop;\n BIGNUM *tmp, *snum, *sdiv, *res;\n BN_ULONG *resp, *wnum, *wnumtop;\n BN_ULONG d0, d1;\n int num_n, div_n, num_neg;\n\n assert(divisor->top > 0 && divisor->d[divisor->top - 1] != 0);\n\n bn_check_top(num);\n bn_check_top(divisor);\n bn_check_top(dv);\n bn_check_top(rm);\n\n BN_CTX_start(ctx);\n res = (dv == NULL) ? BN_CTX_get(ctx) : dv;\n tmp = BN_CTX_get(ctx);\n snum = BN_CTX_get(ctx);\n sdiv = BN_CTX_get(ctx);\n if (sdiv == NULL)\n goto err;\n\n /* First we normalise the numbers */\n if (!BN_copy(sdiv, divisor))\n goto err;\n norm_shift = bn_left_align(sdiv);\n sdiv->neg = 0;\n /*\n * Note that bn_lshift_fixed_top's output is always one limb longer\n * than input, even when norm_shift is zero. This means that amount of\n * inner loop iterations is invariant of dividend value, and that one\n * doesn't need to compare dividend and divisor if they were originally\n * of the same bit length.\n */\n if (!(bn_lshift_fixed_top(snum, num, norm_shift)))\n goto err;\n\n div_n = sdiv->top;\n num_n = snum->top;\n\n if (num_n <= div_n) {\n /* caller didn't pad dividend -> no constant-time guarantee... */\n if (bn_wexpand(snum, div_n + 1) == NULL)\n goto err;\n memset(&(snum->d[num_n]), 0, (div_n - num_n + 1) * sizeof(BN_ULONG));\n snum->top = num_n = div_n + 1;\n }\n\n loop = num_n - div_n;\n /*\n * Lets setup a 'window' into snum This is the part that corresponds to\n * the current 'area' being divided\n */\n wnum = &(snum->d[loop]);\n wnumtop = &(snum->d[num_n - 1]);\n\n /* Get the top 2 words of sdiv */\n d0 = sdiv->d[div_n - 1];\n d1 = (div_n == 1) ? 0 : sdiv->d[div_n - 2];\n\n /* Setup quotient */\n if (!bn_wexpand(res, loop))\n goto err;\n num_neg = num->neg;\n res->neg = (num_neg ^ divisor->neg);\n res->top = loop;\n res->flags |= BN_FLG_FIXED_TOP;\n resp = &(res->d[loop]);\n\n /* space for temp */\n if (!bn_wexpand(tmp, (div_n + 1)))\n goto err;\n\n for (i = 0; i < loop; i++, wnumtop--) {\n BN_ULONG q, l0;\n /*\n * the first part of the loop uses the top two words of snum and sdiv\n * to calculate a BN_ULONG q such that | wnum - sdiv * q | < sdiv\n */\n# if defined(BN_DIV3W)\n q = bn_div_3_words(wnumtop, d1, d0);\n# else\n BN_ULONG n0, n1, rem = 0;\n\n n0 = wnumtop[0];\n n1 = wnumtop[-1];\n if (n0 == d0)\n q = BN_MASK2;\n else { /* n0 < d0 */\n BN_ULONG n2 = (wnumtop == wnum) ? 0 : wnumtop[-2];\n# ifdef BN_LLONG\n BN_ULLONG t2;\n\n# if defined(BN_LLONG) && defined(BN_DIV2W) && !defined(bn_div_words)\n q = (BN_ULONG)(((((BN_ULLONG) n0) << BN_BITS2) | n1) / d0);\n# else\n q = bn_div_words(n0, n1, d0);\n# endif\n\n# ifndef REMAINDER_IS_ALREADY_CALCULATED\n /*\n * rem doesn't have to be BN_ULLONG. The least we\n * know it's less that d0, isn't it?\n */\n rem = (n1 - q * d0) & BN_MASK2;\n# endif\n t2 = (BN_ULLONG) d1 *q;\n\n for (;;) {\n if (t2 <= ((((BN_ULLONG) rem) << BN_BITS2) | n2))\n break;\n q--;\n rem += d0;\n if (rem < d0)\n break; /* don't let rem overflow */\n t2 -= d1;\n }\n# else /* !BN_LLONG */\n BN_ULONG t2l, t2h;\n\n q = bn_div_words(n0, n1, d0);\n# ifndef REMAINDER_IS_ALREADY_CALCULATED\n rem = (n1 - q * d0) & BN_MASK2;\n# endif\n\n# if defined(BN_UMULT_LOHI)\n BN_UMULT_LOHI(t2l, t2h, d1, q);\n# elif defined(BN_UMULT_HIGH)\n t2l = d1 * q;\n t2h = BN_UMULT_HIGH(d1, q);\n# else\n {\n BN_ULONG ql, qh;\n t2l = LBITS(d1);\n t2h = HBITS(d1);\n ql = LBITS(q);\n qh = HBITS(q);\n mul64(t2l, t2h, ql, qh); /* t2=(BN_ULLONG)d1*q; */\n }\n# endif\n\n for (;;) {\n if ((t2h < rem) || ((t2h == rem) && (t2l <= n2)))\n break;\n q--;\n rem += d0;\n if (rem < d0)\n break; /* don't let rem overflow */\n if (t2l < d1)\n t2h--;\n t2l -= d1;\n }\n# endif /* !BN_LLONG */\n }\n# endif /* !BN_DIV3W */\n\n l0 = bn_mul_words(tmp->d, sdiv->d, div_n, q);\n tmp->d[div_n] = l0;\n wnum--;\n /*\n * ignore top values of the bignums just sub the two BN_ULONG arrays\n * with bn_sub_words\n */\n l0 = bn_sub_words(wnum, wnum, tmp->d, div_n + 1);\n q -= l0;\n /*\n * Note: As we have considered only the leading two BN_ULONGs in\n * the calculation of q, sdiv * q might be greater than wnum (but\n * then (q-1) * sdiv is less or equal than wnum)\n */\n for (l0 = 0 - l0, j = 0; j < div_n; j++)\n tmp->d[j] = sdiv->d[j] & l0;\n l0 = bn_add_words(wnum, wnum, tmp->d, div_n);\n (*wnumtop) += l0;\n assert((*wnumtop) == 0);\n\n /* store part of the result */\n *--resp = q;\n }\n /* snum holds remainder, it's as wide as divisor */\n snum->neg = num_neg;\n snum->top = div_n;\n snum->flags |= BN_FLG_FIXED_TOP;\n\n if (rm != NULL && bn_rshift_fixed_top(rm, snum, norm_shift) == 0)\n goto err;\n\n BN_CTX_end(ctx);\n return 1;\n err:\n bn_check_top(rm);\n BN_CTX_end(ctx);\n return 0;\n}\n#endif\n" }, { "path": "cryptomini/bn/bn_exp.c", "content": "/*\n * Copyright 1995-2022 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \"internal/cryptlib.h\"\n#include \"internal/constant_time.h\"\n#include \"bn_local.h\"\n\n#include \n#ifdef _WIN32\n# include \n# ifndef alloca\n# define alloca _alloca\n# endif\n#elif defined(__GNUC__)\n# ifndef alloca\n# define alloca(s) __builtin_alloca((s))\n# endif\n#elif defined(__sun)\n# include \n#endif\n\n#include \"rsaz_exp.h\"\n\n#undef SPARC_T4_MONT\n#if defined(OPENSSL_BN_ASM_MONT) && (defined(__sparc__) || defined(__sparc))\n# include \"sparc_arch.h\"\nextern unsigned int OPENSSL_sparcv9cap_P[];\n# define SPARC_T4_MONT\n#endif\n\n/* maximum precomputation table size for *variable* sliding windows */\n#define TABLE_SIZE 32\n\n/* this one works - simple but works */\nint BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)\n{\n int i, bits, ret = 0;\n BIGNUM *v, *rr;\n\n if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0\n || BN_get_flags(a, BN_FLG_CONSTTIME) != 0) {\n /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */\n BNerr(BN_F_BN_EXP, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n\n BN_CTX_start(ctx);\n rr = ((r == a) || (r == p)) ? BN_CTX_get(ctx) : r;\n v = BN_CTX_get(ctx);\n if (rr == NULL || v == NULL)\n goto err;\n\n if (BN_copy(v, a) == NULL)\n goto err;\n bits = BN_num_bits(p);\n\n if (BN_is_odd(p)) {\n if (BN_copy(rr, a) == NULL)\n goto err;\n } else {\n if (!BN_one(rr))\n goto err;\n }\n\n for (i = 1; i < bits; i++) {\n if (!BN_sqr(v, v, ctx))\n goto err;\n if (BN_is_bit_set(p, i)) {\n if (!BN_mul(rr, rr, v, ctx))\n goto err;\n }\n }\n if (r != rr && BN_copy(r, rr) == NULL)\n goto err;\n\n ret = 1;\n err:\n BN_CTX_end(ctx);\n bn_check_top(r);\n return ret;\n}\n\nint BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,\n BN_CTX *ctx)\n{\n int ret;\n\n bn_check_top(a);\n bn_check_top(p);\n bn_check_top(m);\n\n /*-\n * For even modulus m = 2^k*m_odd, it might make sense to compute\n * a^p mod m_odd and a^p mod 2^k separately (with Montgomery\n * exponentiation for the odd part), using appropriate exponent\n * reductions, and combine the results using the CRT.\n *\n * For now, we use Montgomery only if the modulus is odd; otherwise,\n * exponentiation using the reciprocal-based quick remaindering\n * algorithm is used.\n *\n * (Timing obtained with expspeed.c [computations a^p mod m\n * where a, p, m are of the same length: 256, 512, 1024, 2048,\n * 4096, 8192 bits], compared to the running time of the\n * standard algorithm:\n *\n * BN_mod_exp_mont 33 .. 40 % [AMD K6-2, Linux, debug configuration]\n * 55 .. 77 % [UltraSparc processor, but\n * debug-solaris-sparcv8-gcc conf.]\n *\n * BN_mod_exp_recp 50 .. 70 % [AMD K6-2, Linux, debug configuration]\n * 62 .. 118 % [UltraSparc, debug-solaris-sparcv8-gcc]\n *\n * On the Sparc, BN_mod_exp_recp was faster than BN_mod_exp_mont\n * at 2048 and more bits, but at 512 and 1024 bits, it was\n * slower even than the standard algorithm!\n *\n * \"Real\" timings [linux-elf, solaris-sparcv9-gcc configurations]\n * should be obtained when the new Montgomery reduction code\n * has been integrated into OpenSSL.)\n */\n\n#define MONT_MUL_MOD\n#define MONT_EXP_WORD\n#define RECP_MUL_MOD\n\n#ifdef MONT_MUL_MOD\n if (BN_is_odd(m)) {\n# ifdef MONT_EXP_WORD\n if (a->top == 1 && !a->neg\n && (BN_get_flags(p, BN_FLG_CONSTTIME) == 0)\n && (BN_get_flags(a, BN_FLG_CONSTTIME) == 0)\n && (BN_get_flags(m, BN_FLG_CONSTTIME) == 0)) {\n BN_ULONG A = a->d[0];\n ret = BN_mod_exp_mont_word(r, A, p, m, ctx, NULL);\n } else\n# endif\n ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);\n } else\n#endif\n#ifdef RECP_MUL_MOD\n {\n ret = BN_mod_exp_recp(r, a, p, m, ctx);\n }\n#else\n {\n ret = BN_mod_exp_simple(r, a, p, m, ctx);\n }\n#endif\n\n bn_check_top(r);\n return ret;\n}\n\nint BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\n const BIGNUM *m, BN_CTX *ctx)\n{\n int i, j, bits, ret = 0, wstart, wend, window, wvalue;\n int start = 1;\n BIGNUM *aa;\n /* Table of variables obtained from 'ctx' */\n BIGNUM *val[TABLE_SIZE];\n BN_RECP_CTX recp;\n\n if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0\n || BN_get_flags(a, BN_FLG_CONSTTIME) != 0\n || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {\n /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */\n BNerr(BN_F_BN_MOD_EXP_RECP, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n\n bits = BN_num_bits(p);\n if (bits == 0) {\n /* x**0 mod 1, or x**0 mod -1 is still zero. */\n if (BN_abs_is_word(m, 1)) {\n ret = 1;\n BN_zero(r);\n } else {\n ret = BN_one(r);\n }\n return ret;\n }\n\n BN_RECP_CTX_init(&recp);\n\n BN_CTX_start(ctx);\n aa = BN_CTX_get(ctx);\n val[0] = BN_CTX_get(ctx);\n if (val[0] == NULL)\n goto err;\n\n if (m->neg) {\n /* ignore sign of 'm' */\n if (!BN_copy(aa, m))\n goto err;\n aa->neg = 0;\n if (BN_RECP_CTX_set(&recp, aa, ctx) <= 0)\n goto err;\n } else {\n if (BN_RECP_CTX_set(&recp, m, ctx) <= 0)\n goto err;\n }\n\n if (!BN_nnmod(val[0], a, m, ctx))\n goto err; /* 1 */\n if (BN_is_zero(val[0])) {\n BN_zero(r);\n ret = 1;\n goto err;\n }\n\n window = BN_window_bits_for_exponent_size(bits);\n if (window > 1) {\n if (!BN_mod_mul_reciprocal(aa, val[0], val[0], &recp, ctx))\n goto err; /* 2 */\n j = 1 << (window - 1);\n for (i = 1; i < j; i++) {\n if (((val[i] = BN_CTX_get(ctx)) == NULL) ||\n !BN_mod_mul_reciprocal(val[i], val[i - 1], aa, &recp, ctx))\n goto err;\n }\n }\n\n start = 1; /* This is used to avoid multiplication etc\n * when there is only the value '1' in the\n * buffer. */\n wvalue = 0; /* The 'value' of the window */\n wstart = bits - 1; /* The top bit of the window */\n wend = 0; /* The bottom bit of the window */\n\n if (!BN_one(r))\n goto err;\n\n for (;;) {\n if (BN_is_bit_set(p, wstart) == 0) {\n if (!start)\n if (!BN_mod_mul_reciprocal(r, r, r, &recp, ctx))\n goto err;\n if (wstart == 0)\n break;\n wstart--;\n continue;\n }\n /*\n * We now have wstart on a 'set' bit, we now need to work out how bit\n * a window to do. To do this we need to scan forward until the last\n * set bit before the end of the window\n */\n j = wstart;\n wvalue = 1;\n wend = 0;\n for (i = 1; i < window; i++) {\n if (wstart - i < 0)\n break;\n if (BN_is_bit_set(p, wstart - i)) {\n wvalue <<= (i - wend);\n wvalue |= 1;\n wend = i;\n }\n }\n\n /* wend is the size of the current window */\n j = wend + 1;\n /* add the 'bytes above' */\n if (!start)\n for (i = 0; i < j; i++) {\n if (!BN_mod_mul_reciprocal(r, r, r, &recp, ctx))\n goto err;\n }\n\n /* wvalue will be an odd number < 2^window */\n if (!BN_mod_mul_reciprocal(r, r, val[wvalue >> 1], &recp, ctx))\n goto err;\n\n /* move the 'window' down further */\n wstart -= wend + 1;\n wvalue = 0;\n start = 0;\n if (wstart < 0)\n break;\n }\n ret = 1;\n err:\n BN_CTX_end(ctx);\n BN_RECP_CTX_free(&recp);\n bn_check_top(r);\n return ret;\n}\n\nint BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,\n const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)\n{\n int i, j, bits, ret = 0, wstart, wend, window, wvalue;\n int start = 1;\n BIGNUM *d, *r;\n const BIGNUM *aa;\n /* Table of variables obtained from 'ctx' */\n BIGNUM *val[TABLE_SIZE];\n BN_MONT_CTX *mont = NULL;\n\n if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0\n || BN_get_flags(a, BN_FLG_CONSTTIME) != 0\n || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {\n return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);\n }\n\n bn_check_top(a);\n bn_check_top(p);\n bn_check_top(m);\n\n if (!BN_is_odd(m)) {\n BNerr(BN_F_BN_MOD_EXP_MONT, BN_R_CALLED_WITH_EVEN_MODULUS);\n return 0;\n }\n bits = BN_num_bits(p);\n if (bits == 0) {\n /* x**0 mod 1, or x**0 mod -1 is still zero. */\n if (BN_abs_is_word(m, 1)) {\n ret = 1;\n BN_zero(rr);\n } else {\n ret = BN_one(rr);\n }\n return ret;\n }\n\n BN_CTX_start(ctx);\n d = BN_CTX_get(ctx);\n r = BN_CTX_get(ctx);\n val[0] = BN_CTX_get(ctx);\n if (val[0] == NULL)\n goto err;\n\n /*\n * If this is not done, things will break in the montgomery part\n */\n\n if (in_mont != NULL)\n mont = in_mont;\n else {\n if ((mont = BN_MONT_CTX_new()) == NULL)\n goto err;\n if (!BN_MONT_CTX_set(mont, m, ctx))\n goto err;\n }\n\n if (a->neg || BN_ucmp(a, m) >= 0) {\n if (!BN_nnmod(val[0], a, m, ctx))\n goto err;\n aa = val[0];\n } else\n aa = a;\n if (!bn_to_mont_fixed_top(val[0], aa, mont, ctx))\n goto err; /* 1 */\n\n window = BN_window_bits_for_exponent_size(bits);\n if (window > 1) {\n if (!bn_mul_mont_fixed_top(d, val[0], val[0], mont, ctx))\n goto err; /* 2 */\n j = 1 << (window - 1);\n for (i = 1; i < j; i++) {\n if (((val[i] = BN_CTX_get(ctx)) == NULL) ||\n !bn_mul_mont_fixed_top(val[i], val[i - 1], d, mont, ctx))\n goto err;\n }\n }\n\n start = 1; /* This is used to avoid multiplication etc\n * when there is only the value '1' in the\n * buffer. */\n wvalue = 0; /* The 'value' of the window */\n wstart = bits - 1; /* The top bit of the window */\n wend = 0; /* The bottom bit of the window */\n\n#if 1 /* by Shay Gueron's suggestion */\n j = m->top; /* borrow j */\n if (m->d[j - 1] & (((BN_ULONG)1) << (BN_BITS2 - 1))) {\n if (bn_wexpand(r, j) == NULL)\n goto err;\n /* 2^(top*BN_BITS2) - m */\n r->d[0] = (0 - m->d[0]) & BN_MASK2;\n for (i = 1; i < j; i++)\n r->d[i] = (~m->d[i]) & BN_MASK2;\n r->top = j;\n r->flags |= BN_FLG_FIXED_TOP;\n } else\n#endif\n if (!bn_to_mont_fixed_top(r, BN_value_one(), mont, ctx))\n goto err;\n for (;;) {\n if (BN_is_bit_set(p, wstart) == 0) {\n if (!start) {\n if (!bn_mul_mont_fixed_top(r, r, r, mont, ctx))\n goto err;\n }\n if (wstart == 0)\n break;\n wstart--;\n continue;\n }\n /*\n * We now have wstart on a 'set' bit, we now need to work out how bit\n * a window to do. To do this we need to scan forward until the last\n * set bit before the end of the window\n */\n j = wstart;\n wvalue = 1;\n wend = 0;\n for (i = 1; i < window; i++) {\n if (wstart - i < 0)\n break;\n if (BN_is_bit_set(p, wstart - i)) {\n wvalue <<= (i - wend);\n wvalue |= 1;\n wend = i;\n }\n }\n\n /* wend is the size of the current window */\n j = wend + 1;\n /* add the 'bytes above' */\n if (!start)\n for (i = 0; i < j; i++) {\n if (!bn_mul_mont_fixed_top(r, r, r, mont, ctx))\n goto err;\n }\n\n /* wvalue will be an odd number < 2^window */\n if (!bn_mul_mont_fixed_top(r, r, val[wvalue >> 1], mont, ctx))\n goto err;\n\n /* move the 'window' down further */\n wstart -= wend + 1;\n wvalue = 0;\n start = 0;\n if (wstart < 0)\n break;\n }\n /*\n * Done with zero-padded intermediate BIGNUMs. Final BN_from_montgomery\n * removes padding [if any] and makes return value suitable for public\n * API consumer.\n */\n#if defined(SPARC_T4_MONT)\n if (OPENSSL_sparcv9cap_P[0] & (SPARCV9_VIS3 | SPARCV9_PREFER_FPU)) {\n j = mont->N.top; /* borrow j */\n val[0]->d[0] = 1; /* borrow val[0] */\n for (i = 1; i < j; i++)\n val[0]->d[i] = 0;\n val[0]->top = j;\n if (!BN_mod_mul_montgomery(rr, r, val[0], mont, ctx))\n goto err;\n } else\n#endif\n if (!BN_from_montgomery(rr, r, mont, ctx))\n goto err;\n ret = 1;\n err:\n if (in_mont == NULL)\n BN_MONT_CTX_free(mont);\n BN_CTX_end(ctx);\n bn_check_top(rr);\n return ret;\n}\n\nstatic BN_ULONG bn_get_bits(const BIGNUM *a, int bitpos)\n{\n BN_ULONG ret = 0;\n int wordpos;\n\n wordpos = bitpos / BN_BITS2;\n bitpos %= BN_BITS2;\n if (wordpos >= 0 && wordpos < a->top) {\n ret = a->d[wordpos] & BN_MASK2;\n if (bitpos) {\n ret >>= bitpos;\n if (++wordpos < a->top)\n ret |= a->d[wordpos] << (BN_BITS2 - bitpos);\n }\n }\n\n return ret & BN_MASK2;\n}\n\n/*\n * BN_mod_exp_mont_consttime() stores the precomputed powers in a specific\n * layout so that accessing any of these table values shows the same access\n * pattern as far as cache lines are concerned. The following functions are\n * used to transfer a BIGNUM from/to that table.\n */\n\nstatic int MOD_EXP_CTIME_COPY_TO_PREBUF(const BIGNUM *b, int top,\n unsigned char *buf, int idx,\n int window)\n{\n int i, j;\n int width = 1 << window;\n BN_ULONG *table = (BN_ULONG *)buf;\n\n if (top > b->top)\n top = b->top; /* this works because 'buf' is explicitly\n * zeroed */\n for (i = 0, j = idx; i < top; i++, j += width) {\n table[j] = b->d[i];\n }\n\n return 1;\n}\n\nstatic int MOD_EXP_CTIME_COPY_FROM_PREBUF(BIGNUM *b, int top,\n unsigned char *buf, int idx,\n int window)\n{\n int i, j;\n int width = 1 << window;\n /*\n * We declare table 'volatile' in order to discourage compiler\n * from reordering loads from the table. Concern is that if\n * reordered in specific manner loads might give away the\n * information we are trying to conceal. Some would argue that\n * compiler can reorder them anyway, but it can as well be\n * argued that doing so would be violation of standard...\n */\n volatile BN_ULONG *table = (volatile BN_ULONG *)buf;\n\n if (bn_wexpand(b, top) == NULL)\n return 0;\n\n if (window <= 3) {\n for (i = 0; i < top; i++, table += width) {\n BN_ULONG acc = 0;\n\n for (j = 0; j < width; j++) {\n acc |= table[j] &\n ((BN_ULONG)0 - (constant_time_eq_int(j,idx)&1));\n }\n\n b->d[i] = acc;\n }\n } else {\n int xstride = 1 << (window - 2);\n BN_ULONG y0, y1, y2, y3;\n\n i = idx >> (window - 2); /* equivalent of idx / xstride */\n idx &= xstride - 1; /* equivalent of idx % xstride */\n\n y0 = (BN_ULONG)0 - (constant_time_eq_int(i,0)&1);\n y1 = (BN_ULONG)0 - (constant_time_eq_int(i,1)&1);\n y2 = (BN_ULONG)0 - (constant_time_eq_int(i,2)&1);\n y3 = (BN_ULONG)0 - (constant_time_eq_int(i,3)&1);\n\n for (i = 0; i < top; i++, table += width) {\n BN_ULONG acc = 0;\n\n for (j = 0; j < xstride; j++) {\n acc |= ( (table[j + 0 * xstride] & y0) |\n (table[j + 1 * xstride] & y1) |\n (table[j + 2 * xstride] & y2) |\n (table[j + 3 * xstride] & y3) )\n & ((BN_ULONG)0 - (constant_time_eq_int(j,idx)&1));\n }\n\n b->d[i] = acc;\n }\n }\n\n b->top = top;\n b->flags |= BN_FLG_FIXED_TOP;\n return 1;\n}\n\n/*\n * Given a pointer value, compute the next address that is a cache line\n * multiple.\n */\n#define MOD_EXP_CTIME_ALIGN(x_) \\\n ((unsigned char*)(x_) + (MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH - (((size_t)(x_)) & (MOD_EXP_CTIME_MIN_CACHE_LINE_MASK))))\n\n/*\n * This variant of BN_mod_exp_mont() uses fixed windows and the special\n * precomputation memory layout to limit data-dependency to a minimum to\n * protect secret exponents (cf. the hyper-threading timing attacks pointed\n * out by Colin Percival,\n * http://www.daemonology.net/hyperthreading-considered-harmful/)\n */\nint BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,\n const BIGNUM *m, BN_CTX *ctx,\n BN_MONT_CTX *in_mont)\n{\n int i, bits, ret = 0, window, wvalue, wmask, window0;\n int top;\n BN_MONT_CTX *mont = NULL;\n\n int numPowers;\n unsigned char *powerbufFree = NULL;\n int powerbufLen = 0;\n unsigned char *powerbuf = NULL;\n BIGNUM tmp, am;\n#if defined(SPARC_T4_MONT)\n unsigned int t4 = 0;\n#endif\n\n bn_check_top(a);\n bn_check_top(p);\n bn_check_top(m);\n\n if (!BN_is_odd(m)) {\n BNerr(BN_F_BN_MOD_EXP_MONT_CONSTTIME, BN_R_CALLED_WITH_EVEN_MODULUS);\n return 0;\n }\n\n top = m->top;\n\n /*\n * Use all bits stored in |p|, rather than |BN_num_bits|, so we do not leak\n * whether the top bits are zero.\n */\n bits = p->top * BN_BITS2;\n if (bits == 0) {\n /* x**0 mod 1, or x**0 mod -1 is still zero. */\n if (BN_abs_is_word(m, 1)) {\n ret = 1;\n BN_zero(rr);\n } else {\n ret = BN_one(rr);\n }\n return ret;\n }\n\n BN_CTX_start(ctx);\n\n /*\n * Allocate a montgomery context if it was not supplied by the caller. If\n * this is not done, things will break in the montgomery part.\n */\n if (in_mont != NULL)\n mont = in_mont;\n else {\n if ((mont = BN_MONT_CTX_new()) == NULL)\n goto err;\n if (!BN_MONT_CTX_set(mont, m, ctx))\n goto err;\n }\n\n if (a->neg || BN_ucmp(a, m) >= 0) {\n BIGNUM *reduced = BN_CTX_get(ctx);\n if (reduced == NULL\n || !BN_nnmod(reduced, a, m, ctx)) {\n goto err;\n }\n a = reduced;\n }\n\n#ifdef RSAZ_ENABLED\n /*\n * If the size of the operands allow it, perform the optimized\n * RSAZ exponentiation. For further information see\n * crypto/bn/rsaz_exp.c and accompanying assembly modules.\n */\n if ((16 == a->top) && (16 == p->top) && (BN_num_bits(m) == 1024)\n && rsaz_avx2_eligible()) {\n if (NULL == bn_wexpand(rr, 16))\n goto err;\n RSAZ_1024_mod_exp_avx2(rr->d, a->d, p->d, m->d, mont->RR.d,\n mont->n0[0]);\n rr->top = 16;\n rr->neg = 0;\n bn_correct_top(rr);\n ret = 1;\n goto err;\n } else if ((8 == a->top) && (8 == p->top) && (BN_num_bits(m) == 512)) {\n if (NULL == bn_wexpand(rr, 8))\n goto err;\n RSAZ_512_mod_exp(rr->d, a->d, p->d, m->d, mont->n0[0], mont->RR.d);\n rr->top = 8;\n rr->neg = 0;\n bn_correct_top(rr);\n ret = 1;\n goto err;\n }\n#endif\n\n /* Get the window size to use with size of p. */\n window = BN_window_bits_for_ctime_exponent_size(bits);\n#if defined(SPARC_T4_MONT)\n if (window >= 5 && (top & 15) == 0 && top <= 64 &&\n (OPENSSL_sparcv9cap_P[1] & (CFR_MONTMUL | CFR_MONTSQR)) ==\n (CFR_MONTMUL | CFR_MONTSQR) && (t4 = OPENSSL_sparcv9cap_P[0]))\n window = 5;\n else\n#endif\n#if defined(OPENSSL_BN_ASM_MONT5)\n if (window >= 5) {\n window = 5; /* ~5% improvement for RSA2048 sign, and even\n * for RSA4096 */\n /* reserve space for mont->N.d[] copy */\n powerbufLen += top * sizeof(mont->N.d[0]);\n }\n#endif\n (void)0;\n\n /*\n * Allocate a buffer large enough to hold all of the pre-computed powers\n * of am, am itself and tmp.\n */\n numPowers = 1 << window;\n powerbufLen += sizeof(m->d[0]) * (top * numPowers +\n ((2 * top) >\n numPowers ? (2 * top) : numPowers));\n#ifdef alloca\n if (powerbufLen < 3072)\n powerbufFree =\n alloca(powerbufLen + MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH);\n else\n#endif\n if ((powerbufFree =\n OPENSSL_malloc(powerbufLen + MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH))\n == NULL)\n goto err;\n\n powerbuf = MOD_EXP_CTIME_ALIGN(powerbufFree);\n memset(powerbuf, 0, powerbufLen);\n\n#ifdef alloca\n if (powerbufLen < 3072)\n powerbufFree = NULL;\n#endif\n\n /* lay down tmp and am right after powers table */\n tmp.d = (BN_ULONG *)(powerbuf + sizeof(m->d[0]) * top * numPowers);\n am.d = tmp.d + top;\n tmp.top = am.top = 0;\n tmp.dmax = am.dmax = top;\n tmp.neg = am.neg = 0;\n tmp.flags = am.flags = BN_FLG_STATIC_DATA;\n\n /* prepare a^0 in Montgomery domain */\n#if 1 /* by Shay Gueron's suggestion */\n if (m->d[top - 1] & (((BN_ULONG)1) << (BN_BITS2 - 1))) {\n /* 2^(top*BN_BITS2) - m */\n tmp.d[0] = (0 - m->d[0]) & BN_MASK2;\n for (i = 1; i < top; i++)\n tmp.d[i] = (~m->d[i]) & BN_MASK2;\n tmp.top = top;\n } else\n#endif\n if (!bn_to_mont_fixed_top(&tmp, BN_value_one(), mont, ctx))\n goto err;\n\n /* prepare a^1 in Montgomery domain */\n if (!bn_to_mont_fixed_top(&am, a, mont, ctx))\n goto err;\n\n#if defined(SPARC_T4_MONT)\n if (t4) {\n typedef int (*bn_pwr5_mont_f) (BN_ULONG *tp, const BN_ULONG *np,\n const BN_ULONG *n0, const void *table,\n int power, int bits);\n int bn_pwr5_mont_t4_8(BN_ULONG *tp, const BN_ULONG *np,\n const BN_ULONG *n0, const void *table,\n int power, int bits);\n int bn_pwr5_mont_t4_16(BN_ULONG *tp, const BN_ULONG *np,\n const BN_ULONG *n0, const void *table,\n int power, int bits);\n int bn_pwr5_mont_t4_24(BN_ULONG *tp, const BN_ULONG *np,\n const BN_ULONG *n0, const void *table,\n int power, int bits);\n int bn_pwr5_mont_t4_32(BN_ULONG *tp, const BN_ULONG *np,\n const BN_ULONG *n0, const void *table,\n int power, int bits);\n static const bn_pwr5_mont_f pwr5_funcs[4] = {\n bn_pwr5_mont_t4_8, bn_pwr5_mont_t4_16,\n bn_pwr5_mont_t4_24, bn_pwr5_mont_t4_32\n };\n bn_pwr5_mont_f pwr5_worker = pwr5_funcs[top / 16 - 1];\n\n typedef int (*bn_mul_mont_f) (BN_ULONG *rp, const BN_ULONG *ap,\n const void *bp, const BN_ULONG *np,\n const BN_ULONG *n0);\n int bn_mul_mont_t4_8(BN_ULONG *rp, const BN_ULONG *ap, const void *bp,\n const BN_ULONG *np, const BN_ULONG *n0);\n int bn_mul_mont_t4_16(BN_ULONG *rp, const BN_ULONG *ap,\n const void *bp, const BN_ULONG *np,\n const BN_ULONG *n0);\n int bn_mul_mont_t4_24(BN_ULONG *rp, const BN_ULONG *ap,\n const void *bp, const BN_ULONG *np,\n const BN_ULONG *n0);\n int bn_mul_mont_t4_32(BN_ULONG *rp, const BN_ULONG *ap,\n const void *bp, const BN_ULONG *np,\n const BN_ULONG *n0);\n static const bn_mul_mont_f mul_funcs[4] = {\n bn_mul_mont_t4_8, bn_mul_mont_t4_16,\n bn_mul_mont_t4_24, bn_mul_mont_t4_32\n };\n bn_mul_mont_f mul_worker = mul_funcs[top / 16 - 1];\n\n void bn_mul_mont_vis3(BN_ULONG *rp, const BN_ULONG *ap,\n const void *bp, const BN_ULONG *np,\n const BN_ULONG *n0, int num);\n void bn_mul_mont_t4(BN_ULONG *rp, const BN_ULONG *ap,\n const void *bp, const BN_ULONG *np,\n const BN_ULONG *n0, int num);\n void bn_mul_mont_gather5_t4(BN_ULONG *rp, const BN_ULONG *ap,\n const void *table, const BN_ULONG *np,\n const BN_ULONG *n0, int num, int power);\n void bn_flip_n_scatter5_t4(const BN_ULONG *inp, size_t num,\n void *table, size_t power);\n void bn_gather5_t4(BN_ULONG *out, size_t num,\n void *table, size_t power);\n void bn_flip_t4(BN_ULONG *dst, BN_ULONG *src, size_t num);\n\n BN_ULONG *np = mont->N.d, *n0 = mont->n0;\n int stride = 5 * (6 - (top / 16 - 1)); /* multiple of 5, but less\n * than 32 */\n\n /*\n * BN_to_montgomery can contaminate words above .top [in\n * BN_DEBUG[_DEBUG] build]...\n */\n for (i = am.top; i < top; i++)\n am.d[i] = 0;\n for (i = tmp.top; i < top; i++)\n tmp.d[i] = 0;\n\n bn_flip_n_scatter5_t4(tmp.d, top, powerbuf, 0);\n bn_flip_n_scatter5_t4(am.d, top, powerbuf, 1);\n if (!(*mul_worker) (tmp.d, am.d, am.d, np, n0) &&\n !(*mul_worker) (tmp.d, am.d, am.d, np, n0))\n bn_mul_mont_vis3(tmp.d, am.d, am.d, np, n0, top);\n bn_flip_n_scatter5_t4(tmp.d, top, powerbuf, 2);\n\n for (i = 3; i < 32; i++) {\n /* Calculate a^i = a^(i-1) * a */\n if (!(*mul_worker) (tmp.d, tmp.d, am.d, np, n0) &&\n !(*mul_worker) (tmp.d, tmp.d, am.d, np, n0))\n bn_mul_mont_vis3(tmp.d, tmp.d, am.d, np, n0, top);\n bn_flip_n_scatter5_t4(tmp.d, top, powerbuf, i);\n }\n\n /* switch to 64-bit domain */\n np = alloca(top * sizeof(BN_ULONG));\n top /= 2;\n bn_flip_t4(np, mont->N.d, top);\n\n /*\n * The exponent may not have a whole number of fixed-size windows.\n * To simplify the main loop, the initial window has between 1 and\n * full-window-size bits such that what remains is always a whole\n * number of windows\n */\n window0 = (bits - 1) % 5 + 1;\n wmask = (1 << window0) - 1;\n bits -= window0;\n wvalue = bn_get_bits(p, bits) & wmask;\n bn_gather5_t4(tmp.d, top, powerbuf, wvalue);\n\n /*\n * Scan the exponent one window at a time starting from the most\n * significant bits.\n */\n while (bits > 0) {\n if (bits < stride)\n stride = bits;\n bits -= stride;\n wvalue = bn_get_bits(p, bits);\n\n if ((*pwr5_worker) (tmp.d, np, n0, powerbuf, wvalue, stride))\n continue;\n /* retry once and fall back */\n if ((*pwr5_worker) (tmp.d, np, n0, powerbuf, wvalue, stride))\n continue;\n\n bits += stride - 5;\n wvalue >>= stride - 5;\n wvalue &= 31;\n bn_mul_mont_t4(tmp.d, tmp.d, tmp.d, np, n0, top);\n bn_mul_mont_t4(tmp.d, tmp.d, tmp.d, np, n0, top);\n bn_mul_mont_t4(tmp.d, tmp.d, tmp.d, np, n0, top);\n bn_mul_mont_t4(tmp.d, tmp.d, tmp.d, np, n0, top);\n bn_mul_mont_t4(tmp.d, tmp.d, tmp.d, np, n0, top);\n bn_mul_mont_gather5_t4(tmp.d, tmp.d, powerbuf, np, n0, top,\n wvalue);\n }\n\n bn_flip_t4(tmp.d, tmp.d, top);\n top *= 2;\n /* back to 32-bit domain */\n tmp.top = top;\n bn_correct_top(&tmp);\n OPENSSL_cleanse(np, top * sizeof(BN_ULONG));\n } else\n#endif\n#if defined(OPENSSL_BN_ASM_MONT5)\n if (window == 5 && top > 1) {\n /*\n * This optimization uses ideas from http://eprint.iacr.org/2011/239,\n * specifically optimization of cache-timing attack countermeasures\n * and pre-computation optimization.\n */\n\n /*\n * Dedicated window==4 case improves 512-bit RSA sign by ~15%, but as\n * 512-bit RSA is hardly relevant, we omit it to spare size...\n */\n void bn_mul_mont_gather5(BN_ULONG *rp, const BN_ULONG *ap,\n const void *table, const BN_ULONG *np,\n const BN_ULONG *n0, int num, int power);\n void bn_scatter5(const BN_ULONG *inp, size_t num,\n void *table, size_t power);\n void bn_gather5(BN_ULONG *out, size_t num, void *table, size_t power);\n void bn_power5(BN_ULONG *rp, const BN_ULONG *ap,\n const void *table, const BN_ULONG *np,\n const BN_ULONG *n0, int num, int power);\n int bn_get_bits5(const BN_ULONG *ap, int off);\n int bn_from_montgomery(BN_ULONG *rp, const BN_ULONG *ap,\n const BN_ULONG *not_used, const BN_ULONG *np,\n const BN_ULONG *n0, int num);\n\n BN_ULONG *n0 = mont->n0, *np;\n\n /*\n * BN_to_montgomery can contaminate words above .top [in\n * BN_DEBUG[_DEBUG] build]...\n */\n for (i = am.top; i < top; i++)\n am.d[i] = 0;\n for (i = tmp.top; i < top; i++)\n tmp.d[i] = 0;\n\n /*\n * copy mont->N.d[] to improve cache locality\n */\n for (np = am.d + top, i = 0; i < top; i++)\n np[i] = mont->N.d[i];\n\n bn_scatter5(tmp.d, top, powerbuf, 0);\n bn_scatter5(am.d, am.top, powerbuf, 1);\n bn_mul_mont(tmp.d, am.d, am.d, np, n0, top);\n bn_scatter5(tmp.d, top, powerbuf, 2);\n\n# if 0\n for (i = 3; i < 32; i++) {\n /* Calculate a^i = a^(i-1) * a */\n bn_mul_mont_gather5(tmp.d, am.d, powerbuf, np, n0, top, i - 1);\n bn_scatter5(tmp.d, top, powerbuf, i);\n }\n# else\n /* same as above, but uses squaring for 1/2 of operations */\n for (i = 4; i < 32; i *= 2) {\n bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);\n bn_scatter5(tmp.d, top, powerbuf, i);\n }\n for (i = 3; i < 8; i += 2) {\n int j;\n bn_mul_mont_gather5(tmp.d, am.d, powerbuf, np, n0, top, i - 1);\n bn_scatter5(tmp.d, top, powerbuf, i);\n for (j = 2 * i; j < 32; j *= 2) {\n bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);\n bn_scatter5(tmp.d, top, powerbuf, j);\n }\n }\n for (; i < 16; i += 2) {\n bn_mul_mont_gather5(tmp.d, am.d, powerbuf, np, n0, top, i - 1);\n bn_scatter5(tmp.d, top, powerbuf, i);\n bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);\n bn_scatter5(tmp.d, top, powerbuf, 2 * i);\n }\n for (; i < 32; i += 2) {\n bn_mul_mont_gather5(tmp.d, am.d, powerbuf, np, n0, top, i - 1);\n bn_scatter5(tmp.d, top, powerbuf, i);\n }\n# endif\n /*\n * The exponent may not have a whole number of fixed-size windows.\n * To simplify the main loop, the initial window has between 1 and\n * full-window-size bits such that what remains is always a whole\n * number of windows\n */\n window0 = (bits - 1) % 5 + 1;\n wmask = (1 << window0) - 1;\n bits -= window0;\n wvalue = bn_get_bits(p, bits) & wmask;\n bn_gather5(tmp.d, top, powerbuf, wvalue);\n\n /*\n * Scan the exponent one window at a time starting from the most\n * significant bits.\n */\n if (top & 7) {\n while (bits > 0) {\n bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);\n bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);\n bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);\n bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);\n bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);\n bn_mul_mont_gather5(tmp.d, tmp.d, powerbuf, np, n0, top,\n bn_get_bits5(p->d, bits -= 5));\n }\n } else {\n while (bits > 0) {\n bn_power5(tmp.d, tmp.d, powerbuf, np, n0, top,\n bn_get_bits5(p->d, bits -= 5));\n }\n }\n\n ret = bn_from_montgomery(tmp.d, tmp.d, NULL, np, n0, top);\n tmp.top = top;\n bn_correct_top(&tmp);\n if (ret) {\n if (!BN_copy(rr, &tmp))\n ret = 0;\n goto err; /* non-zero ret means it's not error */\n }\n } else\n#endif\n {\n if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&tmp, top, powerbuf, 0, window))\n goto err;\n if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&am, top, powerbuf, 1, window))\n goto err;\n\n /*\n * If the window size is greater than 1, then calculate\n * val[i=2..2^winsize-1]. Powers are computed as a*a^(i-1) (even\n * powers could instead be computed as (a^(i/2))^2 to use the slight\n * performance advantage of sqr over mul).\n */\n if (window > 1) {\n if (!bn_mul_mont_fixed_top(&tmp, &am, &am, mont, ctx))\n goto err;\n if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&tmp, top, powerbuf, 2,\n window))\n goto err;\n for (i = 3; i < numPowers; i++) {\n /* Calculate a^i = a^(i-1) * a */\n if (!bn_mul_mont_fixed_top(&tmp, &am, &tmp, mont, ctx))\n goto err;\n if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&tmp, top, powerbuf, i,\n window))\n goto err;\n }\n }\n\n /*\n * The exponent may not have a whole number of fixed-size windows.\n * To simplify the main loop, the initial window has between 1 and\n * full-window-size bits such that what remains is always a whole\n * number of windows\n */\n window0 = (bits - 1) % window + 1;\n wmask = (1 << window0) - 1;\n bits -= window0;\n wvalue = bn_get_bits(p, bits) & wmask;\n if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&tmp, top, powerbuf, wvalue,\n window))\n goto err;\n\n wmask = (1 << window) - 1;\n /*\n * Scan the exponent one window at a time starting from the most\n * significant bits.\n */\n while (bits > 0) {\n\n /* Square the result window-size times */\n for (i = 0; i < window; i++)\n if (!bn_mul_mont_fixed_top(&tmp, &tmp, &tmp, mont, ctx))\n goto err;\n\n /*\n * Get a window's worth of bits from the exponent\n * This avoids calling BN_is_bit_set for each bit, which\n * is not only slower but also makes each bit vulnerable to\n * EM (and likely other) side-channel attacks like One&Done\n * (for details see \"One&Done: A Single-Decryption EM-Based\n * Attack on OpenSSL's Constant-Time Blinded RSA\" by M. Alam,\n * H. Khan, M. Dey, N. Sinha, R. Callan, A. Zajic, and\n * M. Prvulovic, in USENIX Security'18)\n */\n bits -= window;\n wvalue = bn_get_bits(p, bits) & wmask;\n /*\n * Fetch the appropriate pre-computed value from the pre-buf\n */\n if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&am, top, powerbuf, wvalue,\n window))\n goto err;\n\n /* Multiply the result into the intermediate result */\n if (!bn_mul_mont_fixed_top(&tmp, &tmp, &am, mont, ctx))\n goto err;\n }\n }\n\n /*\n * Done with zero-padded intermediate BIGNUMs. Final BN_from_montgomery\n * removes padding [if any] and makes return value suitable for public\n * API consumer.\n */\n#if defined(SPARC_T4_MONT)\n if (OPENSSL_sparcv9cap_P[0] & (SPARCV9_VIS3 | SPARCV9_PREFER_FPU)) {\n am.d[0] = 1; /* borrow am */\n for (i = 1; i < top; i++)\n am.d[i] = 0;\n if (!BN_mod_mul_montgomery(rr, &tmp, &am, mont, ctx))\n goto err;\n } else\n#endif\n if (!BN_from_montgomery(rr, &tmp, mont, ctx))\n goto err;\n ret = 1;\n err:\n if (in_mont == NULL)\n BN_MONT_CTX_free(mont);\n if (powerbuf != NULL) {\n OPENSSL_cleanse(powerbuf, powerbufLen);\n OPENSSL_free(powerbufFree);\n }\n BN_CTX_end(ctx);\n return ret;\n}\n\nint BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,\n const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)\n{\n BN_MONT_CTX *mont = NULL;\n int b, bits, ret = 0;\n int r_is_one;\n BN_ULONG w, next_w;\n BIGNUM *r, *t;\n BIGNUM *swap_tmp;\n#define BN_MOD_MUL_WORD(r, w, m) \\\n (BN_mul_word(r, (w)) && \\\n (/* BN_ucmp(r, (m)) < 0 ? 1 :*/ \\\n (BN_mod(t, r, m, ctx) && (swap_tmp = r, r = t, t = swap_tmp, 1))))\n /*\n * BN_MOD_MUL_WORD is only used with 'w' large, so the BN_ucmp test is\n * probably more overhead than always using BN_mod (which uses BN_copy if\n * a similar test returns true).\n */\n /*\n * We can use BN_mod and do not need BN_nnmod because our accumulator is\n * never negative (the result of BN_mod does not depend on the sign of\n * the modulus).\n */\n#define BN_TO_MONTGOMERY_WORD(r, w, mont) \\\n (BN_set_word(r, (w)) && BN_to_montgomery(r, r, (mont), ctx))\n\n if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0\n || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {\n /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */\n BNerr(BN_F_BN_MOD_EXP_MONT_WORD, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n\n bn_check_top(p);\n bn_check_top(m);\n\n if (!BN_is_odd(m)) {\n BNerr(BN_F_BN_MOD_EXP_MONT_WORD, BN_R_CALLED_WITH_EVEN_MODULUS);\n return 0;\n }\n if (m->top == 1)\n a %= m->d[0]; /* make sure that 'a' is reduced */\n\n bits = BN_num_bits(p);\n if (bits == 0) {\n /* x**0 mod 1, or x**0 mod -1 is still zero. */\n if (BN_abs_is_word(m, 1)) {\n ret = 1;\n BN_zero(rr);\n } else {\n ret = BN_one(rr);\n }\n return ret;\n }\n if (a == 0) {\n BN_zero(rr);\n ret = 1;\n return ret;\n }\n\n BN_CTX_start(ctx);\n r = BN_CTX_get(ctx);\n t = BN_CTX_get(ctx);\n if (t == NULL)\n goto err;\n\n if (in_mont != NULL)\n mont = in_mont;\n else {\n if ((mont = BN_MONT_CTX_new()) == NULL)\n goto err;\n if (!BN_MONT_CTX_set(mont, m, ctx))\n goto err;\n }\n\n r_is_one = 1; /* except for Montgomery factor */\n\n /* bits-1 >= 0 */\n\n /* The result is accumulated in the product r*w. */\n w = a; /* bit 'bits-1' of 'p' is always set */\n for (b = bits - 2; b >= 0; b--) {\n /* First, square r*w. */\n next_w = w * w;\n if ((next_w / w) != w) { /* overflow */\n if (r_is_one) {\n if (!BN_TO_MONTGOMERY_WORD(r, w, mont))\n goto err;\n r_is_one = 0;\n } else {\n if (!BN_MOD_MUL_WORD(r, w, m))\n goto err;\n }\n next_w = 1;\n }\n w = next_w;\n if (!r_is_one) {\n if (!BN_mod_mul_montgomery(r, r, r, mont, ctx))\n goto err;\n }\n\n /* Second, multiply r*w by 'a' if exponent bit is set. */\n if (BN_is_bit_set(p, b)) {\n next_w = w * a;\n if ((next_w / a) != w) { /* overflow */\n if (r_is_one) {\n if (!BN_TO_MONTGOMERY_WORD(r, w, mont))\n goto err;\n r_is_one = 0;\n } else {\n if (!BN_MOD_MUL_WORD(r, w, m))\n goto err;\n }\n next_w = a;\n }\n w = next_w;\n }\n }\n\n /* Finally, set r:=r*w. */\n if (w != 1) {\n if (r_is_one) {\n if (!BN_TO_MONTGOMERY_WORD(r, w, mont))\n goto err;\n r_is_one = 0;\n } else {\n if (!BN_MOD_MUL_WORD(r, w, m))\n goto err;\n }\n }\n\n if (r_is_one) { /* can happen only if a == 1 */\n if (!BN_one(rr))\n goto err;\n } else {\n if (!BN_from_montgomery(rr, r, mont, ctx))\n goto err;\n }\n ret = 1;\n err:\n if (in_mont == NULL)\n BN_MONT_CTX_free(mont);\n BN_CTX_end(ctx);\n bn_check_top(rr);\n return ret;\n}\n\n/* The old fallback, simple version :-) */\nint BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\n const BIGNUM *m, BN_CTX *ctx)\n{\n int i, j, bits, ret = 0, wstart, wend, window, wvalue;\n int start = 1;\n BIGNUM *d;\n /* Table of variables obtained from 'ctx' */\n BIGNUM *val[TABLE_SIZE];\n\n if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0\n || BN_get_flags(a, BN_FLG_CONSTTIME) != 0\n || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {\n /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */\n BNerr(BN_F_BN_MOD_EXP_SIMPLE, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n\n bits = BN_num_bits(p);\n if (bits == 0) {\n /* x**0 mod 1, or x**0 mod -1 is still zero. */\n if (BN_abs_is_word(m, 1)) {\n ret = 1;\n BN_zero(r);\n } else {\n ret = BN_one(r);\n }\n return ret;\n }\n\n BN_CTX_start(ctx);\n d = BN_CTX_get(ctx);\n val[0] = BN_CTX_get(ctx);\n if (val[0] == NULL)\n goto err;\n\n if (!BN_nnmod(val[0], a, m, ctx))\n goto err; /* 1 */\n if (BN_is_zero(val[0])) {\n BN_zero(r);\n ret = 1;\n goto err;\n }\n\n window = BN_window_bits_for_exponent_size(bits);\n if (window > 1) {\n if (!BN_mod_mul(d, val[0], val[0], m, ctx))\n goto err; /* 2 */\n j = 1 << (window - 1);\n for (i = 1; i < j; i++) {\n if (((val[i] = BN_CTX_get(ctx)) == NULL) ||\n !BN_mod_mul(val[i], val[i - 1], d, m, ctx))\n goto err;\n }\n }\n\n start = 1; /* This is used to avoid multiplication etc\n * when there is only the value '1' in the\n * buffer. */\n wvalue = 0; /* The 'value' of the window */\n wstart = bits - 1; /* The top bit of the window */\n wend = 0; /* The bottom bit of the window */\n\n if (!BN_one(r))\n goto err;\n\n for (;;) {\n if (BN_is_bit_set(p, wstart) == 0) {\n if (!start)\n if (!BN_mod_mul(r, r, r, m, ctx))\n goto err;\n if (wstart == 0)\n break;\n wstart--;\n continue;\n }\n /*\n * We now have wstart on a 'set' bit, we now need to work out how bit\n * a window to do. To do this we need to scan forward until the last\n * set bit before the end of the window\n */\n j = wstart;\n wvalue = 1;\n wend = 0;\n for (i = 1; i < window; i++) {\n if (wstart - i < 0)\n break;\n if (BN_is_bit_set(p, wstart - i)) {\n wvalue <<= (i - wend);\n wvalue |= 1;\n wend = i;\n }\n }\n\n /* wend is the size of the current window */\n j = wend + 1;\n /* add the 'bytes above' */\n if (!start)\n for (i = 0; i < j; i++) {\n if (!BN_mod_mul(r, r, r, m, ctx))\n goto err;\n }\n\n /* wvalue will be an odd number < 2^window */\n if (!BN_mod_mul(r, r, val[wvalue >> 1], m, ctx))\n goto err;\n\n /* move the 'window' down further */\n wstart -= wend + 1;\n wvalue = 0;\n start = 0;\n if (wstart < 0)\n break;\n }\n ret = 1;\n err:\n BN_CTX_end(ctx);\n bn_check_top(r);\n return ret;\n}\n" }, { "path": "cryptomini/bn/bn_gcd.c", "content": "/*\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \"internal/cryptlib.h\"\n#include \"bn_local.h\"\n\n/*\n * bn_mod_inverse_no_branch is a special version of BN_mod_inverse. It does\n * not contain branches that may leak sensitive information.\n *\n * This is a static function, we ensure all callers in this file pass valid\n * arguments: all passed pointers here are non-NULL.\n */\nstatic ossl_inline\nBIGNUM *bn_mod_inverse_no_branch(BIGNUM *in,\n const BIGNUM *a, const BIGNUM *n,\n BN_CTX *ctx, int *pnoinv)\n{\n BIGNUM *A, *B, *X, *Y, *M, *D, *T, *R = NULL;\n BIGNUM *ret = NULL;\n int sign;\n\n bn_check_top(a);\n bn_check_top(n);\n\n BN_CTX_start(ctx);\n A = BN_CTX_get(ctx);\n B = BN_CTX_get(ctx);\n X = BN_CTX_get(ctx);\n D = BN_CTX_get(ctx);\n M = BN_CTX_get(ctx);\n Y = BN_CTX_get(ctx);\n T = BN_CTX_get(ctx);\n if (T == NULL)\n goto err;\n\n if (in == NULL)\n R = BN_new();\n else\n R = in;\n if (R == NULL)\n goto err;\n\n BN_one(X);\n BN_zero(Y);\n if (BN_copy(B, a) == NULL)\n goto err;\n if (BN_copy(A, n) == NULL)\n goto err;\n A->neg = 0;\n\n if (B->neg || (BN_ucmp(B, A) >= 0)) {\n /*\n * Turn BN_FLG_CONSTTIME flag on, so that when BN_div is invoked,\n * BN_div_no_branch will be called eventually.\n */\n {\n BIGNUM local_B;\n bn_init(&local_B);\n BN_with_flags(&local_B, B, BN_FLG_CONSTTIME);\n if (!BN_nnmod(B, &local_B, A, ctx))\n goto err;\n /* Ensure local_B goes out of scope before any further use of B */\n }\n }\n sign = -1;\n /*-\n * From B = a mod |n|, A = |n| it follows that\n *\n * 0 <= B < A,\n * -sign*X*a == B (mod |n|),\n * sign*Y*a == A (mod |n|).\n */\n\n while (!BN_is_zero(B)) {\n BIGNUM *tmp;\n\n /*-\n * 0 < B < A,\n * (*) -sign*X*a == B (mod |n|),\n * sign*Y*a == A (mod |n|)\n */\n\n /*\n * Turn BN_FLG_CONSTTIME flag on, so that when BN_div is invoked,\n * BN_div_no_branch will be called eventually.\n */\n {\n BIGNUM local_A;\n bn_init(&local_A);\n BN_with_flags(&local_A, A, BN_FLG_CONSTTIME);\n\n /* (D, M) := (A/B, A%B) ... */\n if (!BN_div(D, M, &local_A, B, ctx))\n goto err;\n /* Ensure local_A goes out of scope before any further use of A */\n }\n\n /*-\n * Now\n * A = D*B + M;\n * thus we have\n * (**) sign*Y*a == D*B + M (mod |n|).\n */\n\n tmp = A; /* keep the BIGNUM object, the value does not\n * matter */\n\n /* (A, B) := (B, A mod B) ... */\n A = B;\n B = M;\n /* ... so we have 0 <= B < A again */\n\n /*-\n * Since the former M is now B and the former B is now A,\n * (**) translates into\n * sign*Y*a == D*A + B (mod |n|),\n * i.e.\n * sign*Y*a - D*A == B (mod |n|).\n * Similarly, (*) translates into\n * -sign*X*a == A (mod |n|).\n *\n * Thus,\n * sign*Y*a + D*sign*X*a == B (mod |n|),\n * i.e.\n * sign*(Y + D*X)*a == B (mod |n|).\n *\n * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at\n * -sign*X*a == B (mod |n|),\n * sign*Y*a == A (mod |n|).\n * Note that X and Y stay non-negative all the time.\n */\n\n if (!BN_mul(tmp, D, X, ctx))\n goto err;\n if (!BN_add(tmp, tmp, Y))\n goto err;\n\n M = Y; /* keep the BIGNUM object, the value does not\n * matter */\n Y = X;\n X = tmp;\n sign = -sign;\n }\n\n /*-\n * The while loop (Euclid's algorithm) ends when\n * A == gcd(a,n);\n * we have\n * sign*Y*a == A (mod |n|),\n * where Y is non-negative.\n */\n\n if (sign < 0) {\n if (!BN_sub(Y, n, Y))\n goto err;\n }\n /* Now Y*a == A (mod |n|). */\n\n if (BN_is_one(A)) {\n /* Y*a == 1 (mod |n|) */\n if (!Y->neg && BN_ucmp(Y, n) < 0) {\n if (!BN_copy(R, Y))\n goto err;\n } else {\n if (!BN_nnmod(R, Y, n, ctx))\n goto err;\n }\n } else {\n *pnoinv = 1;\n /* caller sets the BN_R_NO_INVERSE error */\n goto err;\n }\n\n ret = R;\n *pnoinv = 0;\n\n err:\n if ((ret == NULL) && (in == NULL))\n BN_free(R);\n BN_CTX_end(ctx);\n bn_check_top(ret);\n return ret;\n}\n\n/*\n * This is an internal function, we assume all callers pass valid arguments:\n * all pointers passed here are assumed non-NULL.\n */\nBIGNUM *int_bn_mod_inverse(BIGNUM *in,\n const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,\n int *pnoinv)\n{\n BIGNUM *A, *B, *X, *Y, *M, *D, *T, *R = NULL;\n BIGNUM *ret = NULL;\n int sign;\n\n /* This is invalid input so we don't worry about constant time here */\n if (BN_abs_is_word(n, 1) || BN_is_zero(n)) {\n *pnoinv = 1;\n return NULL;\n }\n\n *pnoinv = 0;\n\n if ((BN_get_flags(a, BN_FLG_CONSTTIME) != 0)\n || (BN_get_flags(n, BN_FLG_CONSTTIME) != 0)) {\n return bn_mod_inverse_no_branch(in, a, n, ctx, pnoinv);\n }\n\n bn_check_top(a);\n bn_check_top(n);\n\n BN_CTX_start(ctx);\n A = BN_CTX_get(ctx);\n B = BN_CTX_get(ctx);\n X = BN_CTX_get(ctx);\n D = BN_CTX_get(ctx);\n M = BN_CTX_get(ctx);\n Y = BN_CTX_get(ctx);\n T = BN_CTX_get(ctx);\n if (T == NULL)\n goto err;\n\n if (in == NULL)\n R = BN_new();\n else\n R = in;\n if (R == NULL)\n goto err;\n\n BN_one(X);\n BN_zero(Y);\n if (BN_copy(B, a) == NULL)\n goto err;\n if (BN_copy(A, n) == NULL)\n goto err;\n A->neg = 0;\n if (B->neg || (BN_ucmp(B, A) >= 0)) {\n if (!BN_nnmod(B, B, A, ctx))\n goto err;\n }\n sign = -1;\n /*-\n * From B = a mod |n|, A = |n| it follows that\n *\n * 0 <= B < A,\n * -sign*X*a == B (mod |n|),\n * sign*Y*a == A (mod |n|).\n */\n\n if (BN_is_odd(n) && (BN_num_bits(n) <= 2048)) {\n /*\n * Binary inversion algorithm; requires odd modulus. This is faster\n * than the general algorithm if the modulus is sufficiently small\n * (about 400 .. 500 bits on 32-bit systems, but much more on 64-bit\n * systems)\n */\n int shift;\n\n while (!BN_is_zero(B)) {\n /*-\n * 0 < B < |n|,\n * 0 < A <= |n|,\n * (1) -sign*X*a == B (mod |n|),\n * (2) sign*Y*a == A (mod |n|)\n */\n\n /*\n * Now divide B by the maximum possible power of two in the\n * integers, and divide X by the same value mod |n|. When we're\n * done, (1) still holds.\n */\n shift = 0;\n while (!BN_is_bit_set(B, shift)) { /* note that 0 < B */\n shift++;\n\n if (BN_is_odd(X)) {\n if (!BN_uadd(X, X, n))\n goto err;\n }\n /*\n * now X is even, so we can easily divide it by two\n */\n if (!BN_rshift1(X, X))\n goto err;\n }\n if (shift > 0) {\n if (!BN_rshift(B, B, shift))\n goto err;\n }\n\n /*\n * Same for A and Y. Afterwards, (2) still holds.\n */\n shift = 0;\n while (!BN_is_bit_set(A, shift)) { /* note that 0 < A */\n shift++;\n\n if (BN_is_odd(Y)) {\n if (!BN_uadd(Y, Y, n))\n goto err;\n }\n /* now Y is even */\n if (!BN_rshift1(Y, Y))\n goto err;\n }\n if (shift > 0) {\n if (!BN_rshift(A, A, shift))\n goto err;\n }\n\n /*-\n * We still have (1) and (2).\n * Both A and B are odd.\n * The following computations ensure that\n *\n * 0 <= B < |n|,\n * 0 < A < |n|,\n * (1) -sign*X*a == B (mod |n|),\n * (2) sign*Y*a == A (mod |n|),\n *\n * and that either A or B is even in the next iteration.\n */\n if (BN_ucmp(B, A) >= 0) {\n /* -sign*(X + Y)*a == B - A (mod |n|) */\n if (!BN_uadd(X, X, Y))\n goto err;\n /*\n * NB: we could use BN_mod_add_quick(X, X, Y, n), but that\n * actually makes the algorithm slower\n */\n if (!BN_usub(B, B, A))\n goto err;\n } else {\n /* sign*(X + Y)*a == A - B (mod |n|) */\n if (!BN_uadd(Y, Y, X))\n goto err;\n /*\n * as above, BN_mod_add_quick(Y, Y, X, n) would slow things down\n */\n if (!BN_usub(A, A, B))\n goto err;\n }\n }\n } else {\n /* general inversion algorithm */\n\n while (!BN_is_zero(B)) {\n BIGNUM *tmp;\n\n /*-\n * 0 < B < A,\n * (*) -sign*X*a == B (mod |n|),\n * sign*Y*a == A (mod |n|)\n */\n\n /* (D, M) := (A/B, A%B) ... */\n if (BN_num_bits(A) == BN_num_bits(B)) {\n if (!BN_one(D))\n goto err;\n if (!BN_sub(M, A, B))\n goto err;\n } else if (BN_num_bits(A) == BN_num_bits(B) + 1) {\n /* A/B is 1, 2, or 3 */\n if (!BN_lshift1(T, B))\n goto err;\n if (BN_ucmp(A, T) < 0) {\n /* A < 2*B, so D=1 */\n if (!BN_one(D))\n goto err;\n if (!BN_sub(M, A, B))\n goto err;\n } else {\n /* A >= 2*B, so D=2 or D=3 */\n if (!BN_sub(M, A, T))\n goto err;\n if (!BN_add(D, T, B))\n goto err; /* use D (:= 3*B) as temp */\n if (BN_ucmp(A, D) < 0) {\n /* A < 3*B, so D=2 */\n if (!BN_set_word(D, 2))\n goto err;\n /*\n * M (= A - 2*B) already has the correct value\n */\n } else {\n /* only D=3 remains */\n if (!BN_set_word(D, 3))\n goto err;\n /*\n * currently M = A - 2*B, but we need M = A - 3*B\n */\n if (!BN_sub(M, M, B))\n goto err;\n }\n }\n } else {\n if (!BN_div(D, M, A, B, ctx))\n goto err;\n }\n\n /*-\n * Now\n * A = D*B + M;\n * thus we have\n * (**) sign*Y*a == D*B + M (mod |n|).\n */\n\n tmp = A; /* keep the BIGNUM object, the value does not matter */\n\n /* (A, B) := (B, A mod B) ... */\n A = B;\n B = M;\n /* ... so we have 0 <= B < A again */\n\n /*-\n * Since the former M is now B and the former B is now A,\n * (**) translates into\n * sign*Y*a == D*A + B (mod |n|),\n * i.e.\n * sign*Y*a - D*A == B (mod |n|).\n * Similarly, (*) translates into\n * -sign*X*a == A (mod |n|).\n *\n * Thus,\n * sign*Y*a + D*sign*X*a == B (mod |n|),\n * i.e.\n * sign*(Y + D*X)*a == B (mod |n|).\n *\n * So if we set (X, Y, sign) := (Y + D*X, X, -sign), we arrive back at\n * -sign*X*a == B (mod |n|),\n * sign*Y*a == A (mod |n|).\n * Note that X and Y stay non-negative all the time.\n */\n\n /*\n * most of the time D is very small, so we can optimize tmp := D*X+Y\n */\n if (BN_is_one(D)) {\n if (!BN_add(tmp, X, Y))\n goto err;\n } else {\n if (BN_is_word(D, 2)) {\n if (!BN_lshift1(tmp, X))\n goto err;\n } else if (BN_is_word(D, 4)) {\n if (!BN_lshift(tmp, X, 2))\n goto err;\n } else if (D->top == 1) {\n if (!BN_copy(tmp, X))\n goto err;\n if (!BN_mul_word(tmp, D->d[0]))\n goto err;\n } else {\n if (!BN_mul(tmp, D, X, ctx))\n goto err;\n }\n if (!BN_add(tmp, tmp, Y))\n goto err;\n }\n\n M = Y; /* keep the BIGNUM object, the value does not matter */\n Y = X;\n X = tmp;\n sign = -sign;\n }\n }\n\n /*-\n * The while loop (Euclid's algorithm) ends when\n * A == gcd(a,n);\n * we have\n * sign*Y*a == A (mod |n|),\n * where Y is non-negative.\n */\n\n if (sign < 0) {\n if (!BN_sub(Y, n, Y))\n goto err;\n }\n /* Now Y*a == A (mod |n|). */\n\n if (BN_is_one(A)) {\n /* Y*a == 1 (mod |n|) */\n if (!Y->neg && BN_ucmp(Y, n) < 0) {\n if (!BN_copy(R, Y))\n goto err;\n } else {\n if (!BN_nnmod(R, Y, n, ctx))\n goto err;\n }\n } else {\n *pnoinv = 1;\n goto err;\n }\n ret = R;\n err:\n if ((ret == NULL) && (in == NULL))\n BN_free(R);\n BN_CTX_end(ctx);\n bn_check_top(ret);\n return ret;\n}\n\n/* solves ax == 1 (mod n) */\nBIGNUM *BN_mod_inverse(BIGNUM *in,\n const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)\n{\n BN_CTX *new_ctx = NULL;\n BIGNUM *rv;\n int noinv = 0;\n\n if (ctx == NULL) {\n ctx = new_ctx = BN_CTX_new();\n if (ctx == NULL) {\n BNerr(BN_F_BN_MOD_INVERSE, ERR_R_MALLOC_FAILURE);\n return NULL;\n }\n }\n\n rv = int_bn_mod_inverse(in, a, n, ctx, &noinv);\n if (noinv)\n BNerr(BN_F_BN_MOD_INVERSE, BN_R_NO_INVERSE);\n BN_CTX_free(new_ctx);\n return rv;\n}\n\n/*-\n * This function is based on the constant-time GCD work by Bernstein and Yang:\n * https://eprint.iacr.org/2019/266\n * Generalized fast GCD function to allow even inputs.\n * The algorithm first finds the shared powers of 2 between\n * the inputs, and removes them, reducing at least one of the\n * inputs to an odd value. Then it proceeds to calculate the GCD.\n * Before returning the resulting GCD, we take care of adding\n * back the powers of two removed at the beginning.\n * Note 1: we assume the bit length of both inputs is public information,\n * since access to top potentially leaks this information.\n */\nint BN_gcd(BIGNUM *r, const BIGNUM *in_a, const BIGNUM *in_b, BN_CTX *ctx)\n{\n BIGNUM *g, *temp = NULL;\n BN_ULONG mask = 0;\n int i, j, top, rlen, glen, m, bit = 1, delta = 1, cond = 0, shifts = 0, ret = 0;\n\n /* Note 2: zero input corner cases are not constant-time since they are\n * handled immediately. An attacker can run an attack under this\n * assumption without the need of side-channel information. */\n if (BN_is_zero(in_b)) {\n ret = BN_copy(r, in_a) != NULL;\n r->neg = 0;\n return ret;\n }\n if (BN_is_zero(in_a)) {\n ret = BN_copy(r, in_b) != NULL;\n r->neg = 0;\n return ret;\n }\n\n bn_check_top(in_a);\n bn_check_top(in_b);\n\n BN_CTX_start(ctx);\n temp = BN_CTX_get(ctx);\n g = BN_CTX_get(ctx);\n\n /* make r != 0, g != 0 even, so BN_rshift is not a potential nop */\n if (g == NULL\n || !BN_lshift1(g, in_b)\n || !BN_lshift1(r, in_a))\n goto err;\n\n /* find shared powers of two, i.e. \"shifts\" >= 1 */\n for (i = 0; i < r->dmax && i < g->dmax; i++) {\n mask = ~(r->d[i] | g->d[i]);\n for (j = 0; j < BN_BITS2; j++) {\n bit &= mask;\n shifts += bit;\n mask >>= 1;\n }\n }\n\n /* subtract shared powers of two; shifts >= 1 */\n if (!BN_rshift(r, r, shifts)\n || !BN_rshift(g, g, shifts))\n goto err;\n\n /* expand to biggest nword, with room for a possible extra word */\n top = 1 + ((r->top >= g->top) ? r->top : g->top);\n if (bn_wexpand(r, top) == NULL\n || bn_wexpand(g, top) == NULL\n || bn_wexpand(temp, top) == NULL)\n goto err;\n\n /* re arrange inputs s.t. r is odd */\n BN_consttime_swap((~r->d[0]) & 1, r, g, top);\n\n /* compute the number of iterations */\n rlen = BN_num_bits(r);\n glen = BN_num_bits(g);\n m = 4 + 3 * ((rlen >= glen) ? rlen : glen);\n\n for (i = 0; i < m; i++) {\n /* conditionally flip signs if delta is positive and g is odd */\n cond = (-delta >> (8 * sizeof(delta) - 1)) & g->d[0] & 1\n /* make sure g->top > 0 (i.e. if top == 0 then g == 0 always) */\n & (~((g->top - 1) >> (sizeof(g->top) * 8 - 1)));\n delta = (-cond & -delta) | ((cond - 1) & delta);\n r->neg ^= cond;\n /* swap */\n BN_consttime_swap(cond, r, g, top);\n\n /* elimination step */\n delta++;\n if (!BN_add(temp, g, r))\n goto err;\n BN_consttime_swap(g->d[0] & 1 /* g is odd */\n /* make sure g->top > 0 (i.e. if top == 0 then g == 0 always) */\n & (~((g->top - 1) >> (sizeof(g->top) * 8 - 1))),\n g, temp, top);\n if (!BN_rshift1(g, g))\n goto err;\n }\n\n /* remove possible negative sign */\n r->neg = 0;\n /* add powers of 2 removed, then correct the artificial shift */\n if (!BN_lshift(r, r, shifts)\n || !BN_rshift1(r, r))\n goto err;\n\n ret = 1;\n\n err:\n BN_CTX_end(ctx);\n bn_check_top(r);\n return ret;\n}\n" }, { "path": "cryptomini/bn/bn_intern.c", "content": "/*\n * Copyright 2014-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \"internal/cryptlib.h\"\n#include \"bn_local.h\"\n\n/*\n * Determine the modified width-(w+1) Non-Adjacent Form (wNAF) of 'scalar'.\n * This is an array r[] of values that are either zero or odd with an\n * absolute value less than 2^w satisfying\n * scalar = \\sum_j r[j]*2^j\n * where at most one of any w+1 consecutive digits is non-zero\n * with the exception that the most significant digit may be only\n * w-1 zeros away from that next non-zero digit.\n */\nsigned char *bn_compute_wNAF(const BIGNUM *scalar, int w, size_t *ret_len)\n{\n int window_val;\n signed char *r = NULL;\n int sign = 1;\n int bit, next_bit, mask;\n size_t len = 0, j;\n\n if (BN_is_zero(scalar)) {\n r = OPENSSL_malloc(1);\n if (r == NULL) {\n BNerr(BN_F_BN_COMPUTE_WNAF, ERR_R_MALLOC_FAILURE);\n goto err;\n }\n r[0] = 0;\n *ret_len = 1;\n return r;\n }\n\n if (w <= 0 || w > 7) { /* 'signed char' can represent integers with\n * absolute values less than 2^7 */\n BNerr(BN_F_BN_COMPUTE_WNAF, ERR_R_INTERNAL_ERROR);\n goto err;\n }\n bit = 1 << w; /* at most 128 */\n next_bit = bit << 1; /* at most 256 */\n mask = next_bit - 1; /* at most 255 */\n\n if (BN_is_negative(scalar)) {\n sign = -1;\n }\n\n if (scalar->d == NULL || scalar->top == 0) {\n BNerr(BN_F_BN_COMPUTE_WNAF, ERR_R_INTERNAL_ERROR);\n goto err;\n }\n\n len = BN_num_bits(scalar);\n r = OPENSSL_malloc(len + 1); /*\n * Modified wNAF may be one digit longer than binary representation\n * (*ret_len will be set to the actual length, i.e. at most\n * BN_num_bits(scalar) + 1)\n */\n if (r == NULL) {\n BNerr(BN_F_BN_COMPUTE_WNAF, ERR_R_MALLOC_FAILURE);\n goto err;\n }\n window_val = scalar->d[0] & mask;\n j = 0;\n while ((window_val != 0) || (j + w + 1 < len)) { /* if j+w+1 >= len,\n * window_val will not\n * increase */\n int digit = 0;\n\n /* 0 <= window_val <= 2^(w+1) */\n\n if (window_val & 1) {\n /* 0 < window_val < 2^(w+1) */\n\n if (window_val & bit) {\n digit = window_val - next_bit; /* -2^w < digit < 0 */\n\n#if 1 /* modified wNAF */\n if (j + w + 1 >= len) {\n /*\n * Special case for generating modified wNAFs:\n * no new bits will be added into window_val,\n * so using a positive digit here will decrease\n * the total length of the representation\n */\n\n digit = window_val & (mask >> 1); /* 0 < digit < 2^w */\n }\n#endif\n } else {\n digit = window_val; /* 0 < digit < 2^w */\n }\n\n if (digit <= -bit || digit >= bit || !(digit & 1)) {\n BNerr(BN_F_BN_COMPUTE_WNAF, ERR_R_INTERNAL_ERROR);\n goto err;\n }\n\n window_val -= digit;\n\n /*\n * now window_val is 0 or 2^(w+1) in standard wNAF generation;\n * for modified window NAFs, it may also be 2^w\n */\n if (window_val != 0 && window_val != next_bit\n && window_val != bit) {\n BNerr(BN_F_BN_COMPUTE_WNAF, ERR_R_INTERNAL_ERROR);\n goto err;\n }\n }\n\n r[j++] = sign * digit;\n\n window_val >>= 1;\n window_val += bit * BN_is_bit_set(scalar, j + w);\n\n if (window_val > next_bit) {\n BNerr(BN_F_BN_COMPUTE_WNAF, ERR_R_INTERNAL_ERROR);\n goto err;\n }\n }\n\n if (j > len + 1) {\n BNerr(BN_F_BN_COMPUTE_WNAF, ERR_R_INTERNAL_ERROR);\n goto err;\n }\n *ret_len = j;\n return r;\n\n err:\n OPENSSL_free(r);\n return NULL;\n}\n\nint bn_get_top(const BIGNUM *a)\n{\n return a->top;\n}\n\nint bn_get_dmax(const BIGNUM *a)\n{\n return a->dmax;\n}\n\nvoid bn_set_all_zero(BIGNUM *a)\n{\n int i;\n\n for (i = a->top; i < a->dmax; i++)\n a->d[i] = 0;\n}\n\nint bn_copy_words(BN_ULONG *out, const BIGNUM *in, int size)\n{\n if (in->top > size)\n return 0;\n\n memset(out, 0, sizeof(*out) * size);\n if (in->d != NULL)\n memcpy(out, in->d, sizeof(*out) * in->top);\n return 1;\n}\n\nBN_ULONG *bn_get_words(const BIGNUM *a)\n{\n return a->d;\n}\n\nvoid bn_set_static_words(BIGNUM *a, const BN_ULONG *words, int size)\n{\n /*\n * |const| qualifier omission is compensated by BN_FLG_STATIC_DATA\n * flag, which effectively means \"read-only data\".\n */\n a->d = (BN_ULONG *)words;\n a->dmax = a->top = size;\n a->neg = 0;\n a->flags |= BN_FLG_STATIC_DATA;\n bn_correct_top(a);\n}\n\nint bn_set_words(BIGNUM *a, const BN_ULONG *words, int num_words)\n{\n if (bn_wexpand(a, num_words) == NULL) {\n BNerr(BN_F_BN_SET_WORDS, ERR_R_MALLOC_FAILURE);\n return 0;\n }\n\n memcpy(a->d, words, sizeof(BN_ULONG) * num_words);\n a->top = num_words;\n bn_correct_top(a);\n return 1;\n}\n" }, { "path": "cryptomini/bn/bn_lib.c", "content": "/*\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \n#include \"internal/cryptlib.h\"\n#include \"bn_local.h\"\n#include \n#include \"internal/constant_time.h\"\n\n/* This stuff appears to be completely unused, so is deprecated */\n#if OPENSSL_API_COMPAT < 0x00908000L\n/*-\n * For a 32 bit machine\n * 2 - 4 == 128\n * 3 - 8 == 256\n * 4 - 16 == 512\n * 5 - 32 == 1024\n * 6 - 64 == 2048\n * 7 - 128 == 4096\n * 8 - 256 == 8192\n */\nstatic int bn_limit_bits = 0;\nstatic int bn_limit_num = 8; /* (1<= 0) {\n if (mult > (int)(sizeof(int) * 8) - 1)\n mult = sizeof(int) * 8 - 1;\n bn_limit_bits = mult;\n bn_limit_num = 1 << mult;\n }\n if (high >= 0) {\n if (high > (int)(sizeof(int) * 8) - 1)\n high = sizeof(int) * 8 - 1;\n bn_limit_bits_high = high;\n bn_limit_num_high = 1 << high;\n }\n if (low >= 0) {\n if (low > (int)(sizeof(int) * 8) - 1)\n low = sizeof(int) * 8 - 1;\n bn_limit_bits_low = low;\n bn_limit_num_low = 1 << low;\n }\n if (mont >= 0) {\n if (mont > (int)(sizeof(int) * 8) - 1)\n mont = sizeof(int) * 8 - 1;\n bn_limit_bits_mont = mont;\n bn_limit_num_mont = 1 << mont;\n }\n}\n\nint BN_get_params(int which)\n{\n if (which == 0)\n return bn_limit_bits;\n else if (which == 1)\n return bn_limit_bits_high;\n else if (which == 2)\n return bn_limit_bits_low;\n else if (which == 3)\n return bn_limit_bits_mont;\n else\n return 0;\n}\n#endif\n\nconst BIGNUM *BN_value_one(void)\n{\n static const BN_ULONG data_one = 1L;\n static const BIGNUM const_one =\n { (BN_ULONG *)&data_one, 1, 1, 0, BN_FLG_STATIC_DATA };\n\n return &const_one;\n}\n\n/*\n * Old Visual Studio ARM compiler miscompiles BN_num_bits_word()\n * https://mta.openssl.org/pipermail/openssl-users/2018-August/008465.html\n */\n#if defined(_MSC_VER) && defined(_ARM_) && defined(_WIN32_WCE) \\\n && _MSC_VER>=1400 && _MSC_VER<1501\n# define MS_BROKEN_BN_num_bits_word\n# pragma optimize(\"\", off)\n#endif\nint BN_num_bits_word(BN_ULONG l)\n{\n BN_ULONG x, mask;\n int bits = (l != 0);\n\n#if BN_BITS2 > 32\n x = l >> 32;\n mask = (0 - x) & BN_MASK2;\n mask = (0 - (mask >> (BN_BITS2 - 1)));\n bits += 32 & mask;\n l ^= (x ^ l) & mask;\n#endif\n\n x = l >> 16;\n mask = (0 - x) & BN_MASK2;\n mask = (0 - (mask >> (BN_BITS2 - 1)));\n bits += 16 & mask;\n l ^= (x ^ l) & mask;\n\n x = l >> 8;\n mask = (0 - x) & BN_MASK2;\n mask = (0 - (mask >> (BN_BITS2 - 1)));\n bits += 8 & mask;\n l ^= (x ^ l) & mask;\n\n x = l >> 4;\n mask = (0 - x) & BN_MASK2;\n mask = (0 - (mask >> (BN_BITS2 - 1)));\n bits += 4 & mask;\n l ^= (x ^ l) & mask;\n\n x = l >> 2;\n mask = (0 - x) & BN_MASK2;\n mask = (0 - (mask >> (BN_BITS2 - 1)));\n bits += 2 & mask;\n l ^= (x ^ l) & mask;\n\n x = l >> 1;\n mask = (0 - x) & BN_MASK2;\n mask = (0 - (mask >> (BN_BITS2 - 1)));\n bits += 1 & mask;\n\n return bits;\n}\n#ifdef MS_BROKEN_BN_num_bits_word\n# pragma optimize(\"\", on)\n#endif\n\n/*\n * This function still leaks `a->dmax`: it's caller's responsibility to\n * expand the input `a` in advance to a public length.\n */\nstatic ossl_inline\nint bn_num_bits_consttime(const BIGNUM *a)\n{\n int j, ret;\n unsigned int mask, past_i;\n int i = a->top - 1;\n bn_check_top(a);\n\n for (j = 0, past_i = 0, ret = 0; j < a->dmax; j++) {\n mask = constant_time_eq_int(i, j); /* 0xff..ff if i==j, 0x0 otherwise */\n\n ret += BN_BITS2 & (~mask & ~past_i);\n ret += BN_num_bits_word(a->d[j]) & mask;\n\n past_i |= mask; /* past_i will become 0xff..ff after i==j */\n }\n\n /*\n * if BN_is_zero(a) => i is -1 and ret contains garbage, so we mask the\n * final result.\n */\n mask = ~(constant_time_eq_int(i, ((int)-1)));\n\n return ret & mask;\n}\n\nint BN_num_bits(const BIGNUM *a)\n{\n int i = a->top - 1;\n bn_check_top(a);\n\n if (a->flags & BN_FLG_CONSTTIME) {\n /*\n * We assume that BIGNUMs flagged as CONSTTIME have also been expanded\n * so that a->dmax is not leaking secret information.\n *\n * In other words, it's the caller's responsibility to ensure `a` has\n * been preallocated in advance to a public length if we hit this\n * branch.\n *\n */\n return bn_num_bits_consttime(a);\n }\n\n if (BN_is_zero(a))\n return 0;\n\n return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));\n}\n\nstatic void bn_free_d(BIGNUM *a, int clear)\n{\n if (BN_get_flags(a, BN_FLG_SECURE))\n OPENSSL_secure_clear_free(a->d, a->dmax * sizeof(a->d[0]));\n else if (clear != 0)\n OPENSSL_clear_free(a->d, a->dmax * sizeof(a->d[0]));\n else\n OPENSSL_free(a->d);\n}\n\n\nvoid BN_clear_free(BIGNUM *a)\n{\n if (a == NULL)\n return;\n if (a->d != NULL && !BN_get_flags(a, BN_FLG_STATIC_DATA))\n bn_free_d(a, 1);\n if (BN_get_flags(a, BN_FLG_MALLOCED)) {\n OPENSSL_cleanse(a, sizeof(*a));\n OPENSSL_free(a);\n }\n}\n\nvoid BN_free(BIGNUM *a)\n{\n if (a == NULL)\n return;\n if (!BN_get_flags(a, BN_FLG_STATIC_DATA))\n bn_free_d(a, 0);\n if (a->flags & BN_FLG_MALLOCED)\n OPENSSL_free(a);\n}\n\nvoid bn_init(BIGNUM *a)\n{\n static BIGNUM nilbn;\n\n *a = nilbn;\n bn_check_top(a);\n}\n\nBIGNUM *BN_new(void)\n{\n BIGNUM *ret;\n\n if ((ret = OPENSSL_zalloc(sizeof(*ret))) == NULL) {\n BNerr(BN_F_BN_NEW, ERR_R_MALLOC_FAILURE);\n return NULL;\n }\n ret->flags = BN_FLG_MALLOCED;\n bn_check_top(ret);\n return ret;\n}\n\n BIGNUM *BN_secure_new(void)\n {\n BIGNUM *ret = BN_new();\n if (ret != NULL)\n ret->flags |= BN_FLG_SECURE;\n return ret;\n }\n\n/* This is used by bn_expand2() */\n/* The caller MUST check that words > b->dmax before calling this */\nstatic BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)\n{\n BN_ULONG *a = NULL;\n\n if (words > (INT_MAX / (4 * BN_BITS2))) {\n BNerr(BN_F_BN_EXPAND_INTERNAL, BN_R_BIGNUM_TOO_LONG);\n return NULL;\n }\n if (BN_get_flags(b, BN_FLG_STATIC_DATA)) {\n BNerr(BN_F_BN_EXPAND_INTERNAL, BN_R_EXPAND_ON_STATIC_BIGNUM_DATA);\n return NULL;\n }\n if (BN_get_flags(b, BN_FLG_SECURE))\n a = OPENSSL_secure_zalloc(words * sizeof(*a));\n else\n a = OPENSSL_zalloc(words * sizeof(*a));\n if (a == NULL) {\n BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);\n return NULL;\n }\n\n assert(b->top <= words);\n if (b->top > 0)\n memcpy(a, b->d, sizeof(*a) * b->top);\n\n return a;\n}\n\n/*\n * This is an internal function that should not be used in applications. It\n * ensures that 'b' has enough room for a 'words' word number and initialises\n * any unused part of b->d with leading zeros. It is mostly used by the\n * various BIGNUM routines. If there is an error, NULL is returned. If not,\n * 'b' is returned.\n */\n\nBIGNUM *bn_expand2(BIGNUM *b, int words)\n{\n if (words > b->dmax) {\n BN_ULONG *a = bn_expand_internal(b, words);\n if (!a)\n return NULL;\n if (b->d != NULL)\n bn_free_d(b, 1);\n b->d = a;\n b->dmax = words;\n }\n\n return b;\n}\n\nBIGNUM *BN_dup(const BIGNUM *a)\n{\n BIGNUM *t;\n\n if (a == NULL)\n return NULL;\n bn_check_top(a);\n\n t = BN_get_flags(a, BN_FLG_SECURE) ? BN_secure_new() : BN_new();\n if (t == NULL)\n return NULL;\n if (!BN_copy(t, a)) {\n BN_free(t);\n return NULL;\n }\n bn_check_top(t);\n return t;\n}\n\nBIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)\n{\n int bn_words;\n\n bn_check_top(b);\n\n bn_words = BN_get_flags(b, BN_FLG_CONSTTIME) ? b->dmax : b->top;\n\n if (a == b)\n return a;\n if (bn_wexpand(a, bn_words) == NULL)\n return NULL;\n\n if (b->top > 0)\n memcpy(a->d, b->d, sizeof(b->d[0]) * bn_words);\n\n a->neg = b->neg;\n a->top = b->top;\n a->flags |= b->flags & BN_FLG_FIXED_TOP;\n bn_check_top(a);\n return a;\n}\n\n#define FLAGS_DATA(flags) ((flags) & (BN_FLG_STATIC_DATA \\\n | BN_FLG_CONSTTIME \\\n | BN_FLG_SECURE \\\n | BN_FLG_FIXED_TOP))\n#define FLAGS_STRUCT(flags) ((flags) & (BN_FLG_MALLOCED))\n\nvoid BN_swap(BIGNUM *a, BIGNUM *b)\n{\n int flags_old_a, flags_old_b;\n BN_ULONG *tmp_d;\n int tmp_top, tmp_dmax, tmp_neg;\n\n bn_check_top(a);\n bn_check_top(b);\n\n flags_old_a = a->flags;\n flags_old_b = b->flags;\n\n tmp_d = a->d;\n tmp_top = a->top;\n tmp_dmax = a->dmax;\n tmp_neg = a->neg;\n\n a->d = b->d;\n a->top = b->top;\n a->dmax = b->dmax;\n a->neg = b->neg;\n\n b->d = tmp_d;\n b->top = tmp_top;\n b->dmax = tmp_dmax;\n b->neg = tmp_neg;\n\n a->flags = FLAGS_STRUCT(flags_old_a) | FLAGS_DATA(flags_old_b);\n b->flags = FLAGS_STRUCT(flags_old_b) | FLAGS_DATA(flags_old_a);\n bn_check_top(a);\n bn_check_top(b);\n}\n\nvoid BN_clear(BIGNUM *a)\n{\n if (a == NULL)\n return;\n bn_check_top(a);\n if (a->d != NULL)\n OPENSSL_cleanse(a->d, sizeof(*a->d) * a->dmax);\n a->neg = 0;\n a->top = 0;\n a->flags &= ~BN_FLG_FIXED_TOP;\n}\n\nBN_ULONG BN_get_word(const BIGNUM *a)\n{\n if (a->top > 1)\n return BN_MASK2;\n else if (a->top == 1)\n return a->d[0];\n /* a->top == 0 */\n return 0;\n}\n\nint BN_set_word(BIGNUM *a, BN_ULONG w)\n{\n bn_check_top(a);\n if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)\n return 0;\n a->neg = 0;\n a->d[0] = w;\n a->top = (w ? 1 : 0);\n a->flags &= ~BN_FLG_FIXED_TOP;\n bn_check_top(a);\n return 1;\n}\n\nBIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)\n{\n unsigned int i, m;\n unsigned int n;\n BN_ULONG l;\n BIGNUM *bn = NULL;\n\n if (ret == NULL)\n ret = bn = BN_new();\n if (ret == NULL)\n return NULL;\n bn_check_top(ret);\n /* Skip leading zero's. */\n for ( ; len > 0 && *s == 0; s++, len--)\n continue;\n n = len;\n if (n == 0) {\n ret->top = 0;\n return ret;\n }\n i = ((n - 1) / BN_BYTES) + 1;\n m = ((n - 1) % (BN_BYTES));\n if (bn_wexpand(ret, (int)i) == NULL) {\n BN_free(bn);\n return NULL;\n }\n ret->top = i;\n ret->neg = 0;\n l = 0;\n while (n--) {\n l = (l << 8L) | *(s++);\n if (m-- == 0) {\n ret->d[--i] = l;\n l = 0;\n m = BN_BYTES - 1;\n }\n }\n /*\n * need to call this due to clear byte at top if avoiding having the top\n * bit set (-ve number)\n */\n bn_correct_top(ret);\n return ret;\n}\n\ntypedef enum {big, little} endianess_t;\n\n/* ignore negative */\nstatic\nint bn2binpad(const BIGNUM *a, unsigned char *to, int tolen, endianess_t endianess)\n{\n int n;\n size_t i, lasti, j, atop, mask;\n BN_ULONG l;\n\n /*\n * In case |a| is fixed-top, BN_num_bytes can return bogus length,\n * but it's assumed that fixed-top inputs ought to be \"nominated\"\n * even for padded output, so it works out...\n */\n n = BN_num_bytes(a);\n if (tolen == -1) {\n tolen = n;\n } else if (tolen < n) { /* uncommon/unlike case */\n BIGNUM temp = *a;\n\n bn_correct_top(&temp);\n n = BN_num_bytes(&temp);\n if (tolen < n)\n return -1;\n }\n\n /* Swipe through whole available data and don't give away padded zero. */\n atop = a->dmax * BN_BYTES;\n if (atop == 0) {\n OPENSSL_cleanse(to, tolen);\n return tolen;\n }\n\n lasti = atop - 1;\n atop = a->top * BN_BYTES;\n if (endianess == big)\n to += tolen; /* start from the end of the buffer */\n for (i = 0, j = 0; j < (size_t)tolen; j++) {\n unsigned char val;\n l = a->d[i / BN_BYTES];\n mask = 0 - ((j - atop) >> (8 * sizeof(i) - 1));\n val = (unsigned char)(l >> (8 * (i % BN_BYTES)) & mask);\n if (endianess == big)\n *--to = val;\n else\n *to++ = val;\n i += (i - lasti) >> (8 * sizeof(i) - 1); /* stay on last limb */\n }\n\n return tolen;\n}\n\nint BN_bn2binpad(const BIGNUM *a, unsigned char *to, int tolen)\n{\n if (tolen < 0)\n return -1;\n return bn2binpad(a, to, tolen, big);\n}\n\nint BN_bn2bin(const BIGNUM *a, unsigned char *to)\n{\n return bn2binpad(a, to, -1, big);\n}\n\nBIGNUM *BN_lebin2bn(const unsigned char *s, int len, BIGNUM *ret)\n{\n unsigned int i, m;\n unsigned int n;\n BN_ULONG l;\n BIGNUM *bn = NULL;\n\n if (ret == NULL)\n ret = bn = BN_new();\n if (ret == NULL)\n return NULL;\n bn_check_top(ret);\n s += len;\n /* Skip trailing zeroes. */\n for ( ; len > 0 && s[-1] == 0; s--, len--)\n continue;\n n = len;\n if (n == 0) {\n ret->top = 0;\n return ret;\n }\n i = ((n - 1) / BN_BYTES) + 1;\n m = ((n - 1) % (BN_BYTES));\n if (bn_wexpand(ret, (int)i) == NULL) {\n BN_free(bn);\n return NULL;\n }\n ret->top = i;\n ret->neg = 0;\n l = 0;\n while (n--) {\n s--;\n l = (l << 8L) | *s;\n if (m-- == 0) {\n ret->d[--i] = l;\n l = 0;\n m = BN_BYTES - 1;\n }\n }\n /*\n * need to call this due to clear byte at top if avoiding having the top\n * bit set (-ve number)\n */\n bn_correct_top(ret);\n return ret;\n}\n\nint BN_bn2lebinpad(const BIGNUM *a, unsigned char *to, int tolen)\n{\n if (tolen < 0)\n return -1;\n return bn2binpad(a, to, tolen, little);\n}\n\nint BN_ucmp(const BIGNUM *a, const BIGNUM *b)\n{\n int i;\n BN_ULONG t1, t2, *ap, *bp;\n\n bn_check_top(a);\n bn_check_top(b);\n\n i = a->top - b->top;\n if (i != 0)\n return i;\n ap = a->d;\n bp = b->d;\n for (i = a->top - 1; i >= 0; i--) {\n t1 = ap[i];\n t2 = bp[i];\n if (t1 != t2)\n return ((t1 > t2) ? 1 : -1);\n }\n return 0;\n}\n\nint BN_cmp(const BIGNUM *a, const BIGNUM *b)\n{\n int i;\n int gt, lt;\n BN_ULONG t1, t2;\n\n if ((a == NULL) || (b == NULL)) {\n if (a != NULL)\n return -1;\n else if (b != NULL)\n return 1;\n else\n return 0;\n }\n\n bn_check_top(a);\n bn_check_top(b);\n\n if (a->neg != b->neg) {\n if (a->neg)\n return -1;\n else\n return 1;\n }\n if (a->neg == 0) {\n gt = 1;\n lt = -1;\n } else {\n gt = -1;\n lt = 1;\n }\n\n if (a->top > b->top)\n return gt;\n if (a->top < b->top)\n return lt;\n for (i = a->top - 1; i >= 0; i--) {\n t1 = a->d[i];\n t2 = b->d[i];\n if (t1 > t2)\n return gt;\n if (t1 < t2)\n return lt;\n }\n return 0;\n}\n\nint BN_set_bit(BIGNUM *a, int n)\n{\n int i, j, k;\n\n if (n < 0)\n return 0;\n\n i = n / BN_BITS2;\n j = n % BN_BITS2;\n if (a->top <= i) {\n if (bn_wexpand(a, i + 1) == NULL)\n return 0;\n for (k = a->top; k < i + 1; k++)\n a->d[k] = 0;\n a->top = i + 1;\n a->flags &= ~BN_FLG_FIXED_TOP;\n }\n\n a->d[i] |= (((BN_ULONG)1) << j);\n bn_check_top(a);\n return 1;\n}\n\nint BN_clear_bit(BIGNUM *a, int n)\n{\n int i, j;\n\n bn_check_top(a);\n if (n < 0)\n return 0;\n\n i = n / BN_BITS2;\n j = n % BN_BITS2;\n if (a->top <= i)\n return 0;\n\n a->d[i] &= (~(((BN_ULONG)1) << j));\n bn_correct_top(a);\n return 1;\n}\n\nint BN_is_bit_set(const BIGNUM *a, int n)\n{\n int i, j;\n\n bn_check_top(a);\n if (n < 0)\n return 0;\n i = n / BN_BITS2;\n j = n % BN_BITS2;\n if (a->top <= i)\n return 0;\n return (int)(((a->d[i]) >> j) & ((BN_ULONG)1));\n}\n\nint BN_mask_bits(BIGNUM *a, int n)\n{\n int b, w;\n\n bn_check_top(a);\n if (n < 0)\n return 0;\n\n w = n / BN_BITS2;\n b = n % BN_BITS2;\n if (w >= a->top)\n return 0;\n if (b == 0)\n a->top = w;\n else {\n a->top = w + 1;\n a->d[w] &= ~(BN_MASK2 << b);\n }\n bn_correct_top(a);\n return 1;\n}\n\nvoid BN_set_negative(BIGNUM *a, int b)\n{\n if (b && !BN_is_zero(a))\n a->neg = 1;\n else\n a->neg = 0;\n}\n\nint bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)\n{\n int i;\n BN_ULONG aa, bb;\n\n if (n == 0)\n return 0;\n\n aa = a[n - 1];\n bb = b[n - 1];\n if (aa != bb)\n return ((aa > bb) ? 1 : -1);\n for (i = n - 2; i >= 0; i--) {\n aa = a[i];\n bb = b[i];\n if (aa != bb)\n return ((aa > bb) ? 1 : -1);\n }\n return 0;\n}\n\n/*\n * Here follows a specialised variants of bn_cmp_words(). It has the\n * capability of performing the operation on arrays of different sizes. The\n * sizes of those arrays is expressed through cl, which is the common length\n * ( basically, min(len(a),len(b)) ), and dl, which is the delta between the\n * two lengths, calculated as len(a)-len(b). All lengths are the number of\n * BN_ULONGs...\n */\n\nint bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)\n{\n int n, i;\n n = cl - 1;\n\n if (dl < 0) {\n for (i = dl; i < 0; i++) {\n if (b[n - i] != 0)\n return -1; /* a < b */\n }\n }\n if (dl > 0) {\n for (i = dl; i > 0; i--) {\n if (a[n + i] != 0)\n return 1; /* a > b */\n }\n }\n return bn_cmp_words(a, b, cl);\n}\n\n/*-\n * Constant-time conditional swap of a and b.\n * a and b are swapped if condition is not 0.\n * nwords is the number of words to swap.\n * Assumes that at least nwords are allocated in both a and b.\n * Assumes that no more than nwords are used by either a or b.\n */\nvoid BN_consttime_swap(BN_ULONG condition, BIGNUM *a, BIGNUM *b, int nwords)\n{\n BN_ULONG t;\n int i;\n\n if (a == b)\n return;\n\n bn_wcheck_size(a, nwords);\n bn_wcheck_size(b, nwords);\n\n condition = ((~condition & ((condition - 1))) >> (BN_BITS2 - 1)) - 1;\n\n t = (a->top ^ b->top) & condition;\n a->top ^= t;\n b->top ^= t;\n\n t = (a->neg ^ b->neg) & condition;\n a->neg ^= t;\n b->neg ^= t;\n\n /*-\n * BN_FLG_STATIC_DATA: indicates that data may not be written to. Intention\n * is actually to treat it as it's read-only data, and some (if not most)\n * of it does reside in read-only segment. In other words observation of\n * BN_FLG_STATIC_DATA in BN_consttime_swap should be treated as fatal\n * condition. It would either cause SEGV or effectively cause data\n * corruption.\n *\n * BN_FLG_MALLOCED: refers to BN structure itself, and hence must be\n * preserved.\n *\n * BN_FLG_SECURE: must be preserved, because it determines how x->d was\n * allocated and hence how to free it.\n *\n * BN_FLG_CONSTTIME: sufficient to mask and swap\n *\n * BN_FLG_FIXED_TOP: indicates that we haven't called bn_correct_top() on\n * the data, so the d array may be padded with additional 0 values (i.e.\n * top could be greater than the minimal value that it could be). We should\n * be swapping it\n */\n\n#define BN_CONSTTIME_SWAP_FLAGS (BN_FLG_CONSTTIME | BN_FLG_FIXED_TOP)\n\n t = ((a->flags ^ b->flags) & BN_CONSTTIME_SWAP_FLAGS) & condition;\n a->flags ^= t;\n b->flags ^= t;\n\n /* conditionally swap the data */\n for (i = 0; i < nwords; i++) {\n t = (a->d[i] ^ b->d[i]) & condition;\n a->d[i] ^= t;\n b->d[i] ^= t;\n }\n}\n\n#undef BN_CONSTTIME_SWAP_FLAGS\n\n/* Bits of security, see SP800-57 */\n\nint BN_security_bits(int L, int N)\n{\n int secbits, bits;\n if (L >= 15360)\n secbits = 256;\n else if (L >= 7680)\n secbits = 192;\n else if (L >= 3072)\n secbits = 128;\n else if (L >= 2048)\n secbits = 112;\n else if (L >= 1024)\n secbits = 80;\n else\n return 0;\n if (N == -1)\n return secbits;\n bits = N / 2;\n if (bits < 80)\n return 0;\n return bits >= secbits ? secbits : bits;\n}\n\nvoid BN_zero_ex(BIGNUM *a)\n{\n a->neg = 0;\n a->top = 0;\n a->flags &= ~BN_FLG_FIXED_TOP;\n}\n\nint BN_abs_is_word(const BIGNUM *a, const BN_ULONG w)\n{\n return ((a->top == 1) && (a->d[0] == w)) || ((w == 0) && (a->top == 0));\n}\n\nint BN_is_zero(const BIGNUM *a)\n{\n return a->top == 0;\n}\n\nint BN_is_one(const BIGNUM *a)\n{\n return BN_abs_is_word(a, 1) && !a->neg;\n}\n\nint BN_is_word(const BIGNUM *a, const BN_ULONG w)\n{\n return BN_abs_is_word(a, w) && (!w || !a->neg);\n}\n\nint BN_is_odd(const BIGNUM *a)\n{\n return (a->top > 0) && (a->d[0] & 1);\n}\n\nint BN_is_negative(const BIGNUM *a)\n{\n return (a->neg != 0);\n}\n\nint BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,\n BN_CTX *ctx)\n{\n return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);\n}\n\nvoid BN_with_flags(BIGNUM *dest, const BIGNUM *b, int flags)\n{\n dest->d = b->d;\n dest->top = b->top;\n dest->dmax = b->dmax;\n dest->neg = b->neg;\n dest->flags = ((dest->flags & BN_FLG_MALLOCED)\n | (b->flags & ~BN_FLG_MALLOCED)\n | BN_FLG_STATIC_DATA | flags);\n}\n\nBN_GENCB *BN_GENCB_new(void)\n{\n BN_GENCB *ret;\n\n if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL) {\n BNerr(BN_F_BN_GENCB_NEW, ERR_R_MALLOC_FAILURE);\n return NULL;\n }\n\n return ret;\n}\n\nvoid BN_GENCB_free(BN_GENCB *cb)\n{\n if (cb == NULL)\n return;\n OPENSSL_free(cb);\n}\n\nvoid BN_set_flags(BIGNUM *b, int n)\n{\n b->flags |= n;\n}\n\nint BN_get_flags(const BIGNUM *b, int n)\n{\n return b->flags & n;\n}\n\n/* Populate a BN_GENCB structure with an \"old\"-style callback */\nvoid BN_GENCB_set_old(BN_GENCB *gencb, void (*callback) (int, int, void *),\n void *cb_arg)\n{\n BN_GENCB *tmp_gencb = gencb;\n tmp_gencb->ver = 1;\n tmp_gencb->arg = cb_arg;\n tmp_gencb->cb.cb_1 = callback;\n}\n\n/* Populate a BN_GENCB structure with a \"new\"-style callback */\nvoid BN_GENCB_set(BN_GENCB *gencb, int (*callback) (int, int, BN_GENCB *),\n void *cb_arg)\n{\n BN_GENCB *tmp_gencb = gencb;\n tmp_gencb->ver = 2;\n tmp_gencb->arg = cb_arg;\n tmp_gencb->cb.cb_2 = callback;\n}\n\nvoid *BN_GENCB_get_arg(BN_GENCB *cb)\n{\n return cb->arg;\n}\n\nBIGNUM *bn_wexpand(BIGNUM *a, int words)\n{\n return (words <= a->dmax) ? a : bn_expand2(a, words);\n}\n\nvoid bn_correct_top(BIGNUM *a)\n{\n BN_ULONG *ftl;\n int tmp_top = a->top;\n\n if (tmp_top > 0) {\n for (ftl = &(a->d[tmp_top]); tmp_top > 0; tmp_top--) {\n ftl--;\n if (*ftl != 0)\n break;\n }\n a->top = tmp_top;\n }\n if (a->top == 0)\n a->neg = 0;\n a->flags &= ~BN_FLG_FIXED_TOP;\n bn_pollute(a);\n}\n" }, { "path": "cryptomini/bn/bn_local.h", "content": "/*\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_BN_LOCAL_H\n# define OSSL_CRYPTO_BN_LOCAL_H\n\n/*\n * The EDK2 build doesn't use bn_conf.h; it sets THIRTY_TWO_BIT or\n * SIXTY_FOUR_BIT in its own environment since it doesn't re-run our\n * Configure script and needs to support both 32-bit and 64-bit.\n */\n# include \n\n# if !defined(OPENSSL_SYS_UEFI)\n# include \"crypto/bn_conf.h\"\n# endif\n\n# include \"crypto/bn.h\"\n\n/*\n * These preprocessor symbols control various aspects of the bignum headers\n * and library code. They're not defined by any \"normal\" configuration, as\n * they are intended for development and testing purposes. NB: defining all\n * three can be useful for debugging application code as well as openssl\n * itself. BN_DEBUG - turn on various debugging alterations to the bignum\n * code BN_DEBUG_RAND - uses random poisoning of unused words to trip up\n * mismanagement of bignum internals. You must also define BN_DEBUG.\n */\n/* #define BN_DEBUG */\n/* #define BN_DEBUG_RAND */\n\n# ifndef OPENSSL_SMALL_FOOTPRINT\n# define BN_MUL_COMBA\n# define BN_SQR_COMBA\n# define BN_RECURSION\n# endif\n\n/*\n * This next option uses the C libraries (2 word)/(1 word) function. If it is\n * not defined, I use my C version (which is slower). The reason for this\n * flag is that when the particular C compiler library routine is used, and\n * the library is linked with a different compiler, the library is missing.\n * This mostly happens when the library is built with gcc and then linked\n * using normal cc. This would be a common occurrence because gcc normally\n * produces code that is 2 times faster than system compilers for the big\n * number stuff. For machines with only one compiler (or shared libraries),\n * this should be on. Again this in only really a problem on machines using\n * \"long long's\", are 32bit, and are not using my assembler code.\n */\n# if defined(OPENSSL_SYS_MSDOS) || defined(OPENSSL_SYS_WINDOWS) || \\\n defined(OPENSSL_SYS_WIN32) || defined(linux)\n# define BN_DIV2W\n# endif\n\n/*\n * 64-bit processor with LP64 ABI\n */\n# ifdef SIXTY_FOUR_BIT_LONG\n# define BN_ULLONG unsigned long long\n# define BN_BITS4 32\n# define BN_MASK2 (0xffffffffffffffffL)\n# define BN_MASK2l (0xffffffffL)\n# define BN_MASK2h (0xffffffff00000000L)\n# define BN_MASK2h1 (0xffffffff80000000L)\n# define BN_DEC_CONV (10000000000000000000UL)\n# define BN_DEC_NUM 19\n# define BN_DEC_FMT1 \"%lu\"\n# define BN_DEC_FMT2 \"%019lu\"\n# endif\n\n/*\n * 64-bit processor other than LP64 ABI\n */\n# ifdef SIXTY_FOUR_BIT\n# undef BN_LLONG\n# undef BN_ULLONG\n# define BN_BITS4 32\n# define BN_MASK2 (0xffffffffffffffffLL)\n# define BN_MASK2l (0xffffffffL)\n# define BN_MASK2h (0xffffffff00000000LL)\n# define BN_MASK2h1 (0xffffffff80000000LL)\n# define BN_DEC_CONV (10000000000000000000ULL)\n# define BN_DEC_NUM 19\n# define BN_DEC_FMT1 \"%llu\"\n# define BN_DEC_FMT2 \"%019llu\"\n# endif\n\n# ifdef THIRTY_TWO_BIT\n# ifdef BN_LLONG\n# if defined(_WIN32) && !defined(__GNUC__)\n# define BN_ULLONG unsigned __int64\n# else\n# define BN_ULLONG unsigned long long\n# endif\n# endif\n# define BN_BITS4 16\n# define BN_MASK2 (0xffffffffL)\n# define BN_MASK2l (0xffff)\n# define BN_MASK2h1 (0xffff8000L)\n# define BN_MASK2h (0xffff0000L)\n# define BN_DEC_CONV (1000000000L)\n# define BN_DEC_NUM 9\n# define BN_DEC_FMT1 \"%u\"\n# define BN_DEC_FMT2 \"%09u\"\n# endif\n\n\n/*-\n * Bignum consistency macros\n * There is one \"API\" macro, bn_fix_top(), for stripping leading zeroes from\n * bignum data after direct manipulations on the data. There is also an\n * \"internal\" macro, bn_check_top(), for verifying that there are no leading\n * zeroes. Unfortunately, some auditing is required due to the fact that\n * bn_fix_top() has become an overabused duct-tape because bignum data is\n * occasionally passed around in an inconsistent state. So the following\n * changes have been made to sort this out;\n * - bn_fix_top()s implementation has been moved to bn_correct_top()\n * - if BN_DEBUG isn't defined, bn_fix_top() maps to bn_correct_top(), and\n * bn_check_top() is as before.\n * - if BN_DEBUG *is* defined;\n * - bn_check_top() tries to pollute unused words even if the bignum 'top' is\n * consistent. (ed: only if BN_DEBUG_RAND is defined)\n * - bn_fix_top() maps to bn_check_top() rather than \"fixing\" anything.\n * The idea is to have debug builds flag up inconsistent bignums when they\n * occur. If that occurs in a bn_fix_top(), we examine the code in question; if\n * the use of bn_fix_top() was appropriate (ie. it follows directly after code\n * that manipulates the bignum) it is converted to bn_correct_top(), and if it\n * was not appropriate, we convert it permanently to bn_check_top() and track\n * down the cause of the bug. Eventually, no internal code should be using the\n * bn_fix_top() macro. External applications and libraries should try this with\n * their own code too, both in terms of building against the openssl headers\n * with BN_DEBUG defined *and* linking with a version of OpenSSL built with it\n * defined. This not only improves external code, it provides more test\n * coverage for openssl's own code.\n */\n\n# ifdef BN_DEBUG\n/*\n * The new BN_FLG_FIXED_TOP flag marks vectors that were not treated with\n * bn_correct_top, in other words such vectors are permitted to have zeros\n * in most significant limbs. Such vectors are used internally to achieve\n * execution time invariance for critical operations with private keys.\n * It's BN_DEBUG-only flag, because user application is not supposed to\n * observe it anyway. Moreover, optimizing compiler would actually remove\n * all operations manipulating the bit in question in non-BN_DEBUG build.\n */\n# define BN_FLG_FIXED_TOP 0x10000\n# ifdef BN_DEBUG_RAND\n# define bn_pollute(a) \\\n do { \\\n const BIGNUM *_bnum1 = (a); \\\n if (_bnum1->top < _bnum1->dmax) { \\\n unsigned char _tmp_char; \\\n /* We cast away const without the compiler knowing, any \\\n * *genuinely* constant variables that aren't mutable \\\n * wouldn't be constructed with top!=dmax. */ \\\n BN_ULONG *_not_const; \\\n memcpy(&_not_const, &_bnum1->d, sizeof(_not_const)); \\\n RAND_bytes(&_tmp_char, 1); /* Debug only - safe to ignore error return */\\\n memset(_not_const + _bnum1->top, _tmp_char, \\\n sizeof(*_not_const) * (_bnum1->dmax - _bnum1->top)); \\\n } \\\n } while(0)\n# else\n# define bn_pollute(a)\n# endif\n# define bn_check_top(a) \\\n do { \\\n const BIGNUM *_bnum2 = (a); \\\n if (_bnum2 != NULL) { \\\n int _top = _bnum2->top; \\\n (void)ossl_assert((_top == 0 && !_bnum2->neg) || \\\n (_top && ((_bnum2->flags & BN_FLG_FIXED_TOP) \\\n || _bnum2->d[_top - 1] != 0))); \\\n bn_pollute(_bnum2); \\\n } \\\n } while(0)\n\n# define bn_fix_top(a) bn_check_top(a)\n\n# define bn_check_size(bn, bits) bn_wcheck_size(bn, ((bits+BN_BITS2-1))/BN_BITS2)\n# define bn_wcheck_size(bn, words) \\\n do { \\\n const BIGNUM *_bnum2 = (bn); \\\n assert((words) <= (_bnum2)->dmax && \\\n (words) >= (_bnum2)->top); \\\n /* avoid unused variable warning with NDEBUG */ \\\n (void)(_bnum2); \\\n } while(0)\n\n# else /* !BN_DEBUG */\n\n# define BN_FLG_FIXED_TOP 0\n# define bn_pollute(a)\n# define bn_check_top(a)\n# define bn_fix_top(a) bn_correct_top(a)\n# define bn_check_size(bn, bits)\n# define bn_wcheck_size(bn, words)\n\n# endif\n\nBN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num,\n BN_ULONG w);\nBN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);\nvoid bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num);\nBN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);\nBN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,\n int num);\nBN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,\n int num);\n\nstruct bignum_st {\n BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit\n * chunks. */\n int top; /* Index of last used d +1. */\n /* The next are internal book keeping for bn_expand. */\n int dmax; /* Size of the d array. */\n int neg; /* one if the number is negative */\n int flags;\n};\n\n/* Used for montgomery multiplication */\nstruct bn_mont_ctx_st {\n int ri; /* number of bits in R */\n BIGNUM RR; /* used to convert to montgomery form,\n possibly zero-padded */\n BIGNUM N; /* The modulus */\n BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1 (Ni is only\n * stored for bignum algorithm) */\n BN_ULONG n0[2]; /* least significant word(s) of Ni; (type\n * changed with 0.9.9, was \"BN_ULONG n0;\"\n * before) */\n int flags;\n};\n\n/*\n * Used for reciprocal division/mod functions It cannot be shared between\n * threads\n */\nstruct bn_recp_ctx_st {\n BIGNUM N; /* the divisor */\n BIGNUM Nr; /* the reciprocal */\n int num_bits;\n int shift;\n int flags;\n};\n\n/* Used for slow \"generation\" functions. */\nstruct bn_gencb_st {\n unsigned int ver; /* To handle binary (in)compatibility */\n void *arg; /* callback-specific data */\n union {\n /* if (ver==1) - handles old style callbacks */\n void (*cb_1) (int, int, void *);\n /* if (ver==2) - new callback style */\n int (*cb_2) (int, int, BN_GENCB *);\n } cb;\n};\n\n/*-\n * BN_window_bits_for_exponent_size -- macro for sliding window mod_exp functions\n *\n *\n * For window size 'w' (w >= 2) and a random 'b' bits exponent,\n * the number of multiplications is a constant plus on average\n *\n * 2^(w-1) + (b-w)/(w+1);\n *\n * here 2^(w-1) is for precomputing the table (we actually need\n * entries only for windows that have the lowest bit set), and\n * (b-w)/(w+1) is an approximation for the expected number of\n * w-bit windows, not counting the first one.\n *\n * Thus we should use\n *\n * w >= 6 if b > 671\n * w = 5 if 671 > b > 239\n * w = 4 if 239 > b > 79\n * w = 3 if 79 > b > 23\n * w <= 2 if 23 > b\n *\n * (with draws in between). Very small exponents are often selected\n * with low Hamming weight, so we use w = 1 for b <= 23.\n */\n# define BN_window_bits_for_exponent_size(b) \\\n ((b) > 671 ? 6 : \\\n (b) > 239 ? 5 : \\\n (b) > 79 ? 4 : \\\n (b) > 23 ? 3 : 1)\n\n/*\n * BN_mod_exp_mont_consttime is based on the assumption that the L1 data cache\n * line width of the target processor is at least the following value.\n */\n# define MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH ( 64 )\n# define MOD_EXP_CTIME_MIN_CACHE_LINE_MASK (MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH - 1)\n\n/*\n * Window sizes optimized for fixed window size modular exponentiation\n * algorithm (BN_mod_exp_mont_consttime). To achieve the security goals of\n * BN_mode_exp_mont_consttime, the maximum size of the window must not exceed\n * log_2(MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH). Window size thresholds are\n * defined for cache line sizes of 32 and 64, cache line sizes where\n * log_2(32)=5 and log_2(64)=6 respectively. A window size of 7 should only be\n * used on processors that have a 128 byte or greater cache line size.\n */\n# if MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH == 64\n\n# define BN_window_bits_for_ctime_exponent_size(b) \\\n ((b) > 937 ? 6 : \\\n (b) > 306 ? 5 : \\\n (b) > 89 ? 4 : \\\n (b) > 22 ? 3 : 1)\n# define BN_MAX_WINDOW_BITS_FOR_CTIME_EXPONENT_SIZE (6)\n\n# elif MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH == 32\n\n# define BN_window_bits_for_ctime_exponent_size(b) \\\n ((b) > 306 ? 5 : \\\n (b) > 89 ? 4 : \\\n (b) > 22 ? 3 : 1)\n# define BN_MAX_WINDOW_BITS_FOR_CTIME_EXPONENT_SIZE (5)\n\n# endif\n\n/* Pentium pro 16,16,16,32,64 */\n/* Alpha 16,16,16,16.64 */\n# define BN_MULL_SIZE_NORMAL (16)/* 32 */\n# define BN_MUL_RECURSIVE_SIZE_NORMAL (16)/* 32 less than */\n# define BN_SQR_RECURSIVE_SIZE_NORMAL (16)/* 32 */\n# define BN_MUL_LOW_RECURSIVE_SIZE_NORMAL (32)/* 32 */\n# define BN_MONT_CTX_SET_SIZE_WORD (64)/* 32 */\n\n/*\n * 2011-02-22 SMS. In various places, a size_t variable or a type cast to\n * size_t was used to perform integer-only operations on pointers. This\n * failed on VMS with 64-bit pointers (CC /POINTER_SIZE = 64) because size_t\n * is still only 32 bits. What's needed in these cases is an integer type\n * with the same size as a pointer, which size_t is not certain to be. The\n * only fix here is VMS-specific.\n */\n# if defined(OPENSSL_SYS_VMS)\n# if __INITIAL_POINTER_SIZE == 64\n# define PTR_SIZE_INT long long\n# else /* __INITIAL_POINTER_SIZE == 64 */\n# define PTR_SIZE_INT int\n# endif /* __INITIAL_POINTER_SIZE == 64 [else] */\n# elif !defined(PTR_SIZE_INT) /* defined(OPENSSL_SYS_VMS) */\n# define PTR_SIZE_INT size_t\n# endif /* defined(OPENSSL_SYS_VMS) [else] */\n\n# if !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM) && !defined(PEDANTIC)\n/*\n * BN_UMULT_HIGH section.\n * If the compiler doesn't support 2*N integer type, then you have to\n * replace every N*N multiplication with 4 (N/2)*(N/2) accompanied by some\n * shifts and additions which unavoidably results in severe performance\n * penalties. Of course provided that the hardware is capable of producing\n * 2*N result... That's when you normally start considering assembler\n * implementation. However! It should be pointed out that some CPUs (e.g.,\n * PowerPC, Alpha, and IA-64) provide *separate* instruction calculating\n * the upper half of the product placing the result into a general\n * purpose register. Now *if* the compiler supports inline assembler,\n * then it's not impossible to implement the \"bignum\" routines (and have\n * the compiler optimize 'em) exhibiting \"native\" performance in C. That's\n * what BN_UMULT_HIGH macro is about:-) Note that more recent compilers do\n * support 2*64 integer type, which is also used here.\n */\n# if defined(__SIZEOF_INT128__) && __SIZEOF_INT128__==16 && \\\n (defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG))\n# define BN_UMULT_HIGH(a,b) (((__uint128_t)(a)*(b))>>64)\n# define BN_UMULT_LOHI(low,high,a,b) ({ \\\n __uint128_t ret=(__uint128_t)(a)*(b); \\\n (high)=ret>>64; (low)=ret; })\n# elif defined(__alpha) && (defined(SIXTY_FOUR_BIT_LONG) || defined(SIXTY_FOUR_BIT))\n# if defined(__DECC)\n# include \n# define BN_UMULT_HIGH(a,b) (BN_ULONG)asm(\"umulh %a0,%a1,%v0\",(a),(b))\n# elif defined(__GNUC__) && __GNUC__>=2\n# define BN_UMULT_HIGH(a,b) ({ \\\n register BN_ULONG ret; \\\n asm (\"umulh %1,%2,%0\" \\\n : \"=r\"(ret) \\\n : \"r\"(a), \"r\"(b)); \\\n ret; })\n# endif /* compiler */\n# elif defined(_ARCH_PPC64) && defined(SIXTY_FOUR_BIT_LONG)\n# if defined(__GNUC__) && __GNUC__>=2\n# define BN_UMULT_HIGH(a,b) ({ \\\n register BN_ULONG ret; \\\n asm (\"mulhdu %0,%1,%2\" \\\n : \"=r\"(ret) \\\n : \"r\"(a), \"r\"(b)); \\\n ret; })\n# endif /* compiler */\n# elif (defined(__x86_64) || defined(__x86_64__)) && \\\n (defined(SIXTY_FOUR_BIT_LONG) || defined(SIXTY_FOUR_BIT))\n# if defined(__GNUC__) && __GNUC__>=2\n# define BN_UMULT_HIGH(a,b) ({ \\\n register BN_ULONG ret,discard; \\\n asm (\"mulq %3\" \\\n : \"=a\"(discard),\"=d\"(ret) \\\n : \"a\"(a), \"g\"(b) \\\n : \"cc\"); \\\n ret; })\n# define BN_UMULT_LOHI(low,high,a,b) \\\n asm (\"mulq %3\" \\\n : \"=a\"(low),\"=d\"(high) \\\n : \"a\"(a),\"g\"(b) \\\n : \"cc\");\n# endif\n# elif (defined(_M_AMD64) || defined(_M_X64)) && defined(SIXTY_FOUR_BIT)\n# if defined(_MSC_VER) && _MSC_VER>=1400\nunsigned __int64 __umulh(unsigned __int64 a, unsigned __int64 b);\nunsigned __int64 _umul128(unsigned __int64 a, unsigned __int64 b,\n unsigned __int64 *h);\n# pragma intrinsic(__umulh,_umul128)\n# define BN_UMULT_HIGH(a,b) __umulh((a),(b))\n# define BN_UMULT_LOHI(low,high,a,b) ((low)=_umul128((a),(b),&(high)))\n# endif\n# elif defined(__mips) && (defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG))\n# if defined(__GNUC__) && __GNUC__>=2\n# define BN_UMULT_HIGH(a,b) ({ \\\n register BN_ULONG ret; \\\n asm (\"dmultu %1,%2\" \\\n : \"=h\"(ret) \\\n : \"r\"(a), \"r\"(b) : \"l\"); \\\n ret; })\n# define BN_UMULT_LOHI(low,high,a,b) \\\n asm (\"dmultu %2,%3\" \\\n : \"=l\"(low),\"=h\"(high) \\\n : \"r\"(a), \"r\"(b));\n# endif\n# elif defined(__aarch64__) && defined(SIXTY_FOUR_BIT_LONG)\n# if defined(__GNUC__) && __GNUC__>=2\n# define BN_UMULT_HIGH(a,b) ({ \\\n register BN_ULONG ret; \\\n asm (\"umulh %0,%1,%2\" \\\n : \"=r\"(ret) \\\n : \"r\"(a), \"r\"(b)); \\\n ret; })\n# endif\n# endif /* cpu */\n# endif /* OPENSSL_NO_ASM */\n\n# ifdef BN_DEBUG_RAND\n# define bn_clear_top2max(a) \\\n { \\\n int ind = (a)->dmax - (a)->top; \\\n BN_ULONG *ftl = &(a)->d[(a)->top-1]; \\\n for (; ind != 0; ind--) \\\n *(++ftl) = 0x0; \\\n }\n# else\n# define bn_clear_top2max(a)\n# endif\n\n# ifdef BN_LLONG\n/*******************************************************************\n * Using the long long type, has to be twice as wide as BN_ULONG...\n */\n# define Lw(t) (((BN_ULONG)(t))&BN_MASK2)\n# define Hw(t) (((BN_ULONG)((t)>>BN_BITS2))&BN_MASK2)\n\n# define mul_add(r,a,w,c) { \\\n BN_ULLONG t; \\\n t=(BN_ULLONG)w * (a) + (r) + (c); \\\n (r)= Lw(t); \\\n (c)= Hw(t); \\\n }\n\n# define mul(r,a,w,c) { \\\n BN_ULLONG t; \\\n t=(BN_ULLONG)w * (a) + (c); \\\n (r)= Lw(t); \\\n (c)= Hw(t); \\\n }\n\n# define sqr(r0,r1,a) { \\\n BN_ULLONG t; \\\n t=(BN_ULLONG)(a)*(a); \\\n (r0)=Lw(t); \\\n (r1)=Hw(t); \\\n }\n\n# elif defined(BN_UMULT_LOHI)\n# define mul_add(r,a,w,c) { \\\n BN_ULONG high,low,ret,tmp=(a); \\\n ret = (r); \\\n BN_UMULT_LOHI(low,high,w,tmp); \\\n ret += (c); \\\n (c) = (ret<(c))?1:0; \\\n (c) += high; \\\n ret += low; \\\n (c) += (ret>BN_BITS4)&BN_MASK2l)\n# define L2HBITS(a) (((a)<>BN_BITS2)&BN_MASKl)\n# define LL2HBITS(a) ((BN_ULLONG)((a)&BN_MASKl)<>(BN_BITS4-1); \\\n m =(m&BN_MASK2l)<<(BN_BITS4+1); \\\n l=(l+m)&BN_MASK2; if (l < m) h++; \\\n (lo)=l; \\\n (ho)=h; \\\n }\n\n# define mul_add(r,a,bl,bh,c) { \\\n BN_ULONG l,h; \\\n \\\n h= (a); \\\n l=LBITS(h); \\\n h=HBITS(h); \\\n mul64(l,h,(bl),(bh)); \\\n \\\n /* non-multiply part */ \\\n l=(l+(c))&BN_MASK2; if (l < (c)) h++; \\\n (c)=(r); \\\n l=(l+(c))&BN_MASK2; if (l < (c)) h++; \\\n (c)=h&BN_MASK2; \\\n (r)=l; \\\n }\n\n# define mul(r,a,bl,bh,c) { \\\n BN_ULONG l,h; \\\n \\\n h= (a); \\\n l=LBITS(h); \\\n h=HBITS(h); \\\n mul64(l,h,(bl),(bh)); \\\n \\\n /* non-multiply part */ \\\n l+=(c); if ((l&BN_MASK2) < (c)) h++; \\\n (c)=h&BN_MASK2; \\\n (r)=l&BN_MASK2; \\\n }\n# endif /* !BN_LLONG */\n\nvoid BN_RECP_CTX_init(BN_RECP_CTX *recp);\nvoid BN_MONT_CTX_init(BN_MONT_CTX *ctx);\n\nvoid bn_init(BIGNUM *a);\nvoid bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb);\nvoid bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b);\nvoid bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b);\nvoid bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp);\nvoid bn_sqr_comba8(BN_ULONG *r, const BN_ULONG *a);\nvoid bn_sqr_comba4(BN_ULONG *r, const BN_ULONG *a);\nint bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n);\nint bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl);\nvoid bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,\n int dna, int dnb, BN_ULONG *t);\nvoid bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b,\n int n, int tna, int tnb, BN_ULONG *t);\nvoid bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t);\nvoid bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n);\nvoid bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,\n BN_ULONG *t);\nBN_ULONG bn_sub_part_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b,\n int cl, int dl);\nint bn_mul_mont(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,\n const BN_ULONG *np, const BN_ULONG *n0, int num);\n\nBIGNUM *int_bn_mod_inverse(BIGNUM *in,\n const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,\n int *noinv);\n\nstatic ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)\n{\n if (bits > (INT_MAX - BN_BITS2 + 1))\n return NULL;\n\n if (((bits+BN_BITS2-1)/BN_BITS2) <= (a)->dmax)\n return a;\n\n return bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2);\n}\n\n#endif\n" }, { "path": "cryptomini/bn/bn_mod.c", "content": "/*\n * Copyright 1998-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \"internal/cryptlib.h\"\n#include \"bn_local.h\"\n\nint BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)\n{\n /*\n * like BN_mod, but returns non-negative remainder (i.e., 0 <= r < |d|\n * always holds)\n */\n\n if (!(BN_mod(r, m, d, ctx)))\n return 0;\n if (!r->neg)\n return 1;\n /* now -|d| < r < 0, so we have to set r := r + |d| */\n return (d->neg ? BN_sub : BN_add) (r, r, d);\n}\n\nint BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,\n BN_CTX *ctx)\n{\n if (!BN_add(r, a, b))\n return 0;\n return BN_nnmod(r, r, m, ctx);\n}\n\n/*\n * BN_mod_add variant that may be used if both a and b are non-negative and\n * less than m. The original algorithm was\n *\n * if (!BN_uadd(r, a, b))\n * return 0;\n * if (BN_ucmp(r, m) >= 0)\n * return BN_usub(r, r, m);\n *\n * which is replaced with addition, subtracting modulus, and conditional\n * move depending on whether or not subtraction borrowed.\n */\nint bn_mod_add_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n const BIGNUM *m)\n{\n size_t i, ai, bi, mtop = m->top;\n BN_ULONG storage[1024 / BN_BITS2];\n BN_ULONG carry, temp, mask, *rp, *tp = storage;\n const BN_ULONG *ap, *bp;\n\n if (bn_wexpand(r, mtop) == NULL)\n return 0;\n\n if (mtop > sizeof(storage) / sizeof(storage[0])\n && (tp = OPENSSL_malloc(mtop * sizeof(BN_ULONG))) == NULL)\n return 0;\n\n ap = a->d != NULL ? a->d : tp;\n bp = b->d != NULL ? b->d : tp;\n\n for (i = 0, ai = 0, bi = 0, carry = 0; i < mtop;) {\n mask = (BN_ULONG)0 - ((i - a->top) >> (8 * sizeof(i) - 1));\n temp = ((ap[ai] & mask) + carry) & BN_MASK2;\n carry = (temp < carry);\n\n mask = (BN_ULONG)0 - ((i - b->top) >> (8 * sizeof(i) - 1));\n tp[i] = ((bp[bi] & mask) + temp) & BN_MASK2;\n carry += (tp[i] < temp);\n\n i++;\n ai += (i - a->dmax) >> (8 * sizeof(i) - 1);\n bi += (i - b->dmax) >> (8 * sizeof(i) - 1);\n }\n rp = r->d;\n carry -= bn_sub_words(rp, tp, m->d, mtop);\n for (i = 0; i < mtop; i++) {\n rp[i] = (carry & tp[i]) | (~carry & rp[i]);\n ((volatile BN_ULONG *)tp)[i] = 0;\n }\n r->top = mtop;\n r->flags |= BN_FLG_FIXED_TOP;\n r->neg = 0;\n\n if (tp != storage)\n OPENSSL_free(tp);\n\n return 1;\n}\n\nint BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n const BIGNUM *m)\n{\n int ret = bn_mod_add_fixed_top(r, a, b, m);\n\n if (ret)\n bn_correct_top(r);\n\n return ret;\n}\n\nint BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,\n BN_CTX *ctx)\n{\n if (!BN_sub(r, a, b))\n return 0;\n return BN_nnmod(r, r, m, ctx);\n}\n\n/*\n * BN_mod_sub variant that may be used if both a and b are non-negative,\n * a is less than m, while b is of same bit width as m. It's implemented\n * as subtraction followed by two conditional additions.\n *\n * 0 <= a < m\n * 0 <= b < 2^w < 2*m\n *\n * after subtraction\n *\n * -2*m < r = a - b < m\n *\n * Thus it takes up to two conditional additions to make |r| positive.\n */\nint bn_mod_sub_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n const BIGNUM *m)\n{\n size_t i, ai, bi, mtop = m->top;\n BN_ULONG borrow, carry, ta, tb, mask, *rp;\n const BN_ULONG *ap, *bp;\n\n if (bn_wexpand(r, mtop) == NULL)\n return 0;\n\n rp = r->d;\n ap = a->d != NULL ? a->d : rp;\n bp = b->d != NULL ? b->d : rp;\n\n for (i = 0, ai = 0, bi = 0, borrow = 0; i < mtop;) {\n mask = (BN_ULONG)0 - ((i - a->top) >> (8 * sizeof(i) - 1));\n ta = ap[ai] & mask;\n\n mask = (BN_ULONG)0 - ((i - b->top) >> (8 * sizeof(i) - 1));\n tb = bp[bi] & mask;\n rp[i] = ta - tb - borrow;\n if (ta != tb)\n borrow = (ta < tb);\n\n i++;\n ai += (i - a->dmax) >> (8 * sizeof(i) - 1);\n bi += (i - b->dmax) >> (8 * sizeof(i) - 1);\n }\n ap = m->d;\n for (i = 0, mask = 0 - borrow, carry = 0; i < mtop; i++) {\n ta = ((ap[i] & mask) + carry) & BN_MASK2;\n carry = (ta < carry);\n rp[i] = (rp[i] + ta) & BN_MASK2;\n carry += (rp[i] < ta);\n }\n borrow -= carry;\n for (i = 0, mask = 0 - borrow, carry = 0; i < mtop; i++) {\n ta = ((ap[i] & mask) + carry) & BN_MASK2;\n carry = (ta < carry);\n rp[i] = (rp[i] + ta) & BN_MASK2;\n carry += (rp[i] < ta);\n }\n\n r->top = mtop;\n r->flags |= BN_FLG_FIXED_TOP;\n r->neg = 0;\n\n return 1;\n}\n\n/*\n * BN_mod_sub variant that may be used if both a and b are non-negative and\n * less than m\n */\nint BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n const BIGNUM *m)\n{\n if (!BN_sub(r, a, b))\n return 0;\n if (r->neg)\n return BN_add(r, r, m);\n return 1;\n}\n\n/* slow but works */\nint BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,\n BN_CTX *ctx)\n{\n BIGNUM *t;\n int ret = 0;\n\n bn_check_top(a);\n bn_check_top(b);\n bn_check_top(m);\n\n BN_CTX_start(ctx);\n if ((t = BN_CTX_get(ctx)) == NULL)\n goto err;\n if (a == b) {\n if (!BN_sqr(t, a, ctx))\n goto err;\n } else {\n if (!BN_mul(t, a, b, ctx))\n goto err;\n }\n if (!BN_nnmod(r, t, m, ctx))\n goto err;\n bn_check_top(r);\n ret = 1;\n err:\n BN_CTX_end(ctx);\n return ret;\n}\n\nint BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx)\n{\n if (!BN_sqr(r, a, ctx))\n return 0;\n /* r->neg == 0, thus we don't need BN_nnmod */\n return BN_mod(r, r, m, ctx);\n}\n\nint BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx)\n{\n if (!BN_lshift1(r, a))\n return 0;\n bn_check_top(r);\n return BN_nnmod(r, r, m, ctx);\n}\n\n/*\n * BN_mod_lshift1 variant that may be used if a is non-negative and less than\n * m\n */\nint BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m)\n{\n if (!BN_lshift1(r, a))\n return 0;\n bn_check_top(r);\n if (BN_cmp(r, m) >= 0)\n return BN_sub(r, r, m);\n return 1;\n}\n\nint BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m,\n BN_CTX *ctx)\n{\n BIGNUM *abs_m = NULL;\n int ret;\n\n if (!BN_nnmod(r, a, m, ctx))\n return 0;\n\n if (m->neg) {\n abs_m = BN_dup(m);\n if (abs_m == NULL)\n return 0;\n abs_m->neg = 0;\n }\n\n ret = BN_mod_lshift_quick(r, r, n, (abs_m ? abs_m : m));\n bn_check_top(r);\n\n BN_free(abs_m);\n return ret;\n}\n\n/*\n * BN_mod_lshift variant that may be used if a is non-negative and less than\n * m\n */\nint BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m)\n{\n if (r != a) {\n if (BN_copy(r, a) == NULL)\n return 0;\n }\n\n while (n > 0) {\n int max_shift;\n\n /* 0 < r < m */\n max_shift = BN_num_bits(m) - BN_num_bits(r);\n /* max_shift >= 0 */\n\n if (max_shift < 0) {\n BNerr(BN_F_BN_MOD_LSHIFT_QUICK, BN_R_INPUT_NOT_REDUCED);\n return 0;\n }\n\n if (max_shift > n)\n max_shift = n;\n\n if (max_shift) {\n if (!BN_lshift(r, r, max_shift))\n return 0;\n n -= max_shift;\n } else {\n if (!BN_lshift1(r, r))\n return 0;\n --n;\n }\n\n /* BN_num_bits(r) <= BN_num_bits(m) */\n\n if (BN_cmp(r, m) >= 0) {\n if (!BN_sub(r, r, m))\n return 0;\n }\n }\n bn_check_top(r);\n\n return 1;\n}\n" }, { "path": "cryptomini/bn/bn_mont.c", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * Details about Montgomery multiplication algorithms can be found at\n * http://security.ece.orst.edu/publications.html, e.g.\n * http://security.ece.orst.edu/koc/papers/j37acmon.pdf and\n * sections 3.8 and 4.2 in http://security.ece.orst.edu/koc/papers/r01rsasw.pdf\n */\n\n#include \"internal/cryptlib.h\"\n#include \"bn_local.h\"\n\n#define MONT_WORD /* use the faster word-based algorithm */\n\n#ifdef MONT_WORD\nstatic int bn_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont);\n#endif\n\nint BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n BN_MONT_CTX *mont, BN_CTX *ctx)\n{\n int ret = bn_mul_mont_fixed_top(r, a, b, mont, ctx);\n\n bn_correct_top(r);\n bn_check_top(r);\n\n return ret;\n}\n\nint bn_mul_mont_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n BN_MONT_CTX *mont, BN_CTX *ctx)\n{\n BIGNUM *tmp;\n int ret = 0;\n int num = mont->N.top;\n\n#if defined(OPENSSL_BN_ASM_MONT) && defined(MONT_WORD)\n if (num > 1 && a->top == num && b->top == num) {\n if (bn_wexpand(r, num) == NULL)\n return 0;\n if (bn_mul_mont(r->d, a->d, b->d, mont->N.d, mont->n0, num)) {\n r->neg = a->neg ^ b->neg;\n r->top = num;\n r->flags |= BN_FLG_FIXED_TOP;\n return 1;\n }\n }\n#endif\n\n if ((a->top + b->top) > 2 * num)\n return 0;\n\n BN_CTX_start(ctx);\n tmp = BN_CTX_get(ctx);\n if (tmp == NULL)\n goto err;\n\n bn_check_top(tmp);\n if (a == b) {\n if (!bn_sqr_fixed_top(tmp, a, ctx))\n goto err;\n } else {\n if (!bn_mul_fixed_top(tmp, a, b, ctx))\n goto err;\n }\n /* reduce from aRR to aR */\n#ifdef MONT_WORD\n if (!bn_from_montgomery_word(r, tmp, mont))\n goto err;\n#else\n if (!BN_from_montgomery(r, tmp, mont, ctx))\n goto err;\n#endif\n ret = 1;\n err:\n BN_CTX_end(ctx);\n return ret;\n}\n\n#ifdef MONT_WORD\nstatic int bn_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)\n{\n BIGNUM *n;\n BN_ULONG *ap, *np, *rp, n0, v, carry;\n int nl, max, i;\n unsigned int rtop;\n\n n = &(mont->N);\n nl = n->top;\n if (nl == 0) {\n ret->top = 0;\n return 1;\n }\n\n max = (2 * nl); /* carry is stored separately */\n if (bn_wexpand(r, max) == NULL)\n return 0;\n\n r->neg ^= n->neg;\n np = n->d;\n rp = r->d;\n\n /* clear the top words of T */\n for (rtop = r->top, i = 0; i < max; i++) {\n v = (BN_ULONG)0 - ((i - rtop) >> (8 * sizeof(rtop) - 1));\n rp[i] &= v;\n }\n\n r->top = max;\n r->flags |= BN_FLG_FIXED_TOP;\n n0 = mont->n0[0];\n\n /*\n * Add multiples of |n| to |r| until R = 2^(nl * BN_BITS2) divides it. On\n * input, we had |r| < |n| * R, so now |r| < 2 * |n| * R. Note that |r|\n * includes |carry| which is stored separately.\n */\n for (carry = 0, i = 0; i < nl; i++, rp++) {\n v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);\n v = (v + carry + rp[nl]) & BN_MASK2;\n carry |= (v != rp[nl]);\n carry &= (v <= rp[nl]);\n rp[nl] = v;\n }\n\n if (bn_wexpand(ret, nl) == NULL)\n return 0;\n ret->top = nl;\n ret->flags |= BN_FLG_FIXED_TOP;\n ret->neg = r->neg;\n\n rp = ret->d;\n\n /*\n * Shift |nl| words to divide by R. We have |ap| < 2 * |n|. Note that |ap|\n * includes |carry| which is stored separately.\n */\n ap = &(r->d[nl]);\n\n carry -= bn_sub_words(rp, ap, np, nl);\n /*\n * |carry| is -1 if |ap| - |np| underflowed or zero if it did not. Note\n * |carry| cannot be 1. That would imply the subtraction did not fit in\n * |nl| words, and we know at most one subtraction is needed.\n */\n for (i = 0; i < nl; i++) {\n rp[i] = (carry & ap[i]) | (~carry & rp[i]);\n ap[i] = 0;\n }\n\n return 1;\n}\n#endif /* MONT_WORD */\n\nint BN_from_montgomery(BIGNUM *ret, const BIGNUM *a, BN_MONT_CTX *mont,\n BN_CTX *ctx)\n{\n int retn;\n\n retn = bn_from_mont_fixed_top(ret, a, mont, ctx);\n bn_correct_top(ret);\n bn_check_top(ret);\n\n return retn;\n}\n\nint bn_from_mont_fixed_top(BIGNUM *ret, const BIGNUM *a, BN_MONT_CTX *mont,\n BN_CTX *ctx)\n{\n int retn = 0;\n#ifdef MONT_WORD\n BIGNUM *t;\n\n BN_CTX_start(ctx);\n if ((t = BN_CTX_get(ctx)) && BN_copy(t, a)) {\n retn = bn_from_montgomery_word(ret, t, mont);\n }\n BN_CTX_end(ctx);\n#else /* !MONT_WORD */\n BIGNUM *t1, *t2;\n\n BN_CTX_start(ctx);\n t1 = BN_CTX_get(ctx);\n t2 = BN_CTX_get(ctx);\n if (t2 == NULL)\n goto err;\n\n if (!BN_copy(t1, a))\n goto err;\n BN_mask_bits(t1, mont->ri);\n\n if (!BN_mul(t2, t1, &mont->Ni, ctx))\n goto err;\n BN_mask_bits(t2, mont->ri);\n\n if (!BN_mul(t1, t2, &mont->N, ctx))\n goto err;\n if (!BN_add(t2, a, t1))\n goto err;\n if (!BN_rshift(ret, t2, mont->ri))\n goto err;\n\n if (BN_ucmp(ret, &(mont->N)) >= 0) {\n if (!BN_usub(ret, ret, &(mont->N)))\n goto err;\n }\n retn = 1;\n bn_check_top(ret);\n err:\n BN_CTX_end(ctx);\n#endif /* MONT_WORD */\n return retn;\n}\n\nint bn_to_mont_fixed_top(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,\n BN_CTX *ctx)\n{\n return bn_mul_mont_fixed_top(r, a, &(mont->RR), mont, ctx);\n}\n\nBN_MONT_CTX *BN_MONT_CTX_new(void)\n{\n BN_MONT_CTX *ret;\n\n if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL) {\n BNerr(BN_F_BN_MONT_CTX_NEW, ERR_R_MALLOC_FAILURE);\n return NULL;\n }\n\n BN_MONT_CTX_init(ret);\n ret->flags = BN_FLG_MALLOCED;\n return ret;\n}\n\nvoid BN_MONT_CTX_init(BN_MONT_CTX *ctx)\n{\n ctx->ri = 0;\n bn_init(&ctx->RR);\n bn_init(&ctx->N);\n bn_init(&ctx->Ni);\n ctx->n0[0] = ctx->n0[1] = 0;\n ctx->flags = 0;\n}\n\nvoid BN_MONT_CTX_free(BN_MONT_CTX *mont)\n{\n if (mont == NULL)\n return;\n BN_clear_free(&mont->RR);\n BN_clear_free(&mont->N);\n BN_clear_free(&mont->Ni);\n if (mont->flags & BN_FLG_MALLOCED)\n OPENSSL_free(mont);\n}\n\nint BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx)\n{\n int i, ret = 0;\n BIGNUM *Ri, *R;\n\n if (BN_is_zero(mod))\n return 0;\n\n BN_CTX_start(ctx);\n if ((Ri = BN_CTX_get(ctx)) == NULL)\n goto err;\n R = &(mont->RR); /* grab RR as a temp */\n if (!BN_copy(&(mont->N), mod))\n goto err; /* Set N */\n if (BN_get_flags(mod, BN_FLG_CONSTTIME) != 0)\n BN_set_flags(&(mont->N), BN_FLG_CONSTTIME);\n mont->N.neg = 0;\n\n#ifdef MONT_WORD\n {\n BIGNUM tmod;\n BN_ULONG buf[2];\n\n bn_init(&tmod);\n tmod.d = buf;\n tmod.dmax = 2;\n tmod.neg = 0;\n\n if (BN_get_flags(mod, BN_FLG_CONSTTIME) != 0)\n BN_set_flags(&tmod, BN_FLG_CONSTTIME);\n\n mont->ri = (BN_num_bits(mod) + (BN_BITS2 - 1)) / BN_BITS2 * BN_BITS2;\n\n# if defined(OPENSSL_BN_ASM_MONT) && (BN_BITS2<=32)\n /*\n * Only certain BN_BITS2<=32 platforms actually make use of n0[1],\n * and we could use the #else case (with a shorter R value) for the\n * others. However, currently only the assembler files do know which\n * is which.\n */\n\n BN_zero(R);\n if (!(BN_set_bit(R, 2 * BN_BITS2)))\n goto err;\n\n tmod.top = 0;\n if ((buf[0] = mod->d[0]))\n tmod.top = 1;\n if ((buf[1] = mod->top > 1 ? mod->d[1] : 0))\n tmod.top = 2;\n\n if (BN_is_one(&tmod))\n BN_zero(Ri);\n else if ((BN_mod_inverse(Ri, R, &tmod, ctx)) == NULL)\n goto err;\n if (!BN_lshift(Ri, Ri, 2 * BN_BITS2))\n goto err; /* R*Ri */\n if (!BN_is_zero(Ri)) {\n if (!BN_sub_word(Ri, 1))\n goto err;\n } else { /* if N mod word size == 1 */\n\n if (bn_expand(Ri, (int)sizeof(BN_ULONG) * 2) == NULL)\n goto err;\n /* Ri-- (mod double word size) */\n Ri->neg = 0;\n Ri->d[0] = BN_MASK2;\n Ri->d[1] = BN_MASK2;\n Ri->top = 2;\n }\n if (!BN_div(Ri, NULL, Ri, &tmod, ctx))\n goto err;\n /*\n * Ni = (R*Ri-1)/N, keep only couple of least significant words:\n */\n mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0;\n mont->n0[1] = (Ri->top > 1) ? Ri->d[1] : 0;\n# else\n BN_zero(R);\n if (!(BN_set_bit(R, BN_BITS2)))\n goto err; /* R */\n\n buf[0] = mod->d[0]; /* tmod = N mod word size */\n buf[1] = 0;\n tmod.top = buf[0] != 0 ? 1 : 0;\n /* Ri = R^-1 mod N */\n if (BN_is_one(&tmod))\n BN_zero(Ri);\n else if ((BN_mod_inverse(Ri, R, &tmod, ctx)) == NULL)\n goto err;\n if (!BN_lshift(Ri, Ri, BN_BITS2))\n goto err; /* R*Ri */\n if (!BN_is_zero(Ri)) {\n if (!BN_sub_word(Ri, 1))\n goto err;\n } else { /* if N mod word size == 1 */\n\n if (!BN_set_word(Ri, BN_MASK2))\n goto err; /* Ri-- (mod word size) */\n }\n if (!BN_div(Ri, NULL, Ri, &tmod, ctx))\n goto err;\n /*\n * Ni = (R*Ri-1)/N, keep only least significant word:\n */\n mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0;\n mont->n0[1] = 0;\n# endif\n }\n#else /* !MONT_WORD */\n { /* bignum version */\n mont->ri = BN_num_bits(&mont->N);\n BN_zero(R);\n if (!BN_set_bit(R, mont->ri))\n goto err; /* R = 2^ri */\n /* Ri = R^-1 mod N */\n if ((BN_mod_inverse(Ri, R, &mont->N, ctx)) == NULL)\n goto err;\n if (!BN_lshift(Ri, Ri, mont->ri))\n goto err; /* R*Ri */\n if (!BN_sub_word(Ri, 1))\n goto err;\n /*\n * Ni = (R*Ri-1) / N\n */\n if (!BN_div(&(mont->Ni), NULL, Ri, &mont->N, ctx))\n goto err;\n }\n#endif\n\n /* setup RR for conversions */\n BN_zero(&(mont->RR));\n if (!BN_set_bit(&(mont->RR), mont->ri * 2))\n goto err;\n if (!BN_mod(&(mont->RR), &(mont->RR), &(mont->N), ctx))\n goto err;\n\n for (i = mont->RR.top, ret = mont->N.top; i < ret; i++)\n mont->RR.d[i] = 0;\n mont->RR.top = ret;\n mont->RR.flags |= BN_FLG_FIXED_TOP;\n\n ret = 1;\n err:\n BN_CTX_end(ctx);\n return ret;\n}\n\nBN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, BN_MONT_CTX *from)\n{\n if (to == from)\n return to;\n\n if (!BN_copy(&(to->RR), &(from->RR)))\n return NULL;\n if (!BN_copy(&(to->N), &(from->N)))\n return NULL;\n if (!BN_copy(&(to->Ni), &(from->Ni)))\n return NULL;\n to->ri = from->ri;\n to->n0[0] = from->n0[0];\n to->n0[1] = from->n0[1];\n return to;\n}\n\nBN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, CRYPTO_RWLOCK *lock,\n const BIGNUM *mod, BN_CTX *ctx)\n{\n BN_MONT_CTX *ret;\n\n CRYPTO_THREAD_read_lock(lock);\n ret = *pmont;\n CRYPTO_THREAD_unlock(lock);\n if (ret)\n return ret;\n\n /*\n * We don't want to serialise globally while doing our lazy-init math in\n * BN_MONT_CTX_set. That punishes threads that are doing independent\n * things. Instead, punish the case where more than one thread tries to\n * lazy-init the same 'pmont', by having each do the lazy-init math work\n * independently and only use the one from the thread that wins the race\n * (the losers throw away the work they've done).\n */\n ret = BN_MONT_CTX_new();\n if (ret == NULL)\n return NULL;\n if (!BN_MONT_CTX_set(ret, mod, ctx)) {\n BN_MONT_CTX_free(ret);\n return NULL;\n }\n\n /* The locked compare-and-set, after the local work is done. */\n CRYPTO_THREAD_write_lock(lock);\n if (*pmont) {\n BN_MONT_CTX_free(ret);\n ret = *pmont;\n } else\n *pmont = ret;\n CRYPTO_THREAD_unlock(lock);\n return ret;\n}\n" }, { "path": "cryptomini/bn/bn_mul.c", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \"internal/cryptlib.h\"\n#include \"bn_local.h\"\n\n#if defined(OPENSSL_NO_ASM) || !defined(OPENSSL_BN_ASM_PART_WORDS)\n/*\n * Here follows specialised variants of bn_add_words() and bn_sub_words().\n * They have the property performing operations on arrays of different sizes.\n * The sizes of those arrays is expressed through cl, which is the common\n * length ( basically, min(len(a),len(b)) ), and dl, which is the delta\n * between the two lengths, calculated as len(a)-len(b). All lengths are the\n * number of BN_ULONGs... For the operations that require a result array as\n * parameter, it must have the length cl+abs(dl). These functions should\n * probably end up in bn_asm.c as soon as there are assembler counterparts\n * for the systems that use assembler files.\n */\n\nBN_ULONG bn_sub_part_words(BN_ULONG *r,\n const BN_ULONG *a, const BN_ULONG *b,\n int cl, int dl)\n{\n BN_ULONG c, t;\n\n assert(cl >= 0);\n c = bn_sub_words(r, a, b, cl);\n\n if (dl == 0)\n return c;\n\n r += cl;\n a += cl;\n b += cl;\n\n if (dl < 0) {\n for (;;) {\n t = b[0];\n r[0] = (0 - t - c) & BN_MASK2;\n if (t != 0)\n c = 1;\n if (++dl >= 0)\n break;\n\n t = b[1];\n r[1] = (0 - t - c) & BN_MASK2;\n if (t != 0)\n c = 1;\n if (++dl >= 0)\n break;\n\n t = b[2];\n r[2] = (0 - t - c) & BN_MASK2;\n if (t != 0)\n c = 1;\n if (++dl >= 0)\n break;\n\n t = b[3];\n r[3] = (0 - t - c) & BN_MASK2;\n if (t != 0)\n c = 1;\n if (++dl >= 0)\n break;\n\n b += 4;\n r += 4;\n }\n } else {\n int save_dl = dl;\n while (c) {\n t = a[0];\n r[0] = (t - c) & BN_MASK2;\n if (t != 0)\n c = 0;\n if (--dl <= 0)\n break;\n\n t = a[1];\n r[1] = (t - c) & BN_MASK2;\n if (t != 0)\n c = 0;\n if (--dl <= 0)\n break;\n\n t = a[2];\n r[2] = (t - c) & BN_MASK2;\n if (t != 0)\n c = 0;\n if (--dl <= 0)\n break;\n\n t = a[3];\n r[3] = (t - c) & BN_MASK2;\n if (t != 0)\n c = 0;\n if (--dl <= 0)\n break;\n\n save_dl = dl;\n a += 4;\n r += 4;\n }\n if (dl > 0) {\n if (save_dl > dl) {\n switch (save_dl - dl) {\n case 1:\n r[1] = a[1];\n if (--dl <= 0)\n break;\n /* fall thru */\n case 2:\n r[2] = a[2];\n if (--dl <= 0)\n break;\n /* fall thru */\n case 3:\n r[3] = a[3];\n if (--dl <= 0)\n break;\n }\n a += 4;\n r += 4;\n }\n }\n if (dl > 0) {\n for (;;) {\n r[0] = a[0];\n if (--dl <= 0)\n break;\n r[1] = a[1];\n if (--dl <= 0)\n break;\n r[2] = a[2];\n if (--dl <= 0)\n break;\n r[3] = a[3];\n if (--dl <= 0)\n break;\n\n a += 4;\n r += 4;\n }\n }\n }\n return c;\n}\n#endif\n\n#ifdef BN_RECURSION\n/*\n * Karatsuba recursive multiplication algorithm (cf. Knuth, The Art of\n * Computer Programming, Vol. 2)\n */\n\n/*-\n * r is 2*n2 words in size,\n * a and b are both n2 words in size.\n * n2 must be a power of 2.\n * We multiply and return the result.\n * t must be 2*n2 words in size\n * We calculate\n * a[0]*b[0]\n * a[0]*b[0]+a[1]*b[1]+(a[0]-a[1])*(b[1]-b[0])\n * a[1]*b[1]\n */\n/* dnX may not be positive, but n2/2+dnX has to be */\nvoid bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,\n int dna, int dnb, BN_ULONG *t)\n{\n int n = n2 / 2, c1, c2;\n int tna = n + dna, tnb = n + dnb;\n unsigned int neg, zero;\n BN_ULONG ln, lo, *p;\n\n# ifdef BN_MUL_COMBA\n# if 0\n if (n2 == 4) {\n bn_mul_comba4(r, a, b);\n return;\n }\n# endif\n /*\n * Only call bn_mul_comba 8 if n2 == 8 and the two arrays are complete\n * [steve]\n */\n if (n2 == 8 && dna == 0 && dnb == 0) {\n bn_mul_comba8(r, a, b);\n return;\n }\n# endif /* BN_MUL_COMBA */\n /* Else do normal multiply */\n if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) {\n bn_mul_normal(r, a, n2 + dna, b, n2 + dnb);\n if ((dna + dnb) < 0)\n memset(&r[2 * n2 + dna + dnb], 0,\n sizeof(BN_ULONG) * -(dna + dnb));\n return;\n }\n /* r=(a[0]-a[1])*(b[1]-b[0]) */\n c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);\n c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);\n zero = neg = 0;\n switch (c1 * 3 + c2) {\n case -4:\n bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */\n bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */\n break;\n case -3:\n zero = 1;\n break;\n case -2:\n bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */\n bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n); /* + */\n neg = 1;\n break;\n case -1:\n case 0:\n case 1:\n zero = 1;\n break;\n case 2:\n bn_sub_part_words(t, a, &(a[n]), tna, n - tna); /* + */\n bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */\n neg = 1;\n break;\n case 3:\n zero = 1;\n break;\n case 4:\n bn_sub_part_words(t, a, &(a[n]), tna, n - tna);\n bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n);\n break;\n }\n\n# ifdef BN_MUL_COMBA\n if (n == 4 && dna == 0 && dnb == 0) { /* XXX: bn_mul_comba4 could take\n * extra args to do this well */\n if (!zero)\n bn_mul_comba4(&(t[n2]), t, &(t[n]));\n else\n memset(&t[n2], 0, sizeof(*t) * 8);\n\n bn_mul_comba4(r, a, b);\n bn_mul_comba4(&(r[n2]), &(a[n]), &(b[n]));\n } else if (n == 8 && dna == 0 && dnb == 0) { /* XXX: bn_mul_comba8 could\n * take extra args to do\n * this well */\n if (!zero)\n bn_mul_comba8(&(t[n2]), t, &(t[n]));\n else\n memset(&t[n2], 0, sizeof(*t) * 16);\n\n bn_mul_comba8(r, a, b);\n bn_mul_comba8(&(r[n2]), &(a[n]), &(b[n]));\n } else\n# endif /* BN_MUL_COMBA */\n {\n p = &(t[n2 * 2]);\n if (!zero)\n bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);\n else\n memset(&t[n2], 0, sizeof(*t) * n2);\n bn_mul_recursive(r, a, b, n, 0, 0, p);\n bn_mul_recursive(&(r[n2]), &(a[n]), &(b[n]), n, dna, dnb, p);\n }\n\n /*-\n * t[32] holds (a[0]-a[1])*(b[1]-b[0]), c1 is the sign\n * r[10] holds (a[0]*b[0])\n * r[32] holds (b[1]*b[1])\n */\n\n c1 = (int)(bn_add_words(t, r, &(r[n2]), n2));\n\n if (neg) { /* if t[32] is negative */\n c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2));\n } else {\n /* Might have a carry */\n c1 += (int)(bn_add_words(&(t[n2]), &(t[n2]), t, n2));\n }\n\n /*-\n * t[32] holds (a[0]-a[1])*(b[1]-b[0])+(a[0]*b[0])+(a[1]*b[1])\n * r[10] holds (a[0]*b[0])\n * r[32] holds (b[1]*b[1])\n * c1 holds the carry bits\n */\n c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2));\n if (c1) {\n p = &(r[n + n2]);\n lo = *p;\n ln = (lo + c1) & BN_MASK2;\n *p = ln;\n\n /*\n * The overflow will stop before we over write words we should not\n * overwrite\n */\n if (ln < (BN_ULONG)c1) {\n do {\n p++;\n lo = *p;\n ln = (lo + 1) & BN_MASK2;\n *p = ln;\n } while (ln == 0);\n }\n }\n}\n\n/*\n * n+tn is the word length t needs to be n*4 is size, as does r\n */\n/* tnX may not be negative but less than n */\nvoid bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,\n int tna, int tnb, BN_ULONG *t)\n{\n int i, j, n2 = n * 2;\n int c1, c2, neg;\n BN_ULONG ln, lo, *p;\n\n if (n < 8) {\n bn_mul_normal(r, a, n + tna, b, n + tnb);\n return;\n }\n\n /* r=(a[0]-a[1])*(b[1]-b[0]) */\n c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);\n c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);\n neg = 0;\n switch (c1 * 3 + c2) {\n case -4:\n bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */\n bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */\n break;\n case -3:\n case -2:\n bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */\n bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n); /* + */\n neg = 1;\n break;\n case -1:\n case 0:\n case 1:\n case 2:\n bn_sub_part_words(t, a, &(a[n]), tna, n - tna); /* + */\n bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */\n neg = 1;\n break;\n case 3:\n case 4:\n bn_sub_part_words(t, a, &(a[n]), tna, n - tna);\n bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n);\n break;\n }\n /*\n * The zero case isn't yet implemented here. The speedup would probably\n * be negligible.\n */\n# if 0\n if (n == 4) {\n bn_mul_comba4(&(t[n2]), t, &(t[n]));\n bn_mul_comba4(r, a, b);\n bn_mul_normal(&(r[n2]), &(a[n]), tn, &(b[n]), tn);\n memset(&r[n2 + tn * 2], 0, sizeof(*r) * (n2 - tn * 2));\n } else\n# endif\n if (n == 8) {\n bn_mul_comba8(&(t[n2]), t, &(t[n]));\n bn_mul_comba8(r, a, b);\n bn_mul_normal(&(r[n2]), &(a[n]), tna, &(b[n]), tnb);\n memset(&r[n2 + tna + tnb], 0, sizeof(*r) * (n2 - tna - tnb));\n } else {\n p = &(t[n2 * 2]);\n bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);\n bn_mul_recursive(r, a, b, n, 0, 0, p);\n i = n / 2;\n /*\n * If there is only a bottom half to the number, just do it\n */\n if (tna > tnb)\n j = tna - i;\n else\n j = tnb - i;\n if (j == 0) {\n bn_mul_recursive(&(r[n2]), &(a[n]), &(b[n]),\n i, tna - i, tnb - i, p);\n memset(&r[n2 + i * 2], 0, sizeof(*r) * (n2 - i * 2));\n } else if (j > 0) { /* eg, n == 16, i == 8 and tn == 11 */\n bn_mul_part_recursive(&(r[n2]), &(a[n]), &(b[n]),\n i, tna - i, tnb - i, p);\n memset(&(r[n2 + tna + tnb]), 0,\n sizeof(BN_ULONG) * (n2 - tna - tnb));\n } else { /* (j < 0) eg, n == 16, i == 8 and tn == 5 */\n\n memset(&r[n2], 0, sizeof(*r) * n2);\n if (tna < BN_MUL_RECURSIVE_SIZE_NORMAL\n && tnb < BN_MUL_RECURSIVE_SIZE_NORMAL) {\n bn_mul_normal(&(r[n2]), &(a[n]), tna, &(b[n]), tnb);\n } else {\n for (;;) {\n i /= 2;\n /*\n * these simplified conditions work exclusively because\n * difference between tna and tnb is 1 or 0\n */\n if (i < tna || i < tnb) {\n bn_mul_part_recursive(&(r[n2]),\n &(a[n]), &(b[n]),\n i, tna - i, tnb - i, p);\n break;\n } else if (i == tna || i == tnb) {\n bn_mul_recursive(&(r[n2]),\n &(a[n]), &(b[n]),\n i, tna - i, tnb - i, p);\n break;\n }\n }\n }\n }\n }\n\n /*-\n * t[32] holds (a[0]-a[1])*(b[1]-b[0]), c1 is the sign\n * r[10] holds (a[0]*b[0])\n * r[32] holds (b[1]*b[1])\n */\n\n c1 = (int)(bn_add_words(t, r, &(r[n2]), n2));\n\n if (neg) { /* if t[32] is negative */\n c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2));\n } else {\n /* Might have a carry */\n c1 += (int)(bn_add_words(&(t[n2]), &(t[n2]), t, n2));\n }\n\n /*-\n * t[32] holds (a[0]-a[1])*(b[1]-b[0])+(a[0]*b[0])+(a[1]*b[1])\n * r[10] holds (a[0]*b[0])\n * r[32] holds (b[1]*b[1])\n * c1 holds the carry bits\n */\n c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2));\n if (c1) {\n p = &(r[n + n2]);\n lo = *p;\n ln = (lo + c1) & BN_MASK2;\n *p = ln;\n\n /*\n * The overflow will stop before we over write words we should not\n * overwrite\n */\n if (ln < (BN_ULONG)c1) {\n do {\n p++;\n lo = *p;\n ln = (lo + 1) & BN_MASK2;\n *p = ln;\n } while (ln == 0);\n }\n }\n}\n\n/*-\n * a and b must be the same size, which is n2.\n * r needs to be n2 words and t needs to be n2*2\n */\nvoid bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,\n BN_ULONG *t)\n{\n int n = n2 / 2;\n\n bn_mul_recursive(r, a, b, n, 0, 0, &(t[0]));\n if (n >= BN_MUL_LOW_RECURSIVE_SIZE_NORMAL) {\n bn_mul_low_recursive(&(t[0]), &(a[0]), &(b[n]), n, &(t[n2]));\n bn_add_words(&(r[n]), &(r[n]), &(t[0]), n);\n bn_mul_low_recursive(&(t[0]), &(a[n]), &(b[0]), n, &(t[n2]));\n bn_add_words(&(r[n]), &(r[n]), &(t[0]), n);\n } else {\n bn_mul_low_normal(&(t[0]), &(a[0]), &(b[n]), n);\n bn_mul_low_normal(&(t[n]), &(a[n]), &(b[0]), n);\n bn_add_words(&(r[n]), &(r[n]), &(t[0]), n);\n bn_add_words(&(r[n]), &(r[n]), &(t[n]), n);\n }\n}\n#endif /* BN_RECURSION */\n\nint BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)\n{\n int ret = bn_mul_fixed_top(r, a, b, ctx);\n\n bn_correct_top(r);\n bn_check_top(r);\n\n return ret;\n}\n\nint bn_mul_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)\n{\n int ret = 0;\n int top, al, bl;\n BIGNUM *rr;\n#if defined(BN_MUL_COMBA) || defined(BN_RECURSION)\n int i;\n#endif\n#ifdef BN_RECURSION\n BIGNUM *t = NULL;\n int j = 0, k;\n#endif\n\n bn_check_top(a);\n bn_check_top(b);\n bn_check_top(r);\n\n al = a->top;\n bl = b->top;\n\n if ((al == 0) || (bl == 0)) {\n BN_zero(r);\n return 1;\n }\n top = al + bl;\n\n BN_CTX_start(ctx);\n if ((r == a) || (r == b)) {\n if ((rr = BN_CTX_get(ctx)) == NULL)\n goto err;\n } else\n rr = r;\n\n#if defined(BN_MUL_COMBA) || defined(BN_RECURSION)\n i = al - bl;\n#endif\n#ifdef BN_MUL_COMBA\n if (i == 0) {\n# if 0\n if (al == 4) {\n if (bn_wexpand(rr, 8) == NULL)\n goto err;\n rr->top = 8;\n bn_mul_comba4(rr->d, a->d, b->d);\n goto end;\n }\n# endif\n if (al == 8) {\n if (bn_wexpand(rr, 16) == NULL)\n goto err;\n rr->top = 16;\n bn_mul_comba8(rr->d, a->d, b->d);\n goto end;\n }\n }\n#endif /* BN_MUL_COMBA */\n#ifdef BN_RECURSION\n if ((al >= BN_MULL_SIZE_NORMAL) && (bl >= BN_MULL_SIZE_NORMAL)) {\n if (i >= -1 && i <= 1) {\n /*\n * Find out the power of two lower or equal to the longest of the\n * two numbers\n */\n if (i >= 0) {\n j = BN_num_bits_word((BN_ULONG)al);\n }\n if (i == -1) {\n j = BN_num_bits_word((BN_ULONG)bl);\n }\n j = 1 << (j - 1);\n assert(j <= al || j <= bl);\n k = j + j;\n t = BN_CTX_get(ctx);\n if (t == NULL)\n goto err;\n if (al > j || bl > j) {\n if (bn_wexpand(t, k * 4) == NULL)\n goto err;\n if (bn_wexpand(rr, k * 4) == NULL)\n goto err;\n bn_mul_part_recursive(rr->d, a->d, b->d,\n j, al - j, bl - j, t->d);\n } else { /* al <= j || bl <= j */\n\n if (bn_wexpand(t, k * 2) == NULL)\n goto err;\n if (bn_wexpand(rr, k * 2) == NULL)\n goto err;\n bn_mul_recursive(rr->d, a->d, b->d, j, al - j, bl - j, t->d);\n }\n rr->top = top;\n goto end;\n }\n }\n#endif /* BN_RECURSION */\n if (bn_wexpand(rr, top) == NULL)\n goto err;\n rr->top = top;\n bn_mul_normal(rr->d, a->d, al, b->d, bl);\n\n#if defined(BN_MUL_COMBA) || defined(BN_RECURSION)\n end:\n#endif\n rr->neg = a->neg ^ b->neg;\n rr->flags |= BN_FLG_FIXED_TOP;\n if (r != rr && BN_copy(r, rr) == NULL)\n goto err;\n\n ret = 1;\n err:\n bn_check_top(r);\n BN_CTX_end(ctx);\n return ret;\n}\n\nvoid bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)\n{\n BN_ULONG *rr;\n\n if (na < nb) {\n int itmp;\n BN_ULONG *ltmp;\n\n itmp = na;\n na = nb;\n nb = itmp;\n ltmp = a;\n a = b;\n b = ltmp;\n\n }\n rr = &(r[na]);\n if (nb <= 0) {\n (void)bn_mul_words(r, a, na, 0);\n return;\n } else\n rr[0] = bn_mul_words(r, a, na, b[0]);\n\n for (;;) {\n if (--nb <= 0)\n return;\n rr[1] = bn_mul_add_words(&(r[1]), a, na, b[1]);\n if (--nb <= 0)\n return;\n rr[2] = bn_mul_add_words(&(r[2]), a, na, b[2]);\n if (--nb <= 0)\n return;\n rr[3] = bn_mul_add_words(&(r[3]), a, na, b[3]);\n if (--nb <= 0)\n return;\n rr[4] = bn_mul_add_words(&(r[4]), a, na, b[4]);\n rr += 4;\n r += 4;\n b += 4;\n }\n}\n\nvoid bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)\n{\n bn_mul_words(r, a, n, b[0]);\n\n for (;;) {\n if (--n <= 0)\n return;\n bn_mul_add_words(&(r[1]), a, n, b[1]);\n if (--n <= 0)\n return;\n bn_mul_add_words(&(r[2]), a, n, b[2]);\n if (--n <= 0)\n return;\n bn_mul_add_words(&(r[3]), a, n, b[3]);\n if (--n <= 0)\n return;\n bn_mul_add_words(&(r[4]), a, n, b[4]);\n r += 4;\n b += 4;\n }\n}\n" }, { "path": "cryptomini/bn/bn_nist.c", "content": "/*\n * Copyright 2002-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \"bn_local.h\"\n#include \"internal/cryptlib.h\"\n\n#define BN_NIST_192_TOP (192+BN_BITS2-1)/BN_BITS2\n#define BN_NIST_224_TOP (224+BN_BITS2-1)/BN_BITS2\n#define BN_NIST_256_TOP (256+BN_BITS2-1)/BN_BITS2\n#define BN_NIST_384_TOP (384+BN_BITS2-1)/BN_BITS2\n#define BN_NIST_521_TOP (521+BN_BITS2-1)/BN_BITS2\n\n/* pre-computed tables are \"carry-less\" values of modulus*(i+1) */\n#if BN_BITS2 == 64\nstatic const BN_ULONG _nist_p_192[][BN_NIST_192_TOP] = {\n {0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFEULL, 0xFFFFFFFFFFFFFFFFULL},\n {0xFFFFFFFFFFFFFFFEULL, 0xFFFFFFFFFFFFFFFDULL, 0xFFFFFFFFFFFFFFFFULL},\n {0xFFFFFFFFFFFFFFFDULL, 0xFFFFFFFFFFFFFFFCULL, 0xFFFFFFFFFFFFFFFFULL}\n};\n\nstatic const BN_ULONG _nist_p_192_sqr[] = {\n 0x0000000000000001ULL, 0x0000000000000002ULL, 0x0000000000000001ULL,\n 0xFFFFFFFFFFFFFFFEULL, 0xFFFFFFFFFFFFFFFDULL, 0xFFFFFFFFFFFFFFFFULL\n};\n\nstatic const BN_ULONG _nist_p_224[][BN_NIST_224_TOP] = {\n {0x0000000000000001ULL, 0xFFFFFFFF00000000ULL,\n 0xFFFFFFFFFFFFFFFFULL, 0x00000000FFFFFFFFULL},\n {0x0000000000000002ULL, 0xFFFFFFFE00000000ULL,\n 0xFFFFFFFFFFFFFFFFULL, 0x00000001FFFFFFFFULL} /* this one is\n * \"carry-full\" */\n};\n\nstatic const BN_ULONG _nist_p_224_sqr[] = {\n 0x0000000000000001ULL, 0xFFFFFFFE00000000ULL,\n 0xFFFFFFFFFFFFFFFFULL, 0x0000000200000000ULL,\n 0x0000000000000000ULL, 0xFFFFFFFFFFFFFFFEULL,\n 0xFFFFFFFFFFFFFFFFULL\n};\n\nstatic const BN_ULONG _nist_p_256[][BN_NIST_256_TOP] = {\n {0xFFFFFFFFFFFFFFFFULL, 0x00000000FFFFFFFFULL,\n 0x0000000000000000ULL, 0xFFFFFFFF00000001ULL},\n {0xFFFFFFFFFFFFFFFEULL, 0x00000001FFFFFFFFULL,\n 0x0000000000000000ULL, 0xFFFFFFFE00000002ULL},\n {0xFFFFFFFFFFFFFFFDULL, 0x00000002FFFFFFFFULL,\n 0x0000000000000000ULL, 0xFFFFFFFD00000003ULL},\n {0xFFFFFFFFFFFFFFFCULL, 0x00000003FFFFFFFFULL,\n 0x0000000000000000ULL, 0xFFFFFFFC00000004ULL},\n {0xFFFFFFFFFFFFFFFBULL, 0x00000004FFFFFFFFULL,\n 0x0000000000000000ULL, 0xFFFFFFFB00000005ULL},\n};\n\nstatic const BN_ULONG _nist_p_256_sqr[] = {\n 0x0000000000000001ULL, 0xFFFFFFFE00000000ULL,\n 0xFFFFFFFFFFFFFFFFULL, 0x00000001FFFFFFFEULL,\n 0x00000001FFFFFFFEULL, 0x00000001FFFFFFFEULL,\n 0xFFFFFFFE00000001ULL, 0xFFFFFFFE00000002ULL\n};\n\nstatic const BN_ULONG _nist_p_384[][BN_NIST_384_TOP] = {\n {0x00000000FFFFFFFFULL, 0xFFFFFFFF00000000ULL, 0xFFFFFFFFFFFFFFFEULL,\n 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL},\n {0x00000001FFFFFFFEULL, 0xFFFFFFFE00000000ULL, 0xFFFFFFFFFFFFFFFDULL,\n 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL},\n {0x00000002FFFFFFFDULL, 0xFFFFFFFD00000000ULL, 0xFFFFFFFFFFFFFFFCULL,\n 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL},\n {0x00000003FFFFFFFCULL, 0xFFFFFFFC00000000ULL, 0xFFFFFFFFFFFFFFFBULL,\n 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL},\n {0x00000004FFFFFFFBULL, 0xFFFFFFFB00000000ULL, 0xFFFFFFFFFFFFFFFAULL,\n 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL},\n};\n\nstatic const BN_ULONG _nist_p_384_sqr[] = {\n 0xFFFFFFFE00000001ULL, 0x0000000200000000ULL, 0xFFFFFFFE00000000ULL,\n 0x0000000200000000ULL, 0x0000000000000001ULL, 0x0000000000000000ULL,\n 0x00000001FFFFFFFEULL, 0xFFFFFFFE00000000ULL, 0xFFFFFFFFFFFFFFFDULL,\n 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL\n};\n\nstatic const BN_ULONG _nist_p_521[] =\n { 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL,\n 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL,\n 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL,\n 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL,\n 0x00000000000001FFULL\n};\n\nstatic const BN_ULONG _nist_p_521_sqr[] = {\n 0x0000000000000001ULL, 0x0000000000000000ULL, 0x0000000000000000ULL,\n 0x0000000000000000ULL, 0x0000000000000000ULL, 0x0000000000000000ULL,\n 0x0000000000000000ULL, 0x0000000000000000ULL, 0xFFFFFFFFFFFFFC00ULL,\n 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL,\n 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL, 0xFFFFFFFFFFFFFFFFULL,\n 0xFFFFFFFFFFFFFFFFULL, 0x000000000003FFFFULL\n};\n#elif BN_BITS2 == 32\nstatic const BN_ULONG _nist_p_192[][BN_NIST_192_TOP] = {\n {0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFE, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF},\n {0xFFFFFFFE, 0xFFFFFFFF, 0xFFFFFFFD, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF},\n {0xFFFFFFFD, 0xFFFFFFFF, 0xFFFFFFFC, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF}\n};\n\nstatic const BN_ULONG _nist_p_192_sqr[] = {\n 0x00000001, 0x00000000, 0x00000002, 0x00000000, 0x00000001, 0x00000000,\n 0xFFFFFFFE, 0xFFFFFFFF, 0xFFFFFFFD, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF\n};\n\nstatic const BN_ULONG _nist_p_224[][BN_NIST_224_TOP] = {\n {0x00000001, 0x00000000, 0x00000000, 0xFFFFFFFF,\n 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF},\n {0x00000002, 0x00000000, 0x00000000, 0xFFFFFFFE,\n 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF}\n};\n\nstatic const BN_ULONG _nist_p_224_sqr[] = {\n 0x00000001, 0x00000000, 0x00000000, 0xFFFFFFFE,\n 0xFFFFFFFF, 0xFFFFFFFF, 0x00000000, 0x00000002,\n 0x00000000, 0x00000000, 0xFFFFFFFE, 0xFFFFFFFF,\n 0xFFFFFFFF, 0xFFFFFFFF\n};\n\nstatic const BN_ULONG _nist_p_256[][BN_NIST_256_TOP] = {\n {0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000000,\n 0x00000000, 0x00000000, 0x00000001, 0xFFFFFFFF},\n {0xFFFFFFFE, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000001,\n 0x00000000, 0x00000000, 0x00000002, 0xFFFFFFFE},\n {0xFFFFFFFD, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000002,\n 0x00000000, 0x00000000, 0x00000003, 0xFFFFFFFD},\n {0xFFFFFFFC, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000003,\n 0x00000000, 0x00000000, 0x00000004, 0xFFFFFFFC},\n {0xFFFFFFFB, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000004,\n 0x00000000, 0x00000000, 0x00000005, 0xFFFFFFFB},\n};\n\nstatic const BN_ULONG _nist_p_256_sqr[] = {\n 0x00000001, 0x00000000, 0x00000000, 0xFFFFFFFE,\n 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFE, 0x00000001,\n 0xFFFFFFFE, 0x00000001, 0xFFFFFFFE, 0x00000001,\n 0x00000001, 0xFFFFFFFE, 0x00000002, 0xFFFFFFFE\n};\n\nstatic const BN_ULONG _nist_p_384[][BN_NIST_384_TOP] = {\n {0xFFFFFFFF, 0x00000000, 0x00000000, 0xFFFFFFFF, 0xFFFFFFFE, 0xFFFFFFFF,\n 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF},\n {0xFFFFFFFE, 0x00000001, 0x00000000, 0xFFFFFFFE, 0xFFFFFFFD, 0xFFFFFFFF,\n 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF},\n {0xFFFFFFFD, 0x00000002, 0x00000000, 0xFFFFFFFD, 0xFFFFFFFC, 0xFFFFFFFF,\n 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF},\n {0xFFFFFFFC, 0x00000003, 0x00000000, 0xFFFFFFFC, 0xFFFFFFFB, 0xFFFFFFFF,\n 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF},\n {0xFFFFFFFB, 0x00000004, 0x00000000, 0xFFFFFFFB, 0xFFFFFFFA, 0xFFFFFFFF,\n 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF},\n};\n\nstatic const BN_ULONG _nist_p_384_sqr[] = {\n 0x00000001, 0xFFFFFFFE, 0x00000000, 0x00000002, 0x00000000, 0xFFFFFFFE,\n 0x00000000, 0x00000002, 0x00000001, 0x00000000, 0x00000000, 0x00000000,\n 0xFFFFFFFE, 0x00000001, 0x00000000, 0xFFFFFFFE, 0xFFFFFFFD, 0xFFFFFFFF,\n 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF\n};\n\nstatic const BN_ULONG _nist_p_521[] = { 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF,\n 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF,\n 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF,\n 0xFFFFFFFF, 0x000001FF\n};\n\nstatic const BN_ULONG _nist_p_521_sqr[] = {\n 0x00000001, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,\n 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,\n 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0xFFFFFC00, 0xFFFFFFFF,\n 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF,\n 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF,\n 0xFFFFFFFF, 0xFFFFFFFF, 0x0003FFFF\n};\n#else\n# error \"unsupported BN_BITS2\"\n#endif\n\nstatic const BIGNUM _bignum_nist_p_192 = {\n (BN_ULONG *)_nist_p_192[0],\n BN_NIST_192_TOP,\n BN_NIST_192_TOP,\n 0,\n BN_FLG_STATIC_DATA\n};\n\nstatic const BIGNUM _bignum_nist_p_224 = {\n (BN_ULONG *)_nist_p_224[0],\n BN_NIST_224_TOP,\n BN_NIST_224_TOP,\n 0,\n BN_FLG_STATIC_DATA\n};\n\nstatic const BIGNUM _bignum_nist_p_256 = {\n (BN_ULONG *)_nist_p_256[0],\n BN_NIST_256_TOP,\n BN_NIST_256_TOP,\n 0,\n BN_FLG_STATIC_DATA\n};\n\nstatic const BIGNUM _bignum_nist_p_384 = {\n (BN_ULONG *)_nist_p_384[0],\n BN_NIST_384_TOP,\n BN_NIST_384_TOP,\n 0,\n BN_FLG_STATIC_DATA\n};\n\nstatic const BIGNUM _bignum_nist_p_521 = {\n (BN_ULONG *)_nist_p_521,\n BN_NIST_521_TOP,\n BN_NIST_521_TOP,\n 0,\n BN_FLG_STATIC_DATA\n};\n\nconst BIGNUM *BN_get0_nist_prime_192(void)\n{\n return &_bignum_nist_p_192;\n}\n\nconst BIGNUM *BN_get0_nist_prime_224(void)\n{\n return &_bignum_nist_p_224;\n}\n\nconst BIGNUM *BN_get0_nist_prime_256(void)\n{\n return &_bignum_nist_p_256;\n}\n\nconst BIGNUM *BN_get0_nist_prime_384(void)\n{\n return &_bignum_nist_p_384;\n}\n\nconst BIGNUM *BN_get0_nist_prime_521(void)\n{\n return &_bignum_nist_p_521;\n}\n\nstatic void nist_cp_bn_0(BN_ULONG *dst, const BN_ULONG *src, int top, int max)\n{\n int i;\n\n#ifdef BN_DEBUG\n (void)ossl_assert(top <= max);\n#endif\n for (i = 0; i < top; i++)\n dst[i] = src[i];\n for (; i < max; i++)\n dst[i] = 0;\n}\n\nstatic void nist_cp_bn(BN_ULONG *dst, const BN_ULONG *src, int top)\n{\n int i;\n\n for (i = 0; i < top; i++)\n dst[i] = src[i];\n}\n\n#if BN_BITS2 == 64\n# define bn_cp_64(to, n, from, m) (to)[n] = (m>=0)?((from)[m]):0;\n# define bn_64_set_0(to, n) (to)[n] = (BN_ULONG)0;\n/*\n * two following macros are implemented under assumption that they\n * are called in a sequence with *ascending* n, i.e. as they are...\n */\n# define bn_cp_32_naked(to, n, from, m) (((n)&1)?(to[(n)/2]|=((m)&1)?(from[(m)/2]&BN_MASK2h):(from[(m)/2]<<32))\\\n :(to[(n)/2] =((m)&1)?(from[(m)/2]>>32):(from[(m)/2]&BN_MASK2l)))\n# define bn_32_set_0(to, n) (((n)&1)?(to[(n)/2]&=BN_MASK2l):(to[(n)/2]=0));\n# define bn_cp_32(to,n,from,m) ((m)>=0)?bn_cp_32_naked(to,n,from,m):bn_32_set_0(to,n)\n# if defined(L_ENDIAN)\n# if defined(__arch64__)\n# define NIST_INT64 long\n# else\n# define NIST_INT64 long long\n# endif\n# endif\n#else\n# define bn_cp_64(to, n, from, m) \\\n { \\\n bn_cp_32(to, (n)*2, from, (m)*2); \\\n bn_cp_32(to, (n)*2+1, from, (m)*2+1); \\\n }\n# define bn_64_set_0(to, n) \\\n { \\\n bn_32_set_0(to, (n)*2); \\\n bn_32_set_0(to, (n)*2+1); \\\n }\n# define bn_cp_32(to, n, from, m) (to)[n] = (m>=0)?((from)[m]):0;\n# define bn_32_set_0(to, n) (to)[n] = (BN_ULONG)0;\n# if defined(_WIN32) && !defined(__GNUC__)\n# define NIST_INT64 __int64\n# elif defined(BN_LLONG)\n# define NIST_INT64 long long\n# endif\n#endif /* BN_BITS2 != 64 */\n\n#define nist_set_192(to, from, a1, a2, a3) \\\n { \\\n bn_cp_64(to, 0, from, (a3) - 3) \\\n bn_cp_64(to, 1, from, (a2) - 3) \\\n bn_cp_64(to, 2, from, (a1) - 3) \\\n }\n\nint BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,\n BN_CTX *ctx)\n{\n int top = a->top, i;\n int carry;\n register BN_ULONG *r_d, *a_d = a->d;\n union {\n BN_ULONG bn[BN_NIST_192_TOP];\n unsigned int ui[BN_NIST_192_TOP * sizeof(BN_ULONG) /\n sizeof(unsigned int)];\n } buf;\n BN_ULONG c_d[BN_NIST_192_TOP], *res;\n PTR_SIZE_INT mask;\n static const BIGNUM _bignum_nist_p_192_sqr = {\n (BN_ULONG *)_nist_p_192_sqr,\n OSSL_NELEM(_nist_p_192_sqr),\n OSSL_NELEM(_nist_p_192_sqr),\n 0, BN_FLG_STATIC_DATA\n };\n\n field = &_bignum_nist_p_192; /* just to make sure */\n\n if (BN_is_negative(a) || BN_ucmp(a, &_bignum_nist_p_192_sqr) >= 0)\n return BN_nnmod(r, a, field, ctx);\n\n i = BN_ucmp(field, a);\n if (i == 0) {\n BN_zero(r);\n return 1;\n } else if (i > 0)\n return (r == a) ? 1 : (BN_copy(r, a) != NULL);\n\n if (r != a) {\n if (!bn_wexpand(r, BN_NIST_192_TOP))\n return 0;\n r_d = r->d;\n nist_cp_bn(r_d, a_d, BN_NIST_192_TOP);\n } else\n r_d = a_d;\n\n nist_cp_bn_0(buf.bn, a_d + BN_NIST_192_TOP, top - BN_NIST_192_TOP,\n BN_NIST_192_TOP);\n\n#if defined(NIST_INT64)\n {\n NIST_INT64 acc; /* accumulator */\n unsigned int *rp = (unsigned int *)r_d;\n const unsigned int *bp = (const unsigned int *)buf.ui;\n\n acc = rp[0];\n acc += bp[3 * 2 - 6];\n acc += bp[5 * 2 - 6];\n rp[0] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[1];\n acc += bp[3 * 2 - 5];\n acc += bp[5 * 2 - 5];\n rp[1] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[2];\n acc += bp[3 * 2 - 6];\n acc += bp[4 * 2 - 6];\n acc += bp[5 * 2 - 6];\n rp[2] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[3];\n acc += bp[3 * 2 - 5];\n acc += bp[4 * 2 - 5];\n acc += bp[5 * 2 - 5];\n rp[3] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[4];\n acc += bp[4 * 2 - 6];\n acc += bp[5 * 2 - 6];\n rp[4] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[5];\n acc += bp[4 * 2 - 5];\n acc += bp[5 * 2 - 5];\n rp[5] = (unsigned int)acc;\n\n carry = (int)(acc >> 32);\n }\n#else\n {\n BN_ULONG t_d[BN_NIST_192_TOP];\n\n nist_set_192(t_d, buf.bn, 0, 3, 3);\n carry = (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP);\n nist_set_192(t_d, buf.bn, 4, 4, 0);\n carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP);\n nist_set_192(t_d, buf.bn, 5, 5, 5)\n carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP);\n }\n#endif\n if (carry > 0)\n carry =\n (int)bn_sub_words(r_d, r_d, _nist_p_192[carry - 1],\n BN_NIST_192_TOP);\n else\n carry = 1;\n\n /*\n * we need 'if (carry==0 || result>=modulus) result-=modulus;'\n * as comparison implies subtraction, we can write\n * 'tmp=result-modulus; if (!carry || !borrow) result=tmp;'\n * this is what happens below, but without explicit if:-) a.\n */\n mask =\n 0 - (PTR_SIZE_INT) bn_sub_words(c_d, r_d, _nist_p_192[0],\n BN_NIST_192_TOP);\n mask &= 0 - (PTR_SIZE_INT) carry;\n res = c_d;\n res = (BN_ULONG *)\n (((PTR_SIZE_INT) res & ~mask) | ((PTR_SIZE_INT) r_d & mask));\n nist_cp_bn(r_d, res, BN_NIST_192_TOP);\n r->top = BN_NIST_192_TOP;\n bn_correct_top(r);\n\n return 1;\n}\n\ntypedef BN_ULONG (*bn_addsub_f) (BN_ULONG *, const BN_ULONG *,\n const BN_ULONG *, int);\n\n#define nist_set_224(to, from, a1, a2, a3, a4, a5, a6, a7) \\\n { \\\n bn_cp_32(to, 0, from, (a7) - 7) \\\n bn_cp_32(to, 1, from, (a6) - 7) \\\n bn_cp_32(to, 2, from, (a5) - 7) \\\n bn_cp_32(to, 3, from, (a4) - 7) \\\n bn_cp_32(to, 4, from, (a3) - 7) \\\n bn_cp_32(to, 5, from, (a2) - 7) \\\n bn_cp_32(to, 6, from, (a1) - 7) \\\n }\n\nint BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,\n BN_CTX *ctx)\n{\n int top = a->top, i;\n int carry;\n BN_ULONG *r_d, *a_d = a->d;\n union {\n BN_ULONG bn[BN_NIST_224_TOP];\n unsigned int ui[BN_NIST_224_TOP * sizeof(BN_ULONG) /\n sizeof(unsigned int)];\n } buf;\n BN_ULONG c_d[BN_NIST_224_TOP], *res;\n PTR_SIZE_INT mask;\n union {\n bn_addsub_f f;\n PTR_SIZE_INT p;\n } u;\n static const BIGNUM _bignum_nist_p_224_sqr = {\n (BN_ULONG *)_nist_p_224_sqr,\n OSSL_NELEM(_nist_p_224_sqr),\n OSSL_NELEM(_nist_p_224_sqr),\n 0, BN_FLG_STATIC_DATA\n };\n\n field = &_bignum_nist_p_224; /* just to make sure */\n\n if (BN_is_negative(a) || BN_ucmp(a, &_bignum_nist_p_224_sqr) >= 0)\n return BN_nnmod(r, a, field, ctx);\n\n i = BN_ucmp(field, a);\n if (i == 0) {\n BN_zero(r);\n return 1;\n } else if (i > 0)\n return (r == a) ? 1 : (BN_copy(r, a) != NULL);\n\n if (r != a) {\n if (!bn_wexpand(r, BN_NIST_224_TOP))\n return 0;\n r_d = r->d;\n nist_cp_bn(r_d, a_d, BN_NIST_224_TOP);\n } else\n r_d = a_d;\n\n#if BN_BITS2==64\n /* copy upper 256 bits of 448 bit number ... */\n nist_cp_bn_0(c_d, a_d + (BN_NIST_224_TOP - 1),\n top - (BN_NIST_224_TOP - 1), BN_NIST_224_TOP);\n /* ... and right shift by 32 to obtain upper 224 bits */\n nist_set_224(buf.bn, c_d, 14, 13, 12, 11, 10, 9, 8);\n /* truncate lower part to 224 bits too */\n r_d[BN_NIST_224_TOP - 1] &= BN_MASK2l;\n#else\n nist_cp_bn_0(buf.bn, a_d + BN_NIST_224_TOP, top - BN_NIST_224_TOP,\n BN_NIST_224_TOP);\n#endif\n\n#if defined(NIST_INT64) && BN_BITS2!=64\n {\n NIST_INT64 acc; /* accumulator */\n unsigned int *rp = (unsigned int *)r_d;\n const unsigned int *bp = (const unsigned int *)buf.ui;\n\n acc = rp[0];\n acc -= bp[7 - 7];\n acc -= bp[11 - 7];\n rp[0] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[1];\n acc -= bp[8 - 7];\n acc -= bp[12 - 7];\n rp[1] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[2];\n acc -= bp[9 - 7];\n acc -= bp[13 - 7];\n rp[2] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[3];\n acc += bp[7 - 7];\n acc += bp[11 - 7];\n acc -= bp[10 - 7];\n rp[3] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[4];\n acc += bp[8 - 7];\n acc += bp[12 - 7];\n acc -= bp[11 - 7];\n rp[4] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[5];\n acc += bp[9 - 7];\n acc += bp[13 - 7];\n acc -= bp[12 - 7];\n rp[5] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[6];\n acc += bp[10 - 7];\n acc -= bp[13 - 7];\n rp[6] = (unsigned int)acc;\n\n carry = (int)(acc >> 32);\n# if BN_BITS2==64\n rp[7] = carry;\n# endif\n }\n#else\n {\n BN_ULONG t_d[BN_NIST_224_TOP];\n\n nist_set_224(t_d, buf.bn, 10, 9, 8, 7, 0, 0, 0);\n carry = (int)bn_add_words(r_d, r_d, t_d, BN_NIST_224_TOP);\n nist_set_224(t_d, buf.bn, 0, 13, 12, 11, 0, 0, 0);\n carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_224_TOP);\n nist_set_224(t_d, buf.bn, 13, 12, 11, 10, 9, 8, 7);\n carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_224_TOP);\n nist_set_224(t_d, buf.bn, 0, 0, 0, 0, 13, 12, 11);\n carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_224_TOP);\n\n# if BN_BITS2==64\n carry = (int)(r_d[BN_NIST_224_TOP - 1] >> 32);\n# endif\n }\n#endif\n u.f = bn_sub_words;\n if (carry > 0) {\n carry =\n (int)bn_sub_words(r_d, r_d, _nist_p_224[carry - 1],\n BN_NIST_224_TOP);\n#if BN_BITS2==64\n carry = (int)(~(r_d[BN_NIST_224_TOP - 1] >> 32)) & 1;\n#endif\n } else if (carry < 0) {\n /*\n * it's a bit more complicated logic in this case. if bn_add_words\n * yields no carry, then result has to be adjusted by unconditionally\n * *adding* the modulus. but if it does, then result has to be\n * compared to the modulus and conditionally adjusted by\n * *subtracting* the latter.\n */\n carry =\n (int)bn_add_words(r_d, r_d, _nist_p_224[-carry - 1],\n BN_NIST_224_TOP);\n mask = 0 - (PTR_SIZE_INT) carry;\n u.p = ((PTR_SIZE_INT) bn_sub_words & mask) |\n ((PTR_SIZE_INT) bn_add_words & ~mask);\n } else\n carry = 1;\n\n /* otherwise it's effectively same as in BN_nist_mod_192... */\n mask =\n 0 - (PTR_SIZE_INT) (*u.f) (c_d, r_d, _nist_p_224[0], BN_NIST_224_TOP);\n mask &= 0 - (PTR_SIZE_INT) carry;\n res = c_d;\n res = (BN_ULONG *)(((PTR_SIZE_INT) res & ~mask) |\n ((PTR_SIZE_INT) r_d & mask));\n nist_cp_bn(r_d, res, BN_NIST_224_TOP);\n r->top = BN_NIST_224_TOP;\n bn_correct_top(r);\n\n return 1;\n}\n\n#define nist_set_256(to, from, a1, a2, a3, a4, a5, a6, a7, a8) \\\n { \\\n bn_cp_32(to, 0, from, (a8) - 8) \\\n bn_cp_32(to, 1, from, (a7) - 8) \\\n bn_cp_32(to, 2, from, (a6) - 8) \\\n bn_cp_32(to, 3, from, (a5) - 8) \\\n bn_cp_32(to, 4, from, (a4) - 8) \\\n bn_cp_32(to, 5, from, (a3) - 8) \\\n bn_cp_32(to, 6, from, (a2) - 8) \\\n bn_cp_32(to, 7, from, (a1) - 8) \\\n }\n\nint BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,\n BN_CTX *ctx)\n{\n int i, top = a->top;\n int carry = 0;\n register BN_ULONG *a_d = a->d, *r_d;\n union {\n BN_ULONG bn[BN_NIST_256_TOP];\n unsigned int ui[BN_NIST_256_TOP * sizeof(BN_ULONG) /\n sizeof(unsigned int)];\n } buf;\n BN_ULONG c_d[BN_NIST_256_TOP], *res;\n PTR_SIZE_INT mask;\n union {\n bn_addsub_f f;\n PTR_SIZE_INT p;\n } u;\n static const BIGNUM _bignum_nist_p_256_sqr = {\n (BN_ULONG *)_nist_p_256_sqr,\n OSSL_NELEM(_nist_p_256_sqr),\n OSSL_NELEM(_nist_p_256_sqr),\n 0, BN_FLG_STATIC_DATA\n };\n\n field = &_bignum_nist_p_256; /* just to make sure */\n\n if (BN_is_negative(a) || BN_ucmp(a, &_bignum_nist_p_256_sqr) >= 0)\n return BN_nnmod(r, a, field, ctx);\n\n i = BN_ucmp(field, a);\n if (i == 0) {\n BN_zero(r);\n return 1;\n } else if (i > 0)\n return (r == a) ? 1 : (BN_copy(r, a) != NULL);\n\n if (r != a) {\n if (!bn_wexpand(r, BN_NIST_256_TOP))\n return 0;\n r_d = r->d;\n nist_cp_bn(r_d, a_d, BN_NIST_256_TOP);\n } else\n r_d = a_d;\n\n nist_cp_bn_0(buf.bn, a_d + BN_NIST_256_TOP, top - BN_NIST_256_TOP,\n BN_NIST_256_TOP);\n\n#if defined(NIST_INT64)\n {\n NIST_INT64 acc; /* accumulator */\n unsigned int *rp = (unsigned int *)r_d;\n const unsigned int *bp = (const unsigned int *)buf.ui;\n\n acc = rp[0];\n acc += bp[8 - 8];\n acc += bp[9 - 8];\n acc -= bp[11 - 8];\n acc -= bp[12 - 8];\n acc -= bp[13 - 8];\n acc -= bp[14 - 8];\n rp[0] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[1];\n acc += bp[9 - 8];\n acc += bp[10 - 8];\n acc -= bp[12 - 8];\n acc -= bp[13 - 8];\n acc -= bp[14 - 8];\n acc -= bp[15 - 8];\n rp[1] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[2];\n acc += bp[10 - 8];\n acc += bp[11 - 8];\n acc -= bp[13 - 8];\n acc -= bp[14 - 8];\n acc -= bp[15 - 8];\n rp[2] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[3];\n acc += bp[11 - 8];\n acc += bp[11 - 8];\n acc += bp[12 - 8];\n acc += bp[12 - 8];\n acc += bp[13 - 8];\n acc -= bp[15 - 8];\n acc -= bp[8 - 8];\n acc -= bp[9 - 8];\n rp[3] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[4];\n acc += bp[12 - 8];\n acc += bp[12 - 8];\n acc += bp[13 - 8];\n acc += bp[13 - 8];\n acc += bp[14 - 8];\n acc -= bp[9 - 8];\n acc -= bp[10 - 8];\n rp[4] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[5];\n acc += bp[13 - 8];\n acc += bp[13 - 8];\n acc += bp[14 - 8];\n acc += bp[14 - 8];\n acc += bp[15 - 8];\n acc -= bp[10 - 8];\n acc -= bp[11 - 8];\n rp[5] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[6];\n acc += bp[14 - 8];\n acc += bp[14 - 8];\n acc += bp[15 - 8];\n acc += bp[15 - 8];\n acc += bp[14 - 8];\n acc += bp[13 - 8];\n acc -= bp[8 - 8];\n acc -= bp[9 - 8];\n rp[6] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[7];\n acc += bp[15 - 8];\n acc += bp[15 - 8];\n acc += bp[15 - 8];\n acc += bp[8 - 8];\n acc -= bp[10 - 8];\n acc -= bp[11 - 8];\n acc -= bp[12 - 8];\n acc -= bp[13 - 8];\n rp[7] = (unsigned int)acc;\n\n carry = (int)(acc >> 32);\n }\n#else\n {\n BN_ULONG t_d[BN_NIST_256_TOP];\n\n /*\n * S1\n */\n nist_set_256(t_d, buf.bn, 15, 14, 13, 12, 11, 0, 0, 0);\n /*\n * S2\n */\n nist_set_256(c_d, buf.bn, 0, 15, 14, 13, 12, 0, 0, 0);\n carry = (int)bn_add_words(t_d, t_d, c_d, BN_NIST_256_TOP);\n /* left shift */\n {\n register BN_ULONG *ap, t, c;\n ap = t_d;\n c = 0;\n for (i = BN_NIST_256_TOP; i != 0; --i) {\n t = *ap;\n *(ap++) = ((t << 1) | c) & BN_MASK2;\n c = (t & BN_TBIT) ? 1 : 0;\n }\n carry <<= 1;\n carry |= c;\n }\n carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_256_TOP);\n /*\n * S3\n */\n nist_set_256(t_d, buf.bn, 15, 14, 0, 0, 0, 10, 9, 8);\n carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_256_TOP);\n /*\n * S4\n */\n nist_set_256(t_d, buf.bn, 8, 13, 15, 14, 13, 11, 10, 9);\n carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_256_TOP);\n /*\n * D1\n */\n nist_set_256(t_d, buf.bn, 10, 8, 0, 0, 0, 13, 12, 11);\n carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP);\n /*\n * D2\n */\n nist_set_256(t_d, buf.bn, 11, 9, 0, 0, 15, 14, 13, 12);\n carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP);\n /*\n * D3\n */\n nist_set_256(t_d, buf.bn, 12, 0, 10, 9, 8, 15, 14, 13);\n carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP);\n /*\n * D4\n */\n nist_set_256(t_d, buf.bn, 13, 0, 11, 10, 9, 0, 15, 14);\n carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP);\n\n }\n#endif\n /* see BN_nist_mod_224 for explanation */\n u.f = bn_sub_words;\n if (carry > 0)\n carry =\n (int)bn_sub_words(r_d, r_d, _nist_p_256[carry - 1],\n BN_NIST_256_TOP);\n else if (carry < 0) {\n carry =\n (int)bn_add_words(r_d, r_d, _nist_p_256[-carry - 1],\n BN_NIST_256_TOP);\n mask = 0 - (PTR_SIZE_INT) carry;\n u.p = ((PTR_SIZE_INT) bn_sub_words & mask) |\n ((PTR_SIZE_INT) bn_add_words & ~mask);\n } else\n carry = 1;\n\n mask =\n 0 - (PTR_SIZE_INT) (*u.f) (c_d, r_d, _nist_p_256[0], BN_NIST_256_TOP);\n mask &= 0 - (PTR_SIZE_INT) carry;\n res = c_d;\n res = (BN_ULONG *)(((PTR_SIZE_INT) res & ~mask) |\n ((PTR_SIZE_INT) r_d & mask));\n nist_cp_bn(r_d, res, BN_NIST_256_TOP);\n r->top = BN_NIST_256_TOP;\n bn_correct_top(r);\n\n return 1;\n}\n\n#define nist_set_384(to,from,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12) \\\n { \\\n bn_cp_32(to, 0, from, (a12) - 12) \\\n bn_cp_32(to, 1, from, (a11) - 12) \\\n bn_cp_32(to, 2, from, (a10) - 12) \\\n bn_cp_32(to, 3, from, (a9) - 12) \\\n bn_cp_32(to, 4, from, (a8) - 12) \\\n bn_cp_32(to, 5, from, (a7) - 12) \\\n bn_cp_32(to, 6, from, (a6) - 12) \\\n bn_cp_32(to, 7, from, (a5) - 12) \\\n bn_cp_32(to, 8, from, (a4) - 12) \\\n bn_cp_32(to, 9, from, (a3) - 12) \\\n bn_cp_32(to, 10, from, (a2) - 12) \\\n bn_cp_32(to, 11, from, (a1) - 12) \\\n }\n\nint BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,\n BN_CTX *ctx)\n{\n int i, top = a->top;\n int carry = 0;\n register BN_ULONG *r_d, *a_d = a->d;\n union {\n BN_ULONG bn[BN_NIST_384_TOP];\n unsigned int ui[BN_NIST_384_TOP * sizeof(BN_ULONG) /\n sizeof(unsigned int)];\n } buf;\n BN_ULONG c_d[BN_NIST_384_TOP], *res;\n PTR_SIZE_INT mask;\n union {\n bn_addsub_f f;\n PTR_SIZE_INT p;\n } u;\n static const BIGNUM _bignum_nist_p_384_sqr = {\n (BN_ULONG *)_nist_p_384_sqr,\n OSSL_NELEM(_nist_p_384_sqr),\n OSSL_NELEM(_nist_p_384_sqr),\n 0, BN_FLG_STATIC_DATA\n };\n\n field = &_bignum_nist_p_384; /* just to make sure */\n\n if (BN_is_negative(a) || BN_ucmp(a, &_bignum_nist_p_384_sqr) >= 0)\n return BN_nnmod(r, a, field, ctx);\n\n i = BN_ucmp(field, a);\n if (i == 0) {\n BN_zero(r);\n return 1;\n } else if (i > 0)\n return (r == a) ? 1 : (BN_copy(r, a) != NULL);\n\n if (r != a) {\n if (!bn_wexpand(r, BN_NIST_384_TOP))\n return 0;\n r_d = r->d;\n nist_cp_bn(r_d, a_d, BN_NIST_384_TOP);\n } else\n r_d = a_d;\n\n nist_cp_bn_0(buf.bn, a_d + BN_NIST_384_TOP, top - BN_NIST_384_TOP,\n BN_NIST_384_TOP);\n\n#if defined(NIST_INT64)\n {\n NIST_INT64 acc; /* accumulator */\n unsigned int *rp = (unsigned int *)r_d;\n const unsigned int *bp = (const unsigned int *)buf.ui;\n\n acc = rp[0];\n acc += bp[12 - 12];\n acc += bp[21 - 12];\n acc += bp[20 - 12];\n acc -= bp[23 - 12];\n rp[0] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[1];\n acc += bp[13 - 12];\n acc += bp[22 - 12];\n acc += bp[23 - 12];\n acc -= bp[12 - 12];\n acc -= bp[20 - 12];\n rp[1] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[2];\n acc += bp[14 - 12];\n acc += bp[23 - 12];\n acc -= bp[13 - 12];\n acc -= bp[21 - 12];\n rp[2] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[3];\n acc += bp[15 - 12];\n acc += bp[12 - 12];\n acc += bp[20 - 12];\n acc += bp[21 - 12];\n acc -= bp[14 - 12];\n acc -= bp[22 - 12];\n acc -= bp[23 - 12];\n rp[3] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[4];\n acc += bp[21 - 12];\n acc += bp[21 - 12];\n acc += bp[16 - 12];\n acc += bp[13 - 12];\n acc += bp[12 - 12];\n acc += bp[20 - 12];\n acc += bp[22 - 12];\n acc -= bp[15 - 12];\n acc -= bp[23 - 12];\n acc -= bp[23 - 12];\n rp[4] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[5];\n acc += bp[22 - 12];\n acc += bp[22 - 12];\n acc += bp[17 - 12];\n acc += bp[14 - 12];\n acc += bp[13 - 12];\n acc += bp[21 - 12];\n acc += bp[23 - 12];\n acc -= bp[16 - 12];\n rp[5] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[6];\n acc += bp[23 - 12];\n acc += bp[23 - 12];\n acc += bp[18 - 12];\n acc += bp[15 - 12];\n acc += bp[14 - 12];\n acc += bp[22 - 12];\n acc -= bp[17 - 12];\n rp[6] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[7];\n acc += bp[19 - 12];\n acc += bp[16 - 12];\n acc += bp[15 - 12];\n acc += bp[23 - 12];\n acc -= bp[18 - 12];\n rp[7] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[8];\n acc += bp[20 - 12];\n acc += bp[17 - 12];\n acc += bp[16 - 12];\n acc -= bp[19 - 12];\n rp[8] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[9];\n acc += bp[21 - 12];\n acc += bp[18 - 12];\n acc += bp[17 - 12];\n acc -= bp[20 - 12];\n rp[9] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[10];\n acc += bp[22 - 12];\n acc += bp[19 - 12];\n acc += bp[18 - 12];\n acc -= bp[21 - 12];\n rp[10] = (unsigned int)acc;\n acc >>= 32;\n\n acc += rp[11];\n acc += bp[23 - 12];\n acc += bp[20 - 12];\n acc += bp[19 - 12];\n acc -= bp[22 - 12];\n rp[11] = (unsigned int)acc;\n\n carry = (int)(acc >> 32);\n }\n#else\n {\n BN_ULONG t_d[BN_NIST_384_TOP];\n\n /*\n * S1\n */\n nist_set_256(t_d, buf.bn, 0, 0, 0, 0, 0, 23 - 4, 22 - 4, 21 - 4);\n /* left shift */\n {\n register BN_ULONG *ap, t, c;\n ap = t_d;\n c = 0;\n for (i = 3; i != 0; --i) {\n t = *ap;\n *(ap++) = ((t << 1) | c) & BN_MASK2;\n c = (t & BN_TBIT) ? 1 : 0;\n }\n *ap = c;\n }\n carry =\n (int)bn_add_words(r_d + (128 / BN_BITS2), r_d + (128 / BN_BITS2),\n t_d, BN_NIST_256_TOP);\n /*\n * S2\n */\n carry += (int)bn_add_words(r_d, r_d, buf.bn, BN_NIST_384_TOP);\n /*\n * S3\n */\n nist_set_384(t_d, buf.bn, 20, 19, 18, 17, 16, 15, 14, 13, 12, 23, 22,\n 21);\n carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP);\n /*\n * S4\n */\n nist_set_384(t_d, buf.bn, 19, 18, 17, 16, 15, 14, 13, 12, 20, 0, 23,\n 0);\n carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP);\n /*\n * S5\n */\n nist_set_384(t_d, buf.bn, 0, 0, 0, 0, 23, 22, 21, 20, 0, 0, 0, 0);\n carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP);\n /*\n * S6\n */\n nist_set_384(t_d, buf.bn, 0, 0, 0, 0, 0, 0, 23, 22, 21, 0, 0, 20);\n carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP);\n /*\n * D1\n */\n nist_set_384(t_d, buf.bn, 22, 21, 20, 19, 18, 17, 16, 15, 14, 13, 12,\n 23);\n carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_384_TOP);\n /*\n * D2\n */\n nist_set_384(t_d, buf.bn, 0, 0, 0, 0, 0, 0, 0, 23, 22, 21, 20, 0);\n carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_384_TOP);\n /*\n * D3\n */\n nist_set_384(t_d, buf.bn, 0, 0, 0, 0, 0, 0, 0, 23, 23, 0, 0, 0);\n carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_384_TOP);\n\n }\n#endif\n /* see BN_nist_mod_224 for explanation */\n u.f = bn_sub_words;\n if (carry > 0)\n carry =\n (int)bn_sub_words(r_d, r_d, _nist_p_384[carry - 1],\n BN_NIST_384_TOP);\n else if (carry < 0) {\n carry =\n (int)bn_add_words(r_d, r_d, _nist_p_384[-carry - 1],\n BN_NIST_384_TOP);\n mask = 0 - (PTR_SIZE_INT) carry;\n u.p = ((PTR_SIZE_INT) bn_sub_words & mask) |\n ((PTR_SIZE_INT) bn_add_words & ~mask);\n } else\n carry = 1;\n\n mask =\n 0 - (PTR_SIZE_INT) (*u.f) (c_d, r_d, _nist_p_384[0], BN_NIST_384_TOP);\n mask &= 0 - (PTR_SIZE_INT) carry;\n res = c_d;\n res = (BN_ULONG *)(((PTR_SIZE_INT) res & ~mask) |\n ((PTR_SIZE_INT) r_d & mask));\n nist_cp_bn(r_d, res, BN_NIST_384_TOP);\n r->top = BN_NIST_384_TOP;\n bn_correct_top(r);\n\n return 1;\n}\n\n#define BN_NIST_521_RSHIFT (521%BN_BITS2)\n#define BN_NIST_521_LSHIFT (BN_BITS2-BN_NIST_521_RSHIFT)\n#define BN_NIST_521_TOP_MASK ((BN_ULONG)BN_MASK2>>BN_NIST_521_LSHIFT)\n\nint BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,\n BN_CTX *ctx)\n{\n int top = a->top, i;\n BN_ULONG *r_d, *a_d = a->d, t_d[BN_NIST_521_TOP], val, tmp, *res;\n PTR_SIZE_INT mask;\n static const BIGNUM _bignum_nist_p_521_sqr = {\n (BN_ULONG *)_nist_p_521_sqr,\n OSSL_NELEM(_nist_p_521_sqr),\n OSSL_NELEM(_nist_p_521_sqr),\n 0, BN_FLG_STATIC_DATA\n };\n\n field = &_bignum_nist_p_521; /* just to make sure */\n\n if (BN_is_negative(a) || BN_ucmp(a, &_bignum_nist_p_521_sqr) >= 0)\n return BN_nnmod(r, a, field, ctx);\n\n i = BN_ucmp(field, a);\n if (i == 0) {\n BN_zero(r);\n return 1;\n } else if (i > 0)\n return (r == a) ? 1 : (BN_copy(r, a) != NULL);\n\n if (r != a) {\n if (!bn_wexpand(r, BN_NIST_521_TOP))\n return 0;\n r_d = r->d;\n nist_cp_bn(r_d, a_d, BN_NIST_521_TOP);\n } else\n r_d = a_d;\n\n /* upper 521 bits, copy ... */\n nist_cp_bn_0(t_d, a_d + (BN_NIST_521_TOP - 1),\n top - (BN_NIST_521_TOP - 1), BN_NIST_521_TOP);\n /* ... and right shift */\n for (val = t_d[0], i = 0; i < BN_NIST_521_TOP - 1; i++) {\n#if 0\n /*\n * MSC ARM compiler [version 2013, presumably even earlier,\n * much earlier] miscompiles this code, but not one in\n * #else section. See RT#3541.\n */\n tmp = val >> BN_NIST_521_RSHIFT;\n val = t_d[i + 1];\n t_d[i] = (tmp | val << BN_NIST_521_LSHIFT) & BN_MASK2;\n#else\n t_d[i] = (val >> BN_NIST_521_RSHIFT |\n (tmp = t_d[i + 1]) << BN_NIST_521_LSHIFT) & BN_MASK2;\n val = tmp;\n#endif\n }\n t_d[i] = val >> BN_NIST_521_RSHIFT;\n /* lower 521 bits */\n r_d[i] &= BN_NIST_521_TOP_MASK;\n\n bn_add_words(r_d, r_d, t_d, BN_NIST_521_TOP);\n mask =\n 0 - (PTR_SIZE_INT) bn_sub_words(t_d, r_d, _nist_p_521,\n BN_NIST_521_TOP);\n res = t_d;\n res = (BN_ULONG *)(((PTR_SIZE_INT) res & ~mask) |\n ((PTR_SIZE_INT) r_d & mask));\n nist_cp_bn(r_d, res, BN_NIST_521_TOP);\n r->top = BN_NIST_521_TOP;\n bn_correct_top(r);\n\n return 1;\n}\n\nint (*BN_nist_mod_func(const BIGNUM *p)) (BIGNUM *r, const BIGNUM *a,\n const BIGNUM *field, BN_CTX *ctx) {\n if (BN_ucmp(&_bignum_nist_p_192, p) == 0)\n return BN_nist_mod_192;\n if (BN_ucmp(&_bignum_nist_p_224, p) == 0)\n return BN_nist_mod_224;\n if (BN_ucmp(&_bignum_nist_p_256, p) == 0)\n return BN_nist_mod_256;\n if (BN_ucmp(&_bignum_nist_p_384, p) == 0)\n return BN_nist_mod_384;\n if (BN_ucmp(&_bignum_nist_p_521, p) == 0)\n return BN_nist_mod_521;\n return 0;\n}\n" }, { "path": "cryptomini/bn/bn_rand.c", "content": "/*\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \n#include \"internal/cryptlib.h\"\n#include \"bn_local.h\"\n#include \n#include \n\ntypedef enum bnrand_flag_e {\n NORMAL, TESTING, PRIVATE\n} BNRAND_FLAG;\n\nstatic int bnrand(BNRAND_FLAG flag, BIGNUM *rnd, int bits, int top, int bottom)\n{\n unsigned char *buf = NULL;\n int b, ret = 0, bit, bytes, mask;\n\n if (bits == 0) {\n if (top != BN_RAND_TOP_ANY || bottom != BN_RAND_BOTTOM_ANY)\n goto toosmall;\n BN_zero(rnd);\n return 1;\n }\n if (bits < 0 || (bits == 1 && top > 0))\n goto toosmall;\n\n bytes = (bits + 7) / 8;\n bit = (bits - 1) % 8;\n mask = 0xff << (bit + 1);\n\n buf = OPENSSL_malloc(bytes);\n if (buf == NULL) {\n BNerr(BN_F_BNRAND, ERR_R_MALLOC_FAILURE);\n goto err;\n }\n\n /* make a random number and set the top and bottom bits */\n b = flag == NORMAL ? RAND_bytes(buf, bytes) : RAND_priv_bytes(buf, bytes);\n if (b <= 0)\n goto err;\n\n if (flag == TESTING) {\n /*\n * generate patterns that are more likely to trigger BN library bugs\n */\n int i;\n unsigned char c;\n\n for (i = 0; i < bytes; i++) {\n if (RAND_bytes(&c, 1) <= 0)\n goto err;\n if (c >= 128 && i > 0)\n buf[i] = buf[i - 1];\n else if (c < 42)\n buf[i] = 0;\n else if (c < 84)\n buf[i] = 255;\n }\n }\n\n if (top >= 0) {\n if (top) {\n if (bit == 0) {\n buf[0] = 1;\n buf[1] |= 0x80;\n } else {\n buf[0] |= (3 << (bit - 1));\n }\n } else {\n buf[0] |= (1 << bit);\n }\n }\n buf[0] &= ~mask;\n if (bottom) /* set bottom bit if requested */\n buf[bytes - 1] |= 1;\n if (!BN_bin2bn(buf, bytes, rnd))\n goto err;\n ret = 1;\n err:\n OPENSSL_clear_free(buf, bytes);\n bn_check_top(rnd);\n return ret;\n\ntoosmall:\n BNerr(BN_F_BNRAND, BN_R_BITS_TOO_SMALL);\n return 0;\n}\n\nint BN_rand(BIGNUM *rnd, int bits, int top, int bottom)\n{\n return bnrand(NORMAL, rnd, bits, top, bottom);\n}\n\nint BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom)\n{\n return bnrand(TESTING, rnd, bits, top, bottom);\n}\n\nint BN_priv_rand(BIGNUM *rnd, int bits, int top, int bottom)\n{\n return bnrand(PRIVATE, rnd, bits, top, bottom);\n}\n\n/* random number r: 0 <= r < range */\nstatic int bnrand_range(BNRAND_FLAG flag, BIGNUM *r, const BIGNUM *range)\n{\n int n;\n int count = 100;\n\n if (range->neg || BN_is_zero(range)) {\n BNerr(BN_F_BNRAND_RANGE, BN_R_INVALID_RANGE);\n return 0;\n }\n\n n = BN_num_bits(range); /* n > 0 */\n\n /* BN_is_bit_set(range, n - 1) always holds */\n\n if (n == 1)\n BN_zero(r);\n else if (!BN_is_bit_set(range, n - 2) && !BN_is_bit_set(range, n - 3)) {\n /*\n * range = 100..._2, so 3*range (= 11..._2) is exactly one bit longer\n * than range\n */\n do {\n if (!bnrand(flag, r, n + 1, BN_RAND_TOP_ANY, BN_RAND_BOTTOM_ANY))\n return 0;\n\n /*\n * If r < 3*range, use r := r MOD range (which is either r, r -\n * range, or r - 2*range). Otherwise, iterate once more. Since\n * 3*range = 11..._2, each iteration succeeds with probability >=\n * .75.\n */\n if (BN_cmp(r, range) >= 0) {\n if (!BN_sub(r, r, range))\n return 0;\n if (BN_cmp(r, range) >= 0)\n if (!BN_sub(r, r, range))\n return 0;\n }\n\n if (!--count) {\n BNerr(BN_F_BNRAND_RANGE, BN_R_TOO_MANY_ITERATIONS);\n return 0;\n }\n\n }\n while (BN_cmp(r, range) >= 0);\n } else {\n do {\n /* range = 11..._2 or range = 101..._2 */\n if (!bnrand(flag, r, n, BN_RAND_TOP_ANY, BN_RAND_BOTTOM_ANY))\n return 0;\n\n if (!--count) {\n BNerr(BN_F_BNRAND_RANGE, BN_R_TOO_MANY_ITERATIONS);\n return 0;\n }\n }\n while (BN_cmp(r, range) >= 0);\n }\n\n bn_check_top(r);\n return 1;\n}\n\nint BN_rand_range(BIGNUM *r, const BIGNUM *range)\n{\n return bnrand_range(NORMAL, r, range);\n}\n\nint BN_priv_rand_range(BIGNUM *r, const BIGNUM *range)\n{\n return bnrand_range(PRIVATE, r, range);\n}\n\nint BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom)\n{\n return BN_rand(rnd, bits, top, bottom);\n}\n\nint BN_pseudo_rand_range(BIGNUM *r, const BIGNUM *range)\n{\n return BN_rand_range(r, range);\n}\n\n/*\n * BN_generate_dsa_nonce generates a random number 0 <= out < range. Unlike\n * BN_rand_range, it also includes the contents of |priv| and |message| in\n * the generation so that an RNG failure isn't fatal as long as |priv|\n * remains secret. This is intended for use in DSA and ECDSA where an RNG\n * weakness leads directly to private key exposure unless this function is\n * used.\n */\nint BN_generate_dsa_nonce(BIGNUM *out, const BIGNUM *range,\n const BIGNUM *priv, const unsigned char *message,\n size_t message_len, BN_CTX *ctx)\n{\n SHA512_CTX sha;\n /*\n * We use 512 bits of random data per iteration to ensure that we have at\n * least |range| bits of randomness.\n */\n unsigned char random_bytes[64];\n unsigned char digest[SHA512_DIGEST_LENGTH];\n unsigned done, todo;\n /* We generate |range|+8 bytes of random output. */\n const unsigned num_k_bytes = BN_num_bytes(range) + 8;\n unsigned char private_bytes[96];\n unsigned char *k_bytes;\n int ret = 0;\n\n k_bytes = OPENSSL_malloc(num_k_bytes);\n if (k_bytes == NULL)\n goto err;\n\n /* We copy |priv| into a local buffer to avoid exposing its length. */\n if (BN_bn2binpad(priv, private_bytes, sizeof(private_bytes)) < 0) {\n /*\n * No reasonable DSA or ECDSA key should have a private key this\n * large and we don't handle this case in order to avoid leaking the\n * length of the private key.\n */\n BNerr(BN_F_BN_GENERATE_DSA_NONCE, BN_R_PRIVATE_KEY_TOO_LARGE);\n goto err;\n }\n\n for (done = 0; done < num_k_bytes;) {\n if (RAND_priv_bytes(random_bytes, sizeof(random_bytes)) != 1)\n goto err;\n SHA512_Init(&sha);\n SHA512_Update(&sha, &done, sizeof(done));\n SHA512_Update(&sha, private_bytes, sizeof(private_bytes));\n SHA512_Update(&sha, message, message_len);\n SHA512_Update(&sha, random_bytes, sizeof(random_bytes));\n SHA512_Final(digest, &sha);\n\n todo = num_k_bytes - done;\n if (todo > SHA512_DIGEST_LENGTH)\n todo = SHA512_DIGEST_LENGTH;\n memcpy(k_bytes + done, digest, todo);\n done += todo;\n }\n\n if (!BN_bin2bn(k_bytes, num_k_bytes, out))\n goto err;\n if (BN_mod(out, out, range, ctx) != 1)\n goto err;\n ret = 1;\n\n err:\n OPENSSL_free(k_bytes);\n OPENSSL_cleanse(private_bytes, sizeof(private_bytes));\n return ret;\n}\n" }, { "path": "cryptomini/bn/bn_recp.c", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \"internal/cryptlib.h\"\n#include \"bn_local.h\"\n\nvoid BN_RECP_CTX_init(BN_RECP_CTX *recp)\n{\n memset(recp, 0, sizeof(*recp));\n bn_init(&(recp->N));\n bn_init(&(recp->Nr));\n}\n\nBN_RECP_CTX *BN_RECP_CTX_new(void)\n{\n BN_RECP_CTX *ret;\n\n if ((ret = OPENSSL_zalloc(sizeof(*ret))) == NULL) {\n BNerr(BN_F_BN_RECP_CTX_NEW, ERR_R_MALLOC_FAILURE);\n return NULL;\n }\n\n bn_init(&(ret->N));\n bn_init(&(ret->Nr));\n ret->flags = BN_FLG_MALLOCED;\n return ret;\n}\n\nvoid BN_RECP_CTX_free(BN_RECP_CTX *recp)\n{\n if (recp == NULL)\n return;\n BN_free(&recp->N);\n BN_free(&recp->Nr);\n if (recp->flags & BN_FLG_MALLOCED)\n OPENSSL_free(recp);\n}\n\nint BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *d, BN_CTX *ctx)\n{\n if (!BN_copy(&(recp->N), d))\n return 0;\n BN_zero(&(recp->Nr));\n recp->num_bits = BN_num_bits(d);\n recp->shift = 0;\n return 1;\n}\n\nint BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,\n BN_RECP_CTX *recp, BN_CTX *ctx)\n{\n int ret = 0;\n BIGNUM *a;\n const BIGNUM *ca;\n\n BN_CTX_start(ctx);\n if ((a = BN_CTX_get(ctx)) == NULL)\n goto err;\n if (y != NULL) {\n if (x == y) {\n if (!BN_sqr(a, x, ctx))\n goto err;\n } else {\n if (!BN_mul(a, x, y, ctx))\n goto err;\n }\n ca = a;\n } else\n ca = x; /* Just do the mod */\n\n ret = BN_div_recp(NULL, r, ca, recp, ctx);\n err:\n BN_CTX_end(ctx);\n bn_check_top(r);\n return ret;\n}\n\nint BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,\n BN_RECP_CTX *recp, BN_CTX *ctx)\n{\n int i, j, ret = 0;\n BIGNUM *a, *b, *d, *r;\n\n BN_CTX_start(ctx);\n d = (dv != NULL) ? dv : BN_CTX_get(ctx);\n r = (rem != NULL) ? rem : BN_CTX_get(ctx);\n a = BN_CTX_get(ctx);\n b = BN_CTX_get(ctx);\n if (b == NULL)\n goto err;\n\n if (BN_ucmp(m, &(recp->N)) < 0) {\n BN_zero(d);\n if (!BN_copy(r, m)) {\n BN_CTX_end(ctx);\n return 0;\n }\n BN_CTX_end(ctx);\n return 1;\n }\n\n /*\n * We want the remainder Given input of ABCDEF / ab we need multiply\n * ABCDEF by 3 digests of the reciprocal of ab\n */\n\n /* i := max(BN_num_bits(m), 2*BN_num_bits(N)) */\n i = BN_num_bits(m);\n j = recp->num_bits << 1;\n if (j > i)\n i = j;\n\n /* Nr := round(2^i / N) */\n if (i != recp->shift)\n recp->shift = BN_reciprocal(&(recp->Nr), &(recp->N), i, ctx);\n /* BN_reciprocal could have returned -1 for an error */\n if (recp->shift == -1)\n goto err;\n\n /*-\n * d := |round(round(m / 2^BN_num_bits(N)) * recp->Nr / 2^(i - BN_num_bits(N)))|\n * = |round(round(m / 2^BN_num_bits(N)) * round(2^i / N) / 2^(i - BN_num_bits(N)))|\n * <= |(m / 2^BN_num_bits(N)) * (2^i / N) * (2^BN_num_bits(N) / 2^i)|\n * = |m/N|\n */\n if (!BN_rshift(a, m, recp->num_bits))\n goto err;\n if (!BN_mul(b, a, &(recp->Nr), ctx))\n goto err;\n if (!BN_rshift(d, b, i - recp->num_bits))\n goto err;\n d->neg = 0;\n\n if (!BN_mul(b, &(recp->N), d, ctx))\n goto err;\n if (!BN_usub(r, m, b))\n goto err;\n r->neg = 0;\n\n j = 0;\n while (BN_ucmp(r, &(recp->N)) >= 0) {\n if (j++ > 2) {\n BNerr(BN_F_BN_DIV_RECP, BN_R_BAD_RECIPROCAL);\n goto err;\n }\n if (!BN_usub(r, r, &(recp->N)))\n goto err;\n if (!BN_add_word(d, 1))\n goto err;\n }\n\n r->neg = BN_is_zero(r) ? 0 : m->neg;\n d->neg = m->neg ^ recp->N.neg;\n ret = 1;\n err:\n BN_CTX_end(ctx);\n bn_check_top(dv);\n bn_check_top(rem);\n return ret;\n}\n\n/*\n * len is the expected size of the result We actually calculate with an extra\n * word of precision, so we can do faster division if the remainder is not\n * required.\n */\n/* r := 2^len / m */\nint BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx)\n{\n int ret = -1;\n BIGNUM *t;\n\n BN_CTX_start(ctx);\n if ((t = BN_CTX_get(ctx)) == NULL)\n goto err;\n\n if (!BN_set_bit(t, len))\n goto err;\n\n if (!BN_div(r, NULL, t, m, ctx))\n goto err;\n\n ret = len;\n err:\n bn_check_top(r);\n BN_CTX_end(ctx);\n return ret;\n}\n" }, { "path": "cryptomini/bn/bn_shift.c", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \"internal/cryptlib.h\"\n#include \"bn_local.h\"\n\nint BN_lshift1(BIGNUM *r, const BIGNUM *a)\n{\n register BN_ULONG *ap, *rp, t, c;\n int i;\n\n bn_check_top(r);\n bn_check_top(a);\n\n if (r != a) {\n r->neg = a->neg;\n if (bn_wexpand(r, a->top + 1) == NULL)\n return 0;\n r->top = a->top;\n } else {\n if (bn_wexpand(r, a->top + 1) == NULL)\n return 0;\n }\n ap = a->d;\n rp = r->d;\n c = 0;\n for (i = 0; i < a->top; i++) {\n t = *(ap++);\n *(rp++) = ((t << 1) | c) & BN_MASK2;\n c = t >> (BN_BITS2 - 1);\n }\n *rp = c;\n r->top += c;\n bn_check_top(r);\n return 1;\n}\n\nint BN_rshift1(BIGNUM *r, const BIGNUM *a)\n{\n BN_ULONG *ap, *rp, t, c;\n int i;\n\n bn_check_top(r);\n bn_check_top(a);\n\n if (BN_is_zero(a)) {\n BN_zero(r);\n return 1;\n }\n i = a->top;\n ap = a->d;\n if (a != r) {\n if (bn_wexpand(r, i) == NULL)\n return 0;\n r->neg = a->neg;\n }\n rp = r->d;\n r->top = i;\n t = ap[--i];\n rp[i] = t >> 1;\n c = t << (BN_BITS2 - 1);\n r->top -= (t == 1);\n while (i > 0) {\n t = ap[--i];\n rp[i] = ((t >> 1) & BN_MASK2) | c;\n c = t << (BN_BITS2 - 1);\n }\n if (!r->top)\n r->neg = 0; /* don't allow negative zero */\n bn_check_top(r);\n return 1;\n}\n\nint BN_lshift(BIGNUM *r, const BIGNUM *a, int n)\n{\n int ret;\n\n if (n < 0) {\n BNerr(BN_F_BN_LSHIFT, BN_R_INVALID_SHIFT);\n return 0;\n }\n\n ret = bn_lshift_fixed_top(r, a, n);\n\n bn_correct_top(r);\n bn_check_top(r);\n\n return ret;\n}\n\n/*\n * In respect to shift factor the execution time is invariant of\n * |n % BN_BITS2|, but not |n / BN_BITS2|. Or in other words pre-condition\n * for constant-time-ness is |n < BN_BITS2| or |n / BN_BITS2| being\n * non-secret.\n */\nint bn_lshift_fixed_top(BIGNUM *r, const BIGNUM *a, int n)\n{\n int i, nw;\n unsigned int lb, rb;\n BN_ULONG *t, *f;\n BN_ULONG l, m, rmask = 0;\n\n assert(n >= 0);\n\n bn_check_top(r);\n bn_check_top(a);\n\n nw = n / BN_BITS2;\n if (bn_wexpand(r, a->top + nw + 1) == NULL)\n return 0;\n\n if (a->top != 0) {\n lb = (unsigned int)n % BN_BITS2;\n rb = BN_BITS2 - lb;\n rb %= BN_BITS2; /* say no to undefined behaviour */\n rmask = (BN_ULONG)0 - rb; /* rmask = 0 - (rb != 0) */\n rmask |= rmask >> 8;\n f = &(a->d[0]);\n t = &(r->d[nw]);\n l = f[a->top - 1];\n t[a->top] = (l >> rb) & rmask;\n for (i = a->top - 1; i > 0; i--) {\n m = l << lb;\n l = f[i - 1];\n t[i] = (m | ((l >> rb) & rmask)) & BN_MASK2;\n }\n t[0] = (l << lb) & BN_MASK2;\n } else {\n /* shouldn't happen, but formally required */\n r->d[nw] = 0;\n }\n if (nw != 0)\n memset(r->d, 0, sizeof(*t) * nw);\n\n r->neg = a->neg;\n r->top = a->top + nw + 1;\n r->flags |= BN_FLG_FIXED_TOP;\n\n return 1;\n}\n\nint BN_rshift(BIGNUM *r, const BIGNUM *a, int n)\n{\n int ret = 0;\n\n if (n < 0) {\n BNerr(BN_F_BN_RSHIFT, BN_R_INVALID_SHIFT);\n return 0;\n }\n\n ret = bn_rshift_fixed_top(r, a, n);\n\n bn_correct_top(r);\n bn_check_top(r);\n\n return ret;\n}\n\n/*\n * In respect to shift factor the execution time is invariant of\n * |n % BN_BITS2|, but not |n / BN_BITS2|. Or in other words pre-condition\n * for constant-time-ness for sufficiently[!] zero-padded inputs is\n * |n < BN_BITS2| or |n / BN_BITS2| being non-secret.\n */\nint bn_rshift_fixed_top(BIGNUM *r, const BIGNUM *a, int n)\n{\n int i, top, nw;\n unsigned int lb, rb;\n BN_ULONG *t, *f;\n BN_ULONG l, m, mask;\n\n bn_check_top(r);\n bn_check_top(a);\n\n assert(n >= 0);\n\n nw = n / BN_BITS2;\n if (nw >= a->top) {\n /* shouldn't happen, but formally required */\n BN_zero(r);\n return 1;\n }\n\n rb = (unsigned int)n % BN_BITS2;\n lb = BN_BITS2 - rb;\n lb %= BN_BITS2; /* say no to undefined behaviour */\n mask = (BN_ULONG)0 - lb; /* mask = 0 - (lb != 0) */\n mask |= mask >> 8;\n top = a->top - nw;\n if (r != a && bn_wexpand(r, top) == NULL)\n return 0;\n\n t = &(r->d[0]);\n f = &(a->d[nw]);\n l = f[0];\n for (i = 0; i < top - 1; i++) {\n m = f[i + 1];\n t[i] = (l >> rb) | ((m << lb) & mask);\n l = m;\n }\n t[i] = l >> rb;\n\n r->neg = a->neg;\n r->top = top;\n r->flags |= BN_FLG_FIXED_TOP;\n\n return 1;\n}\n" }, { "path": "cryptomini/bn/bn_sqr.c", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \"internal/cryptlib.h\"\n#include \"bn_local.h\"\n\n/* r must not be a */\n/*\n * I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96\n */\nint BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)\n{\n int ret = bn_sqr_fixed_top(r, a, ctx);\n\n bn_correct_top(r);\n bn_check_top(r);\n\n return ret;\n}\n\nint bn_sqr_fixed_top(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)\n{\n int max, al;\n int ret = 0;\n BIGNUM *tmp, *rr;\n\n bn_check_top(a);\n\n al = a->top;\n if (al <= 0) {\n r->top = 0;\n r->neg = 0;\n return 1;\n }\n\n BN_CTX_start(ctx);\n rr = (a != r) ? r : BN_CTX_get(ctx);\n tmp = BN_CTX_get(ctx);\n if (rr == NULL || tmp == NULL)\n goto err;\n\n max = 2 * al; /* Non-zero (from above) */\n if (bn_wexpand(rr, max) == NULL)\n goto err;\n\n if (al == 4) {\n#ifndef BN_SQR_COMBA\n BN_ULONG t[8];\n bn_sqr_normal(rr->d, a->d, 4, t);\n#else\n bn_sqr_comba4(rr->d, a->d);\n#endif\n } else if (al == 8) {\n#ifndef BN_SQR_COMBA\n BN_ULONG t[16];\n bn_sqr_normal(rr->d, a->d, 8, t);\n#else\n bn_sqr_comba8(rr->d, a->d);\n#endif\n } else {\n#if defined(BN_RECURSION)\n if (al < BN_SQR_RECURSIVE_SIZE_NORMAL) {\n BN_ULONG t[BN_SQR_RECURSIVE_SIZE_NORMAL * 2];\n bn_sqr_normal(rr->d, a->d, al, t);\n } else {\n int j, k;\n\n j = BN_num_bits_word((BN_ULONG)al);\n j = 1 << (j - 1);\n k = j + j;\n if (al == j) {\n if (bn_wexpand(tmp, k * 2) == NULL)\n goto err;\n bn_sqr_recursive(rr->d, a->d, al, tmp->d);\n } else {\n if (bn_wexpand(tmp, max) == NULL)\n goto err;\n bn_sqr_normal(rr->d, a->d, al, tmp->d);\n }\n }\n#else\n if (bn_wexpand(tmp, max) == NULL)\n goto err;\n bn_sqr_normal(rr->d, a->d, al, tmp->d);\n#endif\n }\n\n rr->neg = 0;\n rr->top = max;\n rr->flags |= BN_FLG_FIXED_TOP;\n if (r != rr && BN_copy(r, rr) == NULL)\n goto err;\n\n ret = 1;\n err:\n bn_check_top(rr);\n bn_check_top(tmp);\n BN_CTX_end(ctx);\n return ret;\n}\n\n/* tmp must have 2*n words */\nvoid bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)\n{\n int i, j, max;\n const BN_ULONG *ap;\n BN_ULONG *rp;\n\n max = n * 2;\n ap = a;\n rp = r;\n rp[0] = rp[max - 1] = 0;\n rp++;\n j = n;\n\n if (--j > 0) {\n ap++;\n rp[j] = bn_mul_words(rp, ap, j, ap[-1]);\n rp += 2;\n }\n\n for (i = n - 2; i > 0; i--) {\n j--;\n ap++;\n rp[j] = bn_mul_add_words(rp, ap, j, ap[-1]);\n rp += 2;\n }\n\n bn_add_words(r, r, r, max);\n\n /* There will not be a carry */\n\n bn_sqr_words(tmp, a, n);\n\n bn_add_words(r, r, tmp, max);\n}\n\n#ifdef BN_RECURSION\n/*-\n * r is 2*n words in size,\n * a and b are both n words in size. (There's not actually a 'b' here ...)\n * n must be a power of 2.\n * We multiply and return the result.\n * t must be 2*n words in size\n * We calculate\n * a[0]*b[0]\n * a[0]*b[0]+a[1]*b[1]+(a[0]-a[1])*(b[1]-b[0])\n * a[1]*b[1]\n */\nvoid bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t)\n{\n int n = n2 / 2;\n int zero, c1;\n BN_ULONG ln, lo, *p;\n\n if (n2 == 4) {\n# ifndef BN_SQR_COMBA\n bn_sqr_normal(r, a, 4, t);\n# else\n bn_sqr_comba4(r, a);\n# endif\n return;\n } else if (n2 == 8) {\n# ifndef BN_SQR_COMBA\n bn_sqr_normal(r, a, 8, t);\n# else\n bn_sqr_comba8(r, a);\n# endif\n return;\n }\n if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) {\n bn_sqr_normal(r, a, n2, t);\n return;\n }\n /* r=(a[0]-a[1])*(a[1]-a[0]) */\n c1 = bn_cmp_words(a, &(a[n]), n);\n zero = 0;\n if (c1 > 0)\n bn_sub_words(t, a, &(a[n]), n);\n else if (c1 < 0)\n bn_sub_words(t, &(a[n]), a, n);\n else\n zero = 1;\n\n /* The result will always be negative unless it is zero */\n p = &(t[n2 * 2]);\n\n if (!zero)\n bn_sqr_recursive(&(t[n2]), t, n, p);\n else\n memset(&t[n2], 0, sizeof(*t) * n2);\n bn_sqr_recursive(r, a, n, p);\n bn_sqr_recursive(&(r[n2]), &(a[n]), n, p);\n\n /*-\n * t[32] holds (a[0]-a[1])*(a[1]-a[0]), it is negative or zero\n * r[10] holds (a[0]*b[0])\n * r[32] holds (b[1]*b[1])\n */\n\n c1 = (int)(bn_add_words(t, r, &(r[n2]), n2));\n\n /* t[32] is negative */\n c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2));\n\n /*-\n * t[32] holds (a[0]-a[1])*(a[1]-a[0])+(a[0]*a[0])+(a[1]*a[1])\n * r[10] holds (a[0]*a[0])\n * r[32] holds (a[1]*a[1])\n * c1 holds the carry bits\n */\n c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2));\n if (c1) {\n p = &(r[n + n2]);\n lo = *p;\n ln = (lo + c1) & BN_MASK2;\n *p = ln;\n\n /*\n * The overflow will stop before we over write words we should not\n * overwrite\n */\n if (ln < (BN_ULONG)c1) {\n do {\n p++;\n lo = *p;\n ln = (lo + 1) & BN_MASK2;\n *p = ln;\n } while (ln == 0);\n }\n }\n}\n#endif\n" }, { "path": "cryptomini/bn/bn_word.c", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \"internal/cryptlib.h\"\n#include \"bn_local.h\"\n\nBN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w)\n{\n#ifndef BN_LLONG\n BN_ULONG ret = 0;\n#else\n BN_ULLONG ret = 0;\n#endif\n int i;\n\n if (w == 0)\n return (BN_ULONG)-1;\n\n#ifndef BN_LLONG\n /*\n * If |w| is too long and we don't have BN_ULLONG then we need to fall\n * back to using BN_div_word\n */\n if (w > ((BN_ULONG)1 << BN_BITS4)) {\n BIGNUM *tmp = BN_dup(a);\n if (tmp == NULL)\n return (BN_ULONG)-1;\n\n ret = BN_div_word(tmp, w);\n BN_free(tmp);\n\n return ret;\n }\n#endif\n\n bn_check_top(a);\n w &= BN_MASK2;\n for (i = a->top - 1; i >= 0; i--) {\n#ifndef BN_LLONG\n /*\n * We can assume here that | w <= ((BN_ULONG)1 << BN_BITS4) | and so\n * | ret < ((BN_ULONG)1 << BN_BITS4) | and therefore the shifts here are\n * safe and will not overflow\n */\n ret = ((ret << BN_BITS4) | ((a->d[i] >> BN_BITS4) & BN_MASK2l)) % w;\n ret = ((ret << BN_BITS4) | (a->d[i] & BN_MASK2l)) % w;\n#else\n ret = (BN_ULLONG) (((ret << (BN_ULLONG) BN_BITS2) | a->d[i]) %\n (BN_ULLONG) w);\n#endif\n }\n return (BN_ULONG)ret;\n}\n\nBN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w)\n{\n BN_ULONG ret = 0;\n int i, j;\n\n bn_check_top(a);\n w &= BN_MASK2;\n\n if (!w)\n /* actually this an error (division by zero) */\n return (BN_ULONG)-1;\n if (a->top == 0)\n return 0;\n\n /* normalize input (so bn_div_words doesn't complain) */\n j = BN_BITS2 - BN_num_bits_word(w);\n w <<= j;\n if (!BN_lshift(a, a, j))\n return (BN_ULONG)-1;\n\n for (i = a->top - 1; i >= 0; i--) {\n BN_ULONG l, d;\n\n l = a->d[i];\n d = bn_div_words(ret, l, w);\n ret = (l - ((d * w) & BN_MASK2)) & BN_MASK2;\n a->d[i] = d;\n }\n if ((a->top > 0) && (a->d[a->top - 1] == 0))\n a->top--;\n ret >>= j;\n if (!a->top)\n a->neg = 0; /* don't allow negative zero */\n bn_check_top(a);\n return ret;\n}\n\nint BN_add_word(BIGNUM *a, BN_ULONG w)\n{\n BN_ULONG l;\n int i;\n\n bn_check_top(a);\n w &= BN_MASK2;\n\n /* degenerate case: w is zero */\n if (!w)\n return 1;\n /* degenerate case: a is zero */\n if (BN_is_zero(a))\n return BN_set_word(a, w);\n /* handle 'a' when negative */\n if (a->neg) {\n a->neg = 0;\n i = BN_sub_word(a, w);\n if (!BN_is_zero(a))\n a->neg = !(a->neg);\n return i;\n }\n for (i = 0; w != 0 && i < a->top; i++) {\n a->d[i] = l = (a->d[i] + w) & BN_MASK2;\n w = (w > l) ? 1 : 0;\n }\n if (w && i == a->top) {\n if (bn_wexpand(a, a->top + 1) == NULL)\n return 0;\n a->top++;\n a->d[i] = w;\n }\n bn_check_top(a);\n return 1;\n}\n\nint BN_sub_word(BIGNUM *a, BN_ULONG w)\n{\n int i;\n\n bn_check_top(a);\n w &= BN_MASK2;\n\n /* degenerate case: w is zero */\n if (!w)\n return 1;\n /* degenerate case: a is zero */\n if (BN_is_zero(a)) {\n i = BN_set_word(a, w);\n if (i != 0)\n BN_set_negative(a, 1);\n return i;\n }\n /* handle 'a' when negative */\n if (a->neg) {\n a->neg = 0;\n i = BN_add_word(a, w);\n a->neg = 1;\n return i;\n }\n\n if ((a->top == 1) && (a->d[0] < w)) {\n a->d[0] = w - a->d[0];\n a->neg = 1;\n return 1;\n }\n i = 0;\n for (;;) {\n if (a->d[i] >= w) {\n a->d[i] -= w;\n break;\n } else {\n a->d[i] = (a->d[i] - w) & BN_MASK2;\n i++;\n w = 1;\n }\n }\n if ((a->d[i] == 0) && (i == (a->top - 1)))\n a->top--;\n bn_check_top(a);\n return 1;\n}\n\nint BN_mul_word(BIGNUM *a, BN_ULONG w)\n{\n BN_ULONG ll;\n\n bn_check_top(a);\n w &= BN_MASK2;\n if (a->top) {\n if (w == 0)\n BN_zero(a);\n else {\n ll = bn_mul_words(a->d, a->d, a->top, w);\n if (ll) {\n if (bn_wexpand(a, a->top + 1) == NULL)\n return 0;\n a->d[a->top++] = ll;\n }\n }\n }\n bn_check_top(a);\n return 1;\n}\n" }, { "path": "cryptomini/bn/rsaz_exp.h", "content": "/*\n * Copyright 2013-2018 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2012, Intel Corporation. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n *\n * Originally written by Shay Gueron (1, 2), and Vlad Krasnov (1)\n * (1) Intel Corporation, Israel Development Center, Haifa, Israel\n * (2) University of Haifa, Israel\n */\n\n#ifndef OSSL_CRYPTO_BN_RSAZ_EXP_H\n# define OSSL_CRYPTO_BN_RSAZ_EXP_H\n\n# undef RSAZ_ENABLED\n# if defined(OPENSSL_BN_ASM_MONT) && \\\n (defined(__x86_64) || defined(__x86_64__) || \\\n defined(_M_AMD64) || defined(_M_X64))\n# define RSAZ_ENABLED\n\n# include \n\nvoid RSAZ_1024_mod_exp_avx2(BN_ULONG result[16],\n const BN_ULONG base_norm[16],\n const BN_ULONG exponent[16],\n const BN_ULONG m_norm[16], const BN_ULONG RR[16],\n BN_ULONG k0);\nint rsaz_avx2_eligible(void);\n\nvoid RSAZ_512_mod_exp(BN_ULONG result[8],\n const BN_ULONG base_norm[8], const BN_ULONG exponent[8],\n const BN_ULONG m_norm[8], BN_ULONG k0,\n const BN_ULONG RR[8]);\n\n# endif\n\n#endif\n" }, { "path": "cryptomini/camellia/camellia.c", "content": "/*\n * Copyright 2006-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/* ====================================================================\n * Copyright 2006 NTT (Nippon Telegraph and Telephone Corporation) .\n * ALL RIGHTS RESERVED.\n *\n * Intellectual Property information for Camellia:\n * http://info.isl.ntt.co.jp/crypt/eng/info/chiteki.html\n *\n * News Release for Announcement of Camellia open source:\n * http://www.ntt.co.jp/news/news06e/0604/060413a.html\n *\n * The Camellia Code included herein is developed by\n * NTT (Nippon Telegraph and Telephone Corporation), and is contributed\n * to the OpenSSL project.\n */\n\n/*\n * Algorithm Specification\n * http://info.isl.ntt.co.jp/crypt/eng/camellia/specifications.html\n */\n\n/*\n * This release balances code size and performance. In particular key\n * schedule setup is fully unrolled, because doing so *significantly*\n * reduces amount of instructions per setup round and code increase is\n * justifiable. In block functions on the other hand only inner loops\n * are unrolled, as full unroll gives only nominal performance boost,\n * while code size grows 4 or 7 times. Also, unlike previous versions\n * this one \"encourages\" compiler to keep intermediate variables in\n * registers, which should give better \"all round\" results, in other\n * words reasonable performance even with not so modern compilers.\n */\n\n#include \n#include \"cmll_local.h\"\n#include \n#include \n\n#define RightRotate(x, s) ( ((x) >> (s)) + ((x) << (32 - s)) )\n#define LeftRotate(x, s) ( ((x) << (s)) + ((x) >> (32 - s)) )\n\n#define GETU32(p) (((u32)(p)[0] << 24) ^ ((u32)(p)[1] << 16) ^ ((u32)(p)[2] << 8) ^ ((u32)(p)[3]))\n#define PUTU32(p,v) ((p)[0] = (u8)((v) >> 24), (p)[1] = (u8)((v) >> 16), (p)[2] = (u8)((v) >> 8), (p)[3] = (u8)(v))\n\n/* S-box data */\n#define SBOX1_1110 Camellia_SBOX[0]\n#define SBOX4_4404 Camellia_SBOX[1]\n#define SBOX2_0222 Camellia_SBOX[2]\n#define SBOX3_3033 Camellia_SBOX[3]\nstatic const u32 Camellia_SBOX[][256] = {\n {0x70707000, 0x82828200, 0x2c2c2c00, 0xececec00, 0xb3b3b300, 0x27272700,\n 0xc0c0c000, 0xe5e5e500, 0xe4e4e400, 0x85858500, 0x57575700, 0x35353500,\n 0xeaeaea00, 0x0c0c0c00, 0xaeaeae00, 0x41414100, 0x23232300, 0xefefef00,\n 0x6b6b6b00, 0x93939300, 0x45454500, 0x19191900, 0xa5a5a500, 0x21212100,\n 0xededed00, 0x0e0e0e00, 0x4f4f4f00, 0x4e4e4e00, 0x1d1d1d00, 0x65656500,\n 0x92929200, 0xbdbdbd00, 0x86868600, 0xb8b8b800, 0xafafaf00, 0x8f8f8f00,\n 0x7c7c7c00, 0xebebeb00, 0x1f1f1f00, 0xcecece00, 0x3e3e3e00, 0x30303000,\n 0xdcdcdc00, 0x5f5f5f00, 0x5e5e5e00, 0xc5c5c500, 0x0b0b0b00, 0x1a1a1a00,\n 0xa6a6a600, 0xe1e1e100, 0x39393900, 0xcacaca00, 0xd5d5d500, 0x47474700,\n 0x5d5d5d00, 0x3d3d3d00, 0xd9d9d900, 0x01010100, 0x5a5a5a00, 0xd6d6d600,\n 0x51515100, 0x56565600, 0x6c6c6c00, 0x4d4d4d00, 0x8b8b8b00, 0x0d0d0d00,\n 0x9a9a9a00, 0x66666600, 0xfbfbfb00, 0xcccccc00, 0xb0b0b000, 0x2d2d2d00,\n 0x74747400, 0x12121200, 0x2b2b2b00, 0x20202000, 0xf0f0f000, 0xb1b1b100,\n 0x84848400, 0x99999900, 0xdfdfdf00, 0x4c4c4c00, 0xcbcbcb00, 0xc2c2c200,\n 0x34343400, 0x7e7e7e00, 0x76767600, 0x05050500, 0x6d6d6d00, 0xb7b7b700,\n 0xa9a9a900, 0x31313100, 0xd1d1d100, 0x17171700, 0x04040400, 0xd7d7d700,\n 0x14141400, 0x58585800, 0x3a3a3a00, 0x61616100, 0xdedede00, 0x1b1b1b00,\n 0x11111100, 0x1c1c1c00, 0x32323200, 0x0f0f0f00, 0x9c9c9c00, 0x16161600,\n 0x53535300, 0x18181800, 0xf2f2f200, 0x22222200, 0xfefefe00, 0x44444400,\n 0xcfcfcf00, 0xb2b2b200, 0xc3c3c300, 0xb5b5b500, 0x7a7a7a00, 0x91919100,\n 0x24242400, 0x08080800, 0xe8e8e800, 0xa8a8a800, 0x60606000, 0xfcfcfc00,\n 0x69696900, 0x50505000, 0xaaaaaa00, 0xd0d0d000, 0xa0a0a000, 0x7d7d7d00,\n 0xa1a1a100, 0x89898900, 0x62626200, 0x97979700, 0x54545400, 0x5b5b5b00,\n 0x1e1e1e00, 0x95959500, 0xe0e0e000, 0xffffff00, 0x64646400, 0xd2d2d200,\n 0x10101000, 0xc4c4c400, 0x00000000, 0x48484800, 0xa3a3a300, 0xf7f7f700,\n 0x75757500, 0xdbdbdb00, 0x8a8a8a00, 0x03030300, 0xe6e6e600, 0xdadada00,\n 0x09090900, 0x3f3f3f00, 0xdddddd00, 0x94949400, 0x87878700, 0x5c5c5c00,\n 0x83838300, 0x02020200, 0xcdcdcd00, 0x4a4a4a00, 0x90909000, 0x33333300,\n 0x73737300, 0x67676700, 0xf6f6f600, 0xf3f3f300, 0x9d9d9d00, 0x7f7f7f00,\n 0xbfbfbf00, 0xe2e2e200, 0x52525200, 0x9b9b9b00, 0xd8d8d800, 0x26262600,\n 0xc8c8c800, 0x37373700, 0xc6c6c600, 0x3b3b3b00, 0x81818100, 0x96969600,\n 0x6f6f6f00, 0x4b4b4b00, 0x13131300, 0xbebebe00, 0x63636300, 0x2e2e2e00,\n 0xe9e9e900, 0x79797900, 0xa7a7a700, 0x8c8c8c00, 0x9f9f9f00, 0x6e6e6e00,\n 0xbcbcbc00, 0x8e8e8e00, 0x29292900, 0xf5f5f500, 0xf9f9f900, 0xb6b6b600,\n 0x2f2f2f00, 0xfdfdfd00, 0xb4b4b400, 0x59595900, 0x78787800, 0x98989800,\n 0x06060600, 0x6a6a6a00, 0xe7e7e700, 0x46464600, 0x71717100, 0xbababa00,\n 0xd4d4d400, 0x25252500, 0xababab00, 0x42424200, 0x88888800, 0xa2a2a200,\n 0x8d8d8d00, 0xfafafa00, 0x72727200, 0x07070700, 0xb9b9b900, 0x55555500,\n 0xf8f8f800, 0xeeeeee00, 0xacacac00, 0x0a0a0a00, 0x36363600, 0x49494900,\n 0x2a2a2a00, 0x68686800, 0x3c3c3c00, 0x38383800, 0xf1f1f100, 0xa4a4a400,\n 0x40404000, 0x28282800, 0xd3d3d300, 0x7b7b7b00, 0xbbbbbb00, 0xc9c9c900,\n 0x43434300, 0xc1c1c100, 0x15151500, 0xe3e3e300, 0xadadad00, 0xf4f4f400,\n 0x77777700, 0xc7c7c700, 0x80808000, 0x9e9e9e00},\n {0x70700070, 0x2c2c002c, 0xb3b300b3, 0xc0c000c0, 0xe4e400e4, 0x57570057,\n 0xeaea00ea, 0xaeae00ae, 0x23230023, 0x6b6b006b, 0x45450045, 0xa5a500a5,\n 0xeded00ed, 0x4f4f004f, 0x1d1d001d, 0x92920092, 0x86860086, 0xafaf00af,\n 0x7c7c007c, 0x1f1f001f, 0x3e3e003e, 0xdcdc00dc, 0x5e5e005e, 0x0b0b000b,\n 0xa6a600a6, 0x39390039, 0xd5d500d5, 0x5d5d005d, 0xd9d900d9, 0x5a5a005a,\n 0x51510051, 0x6c6c006c, 0x8b8b008b, 0x9a9a009a, 0xfbfb00fb, 0xb0b000b0,\n 0x74740074, 0x2b2b002b, 0xf0f000f0, 0x84840084, 0xdfdf00df, 0xcbcb00cb,\n 0x34340034, 0x76760076, 0x6d6d006d, 0xa9a900a9, 0xd1d100d1, 0x04040004,\n 0x14140014, 0x3a3a003a, 0xdede00de, 0x11110011, 0x32320032, 0x9c9c009c,\n 0x53530053, 0xf2f200f2, 0xfefe00fe, 0xcfcf00cf, 0xc3c300c3, 0x7a7a007a,\n 0x24240024, 0xe8e800e8, 0x60600060, 0x69690069, 0xaaaa00aa, 0xa0a000a0,\n 0xa1a100a1, 0x62620062, 0x54540054, 0x1e1e001e, 0xe0e000e0, 0x64640064,\n 0x10100010, 0x00000000, 0xa3a300a3, 0x75750075, 0x8a8a008a, 0xe6e600e6,\n 0x09090009, 0xdddd00dd, 0x87870087, 0x83830083, 0xcdcd00cd, 0x90900090,\n 0x73730073, 0xf6f600f6, 0x9d9d009d, 0xbfbf00bf, 0x52520052, 0xd8d800d8,\n 0xc8c800c8, 0xc6c600c6, 0x81810081, 0x6f6f006f, 0x13130013, 0x63630063,\n 0xe9e900e9, 0xa7a700a7, 0x9f9f009f, 0xbcbc00bc, 0x29290029, 0xf9f900f9,\n 0x2f2f002f, 0xb4b400b4, 0x78780078, 0x06060006, 0xe7e700e7, 0x71710071,\n 0xd4d400d4, 0xabab00ab, 0x88880088, 0x8d8d008d, 0x72720072, 0xb9b900b9,\n 0xf8f800f8, 0xacac00ac, 0x36360036, 0x2a2a002a, 0x3c3c003c, 0xf1f100f1,\n 0x40400040, 0xd3d300d3, 0xbbbb00bb, 0x43430043, 0x15150015, 0xadad00ad,\n 0x77770077, 0x80800080, 0x82820082, 0xecec00ec, 0x27270027, 0xe5e500e5,\n 0x85850085, 0x35350035, 0x0c0c000c, 0x41410041, 0xefef00ef, 0x93930093,\n 0x19190019, 0x21210021, 0x0e0e000e, 0x4e4e004e, 0x65650065, 0xbdbd00bd,\n 0xb8b800b8, 0x8f8f008f, 0xebeb00eb, 0xcece00ce, 0x30300030, 0x5f5f005f,\n 0xc5c500c5, 0x1a1a001a, 0xe1e100e1, 0xcaca00ca, 0x47470047, 0x3d3d003d,\n 0x01010001, 0xd6d600d6, 0x56560056, 0x4d4d004d, 0x0d0d000d, 0x66660066,\n 0xcccc00cc, 0x2d2d002d, 0x12120012, 0x20200020, 0xb1b100b1, 0x99990099,\n 0x4c4c004c, 0xc2c200c2, 0x7e7e007e, 0x05050005, 0xb7b700b7, 0x31310031,\n 0x17170017, 0xd7d700d7, 0x58580058, 0x61610061, 0x1b1b001b, 0x1c1c001c,\n 0x0f0f000f, 0x16160016, 0x18180018, 0x22220022, 0x44440044, 0xb2b200b2,\n 0xb5b500b5, 0x91910091, 0x08080008, 0xa8a800a8, 0xfcfc00fc, 0x50500050,\n 0xd0d000d0, 0x7d7d007d, 0x89890089, 0x97970097, 0x5b5b005b, 0x95950095,\n 0xffff00ff, 0xd2d200d2, 0xc4c400c4, 0x48480048, 0xf7f700f7, 0xdbdb00db,\n 0x03030003, 0xdada00da, 0x3f3f003f, 0x94940094, 0x5c5c005c, 0x02020002,\n 0x4a4a004a, 0x33330033, 0x67670067, 0xf3f300f3, 0x7f7f007f, 0xe2e200e2,\n 0x9b9b009b, 0x26260026, 0x37370037, 0x3b3b003b, 0x96960096, 0x4b4b004b,\n 0xbebe00be, 0x2e2e002e, 0x79790079, 0x8c8c008c, 0x6e6e006e, 0x8e8e008e,\n 0xf5f500f5, 0xb6b600b6, 0xfdfd00fd, 0x59590059, 0x98980098, 0x6a6a006a,\n 0x46460046, 0xbaba00ba, 0x25250025, 0x42420042, 0xa2a200a2, 0xfafa00fa,\n 0x07070007, 0x55550055, 0xeeee00ee, 0x0a0a000a, 0x49490049, 0x68680068,\n 0x38380038, 0xa4a400a4, 0x28280028, 0x7b7b007b, 0xc9c900c9, 0xc1c100c1,\n 0xe3e300e3, 0xf4f400f4, 0xc7c700c7, 0x9e9e009e},\n {0x00e0e0e0, 0x00050505, 0x00585858, 0x00d9d9d9, 0x00676767, 0x004e4e4e,\n 0x00818181, 0x00cbcbcb, 0x00c9c9c9, 0x000b0b0b, 0x00aeaeae, 0x006a6a6a,\n 0x00d5d5d5, 0x00181818, 0x005d5d5d, 0x00828282, 0x00464646, 0x00dfdfdf,\n 0x00d6d6d6, 0x00272727, 0x008a8a8a, 0x00323232, 0x004b4b4b, 0x00424242,\n 0x00dbdbdb, 0x001c1c1c, 0x009e9e9e, 0x009c9c9c, 0x003a3a3a, 0x00cacaca,\n 0x00252525, 0x007b7b7b, 0x000d0d0d, 0x00717171, 0x005f5f5f, 0x001f1f1f,\n 0x00f8f8f8, 0x00d7d7d7, 0x003e3e3e, 0x009d9d9d, 0x007c7c7c, 0x00606060,\n 0x00b9b9b9, 0x00bebebe, 0x00bcbcbc, 0x008b8b8b, 0x00161616, 0x00343434,\n 0x004d4d4d, 0x00c3c3c3, 0x00727272, 0x00959595, 0x00ababab, 0x008e8e8e,\n 0x00bababa, 0x007a7a7a, 0x00b3b3b3, 0x00020202, 0x00b4b4b4, 0x00adadad,\n 0x00a2a2a2, 0x00acacac, 0x00d8d8d8, 0x009a9a9a, 0x00171717, 0x001a1a1a,\n 0x00353535, 0x00cccccc, 0x00f7f7f7, 0x00999999, 0x00616161, 0x005a5a5a,\n 0x00e8e8e8, 0x00242424, 0x00565656, 0x00404040, 0x00e1e1e1, 0x00636363,\n 0x00090909, 0x00333333, 0x00bfbfbf, 0x00989898, 0x00979797, 0x00858585,\n 0x00686868, 0x00fcfcfc, 0x00ececec, 0x000a0a0a, 0x00dadada, 0x006f6f6f,\n 0x00535353, 0x00626262, 0x00a3a3a3, 0x002e2e2e, 0x00080808, 0x00afafaf,\n 0x00282828, 0x00b0b0b0, 0x00747474, 0x00c2c2c2, 0x00bdbdbd, 0x00363636,\n 0x00222222, 0x00383838, 0x00646464, 0x001e1e1e, 0x00393939, 0x002c2c2c,\n 0x00a6a6a6, 0x00303030, 0x00e5e5e5, 0x00444444, 0x00fdfdfd, 0x00888888,\n 0x009f9f9f, 0x00656565, 0x00878787, 0x006b6b6b, 0x00f4f4f4, 0x00232323,\n 0x00484848, 0x00101010, 0x00d1d1d1, 0x00515151, 0x00c0c0c0, 0x00f9f9f9,\n 0x00d2d2d2, 0x00a0a0a0, 0x00555555, 0x00a1a1a1, 0x00414141, 0x00fafafa,\n 0x00434343, 0x00131313, 0x00c4c4c4, 0x002f2f2f, 0x00a8a8a8, 0x00b6b6b6,\n 0x003c3c3c, 0x002b2b2b, 0x00c1c1c1, 0x00ffffff, 0x00c8c8c8, 0x00a5a5a5,\n 0x00202020, 0x00898989, 0x00000000, 0x00909090, 0x00474747, 0x00efefef,\n 0x00eaeaea, 0x00b7b7b7, 0x00151515, 0x00060606, 0x00cdcdcd, 0x00b5b5b5,\n 0x00121212, 0x007e7e7e, 0x00bbbbbb, 0x00292929, 0x000f0f0f, 0x00b8b8b8,\n 0x00070707, 0x00040404, 0x009b9b9b, 0x00949494, 0x00212121, 0x00666666,\n 0x00e6e6e6, 0x00cecece, 0x00ededed, 0x00e7e7e7, 0x003b3b3b, 0x00fefefe,\n 0x007f7f7f, 0x00c5c5c5, 0x00a4a4a4, 0x00373737, 0x00b1b1b1, 0x004c4c4c,\n 0x00919191, 0x006e6e6e, 0x008d8d8d, 0x00767676, 0x00030303, 0x002d2d2d,\n 0x00dedede, 0x00969696, 0x00262626, 0x007d7d7d, 0x00c6c6c6, 0x005c5c5c,\n 0x00d3d3d3, 0x00f2f2f2, 0x004f4f4f, 0x00191919, 0x003f3f3f, 0x00dcdcdc,\n 0x00797979, 0x001d1d1d, 0x00525252, 0x00ebebeb, 0x00f3f3f3, 0x006d6d6d,\n 0x005e5e5e, 0x00fbfbfb, 0x00696969, 0x00b2b2b2, 0x00f0f0f0, 0x00313131,\n 0x000c0c0c, 0x00d4d4d4, 0x00cfcfcf, 0x008c8c8c, 0x00e2e2e2, 0x00757575,\n 0x00a9a9a9, 0x004a4a4a, 0x00575757, 0x00848484, 0x00111111, 0x00454545,\n 0x001b1b1b, 0x00f5f5f5, 0x00e4e4e4, 0x000e0e0e, 0x00737373, 0x00aaaaaa,\n 0x00f1f1f1, 0x00dddddd, 0x00595959, 0x00141414, 0x006c6c6c, 0x00929292,\n 0x00545454, 0x00d0d0d0, 0x00787878, 0x00707070, 0x00e3e3e3, 0x00494949,\n 0x00808080, 0x00505050, 0x00a7a7a7, 0x00f6f6f6, 0x00777777, 0x00939393,\n 0x00868686, 0x00838383, 0x002a2a2a, 0x00c7c7c7, 0x005b5b5b, 0x00e9e9e9,\n 0x00eeeeee, 0x008f8f8f, 0x00010101, 0x003d3d3d},\n {0x38003838, 0x41004141, 0x16001616, 0x76007676, 0xd900d9d9, 0x93009393,\n 0x60006060, 0xf200f2f2, 0x72007272, 0xc200c2c2, 0xab00abab, 0x9a009a9a,\n 0x75007575, 0x06000606, 0x57005757, 0xa000a0a0, 0x91009191, 0xf700f7f7,\n 0xb500b5b5, 0xc900c9c9, 0xa200a2a2, 0x8c008c8c, 0xd200d2d2, 0x90009090,\n 0xf600f6f6, 0x07000707, 0xa700a7a7, 0x27002727, 0x8e008e8e, 0xb200b2b2,\n 0x49004949, 0xde00dede, 0x43004343, 0x5c005c5c, 0xd700d7d7, 0xc700c7c7,\n 0x3e003e3e, 0xf500f5f5, 0x8f008f8f, 0x67006767, 0x1f001f1f, 0x18001818,\n 0x6e006e6e, 0xaf00afaf, 0x2f002f2f, 0xe200e2e2, 0x85008585, 0x0d000d0d,\n 0x53005353, 0xf000f0f0, 0x9c009c9c, 0x65006565, 0xea00eaea, 0xa300a3a3,\n 0xae00aeae, 0x9e009e9e, 0xec00ecec, 0x80008080, 0x2d002d2d, 0x6b006b6b,\n 0xa800a8a8, 0x2b002b2b, 0x36003636, 0xa600a6a6, 0xc500c5c5, 0x86008686,\n 0x4d004d4d, 0x33003333, 0xfd00fdfd, 0x66006666, 0x58005858, 0x96009696,\n 0x3a003a3a, 0x09000909, 0x95009595, 0x10001010, 0x78007878, 0xd800d8d8,\n 0x42004242, 0xcc00cccc, 0xef00efef, 0x26002626, 0xe500e5e5, 0x61006161,\n 0x1a001a1a, 0x3f003f3f, 0x3b003b3b, 0x82008282, 0xb600b6b6, 0xdb00dbdb,\n 0xd400d4d4, 0x98009898, 0xe800e8e8, 0x8b008b8b, 0x02000202, 0xeb00ebeb,\n 0x0a000a0a, 0x2c002c2c, 0x1d001d1d, 0xb000b0b0, 0x6f006f6f, 0x8d008d8d,\n 0x88008888, 0x0e000e0e, 0x19001919, 0x87008787, 0x4e004e4e, 0x0b000b0b,\n 0xa900a9a9, 0x0c000c0c, 0x79007979, 0x11001111, 0x7f007f7f, 0x22002222,\n 0xe700e7e7, 0x59005959, 0xe100e1e1, 0xda00dada, 0x3d003d3d, 0xc800c8c8,\n 0x12001212, 0x04000404, 0x74007474, 0x54005454, 0x30003030, 0x7e007e7e,\n 0xb400b4b4, 0x28002828, 0x55005555, 0x68006868, 0x50005050, 0xbe00bebe,\n 0xd000d0d0, 0xc400c4c4, 0x31003131, 0xcb00cbcb, 0x2a002a2a, 0xad00adad,\n 0x0f000f0f, 0xca00caca, 0x70007070, 0xff00ffff, 0x32003232, 0x69006969,\n 0x08000808, 0x62006262, 0x00000000, 0x24002424, 0xd100d1d1, 0xfb00fbfb,\n 0xba00baba, 0xed00eded, 0x45004545, 0x81008181, 0x73007373, 0x6d006d6d,\n 0x84008484, 0x9f009f9f, 0xee00eeee, 0x4a004a4a, 0xc300c3c3, 0x2e002e2e,\n 0xc100c1c1, 0x01000101, 0xe600e6e6, 0x25002525, 0x48004848, 0x99009999,\n 0xb900b9b9, 0xb300b3b3, 0x7b007b7b, 0xf900f9f9, 0xce00cece, 0xbf00bfbf,\n 0xdf00dfdf, 0x71007171, 0x29002929, 0xcd00cdcd, 0x6c006c6c, 0x13001313,\n 0x64006464, 0x9b009b9b, 0x63006363, 0x9d009d9d, 0xc000c0c0, 0x4b004b4b,\n 0xb700b7b7, 0xa500a5a5, 0x89008989, 0x5f005f5f, 0xb100b1b1, 0x17001717,\n 0xf400f4f4, 0xbc00bcbc, 0xd300d3d3, 0x46004646, 0xcf00cfcf, 0x37003737,\n 0x5e005e5e, 0x47004747, 0x94009494, 0xfa00fafa, 0xfc00fcfc, 0x5b005b5b,\n 0x97009797, 0xfe00fefe, 0x5a005a5a, 0xac00acac, 0x3c003c3c, 0x4c004c4c,\n 0x03000303, 0x35003535, 0xf300f3f3, 0x23002323, 0xb800b8b8, 0x5d005d5d,\n 0x6a006a6a, 0x92009292, 0xd500d5d5, 0x21002121, 0x44004444, 0x51005151,\n 0xc600c6c6, 0x7d007d7d, 0x39003939, 0x83008383, 0xdc00dcdc, 0xaa00aaaa,\n 0x7c007c7c, 0x77007777, 0x56005656, 0x05000505, 0x1b001b1b, 0xa400a4a4,\n 0x15001515, 0x34003434, 0x1e001e1e, 0x1c001c1c, 0xf800f8f8, 0x52005252,\n 0x20002020, 0x14001414, 0xe900e9e9, 0xbd00bdbd, 0xdd00dddd, 0xe400e4e4,\n 0xa100a1a1, 0xe000e0e0, 0x8a008a8a, 0xf100f1f1, 0xd600d6d6, 0x7a007a7a,\n 0xbb00bbbb, 0xe300e3e3, 0x40004040, 0x4f004f4f}\n};\n\n/* Key generation constants */\nstatic const u32 SIGMA[] = {\n 0xa09e667f, 0x3bcc908b, 0xb67ae858, 0x4caa73b2, 0xc6ef372f, 0xe94f82be,\n 0x54ff53a5, 0xf1d36f1c, 0x10e527fa, 0xde682d1d, 0xb05688c2, 0xb3e6c1fd\n};\n\n/* The phi algorithm given in C.2.7 of the Camellia spec document. */\n/*\n * This version does not attempt to minimize amount of temporary\n * variables, but instead explicitly exposes algorithm's parallelism.\n * It is therefore most appropriate for platforms with not less than\n * ~16 registers. For platforms with less registers [well, x86 to be\n * specific] assembler version should be/is provided anyway...\n */\n#define Camellia_Feistel(_s0,_s1,_s2,_s3,_key) do {\\\n register u32 _t0,_t1,_t2,_t3;\\\n\\\n _t0 = _s0 ^ (_key)[0];\\\n _t3 = SBOX4_4404[_t0&0xff];\\\n _t1 = _s1 ^ (_key)[1];\\\n _t3 ^= SBOX3_3033[(_t0 >> 8)&0xff];\\\n _t2 = SBOX1_1110[_t1&0xff];\\\n _t3 ^= SBOX2_0222[(_t0 >> 16)&0xff];\\\n _t2 ^= SBOX4_4404[(_t1 >> 8)&0xff];\\\n _t3 ^= SBOX1_1110[(_t0 >> 24)];\\\n _t2 ^= _t3;\\\n _t3 = RightRotate(_t3,8);\\\n _t2 ^= SBOX3_3033[(_t1 >> 16)&0xff];\\\n _s3 ^= _t3;\\\n _t2 ^= SBOX2_0222[(_t1 >> 24)];\\\n _s2 ^= _t2; \\\n _s3 ^= _t2;\\\n} while(0)\n\n/*\n * Note that n has to be less than 32. Rotations for larger amount\n * of bits are achieved by \"rotating\" order of s-elements and\n * adjusting n accordingly, e.g. RotLeft128(s1,s2,s3,s0,n-32).\n */\n#define RotLeft128(_s0,_s1,_s2,_s3,_n) do {\\\n u32 _t0=_s0>>(32-_n);\\\n _s0 = (_s0<<_n) | (_s1>>(32-_n));\\\n _s1 = (_s1<<_n) | (_s2>>(32-_n));\\\n _s2 = (_s2<<_n) | (_s3>>(32-_n));\\\n _s3 = (_s3<<_n) | _t0;\\\n} while (0)\n\nint Camellia_Ekeygen(int keyBitLength, const u8 *rawKey, KEY_TABLE_TYPE k)\n{\n register u32 s0, s1, s2, s3;\n\n k[0] = s0 = GETU32(rawKey);\n k[1] = s1 = GETU32(rawKey + 4);\n k[2] = s2 = GETU32(rawKey + 8);\n k[3] = s3 = GETU32(rawKey + 12);\n\n if (keyBitLength != 128) {\n k[8] = s0 = GETU32(rawKey + 16);\n k[9] = s1 = GETU32(rawKey + 20);\n if (keyBitLength == 192) {\n k[10] = s2 = ~s0;\n k[11] = s3 = ~s1;\n } else {\n k[10] = s2 = GETU32(rawKey + 24);\n k[11] = s3 = GETU32(rawKey + 28);\n }\n s0 ^= k[0], s1 ^= k[1], s2 ^= k[2], s3 ^= k[3];\n }\n\n /* Use the Feistel routine to scramble the key material */\n Camellia_Feistel(s0, s1, s2, s3, SIGMA + 0);\n Camellia_Feistel(s2, s3, s0, s1, SIGMA + 2);\n\n s0 ^= k[0], s1 ^= k[1], s2 ^= k[2], s3 ^= k[3];\n Camellia_Feistel(s0, s1, s2, s3, SIGMA + 4);\n Camellia_Feistel(s2, s3, s0, s1, SIGMA + 6);\n\n /* Fill the keyTable. Requires many block rotations. */\n if (keyBitLength == 128) {\n k[4] = s0, k[5] = s1, k[6] = s2, k[7] = s3;\n RotLeft128(s0, s1, s2, s3, 15); /* KA <<< 15 */\n k[12] = s0, k[13] = s1, k[14] = s2, k[15] = s3;\n RotLeft128(s0, s1, s2, s3, 15); /* KA <<< 30 */\n k[16] = s0, k[17] = s1, k[18] = s2, k[19] = s3;\n RotLeft128(s0, s1, s2, s3, 15); /* KA <<< 45 */\n k[24] = s0, k[25] = s1;\n RotLeft128(s0, s1, s2, s3, 15); /* KA <<< 60 */\n k[28] = s0, k[29] = s1, k[30] = s2, k[31] = s3;\n RotLeft128(s1, s2, s3, s0, 2); /* KA <<< 94 */\n k[40] = s1, k[41] = s2, k[42] = s3, k[43] = s0;\n RotLeft128(s1, s2, s3, s0, 17); /* KA <<<111 */\n k[48] = s1, k[49] = s2, k[50] = s3, k[51] = s0;\n\n s0 = k[0], s1 = k[1], s2 = k[2], s3 = k[3];\n RotLeft128(s0, s1, s2, s3, 15); /* KL <<< 15 */\n k[8] = s0, k[9] = s1, k[10] = s2, k[11] = s3;\n RotLeft128(s0, s1, s2, s3, 30); /* KL <<< 45 */\n k[20] = s0, k[21] = s1, k[22] = s2, k[23] = s3;\n RotLeft128(s0, s1, s2, s3, 15); /* KL <<< 60 */\n k[26] = s2, k[27] = s3;\n RotLeft128(s0, s1, s2, s3, 17); /* KL <<< 77 */\n k[32] = s0, k[33] = s1, k[34] = s2, k[35] = s3;\n RotLeft128(s0, s1, s2, s3, 17); /* KL <<< 94 */\n k[36] = s0, k[37] = s1, k[38] = s2, k[39] = s3;\n RotLeft128(s0, s1, s2, s3, 17); /* KL <<<111 */\n k[44] = s0, k[45] = s1, k[46] = s2, k[47] = s3;\n\n return 3; /* grand rounds */\n } else {\n k[12] = s0, k[13] = s1, k[14] = s2, k[15] = s3;\n s0 ^= k[8], s1 ^= k[9], s2 ^= k[10], s3 ^= k[11];\n Camellia_Feistel(s0, s1, s2, s3, (SIGMA + 8));\n Camellia_Feistel(s2, s3, s0, s1, (SIGMA + 10));\n\n k[4] = s0, k[5] = s1, k[6] = s2, k[7] = s3;\n RotLeft128(s0, s1, s2, s3, 30); /* KB <<< 30 */\n k[20] = s0, k[21] = s1, k[22] = s2, k[23] = s3;\n RotLeft128(s0, s1, s2, s3, 30); /* KB <<< 60 */\n k[40] = s0, k[41] = s1, k[42] = s2, k[43] = s3;\n RotLeft128(s1, s2, s3, s0, 19); /* KB <<<111 */\n k[64] = s1, k[65] = s2, k[66] = s3, k[67] = s0;\n\n s0 = k[8], s1 = k[9], s2 = k[10], s3 = k[11];\n RotLeft128(s0, s1, s2, s3, 15); /* KR <<< 15 */\n k[8] = s0, k[9] = s1, k[10] = s2, k[11] = s3;\n RotLeft128(s0, s1, s2, s3, 15); /* KR <<< 30 */\n k[16] = s0, k[17] = s1, k[18] = s2, k[19] = s3;\n RotLeft128(s0, s1, s2, s3, 30); /* KR <<< 60 */\n k[36] = s0, k[37] = s1, k[38] = s2, k[39] = s3;\n RotLeft128(s1, s2, s3, s0, 2); /* KR <<< 94 */\n k[52] = s1, k[53] = s2, k[54] = s3, k[55] = s0;\n\n s0 = k[12], s1 = k[13], s2 = k[14], s3 = k[15];\n RotLeft128(s0, s1, s2, s3, 15); /* KA <<< 15 */\n k[12] = s0, k[13] = s1, k[14] = s2, k[15] = s3;\n RotLeft128(s0, s1, s2, s3, 30); /* KA <<< 45 */\n k[28] = s0, k[29] = s1, k[30] = s2, k[31] = s3;\n /* KA <<< 77 */\n k[48] = s1, k[49] = s2, k[50] = s3, k[51] = s0;\n RotLeft128(s1, s2, s3, s0, 17); /* KA <<< 94 */\n k[56] = s1, k[57] = s2, k[58] = s3, k[59] = s0;\n\n s0 = k[0], s1 = k[1], s2 = k[2], s3 = k[3];\n RotLeft128(s1, s2, s3, s0, 13); /* KL <<< 45 */\n k[24] = s1, k[25] = s2, k[26] = s3, k[27] = s0;\n RotLeft128(s1, s2, s3, s0, 15); /* KL <<< 60 */\n k[32] = s1, k[33] = s2, k[34] = s3, k[35] = s0;\n RotLeft128(s1, s2, s3, s0, 17); /* KL <<< 77 */\n k[44] = s1, k[45] = s2, k[46] = s3, k[47] = s0;\n RotLeft128(s2, s3, s0, s1, 2); /* KL <<<111 */\n k[60] = s2, k[61] = s3, k[62] = s0, k[63] = s1;\n\n return 4; /* grand rounds */\n }\n /*\n * It is possible to perform certain precalculations, which\n * would spare few cycles in block procedure. It's not done,\n * because it upsets the performance balance between key\n * setup and block procedures, negatively affecting overall\n * throughput in applications operating on short messages\n * and volatile keys.\n */\n}\n\nvoid Camellia_EncryptBlock_Rounds(int grandRounds, const u8 plaintext[],\n const KEY_TABLE_TYPE keyTable,\n u8 ciphertext[])\n{\n register u32 s0, s1, s2, s3;\n const u32 *k = keyTable, *kend = keyTable + grandRounds * 16;\n\n s0 = GETU32(plaintext) ^ k[0];\n s1 = GETU32(plaintext + 4) ^ k[1];\n s2 = GETU32(plaintext + 8) ^ k[2];\n s3 = GETU32(plaintext + 12) ^ k[3];\n k += 4;\n\n while (1) {\n /* Camellia makes 6 Feistel rounds */\n Camellia_Feistel(s0, s1, s2, s3, k + 0);\n Camellia_Feistel(s2, s3, s0, s1, k + 2);\n Camellia_Feistel(s0, s1, s2, s3, k + 4);\n Camellia_Feistel(s2, s3, s0, s1, k + 6);\n Camellia_Feistel(s0, s1, s2, s3, k + 8);\n Camellia_Feistel(s2, s3, s0, s1, k + 10);\n k += 12;\n\n if (k == kend)\n break;\n\n /*\n * This is the same function as the diffusion function D of the\n * accompanying documentation. See section 3.2 for properties of the\n * FLlayer function.\n */\n s1 ^= LeftRotate(s0 & k[0], 1);\n s2 ^= s3 | k[3];\n s0 ^= s1 | k[1];\n s3 ^= LeftRotate(s2 & k[2], 1);\n k += 4;\n }\n\n s2 ^= k[0], s3 ^= k[1], s0 ^= k[2], s1 ^= k[3];\n\n PUTU32(ciphertext, s2);\n PUTU32(ciphertext + 4, s3);\n PUTU32(ciphertext + 8, s0);\n PUTU32(ciphertext + 12, s1);\n}\n\nvoid Camellia_EncryptBlock(int keyBitLength, const u8 plaintext[],\n const KEY_TABLE_TYPE keyTable, u8 ciphertext[])\n{\n Camellia_EncryptBlock_Rounds(keyBitLength == 128 ? 3 : 4,\n plaintext, keyTable, ciphertext);\n}\n\nvoid Camellia_DecryptBlock_Rounds(int grandRounds, const u8 ciphertext[],\n const KEY_TABLE_TYPE keyTable,\n u8 plaintext[])\n{\n u32 s0, s1, s2, s3;\n const u32 *k = keyTable + grandRounds * 16, *kend = keyTable + 4;\n\n s0 = GETU32(ciphertext) ^ k[0];\n s1 = GETU32(ciphertext + 4) ^ k[1];\n s2 = GETU32(ciphertext + 8) ^ k[2];\n s3 = GETU32(ciphertext + 12) ^ k[3];\n\n while (1) {\n /* Camellia makes 6 Feistel rounds */\n k -= 12;\n Camellia_Feistel(s0, s1, s2, s3, k + 10);\n Camellia_Feistel(s2, s3, s0, s1, k + 8);\n Camellia_Feistel(s0, s1, s2, s3, k + 6);\n Camellia_Feistel(s2, s3, s0, s1, k + 4);\n Camellia_Feistel(s0, s1, s2, s3, k + 2);\n Camellia_Feistel(s2, s3, s0, s1, k + 0);\n\n if (k == kend)\n break;\n\n /*\n * This is the same function as the diffusion function D of the\n * accompanying documentation. See section 3.2 for properties of the\n * FLlayer function.\n */\n k -= 4;\n s1 ^= LeftRotate(s0 & k[2], 1);\n s2 ^= s3 | k[1];\n s0 ^= s1 | k[3];\n s3 ^= LeftRotate(s2 & k[0], 1);\n }\n\n k -= 4;\n s2 ^= k[0], s3 ^= k[1], s0 ^= k[2], s1 ^= k[3];\n\n PUTU32(plaintext, s2);\n PUTU32(plaintext + 4, s3);\n PUTU32(plaintext + 8, s0);\n PUTU32(plaintext + 12, s1);\n}\n\nvoid Camellia_DecryptBlock(int keyBitLength, const u8 plaintext[],\n const KEY_TABLE_TYPE keyTable, u8 ciphertext[])\n{\n Camellia_DecryptBlock_Rounds(keyBitLength == 128 ? 3 : 4,\n plaintext, keyTable, ciphertext);\n}\n" }, { "path": "cryptomini/camellia/cmll_local.h", "content": "/*\n * Copyright 2006-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/* ====================================================================\n * Copyright 2006 NTT (Nippon Telegraph and Telephone Corporation) .\n * ALL RIGHTS RESERVED.\n *\n * Intellectual Property information for Camellia:\n * http://info.isl.ntt.co.jp/crypt/eng/info/chiteki.html\n *\n * News Release for Announcement of Camellia open source:\n * http://www.ntt.co.jp/news/news06e/0604/060413a.html\n *\n * The Camellia Code included herein is developed by\n * NTT (Nippon Telegraph and Telephone Corporation), and is contributed\n * to the OpenSSL project.\n */\n\n#ifndef OSSL_CRYPTO_CAMELLIA_CMLL_LOCAL_H\n# define OSSL_CRYPTO_CAMELLIA_CMLL_LOCAL_H\n\ntypedef unsigned int u32;\ntypedef unsigned char u8;\n\nint Camellia_Ekeygen(int keyBitLength, const u8 *rawKey,\n KEY_TABLE_TYPE keyTable);\nvoid Camellia_EncryptBlock_Rounds(int grandRounds, const u8 plaintext[],\n const KEY_TABLE_TYPE keyTable,\n u8 ciphertext[]);\nvoid Camellia_DecryptBlock_Rounds(int grandRounds, const u8 ciphertext[],\n const KEY_TABLE_TYPE keyTable,\n u8 plaintext[]);\nvoid Camellia_EncryptBlock(int keyBitLength, const u8 plaintext[],\n const KEY_TABLE_TYPE keyTable, u8 ciphertext[]);\nvoid Camellia_DecryptBlock(int keyBitLength, const u8 ciphertext[],\n const KEY_TABLE_TYPE keyTable, u8 plaintext[]);\n#endif /* #ifndef OSSL_CRYPTO_CAMELLIA_CMLL_LOCAL_H */\n" }, { "path": "cryptomini/camellia/cmll_misc.c", "content": "/*\n * Copyright 2006-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \n#include \"cmll_local.h\"\n\nint Camellia_set_key(const unsigned char *userKey, const int bits,\n CAMELLIA_KEY *key)\n{\n if (!userKey || !key)\n return -1;\n if (bits != 128 && bits != 192 && bits != 256)\n return -2;\n key->grand_rounds = Camellia_Ekeygen(bits, userKey, key->u.rd_key);\n return 0;\n}\n\nvoid Camellia_encrypt(const unsigned char *in, unsigned char *out,\n const CAMELLIA_KEY *key)\n{\n Camellia_EncryptBlock_Rounds(key->grand_rounds, in, key->u.rd_key, out);\n}\n\nvoid Camellia_decrypt(const unsigned char *in, unsigned char *out,\n const CAMELLIA_KEY *key)\n{\n Camellia_DecryptBlock_Rounds(key->grand_rounds, in, key->u.rd_key, out);\n}\n" }, { "path": "cryptomini/cryptlib.c", "content": "/*\n * Copyright 1998-2019 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \"e_os.h\"\n#include \"crypto/cryptlib.h\"\n#include \n\n#if defined(__i386) || defined(__i386__) || defined(_M_IX86) || \\\n defined(__x86_64) || defined(__x86_64__) || \\\n defined(_M_AMD64) || defined(_M_X64)\n\nextern unsigned int OPENSSL_ia32cap_P[4];\n\n# if defined(OPENSSL_CPUID_OBJ) && !defined(OPENSSL_NO_ASM) && !defined(I386_ONLY)\n\n/*\n * Purpose of these minimalistic and character-type-agnostic subroutines\n * is to break dependency on MSVCRT (on Windows) and locale. This makes\n * OPENSSL_cpuid_setup safe to use as \"constructor\". \"Character-type-\n * agnostic\" means that they work with either wide or 8-bit characters,\n * exploiting the fact that first 127 characters can be simply casted\n * between the sets, while the rest would be simply rejected by ossl_is*\n * subroutines.\n */\n# ifdef _WIN32\ntypedef WCHAR variant_char;\n\nstatic variant_char *ossl_getenv(const char *name)\n{\n /*\n * Since we pull only one environment variable, it's simpler to\n * to just ignore |name| and use equivalent wide-char L-literal.\n * As well as to ignore excessively long values...\n */\n static WCHAR value[48];\n DWORD len = GetEnvironmentVariableW(L\"OPENSSL_ia32cap\", value, 48);\n\n return (len > 0 && len < 48) ? value : NULL;\n}\n# else\ntypedef char variant_char;\n# define ossl_getenv getenv\n# endif\n\n# include \"crypto/ctype.h\"\n\nstatic int todigit(variant_char c)\n{\n if (ossl_isdigit(c))\n return c - '0';\n else if (ossl_isxdigit(c))\n return ossl_tolower(c) - 'a' + 10;\n\n /* return largest base value to make caller terminate the loop */\n return 16;\n}\n\nstatic uint64_t ossl_strtouint64(const variant_char *str)\n{\n uint64_t ret = 0;\n unsigned int digit, base = 10;\n\n if (*str == '0') {\n base = 8, str++;\n if (ossl_tolower(*str) == 'x')\n base = 16, str++;\n }\n\n while((digit = todigit(*str++)) < base)\n ret = ret * base + digit;\n\n return ret;\n}\n\nstatic variant_char *ossl_strchr(const variant_char *str, char srch)\n{ variant_char c;\n\n while((c = *str)) {\n if (c == srch)\n\t return (variant_char *)str;\n str++;\n }\n\n return NULL;\n}\n\n# define OPENSSL_CPUID_SETUP\ntypedef uint64_t IA32CAP;\n\nvoid OPENSSL_cpuid_setup(void)\n{\n static int trigger = 0;\n IA32CAP OPENSSL_ia32_cpuid(unsigned int *);\n IA32CAP vec;\n const variant_char *env;\n\n if (trigger)\n return;\n\n trigger = 1;\n if ((env = ossl_getenv(\"OPENSSL_ia32cap\")) != NULL) {\n int off = (env[0] == '~') ? 1 : 0;\n\n vec = ossl_strtouint64(env + off);\n\n if (off) {\n IA32CAP mask = vec;\n vec = OPENSSL_ia32_cpuid(OPENSSL_ia32cap_P) & ~mask;\n if (mask & (1<<24)) {\n /*\n * User disables FXSR bit, mask even other capabilities\n * that operate exclusively on XMM, so we don't have to\n * double-check all the time. We mask PCLMULQDQ, AMD XOP,\n * AES-NI and AVX. Formally speaking we don't have to\n * do it in x86_64 case, but we can safely assume that\n * x86_64 users won't actually flip this flag.\n */\n vec &= ~((IA32CAP)(1<<1|1<<11|1<<25|1<<28) << 32);\n }\n } else if (env[0] == ':') {\n vec = OPENSSL_ia32_cpuid(OPENSSL_ia32cap_P);\n }\n\n if ((env = ossl_strchr(env, ':')) != NULL) {\n IA32CAP vecx;\n\n env++;\n off = (env[0] == '~') ? 1 : 0;\n vecx = ossl_strtouint64(env + off);\n if (off) {\n OPENSSL_ia32cap_P[2] &= ~(unsigned int)vecx;\n OPENSSL_ia32cap_P[3] &= ~(unsigned int)(vecx >> 32);\n } else {\n OPENSSL_ia32cap_P[2] = (unsigned int)vecx;\n OPENSSL_ia32cap_P[3] = (unsigned int)(vecx >> 32);\n }\n } else {\n OPENSSL_ia32cap_P[2] = 0;\n OPENSSL_ia32cap_P[3] = 0;\n }\n } else {\n vec = OPENSSL_ia32_cpuid(OPENSSL_ia32cap_P);\n }\n\n /*\n * |(1<<10) sets a reserved bit to signal that variable\n * was initialized already... This is to avoid interference\n * with cpuid snippets in ELF .init segment.\n */\n OPENSSL_ia32cap_P[0] = (unsigned int)vec | (1 << 10);\n OPENSSL_ia32cap_P[1] = (unsigned int)(vec >> 32);\n}\n# else\nunsigned int OPENSSL_ia32cap_P[4];\n# endif\n#endif\n#if !defined(OPENSSL_CPUID_SETUP) && !defined(OPENSSL_CPUID_OBJ)\nvoid OPENSSL_cpuid_setup(void)\n{\n}\n#endif\n\n#if defined(_WIN32)\n# include \n# include \n# ifdef __WATCOMC__\n# if defined(_UNICODE) || defined(__UNICODE__)\n# define _vsntprintf _vsnwprintf\n# else\n# define _vsntprintf _vsnprintf\n# endif\n# endif\n# ifdef _MSC_VER\n# define alloca _alloca\n# endif\n\n# if defined(_WIN32_WINNT) && _WIN32_WINNT>=0x0333\n# ifdef OPENSSL_SYS_WIN_CORE\n\nint OPENSSL_isservice(void)\n{\n /* OneCore API cannot interact with GUI */\n return 1;\n}\n# else\nint OPENSSL_isservice(void)\n{\n HWINSTA h;\n DWORD len;\n WCHAR *name;\n static union {\n void *p;\n FARPROC f;\n } _OPENSSL_isservice = {\n NULL\n };\n\n if (_OPENSSL_isservice.p == NULL) {\n HANDLE mod = GetModuleHandle(NULL);\n FARPROC f = NULL;\n\n if (mod != NULL)\n f = GetProcAddress(mod, \"_OPENSSL_isservice\");\n if (f == NULL)\n _OPENSSL_isservice.p = (void *)-1;\n else\n _OPENSSL_isservice.f = f;\n }\n\n if (_OPENSSL_isservice.p != (void *)-1)\n return (*_OPENSSL_isservice.f) ();\n\n h = GetProcessWindowStation();\n if (h == NULL)\n return -1;\n\n if (GetUserObjectInformationW(h, UOI_NAME, NULL, 0, &len) ||\n GetLastError() != ERROR_INSUFFICIENT_BUFFER)\n return -1;\n\n if (len > 512)\n return -1; /* paranoia */\n len++, len &= ~1; /* paranoia */\n name = (WCHAR *)alloca(len + sizeof(WCHAR));\n if (!GetUserObjectInformationW(h, UOI_NAME, name, len, &len))\n return -1;\n\n len++, len &= ~1; /* paranoia */\n name[len / sizeof(WCHAR)] = L'\\0'; /* paranoia */\n# if 1\n /*\n * This doesn't cover \"interactive\" services [working with real\n * WinSta0's] nor programs started non-interactively by Task Scheduler\n * [those are working with SAWinSta].\n */\n if (wcsstr(name, L\"Service-0x\"))\n return 1;\n# else\n /* This covers all non-interactive programs such as services. */\n if (!wcsstr(name, L\"WinSta0\"))\n return 1;\n# endif\n else\n return 0;\n}\n# endif\n# else\nint OPENSSL_isservice(void)\n{\n return 0;\n}\n# endif\n\nvoid OPENSSL_showfatal(const char *fmta, ...)\n{\n va_list ap;\n TCHAR buf[256];\n const TCHAR *fmt;\n /*\n * First check if it's a console application, in which case the\n * error message would be printed to standard error.\n * Windows CE does not have a concept of a console application,\n * so we need to guard the check.\n */\n# ifdef STD_ERROR_HANDLE\n HANDLE h;\n\n if ((h = GetStdHandle(STD_ERROR_HANDLE)) != NULL &&\n GetFileType(h) != FILE_TYPE_UNKNOWN) {\n /* must be console application */\n int len;\n DWORD out;\n\n va_start(ap, fmta);\n len = _vsnprintf((char *)buf, sizeof(buf), fmta, ap);\n WriteFile(h, buf, len < 0 ? sizeof(buf) : (DWORD) len, &out, NULL);\n va_end(ap);\n return;\n }\n# endif\n\n if (sizeof(TCHAR) == sizeof(char))\n fmt = (const TCHAR *)fmta;\n else\n do {\n int keepgoing;\n size_t len_0 = strlen(fmta) + 1, i;\n WCHAR *fmtw;\n\n fmtw = (WCHAR *)alloca(len_0 * sizeof(WCHAR));\n if (fmtw == NULL) {\n fmt = (const TCHAR *)L\"no stack?\";\n break;\n }\n if (!MultiByteToWideChar(CP_ACP, 0, fmta, len_0, fmtw, len_0))\n for (i = 0; i < len_0; i++)\n fmtw[i] = (WCHAR)fmta[i];\n for (i = 0; i < len_0; i++) {\n if (fmtw[i] == L'%')\n do {\n keepgoing = 0;\n switch (fmtw[i + 1]) {\n case L'0':\n case L'1':\n case L'2':\n case L'3':\n case L'4':\n case L'5':\n case L'6':\n case L'7':\n case L'8':\n case L'9':\n case L'.':\n case L'*':\n case L'-':\n i++;\n keepgoing = 1;\n break;\n case L's':\n fmtw[i + 1] = L'S';\n break;\n case L'S':\n fmtw[i + 1] = L's';\n break;\n case L'c':\n fmtw[i + 1] = L'C';\n break;\n case L'C':\n fmtw[i + 1] = L'c';\n break;\n }\n } while (keepgoing);\n }\n fmt = (const TCHAR *)fmtw;\n } while (0);\n\n va_start(ap, fmta);\n _vsntprintf(buf, OSSL_NELEM(buf) - 1, fmt, ap);\n buf[OSSL_NELEM(buf) - 1] = _T('\\0');\n va_end(ap);\n\n# if defined(_WIN32_WINNT) && _WIN32_WINNT>=0x0333\n# ifdef OPENSSL_SYS_WIN_CORE\n /* ONECORE is always NONGUI and NT >= 0x0601 */\n\n /*\n * TODO: (For non GUI and no std error cases)\n * Add event logging feature here.\n */\n\n# if !defined(NDEBUG)\n /*\n * We are in a situation where we tried to report a critical\n * error and this failed for some reason. As a last resort,\n * in debug builds, send output to the debugger or any other\n * tool like DebugView which can monitor the output.\n */\n OutputDebugString(buf);\n# endif\n# else\n /* this -------------v--- guards NT-specific calls */\n if (check_winnt() && OPENSSL_isservice() > 0) {\n HANDLE hEventLog = RegisterEventSource(NULL, _T(\"OpenSSL\"));\n\n if (hEventLog != NULL) {\n const TCHAR *pmsg = buf;\n\n if (!ReportEvent(hEventLog, EVENTLOG_ERROR_TYPE, 0, 0, NULL,\n 1, 0, &pmsg, NULL)) {\n# if !defined(NDEBUG)\n /*\n * We are in a situation where we tried to report a critical\n * error and this failed for some reason. As a last resort,\n * in debug builds, send output to the debugger or any other\n * tool like DebugView which can monitor the output.\n */\n OutputDebugString(pmsg);\n# endif\n }\n\n (void)DeregisterEventSource(hEventLog);\n }\n } else {\n MessageBox(NULL, buf, _T(\"OpenSSL: FATAL\"), MB_OK | MB_ICONERROR);\n }\n# endif\n# else\n MessageBox(NULL, buf, _T(\"OpenSSL: FATAL\"), MB_OK | MB_ICONERROR);\n# endif\n}\n#else\nvoid OPENSSL_showfatal(const char *fmta, ...)\n{\n#ifndef OPENSSL_NO_STDIO\n va_list ap;\n\n va_start(ap, fmta);\n vfprintf(stderr, fmta, ap);\n va_end(ap);\n#endif\n}\n\nint OPENSSL_isservice(void)\n{\n return 0;\n}\n#endif\n\nvoid OPENSSL_die(const char *message, const char *file, int line)\n{\n OPENSSL_showfatal(\"%s:%d: OpenSSL internal error: %s\\n\",\n file, line, message);\n#if !defined(_WIN32)\n abort();\n#else\n /*\n * Win32 abort() customarily shows a dialog, but we just did that...\n */\n# if !defined(_WIN32_WCE)\n raise(SIGABRT);\n# endif\n _exit(3);\n#endif\n}\n\n#if !defined(OPENSSL_CPUID_OBJ)\n/*\n * The volatile is used to to ensure that the compiler generates code that reads\n * all values from the array and doesn't try to optimize this away. The standard\n * doesn't actually require this behavior if the original data pointed to is\n * not volatile, but compilers do this in practice anyway.\n *\n * There are also assembler versions of this function.\n */\n# undef CRYPTO_memcmp\nint CRYPTO_memcmp(const void * in_a, const void * in_b, size_t len)\n{\n size_t i;\n const volatile unsigned char *a = in_a;\n const volatile unsigned char *b = in_b;\n unsigned char x = 0;\n\n for (i = 0; i < len; i++)\n x |= a[i] ^ b[i];\n\n return x;\n}\n\n/*\n * For systems that don't provide an instruction counter register or equivalent.\n */\nuint32_t OPENSSL_rdtsc(void)\n{\n return 0;\n}\n\nsize_t OPENSSL_instrument_bus(unsigned int *out, size_t cnt)\n{\n return 0;\n}\n\nsize_t OPENSSL_instrument_bus2(unsigned int *out, size_t cnt, size_t max)\n{\n return 0;\n}\n#endif\n" }, { "path": "cryptomini/e_os.h", "content": "/*\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_E_OS_H\n# define OSSL_E_OS_H\n\n# include \n# include \n\n# include \n# include \n# include \"internal/nelem.h\"\n\n/*\n * contains what we can justify to make visible to the\n * outside; this file e_os.h is not part of the exported interface.\n */\n\n# ifndef DEVRANDOM\n/*\n * set this to a comma-separated list of 'random' device files to try out. By\n * default, we will try to read at least one of these files\n */\n# define DEVRANDOM \"/dev/urandom\", \"/dev/random\", \"/dev/hwrng\", \"/dev/srandom\"\n# if defined(__linux) && !defined(__ANDROID__)\n# ifndef DEVRANDOM_WAIT\n# define DEVRANDOM_WAIT \"/dev/random\"\n# endif\n/*\n * Linux kernels 4.8 and later changes how their random device works and there\n * is no reliable way to tell that /dev/urandom has been seeded -- getentropy(2)\n * should be used instead.\n */\n# ifndef DEVRANDOM_SAFE_KERNEL\n# define DEVRANDOM_SAFE_KERNEL 4, 8\n# endif\n/*\n * Some operating systems do not permit select(2) on their random devices,\n * defining this to zero will force the use of read(2) to extract one byte\n * from /dev/random.\n */\n# ifndef DEVRANDM_WAIT_USE_SELECT\n# define DEVRANDM_WAIT_USE_SELECT 1\n# endif\n/*\n * Define the shared memory identifier used to indicate if the operating\n * system has properly seeded the DEVRANDOM source.\n */\n# ifndef OPENSSL_RAND_SEED_DEVRANDOM_SHM_ID\n# define OPENSSL_RAND_SEED_DEVRANDOM_SHM_ID 114\n# endif\n\n# endif\n# endif\n# if !defined(OPENSSL_NO_EGD) && !defined(DEVRANDOM_EGD)\n/*\n * set this to a comma-separated list of 'egd' sockets to try out. These\n * sockets will be tried in the order listed in case accessing the device\n * files listed in DEVRANDOM did not return enough randomness.\n */\n# define DEVRANDOM_EGD \"/var/run/egd-pool\", \"/dev/egd-pool\", \"/etc/egd-pool\", \"/etc/entropy\"\n# endif\n\n# if defined(OPENSSL_SYS_VXWORKS) || defined(OPENSSL_SYS_UEFI)\n# define NO_CHMOD\n# define NO_SYSLOG\n# endif\n\n# define get_last_sys_error() errno\n# define clear_sys_error() errno=0\n# define set_sys_error(e) errno=(e)\n\n/********************************************************************\n The Microsoft section\n ********************************************************************/\n# if defined(OPENSSL_SYS_WIN32) && !defined(WIN32)\n# define WIN32\n# endif\n# if defined(OPENSSL_SYS_WINDOWS) && !defined(WINDOWS)\n# define WINDOWS\n# endif\n# if defined(OPENSSL_SYS_MSDOS) && !defined(MSDOS)\n# define MSDOS\n# endif\n\n# ifdef WIN32\n# undef get_last_sys_error\n# undef clear_sys_error\n# undef set_sys_error\n# define get_last_sys_error() GetLastError()\n# define clear_sys_error() SetLastError(0)\n# define set_sys_error(e) SetLastError(e)\n# if !defined(WINNT)\n# define WIN_CONSOLE_BUG\n# endif\n# else\n# endif\n\n# if (defined(WINDOWS) || defined(MSDOS))\n\n# ifdef __DJGPP__\n# include \n# include \n# define _setmode setmode\n# define _O_TEXT O_TEXT\n# define _O_BINARY O_BINARY\n# define HAS_LFN_SUPPORT(name) (pathconf((name), _PC_NAME_MAX) > 12)\n# undef DEVRANDOM_EGD /* Neither MS-DOS nor FreeDOS provide 'egd' sockets. */\n# undef DEVRANDOM\n# define DEVRANDOM \"/dev/urandom\\x24\"\n# endif /* __DJGPP__ */\n\n# ifndef S_IFDIR\n# define S_IFDIR _S_IFDIR\n# endif\n\n# ifndef S_IFMT\n# define S_IFMT _S_IFMT\n# endif\n\n# if !defined(WINNT) && !defined(__DJGPP__)\n# define NO_SYSLOG\n# endif\n\n# ifdef WINDOWS\n# if !defined(_WIN32_WCE) && !defined(_WIN32_WINNT)\n /*\n * Defining _WIN32_WINNT here in e_os.h implies certain \"discipline.\"\n * Most notably we ought to check for availability of each specific\n * routine that was introduced after denoted _WIN32_WINNT with\n * GetProcAddress(). Normally newer functions are masked with higher\n * _WIN32_WINNT in SDK headers. So that if you wish to use them in\n * some module, you'd need to override _WIN32_WINNT definition in\n * the target module in order to \"reach for\" prototypes, but replace\n * calls to new functions with indirect calls. Alternatively it\n * might be possible to achieve the goal by /DELAYLOAD-ing .DLLs\n * and check for current OS version instead.\n */\n# define _WIN32_WINNT 0x0501\n# endif\n# if defined(_WIN32_WINNT) || defined(_WIN32_WCE)\n /*\n * Just like defining _WIN32_WINNT including winsock2.h implies\n * certain \"discipline\" for maintaining [broad] binary compatibility.\n * As long as structures are invariant among Winsock versions,\n * it's sufficient to check for specific Winsock2 API availability\n * at run-time [DSO_global_lookup is recommended]...\n */\n# include \n# include \n /* yes, they have to be #included prior to */\n# endif\n# include \n# include \n# include \n# include \n# if defined(_WIN32_WCE) && !defined(EACCES)\n# define EACCES 13\n# endif\n# include \n# ifdef _WIN64\n# define strlen(s) _strlen31(s)\n/* cut strings to 2GB */\nstatic __inline unsigned int _strlen31(const char *str)\n{\n unsigned int len = 0;\n while (*str && len < 0x80000000U)\n str++, len++;\n return len & 0x7FFFFFFF;\n}\n# endif\n# include \n# if defined(_MSC_VER) && !defined(_WIN32_WCE) && !defined(_DLL) && defined(stdin)\n# if _MSC_VER>=1300 && _MSC_VER<1600\n# undef stdin\n# undef stdout\n# undef stderr\nFILE *__iob_func();\n# define stdin (&__iob_func()[0])\n# define stdout (&__iob_func()[1])\n# define stderr (&__iob_func()[2])\n# elif _MSC_VER<1300 && defined(I_CAN_LIVE_WITH_LNK4049)\n# undef stdin\n# undef stdout\n# undef stderr\n /*\n * pre-1300 has __p__iob(), but it's available only in msvcrt.lib,\n * or in other words with /MD. Declaring implicit import, i.e. with\n * _imp_ prefix, works correctly with all compiler options, but\n * without /MD results in LINK warning LNK4049: 'locally defined\n * symbol \"__iob\" imported'.\n */\nextern FILE *_imp___iob;\n# define stdin (&_imp___iob[0])\n# define stdout (&_imp___iob[1])\n# define stderr (&_imp___iob[2])\n# endif\n# endif\n# endif\n# include \n# include \n\n# ifdef OPENSSL_SYS_WINCE\n# define OPENSSL_NO_POSIX_IO\n# endif\n\n# define EXIT(n) exit(n)\n# define LIST_SEPARATOR_CHAR ';'\n# ifndef W_OK\n# define W_OK 2\n# endif\n# ifndef R_OK\n# define R_OK 4\n# endif\n# ifdef OPENSSL_SYS_WINCE\n# define DEFAULT_HOME \"\"\n# else\n# define DEFAULT_HOME \"C:\"\n# endif\n\n/* Avoid Visual Studio 13 GetVersion deprecated problems */\n# if defined(_MSC_VER) && _MSC_VER>=1800\n# define check_winnt() (1)\n# define check_win_minplat(x) (1)\n# else\n# define check_winnt() (GetVersion() < 0x80000000)\n# define check_win_minplat(x) (LOBYTE(LOWORD(GetVersion())) >= (x))\n# endif\n\n# else /* The non-microsoft world */\n\n# if defined(OPENSSL_SYS_VXWORKS)\n# include \n# else\n# include \n# endif\n\n# ifdef OPENSSL_SYS_VMS\n# define VMS 1\n /*\n * some programs don't include stdlib, so exit() and others give implicit\n * function warnings\n */\n# include \n# if defined(__DECC)\n# include \n# else\n# include \n# endif\n# define LIST_SEPARATOR_CHAR ','\n /* We don't have any well-defined random devices on VMS, yet... */\n# undef DEVRANDOM\n /*-\n We need to do this since VMS has the following coding on status codes:\n\n Bits 0-2: status type: 0 = warning, 1 = success, 2 = error, 3 = info ...\n The important thing to know is that odd numbers are considered\n good, while even ones are considered errors.\n Bits 3-15: actual status number\n Bits 16-27: facility number. 0 is considered \"unknown\"\n Bits 28-31: control bits. If bit 28 is set, the shell won't try to\n output the message (which, for random codes, just looks ugly)\n\n So, what we do here is to change 0 to 1 to get the default success status,\n and everything else is shifted up to fit into the status number field, and\n the status is tagged as an error, which is what is wanted here.\n\n Finally, we add the VMS C facility code 0x35a000, because there are some\n programs, such as Perl, that will reinterpret the code back to something\n POSIX. 'man perlvms' explains it further.\n\n NOTE: the perlvms manual wants to turn all codes 2 to 255 into success\n codes (status type = 1). I couldn't disagree more. Fortunately, the\n status type doesn't seem to bother Perl.\n -- Richard Levitte\n */\n# define EXIT(n) exit((n) ? (((n) << 3) | 2 | 0x10000000 | 0x35a000) : 1)\n\n# define DEFAULT_HOME \"SYS$LOGIN:\"\n\n# else\n /* !defined VMS */\n# ifdef OPENSSL_UNISTD\n# include OPENSSL_UNISTD\n# else\n# include \n# endif\n# include \n# ifdef OPENSSL_SYS_WIN32_CYGWIN\n# include \n# include \n# endif\n\n# define LIST_SEPARATOR_CHAR ':'\n# define EXIT(n) exit(n)\n# endif\n\n# endif\n\n/***********************************************/\n\n# if defined(OPENSSL_SYS_WINDOWS)\n# define strcasecmp _stricmp\n# define strncasecmp _strnicmp\n# if (_MSC_VER >= 1310) && !defined(_WIN32_WCE)\n# define open _open\n# define fdopen _fdopen\n# define close _close\n# ifndef strdup\n# define strdup _strdup\n# endif\n# define unlink _unlink\n# define fileno _fileno\n# endif\n# else\n# include \n# endif\n\n/* vxworks */\n# if defined(OPENSSL_SYS_VXWORKS)\n# include \n# include \n# include \n# include \n# include \n# include \n\n# define TTY_STRUCT int\n# define sleep(a) taskDelay((a) * sysClkRateGet())\n\n/*\n * NOTE: these are implemented by helpers in database app! if the database is\n * not linked, we need to implement them elsewhere\n */\nstruct hostent *gethostbyname(const char *name);\nstruct hostent *gethostbyaddr(const char *addr, int length, int type);\nstruct servent *getservbyname(const char *name, const char *proto);\n\n# endif\n/* end vxworks */\n\n# ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION\n# define CRYPTO_memcmp memcmp\n# endif\n\n/* unistd.h defines _POSIX_VERSION */\n# if !defined(OPENSSL_NO_SECURE_MEMORY) && defined(OPENSSL_SYS_UNIX) \\\n && ( (defined(_POSIX_VERSION) && _POSIX_VERSION >= 200112L) \\\n || defined(__sun) || defined(__hpux) || defined(__sgi) \\\n || defined(__osf__) )\n# define OPENSSL_SECURE_MEMORY /* secure memory is implemented */\n# endif\n#endif\n" }, { "path": "cryptomini/ec/ec_cvt.c", "content": "/*\n * Copyright 2001-2018 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \"ec_local.h\"\n\nEC_GROUP *EC_GROUP_new_curve_GFp(const BIGNUM *p, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *ctx)\n{\n const EC_METHOD *meth;\n EC_GROUP *ret;\n\n#if defined(OPENSSL_BN_ASM_MONT)\n /*\n * This might appear controversial, but the fact is that generic\n * prime method was observed to deliver better performance even\n * for NIST primes on a range of platforms, e.g.: 60%-15%\n * improvement on IA-64, ~25% on ARM, 30%-90% on P4, 20%-25%\n * in 32-bit build and 35%--12% in 64-bit build on Core2...\n * Coefficients are relative to optimized bn_nist.c for most\n * intensive ECDSA verify and ECDH operations for 192- and 521-\n * bit keys respectively. Choice of these boundary values is\n * arguable, because the dependency of improvement coefficient\n * from key length is not a \"monotone\" curve. For example while\n * 571-bit result is 23% on ARM, 384-bit one is -1%. But it's\n * generally faster, sometimes \"respectfully\" faster, sometimes\n * \"tolerably\" slower... What effectively happens is that loop\n * with bn_mul_add_words is put against bn_mul_mont, and the\n * latter \"wins\" on short vectors. Correct solution should be\n * implementing dedicated NxN multiplication subroutines for\n * small N. But till it materializes, let's stick to generic\n * prime method...\n * \n */\n meth = EC_GFp_mont_method();\n#else\n if (BN_nist_mod_func(p))\n meth = EC_GFp_nist_method();\n else\n meth = EC_GFp_mont_method();\n#endif\n\n ret = EC_GROUP_new(meth);\n if (ret == NULL)\n return NULL;\n\n if (!EC_GROUP_set_curve(ret, p, a, b, ctx)) {\n EC_GROUP_clear_free(ret);\n return NULL;\n }\n\n return ret;\n}\n\n#ifndef OPENSSL_NO_EC2M\nEC_GROUP *EC_GROUP_new_curve_GF2m(const BIGNUM *p, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *ctx)\n{\n const EC_METHOD *meth;\n EC_GROUP *ret;\n\n meth = EC_GF2m_simple_method();\n\n ret = EC_GROUP_new(meth);\n if (ret == NULL)\n return NULL;\n\n if (!EC_GROUP_set_curve(ret, p, a, b, ctx)) {\n EC_GROUP_clear_free(ret);\n return NULL;\n }\n\n return ret;\n}\n#endif\n" }, { "path": "cryptomini/ec/ec_key.c", "content": "/*\n * Copyright 2002-2020 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \"internal/cryptlib.h\"\n#include \n#include \"ec_local.h\"\n#include \"internal/refcount.h\"\n#include \n#include \n#include \"crypto/bn.h\"\n\n// EC_KEY *EC_KEY_new(void)\n// {\n// return EC_KEY_new_method(NULL);\n// }\n\n// EC_KEY *EC_KEY_new_by_curve_name(int nid)\n// {\n// EC_KEY *ret = EC_KEY_new();\n// if (ret == NULL)\n// return NULL;\n// ret->group = EC_GROUP_new_by_curve_name(nid);\n// if (ret->group == NULL) {\n// EC_KEY_free(ret);\n// return NULL;\n// }\n// if (ret->meth->set_group != NULL\n// && ret->meth->set_group(ret, ret->group) == 0) {\n// EC_KEY_free(ret);\n// return NULL;\n// }\n// return ret;\n// }\n\n// void EC_KEY_free(EC_KEY *r)\n// {\n// int i;\n\n// if (r == NULL)\n// return;\n\n// CRYPTO_DOWN_REF(&r->references, &i, r->lock);\n// REF_PRINT_COUNT(\"EC_KEY\", r);\n// if (i > 0)\n// return;\n// REF_ASSERT_ISNT(i < 0);\n\n// if (r->meth != NULL && r->meth->finish != NULL)\n// r->meth->finish(r);\n\n// #ifndef OPENSSL_NO_ENGINE\n// ENGINE_finish(r->engine);\n// #endif\n\n// if (r->group && r->group->meth->keyfinish)\n// r->group->meth->keyfinish(r);\n\n// CRYPTO_free_ex_data(CRYPTO_EX_INDEX_EC_KEY, r, &r->ex_data);\n// CRYPTO_THREAD_lock_free(r->lock);\n// EC_GROUP_free(r->group);\n// EC_POINT_free(r->pub_key);\n// BN_clear_free(r->priv_key);\n\n// OPENSSL_clear_free((void *)r, sizeof(EC_KEY));\n// }\n\n// EC_KEY *EC_KEY_copy(EC_KEY *dest, const EC_KEY *src)\n// {\n// if (dest == NULL || src == NULL) {\n// ECerr(EC_F_EC_KEY_COPY, ERR_R_PASSED_NULL_PARAMETER);\n// return NULL;\n// }\n// if (src->meth != dest->meth) {\n// if (dest->meth->finish != NULL)\n// dest->meth->finish(dest);\n// if (dest->group && dest->group->meth->keyfinish)\n// dest->group->meth->keyfinish(dest);\n// #ifndef OPENSSL_NO_ENGINE\n// if (ENGINE_finish(dest->engine) == 0)\n// return 0;\n// dest->engine = NULL;\n// #endif\n// }\n// /* copy the parameters */\n// if (src->group != NULL) {\n// const EC_METHOD *meth = EC_GROUP_method_of(src->group);\n// /* clear the old group */\n// EC_GROUP_free(dest->group);\n// dest->group = EC_GROUP_new(meth);\n// if (dest->group == NULL)\n// return NULL;\n// if (!EC_GROUP_copy(dest->group, src->group))\n// return NULL;\n\n// /* copy the public key */\n// if (src->pub_key != NULL) {\n// EC_POINT_free(dest->pub_key);\n// dest->pub_key = EC_POINT_new(src->group);\n// if (dest->pub_key == NULL)\n// return NULL;\n// if (!EC_POINT_copy(dest->pub_key, src->pub_key))\n// return NULL;\n// }\n// /* copy the private key */\n// if (src->priv_key != NULL) {\n// if (dest->priv_key == NULL) {\n// dest->priv_key = BN_new();\n// if (dest->priv_key == NULL)\n// return NULL;\n// }\n// if (!BN_copy(dest->priv_key, src->priv_key))\n// return NULL;\n// if (src->group->meth->keycopy\n// && src->group->meth->keycopy(dest, src) == 0)\n// return NULL;\n// }\n// }\n\n\n// /* copy the rest */\n// dest->enc_flag = src->enc_flag;\n// dest->conv_form = src->conv_form;\n// dest->version = src->version;\n// dest->flags = src->flags;\n// if (!CRYPTO_dup_ex_data(CRYPTO_EX_INDEX_EC_KEY,\n// &dest->ex_data, &src->ex_data))\n// return NULL;\n\n// if (src->meth != dest->meth) {\n// #ifndef OPENSSL_NO_ENGINE\n// if (src->engine != NULL && ENGINE_init(src->engine) == 0)\n// return NULL;\n// dest->engine = src->engine;\n// #endif\n// dest->meth = src->meth;\n// }\n\n// if (src->meth->copy != NULL && src->meth->copy(dest, src) == 0)\n// return NULL;\n\n// return dest;\n// }\n\n// EC_KEY *EC_KEY_dup(const EC_KEY *ec_key)\n// {\n// EC_KEY *ret = EC_KEY_new_method(ec_key->engine);\n\n// if (ret == NULL)\n// return NULL;\n\n// if (EC_KEY_copy(ret, ec_key) == NULL) {\n// EC_KEY_free(ret);\n// return NULL;\n// }\n// return ret;\n// }\n\nint EC_KEY_up_ref(EC_KEY *r)\n{\n int i;\n\n if (CRYPTO_UP_REF(&r->references, &i, r->lock) <= 0)\n return 0;\n\n REF_PRINT_COUNT(\"EC_KEY\", r);\n REF_ASSERT_ISNT(i < 2);\n return ((i > 1) ? 1 : 0);\n}\n\nENGINE *EC_KEY_get0_engine(const EC_KEY *eckey)\n{\n return eckey->engine;\n}\n\nint EC_KEY_generate_key(EC_KEY *eckey)\n{\n if (eckey == NULL || eckey->group == NULL) {\n ECerr(EC_F_EC_KEY_GENERATE_KEY, ERR_R_PASSED_NULL_PARAMETER);\n return 0;\n }\n if (eckey->meth->keygen != NULL)\n return eckey->meth->keygen(eckey);\n ECerr(EC_F_EC_KEY_GENERATE_KEY, EC_R_OPERATION_NOT_SUPPORTED);\n return 0;\n}\n\nint ossl_ec_key_gen(EC_KEY *eckey)\n{\n return eckey->group->meth->keygen(eckey);\n}\n\nint ec_key_simple_generate_key(EC_KEY *eckey)\n{\n int ok = 0;\n BN_CTX *ctx = NULL;\n BIGNUM *priv_key = NULL;\n const BIGNUM *order = NULL;\n EC_POINT *pub_key = NULL;\n\n if ((ctx = BN_CTX_new()) == NULL)\n goto err;\n\n if (eckey->priv_key == NULL) {\n priv_key = BN_new();\n if (priv_key == NULL)\n goto err;\n } else\n priv_key = eckey->priv_key;\n\n order = EC_GROUP_get0_order(eckey->group);\n if (order == NULL)\n goto err;\n\n do\n if (!BN_priv_rand_range(priv_key, order))\n goto err;\n while (BN_is_zero(priv_key)) ;\n\n if (eckey->pub_key == NULL) {\n pub_key = EC_POINT_new(eckey->group);\n if (pub_key == NULL)\n goto err;\n } else\n pub_key = eckey->pub_key;\n\n if (!EC_POINT_mul(eckey->group, pub_key, priv_key, NULL, NULL, ctx))\n goto err;\n\n eckey->priv_key = priv_key;\n eckey->pub_key = pub_key;\n\n ok = 1;\n\n err:\n if (eckey->pub_key == NULL)\n EC_POINT_free(pub_key);\n if (eckey->priv_key != priv_key)\n BN_free(priv_key);\n BN_CTX_free(ctx);\n return ok;\n}\n\nint ec_key_simple_generate_public_key(EC_KEY *eckey)\n{\n return EC_POINT_mul(eckey->group, eckey->pub_key, eckey->priv_key, NULL,\n NULL, NULL);\n}\n\nint EC_KEY_check_key(const EC_KEY *eckey)\n{\n if (eckey == NULL || eckey->group == NULL || eckey->pub_key == NULL) {\n ECerr(EC_F_EC_KEY_CHECK_KEY, ERR_R_PASSED_NULL_PARAMETER);\n return 0;\n }\n\n if (eckey->group->meth->keycheck == NULL) {\n ECerr(EC_F_EC_KEY_CHECK_KEY, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n\n return eckey->group->meth->keycheck(eckey);\n}\n\nint ec_key_simple_check_key(const EC_KEY *eckey)\n{\n int ok = 0;\n BN_CTX *ctx = NULL;\n const BIGNUM *order = NULL;\n EC_POINT *point = NULL;\n\n if (eckey == NULL || eckey->group == NULL || eckey->pub_key == NULL) {\n ECerr(EC_F_EC_KEY_SIMPLE_CHECK_KEY, ERR_R_PASSED_NULL_PARAMETER);\n return 0;\n }\n\n if (EC_POINT_is_at_infinity(eckey->group, eckey->pub_key)) {\n ECerr(EC_F_EC_KEY_SIMPLE_CHECK_KEY, EC_R_POINT_AT_INFINITY);\n goto err;\n }\n\n if ((ctx = BN_CTX_new()) == NULL)\n goto err;\n if ((point = EC_POINT_new(eckey->group)) == NULL)\n goto err;\n\n /* testing whether the pub_key is on the elliptic curve */\n if (EC_POINT_is_on_curve(eckey->group, eckey->pub_key, ctx) <= 0) {\n ECerr(EC_F_EC_KEY_SIMPLE_CHECK_KEY, EC_R_POINT_IS_NOT_ON_CURVE);\n goto err;\n }\n /* testing whether pub_key * order is the point at infinity */\n order = eckey->group->order;\n if (BN_is_zero(order)) {\n ECerr(EC_F_EC_KEY_SIMPLE_CHECK_KEY, EC_R_INVALID_GROUP_ORDER);\n goto err;\n }\n if (!EC_POINT_mul(eckey->group, point, NULL, eckey->pub_key, order, ctx)) {\n ECerr(EC_F_EC_KEY_SIMPLE_CHECK_KEY, ERR_R_EC_LIB);\n goto err;\n }\n if (!EC_POINT_is_at_infinity(eckey->group, point)) {\n ECerr(EC_F_EC_KEY_SIMPLE_CHECK_KEY, EC_R_WRONG_ORDER);\n goto err;\n }\n /*\n * in case the priv_key is present : check if generator * priv_key ==\n * pub_key\n */\n if (eckey->priv_key != NULL) {\n if (BN_cmp(eckey->priv_key, order) >= 0) {\n ECerr(EC_F_EC_KEY_SIMPLE_CHECK_KEY, EC_R_WRONG_ORDER);\n goto err;\n }\n if (!EC_POINT_mul(eckey->group, point, eckey->priv_key,\n NULL, NULL, ctx)) {\n ECerr(EC_F_EC_KEY_SIMPLE_CHECK_KEY, ERR_R_EC_LIB);\n goto err;\n }\n if (EC_POINT_cmp(eckey->group, point, eckey->pub_key, ctx) != 0) {\n ECerr(EC_F_EC_KEY_SIMPLE_CHECK_KEY, EC_R_INVALID_PRIVATE_KEY);\n goto err;\n }\n }\n ok = 1;\n err:\n BN_CTX_free(ctx);\n EC_POINT_free(point);\n return ok;\n}\n\nint EC_KEY_set_public_key_affine_coordinates(EC_KEY *key, BIGNUM *x,\n BIGNUM *y)\n{\n BN_CTX *ctx = NULL;\n BIGNUM *tx, *ty;\n EC_POINT *point = NULL;\n int ok = 0;\n\n if (key == NULL || key->group == NULL || x == NULL || y == NULL) {\n ECerr(EC_F_EC_KEY_SET_PUBLIC_KEY_AFFINE_COORDINATES,\n ERR_R_PASSED_NULL_PARAMETER);\n return 0;\n }\n ctx = BN_CTX_new();\n if (ctx == NULL)\n return 0;\n\n BN_CTX_start(ctx);\n point = EC_POINT_new(key->group);\n\n if (point == NULL)\n goto err;\n\n tx = BN_CTX_get(ctx);\n ty = BN_CTX_get(ctx);\n if (ty == NULL)\n goto err;\n\n if (!EC_POINT_set_affine_coordinates(key->group, point, x, y, ctx))\n goto err;\n if (!EC_POINT_get_affine_coordinates(key->group, point, tx, ty, ctx))\n goto err;\n\n /*\n * Check if retrieved coordinates match originals and are less than field\n * order: if not values are out of range.\n */\n if (BN_cmp(x, tx) || BN_cmp(y, ty)\n || (BN_cmp(x, key->group->field) >= 0)\n || (BN_cmp(y, key->group->field) >= 0)) {\n ECerr(EC_F_EC_KEY_SET_PUBLIC_KEY_AFFINE_COORDINATES,\n EC_R_COORDINATES_OUT_OF_RANGE);\n goto err;\n }\n\n if (!EC_KEY_set_public_key(key, point))\n goto err;\n\n if (EC_KEY_check_key(key) == 0)\n goto err;\n\n ok = 1;\n\n err:\n BN_CTX_end(ctx);\n BN_CTX_free(ctx);\n EC_POINT_free(point);\n return ok;\n\n}\n\nconst EC_GROUP *EC_KEY_get0_group(const EC_KEY *key)\n{\n return key->group;\n}\n\nint EC_KEY_set_group(EC_KEY *key, const EC_GROUP *group)\n{\n if (key->meth->set_group != NULL && key->meth->set_group(key, group) == 0)\n return 0;\n EC_GROUP_free(key->group);\n key->group = EC_GROUP_dup(group);\n return (key->group == NULL) ? 0 : 1;\n}\n\nconst BIGNUM *EC_KEY_get0_private_key(const EC_KEY *key)\n{\n return key->priv_key;\n}\n\nint EC_KEY_set_private_key(EC_KEY *key, const BIGNUM *priv_key)\n{\n int fixed_top;\n const BIGNUM *order = NULL;\n BIGNUM *tmp_key = NULL;\n\n if (key->group == NULL || key->group->meth == NULL)\n return 0;\n\n /*\n * Not only should key->group be set, but it should also be in a valid\n * fully initialized state.\n *\n * Specifically, to operate in constant time, we need that the group order\n * is set, as we use its length as the fixed public size of any scalar used\n * as an EC private key.\n */\n order = EC_GROUP_get0_order(key->group);\n if (order == NULL || BN_is_zero(order))\n return 0; /* This should never happen */\n\n if (key->group->meth->set_private != NULL\n && key->group->meth->set_private(key, priv_key) == 0)\n return 0;\n if (key->meth->set_private != NULL\n && key->meth->set_private(key, priv_key) == 0)\n return 0;\n\n /*\n * We should never leak the bit length of the secret scalar in the key,\n * so we always set the `BN_FLG_CONSTTIME` flag on the internal `BIGNUM`\n * holding the secret scalar.\n *\n * This is important also because `BN_dup()` (and `BN_copy()`) do not\n * propagate the `BN_FLG_CONSTTIME` flag from the source `BIGNUM`, and\n * this brings an extra risk of inadvertently losing the flag, even when\n * the caller specifically set it.\n *\n * The propagation has been turned on and off a few times in the past\n * years because in some conditions has shown unintended consequences in\n * some code paths, so at the moment we can't fix this in the BN layer.\n *\n * In `EC_KEY_set_private_key()` we can work around the propagation by\n * manually setting the flag after `BN_dup()` as we know for sure that\n * inside the EC module the `BN_FLG_CONSTTIME` is always treated\n * correctly and should not generate unintended consequences.\n *\n * Setting the BN_FLG_CONSTTIME flag alone is never enough, we also have\n * to preallocate the BIGNUM internal buffer to a fixed public size big\n * enough that operations performed during the processing never trigger\n * a realloc which would leak the size of the scalar through memory\n * accesses.\n *\n * Fixed Length\n * ------------\n *\n * The order of the large prime subgroup of the curve is our choice for\n * a fixed public size, as that is generally the upper bound for\n * generating a private key in EC cryptosystems and should fit all valid\n * secret scalars.\n *\n * For preallocating the BIGNUM storage we look at the number of \"words\"\n * required for the internal representation of the order, and we\n * preallocate 2 extra \"words\" in case any of the subsequent processing\n * might temporarily overflow the order length.\n */\n tmp_key = BN_dup(priv_key);\n if (tmp_key == NULL)\n return 0;\n\n BN_set_flags(tmp_key, BN_FLG_CONSTTIME);\n\n fixed_top = bn_get_top(order) + 2;\n if (bn_wexpand(tmp_key, fixed_top) == NULL) {\n BN_clear_free(tmp_key);\n return 0;\n }\n\n BN_clear_free(key->priv_key);\n key->priv_key = tmp_key;\n\n return 1;\n}\n\nconst EC_POINT *EC_KEY_get0_public_key(const EC_KEY *key)\n{\n return key->pub_key;\n}\n\nint EC_KEY_set_public_key(EC_KEY *key, const EC_POINT *pub_key)\n{\n if (key->meth->set_public != NULL\n && key->meth->set_public(key, pub_key) == 0)\n return 0;\n EC_POINT_free(key->pub_key);\n key->pub_key = EC_POINT_dup(pub_key, key->group);\n return (key->pub_key == NULL) ? 0 : 1;\n}\n\nunsigned int EC_KEY_get_enc_flags(const EC_KEY *key)\n{\n return key->enc_flag;\n}\n\nvoid EC_KEY_set_enc_flags(EC_KEY *key, unsigned int flags)\n{\n key->enc_flag = flags;\n}\n\npoint_conversion_form_t EC_KEY_get_conv_form(const EC_KEY *key)\n{\n return key->conv_form;\n}\n\nvoid EC_KEY_set_conv_form(EC_KEY *key, point_conversion_form_t cform)\n{\n key->conv_form = cform;\n if (key->group != NULL)\n EC_GROUP_set_point_conversion_form(key->group, cform);\n}\n\nvoid EC_KEY_set_asn1_flag(EC_KEY *key, int flag)\n{\n if (key->group != NULL)\n EC_GROUP_set_asn1_flag(key->group, flag);\n}\n\nint EC_KEY_precompute_mult(EC_KEY *key, BN_CTX *ctx)\n{\n if (key->group == NULL)\n return 0;\n return EC_GROUP_precompute_mult(key->group, ctx);\n}\n\nint EC_KEY_get_flags(const EC_KEY *key)\n{\n return key->flags;\n}\n\nvoid EC_KEY_set_flags(EC_KEY *key, int flags)\n{\n key->flags |= flags;\n}\n\nvoid EC_KEY_clear_flags(EC_KEY *key, int flags)\n{\n key->flags &= ~flags;\n}\n\nint EC_KEY_decoded_from_explicit_params(const EC_KEY *key)\n{\n if (key == NULL || key->group == NULL)\n return -1;\n return key->group->decoded_from_explicit_params;\n}\n\n// size_t EC_KEY_key2buf(const EC_KEY *key, point_conversion_form_t form,\n// unsigned char **pbuf, BN_CTX *ctx)\n// {\n// if (key == NULL || key->pub_key == NULL || key->group == NULL)\n// return 0;\n// return EC_POINT_point2buf(key->group, key->pub_key, form, pbuf, ctx);\n// }\n\n// int EC_KEY_oct2key(EC_KEY *key, const unsigned char *buf, size_t len,\n// BN_CTX *ctx)\n// {\n// if (key == NULL || key->group == NULL)\n// return 0;\n// if (key->pub_key == NULL)\n// key->pub_key = EC_POINT_new(key->group);\n// if (key->pub_key == NULL)\n// return 0;\n// if (EC_POINT_oct2point(key->group, key->pub_key, buf, len, ctx) == 0)\n// return 0;\n// /*\n// * Save the point conversion form.\n// * For non-custom curves the first octet of the buffer (excluding\n// * the last significant bit) contains the point conversion form.\n// * EC_POINT_oct2point() has already performed sanity checking of\n// * the buffer so we know it is valid.\n// */\n// if ((key->group->meth->flags & EC_FLAGS_CUSTOM_CURVE) == 0)\n// key->conv_form = (point_conversion_form_t)(buf[0] & ~0x01);\n// return 1;\n// }\n\nsize_t EC_KEY_priv2oct(const EC_KEY *eckey,\n unsigned char *buf, size_t len)\n{\n if (eckey->group == NULL || eckey->group->meth == NULL)\n return 0;\n if (eckey->group->meth->priv2oct == NULL) {\n ECerr(EC_F_EC_KEY_PRIV2OCT, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n\n return eckey->group->meth->priv2oct(eckey, buf, len);\n}\n\nsize_t ec_key_simple_priv2oct(const EC_KEY *eckey,\n unsigned char *buf, size_t len)\n{\n size_t buf_len;\n\n buf_len = (EC_GROUP_order_bits(eckey->group) + 7) / 8;\n if (eckey->priv_key == NULL)\n return 0;\n if (buf == NULL)\n return buf_len;\n else if (len < buf_len)\n return 0;\n\n /* Octetstring may need leading zeros if BN is to short */\n\n if (BN_bn2binpad(eckey->priv_key, buf, buf_len) == -1) {\n ECerr(EC_F_EC_KEY_SIMPLE_PRIV2OCT, EC_R_BUFFER_TOO_SMALL);\n return 0;\n }\n\n return buf_len;\n}\n\nint EC_KEY_oct2priv(EC_KEY *eckey, const unsigned char *buf, size_t len)\n{\n if (eckey->group == NULL || eckey->group->meth == NULL)\n return 0;\n if (eckey->group->meth->oct2priv == NULL) {\n ECerr(EC_F_EC_KEY_OCT2PRIV, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n return eckey->group->meth->oct2priv(eckey, buf, len);\n}\n\nint ec_key_simple_oct2priv(EC_KEY *eckey, const unsigned char *buf, size_t len)\n{\n if (eckey->priv_key == NULL)\n eckey->priv_key = BN_secure_new();\n if (eckey->priv_key == NULL) {\n ECerr(EC_F_EC_KEY_SIMPLE_OCT2PRIV, ERR_R_MALLOC_FAILURE);\n return 0;\n }\n eckey->priv_key = BN_bin2bn(buf, len, eckey->priv_key);\n if (eckey->priv_key == NULL) {\n ECerr(EC_F_EC_KEY_SIMPLE_OCT2PRIV, ERR_R_BN_LIB);\n return 0;\n }\n return 1;\n}\n\nsize_t EC_KEY_priv2buf(const EC_KEY *eckey, unsigned char **pbuf)\n{\n size_t len;\n unsigned char *buf;\n\n len = EC_KEY_priv2oct(eckey, NULL, 0);\n if (len == 0)\n return 0;\n if ((buf = OPENSSL_malloc(len)) == NULL) {\n ECerr(EC_F_EC_KEY_PRIV2BUF, ERR_R_MALLOC_FAILURE);\n return 0;\n }\n len = EC_KEY_priv2oct(eckey, buf, len);\n if (len == 0) {\n OPENSSL_free(buf);\n return 0;\n }\n *pbuf = buf;\n return len;\n}\n\nint EC_KEY_can_sign(const EC_KEY *eckey)\n{\n if (eckey->group == NULL || eckey->group->meth == NULL\n || (eckey->group->meth->flags & EC_FLAGS_NO_SIGN))\n return 0;\n return 1;\n}\n" }, { "path": "cryptomini/ec/ec_lib.c", "content": "/*\n * Copyright 2001-2020 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\n#include \n#include \n\n#include \"ec_local.h\"\n\n/* functions for EC_GROUP objects */\n\nEC_GROUP *EC_GROUP_new(const EC_METHOD *meth)\n{\n EC_GROUP *ret;\n\n if (meth == NULL) {\n ECerr(EC_F_EC_GROUP_NEW, EC_R_SLOT_FULL);\n return NULL;\n }\n if (meth->group_init == 0) {\n ECerr(EC_F_EC_GROUP_NEW, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return NULL;\n }\n\n ret = OPENSSL_zalloc(sizeof(*ret));\n if (ret == NULL) {\n ECerr(EC_F_EC_GROUP_NEW, ERR_R_MALLOC_FAILURE);\n return NULL;\n }\n\n ret->meth = meth;\n if ((ret->meth->flags & EC_FLAGS_CUSTOM_CURVE) == 0) {\n ret->order = BN_new();\n if (ret->order == NULL)\n goto err;\n ret->cofactor = BN_new();\n if (ret->cofactor == NULL)\n goto err;\n }\n ret->asn1_flag = OPENSSL_EC_NAMED_CURVE;\n ret->asn1_form = POINT_CONVERSION_UNCOMPRESSED;\n if (!meth->group_init(ret))\n goto err;\n return ret;\n\n err:\n BN_free(ret->order);\n BN_free(ret->cofactor);\n OPENSSL_free(ret);\n return NULL;\n}\n\nvoid EC_pre_comp_free(EC_GROUP *group)\n{\n switch (group->pre_comp_type) {\n case PCT_none:\n break;\n case PCT_nistz256:\n#ifdef ECP_NISTZ256_ASM\n EC_nistz256_pre_comp_free(group->pre_comp.nistz256);\n#endif\n break;\n#ifndef OPENSSL_NO_EC_NISTP_64_GCC_128\n case PCT_nistp224:\n EC_nistp224_pre_comp_free(group->pre_comp.nistp224);\n break;\n case PCT_nistp256:\n EC_nistp256_pre_comp_free(group->pre_comp.nistp256);\n break;\n case PCT_nistp521:\n EC_nistp521_pre_comp_free(group->pre_comp.nistp521);\n break;\n#else\n case PCT_nistp224:\n case PCT_nistp256:\n case PCT_nistp521:\n break;\n#endif\n case PCT_ec:\n EC_ec_pre_comp_free(group->pre_comp.ec);\n break;\n }\n group->pre_comp.ec = NULL;\n}\n\nvoid EC_GROUP_free(EC_GROUP *group)\n{\n if (!group)\n return;\n\n if (group->meth->group_finish != 0)\n group->meth->group_finish(group);\n\n EC_pre_comp_free(group);\n BN_MONT_CTX_free(group->mont_data);\n EC_POINT_free(group->generator);\n BN_free(group->order);\n BN_free(group->cofactor);\n OPENSSL_free(group->seed);\n OPENSSL_free(group);\n}\n\nvoid EC_GROUP_clear_free(EC_GROUP *group)\n{\n if (!group)\n return;\n\n if (group->meth->group_clear_finish != 0)\n group->meth->group_clear_finish(group);\n else if (group->meth->group_finish != 0)\n group->meth->group_finish(group);\n\n EC_pre_comp_free(group);\n BN_MONT_CTX_free(group->mont_data);\n EC_POINT_clear_free(group->generator);\n BN_clear_free(group->order);\n BN_clear_free(group->cofactor);\n OPENSSL_clear_free(group->seed, group->seed_len);\n OPENSSL_clear_free(group, sizeof(*group));\n}\n\nint EC_GROUP_copy(EC_GROUP *dest, const EC_GROUP *src)\n{\n if (dest->meth->group_copy == 0) {\n ECerr(EC_F_EC_GROUP_COPY, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n if (dest->meth != src->meth) {\n ECerr(EC_F_EC_GROUP_COPY, EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n if (dest == src)\n return 1;\n\n dest->curve_name = src->curve_name;\n\n /* Copy precomputed */\n dest->pre_comp_type = src->pre_comp_type;\n switch (src->pre_comp_type) {\n case PCT_none:\n dest->pre_comp.ec = NULL;\n break;\n case PCT_nistz256:\n#ifdef ECP_NISTZ256_ASM\n dest->pre_comp.nistz256 = EC_nistz256_pre_comp_dup(src->pre_comp.nistz256);\n#endif\n break;\n#ifndef OPENSSL_NO_EC_NISTP_64_GCC_128\n case PCT_nistp224:\n dest->pre_comp.nistp224 = EC_nistp224_pre_comp_dup(src->pre_comp.nistp224);\n break;\n case PCT_nistp256:\n dest->pre_comp.nistp256 = EC_nistp256_pre_comp_dup(src->pre_comp.nistp256);\n break;\n case PCT_nistp521:\n dest->pre_comp.nistp521 = EC_nistp521_pre_comp_dup(src->pre_comp.nistp521);\n break;\n#else\n case PCT_nistp224:\n case PCT_nistp256:\n case PCT_nistp521:\n break;\n#endif\n case PCT_ec:\n dest->pre_comp.ec = EC_ec_pre_comp_dup(src->pre_comp.ec);\n break;\n }\n\n if (src->mont_data != NULL) {\n if (dest->mont_data == NULL) {\n dest->mont_data = BN_MONT_CTX_new();\n if (dest->mont_data == NULL)\n return 0;\n }\n if (!BN_MONT_CTX_copy(dest->mont_data, src->mont_data))\n return 0;\n } else {\n /* src->generator == NULL */\n BN_MONT_CTX_free(dest->mont_data);\n dest->mont_data = NULL;\n }\n\n if (src->generator != NULL) {\n if (dest->generator == NULL) {\n dest->generator = EC_POINT_new(dest);\n if (dest->generator == NULL)\n return 0;\n }\n if (!EC_POINT_copy(dest->generator, src->generator))\n return 0;\n } else {\n /* src->generator == NULL */\n EC_POINT_clear_free(dest->generator);\n dest->generator = NULL;\n }\n\n if ((src->meth->flags & EC_FLAGS_CUSTOM_CURVE) == 0) {\n if (!BN_copy(dest->order, src->order))\n return 0;\n if (!BN_copy(dest->cofactor, src->cofactor))\n return 0;\n }\n\n dest->asn1_flag = src->asn1_flag;\n dest->asn1_form = src->asn1_form;\n dest->decoded_from_explicit_params = src->decoded_from_explicit_params;\n\n if (src->seed) {\n OPENSSL_free(dest->seed);\n if ((dest->seed = OPENSSL_malloc(src->seed_len)) == NULL) {\n ECerr(EC_F_EC_GROUP_COPY, ERR_R_MALLOC_FAILURE);\n return 0;\n }\n if (!memcpy(dest->seed, src->seed, src->seed_len))\n return 0;\n dest->seed_len = src->seed_len;\n } else {\n OPENSSL_free(dest->seed);\n dest->seed = NULL;\n dest->seed_len = 0;\n }\n\n return dest->meth->group_copy(dest, src);\n}\n\nEC_GROUP *EC_GROUP_dup(const EC_GROUP *a)\n{\n EC_GROUP *t = NULL;\n int ok = 0;\n\n if (a == NULL)\n return NULL;\n\n if ((t = EC_GROUP_new(a->meth)) == NULL)\n return NULL;\n if (!EC_GROUP_copy(t, a))\n goto err;\n\n ok = 1;\n\n err:\n if (!ok) {\n EC_GROUP_free(t);\n return NULL;\n }\n return t;\n}\n\nconst EC_METHOD *EC_GROUP_method_of(const EC_GROUP *group)\n{\n return group->meth;\n}\n\nint EC_METHOD_get_field_type(const EC_METHOD *meth)\n{\n return meth->field_type;\n}\n\nstatic int ec_precompute_mont_data(EC_GROUP *);\n\n/*-\n * Try computing cofactor from the generator order (n) and field cardinality (q).\n * This works for all curves of cryptographic interest.\n *\n * Hasse thm: q + 1 - 2*sqrt(q) <= n*h <= q + 1 + 2*sqrt(q)\n * h_min = (q + 1 - 2*sqrt(q))/n\n * h_max = (q + 1 + 2*sqrt(q))/n\n * h_max - h_min = 4*sqrt(q)/n\n * So if n > 4*sqrt(q) holds, there is only one possible value for h:\n * h = \\lfloor (h_min + h_max)/2 \\rceil = \\lfloor (q + 1)/n \\rceil\n *\n * Otherwise, zero cofactor and return success.\n */\nstatic int ec_guess_cofactor(EC_GROUP *group) {\n int ret = 0;\n BN_CTX *ctx = NULL;\n BIGNUM *q = NULL;\n\n /*-\n * If the cofactor is too large, we cannot guess it.\n * The RHS of below is a strict overestimate of lg(4 * sqrt(q))\n */\n if (BN_num_bits(group->order) <= (BN_num_bits(group->field) + 1) / 2 + 3) {\n /* default to 0 */\n BN_zero(group->cofactor);\n /* return success */\n return 1;\n }\n\n if ((ctx = BN_CTX_new()) == NULL)\n return 0;\n\n BN_CTX_start(ctx);\n if ((q = BN_CTX_get(ctx)) == NULL)\n goto err;\n\n /* set q = 2**m for binary fields; q = p otherwise */\n if (group->meth->field_type == NID_X9_62_characteristic_two_field) {\n BN_zero(q);\n if (!BN_set_bit(q, BN_num_bits(group->field) - 1))\n goto err;\n } else {\n if (!BN_copy(q, group->field))\n goto err;\n }\n\n /* compute h = \\lfloor (q + 1)/n \\rceil = \\lfloor (q + 1 + n/2)/n \\rfloor */\n if (!BN_rshift1(group->cofactor, group->order) /* n/2 */\n || !BN_add(group->cofactor, group->cofactor, q) /* q + n/2 */\n /* q + 1 + n/2 */\n || !BN_add(group->cofactor, group->cofactor, BN_value_one())\n /* (q + 1 + n/2)/n */\n || !BN_div(group->cofactor, NULL, group->cofactor, group->order, ctx))\n goto err;\n ret = 1;\n err:\n BN_CTX_end(ctx);\n BN_CTX_free(ctx);\n return ret;\n}\n\nint EC_GROUP_set_generator(EC_GROUP *group, const EC_POINT *generator,\n const BIGNUM *order, const BIGNUM *cofactor)\n{\n if (generator == NULL) {\n ECerr(EC_F_EC_GROUP_SET_GENERATOR, ERR_R_PASSED_NULL_PARAMETER);\n return 0;\n }\n\n /* require group->field >= 1 */\n if (group->field == NULL || BN_is_zero(group->field)\n || BN_is_negative(group->field)) {\n ECerr(EC_F_EC_GROUP_SET_GENERATOR, EC_R_INVALID_FIELD);\n return 0;\n }\n\n /*-\n * - require order >= 1\n * - enforce upper bound due to Hasse thm: order can be no more than one bit\n * longer than field cardinality\n */\n if (order == NULL || BN_is_zero(order) || BN_is_negative(order)\n || BN_num_bits(order) > BN_num_bits(group->field) + 1) {\n ECerr(EC_F_EC_GROUP_SET_GENERATOR, EC_R_INVALID_GROUP_ORDER);\n return 0;\n }\n\n /*-\n * Unfortunately the cofactor is an optional field in many standards.\n * Internally, the lib uses 0 cofactor as a marker for \"unknown cofactor\".\n * So accept cofactor == NULL or cofactor >= 0.\n */\n if (cofactor != NULL && BN_is_negative(cofactor)) {\n ECerr(EC_F_EC_GROUP_SET_GENERATOR, EC_R_UNKNOWN_COFACTOR);\n return 0;\n }\n\n if (group->generator == NULL) {\n group->generator = EC_POINT_new(group);\n if (group->generator == NULL)\n return 0;\n }\n if (!EC_POINT_copy(group->generator, generator))\n return 0;\n\n if (!BN_copy(group->order, order))\n return 0;\n\n /* Either take the provided positive cofactor, or try to compute it */\n if (cofactor != NULL && !BN_is_zero(cofactor)) {\n if (!BN_copy(group->cofactor, cofactor))\n return 0;\n } else if (!ec_guess_cofactor(group)) {\n BN_zero(group->cofactor);\n return 0;\n }\n\n /*\n * Some groups have an order with\n * factors of two, which makes the Montgomery setup fail.\n * |group->mont_data| will be NULL in this case.\n */\n if (BN_is_odd(group->order)) {\n return ec_precompute_mont_data(group);\n }\n\n BN_MONT_CTX_free(group->mont_data);\n group->mont_data = NULL;\n return 1;\n}\n\nconst EC_POINT *EC_GROUP_get0_generator(const EC_GROUP *group)\n{\n return group->generator;\n}\n\nBN_MONT_CTX *EC_GROUP_get_mont_data(const EC_GROUP *group)\n{\n return group->mont_data;\n}\n\nint EC_GROUP_get_order(const EC_GROUP *group, BIGNUM *order, BN_CTX *ctx)\n{\n if (group->order == NULL)\n return 0;\n if (!BN_copy(order, group->order))\n return 0;\n\n return !BN_is_zero(order);\n}\n\nconst BIGNUM *EC_GROUP_get0_order(const EC_GROUP *group)\n{\n return group->order;\n}\n\nint EC_GROUP_order_bits(const EC_GROUP *group)\n{\n return group->meth->group_order_bits(group);\n}\n\nint EC_GROUP_get_cofactor(const EC_GROUP *group, BIGNUM *cofactor,\n BN_CTX *ctx)\n{\n\n if (group->cofactor == NULL)\n return 0;\n if (!BN_copy(cofactor, group->cofactor))\n return 0;\n\n return !BN_is_zero(group->cofactor);\n}\n\nconst BIGNUM *EC_GROUP_get0_cofactor(const EC_GROUP *group)\n{\n return group->cofactor;\n}\n\nvoid EC_GROUP_set_curve_name(EC_GROUP *group, int nid)\n{\n group->curve_name = nid;\n}\n\nint EC_GROUP_get_curve_name(const EC_GROUP *group)\n{\n return group->curve_name;\n}\n\nvoid EC_GROUP_set_asn1_flag(EC_GROUP *group, int flag)\n{\n group->asn1_flag = flag;\n}\n\nint EC_GROUP_get_asn1_flag(const EC_GROUP *group)\n{\n return group->asn1_flag;\n}\n\nvoid EC_GROUP_set_point_conversion_form(EC_GROUP *group,\n point_conversion_form_t form)\n{\n group->asn1_form = form;\n}\n\npoint_conversion_form_t EC_GROUP_get_point_conversion_form(const EC_GROUP\n *group)\n{\n return group->asn1_form;\n}\n\nsize_t EC_GROUP_set_seed(EC_GROUP *group, const unsigned char *p, size_t len)\n{\n OPENSSL_free(group->seed);\n group->seed = NULL;\n group->seed_len = 0;\n\n if (!len || !p)\n return 1;\n\n if ((group->seed = OPENSSL_malloc(len)) == NULL) {\n ECerr(EC_F_EC_GROUP_SET_SEED, ERR_R_MALLOC_FAILURE);\n return 0;\n }\n memcpy(group->seed, p, len);\n group->seed_len = len;\n\n return len;\n}\n\nunsigned char *EC_GROUP_get0_seed(const EC_GROUP *group)\n{\n return group->seed;\n}\n\nsize_t EC_GROUP_get_seed_len(const EC_GROUP *group)\n{\n return group->seed_len;\n}\n\nint EC_GROUP_set_curve(EC_GROUP *group, const BIGNUM *p, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *ctx)\n{\n if (group->meth->group_set_curve == 0) {\n ECerr(EC_F_EC_GROUP_SET_CURVE, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n return group->meth->group_set_curve(group, p, a, b, ctx);\n}\n\nint EC_GROUP_get_curve(const EC_GROUP *group, BIGNUM *p, BIGNUM *a, BIGNUM *b,\n BN_CTX *ctx)\n{\n if (group->meth->group_get_curve == NULL) {\n ECerr(EC_F_EC_GROUP_GET_CURVE, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n return group->meth->group_get_curve(group, p, a, b, ctx);\n}\n\n#if OPENSSL_API_COMPAT < 0x10200000L\nint EC_GROUP_set_curve_GFp(EC_GROUP *group, const BIGNUM *p, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *ctx)\n{\n return EC_GROUP_set_curve(group, p, a, b, ctx);\n}\n\nint EC_GROUP_get_curve_GFp(const EC_GROUP *group, BIGNUM *p, BIGNUM *a,\n BIGNUM *b, BN_CTX *ctx)\n{\n return EC_GROUP_get_curve(group, p, a, b, ctx);\n}\n\n# ifndef OPENSSL_NO_EC2M\nint EC_GROUP_set_curve_GF2m(EC_GROUP *group, const BIGNUM *p, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *ctx)\n{\n return EC_GROUP_set_curve(group, p, a, b, ctx);\n}\n\nint EC_GROUP_get_curve_GF2m(const EC_GROUP *group, BIGNUM *p, BIGNUM *a,\n BIGNUM *b, BN_CTX *ctx)\n{\n return EC_GROUP_get_curve(group, p, a, b, ctx);\n}\n# endif\n#endif\n\nint EC_GROUP_get_degree(const EC_GROUP *group)\n{\n if (group->meth->group_get_degree == 0) {\n ECerr(EC_F_EC_GROUP_GET_DEGREE, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n return group->meth->group_get_degree(group);\n}\n\nint EC_GROUP_check_discriminant(const EC_GROUP *group, BN_CTX *ctx)\n{\n if (group->meth->group_check_discriminant == 0) {\n ECerr(EC_F_EC_GROUP_CHECK_DISCRIMINANT,\n ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n return group->meth->group_check_discriminant(group, ctx);\n}\n\nint EC_GROUP_cmp(const EC_GROUP *a, const EC_GROUP *b, BN_CTX *ctx)\n{\n int r = 0;\n BIGNUM *a1, *a2, *a3, *b1, *b2, *b3;\n BN_CTX *ctx_new = NULL;\n\n /* compare the field types */\n if (EC_METHOD_get_field_type(EC_GROUP_method_of(a)) !=\n EC_METHOD_get_field_type(EC_GROUP_method_of(b)))\n return 1;\n /* compare the curve name (if present in both) */\n if (EC_GROUP_get_curve_name(a) && EC_GROUP_get_curve_name(b) &&\n EC_GROUP_get_curve_name(a) != EC_GROUP_get_curve_name(b))\n return 1;\n if (a->meth->flags & EC_FLAGS_CUSTOM_CURVE)\n return 0;\n\n if (ctx == NULL)\n ctx_new = ctx = BN_CTX_new();\n if (ctx == NULL)\n return -1;\n\n BN_CTX_start(ctx);\n a1 = BN_CTX_get(ctx);\n a2 = BN_CTX_get(ctx);\n a3 = BN_CTX_get(ctx);\n b1 = BN_CTX_get(ctx);\n b2 = BN_CTX_get(ctx);\n b3 = BN_CTX_get(ctx);\n if (b3 == NULL) {\n BN_CTX_end(ctx);\n BN_CTX_free(ctx_new);\n return -1;\n }\n\n /*\n * XXX This approach assumes that the external representation of curves\n * over the same field type is the same.\n */\n if (!a->meth->group_get_curve(a, a1, a2, a3, ctx) ||\n !b->meth->group_get_curve(b, b1, b2, b3, ctx))\n r = 1;\n\n if (r || BN_cmp(a1, b1) || BN_cmp(a2, b2) || BN_cmp(a3, b3))\n r = 1;\n\n /* XXX EC_POINT_cmp() assumes that the methods are equal */\n if (r || EC_POINT_cmp(a, EC_GROUP_get0_generator(a),\n EC_GROUP_get0_generator(b), ctx))\n r = 1;\n\n if (!r) {\n const BIGNUM *ao, *bo, *ac, *bc;\n /* compare the order and cofactor */\n ao = EC_GROUP_get0_order(a);\n bo = EC_GROUP_get0_order(b);\n ac = EC_GROUP_get0_cofactor(a);\n bc = EC_GROUP_get0_cofactor(b);\n if (ao == NULL || bo == NULL) {\n BN_CTX_end(ctx);\n BN_CTX_free(ctx_new);\n return -1;\n }\n if (BN_cmp(ao, bo) || BN_cmp(ac, bc))\n r = 1;\n }\n\n BN_CTX_end(ctx);\n BN_CTX_free(ctx_new);\n\n return r;\n}\n\n/* functions for EC_POINT objects */\n\nEC_POINT *EC_POINT_new(const EC_GROUP *group)\n{\n EC_POINT *ret;\n\n if (group == NULL) {\n ECerr(EC_F_EC_POINT_NEW, ERR_R_PASSED_NULL_PARAMETER);\n return NULL;\n }\n if (group->meth->point_init == NULL) {\n ECerr(EC_F_EC_POINT_NEW, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return NULL;\n }\n\n ret = OPENSSL_zalloc(sizeof(*ret));\n if (ret == NULL) {\n ECerr(EC_F_EC_POINT_NEW, ERR_R_MALLOC_FAILURE);\n return NULL;\n }\n\n ret->meth = group->meth;\n ret->curve_name = group->curve_name;\n\n if (!ret->meth->point_init(ret)) {\n OPENSSL_free(ret);\n return NULL;\n }\n\n return ret;\n}\n\nvoid EC_POINT_free(EC_POINT *point)\n{\n if (!point)\n return;\n\n if (point->meth->point_finish != 0)\n point->meth->point_finish(point);\n OPENSSL_free(point);\n}\n\nvoid EC_POINT_clear_free(EC_POINT *point)\n{\n if (!point)\n return;\n\n if (point->meth->point_clear_finish != 0)\n point->meth->point_clear_finish(point);\n else if (point->meth->point_finish != 0)\n point->meth->point_finish(point);\n OPENSSL_clear_free(point, sizeof(*point));\n}\n\nint EC_POINT_copy(EC_POINT *dest, const EC_POINT *src)\n{\n if (dest->meth->point_copy == 0) {\n ECerr(EC_F_EC_POINT_COPY, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n if (dest->meth != src->meth\n || (dest->curve_name != src->curve_name\n && dest->curve_name != 0\n && src->curve_name != 0)) {\n ECerr(EC_F_EC_POINT_COPY, EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n if (dest == src)\n return 1;\n return dest->meth->point_copy(dest, src);\n}\n\nEC_POINT *EC_POINT_dup(const EC_POINT *a, const EC_GROUP *group)\n{\n EC_POINT *t;\n int r;\n\n if (a == NULL)\n return NULL;\n\n t = EC_POINT_new(group);\n if (t == NULL)\n return NULL;\n r = EC_POINT_copy(t, a);\n if (!r) {\n EC_POINT_free(t);\n return NULL;\n }\n return t;\n}\n\nconst EC_METHOD *EC_POINT_method_of(const EC_POINT *point)\n{\n return point->meth;\n}\n\nint EC_POINT_set_to_infinity(const EC_GROUP *group, EC_POINT *point)\n{\n if (group->meth->point_set_to_infinity == 0) {\n ECerr(EC_F_EC_POINT_SET_TO_INFINITY,\n ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n if (group->meth != point->meth) {\n ECerr(EC_F_EC_POINT_SET_TO_INFINITY, EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n return group->meth->point_set_to_infinity(group, point);\n}\n\nint EC_POINT_set_Jprojective_coordinates_GFp(const EC_GROUP *group,\n EC_POINT *point, const BIGNUM *x,\n const BIGNUM *y, const BIGNUM *z,\n BN_CTX *ctx)\n{\n if (group->meth->point_set_Jprojective_coordinates_GFp == 0) {\n ECerr(EC_F_EC_POINT_SET_JPROJECTIVE_COORDINATES_GFP,\n ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n if (!ec_point_is_compat(point, group)) {\n ECerr(EC_F_EC_POINT_SET_JPROJECTIVE_COORDINATES_GFP,\n EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n return group->meth->point_set_Jprojective_coordinates_GFp(group, point, x,\n y, z, ctx);\n}\n\nint EC_POINT_get_Jprojective_coordinates_GFp(const EC_GROUP *group,\n const EC_POINT *point, BIGNUM *x,\n BIGNUM *y, BIGNUM *z,\n BN_CTX *ctx)\n{\n if (group->meth->point_get_Jprojective_coordinates_GFp == 0) {\n ECerr(EC_F_EC_POINT_GET_JPROJECTIVE_COORDINATES_GFP,\n ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n if (!ec_point_is_compat(point, group)) {\n ECerr(EC_F_EC_POINT_GET_JPROJECTIVE_COORDINATES_GFP,\n EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n return group->meth->point_get_Jprojective_coordinates_GFp(group, point, x,\n y, z, ctx);\n}\n\nint EC_POINT_set_affine_coordinates(const EC_GROUP *group, EC_POINT *point,\n const BIGNUM *x, const BIGNUM *y,\n BN_CTX *ctx)\n{\n if (group->meth->point_set_affine_coordinates == NULL) {\n ECerr(EC_F_EC_POINT_SET_AFFINE_COORDINATES,\n ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n if (!ec_point_is_compat(point, group)) {\n ECerr(EC_F_EC_POINT_SET_AFFINE_COORDINATES, EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n if (!group->meth->point_set_affine_coordinates(group, point, x, y, ctx))\n return 0;\n\n if (EC_POINT_is_on_curve(group, point, ctx) <= 0) {\n ECerr(EC_F_EC_POINT_SET_AFFINE_COORDINATES, EC_R_POINT_IS_NOT_ON_CURVE);\n return 0;\n }\n return 1;\n}\n\n#if OPENSSL_API_COMPAT < 0x10200000L\nint EC_POINT_set_affine_coordinates_GFp(const EC_GROUP *group,\n EC_POINT *point, const BIGNUM *x,\n const BIGNUM *y, BN_CTX *ctx)\n{\n return EC_POINT_set_affine_coordinates(group, point, x, y, ctx);\n}\n\n# ifndef OPENSSL_NO_EC2M\nint EC_POINT_set_affine_coordinates_GF2m(const EC_GROUP *group,\n EC_POINT *point, const BIGNUM *x,\n const BIGNUM *y, BN_CTX *ctx)\n{\n return EC_POINT_set_affine_coordinates(group, point, x, y, ctx);\n}\n# endif\n#endif\n\nint EC_POINT_get_affine_coordinates(const EC_GROUP *group,\n const EC_POINT *point, BIGNUM *x, BIGNUM *y,\n BN_CTX *ctx)\n{\n if (group->meth->point_get_affine_coordinates == NULL) {\n ECerr(EC_F_EC_POINT_GET_AFFINE_COORDINATES,\n ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n if (!ec_point_is_compat(point, group)) {\n ECerr(EC_F_EC_POINT_GET_AFFINE_COORDINATES, EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n if (EC_POINT_is_at_infinity(group, point)) {\n ECerr(EC_F_EC_POINT_GET_AFFINE_COORDINATES, EC_R_POINT_AT_INFINITY);\n return 0;\n }\n return group->meth->point_get_affine_coordinates(group, point, x, y, ctx);\n}\n\n#if OPENSSL_API_COMPAT < 0x10200000L\nint EC_POINT_get_affine_coordinates_GFp(const EC_GROUP *group,\n const EC_POINT *point, BIGNUM *x,\n BIGNUM *y, BN_CTX *ctx)\n{\n return EC_POINT_get_affine_coordinates(group, point, x, y, ctx);\n}\n\n# ifndef OPENSSL_NO_EC2M\nint EC_POINT_get_affine_coordinates_GF2m(const EC_GROUP *group,\n const EC_POINT *point, BIGNUM *x,\n BIGNUM *y, BN_CTX *ctx)\n{\n return EC_POINT_get_affine_coordinates(group, point, x, y, ctx);\n}\n# endif\n#endif\n\nint EC_POINT_add(const EC_GROUP *group, EC_POINT *r, const EC_POINT *a,\n const EC_POINT *b, BN_CTX *ctx)\n{\n if (group->meth->add == 0) {\n ECerr(EC_F_EC_POINT_ADD, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n if (!ec_point_is_compat(r, group) || !ec_point_is_compat(a, group)\n || !ec_point_is_compat(b, group)) {\n ECerr(EC_F_EC_POINT_ADD, EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n return group->meth->add(group, r, a, b, ctx);\n}\n\nint EC_POINT_dbl(const EC_GROUP *group, EC_POINT *r, const EC_POINT *a,\n BN_CTX *ctx)\n{\n if (group->meth->dbl == 0) {\n ECerr(EC_F_EC_POINT_DBL, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n if (!ec_point_is_compat(r, group) || !ec_point_is_compat(a, group)) {\n ECerr(EC_F_EC_POINT_DBL, EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n return group->meth->dbl(group, r, a, ctx);\n}\n\nint EC_POINT_invert(const EC_GROUP *group, EC_POINT *a, BN_CTX *ctx)\n{\n if (group->meth->invert == 0) {\n ECerr(EC_F_EC_POINT_INVERT, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n if (!ec_point_is_compat(a, group)) {\n ECerr(EC_F_EC_POINT_INVERT, EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n return group->meth->invert(group, a, ctx);\n}\n\nint EC_POINT_is_at_infinity(const EC_GROUP *group, const EC_POINT *point)\n{\n if (group->meth->is_at_infinity == 0) {\n ECerr(EC_F_EC_POINT_IS_AT_INFINITY,\n ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n if (!ec_point_is_compat(point, group)) {\n ECerr(EC_F_EC_POINT_IS_AT_INFINITY, EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n return group->meth->is_at_infinity(group, point);\n}\n\n/*\n * Check whether an EC_POINT is on the curve or not. Note that the return\n * value for this function should NOT be treated as a boolean. Return values:\n * 1: The point is on the curve\n * 0: The point is not on the curve\n * -1: An error occurred\n */\nint EC_POINT_is_on_curve(const EC_GROUP *group, const EC_POINT *point,\n BN_CTX *ctx)\n{\n if (group->meth->is_on_curve == 0) {\n ECerr(EC_F_EC_POINT_IS_ON_CURVE, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n if (!ec_point_is_compat(point, group)) {\n ECerr(EC_F_EC_POINT_IS_ON_CURVE, EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n return group->meth->is_on_curve(group, point, ctx);\n}\n\nint EC_POINT_cmp(const EC_GROUP *group, const EC_POINT *a, const EC_POINT *b,\n BN_CTX *ctx)\n{\n if (group->meth->point_cmp == 0) {\n ECerr(EC_F_EC_POINT_CMP, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return -1;\n }\n if (!ec_point_is_compat(a, group) || !ec_point_is_compat(b, group)) {\n ECerr(EC_F_EC_POINT_CMP, EC_R_INCOMPATIBLE_OBJECTS);\n return -1;\n }\n return group->meth->point_cmp(group, a, b, ctx);\n}\n\nint EC_POINT_make_affine(const EC_GROUP *group, EC_POINT *point, BN_CTX *ctx)\n{\n if (group->meth->make_affine == 0) {\n ECerr(EC_F_EC_POINT_MAKE_AFFINE, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n if (!ec_point_is_compat(point, group)) {\n ECerr(EC_F_EC_POINT_MAKE_AFFINE, EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n return group->meth->make_affine(group, point, ctx);\n}\n\nint EC_POINTs_make_affine(const EC_GROUP *group, size_t num,\n EC_POINT *points[], BN_CTX *ctx)\n{\n size_t i;\n\n if (group->meth->points_make_affine == 0) {\n ECerr(EC_F_EC_POINTS_MAKE_AFFINE, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);\n return 0;\n }\n for (i = 0; i < num; i++) {\n if (!ec_point_is_compat(points[i], group)) {\n ECerr(EC_F_EC_POINTS_MAKE_AFFINE, EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n }\n return group->meth->points_make_affine(group, num, points, ctx);\n}\n\n/*\n * Functions for point multiplication. If group->meth->mul is 0, we use the\n * wNAF-based implementations in ec_mult.c; otherwise we dispatch through\n * methods.\n */\n\nint EC_POINTs_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *scalar,\n size_t num, const EC_POINT *points[],\n const BIGNUM *scalars[], BN_CTX *ctx)\n{\n int ret = 0;\n size_t i = 0;\n BN_CTX *new_ctx = NULL;\n\n if (!ec_point_is_compat(r, group)) {\n ECerr(EC_F_EC_POINTS_MUL, EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n\n if (scalar == NULL && num == 0)\n return EC_POINT_set_to_infinity(group, r);\n\n for (i = 0; i < num; i++) {\n if (!ec_point_is_compat(points[i], group)) {\n ECerr(EC_F_EC_POINTS_MUL, EC_R_INCOMPATIBLE_OBJECTS);\n return 0;\n }\n }\n\n if (ctx == NULL && (ctx = new_ctx = BN_CTX_secure_new()) == NULL) {\n ECerr(EC_F_EC_POINTS_MUL, ERR_R_INTERNAL_ERROR);\n return 0;\n }\n\n if (group->meth->mul != NULL)\n ret = group->meth->mul(group, r, scalar, num, points, scalars, ctx);\n else\n /* use default */\n ret = ec_wNAF_mul(group, r, scalar, num, points, scalars, ctx);\n\n BN_CTX_free(new_ctx);\n return ret;\n}\n\nint EC_POINT_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *g_scalar,\n const EC_POINT *point, const BIGNUM *p_scalar, BN_CTX *ctx)\n{\n /* just a convenient interface to EC_POINTs_mul() */\n\n const EC_POINT *points[1];\n const BIGNUM *scalars[1];\n\n points[0] = point;\n scalars[0] = p_scalar;\n\n return EC_POINTs_mul(group, r, g_scalar,\n (point != NULL\n && p_scalar != NULL), points, scalars, ctx);\n}\n\nint EC_GROUP_precompute_mult(EC_GROUP *group, BN_CTX *ctx)\n{\n if (group->meth->mul == 0)\n /* use default */\n return ec_wNAF_precompute_mult(group, ctx);\n\n if (group->meth->precompute_mult != 0)\n return group->meth->precompute_mult(group, ctx);\n else\n return 1; /* nothing to do, so report success */\n}\n\nint EC_GROUP_have_precompute_mult(const EC_GROUP *group)\n{\n if (group->meth->mul == 0)\n /* use default */\n return ec_wNAF_have_precompute_mult(group);\n\n if (group->meth->have_precompute_mult != 0)\n return group->meth->have_precompute_mult(group);\n else\n return 0; /* cannot tell whether precomputation has\n * been performed */\n}\n\n/*\n * ec_precompute_mont_data sets |group->mont_data| from |group->order| and\n * returns one on success. On error it returns zero.\n */\nstatic int ec_precompute_mont_data(EC_GROUP *group)\n{\n BN_CTX *ctx = BN_CTX_new();\n int ret = 0;\n\n BN_MONT_CTX_free(group->mont_data);\n group->mont_data = NULL;\n\n if (ctx == NULL)\n goto err;\n\n group->mont_data = BN_MONT_CTX_new();\n if (group->mont_data == NULL)\n goto err;\n\n if (!BN_MONT_CTX_set(group->mont_data, group->order, ctx)) {\n BN_MONT_CTX_free(group->mont_data);\n group->mont_data = NULL;\n goto err;\n }\n\n ret = 1;\n\n err:\n\n BN_CTX_free(ctx);\n return ret;\n}\n\n// int EC_KEY_set_ex_data(EC_KEY *key, int idx, void *arg)\n// {\n// return CRYPTO_set_ex_data(&key->ex_data, idx, arg);\n// }\n\n// void *EC_KEY_get_ex_data(const EC_KEY *key, int idx)\n// {\n// return CRYPTO_get_ex_data(&key->ex_data, idx);\n// }\n\nint ec_group_simple_order_bits(const EC_GROUP *group)\n{\n if (group->order == NULL)\n return 0;\n return BN_num_bits(group->order);\n}\n\nstatic int ec_field_inverse_mod_ord(const EC_GROUP *group, BIGNUM *r,\n const BIGNUM *x, BN_CTX *ctx)\n{\n BIGNUM *e = NULL;\n BN_CTX *new_ctx = NULL;\n int ret = 0;\n\n if (group->mont_data == NULL)\n return 0;\n\n if (ctx == NULL && (ctx = new_ctx = BN_CTX_secure_new()) == NULL)\n return 0;\n\n BN_CTX_start(ctx);\n if ((e = BN_CTX_get(ctx)) == NULL)\n goto err;\n\n /*-\n * We want inverse in constant time, therefore we utilize the fact\n * order must be prime and use Fermats Little Theorem instead.\n */\n if (!BN_set_word(e, 2))\n goto err;\n if (!BN_sub(e, group->order, e))\n goto err;\n /*-\n * Exponent e is public.\n * No need for scatter-gather or BN_FLG_CONSTTIME.\n */\n if (!BN_mod_exp_mont(r, x, e, group->order, ctx, group->mont_data))\n goto err;\n\n ret = 1;\n\n err:\n BN_CTX_end(ctx);\n BN_CTX_free(new_ctx);\n return ret;\n}\n\n/*-\n * Default behavior, if group->meth->field_inverse_mod_ord is NULL:\n * - When group->order is even, this function returns an error.\n * - When group->order is otherwise composite, the correctness\n * of the output is not guaranteed.\n * - When x is outside the range [1, group->order), the correctness\n * of the output is not guaranteed.\n * - Otherwise, this function returns the multiplicative inverse in the\n * range [1, group->order).\n *\n * EC_METHODs must implement their own field_inverse_mod_ord for\n * other functionality.\n */\nint ec_group_do_inverse_ord(const EC_GROUP *group, BIGNUM *res,\n const BIGNUM *x, BN_CTX *ctx)\n{\n if (group->meth->field_inverse_mod_ord != NULL)\n return group->meth->field_inverse_mod_ord(group, res, x, ctx);\n else\n return ec_field_inverse_mod_ord(group, res, x, ctx);\n}\n\n/*-\n * Coordinate blinding for EC_POINT.\n *\n * The underlying EC_METHOD can optionally implement this function:\n * underlying implementations should return 0 on errors, or 1 on\n * success.\n *\n * This wrapper returns 1 in case the underlying EC_METHOD does not\n * support coordinate blinding.\n */\nint ec_point_blind_coordinates(const EC_GROUP *group, EC_POINT *p, BN_CTX *ctx)\n{\n if (group->meth->blind_coordinates == NULL)\n return 1; /* ignore if not implemented */\n\n return group->meth->blind_coordinates(group, p, ctx);\n}\n" }, { "path": "cryptomini/ec/ec_local.h", "content": "/*\n * Copyright 2001-2020 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\n#include \n#include \n#include \n#include \"internal/refcount.h\"\n#include \"crypto/ec.h\"\n\n#if defined(__SUNPRO_C)\n# if __SUNPRO_C >= 0x520\n# pragma error_messages (off,E_ARRAY_OF_INCOMPLETE_NONAME,E_ARRAY_OF_INCOMPLETE)\n# endif\n#endif\n\n/* Use default functions for poin2oct, oct2point and compressed coordinates */\n#define EC_FLAGS_DEFAULT_OCT 0x1\n\n/* Use custom formats for EC_GROUP, EC_POINT and EC_KEY */\n#define EC_FLAGS_CUSTOM_CURVE 0x2\n\n/* Curve does not support signing operations */\n#define EC_FLAGS_NO_SIGN 0x4\n\n/*\n * Structure details are not part of the exported interface, so all this may\n * change in future versions.\n */\n\nstruct ec_method_st {\n /* Various method flags */\n int flags;\n /* used by EC_METHOD_get_field_type: */\n int field_type; /* a NID */\n /*\n * used by EC_GROUP_new, EC_GROUP_free, EC_GROUP_clear_free,\n * EC_GROUP_copy:\n */\n int (*group_init) (EC_GROUP *);\n void (*group_finish) (EC_GROUP *);\n void (*group_clear_finish) (EC_GROUP *);\n int (*group_copy) (EC_GROUP *, const EC_GROUP *);\n /* used by EC_GROUP_set_curve, EC_GROUP_get_curve: */\n int (*group_set_curve) (EC_GROUP *, const BIGNUM *p, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *);\n int (*group_get_curve) (const EC_GROUP *, BIGNUM *p, BIGNUM *a, BIGNUM *b,\n BN_CTX *);\n /* used by EC_GROUP_get_degree: */\n int (*group_get_degree) (const EC_GROUP *);\n int (*group_order_bits) (const EC_GROUP *);\n /* used by EC_GROUP_check: */\n int (*group_check_discriminant) (const EC_GROUP *, BN_CTX *);\n /*\n * used by EC_POINT_new, EC_POINT_free, EC_POINT_clear_free,\n * EC_POINT_copy:\n */\n int (*point_init) (EC_POINT *);\n void (*point_finish) (EC_POINT *);\n void (*point_clear_finish) (EC_POINT *);\n int (*point_copy) (EC_POINT *, const EC_POINT *);\n /*-\n * used by EC_POINT_set_to_infinity,\n * EC_POINT_set_Jprojective_coordinates_GFp,\n * EC_POINT_get_Jprojective_coordinates_GFp,\n * EC_POINT_set_affine_coordinates,\n * EC_POINT_get_affine_coordinates,\n * EC_POINT_set_compressed_coordinates:\n */\n int (*point_set_to_infinity) (const EC_GROUP *, EC_POINT *);\n int (*point_set_Jprojective_coordinates_GFp) (const EC_GROUP *,\n EC_POINT *, const BIGNUM *x,\n const BIGNUM *y,\n const BIGNUM *z, BN_CTX *);\n int (*point_get_Jprojective_coordinates_GFp) (const EC_GROUP *,\n const EC_POINT *, BIGNUM *x,\n BIGNUM *y, BIGNUM *z,\n BN_CTX *);\n int (*point_set_affine_coordinates) (const EC_GROUP *, EC_POINT *,\n const BIGNUM *x, const BIGNUM *y,\n BN_CTX *);\n int (*point_get_affine_coordinates) (const EC_GROUP *, const EC_POINT *,\n BIGNUM *x, BIGNUM *y, BN_CTX *);\n int (*point_set_compressed_coordinates) (const EC_GROUP *, EC_POINT *,\n const BIGNUM *x, int y_bit,\n BN_CTX *);\n /* used by EC_POINT_point2oct, EC_POINT_oct2point: */\n size_t (*point2oct) (const EC_GROUP *, const EC_POINT *,\n point_conversion_form_t form, unsigned char *buf,\n size_t len, BN_CTX *);\n int (*oct2point) (const EC_GROUP *, EC_POINT *, const unsigned char *buf,\n size_t len, BN_CTX *);\n /* used by EC_POINT_add, EC_POINT_dbl, ECP_POINT_invert: */\n int (*add) (const EC_GROUP *, EC_POINT *r, const EC_POINT *a,\n const EC_POINT *b, BN_CTX *);\n int (*dbl) (const EC_GROUP *, EC_POINT *r, const EC_POINT *a, BN_CTX *);\n int (*invert) (const EC_GROUP *, EC_POINT *, BN_CTX *);\n /*\n * used by EC_POINT_is_at_infinity, EC_POINT_is_on_curve, EC_POINT_cmp:\n */\n int (*is_at_infinity) (const EC_GROUP *, const EC_POINT *);\n int (*is_on_curve) (const EC_GROUP *, const EC_POINT *, BN_CTX *);\n int (*point_cmp) (const EC_GROUP *, const EC_POINT *a, const EC_POINT *b,\n BN_CTX *);\n /* used by EC_POINT_make_affine, EC_POINTs_make_affine: */\n int (*make_affine) (const EC_GROUP *, EC_POINT *, BN_CTX *);\n int (*points_make_affine) (const EC_GROUP *, size_t num, EC_POINT *[],\n BN_CTX *);\n /*\n * used by EC_POINTs_mul, EC_POINT_mul, EC_POINT_precompute_mult,\n * EC_POINT_have_precompute_mult (default implementations are used if the\n * 'mul' pointer is 0):\n */\n /*-\n * mul() calculates the value\n *\n * r := generator * scalar\n * + points[0] * scalars[0]\n * + ...\n * + points[num-1] * scalars[num-1].\n *\n * For a fixed point multiplication (scalar != NULL, num == 0)\n * or a variable point multiplication (scalar == NULL, num == 1),\n * mul() must use a constant time algorithm: in both cases callers\n * should provide an input scalar (either scalar or scalars[0])\n * in the range [0, ec_group_order); for robustness, implementers\n * should handle the case when the scalar has not been reduced, but\n * may treat it as an unusual input, without any constant-timeness\n * guarantee.\n */\n int (*mul) (const EC_GROUP *group, EC_POINT *r, const BIGNUM *scalar,\n size_t num, const EC_POINT *points[], const BIGNUM *scalars[],\n BN_CTX *);\n int (*precompute_mult) (EC_GROUP *group, BN_CTX *);\n int (*have_precompute_mult) (const EC_GROUP *group);\n /* internal functions */\n /*\n * 'field_mul', 'field_sqr', and 'field_div' can be used by 'add' and\n * 'dbl' so that the same implementations of point operations can be used\n * with different optimized implementations of expensive field\n * operations:\n */\n int (*field_mul) (const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *);\n int (*field_sqr) (const EC_GROUP *, BIGNUM *r, const BIGNUM *a, BN_CTX *);\n int (*field_div) (const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *);\n /*-\n * 'field_inv' computes the multiplicative inverse of a in the field,\n * storing the result in r.\n *\n * If 'a' is zero (or equivalent), you'll get an EC_R_CANNOT_INVERT error.\n */\n int (*field_inv) (const EC_GROUP *, BIGNUM *r, const BIGNUM *a, BN_CTX *);\n /* e.g. to Montgomery */\n int (*field_encode) (const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n BN_CTX *);\n /* e.g. from Montgomery */\n int (*field_decode) (const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n BN_CTX *);\n int (*field_set_to_one) (const EC_GROUP *, BIGNUM *r, BN_CTX *);\n /* private key operations */\n size_t (*priv2oct)(const EC_KEY *eckey, unsigned char *buf, size_t len);\n int (*oct2priv)(EC_KEY *eckey, const unsigned char *buf, size_t len);\n int (*set_private)(EC_KEY *eckey, const BIGNUM *priv_key);\n int (*keygen)(EC_KEY *eckey);\n int (*keycheck)(const EC_KEY *eckey);\n int (*keygenpub)(EC_KEY *eckey);\n int (*keycopy)(EC_KEY *dst, const EC_KEY *src);\n void (*keyfinish)(EC_KEY *eckey);\n /* custom ECDH operation */\n int (*ecdh_compute_key)(unsigned char **pout, size_t *poutlen,\n const EC_POINT *pub_key, const EC_KEY *ecdh);\n /* Inverse modulo order */\n int (*field_inverse_mod_ord)(const EC_GROUP *, BIGNUM *r,\n const BIGNUM *x, BN_CTX *);\n int (*blind_coordinates)(const EC_GROUP *group, EC_POINT *p, BN_CTX *ctx);\n int (*ladder_pre)(const EC_GROUP *group,\n EC_POINT *r, EC_POINT *s,\n EC_POINT *p, BN_CTX *ctx);\n int (*ladder_step)(const EC_GROUP *group,\n EC_POINT *r, EC_POINT *s,\n EC_POINT *p, BN_CTX *ctx);\n int (*ladder_post)(const EC_GROUP *group,\n EC_POINT *r, EC_POINT *s,\n EC_POINT *p, BN_CTX *ctx);\n};\n\n/*\n * Types and functions to manipulate pre-computed values.\n */\ntypedef struct nistp224_pre_comp_st NISTP224_PRE_COMP;\ntypedef struct nistp256_pre_comp_st NISTP256_PRE_COMP;\ntypedef struct nistp521_pre_comp_st NISTP521_PRE_COMP;\ntypedef struct nistz256_pre_comp_st NISTZ256_PRE_COMP;\ntypedef struct ec_pre_comp_st EC_PRE_COMP;\n\nstruct ec_group_st {\n const EC_METHOD *meth;\n EC_POINT *generator; /* optional */\n BIGNUM *order, *cofactor;\n int curve_name; /* optional NID for named curve */\n int asn1_flag; /* flag to control the asn1 encoding */\n int decoded_from_explicit_params; /* set if decoded from explicit\n * curve parameters encoding */\n point_conversion_form_t asn1_form;\n unsigned char *seed; /* optional seed for parameters (appears in\n * ASN1) */\n size_t seed_len;\n /*\n * The following members are handled by the method functions, even if\n * they appear generic\n */\n /*\n * Field specification. For curves over GF(p), this is the modulus; for\n * curves over GF(2^m), this is the irreducible polynomial defining the\n * field.\n */\n BIGNUM *field;\n /*\n * Field specification for curves over GF(2^m). The irreducible f(t) is\n * then of the form: t^poly[0] + t^poly[1] + ... + t^poly[k] where m =\n * poly[0] > poly[1] > ... > poly[k] = 0. The array is terminated with\n * poly[k+1]=-1. All elliptic curve irreducibles have at most 5 non-zero\n * terms.\n */\n int poly[6];\n /*\n * Curve coefficients. (Here the assumption is that BIGNUMs can be used\n * or abused for all kinds of fields, not just GF(p).) For characteristic\n * > 3, the curve is defined by a Weierstrass equation of the form y^2 =\n * x^3 + a*x + b. For characteristic 2, the curve is defined by an\n * equation of the form y^2 + x*y = x^3 + a*x^2 + b.\n */\n BIGNUM *a, *b;\n /* enable optimized point arithmetics for special case */\n int a_is_minus3;\n /* method-specific (e.g., Montgomery structure) */\n void *field_data1;\n /* method-specific */\n void *field_data2;\n /* method-specific */\n int (*field_mod_func) (BIGNUM *, const BIGNUM *, const BIGNUM *,\n BN_CTX *);\n /* data for ECDSA inverse */\n BN_MONT_CTX *mont_data;\n\n /*\n * Precomputed values for speed. The PCT_xxx names match the\n * pre_comp.xxx union names; see the SETPRECOMP and HAVEPRECOMP\n * macros, below.\n */\n enum {\n PCT_none,\n PCT_nistp224, PCT_nistp256, PCT_nistp521, PCT_nistz256,\n PCT_ec\n } pre_comp_type;\n union {\n NISTP224_PRE_COMP *nistp224;\n NISTP256_PRE_COMP *nistp256;\n NISTP521_PRE_COMP *nistp521;\n NISTZ256_PRE_COMP *nistz256;\n EC_PRE_COMP *ec;\n } pre_comp;\n};\n\n#define SETPRECOMP(g, type, pre) \\\n g->pre_comp_type = PCT_##type, g->pre_comp.type = pre\n#define HAVEPRECOMP(g, type) \\\n g->pre_comp_type == PCT_##type && g->pre_comp.type != NULL\n\nstruct ec_key_st {\n const EC_KEY_METHOD *meth;\n ENGINE *engine;\n int version;\n EC_GROUP *group;\n EC_POINT *pub_key;\n BIGNUM *priv_key;\n unsigned int enc_flag;\n point_conversion_form_t conv_form;\n CRYPTO_REF_COUNT references;\n int flags;\n CRYPTO_EX_DATA ex_data;\n CRYPTO_RWLOCK *lock;\n};\n\nstruct ec_point_st {\n const EC_METHOD *meth;\n /* NID for the curve if known */\n int curve_name;\n /*\n * All members except 'meth' are handled by the method functions, even if\n * they appear generic\n */\n BIGNUM *X;\n BIGNUM *Y;\n BIGNUM *Z; /* Jacobian projective coordinates: * (X, Y,\n * Z) represents (X/Z^2, Y/Z^3) if Z != 0 */\n int Z_is_one; /* enable optimized point arithmetics for\n * special case */\n};\n\nstatic ossl_inline int ec_point_is_compat(const EC_POINT *point,\n const EC_GROUP *group)\n{\n if (group->meth != point->meth\n || (group->curve_name != 0\n && point->curve_name != 0\n && group->curve_name != point->curve_name))\n return 0;\n\n return 1;\n}\n\nNISTP224_PRE_COMP *EC_nistp224_pre_comp_dup(NISTP224_PRE_COMP *);\nNISTP256_PRE_COMP *EC_nistp256_pre_comp_dup(NISTP256_PRE_COMP *);\nNISTP521_PRE_COMP *EC_nistp521_pre_comp_dup(NISTP521_PRE_COMP *);\nNISTZ256_PRE_COMP *EC_nistz256_pre_comp_dup(NISTZ256_PRE_COMP *);\nNISTP256_PRE_COMP *EC_nistp256_pre_comp_dup(NISTP256_PRE_COMP *);\nEC_PRE_COMP *EC_ec_pre_comp_dup(EC_PRE_COMP *);\n\nvoid EC_pre_comp_free(EC_GROUP *group);\nvoid EC_nistp224_pre_comp_free(NISTP224_PRE_COMP *);\nvoid EC_nistp256_pre_comp_free(NISTP256_PRE_COMP *);\nvoid EC_nistp521_pre_comp_free(NISTP521_PRE_COMP *);\nvoid EC_nistz256_pre_comp_free(NISTZ256_PRE_COMP *);\nvoid EC_ec_pre_comp_free(EC_PRE_COMP *);\n\n/*\n * method functions in ec_mult.c (ec_lib.c uses these as defaults if\n * group->method->mul is 0)\n */\nint ec_wNAF_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *scalar,\n size_t num, const EC_POINT *points[], const BIGNUM *scalars[],\n BN_CTX *);\nint ec_wNAF_precompute_mult(EC_GROUP *group, BN_CTX *);\nint ec_wNAF_have_precompute_mult(const EC_GROUP *group);\n\n/* method functions in ecp_smpl.c */\nint ec_GFp_simple_group_init(EC_GROUP *);\nvoid ec_GFp_simple_group_finish(EC_GROUP *);\nvoid ec_GFp_simple_group_clear_finish(EC_GROUP *);\nint ec_GFp_simple_group_copy(EC_GROUP *, const EC_GROUP *);\nint ec_GFp_simple_group_set_curve(EC_GROUP *, const BIGNUM *p,\n const BIGNUM *a, const BIGNUM *b, BN_CTX *);\nint ec_GFp_simple_group_get_curve(const EC_GROUP *, BIGNUM *p, BIGNUM *a,\n BIGNUM *b, BN_CTX *);\nint ec_GFp_simple_group_get_degree(const EC_GROUP *);\nint ec_GFp_simple_group_check_discriminant(const EC_GROUP *, BN_CTX *);\nint ec_GFp_simple_point_init(EC_POINT *);\nvoid ec_GFp_simple_point_finish(EC_POINT *);\nvoid ec_GFp_simple_point_clear_finish(EC_POINT *);\nint ec_GFp_simple_point_copy(EC_POINT *, const EC_POINT *);\nint ec_GFp_simple_point_set_to_infinity(const EC_GROUP *, EC_POINT *);\nint ec_GFp_simple_set_Jprojective_coordinates_GFp(const EC_GROUP *,\n EC_POINT *, const BIGNUM *x,\n const BIGNUM *y,\n const BIGNUM *z, BN_CTX *);\nint ec_GFp_simple_get_Jprojective_coordinates_GFp(const EC_GROUP *,\n const EC_POINT *, BIGNUM *x,\n BIGNUM *y, BIGNUM *z,\n BN_CTX *);\nint ec_GFp_simple_point_set_affine_coordinates(const EC_GROUP *, EC_POINT *,\n const BIGNUM *x,\n const BIGNUM *y, BN_CTX *);\nint ec_GFp_simple_point_get_affine_coordinates(const EC_GROUP *,\n const EC_POINT *, BIGNUM *x,\n BIGNUM *y, BN_CTX *);\nint ec_GFp_simple_set_compressed_coordinates(const EC_GROUP *, EC_POINT *,\n const BIGNUM *x, int y_bit,\n BN_CTX *);\nsize_t ec_GFp_simple_point2oct(const EC_GROUP *, const EC_POINT *,\n point_conversion_form_t form,\n unsigned char *buf, size_t len, BN_CTX *);\nint ec_GFp_simple_oct2point(const EC_GROUP *, EC_POINT *,\n const unsigned char *buf, size_t len, BN_CTX *);\nint ec_GFp_simple_add(const EC_GROUP *, EC_POINT *r, const EC_POINT *a,\n const EC_POINT *b, BN_CTX *);\nint ec_GFp_simple_dbl(const EC_GROUP *, EC_POINT *r, const EC_POINT *a,\n BN_CTX *);\nint ec_GFp_simple_invert(const EC_GROUP *, EC_POINT *, BN_CTX *);\nint ec_GFp_simple_is_at_infinity(const EC_GROUP *, const EC_POINT *);\nint ec_GFp_simple_is_on_curve(const EC_GROUP *, const EC_POINT *, BN_CTX *);\nint ec_GFp_simple_cmp(const EC_GROUP *, const EC_POINT *a, const EC_POINT *b,\n BN_CTX *);\nint ec_GFp_simple_make_affine(const EC_GROUP *, EC_POINT *, BN_CTX *);\nint ec_GFp_simple_points_make_affine(const EC_GROUP *, size_t num,\n EC_POINT *[], BN_CTX *);\nint ec_GFp_simple_field_mul(const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *);\nint ec_GFp_simple_field_sqr(const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n BN_CTX *);\nint ec_GFp_simple_field_inv(const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n BN_CTX *);\nint ec_GFp_simple_blind_coordinates(const EC_GROUP *group, EC_POINT *p,\n BN_CTX *ctx);\nint ec_GFp_simple_ladder_pre(const EC_GROUP *group,\n EC_POINT *r, EC_POINT *s,\n EC_POINT *p, BN_CTX *ctx);\nint ec_GFp_simple_ladder_step(const EC_GROUP *group,\n EC_POINT *r, EC_POINT *s,\n EC_POINT *p, BN_CTX *ctx);\nint ec_GFp_simple_ladder_post(const EC_GROUP *group,\n EC_POINT *r, EC_POINT *s,\n EC_POINT *p, BN_CTX *ctx);\n\n/* method functions in ecp_mont.c */\nint ec_GFp_mont_group_init(EC_GROUP *);\nint ec_GFp_mont_group_set_curve(EC_GROUP *, const BIGNUM *p, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *);\nvoid ec_GFp_mont_group_finish(EC_GROUP *);\nvoid ec_GFp_mont_group_clear_finish(EC_GROUP *);\nint ec_GFp_mont_group_copy(EC_GROUP *, const EC_GROUP *);\nint ec_GFp_mont_field_mul(const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *);\nint ec_GFp_mont_field_sqr(const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n BN_CTX *);\nint ec_GFp_mont_field_inv(const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n BN_CTX *);\nint ec_GFp_mont_field_encode(const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n BN_CTX *);\nint ec_GFp_mont_field_decode(const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n BN_CTX *);\nint ec_GFp_mont_field_set_to_one(const EC_GROUP *, BIGNUM *r, BN_CTX *);\n\n/* method functions in ecp_nist.c */\nint ec_GFp_nist_group_copy(EC_GROUP *dest, const EC_GROUP *src);\nint ec_GFp_nist_group_set_curve(EC_GROUP *, const BIGNUM *p, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *);\nint ec_GFp_nist_field_mul(const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *);\nint ec_GFp_nist_field_sqr(const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n BN_CTX *);\n\n/* method functions in ec2_smpl.c */\nint ec_GF2m_simple_group_init(EC_GROUP *);\nvoid ec_GF2m_simple_group_finish(EC_GROUP *);\nvoid ec_GF2m_simple_group_clear_finish(EC_GROUP *);\nint ec_GF2m_simple_group_copy(EC_GROUP *, const EC_GROUP *);\nint ec_GF2m_simple_group_set_curve(EC_GROUP *, const BIGNUM *p,\n const BIGNUM *a, const BIGNUM *b,\n BN_CTX *);\nint ec_GF2m_simple_group_get_curve(const EC_GROUP *, BIGNUM *p, BIGNUM *a,\n BIGNUM *b, BN_CTX *);\nint ec_GF2m_simple_group_get_degree(const EC_GROUP *);\nint ec_GF2m_simple_group_check_discriminant(const EC_GROUP *, BN_CTX *);\nint ec_GF2m_simple_point_init(EC_POINT *);\nvoid ec_GF2m_simple_point_finish(EC_POINT *);\nvoid ec_GF2m_simple_point_clear_finish(EC_POINT *);\nint ec_GF2m_simple_point_copy(EC_POINT *, const EC_POINT *);\nint ec_GF2m_simple_point_set_to_infinity(const EC_GROUP *, EC_POINT *);\nint ec_GF2m_simple_point_set_affine_coordinates(const EC_GROUP *, EC_POINT *,\n const BIGNUM *x,\n const BIGNUM *y, BN_CTX *);\nint ec_GF2m_simple_point_get_affine_coordinates(const EC_GROUP *,\n const EC_POINT *, BIGNUM *x,\n BIGNUM *y, BN_CTX *);\nint ec_GF2m_simple_set_compressed_coordinates(const EC_GROUP *, EC_POINT *,\n const BIGNUM *x, int y_bit,\n BN_CTX *);\nsize_t ec_GF2m_simple_point2oct(const EC_GROUP *, const EC_POINT *,\n point_conversion_form_t form,\n unsigned char *buf, size_t len, BN_CTX *);\nint ec_GF2m_simple_oct2point(const EC_GROUP *, EC_POINT *,\n const unsigned char *buf, size_t len, BN_CTX *);\nint ec_GF2m_simple_add(const EC_GROUP *, EC_POINT *r, const EC_POINT *a,\n const EC_POINT *b, BN_CTX *);\nint ec_GF2m_simple_dbl(const EC_GROUP *, EC_POINT *r, const EC_POINT *a,\n BN_CTX *);\nint ec_GF2m_simple_invert(const EC_GROUP *, EC_POINT *, BN_CTX *);\nint ec_GF2m_simple_is_at_infinity(const EC_GROUP *, const EC_POINT *);\nint ec_GF2m_simple_is_on_curve(const EC_GROUP *, const EC_POINT *, BN_CTX *);\nint ec_GF2m_simple_cmp(const EC_GROUP *, const EC_POINT *a, const EC_POINT *b,\n BN_CTX *);\nint ec_GF2m_simple_make_affine(const EC_GROUP *, EC_POINT *, BN_CTX *);\nint ec_GF2m_simple_points_make_affine(const EC_GROUP *, size_t num,\n EC_POINT *[], BN_CTX *);\nint ec_GF2m_simple_field_mul(const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *);\nint ec_GF2m_simple_field_sqr(const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n BN_CTX *);\nint ec_GF2m_simple_field_div(const EC_GROUP *, BIGNUM *r, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *);\n\n#ifndef OPENSSL_NO_EC_NISTP_64_GCC_128\n/* method functions in ecp_nistp224.c */\nint ec_GFp_nistp224_group_init(EC_GROUP *group);\nint ec_GFp_nistp224_group_set_curve(EC_GROUP *group, const BIGNUM *p,\n const BIGNUM *a, const BIGNUM *n,\n BN_CTX *);\nint ec_GFp_nistp224_point_get_affine_coordinates(const EC_GROUP *group,\n const EC_POINT *point,\n BIGNUM *x, BIGNUM *y,\n BN_CTX *ctx);\nint ec_GFp_nistp224_mul(const EC_GROUP *group, EC_POINT *r,\n const BIGNUM *scalar, size_t num,\n const EC_POINT *points[], const BIGNUM *scalars[],\n BN_CTX *);\nint ec_GFp_nistp224_points_mul(const EC_GROUP *group, EC_POINT *r,\n const BIGNUM *scalar, size_t num,\n const EC_POINT *points[],\n const BIGNUM *scalars[], BN_CTX *ctx);\nint ec_GFp_nistp224_precompute_mult(EC_GROUP *group, BN_CTX *ctx);\nint ec_GFp_nistp224_have_precompute_mult(const EC_GROUP *group);\n\n/* method functions in ecp_nistp256.c */\nint ec_GFp_nistp256_group_init(EC_GROUP *group);\nint ec_GFp_nistp256_group_set_curve(EC_GROUP *group, const BIGNUM *p,\n const BIGNUM *a, const BIGNUM *n,\n BN_CTX *);\nint ec_GFp_nistp256_point_get_affine_coordinates(const EC_GROUP *group,\n const EC_POINT *point,\n BIGNUM *x, BIGNUM *y,\n BN_CTX *ctx);\nint ec_GFp_nistp256_mul(const EC_GROUP *group, EC_POINT *r,\n const BIGNUM *scalar, size_t num,\n const EC_POINT *points[], const BIGNUM *scalars[],\n BN_CTX *);\nint ec_GFp_nistp256_points_mul(const EC_GROUP *group, EC_POINT *r,\n const BIGNUM *scalar, size_t num,\n const EC_POINT *points[],\n const BIGNUM *scalars[], BN_CTX *ctx);\nint ec_GFp_nistp256_precompute_mult(EC_GROUP *group, BN_CTX *ctx);\nint ec_GFp_nistp256_have_precompute_mult(const EC_GROUP *group);\n\n/* method functions in ecp_nistp521.c */\nint ec_GFp_nistp521_group_init(EC_GROUP *group);\nint ec_GFp_nistp521_group_set_curve(EC_GROUP *group, const BIGNUM *p,\n const BIGNUM *a, const BIGNUM *n,\n BN_CTX *);\nint ec_GFp_nistp521_point_get_affine_coordinates(const EC_GROUP *group,\n const EC_POINT *point,\n BIGNUM *x, BIGNUM *y,\n BN_CTX *ctx);\nint ec_GFp_nistp521_mul(const EC_GROUP *group, EC_POINT *r,\n const BIGNUM *scalar, size_t num,\n const EC_POINT *points[], const BIGNUM *scalars[],\n BN_CTX *);\nint ec_GFp_nistp521_points_mul(const EC_GROUP *group, EC_POINT *r,\n const BIGNUM *scalar, size_t num,\n const EC_POINT *points[],\n const BIGNUM *scalars[], BN_CTX *ctx);\nint ec_GFp_nistp521_precompute_mult(EC_GROUP *group, BN_CTX *ctx);\nint ec_GFp_nistp521_have_precompute_mult(const EC_GROUP *group);\n\n/* utility functions in ecp_nistputil.c */\nvoid ec_GFp_nistp_points_make_affine_internal(size_t num, void *point_array,\n size_t felem_size,\n void *tmp_felems,\n void (*felem_one) (void *out),\n int (*felem_is_zero) (const void\n *in),\n void (*felem_assign) (void *out,\n const void\n *in),\n void (*felem_square) (void *out,\n const void\n *in),\n void (*felem_mul) (void *out,\n const void\n *in1,\n const void\n *in2),\n void (*felem_inv) (void *out,\n const void\n *in),\n void (*felem_contract) (void\n *out,\n const\n void\n *in));\nvoid ec_GFp_nistp_recode_scalar_bits(unsigned char *sign,\n unsigned char *digit, unsigned char in);\n#endif\nint ec_group_simple_order_bits(const EC_GROUP *group);\n\n#ifdef ECP_NISTZ256_ASM\n/** Returns GFp methods using montgomery multiplication, with x86-64 optimized\n * P256. See http://eprint.iacr.org/2013/816.\n * \\return EC_METHOD object\n */\nconst EC_METHOD *EC_GFp_nistz256_method(void);\n#endif\n\nsize_t ec_key_simple_priv2oct(const EC_KEY *eckey,\n unsigned char *buf, size_t len);\nint ec_key_simple_oct2priv(EC_KEY *eckey, const unsigned char *buf, size_t len);\nint ec_key_simple_generate_key(EC_KEY *eckey);\nint ec_key_simple_generate_public_key(EC_KEY *eckey);\nint ec_key_simple_check_key(const EC_KEY *eckey);\n\nint ec_curve_nid_from_params(const EC_GROUP *group, BN_CTX *ctx);\n\n/* EC_METHOD definitions */\n\nstruct ec_key_method_st {\n const char *name;\n int32_t flags;\n int (*init)(EC_KEY *key);\n void (*finish)(EC_KEY *key);\n int (*copy)(EC_KEY *dest, const EC_KEY *src);\n int (*set_group)(EC_KEY *key, const EC_GROUP *grp);\n int (*set_private)(EC_KEY *key, const BIGNUM *priv_key);\n int (*set_public)(EC_KEY *key, const EC_POINT *pub_key);\n int (*keygen)(EC_KEY *key);\n int (*compute_key)(unsigned char **pout, size_t *poutlen,\n const EC_POINT *pub_key, const EC_KEY *ecdh);\n int (*sign)(int type, const unsigned char *dgst, int dlen, unsigned char\n *sig, unsigned int *siglen, const BIGNUM *kinv,\n const BIGNUM *r, EC_KEY *eckey);\n int (*sign_setup)(EC_KEY *eckey, BN_CTX *ctx_in, BIGNUM **kinvp,\n BIGNUM **rp);\n ECDSA_SIG *(*sign_sig)(const unsigned char *dgst, int dgst_len,\n const BIGNUM *in_kinv, const BIGNUM *in_r,\n EC_KEY *eckey);\n\n int (*verify)(int type, const unsigned char *dgst, int dgst_len,\n const unsigned char *sigbuf, int sig_len, EC_KEY *eckey);\n int (*verify_sig)(const unsigned char *dgst, int dgst_len,\n const ECDSA_SIG *sig, EC_KEY *eckey);\n};\n\n#define EC_KEY_METHOD_DYNAMIC 1\n\nint ossl_ec_key_gen(EC_KEY *eckey);\nint ossl_ecdh_compute_key(unsigned char **pout, size_t *poutlen,\n const EC_POINT *pub_key, const EC_KEY *ecdh);\nint ecdh_simple_compute_key(unsigned char **pout, size_t *poutlen,\n const EC_POINT *pub_key, const EC_KEY *ecdh);\n\nstruct ECDSA_SIG_st {\n BIGNUM *r;\n BIGNUM *s;\n};\n\nint ossl_ecdsa_sign_setup(EC_KEY *eckey, BN_CTX *ctx_in, BIGNUM **kinvp,\n BIGNUM **rp);\nint ossl_ecdsa_sign(int type, const unsigned char *dgst, int dlen,\n unsigned char *sig, unsigned int *siglen,\n const BIGNUM *kinv, const BIGNUM *r, EC_KEY *eckey);\nECDSA_SIG *ossl_ecdsa_sign_sig(const unsigned char *dgst, int dgst_len,\n const BIGNUM *in_kinv, const BIGNUM *in_r,\n EC_KEY *eckey);\nint ossl_ecdsa_verify(int type, const unsigned char *dgst, int dgst_len,\n const unsigned char *sigbuf, int sig_len, EC_KEY *eckey);\nint ossl_ecdsa_verify_sig(const unsigned char *dgst, int dgst_len,\n const ECDSA_SIG *sig, EC_KEY *eckey);\n\nint ED25519_sign(uint8_t *out_sig, const uint8_t *message, size_t message_len,\n const uint8_t public_key[32], const uint8_t private_key[32]);\nint ED25519_verify(const uint8_t *message, size_t message_len,\n const uint8_t signature[64], const uint8_t public_key[32]);\nvoid ED25519_public_from_private(uint8_t out_public_key[32],\n const uint8_t private_key[32]);\n\nint X25519(uint8_t out_shared_key[32], const uint8_t private_key[32],\n const uint8_t peer_public_value[32]);\nvoid X25519_public_from_private(uint8_t out_public_value[32],\n const uint8_t private_key[32]);\n\n/*-\n * This functions computes a single point multiplication over the EC group,\n * using, at a high level, a Montgomery ladder with conditional swaps, with\n * various timing attack defenses.\n *\n * It performs either a fixed point multiplication\n * (scalar * generator)\n * when point is NULL, or a variable point multiplication\n * (scalar * point)\n * when point is not NULL.\n *\n * `scalar` cannot be NULL and should be in the range [0,n) otherwise all\n * constant time bets are off (where n is the cardinality of the EC group).\n *\n * This function expects `group->order` and `group->cardinality` to be well\n * defined and non-zero: it fails with an error code otherwise.\n *\n * NB: This says nothing about the constant-timeness of the ladder step\n * implementation (i.e., the default implementation is based on EC_POINT_add and\n * EC_POINT_dbl, which of course are not constant time themselves) or the\n * underlying multiprecision arithmetic.\n *\n * The product is stored in `r`.\n *\n * This is an internal function: callers are in charge of ensuring that the\n * input parameters `group`, `r`, `scalar` and `ctx` are not NULL.\n *\n * Returns 1 on success, 0 otherwise.\n */\nint ec_scalar_mul_ladder(const EC_GROUP *group, EC_POINT *r,\n const BIGNUM *scalar, const EC_POINT *point,\n BN_CTX *ctx);\n\nint ec_point_blind_coordinates(const EC_GROUP *group, EC_POINT *p, BN_CTX *ctx);\n\nstatic ossl_inline int ec_point_ladder_pre(const EC_GROUP *group,\n EC_POINT *r, EC_POINT *s,\n EC_POINT *p, BN_CTX *ctx)\n{\n if (group->meth->ladder_pre != NULL)\n return group->meth->ladder_pre(group, r, s, p, ctx);\n\n if (!EC_POINT_copy(s, p)\n || !EC_POINT_dbl(group, r, s, ctx))\n return 0;\n\n return 1;\n}\n\nstatic ossl_inline int ec_point_ladder_step(const EC_GROUP *group,\n EC_POINT *r, EC_POINT *s,\n EC_POINT *p, BN_CTX *ctx)\n{\n if (group->meth->ladder_step != NULL)\n return group->meth->ladder_step(group, r, s, p, ctx);\n\n if (!EC_POINT_add(group, s, r, s, ctx)\n || !EC_POINT_dbl(group, r, r, ctx))\n return 0;\n\n return 1;\n\n}\n\nstatic ossl_inline int ec_point_ladder_post(const EC_GROUP *group,\n EC_POINT *r, EC_POINT *s,\n EC_POINT *p, BN_CTX *ctx)\n{\n if (group->meth->ladder_post != NULL)\n return group->meth->ladder_post(group, r, s, p, ctx);\n\n return 1;\n}\n" }, { "path": "cryptomini/ec/ec_mult.c", "content": "/*\n * Copyright 2001-2020 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \n\n#include \"internal/cryptlib.h\"\n#include \"crypto/bn.h\"\n#include \"ec_local.h\"\n#include \"internal/refcount.h\"\n\n/*\n * This file implements the wNAF-based interleaving multi-exponentiation method\n * Formerly at:\n * http://www.informatik.tu-darmstadt.de/TI/Mitarbeiter/moeller.html#multiexp\n * You might now find it here:\n * http://link.springer.com/chapter/10.1007%2F3-540-45537-X_13\n * http://www.bmoeller.de/pdf/TI-01-08.multiexp.pdf\n * For multiplication with precomputation, we use wNAF splitting, formerly at:\n * http://www.informatik.tu-darmstadt.de/TI/Mitarbeiter/moeller.html#fastexp\n */\n\n/* structure for precomputed multiples of the generator */\nstruct ec_pre_comp_st {\n const EC_GROUP *group; /* parent EC_GROUP object */\n size_t blocksize; /* block size for wNAF splitting */\n size_t numblocks; /* max. number of blocks for which we have\n * precomputation */\n size_t w; /* window size */\n EC_POINT **points; /* array with pre-calculated multiples of\n * generator: 'num' pointers to EC_POINT\n * objects followed by a NULL */\n size_t num; /* numblocks * 2^(w-1) */\n CRYPTO_REF_COUNT references;\n CRYPTO_RWLOCK *lock;\n};\n\nstatic EC_PRE_COMP *ec_pre_comp_new(const EC_GROUP *group)\n{\n EC_PRE_COMP *ret = NULL;\n\n if (!group)\n return NULL;\n\n ret = OPENSSL_zalloc(sizeof(*ret));\n if (ret == NULL) {\n ECerr(EC_F_EC_PRE_COMP_NEW, ERR_R_MALLOC_FAILURE);\n return ret;\n }\n\n ret->group = group;\n ret->blocksize = 8; /* default */\n ret->w = 4; /* default */\n ret->references = 1;\n\n ret->lock = CRYPTO_THREAD_lock_new();\n if (ret->lock == NULL) {\n ECerr(EC_F_EC_PRE_COMP_NEW, ERR_R_MALLOC_FAILURE);\n OPENSSL_free(ret);\n return NULL;\n }\n return ret;\n}\n\nEC_PRE_COMP *EC_ec_pre_comp_dup(EC_PRE_COMP *pre)\n{\n int i;\n if (pre != NULL)\n CRYPTO_UP_REF(&pre->references, &i, pre->lock);\n return pre;\n}\n\nvoid EC_ec_pre_comp_free(EC_PRE_COMP *pre)\n{\n int i;\n\n if (pre == NULL)\n return;\n\n CRYPTO_DOWN_REF(&pre->references, &i, pre->lock);\n REF_PRINT_COUNT(\"EC_ec\", pre);\n if (i > 0)\n return;\n REF_ASSERT_ISNT(i < 0);\n\n if (pre->points != NULL) {\n EC_POINT **pts;\n\n for (pts = pre->points; *pts != NULL; pts++)\n EC_POINT_free(*pts);\n OPENSSL_free(pre->points);\n }\n CRYPTO_THREAD_lock_free(pre->lock);\n OPENSSL_free(pre);\n}\n\n#define EC_POINT_BN_set_flags(P, flags) do { \\\n BN_set_flags((P)->X, (flags)); \\\n BN_set_flags((P)->Y, (flags)); \\\n BN_set_flags((P)->Z, (flags)); \\\n} while(0)\n\n/*-\n * This functions computes a single point multiplication over the EC group,\n * using, at a high level, a Montgomery ladder with conditional swaps, with\n * various timing attack defenses.\n *\n * It performs either a fixed point multiplication\n * (scalar * generator)\n * when point is NULL, or a variable point multiplication\n * (scalar * point)\n * when point is not NULL.\n *\n * `scalar` cannot be NULL and should be in the range [0,n) otherwise all\n * constant time bets are off (where n is the cardinality of the EC group).\n *\n * This function expects `group->order` and `group->cardinality` to be well\n * defined and non-zero: it fails with an error code otherwise.\n *\n * NB: This says nothing about the constant-timeness of the ladder step\n * implementation (i.e., the default implementation is based on EC_POINT_add and\n * EC_POINT_dbl, which of course are not constant time themselves) or the\n * underlying multiprecision arithmetic.\n *\n * The product is stored in `r`.\n *\n * This is an internal function: callers are in charge of ensuring that the\n * input parameters `group`, `r`, `scalar` and `ctx` are not NULL.\n *\n * Returns 1 on success, 0 otherwise.\n */\nint ec_scalar_mul_ladder(const EC_GROUP *group, EC_POINT *r,\n const BIGNUM *scalar, const EC_POINT *point,\n BN_CTX *ctx)\n{\n int i, cardinality_bits, group_top, kbit, pbit, Z_is_one;\n EC_POINT *p = NULL;\n EC_POINT *s = NULL;\n BIGNUM *k = NULL;\n BIGNUM *lambda = NULL;\n BIGNUM *cardinality = NULL;\n int ret = 0;\n\n /* early exit if the input point is the point at infinity */\n if (point != NULL && EC_POINT_is_at_infinity(group, point))\n return EC_POINT_set_to_infinity(group, r);\n\n if (BN_is_zero(group->order)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, EC_R_UNKNOWN_ORDER);\n return 0;\n }\n if (BN_is_zero(group->cofactor)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, EC_R_UNKNOWN_COFACTOR);\n return 0;\n }\n\n BN_CTX_start(ctx);\n\n if (((p = EC_POINT_new(group)) == NULL)\n || ((s = EC_POINT_new(group)) == NULL)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, ERR_R_MALLOC_FAILURE);\n goto err;\n }\n\n if (point == NULL) {\n if (!EC_POINT_copy(p, group->generator)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, ERR_R_EC_LIB);\n goto err;\n }\n } else {\n if (!EC_POINT_copy(p, point)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, ERR_R_EC_LIB);\n goto err;\n }\n }\n\n EC_POINT_BN_set_flags(p, BN_FLG_CONSTTIME);\n EC_POINT_BN_set_flags(r, BN_FLG_CONSTTIME);\n EC_POINT_BN_set_flags(s, BN_FLG_CONSTTIME);\n\n cardinality = BN_CTX_get(ctx);\n lambda = BN_CTX_get(ctx);\n k = BN_CTX_get(ctx);\n if (k == NULL) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, ERR_R_MALLOC_FAILURE);\n goto err;\n }\n\n if (!BN_mul(cardinality, group->order, group->cofactor, ctx)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, ERR_R_BN_LIB);\n goto err;\n }\n\n /*\n * Group cardinalities are often on a word boundary.\n * So when we pad the scalar, some timing diff might\n * pop if it needs to be expanded due to carries.\n * So expand ahead of time.\n */\n cardinality_bits = BN_num_bits(cardinality);\n group_top = bn_get_top(cardinality);\n if ((bn_wexpand(k, group_top + 2) == NULL)\n || (bn_wexpand(lambda, group_top + 2) == NULL)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, ERR_R_BN_LIB);\n goto err;\n }\n\n if (!BN_copy(k, scalar)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, ERR_R_BN_LIB);\n goto err;\n }\n\n BN_set_flags(k, BN_FLG_CONSTTIME);\n\n if ((BN_num_bits(k) > cardinality_bits) || (BN_is_negative(k))) {\n /*-\n * this is an unusual input, and we don't guarantee\n * constant-timeness\n */\n if (!BN_nnmod(k, k, cardinality, ctx)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, ERR_R_BN_LIB);\n goto err;\n }\n }\n\n if (!BN_add(lambda, k, cardinality)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, ERR_R_BN_LIB);\n goto err;\n }\n BN_set_flags(lambda, BN_FLG_CONSTTIME);\n if (!BN_add(k, lambda, cardinality)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, ERR_R_BN_LIB);\n goto err;\n }\n /*\n * lambda := scalar + cardinality\n * k := scalar + 2*cardinality\n */\n kbit = BN_is_bit_set(lambda, cardinality_bits);\n BN_consttime_swap(kbit, k, lambda, group_top + 2);\n\n group_top = bn_get_top(group->field);\n if ((bn_wexpand(s->X, group_top) == NULL)\n || (bn_wexpand(s->Y, group_top) == NULL)\n || (bn_wexpand(s->Z, group_top) == NULL)\n || (bn_wexpand(r->X, group_top) == NULL)\n || (bn_wexpand(r->Y, group_top) == NULL)\n || (bn_wexpand(r->Z, group_top) == NULL)\n || (bn_wexpand(p->X, group_top) == NULL)\n || (bn_wexpand(p->Y, group_top) == NULL)\n || (bn_wexpand(p->Z, group_top) == NULL)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, ERR_R_BN_LIB);\n goto err;\n }\n\n /* ensure input point is in affine coords for ladder step efficiency */\n if (!p->Z_is_one && !EC_POINT_make_affine(group, p, ctx)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, ERR_R_EC_LIB);\n goto err;\n }\n\n /* Initialize the Montgomery ladder */\n if (!ec_point_ladder_pre(group, r, s, p, ctx)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, EC_R_LADDER_PRE_FAILURE);\n goto err;\n }\n\n /* top bit is a 1, in a fixed pos */\n pbit = 1;\n\n#define EC_POINT_CSWAP(c, a, b, w, t) do { \\\n BN_consttime_swap(c, (a)->X, (b)->X, w); \\\n BN_consttime_swap(c, (a)->Y, (b)->Y, w); \\\n BN_consttime_swap(c, (a)->Z, (b)->Z, w); \\\n t = ((a)->Z_is_one ^ (b)->Z_is_one) & (c); \\\n (a)->Z_is_one ^= (t); \\\n (b)->Z_is_one ^= (t); \\\n} while(0)\n\n /*-\n * The ladder step, with branches, is\n *\n * k[i] == 0: S = add(R, S), R = dbl(R)\n * k[i] == 1: R = add(S, R), S = dbl(S)\n *\n * Swapping R, S conditionally on k[i] leaves you with state\n *\n * k[i] == 0: T, U = R, S\n * k[i] == 1: T, U = S, R\n *\n * Then perform the ECC ops.\n *\n * U = add(T, U)\n * T = dbl(T)\n *\n * Which leaves you with state\n *\n * k[i] == 0: U = add(R, S), T = dbl(R)\n * k[i] == 1: U = add(S, R), T = dbl(S)\n *\n * Swapping T, U conditionally on k[i] leaves you with state\n *\n * k[i] == 0: R, S = T, U\n * k[i] == 1: R, S = U, T\n *\n * Which leaves you with state\n *\n * k[i] == 0: S = add(R, S), R = dbl(R)\n * k[i] == 1: R = add(S, R), S = dbl(S)\n *\n * So we get the same logic, but instead of a branch it's a\n * conditional swap, followed by ECC ops, then another conditional swap.\n *\n * Optimization: The end of iteration i and start of i-1 looks like\n *\n * ...\n * CSWAP(k[i], R, S)\n * ECC\n * CSWAP(k[i], R, S)\n * (next iteration)\n * CSWAP(k[i-1], R, S)\n * ECC\n * CSWAP(k[i-1], R, S)\n * ...\n *\n * So instead of two contiguous swaps, you can merge the condition\n * bits and do a single swap.\n *\n * k[i] k[i-1] Outcome\n * 0 0 No Swap\n * 0 1 Swap\n * 1 0 Swap\n * 1 1 No Swap\n *\n * This is XOR. pbit tracks the previous bit of k.\n */\n\n for (i = cardinality_bits - 1; i >= 0; i--) {\n kbit = BN_is_bit_set(k, i) ^ pbit;\n EC_POINT_CSWAP(kbit, r, s, group_top, Z_is_one);\n\n /* Perform a single step of the Montgomery ladder */\n if (!ec_point_ladder_step(group, r, s, p, ctx)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, EC_R_LADDER_STEP_FAILURE);\n goto err;\n }\n /*\n * pbit logic merges this cswap with that of the\n * next iteration\n */\n pbit ^= kbit;\n }\n /* one final cswap to move the right value into r */\n EC_POINT_CSWAP(pbit, r, s, group_top, Z_is_one);\n#undef EC_POINT_CSWAP\n\n /* Finalize ladder (and recover full point coordinates) */\n if (!ec_point_ladder_post(group, r, s, p, ctx)) {\n ECerr(EC_F_EC_SCALAR_MUL_LADDER, EC_R_LADDER_POST_FAILURE);\n goto err;\n }\n\n ret = 1;\n\n err:\n EC_POINT_free(p);\n EC_POINT_clear_free(s);\n BN_CTX_end(ctx);\n\n return ret;\n}\n\n#undef EC_POINT_BN_set_flags\n\n/*\n * TODO: table should be optimised for the wNAF-based implementation,\n * sometimes smaller windows will give better performance (thus the\n * boundaries should be increased)\n */\n#define EC_window_bits_for_scalar_size(b) \\\n ((size_t) \\\n ((b) >= 2000 ? 6 : \\\n (b) >= 800 ? 5 : \\\n (b) >= 300 ? 4 : \\\n (b) >= 70 ? 3 : \\\n (b) >= 20 ? 2 : \\\n 1))\n\n/*-\n * Compute\n * \\sum scalars[i]*points[i],\n * also including\n * scalar*generator\n * in the addition if scalar != NULL\n */\nint ec_wNAF_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *scalar,\n size_t num, const EC_POINT *points[], const BIGNUM *scalars[],\n BN_CTX *ctx)\n{\n const EC_POINT *generator = NULL;\n EC_POINT *tmp = NULL;\n size_t totalnum;\n size_t blocksize = 0, numblocks = 0; /* for wNAF splitting */\n size_t pre_points_per_block = 0;\n size_t i, j;\n int k;\n int r_is_inverted = 0;\n int r_is_at_infinity = 1;\n size_t *wsize = NULL; /* individual window sizes */\n signed char **wNAF = NULL; /* individual wNAFs */\n size_t *wNAF_len = NULL;\n size_t max_len = 0;\n size_t num_val;\n EC_POINT **val = NULL; /* precomputation */\n EC_POINT **v;\n EC_POINT ***val_sub = NULL; /* pointers to sub-arrays of 'val' or\n * 'pre_comp->points' */\n const EC_PRE_COMP *pre_comp = NULL;\n int num_scalar = 0; /* flag: will be set to 1 if 'scalar' must be\n * treated like other scalars, i.e.\n * precomputation is not available */\n int ret = 0;\n\n if (!BN_is_zero(group->order) && !BN_is_zero(group->cofactor)) {\n /*-\n * Handle the common cases where the scalar is secret, enforcing a\n * scalar multiplication implementation based on a Montgomery ladder,\n * with various timing attack defenses.\n */\n if ((scalar != group->order) && (scalar != NULL) && (num == 0)) {\n /*-\n * In this case we want to compute scalar * GeneratorPoint: this\n * codepath is reached most prominently by (ephemeral) key\n * generation of EC cryptosystems (i.e. ECDSA keygen and sign setup,\n * ECDH keygen/first half), where the scalar is always secret. This\n * is why we ignore if BN_FLG_CONSTTIME is actually set and we\n * always call the ladder version.\n */\n return ec_scalar_mul_ladder(group, r, scalar, NULL, ctx);\n }\n if ((scalar == NULL) && (num == 1) && (scalars[0] != group->order)) {\n /*-\n * In this case we want to compute scalar * VariablePoint: this\n * codepath is reached most prominently by the second half of ECDH,\n * where the secret scalar is multiplied by the peer's public point.\n * To protect the secret scalar, we ignore if BN_FLG_CONSTTIME is\n * actually set and we always call the ladder version.\n */\n return ec_scalar_mul_ladder(group, r, scalars[0], points[0], ctx);\n }\n }\n\n if (scalar != NULL) {\n generator = EC_GROUP_get0_generator(group);\n if (generator == NULL) {\n ECerr(EC_F_EC_WNAF_MUL, EC_R_UNDEFINED_GENERATOR);\n goto err;\n }\n\n /* look if we can use precomputed multiples of generator */\n\n pre_comp = group->pre_comp.ec;\n if (pre_comp && pre_comp->numblocks\n && (EC_POINT_cmp(group, generator, pre_comp->points[0], ctx) ==\n 0)) {\n blocksize = pre_comp->blocksize;\n\n /*\n * determine maximum number of blocks that wNAF splitting may\n * yield (NB: maximum wNAF length is bit length plus one)\n */\n numblocks = (BN_num_bits(scalar) / blocksize) + 1;\n\n /*\n * we cannot use more blocks than we have precomputation for\n */\n if (numblocks > pre_comp->numblocks)\n numblocks = pre_comp->numblocks;\n\n pre_points_per_block = (size_t)1 << (pre_comp->w - 1);\n\n /* check that pre_comp looks sane */\n if (pre_comp->num != (pre_comp->numblocks * pre_points_per_block)) {\n ECerr(EC_F_EC_WNAF_MUL, ERR_R_INTERNAL_ERROR);\n goto err;\n }\n } else {\n /* can't use precomputation */\n pre_comp = NULL;\n numblocks = 1;\n num_scalar = 1; /* treat 'scalar' like 'num'-th element of\n * 'scalars' */\n }\n }\n\n totalnum = num + numblocks;\n\n wsize = OPENSSL_malloc(totalnum * sizeof(wsize[0]));\n wNAF_len = OPENSSL_malloc(totalnum * sizeof(wNAF_len[0]));\n /* include space for pivot */\n wNAF = OPENSSL_malloc((totalnum + 1) * sizeof(wNAF[0]));\n val_sub = OPENSSL_malloc(totalnum * sizeof(val_sub[0]));\n\n /* Ensure wNAF is initialised in case we end up going to err */\n if (wNAF != NULL)\n wNAF[0] = NULL; /* preliminary pivot */\n\n if (wsize == NULL || wNAF_len == NULL || wNAF == NULL || val_sub == NULL) {\n ECerr(EC_F_EC_WNAF_MUL, ERR_R_MALLOC_FAILURE);\n goto err;\n }\n\n /*\n * num_val will be the total number of temporarily precomputed points\n */\n num_val = 0;\n\n for (i = 0; i < num + num_scalar; i++) {\n size_t bits;\n\n bits = i < num ? BN_num_bits(scalars[i]) : BN_num_bits(scalar);\n wsize[i] = EC_window_bits_for_scalar_size(bits);\n num_val += (size_t)1 << (wsize[i] - 1);\n wNAF[i + 1] = NULL; /* make sure we always have a pivot */\n wNAF[i] =\n bn_compute_wNAF((i < num ? scalars[i] : scalar), wsize[i],\n &wNAF_len[i]);\n if (wNAF[i] == NULL)\n goto err;\n if (wNAF_len[i] > max_len)\n max_len = wNAF_len[i];\n }\n\n if (numblocks) {\n /* we go here iff scalar != NULL */\n\n if (pre_comp == NULL) {\n if (num_scalar != 1) {\n ECerr(EC_F_EC_WNAF_MUL, ERR_R_INTERNAL_ERROR);\n goto err;\n }\n /* we have already generated a wNAF for 'scalar' */\n } else {\n signed char *tmp_wNAF = NULL;\n size_t tmp_len = 0;\n\n if (num_scalar != 0) {\n ECerr(EC_F_EC_WNAF_MUL, ERR_R_INTERNAL_ERROR);\n goto err;\n }\n\n /*\n * use the window size for which we have precomputation\n */\n wsize[num] = pre_comp->w;\n tmp_wNAF = bn_compute_wNAF(scalar, wsize[num], &tmp_len);\n if (!tmp_wNAF)\n goto err;\n\n if (tmp_len <= max_len) {\n /*\n * One of the other wNAFs is at least as long as the wNAF\n * belonging to the generator, so wNAF splitting will not buy\n * us anything.\n */\n\n numblocks = 1;\n totalnum = num + 1; /* don't use wNAF splitting */\n wNAF[num] = tmp_wNAF;\n wNAF[num + 1] = NULL;\n wNAF_len[num] = tmp_len;\n /*\n * pre_comp->points starts with the points that we need here:\n */\n val_sub[num] = pre_comp->points;\n } else {\n /*\n * don't include tmp_wNAF directly into wNAF array - use wNAF\n * splitting and include the blocks\n */\n\n signed char *pp;\n EC_POINT **tmp_points;\n\n if (tmp_len < numblocks * blocksize) {\n /*\n * possibly we can do with fewer blocks than estimated\n */\n numblocks = (tmp_len + blocksize - 1) / blocksize;\n if (numblocks > pre_comp->numblocks) {\n ECerr(EC_F_EC_WNAF_MUL, ERR_R_INTERNAL_ERROR);\n OPENSSL_free(tmp_wNAF);\n goto err;\n }\n totalnum = num + numblocks;\n }\n\n /* split wNAF in 'numblocks' parts */\n pp = tmp_wNAF;\n tmp_points = pre_comp->points;\n\n for (i = num; i < totalnum; i++) {\n if (i < totalnum - 1) {\n wNAF_len[i] = blocksize;\n if (tmp_len < blocksize) {\n ECerr(EC_F_EC_WNAF_MUL, ERR_R_INTERNAL_ERROR);\n OPENSSL_free(tmp_wNAF);\n goto err;\n }\n tmp_len -= blocksize;\n } else\n /*\n * last block gets whatever is left (this could be\n * more or less than 'blocksize'!)\n */\n wNAF_len[i] = tmp_len;\n\n wNAF[i + 1] = NULL;\n wNAF[i] = OPENSSL_malloc(wNAF_len[i]);\n if (wNAF[i] == NULL) {\n ECerr(EC_F_EC_WNAF_MUL, ERR_R_MALLOC_FAILURE);\n OPENSSL_free(tmp_wNAF);\n goto err;\n }\n memcpy(wNAF[i], pp, wNAF_len[i]);\n if (wNAF_len[i] > max_len)\n max_len = wNAF_len[i];\n\n if (*tmp_points == NULL) {\n ECerr(EC_F_EC_WNAF_MUL, ERR_R_INTERNAL_ERROR);\n OPENSSL_free(tmp_wNAF);\n goto err;\n }\n val_sub[i] = tmp_points;\n tmp_points += pre_points_per_block;\n pp += blocksize;\n }\n OPENSSL_free(tmp_wNAF);\n }\n }\n }\n\n /*\n * All points we precompute now go into a single array 'val'.\n * 'val_sub[i]' is a pointer to the subarray for the i-th point, or to a\n * subarray of 'pre_comp->points' if we already have precomputation.\n */\n val = OPENSSL_malloc((num_val + 1) * sizeof(val[0]));\n if (val == NULL) {\n ECerr(EC_F_EC_WNAF_MUL, ERR_R_MALLOC_FAILURE);\n goto err;\n }\n val[num_val] = NULL; /* pivot element */\n\n /* allocate points for precomputation */\n v = val;\n for (i = 0; i < num + num_scalar; i++) {\n val_sub[i] = v;\n for (j = 0; j < ((size_t)1 << (wsize[i] - 1)); j++) {\n *v = EC_POINT_new(group);\n if (*v == NULL)\n goto err;\n v++;\n }\n }\n if (!(v == val + num_val)) {\n ECerr(EC_F_EC_WNAF_MUL, ERR_R_INTERNAL_ERROR);\n goto err;\n }\n\n if ((tmp = EC_POINT_new(group)) == NULL)\n goto err;\n\n /*-\n * prepare precomputed values:\n * val_sub[i][0] := points[i]\n * val_sub[i][1] := 3 * points[i]\n * val_sub[i][2] := 5 * points[i]\n * ...\n */\n for (i = 0; i < num + num_scalar; i++) {\n if (i < num) {\n if (!EC_POINT_copy(val_sub[i][0], points[i]))\n goto err;\n } else {\n if (!EC_POINT_copy(val_sub[i][0], generator))\n goto err;\n }\n\n if (wsize[i] > 1) {\n if (!EC_POINT_dbl(group, tmp, val_sub[i][0], ctx))\n goto err;\n for (j = 1; j < ((size_t)1 << (wsize[i] - 1)); j++) {\n if (!EC_POINT_add\n (group, val_sub[i][j], val_sub[i][j - 1], tmp, ctx))\n goto err;\n }\n }\n }\n\n if (!EC_POINTs_make_affine(group, num_val, val, ctx))\n goto err;\n\n r_is_at_infinity = 1;\n\n for (k = max_len - 1; k >= 0; k--) {\n if (!r_is_at_infinity) {\n if (!EC_POINT_dbl(group, r, r, ctx))\n goto err;\n }\n\n for (i = 0; i < totalnum; i++) {\n if (wNAF_len[i] > (size_t)k) {\n int digit = wNAF[i][k];\n int is_neg;\n\n if (digit) {\n is_neg = digit < 0;\n\n if (is_neg)\n digit = -digit;\n\n if (is_neg != r_is_inverted) {\n if (!r_is_at_infinity) {\n if (!EC_POINT_invert(group, r, ctx))\n goto err;\n }\n r_is_inverted = !r_is_inverted;\n }\n\n /* digit > 0 */\n\n if (r_is_at_infinity) {\n if (!EC_POINT_copy(r, val_sub[i][digit >> 1]))\n goto err;\n\n /*-\n * Apply coordinate blinding for EC_POINT.\n *\n * The underlying EC_METHOD can optionally implement this function:\n * ec_point_blind_coordinates() returns 0 in case of errors or 1 on\n * success or if coordinate blinding is not implemented for this\n * group.\n */\n if (!ec_point_blind_coordinates(group, r, ctx)) {\n ECerr(EC_F_EC_WNAF_MUL, EC_R_POINT_COORDINATES_BLIND_FAILURE);\n goto err;\n }\n\n r_is_at_infinity = 0;\n } else {\n if (!EC_POINT_add\n (group, r, r, val_sub[i][digit >> 1], ctx))\n goto err;\n }\n }\n }\n }\n }\n\n if (r_is_at_infinity) {\n if (!EC_POINT_set_to_infinity(group, r))\n goto err;\n } else {\n if (r_is_inverted)\n if (!EC_POINT_invert(group, r, ctx))\n goto err;\n }\n\n ret = 1;\n\n err:\n EC_POINT_free(tmp);\n OPENSSL_free(wsize);\n OPENSSL_free(wNAF_len);\n if (wNAF != NULL) {\n signed char **w;\n\n for (w = wNAF; *w != NULL; w++)\n OPENSSL_free(*w);\n\n OPENSSL_free(wNAF);\n }\n if (val != NULL) {\n for (v = val; *v != NULL; v++)\n EC_POINT_clear_free(*v);\n\n OPENSSL_free(val);\n }\n OPENSSL_free(val_sub);\n return ret;\n}\n\n/*-\n * ec_wNAF_precompute_mult()\n * creates an EC_PRE_COMP object with preprecomputed multiples of the generator\n * for use with wNAF splitting as implemented in ec_wNAF_mul().\n *\n * 'pre_comp->points' is an array of multiples of the generator\n * of the following form:\n * points[0] = generator;\n * points[1] = 3 * generator;\n * ...\n * points[2^(w-1)-1] = (2^(w-1)-1) * generator;\n * points[2^(w-1)] = 2^blocksize * generator;\n * points[2^(w-1)+1] = 3 * 2^blocksize * generator;\n * ...\n * points[2^(w-1)*(numblocks-1)-1] = (2^(w-1)) * 2^(blocksize*(numblocks-2)) * generator\n * points[2^(w-1)*(numblocks-1)] = 2^(blocksize*(numblocks-1)) * generator\n * ...\n * points[2^(w-1)*numblocks-1] = (2^(w-1)) * 2^(blocksize*(numblocks-1)) * generator\n * points[2^(w-1)*numblocks] = NULL\n */\nint ec_wNAF_precompute_mult(EC_GROUP *group, BN_CTX *ctx)\n{\n const EC_POINT *generator;\n EC_POINT *tmp_point = NULL, *base = NULL, **var;\n BN_CTX *new_ctx = NULL;\n const BIGNUM *order;\n size_t i, bits, w, pre_points_per_block, blocksize, numblocks, num;\n EC_POINT **points = NULL;\n EC_PRE_COMP *pre_comp;\n int ret = 0;\n\n /* if there is an old EC_PRE_COMP object, throw it away */\n EC_pre_comp_free(group);\n if ((pre_comp = ec_pre_comp_new(group)) == NULL)\n return 0;\n\n generator = EC_GROUP_get0_generator(group);\n if (generator == NULL) {\n ECerr(EC_F_EC_WNAF_PRECOMPUTE_MULT, EC_R_UNDEFINED_GENERATOR);\n goto err;\n }\n\n if (ctx == NULL) {\n ctx = new_ctx = BN_CTX_new();\n if (ctx == NULL)\n goto err;\n }\n\n BN_CTX_start(ctx);\n\n order = EC_GROUP_get0_order(group);\n if (order == NULL)\n goto err;\n if (BN_is_zero(order)) {\n ECerr(EC_F_EC_WNAF_PRECOMPUTE_MULT, EC_R_UNKNOWN_ORDER);\n goto err;\n }\n\n bits = BN_num_bits(order);\n /*\n * The following parameters mean we precompute (approximately) one point\n * per bit. TBD: The combination 8, 4 is perfect for 160 bits; for other\n * bit lengths, other parameter combinations might provide better\n * efficiency.\n */\n blocksize = 8;\n w = 4;\n if (EC_window_bits_for_scalar_size(bits) > w) {\n /* let's not make the window too small ... */\n w = EC_window_bits_for_scalar_size(bits);\n }\n\n numblocks = (bits + blocksize - 1) / blocksize; /* max. number of blocks\n * to use for wNAF\n * splitting */\n\n pre_points_per_block = (size_t)1 << (w - 1);\n num = pre_points_per_block * numblocks; /* number of points to compute\n * and store */\n\n points = OPENSSL_malloc(sizeof(*points) * (num + 1));\n if (points == NULL) {\n ECerr(EC_F_EC_WNAF_PRECOMPUTE_MULT, ERR_R_MALLOC_FAILURE);\n goto err;\n }\n\n var = points;\n var[num] = NULL; /* pivot */\n for (i = 0; i < num; i++) {\n if ((var[i] = EC_POINT_new(group)) == NULL) {\n ECerr(EC_F_EC_WNAF_PRECOMPUTE_MULT, ERR_R_MALLOC_FAILURE);\n goto err;\n }\n }\n\n if ((tmp_point = EC_POINT_new(group)) == NULL\n || (base = EC_POINT_new(group)) == NULL) {\n ECerr(EC_F_EC_WNAF_PRECOMPUTE_MULT, ERR_R_MALLOC_FAILURE);\n goto err;\n }\n\n if (!EC_POINT_copy(base, generator))\n goto err;\n\n /* do the precomputation */\n for (i = 0; i < numblocks; i++) {\n size_t j;\n\n if (!EC_POINT_dbl(group, tmp_point, base, ctx))\n goto err;\n\n if (!EC_POINT_copy(*var++, base))\n goto err;\n\n for (j = 1; j < pre_points_per_block; j++, var++) {\n /*\n * calculate odd multiples of the current base point\n */\n if (!EC_POINT_add(group, *var, tmp_point, *(var - 1), ctx))\n goto err;\n }\n\n if (i < numblocks - 1) {\n /*\n * get the next base (multiply current one by 2^blocksize)\n */\n size_t k;\n\n if (blocksize <= 2) {\n ECerr(EC_F_EC_WNAF_PRECOMPUTE_MULT, ERR_R_INTERNAL_ERROR);\n goto err;\n }\n\n if (!EC_POINT_dbl(group, base, tmp_point, ctx))\n goto err;\n for (k = 2; k < blocksize; k++) {\n if (!EC_POINT_dbl(group, base, base, ctx))\n goto err;\n }\n }\n }\n\n if (!EC_POINTs_make_affine(group, num, points, ctx))\n goto err;\n\n pre_comp->group = group;\n pre_comp->blocksize = blocksize;\n pre_comp->numblocks = numblocks;\n pre_comp->w = w;\n pre_comp->points = points;\n points = NULL;\n pre_comp->num = num;\n SETPRECOMP(group, ec, pre_comp);\n pre_comp = NULL;\n ret = 1;\n\n err:\n BN_CTX_end(ctx);\n BN_CTX_free(new_ctx);\n EC_ec_pre_comp_free(pre_comp);\n if (points) {\n EC_POINT **p;\n\n for (p = points; *p != NULL; p++)\n EC_POINT_free(*p);\n OPENSSL_free(points);\n }\n EC_POINT_free(tmp_point);\n EC_POINT_free(base);\n return ret;\n}\n\nint ec_wNAF_have_precompute_mult(const EC_GROUP *group)\n{\n return HAVEPRECOMP(group, ec);\n}\n" }, { "path": "cryptomini/ec/ecdh_ossl.c", "content": "/*\n * Copyright 2002-2019 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \n\n#include \"internal/cryptlib.h\"\n\n#include \n#include \n#include \n#include \n#include \"ec_local.h\"\n\nint ossl_ecdh_compute_key(unsigned char **psec, size_t *pseclen,\n const EC_POINT *pub_key, const EC_KEY *ecdh)\n{\n if (ecdh->group->meth->ecdh_compute_key == NULL) {\n ECerr(EC_F_OSSL_ECDH_COMPUTE_KEY, EC_R_CURVE_DOES_NOT_SUPPORT_ECDH);\n return 0;\n }\n\n return ecdh->group->meth->ecdh_compute_key(psec, pseclen, pub_key, ecdh);\n}\n\n/*-\n * This implementation is based on the following primitives in the IEEE 1363 standard:\n * - ECKAS-DH1\n * - ECSVDP-DH\n */\nint ecdh_simple_compute_key(unsigned char **pout, size_t *poutlen,\n const EC_POINT *pub_key, const EC_KEY *ecdh)\n{\n BN_CTX *ctx;\n EC_POINT *tmp = NULL;\n BIGNUM *x = NULL;\n const BIGNUM *priv_key;\n const EC_GROUP *group;\n int ret = 0;\n size_t buflen, len;\n unsigned char *buf = NULL;\n\n if ((ctx = BN_CTX_new()) == NULL)\n goto err;\n BN_CTX_start(ctx);\n x = BN_CTX_get(ctx);\n if (x == NULL) {\n ECerr(EC_F_ECDH_SIMPLE_COMPUTE_KEY, ERR_R_MALLOC_FAILURE);\n goto err;\n }\n\n priv_key = EC_KEY_get0_private_key(ecdh);\n if (priv_key == NULL) {\n ECerr(EC_F_ECDH_SIMPLE_COMPUTE_KEY, EC_R_MISSING_PRIVATE_KEY);\n goto err;\n }\n\n group = EC_KEY_get0_group(ecdh);\n\n if (EC_KEY_get_flags(ecdh) & EC_FLAG_COFACTOR_ECDH) {\n if (!EC_GROUP_get_cofactor(group, x, NULL) ||\n !BN_mul(x, x, priv_key, ctx)) {\n ECerr(EC_F_ECDH_SIMPLE_COMPUTE_KEY, ERR_R_MALLOC_FAILURE);\n goto err;\n }\n priv_key = x;\n }\n\n if ((tmp = EC_POINT_new(group)) == NULL) {\n ECerr(EC_F_ECDH_SIMPLE_COMPUTE_KEY, ERR_R_MALLOC_FAILURE);\n goto err;\n }\n\n if (!EC_POINT_mul(group, tmp, NULL, pub_key, priv_key, ctx)) {\n ECerr(EC_F_ECDH_SIMPLE_COMPUTE_KEY, EC_R_POINT_ARITHMETIC_FAILURE);\n goto err;\n }\n\n if (!EC_POINT_get_affine_coordinates(group, tmp, x, NULL, ctx)) {\n ECerr(EC_F_ECDH_SIMPLE_COMPUTE_KEY, EC_R_POINT_ARITHMETIC_FAILURE);\n goto err;\n }\n\n buflen = (EC_GROUP_get_degree(group) + 7) / 8;\n len = BN_num_bytes(x);\n if (len > buflen) {\n ECerr(EC_F_ECDH_SIMPLE_COMPUTE_KEY, ERR_R_INTERNAL_ERROR);\n goto err;\n }\n if ((buf = OPENSSL_malloc(buflen)) == NULL) {\n ECerr(EC_F_ECDH_SIMPLE_COMPUTE_KEY, ERR_R_MALLOC_FAILURE);\n goto err;\n }\n\n memset(buf, 0, buflen - len);\n if (len != (size_t)BN_bn2bin(x, buf + buflen - len)) {\n ECerr(EC_F_ECDH_SIMPLE_COMPUTE_KEY, ERR_R_BN_LIB);\n goto err;\n }\n\n *pout = buf;\n *poutlen = buflen;\n buf = NULL;\n\n ret = 1;\n\n err:\n EC_POINT_clear_free(tmp);\n BN_CTX_end(ctx);\n BN_CTX_free(ctx);\n OPENSSL_free(buf);\n return ret;\n}\n" }, { "path": "cryptomini/ec/ecp_mont.c", "content": "/*\n * Copyright 2001-2019 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\n#include \"ec_local.h\"\n\nconst EC_METHOD *EC_GFp_mont_method(void)\n{\n static const EC_METHOD ret = {\n EC_FLAGS_DEFAULT_OCT,\n NID_X9_62_prime_field,\n ec_GFp_mont_group_init,\n ec_GFp_mont_group_finish,\n ec_GFp_mont_group_clear_finish,\n ec_GFp_mont_group_copy,\n ec_GFp_mont_group_set_curve,\n ec_GFp_simple_group_get_curve,\n ec_GFp_simple_group_get_degree,\n ec_group_simple_order_bits,\n ec_GFp_simple_group_check_discriminant,\n ec_GFp_simple_point_init,\n ec_GFp_simple_point_finish,\n ec_GFp_simple_point_clear_finish,\n ec_GFp_simple_point_copy,\n ec_GFp_simple_point_set_to_infinity,\n ec_GFp_simple_set_Jprojective_coordinates_GFp,\n ec_GFp_simple_get_Jprojective_coordinates_GFp,\n ec_GFp_simple_point_set_affine_coordinates,\n ec_GFp_simple_point_get_affine_coordinates,\n 0, 0, 0,\n ec_GFp_simple_add,\n ec_GFp_simple_dbl,\n ec_GFp_simple_invert,\n ec_GFp_simple_is_at_infinity,\n ec_GFp_simple_is_on_curve,\n ec_GFp_simple_cmp,\n ec_GFp_simple_make_affine,\n ec_GFp_simple_points_make_affine,\n 0 /* mul */ ,\n 0 /* precompute_mult */ ,\n 0 /* have_precompute_mult */ ,\n ec_GFp_mont_field_mul,\n ec_GFp_mont_field_sqr,\n 0 /* field_div */ ,\n ec_GFp_mont_field_inv,\n ec_GFp_mont_field_encode,\n ec_GFp_mont_field_decode,\n ec_GFp_mont_field_set_to_one,\n ec_key_simple_priv2oct,\n ec_key_simple_oct2priv,\n 0, /* set private */\n ec_key_simple_generate_key,\n ec_key_simple_check_key,\n ec_key_simple_generate_public_key,\n 0, /* keycopy */\n 0, /* keyfinish */\n ecdh_simple_compute_key,\n 0, /* field_inverse_mod_ord */\n ec_GFp_simple_blind_coordinates,\n ec_GFp_simple_ladder_pre,\n ec_GFp_simple_ladder_step,\n ec_GFp_simple_ladder_post\n };\n\n return &ret;\n}\n\nint ec_GFp_mont_group_init(EC_GROUP *group)\n{\n int ok;\n\n ok = ec_GFp_simple_group_init(group);\n group->field_data1 = NULL;\n group->field_data2 = NULL;\n return ok;\n}\n\nvoid ec_GFp_mont_group_finish(EC_GROUP *group)\n{\n BN_MONT_CTX_free(group->field_data1);\n group->field_data1 = NULL;\n BN_free(group->field_data2);\n group->field_data2 = NULL;\n ec_GFp_simple_group_finish(group);\n}\n\nvoid ec_GFp_mont_group_clear_finish(EC_GROUP *group)\n{\n BN_MONT_CTX_free(group->field_data1);\n group->field_data1 = NULL;\n BN_clear_free(group->field_data2);\n group->field_data2 = NULL;\n ec_GFp_simple_group_clear_finish(group);\n}\n\nint ec_GFp_mont_group_copy(EC_GROUP *dest, const EC_GROUP *src)\n{\n BN_MONT_CTX_free(dest->field_data1);\n dest->field_data1 = NULL;\n BN_clear_free(dest->field_data2);\n dest->field_data2 = NULL;\n\n if (!ec_GFp_simple_group_copy(dest, src))\n return 0;\n\n if (src->field_data1 != NULL) {\n dest->field_data1 = BN_MONT_CTX_new();\n if (dest->field_data1 == NULL)\n return 0;\n if (!BN_MONT_CTX_copy(dest->field_data1, src->field_data1))\n goto err;\n }\n if (src->field_data2 != NULL) {\n dest->field_data2 = BN_dup(src->field_data2);\n if (dest->field_data2 == NULL)\n goto err;\n }\n\n return 1;\n\n err:\n BN_MONT_CTX_free(dest->field_data1);\n dest->field_data1 = NULL;\n return 0;\n}\n\nint ec_GFp_mont_group_set_curve(EC_GROUP *group, const BIGNUM *p,\n const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)\n{\n BN_CTX *new_ctx = NULL;\n BN_MONT_CTX *mont = NULL;\n BIGNUM *one = NULL;\n int ret = 0;\n\n BN_MONT_CTX_free(group->field_data1);\n group->field_data1 = NULL;\n BN_free(group->field_data2);\n group->field_data2 = NULL;\n\n if (ctx == NULL) {\n ctx = new_ctx = BN_CTX_new();\n if (ctx == NULL)\n return 0;\n }\n\n mont = BN_MONT_CTX_new();\n if (mont == NULL)\n goto err;\n if (!BN_MONT_CTX_set(mont, p, ctx)) {\n ECerr(EC_F_EC_GFP_MONT_GROUP_SET_CURVE, ERR_R_BN_LIB);\n goto err;\n }\n one = BN_new();\n if (one == NULL)\n goto err;\n if (!BN_to_montgomery(one, BN_value_one(), mont, ctx))\n goto err;\n\n group->field_data1 = mont;\n mont = NULL;\n group->field_data2 = one;\n one = NULL;\n\n ret = ec_GFp_simple_group_set_curve(group, p, a, b, ctx);\n\n if (!ret) {\n BN_MONT_CTX_free(group->field_data1);\n group->field_data1 = NULL;\n BN_free(group->field_data2);\n group->field_data2 = NULL;\n }\n\n err:\n BN_free(one);\n BN_CTX_free(new_ctx);\n BN_MONT_CTX_free(mont);\n return ret;\n}\n\nint ec_GFp_mont_field_mul(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *ctx)\n{\n if (group->field_data1 == NULL) {\n ECerr(EC_F_EC_GFP_MONT_FIELD_MUL, EC_R_NOT_INITIALIZED);\n return 0;\n }\n\n return BN_mod_mul_montgomery(r, a, b, group->field_data1, ctx);\n}\n\nint ec_GFp_mont_field_sqr(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,\n BN_CTX *ctx)\n{\n if (group->field_data1 == NULL) {\n ECerr(EC_F_EC_GFP_MONT_FIELD_SQR, EC_R_NOT_INITIALIZED);\n return 0;\n }\n\n return BN_mod_mul_montgomery(r, a, a, group->field_data1, ctx);\n}\n\n/*-\n * Computes the multiplicative inverse of a in GF(p), storing the result in r.\n * If a is zero (or equivalent), you'll get a EC_R_CANNOT_INVERT error.\n * We have a Mont structure, so SCA hardening is FLT inversion.\n */\nint ec_GFp_mont_field_inv(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,\n BN_CTX *ctx)\n{\n BIGNUM *e = NULL;\n BN_CTX *new_ctx = NULL;\n int ret = 0;\n\n if (group->field_data1 == NULL)\n return 0;\n\n if (ctx == NULL && (ctx = new_ctx = BN_CTX_secure_new()) == NULL)\n return 0;\n\n BN_CTX_start(ctx);\n if ((e = BN_CTX_get(ctx)) == NULL)\n goto err;\n\n /* Inverse in constant time with Fermats Little Theorem */\n if (!BN_set_word(e, 2))\n goto err;\n if (!BN_sub(e, group->field, e))\n goto err;\n /*-\n * Exponent e is public.\n * No need for scatter-gather or BN_FLG_CONSTTIME.\n */\n if (!BN_mod_exp_mont(r, a, e, group->field, ctx, group->field_data1))\n goto err;\n\n /* throw an error on zero */\n if (BN_is_zero(r)) {\n ECerr(EC_F_EC_GFP_MONT_FIELD_INV, EC_R_CANNOT_INVERT);\n goto err;\n }\n\n ret = 1;\n\n err:\n BN_CTX_end(ctx);\n BN_CTX_free(new_ctx);\n return ret;\n}\n\nint ec_GFp_mont_field_encode(const EC_GROUP *group, BIGNUM *r,\n const BIGNUM *a, BN_CTX *ctx)\n{\n if (group->field_data1 == NULL) {\n ECerr(EC_F_EC_GFP_MONT_FIELD_ENCODE, EC_R_NOT_INITIALIZED);\n return 0;\n }\n\n return BN_to_montgomery(r, a, (BN_MONT_CTX *)group->field_data1, ctx);\n}\n\nint ec_GFp_mont_field_decode(const EC_GROUP *group, BIGNUM *r,\n const BIGNUM *a, BN_CTX *ctx)\n{\n if (group->field_data1 == NULL) {\n ECerr(EC_F_EC_GFP_MONT_FIELD_DECODE, EC_R_NOT_INITIALIZED);\n return 0;\n }\n\n return BN_from_montgomery(r, a, group->field_data1, ctx);\n}\n\nint ec_GFp_mont_field_set_to_one(const EC_GROUP *group, BIGNUM *r,\n BN_CTX *ctx)\n{\n if (group->field_data2 == NULL) {\n ECerr(EC_F_EC_GFP_MONT_FIELD_SET_TO_ONE, EC_R_NOT_INITIALIZED);\n return 0;\n }\n\n if (!BN_copy(r, group->field_data2))\n return 0;\n return 1;\n}\n" }, { "path": "cryptomini/ec/ecp_nist.c", "content": "/*\n * Copyright 2001-2019 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\n#include \n#include \n#include \"ec_local.h\"\n\nconst EC_METHOD *EC_GFp_nist_method(void)\n{\n static const EC_METHOD ret = {\n EC_FLAGS_DEFAULT_OCT,\n NID_X9_62_prime_field,\n ec_GFp_simple_group_init,\n ec_GFp_simple_group_finish,\n ec_GFp_simple_group_clear_finish,\n ec_GFp_nist_group_copy,\n ec_GFp_nist_group_set_curve,\n ec_GFp_simple_group_get_curve,\n ec_GFp_simple_group_get_degree,\n ec_group_simple_order_bits,\n ec_GFp_simple_group_check_discriminant,\n ec_GFp_simple_point_init,\n ec_GFp_simple_point_finish,\n ec_GFp_simple_point_clear_finish,\n ec_GFp_simple_point_copy,\n ec_GFp_simple_point_set_to_infinity,\n ec_GFp_simple_set_Jprojective_coordinates_GFp,\n ec_GFp_simple_get_Jprojective_coordinates_GFp,\n ec_GFp_simple_point_set_affine_coordinates,\n ec_GFp_simple_point_get_affine_coordinates,\n 0, 0, 0,\n ec_GFp_simple_add,\n ec_GFp_simple_dbl,\n ec_GFp_simple_invert,\n ec_GFp_simple_is_at_infinity,\n ec_GFp_simple_is_on_curve,\n ec_GFp_simple_cmp,\n ec_GFp_simple_make_affine,\n ec_GFp_simple_points_make_affine,\n 0 /* mul */ ,\n 0 /* precompute_mult */ ,\n 0 /* have_precompute_mult */ ,\n ec_GFp_nist_field_mul,\n ec_GFp_nist_field_sqr,\n 0 /* field_div */ ,\n ec_GFp_simple_field_inv,\n 0 /* field_encode */ ,\n 0 /* field_decode */ ,\n 0, /* field_set_to_one */\n ec_key_simple_priv2oct,\n ec_key_simple_oct2priv,\n 0, /* set private */\n ec_key_simple_generate_key,\n ec_key_simple_check_key,\n ec_key_simple_generate_public_key,\n 0, /* keycopy */\n 0, /* keyfinish */\n ecdh_simple_compute_key,\n 0, /* field_inverse_mod_ord */\n ec_GFp_simple_blind_coordinates,\n ec_GFp_simple_ladder_pre,\n ec_GFp_simple_ladder_step,\n ec_GFp_simple_ladder_post\n };\n\n return &ret;\n}\n\nint ec_GFp_nist_group_copy(EC_GROUP *dest, const EC_GROUP *src)\n{\n dest->field_mod_func = src->field_mod_func;\n\n return ec_GFp_simple_group_copy(dest, src);\n}\n\nint ec_GFp_nist_group_set_curve(EC_GROUP *group, const BIGNUM *p,\n const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)\n{\n int ret = 0;\n BN_CTX *new_ctx = NULL;\n\n if (ctx == NULL)\n if ((ctx = new_ctx = BN_CTX_new()) == NULL)\n return 0;\n\n BN_CTX_start(ctx);\n\n if (BN_ucmp(BN_get0_nist_prime_192(), p) == 0)\n group->field_mod_func = BN_nist_mod_192;\n else if (BN_ucmp(BN_get0_nist_prime_224(), p) == 0)\n group->field_mod_func = BN_nist_mod_224;\n else if (BN_ucmp(BN_get0_nist_prime_256(), p) == 0)\n group->field_mod_func = BN_nist_mod_256;\n else if (BN_ucmp(BN_get0_nist_prime_384(), p) == 0)\n group->field_mod_func = BN_nist_mod_384;\n else if (BN_ucmp(BN_get0_nist_prime_521(), p) == 0)\n group->field_mod_func = BN_nist_mod_521;\n else {\n ECerr(EC_F_EC_GFP_NIST_GROUP_SET_CURVE, EC_R_NOT_A_NIST_PRIME);\n goto err;\n }\n\n ret = ec_GFp_simple_group_set_curve(group, p, a, b, ctx);\n\n err:\n BN_CTX_end(ctx);\n BN_CTX_free(new_ctx);\n return ret;\n}\n\nint ec_GFp_nist_field_mul(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *ctx)\n{\n int ret = 0;\n BN_CTX *ctx_new = NULL;\n\n if (!group || !r || !a || !b) {\n ECerr(EC_F_EC_GFP_NIST_FIELD_MUL, ERR_R_PASSED_NULL_PARAMETER);\n goto err;\n }\n if (!ctx)\n if ((ctx_new = ctx = BN_CTX_new()) == NULL)\n goto err;\n\n if (!BN_mul(r, a, b, ctx))\n goto err;\n if (!group->field_mod_func(r, r, group->field, ctx))\n goto err;\n\n ret = 1;\n err:\n BN_CTX_free(ctx_new);\n return ret;\n}\n\nint ec_GFp_nist_field_sqr(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,\n BN_CTX *ctx)\n{\n int ret = 0;\n BN_CTX *ctx_new = NULL;\n\n if (!group || !r || !a) {\n ECerr(EC_F_EC_GFP_NIST_FIELD_SQR, EC_R_PASSED_NULL_PARAMETER);\n goto err;\n }\n if (!ctx)\n if ((ctx_new = ctx = BN_CTX_new()) == NULL)\n goto err;\n\n if (!BN_sqr(r, a, ctx))\n goto err;\n if (!group->field_mod_func(r, r, group->field, ctx))\n goto err;\n\n ret = 1;\n err:\n BN_CTX_free(ctx_new);\n return ret;\n}\n" }, { "path": "cryptomini/ec/ecp_smpl.c", "content": "/*\n * Copyright 2001-2020 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \n\n#include \"ec_local.h\"\n\nconst EC_METHOD *EC_GFp_simple_method(void)\n{\n static const EC_METHOD ret = {\n EC_FLAGS_DEFAULT_OCT,\n NID_X9_62_prime_field,\n ec_GFp_simple_group_init,\n ec_GFp_simple_group_finish,\n ec_GFp_simple_group_clear_finish,\n ec_GFp_simple_group_copy,\n ec_GFp_simple_group_set_curve,\n ec_GFp_simple_group_get_curve,\n ec_GFp_simple_group_get_degree,\n ec_group_simple_order_bits,\n ec_GFp_simple_group_check_discriminant,\n ec_GFp_simple_point_init,\n ec_GFp_simple_point_finish,\n ec_GFp_simple_point_clear_finish,\n ec_GFp_simple_point_copy,\n ec_GFp_simple_point_set_to_infinity,\n ec_GFp_simple_set_Jprojective_coordinates_GFp,\n ec_GFp_simple_get_Jprojective_coordinates_GFp,\n ec_GFp_simple_point_set_affine_coordinates,\n ec_GFp_simple_point_get_affine_coordinates,\n 0, 0, 0,\n ec_GFp_simple_add,\n ec_GFp_simple_dbl,\n ec_GFp_simple_invert,\n ec_GFp_simple_is_at_infinity,\n ec_GFp_simple_is_on_curve,\n ec_GFp_simple_cmp,\n ec_GFp_simple_make_affine,\n ec_GFp_simple_points_make_affine,\n 0 /* mul */ ,\n 0 /* precompute_mult */ ,\n 0 /* have_precompute_mult */ ,\n ec_GFp_simple_field_mul,\n ec_GFp_simple_field_sqr,\n 0 /* field_div */ ,\n ec_GFp_simple_field_inv,\n 0 /* field_encode */ ,\n 0 /* field_decode */ ,\n 0, /* field_set_to_one */\n ec_key_simple_priv2oct,\n ec_key_simple_oct2priv,\n 0, /* set private */\n ec_key_simple_generate_key,\n ec_key_simple_check_key,\n ec_key_simple_generate_public_key,\n 0, /* keycopy */\n 0, /* keyfinish */\n ecdh_simple_compute_key,\n 0, /* field_inverse_mod_ord */\n ec_GFp_simple_blind_coordinates,\n ec_GFp_simple_ladder_pre,\n ec_GFp_simple_ladder_step,\n ec_GFp_simple_ladder_post\n };\n\n return &ret;\n}\n\n/*\n * Most method functions in this file are designed to work with\n * non-trivial representations of field elements if necessary\n * (see ecp_mont.c): while standard modular addition and subtraction\n * are used, the field_mul and field_sqr methods will be used for\n * multiplication, and field_encode and field_decode (if defined)\n * will be used for converting between representations.\n *\n * Functions ec_GFp_simple_points_make_affine() and\n * ec_GFp_simple_point_get_affine_coordinates() specifically assume\n * that if a non-trivial representation is used, it is a Montgomery\n * representation (i.e. 'encoding' means multiplying by some factor R).\n */\n\nint ec_GFp_simple_group_init(EC_GROUP *group)\n{\n group->field = BN_new();\n group->a = BN_new();\n group->b = BN_new();\n if (group->field == NULL || group->a == NULL || group->b == NULL) {\n BN_free(group->field);\n BN_free(group->a);\n BN_free(group->b);\n return 0;\n }\n group->a_is_minus3 = 0;\n return 1;\n}\n\nvoid ec_GFp_simple_group_finish(EC_GROUP *group)\n{\n BN_free(group->field);\n BN_free(group->a);\n BN_free(group->b);\n}\n\nvoid ec_GFp_simple_group_clear_finish(EC_GROUP *group)\n{\n BN_clear_free(group->field);\n BN_clear_free(group->a);\n BN_clear_free(group->b);\n}\n\nint ec_GFp_simple_group_copy(EC_GROUP *dest, const EC_GROUP *src)\n{\n if (!BN_copy(dest->field, src->field))\n return 0;\n if (!BN_copy(dest->a, src->a))\n return 0;\n if (!BN_copy(dest->b, src->b))\n return 0;\n\n dest->a_is_minus3 = src->a_is_minus3;\n\n return 1;\n}\n\nint ec_GFp_simple_group_set_curve(EC_GROUP *group,\n const BIGNUM *p, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *ctx)\n{\n int ret = 0;\n BN_CTX *new_ctx = NULL;\n BIGNUM *tmp_a;\n\n /* p must be a prime > 3 */\n if (BN_num_bits(p) <= 2 || !BN_is_odd(p)) {\n ECerr(EC_F_EC_GFP_SIMPLE_GROUP_SET_CURVE, EC_R_INVALID_FIELD);\n return 0;\n }\n\n if (ctx == NULL) {\n ctx = new_ctx = BN_CTX_new();\n if (ctx == NULL)\n return 0;\n }\n\n BN_CTX_start(ctx);\n tmp_a = BN_CTX_get(ctx);\n if (tmp_a == NULL)\n goto err;\n\n /* group->field */\n if (!BN_copy(group->field, p))\n goto err;\n BN_set_negative(group->field, 0);\n\n /* group->a */\n if (!BN_nnmod(tmp_a, a, p, ctx))\n goto err;\n if (group->meth->field_encode) {\n if (!group->meth->field_encode(group, group->a, tmp_a, ctx))\n goto err;\n } else if (!BN_copy(group->a, tmp_a))\n goto err;\n\n /* group->b */\n if (!BN_nnmod(group->b, b, p, ctx))\n goto err;\n if (group->meth->field_encode)\n if (!group->meth->field_encode(group, group->b, group->b, ctx))\n goto err;\n\n /* group->a_is_minus3 */\n if (!BN_add_word(tmp_a, 3))\n goto err;\n group->a_is_minus3 = (0 == BN_cmp(tmp_a, group->field));\n\n ret = 1;\n\n err:\n BN_CTX_end(ctx);\n BN_CTX_free(new_ctx);\n return ret;\n}\n\nint ec_GFp_simple_group_get_curve(const EC_GROUP *group, BIGNUM *p, BIGNUM *a,\n BIGNUM *b, BN_CTX *ctx)\n{\n int ret = 0;\n BN_CTX *new_ctx = NULL;\n\n if (p != NULL) {\n if (!BN_copy(p, group->field))\n return 0;\n }\n\n if (a != NULL || b != NULL) {\n if (group->meth->field_decode) {\n if (ctx == NULL) {\n ctx = new_ctx = BN_CTX_new();\n if (ctx == NULL)\n return 0;\n }\n if (a != NULL) {\n if (!group->meth->field_decode(group, a, group->a, ctx))\n goto err;\n }\n if (b != NULL) {\n if (!group->meth->field_decode(group, b, group->b, ctx))\n goto err;\n }\n } else {\n if (a != NULL) {\n if (!BN_copy(a, group->a))\n goto err;\n }\n if (b != NULL) {\n if (!BN_copy(b, group->b))\n goto err;\n }\n }\n }\n\n ret = 1;\n\n err:\n BN_CTX_free(new_ctx);\n return ret;\n}\n\nint ec_GFp_simple_group_get_degree(const EC_GROUP *group)\n{\n return BN_num_bits(group->field);\n}\n\nint ec_GFp_simple_group_check_discriminant(const EC_GROUP *group, BN_CTX *ctx)\n{\n int ret = 0;\n BIGNUM *a, *b, *order, *tmp_1, *tmp_2;\n const BIGNUM *p = group->field;\n BN_CTX *new_ctx = NULL;\n\n if (ctx == NULL) {\n ctx = new_ctx = BN_CTX_new();\n if (ctx == NULL) {\n ECerr(EC_F_EC_GFP_SIMPLE_GROUP_CHECK_DISCRIMINANT,\n ERR_R_MALLOC_FAILURE);\n goto err;\n }\n }\n BN_CTX_start(ctx);\n a = BN_CTX_get(ctx);\n b = BN_CTX_get(ctx);\n tmp_1 = BN_CTX_get(ctx);\n tmp_2 = BN_CTX_get(ctx);\n order = BN_CTX_get(ctx);\n if (order == NULL)\n goto err;\n\n if (group->meth->field_decode) {\n if (!group->meth->field_decode(group, a, group->a, ctx))\n goto err;\n if (!group->meth->field_decode(group, b, group->b, ctx))\n goto err;\n } else {\n if (!BN_copy(a, group->a))\n goto err;\n if (!BN_copy(b, group->b))\n goto err;\n }\n\n /*-\n * check the discriminant:\n * y^2 = x^3 + a*x + b is an elliptic curve <=> 4*a^3 + 27*b^2 != 0 (mod p)\n * 0 =< a, b < p\n */\n if (BN_is_zero(a)) {\n if (BN_is_zero(b))\n goto err;\n } else if (!BN_is_zero(b)) {\n if (!BN_mod_sqr(tmp_1, a, p, ctx))\n goto err;\n if (!BN_mod_mul(tmp_2, tmp_1, a, p, ctx))\n goto err;\n if (!BN_lshift(tmp_1, tmp_2, 2))\n goto err;\n /* tmp_1 = 4*a^3 */\n\n if (!BN_mod_sqr(tmp_2, b, p, ctx))\n goto err;\n if (!BN_mul_word(tmp_2, 27))\n goto err;\n /* tmp_2 = 27*b^2 */\n\n if (!BN_mod_add(a, tmp_1, tmp_2, p, ctx))\n goto err;\n if (BN_is_zero(a))\n goto err;\n }\n ret = 1;\n\n err:\n BN_CTX_end(ctx);\n BN_CTX_free(new_ctx);\n return ret;\n}\n\nint ec_GFp_simple_point_init(EC_POINT *point)\n{\n point->X = BN_new();\n point->Y = BN_new();\n point->Z = BN_new();\n point->Z_is_one = 0;\n\n if (point->X == NULL || point->Y == NULL || point->Z == NULL) {\n BN_free(point->X);\n BN_free(point->Y);\n BN_free(point->Z);\n return 0;\n }\n return 1;\n}\n\nvoid ec_GFp_simple_point_finish(EC_POINT *point)\n{\n BN_free(point->X);\n BN_free(point->Y);\n BN_free(point->Z);\n}\n\nvoid ec_GFp_simple_point_clear_finish(EC_POINT *point)\n{\n BN_clear_free(point->X);\n BN_clear_free(point->Y);\n BN_clear_free(point->Z);\n point->Z_is_one = 0;\n}\n\nint ec_GFp_simple_point_copy(EC_POINT *dest, const EC_POINT *src)\n{\n if (!BN_copy(dest->X, src->X))\n return 0;\n if (!BN_copy(dest->Y, src->Y))\n return 0;\n if (!BN_copy(dest->Z, src->Z))\n return 0;\n dest->Z_is_one = src->Z_is_one;\n dest->curve_name = src->curve_name;\n\n return 1;\n}\n\nint ec_GFp_simple_point_set_to_infinity(const EC_GROUP *group,\n EC_POINT *point)\n{\n point->Z_is_one = 0;\n BN_zero(point->Z);\n return 1;\n}\n\nint ec_GFp_simple_set_Jprojective_coordinates_GFp(const EC_GROUP *group,\n EC_POINT *point,\n const BIGNUM *x,\n const BIGNUM *y,\n const BIGNUM *z,\n BN_CTX *ctx)\n{\n BN_CTX *new_ctx = NULL;\n int ret = 0;\n\n if (ctx == NULL) {\n ctx = new_ctx = BN_CTX_new();\n if (ctx == NULL)\n return 0;\n }\n\n if (x != NULL) {\n if (!BN_nnmod(point->X, x, group->field, ctx))\n goto err;\n if (group->meth->field_encode) {\n if (!group->meth->field_encode(group, point->X, point->X, ctx))\n goto err;\n }\n }\n\n if (y != NULL) {\n if (!BN_nnmod(point->Y, y, group->field, ctx))\n goto err;\n if (group->meth->field_encode) {\n if (!group->meth->field_encode(group, point->Y, point->Y, ctx))\n goto err;\n }\n }\n\n if (z != NULL) {\n int Z_is_one;\n\n if (!BN_nnmod(point->Z, z, group->field, ctx))\n goto err;\n Z_is_one = BN_is_one(point->Z);\n if (group->meth->field_encode) {\n if (Z_is_one && (group->meth->field_set_to_one != 0)) {\n if (!group->meth->field_set_to_one(group, point->Z, ctx))\n goto err;\n } else {\n if (!group->\n meth->field_encode(group, point->Z, point->Z, ctx))\n goto err;\n }\n }\n point->Z_is_one = Z_is_one;\n }\n\n ret = 1;\n\n err:\n BN_CTX_free(new_ctx);\n return ret;\n}\n\nint ec_GFp_simple_get_Jprojective_coordinates_GFp(const EC_GROUP *group,\n const EC_POINT *point,\n BIGNUM *x, BIGNUM *y,\n BIGNUM *z, BN_CTX *ctx)\n{\n BN_CTX *new_ctx = NULL;\n int ret = 0;\n\n if (group->meth->field_decode != 0) {\n if (ctx == NULL) {\n ctx = new_ctx = BN_CTX_new();\n if (ctx == NULL)\n return 0;\n }\n\n if (x != NULL) {\n if (!group->meth->field_decode(group, x, point->X, ctx))\n goto err;\n }\n if (y != NULL) {\n if (!group->meth->field_decode(group, y, point->Y, ctx))\n goto err;\n }\n if (z != NULL) {\n if (!group->meth->field_decode(group, z, point->Z, ctx))\n goto err;\n }\n } else {\n if (x != NULL) {\n if (!BN_copy(x, point->X))\n goto err;\n }\n if (y != NULL) {\n if (!BN_copy(y, point->Y))\n goto err;\n }\n if (z != NULL) {\n if (!BN_copy(z, point->Z))\n goto err;\n }\n }\n\n ret = 1;\n\n err:\n BN_CTX_free(new_ctx);\n return ret;\n}\n\nint ec_GFp_simple_point_set_affine_coordinates(const EC_GROUP *group,\n EC_POINT *point,\n const BIGNUM *x,\n const BIGNUM *y, BN_CTX *ctx)\n{\n if (x == NULL || y == NULL) {\n /*\n * unlike for projective coordinates, we do not tolerate this\n */\n ECerr(EC_F_EC_GFP_SIMPLE_POINT_SET_AFFINE_COORDINATES,\n ERR_R_PASSED_NULL_PARAMETER);\n return 0;\n }\n\n return EC_POINT_set_Jprojective_coordinates_GFp(group, point, x, y,\n BN_value_one(), ctx);\n}\n\nint ec_GFp_simple_point_get_affine_coordinates(const EC_GROUP *group,\n const EC_POINT *point,\n BIGNUM *x, BIGNUM *y,\n BN_CTX *ctx)\n{\n BN_CTX *new_ctx = NULL;\n BIGNUM *Z, *Z_1, *Z_2, *Z_3;\n const BIGNUM *Z_;\n int ret = 0;\n\n if (EC_POINT_is_at_infinity(group, point)) {\n ECerr(EC_F_EC_GFP_SIMPLE_POINT_GET_AFFINE_COORDINATES,\n EC_R_POINT_AT_INFINITY);\n return 0;\n }\n\n if (ctx == NULL) {\n ctx = new_ctx = BN_CTX_new();\n if (ctx == NULL)\n return 0;\n }\n\n BN_CTX_start(ctx);\n Z = BN_CTX_get(ctx);\n Z_1 = BN_CTX_get(ctx);\n Z_2 = BN_CTX_get(ctx);\n Z_3 = BN_CTX_get(ctx);\n if (Z_3 == NULL)\n goto err;\n\n /* transform (X, Y, Z) into (x, y) := (X/Z^2, Y/Z^3) */\n\n if (group->meth->field_decode) {\n if (!group->meth->field_decode(group, Z, point->Z, ctx))\n goto err;\n Z_ = Z;\n } else {\n Z_ = point->Z;\n }\n\n if (BN_is_one(Z_)) {\n if (group->meth->field_decode) {\n if (x != NULL) {\n if (!group->meth->field_decode(group, x, point->X, ctx))\n goto err;\n }\n if (y != NULL) {\n if (!group->meth->field_decode(group, y, point->Y, ctx))\n goto err;\n }\n } else {\n if (x != NULL) {\n if (!BN_copy(x, point->X))\n goto err;\n }\n if (y != NULL) {\n if (!BN_copy(y, point->Y))\n goto err;\n }\n }\n } else {\n if (!group->meth->field_inv(group, Z_1, Z_, ctx)) {\n ECerr(EC_F_EC_GFP_SIMPLE_POINT_GET_AFFINE_COORDINATES,\n ERR_R_BN_LIB);\n goto err;\n }\n\n if (group->meth->field_encode == 0) {\n /* field_sqr works on standard representation */\n if (!group->meth->field_sqr(group, Z_2, Z_1, ctx))\n goto err;\n } else {\n if (!BN_mod_sqr(Z_2, Z_1, group->field, ctx))\n goto err;\n }\n\n if (x != NULL) {\n /*\n * in the Montgomery case, field_mul will cancel out Montgomery\n * factor in X:\n */\n if (!group->meth->field_mul(group, x, point->X, Z_2, ctx))\n goto err;\n }\n\n if (y != NULL) {\n if (group->meth->field_encode == 0) {\n /*\n * field_mul works on standard representation\n */\n if (!group->meth->field_mul(group, Z_3, Z_2, Z_1, ctx))\n goto err;\n } else {\n if (!BN_mod_mul(Z_3, Z_2, Z_1, group->field, ctx))\n goto err;\n }\n\n /*\n * in the Montgomery case, field_mul will cancel out Montgomery\n * factor in Y:\n */\n if (!group->meth->field_mul(group, y, point->Y, Z_3, ctx))\n goto err;\n }\n }\n\n ret = 1;\n\n err:\n BN_CTX_end(ctx);\n BN_CTX_free(new_ctx);\n return ret;\n}\n\nint ec_GFp_simple_add(const EC_GROUP *group, EC_POINT *r, const EC_POINT *a,\n const EC_POINT *b, BN_CTX *ctx)\n{\n int (*field_mul) (const EC_GROUP *, BIGNUM *, const BIGNUM *,\n const BIGNUM *, BN_CTX *);\n int (*field_sqr) (const EC_GROUP *, BIGNUM *, const BIGNUM *, BN_CTX *);\n const BIGNUM *p;\n BN_CTX *new_ctx = NULL;\n BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6;\n int ret = 0;\n\n if (a == b)\n return EC_POINT_dbl(group, r, a, ctx);\n if (EC_POINT_is_at_infinity(group, a))\n return EC_POINT_copy(r, b);\n if (EC_POINT_is_at_infinity(group, b))\n return EC_POINT_copy(r, a);\n\n field_mul = group->meth->field_mul;\n field_sqr = group->meth->field_sqr;\n p = group->field;\n\n if (ctx == NULL) {\n ctx = new_ctx = BN_CTX_new();\n if (ctx == NULL)\n return 0;\n }\n\n BN_CTX_start(ctx);\n n0 = BN_CTX_get(ctx);\n n1 = BN_CTX_get(ctx);\n n2 = BN_CTX_get(ctx);\n n3 = BN_CTX_get(ctx);\n n4 = BN_CTX_get(ctx);\n n5 = BN_CTX_get(ctx);\n n6 = BN_CTX_get(ctx);\n if (n6 == NULL)\n goto end;\n\n /*\n * Note that in this function we must not read components of 'a' or 'b'\n * once we have written the corresponding components of 'r'. ('r' might\n * be one of 'a' or 'b'.)\n */\n\n /* n1, n2 */\n if (b->Z_is_one) {\n if (!BN_copy(n1, a->X))\n goto end;\n if (!BN_copy(n2, a->Y))\n goto end;\n /* n1 = X_a */\n /* n2 = Y_a */\n } else {\n if (!field_sqr(group, n0, b->Z, ctx))\n goto end;\n if (!field_mul(group, n1, a->X, n0, ctx))\n goto end;\n /* n1 = X_a * Z_b^2 */\n\n if (!field_mul(group, n0, n0, b->Z, ctx))\n goto end;\n if (!field_mul(group, n2, a->Y, n0, ctx))\n goto end;\n /* n2 = Y_a * Z_b^3 */\n }\n\n /* n3, n4 */\n if (a->Z_is_one) {\n if (!BN_copy(n3, b->X))\n goto end;\n if (!BN_copy(n4, b->Y))\n goto end;\n /* n3 = X_b */\n /* n4 = Y_b */\n } else {\n if (!field_sqr(group, n0, a->Z, ctx))\n goto end;\n if (!field_mul(group, n3, b->X, n0, ctx))\n goto end;\n /* n3 = X_b * Z_a^2 */\n\n if (!field_mul(group, n0, n0, a->Z, ctx))\n goto end;\n if (!field_mul(group, n4, b->Y, n0, ctx))\n goto end;\n /* n4 = Y_b * Z_a^3 */\n }\n\n /* n5, n6 */\n if (!BN_mod_sub_quick(n5, n1, n3, p))\n goto end;\n if (!BN_mod_sub_quick(n6, n2, n4, p))\n goto end;\n /* n5 = n1 - n3 */\n /* n6 = n2 - n4 */\n\n if (BN_is_zero(n5)) {\n if (BN_is_zero(n6)) {\n /* a is the same point as b */\n BN_CTX_end(ctx);\n ret = EC_POINT_dbl(group, r, a, ctx);\n ctx = NULL;\n goto end;\n } else {\n /* a is the inverse of b */\n BN_zero(r->Z);\n r->Z_is_one = 0;\n ret = 1;\n goto end;\n }\n }\n\n /* 'n7', 'n8' */\n if (!BN_mod_add_quick(n1, n1, n3, p))\n goto end;\n if (!BN_mod_add_quick(n2, n2, n4, p))\n goto end;\n /* 'n7' = n1 + n3 */\n /* 'n8' = n2 + n4 */\n\n /* Z_r */\n if (a->Z_is_one && b->Z_is_one) {\n if (!BN_copy(r->Z, n5))\n goto end;\n } else {\n if (a->Z_is_one) {\n if (!BN_copy(n0, b->Z))\n goto end;\n } else if (b->Z_is_one) {\n if (!BN_copy(n0, a->Z))\n goto end;\n } else {\n if (!field_mul(group, n0, a->Z, b->Z, ctx))\n goto end;\n }\n if (!field_mul(group, r->Z, n0, n5, ctx))\n goto end;\n }\n r->Z_is_one = 0;\n /* Z_r = Z_a * Z_b * n5 */\n\n /* X_r */\n if (!field_sqr(group, n0, n6, ctx))\n goto end;\n if (!field_sqr(group, n4, n5, ctx))\n goto end;\n if (!field_mul(group, n3, n1, n4, ctx))\n goto end;\n if (!BN_mod_sub_quick(r->X, n0, n3, p))\n goto end;\n /* X_r = n6^2 - n5^2 * 'n7' */\n\n /* 'n9' */\n if (!BN_mod_lshift1_quick(n0, r->X, p))\n goto end;\n if (!BN_mod_sub_quick(n0, n3, n0, p))\n goto end;\n /* n9 = n5^2 * 'n7' - 2 * X_r */\n\n /* Y_r */\n if (!field_mul(group, n0, n0, n6, ctx))\n goto end;\n if (!field_mul(group, n5, n4, n5, ctx))\n goto end; /* now n5 is n5^3 */\n if (!field_mul(group, n1, n2, n5, ctx))\n goto end;\n if (!BN_mod_sub_quick(n0, n0, n1, p))\n goto end;\n if (BN_is_odd(n0))\n if (!BN_add(n0, n0, p))\n goto end;\n /* now 0 <= n0 < 2*p, and n0 is even */\n if (!BN_rshift1(r->Y, n0))\n goto end;\n /* Y_r = (n6 * 'n9' - 'n8' * 'n5^3') / 2 */\n\n ret = 1;\n\n end:\n BN_CTX_end(ctx);\n BN_CTX_free(new_ctx);\n return ret;\n}\n\nint ec_GFp_simple_dbl(const EC_GROUP *group, EC_POINT *r, const EC_POINT *a,\n BN_CTX *ctx)\n{\n int (*field_mul) (const EC_GROUP *, BIGNUM *, const BIGNUM *,\n const BIGNUM *, BN_CTX *);\n int (*field_sqr) (const EC_GROUP *, BIGNUM *, const BIGNUM *, BN_CTX *);\n const BIGNUM *p;\n BN_CTX *new_ctx = NULL;\n BIGNUM *n0, *n1, *n2, *n3;\n int ret = 0;\n\n if (EC_POINT_is_at_infinity(group, a)) {\n BN_zero(r->Z);\n r->Z_is_one = 0;\n return 1;\n }\n\n field_mul = group->meth->field_mul;\n field_sqr = group->meth->field_sqr;\n p = group->field;\n\n if (ctx == NULL) {\n ctx = new_ctx = BN_CTX_new();\n if (ctx == NULL)\n return 0;\n }\n\n BN_CTX_start(ctx);\n n0 = BN_CTX_get(ctx);\n n1 = BN_CTX_get(ctx);\n n2 = BN_CTX_get(ctx);\n n3 = BN_CTX_get(ctx);\n if (n3 == NULL)\n goto err;\n\n /*\n * Note that in this function we must not read components of 'a' once we\n * have written the corresponding components of 'r'. ('r' might the same\n * as 'a'.)\n */\n\n /* n1 */\n if (a->Z_is_one) {\n if (!field_sqr(group, n0, a->X, ctx))\n goto err;\n if (!BN_mod_lshift1_quick(n1, n0, p))\n goto err;\n if (!BN_mod_add_quick(n0, n0, n1, p))\n goto err;\n if (!BN_mod_add_quick(n1, n0, group->a, p))\n goto err;\n /* n1 = 3 * X_a^2 + a_curve */\n } else if (group->a_is_minus3) {\n if (!field_sqr(group, n1, a->Z, ctx))\n goto err;\n if (!BN_mod_add_quick(n0, a->X, n1, p))\n goto err;\n if (!BN_mod_sub_quick(n2, a->X, n1, p))\n goto err;\n if (!field_mul(group, n1, n0, n2, ctx))\n goto err;\n if (!BN_mod_lshift1_quick(n0, n1, p))\n goto err;\n if (!BN_mod_add_quick(n1, n0, n1, p))\n goto err;\n /*-\n * n1 = 3 * (X_a + Z_a^2) * (X_a - Z_a^2)\n * = 3 * X_a^2 - 3 * Z_a^4\n */\n } else {\n if (!field_sqr(group, n0, a->X, ctx))\n goto err;\n if (!BN_mod_lshift1_quick(n1, n0, p))\n goto err;\n if (!BN_mod_add_quick(n0, n0, n1, p))\n goto err;\n if (!field_sqr(group, n1, a->Z, ctx))\n goto err;\n if (!field_sqr(group, n1, n1, ctx))\n goto err;\n if (!field_mul(group, n1, n1, group->a, ctx))\n goto err;\n if (!BN_mod_add_quick(n1, n1, n0, p))\n goto err;\n /* n1 = 3 * X_a^2 + a_curve * Z_a^4 */\n }\n\n /* Z_r */\n if (a->Z_is_one) {\n if (!BN_copy(n0, a->Y))\n goto err;\n } else {\n if (!field_mul(group, n0, a->Y, a->Z, ctx))\n goto err;\n }\n if (!BN_mod_lshift1_quick(r->Z, n0, p))\n goto err;\n r->Z_is_one = 0;\n /* Z_r = 2 * Y_a * Z_a */\n\n /* n2 */\n if (!field_sqr(group, n3, a->Y, ctx))\n goto err;\n if (!field_mul(group, n2, a->X, n3, ctx))\n goto err;\n if (!BN_mod_lshift_quick(n2, n2, 2, p))\n goto err;\n /* n2 = 4 * X_a * Y_a^2 */\n\n /* X_r */\n if (!BN_mod_lshift1_quick(n0, n2, p))\n goto err;\n if (!field_sqr(group, r->X, n1, ctx))\n goto err;\n if (!BN_mod_sub_quick(r->X, r->X, n0, p))\n goto err;\n /* X_r = n1^2 - 2 * n2 */\n\n /* n3 */\n if (!field_sqr(group, n0, n3, ctx))\n goto err;\n if (!BN_mod_lshift_quick(n3, n0, 3, p))\n goto err;\n /* n3 = 8 * Y_a^4 */\n\n /* Y_r */\n if (!BN_mod_sub_quick(n0, n2, r->X, p))\n goto err;\n if (!field_mul(group, n0, n1, n0, ctx))\n goto err;\n if (!BN_mod_sub_quick(r->Y, n0, n3, p))\n goto err;\n /* Y_r = n1 * (n2 - X_r) - n3 */\n\n ret = 1;\n\n err:\n BN_CTX_end(ctx);\n BN_CTX_free(new_ctx);\n return ret;\n}\n\nint ec_GFp_simple_invert(const EC_GROUP *group, EC_POINT *point, BN_CTX *ctx)\n{\n if (EC_POINT_is_at_infinity(group, point) || BN_is_zero(point->Y))\n /* point is its own inverse */\n return 1;\n\n return BN_usub(point->Y, group->field, point->Y);\n}\n\nint ec_GFp_simple_is_at_infinity(const EC_GROUP *group, const EC_POINT *point)\n{\n return BN_is_zero(point->Z);\n}\n\nint ec_GFp_simple_is_on_curve(const EC_GROUP *group, const EC_POINT *point,\n BN_CTX *ctx)\n{\n int (*field_mul) (const EC_GROUP *, BIGNUM *, const BIGNUM *,\n const BIGNUM *, BN_CTX *);\n int (*field_sqr) (const EC_GROUP *, BIGNUM *, const BIGNUM *, BN_CTX *);\n const BIGNUM *p;\n BN_CTX *new_ctx = NULL;\n BIGNUM *rh, *tmp, *Z4, *Z6;\n int ret = -1;\n\n if (EC_POINT_is_at_infinity(group, point))\n return 1;\n\n field_mul = group->meth->field_mul;\n field_sqr = group->meth->field_sqr;\n p = group->field;\n\n if (ctx == NULL) {\n ctx = new_ctx = BN_CTX_new();\n if (ctx == NULL)\n return -1;\n }\n\n BN_CTX_start(ctx);\n rh = BN_CTX_get(ctx);\n tmp = BN_CTX_get(ctx);\n Z4 = BN_CTX_get(ctx);\n Z6 = BN_CTX_get(ctx);\n if (Z6 == NULL)\n goto err;\n\n /*-\n * We have a curve defined by a Weierstrass equation\n * y^2 = x^3 + a*x + b.\n * The point to consider is given in Jacobian projective coordinates\n * where (X, Y, Z) represents (x, y) = (X/Z^2, Y/Z^3).\n * Substituting this and multiplying by Z^6 transforms the above equation into\n * Y^2 = X^3 + a*X*Z^4 + b*Z^6.\n * To test this, we add up the right-hand side in 'rh'.\n */\n\n /* rh := X^2 */\n if (!field_sqr(group, rh, point->X, ctx))\n goto err;\n\n if (!point->Z_is_one) {\n if (!field_sqr(group, tmp, point->Z, ctx))\n goto err;\n if (!field_sqr(group, Z4, tmp, ctx))\n goto err;\n if (!field_mul(group, Z6, Z4, tmp, ctx))\n goto err;\n\n /* rh := (rh + a*Z^4)*X */\n if (group->a_is_minus3) {\n if (!BN_mod_lshift1_quick(tmp, Z4, p))\n goto err;\n if (!BN_mod_add_quick(tmp, tmp, Z4, p))\n goto err;\n if (!BN_mod_sub_quick(rh, rh, tmp, p))\n goto err;\n if (!field_mul(group, rh, rh, point->X, ctx))\n goto err;\n } else {\n if (!field_mul(group, tmp, Z4, group->a, ctx))\n goto err;\n if (!BN_mod_add_quick(rh, rh, tmp, p))\n goto err;\n if (!field_mul(group, rh, rh, point->X, ctx))\n goto err;\n }\n\n /* rh := rh + b*Z^6 */\n if (!field_mul(group, tmp, group->b, Z6, ctx))\n goto err;\n if (!BN_mod_add_quick(rh, rh, tmp, p))\n goto err;\n } else {\n /* point->Z_is_one */\n\n /* rh := (rh + a)*X */\n if (!BN_mod_add_quick(rh, rh, group->a, p))\n goto err;\n if (!field_mul(group, rh, rh, point->X, ctx))\n goto err;\n /* rh := rh + b */\n if (!BN_mod_add_quick(rh, rh, group->b, p))\n goto err;\n }\n\n /* 'lh' := Y^2 */\n if (!field_sqr(group, tmp, point->Y, ctx))\n goto err;\n\n ret = (0 == BN_ucmp(tmp, rh));\n\n err:\n BN_CTX_end(ctx);\n BN_CTX_free(new_ctx);\n return ret;\n}\n\nint ec_GFp_simple_cmp(const EC_GROUP *group, const EC_POINT *a,\n const EC_POINT *b, BN_CTX *ctx)\n{\n /*-\n * return values:\n * -1 error\n * 0 equal (in affine coordinates)\n * 1 not equal\n */\n\n int (*field_mul) (const EC_GROUP *, BIGNUM *, const BIGNUM *,\n const BIGNUM *, BN_CTX *);\n int (*field_sqr) (const EC_GROUP *, BIGNUM *, const BIGNUM *, BN_CTX *);\n BN_CTX *new_ctx = NULL;\n BIGNUM *tmp1, *tmp2, *Za23, *Zb23;\n const BIGNUM *tmp1_, *tmp2_;\n int ret = -1;\n\n if (EC_POINT_is_at_infinity(group, a)) {\n return EC_POINT_is_at_infinity(group, b) ? 0 : 1;\n }\n\n if (EC_POINT_is_at_infinity(group, b))\n return 1;\n\n if (a->Z_is_one && b->Z_is_one) {\n return ((BN_cmp(a->X, b->X) == 0) && BN_cmp(a->Y, b->Y) == 0) ? 0 : 1;\n }\n\n field_mul = group->meth->field_mul;\n field_sqr = group->meth->field_sqr;\n\n if (ctx == NULL) {\n ctx = new_ctx = BN_CTX_new();\n if (ctx == NULL)\n return -1;\n }\n\n BN_CTX_start(ctx);\n tmp1 = BN_CTX_get(ctx);\n tmp2 = BN_CTX_get(ctx);\n Za23 = BN_CTX_get(ctx);\n Zb23 = BN_CTX_get(ctx);\n if (Zb23 == NULL)\n goto end;\n\n /*-\n * We have to decide whether\n * (X_a/Z_a^2, Y_a/Z_a^3) = (X_b/Z_b^2, Y_b/Z_b^3),\n * or equivalently, whether\n * (X_a*Z_b^2, Y_a*Z_b^3) = (X_b*Z_a^2, Y_b*Z_a^3).\n */\n\n if (!b->Z_is_one) {\n if (!field_sqr(group, Zb23, b->Z, ctx))\n goto end;\n if (!field_mul(group, tmp1, a->X, Zb23, ctx))\n goto end;\n tmp1_ = tmp1;\n } else\n tmp1_ = a->X;\n if (!a->Z_is_one) {\n if (!field_sqr(group, Za23, a->Z, ctx))\n goto end;\n if (!field_mul(group, tmp2, b->X, Za23, ctx))\n goto end;\n tmp2_ = tmp2;\n } else\n tmp2_ = b->X;\n\n /* compare X_a*Z_b^2 with X_b*Z_a^2 */\n if (BN_cmp(tmp1_, tmp2_) != 0) {\n ret = 1; /* points differ */\n goto end;\n }\n\n if (!b->Z_is_one) {\n if (!field_mul(group, Zb23, Zb23, b->Z, ctx))\n goto end;\n if (!field_mul(group, tmp1, a->Y, Zb23, ctx))\n goto end;\n /* tmp1_ = tmp1 */\n } else\n tmp1_ = a->Y;\n if (!a->Z_is_one) {\n if (!field_mul(group, Za23, Za23, a->Z, ctx))\n goto end;\n if (!field_mul(group, tmp2, b->Y, Za23, ctx))\n goto end;\n /* tmp2_ = tmp2 */\n } else\n tmp2_ = b->Y;\n\n /* compare Y_a*Z_b^3 with Y_b*Z_a^3 */\n if (BN_cmp(tmp1_, tmp2_) != 0) {\n ret = 1; /* points differ */\n goto end;\n }\n\n /* points are equal */\n ret = 0;\n\n end:\n BN_CTX_end(ctx);\n BN_CTX_free(new_ctx);\n return ret;\n}\n\nint ec_GFp_simple_make_affine(const EC_GROUP *group, EC_POINT *point,\n BN_CTX *ctx)\n{\n BN_CTX *new_ctx = NULL;\n BIGNUM *x, *y;\n int ret = 0;\n\n if (point->Z_is_one || EC_POINT_is_at_infinity(group, point))\n return 1;\n\n if (ctx == NULL) {\n ctx = new_ctx = BN_CTX_new();\n if (ctx == NULL)\n return 0;\n }\n\n BN_CTX_start(ctx);\n x = BN_CTX_get(ctx);\n y = BN_CTX_get(ctx);\n if (y == NULL)\n goto err;\n\n if (!EC_POINT_get_affine_coordinates(group, point, x, y, ctx))\n goto err;\n if (!EC_POINT_set_affine_coordinates(group, point, x, y, ctx))\n goto err;\n if (!point->Z_is_one) {\n ECerr(EC_F_EC_GFP_SIMPLE_MAKE_AFFINE, ERR_R_INTERNAL_ERROR);\n goto err;\n }\n\n ret = 1;\n\n err:\n BN_CTX_end(ctx);\n BN_CTX_free(new_ctx);\n return ret;\n}\n\nint ec_GFp_simple_points_make_affine(const EC_GROUP *group, size_t num,\n EC_POINT *points[], BN_CTX *ctx)\n{\n BN_CTX *new_ctx = NULL;\n BIGNUM *tmp, *tmp_Z;\n BIGNUM **prod_Z = NULL;\n size_t i;\n int ret = 0;\n\n if (num == 0)\n return 1;\n\n if (ctx == NULL) {\n ctx = new_ctx = BN_CTX_new();\n if (ctx == NULL)\n return 0;\n }\n\n BN_CTX_start(ctx);\n tmp = BN_CTX_get(ctx);\n tmp_Z = BN_CTX_get(ctx);\n if (tmp_Z == NULL)\n goto err;\n\n prod_Z = OPENSSL_malloc(num * sizeof(prod_Z[0]));\n if (prod_Z == NULL)\n goto err;\n for (i = 0; i < num; i++) {\n prod_Z[i] = BN_new();\n if (prod_Z[i] == NULL)\n goto err;\n }\n\n /*\n * Set each prod_Z[i] to the product of points[0]->Z .. points[i]->Z,\n * skipping any zero-valued inputs (pretend that they're 1).\n */\n\n if (!BN_is_zero(points[0]->Z)) {\n if (!BN_copy(prod_Z[0], points[0]->Z))\n goto err;\n } else {\n if (group->meth->field_set_to_one != 0) {\n if (!group->meth->field_set_to_one(group, prod_Z[0], ctx))\n goto err;\n } else {\n if (!BN_one(prod_Z[0]))\n goto err;\n }\n }\n\n for (i = 1; i < num; i++) {\n if (!BN_is_zero(points[i]->Z)) {\n if (!group->\n meth->field_mul(group, prod_Z[i], prod_Z[i - 1], points[i]->Z,\n ctx))\n goto err;\n } else {\n if (!BN_copy(prod_Z[i], prod_Z[i - 1]))\n goto err;\n }\n }\n\n /*\n * Now use a single explicit inversion to replace every non-zero\n * points[i]->Z by its inverse.\n */\n\n if (!group->meth->field_inv(group, tmp, prod_Z[num - 1], ctx)) {\n ECerr(EC_F_EC_GFP_SIMPLE_POINTS_MAKE_AFFINE, ERR_R_BN_LIB);\n goto err;\n }\n if (group->meth->field_encode != 0) {\n /*\n * In the Montgomery case, we just turned R*H (representing H) into\n * 1/(R*H), but we need R*(1/H) (representing 1/H); i.e. we need to\n * multiply by the Montgomery factor twice.\n */\n if (!group->meth->field_encode(group, tmp, tmp, ctx))\n goto err;\n if (!group->meth->field_encode(group, tmp, tmp, ctx))\n goto err;\n }\n\n for (i = num - 1; i > 0; --i) {\n /*\n * Loop invariant: tmp is the product of the inverses of points[0]->Z\n * .. points[i]->Z (zero-valued inputs skipped).\n */\n if (!BN_is_zero(points[i]->Z)) {\n /*\n * Set tmp_Z to the inverse of points[i]->Z (as product of Z\n * inverses 0 .. i, Z values 0 .. i - 1).\n */\n if (!group->\n meth->field_mul(group, tmp_Z, prod_Z[i - 1], tmp, ctx))\n goto err;\n /*\n * Update tmp to satisfy the loop invariant for i - 1.\n */\n if (!group->meth->field_mul(group, tmp, tmp, points[i]->Z, ctx))\n goto err;\n /* Replace points[i]->Z by its inverse. */\n if (!BN_copy(points[i]->Z, tmp_Z))\n goto err;\n }\n }\n\n if (!BN_is_zero(points[0]->Z)) {\n /* Replace points[0]->Z by its inverse. */\n if (!BN_copy(points[0]->Z, tmp))\n goto err;\n }\n\n /* Finally, fix up the X and Y coordinates for all points. */\n\n for (i = 0; i < num; i++) {\n EC_POINT *p = points[i];\n\n if (!BN_is_zero(p->Z)) {\n /* turn (X, Y, 1/Z) into (X/Z^2, Y/Z^3, 1) */\n\n if (!group->meth->field_sqr(group, tmp, p->Z, ctx))\n goto err;\n if (!group->meth->field_mul(group, p->X, p->X, tmp, ctx))\n goto err;\n\n if (!group->meth->field_mul(group, tmp, tmp, p->Z, ctx))\n goto err;\n if (!group->meth->field_mul(group, p->Y, p->Y, tmp, ctx))\n goto err;\n\n if (group->meth->field_set_to_one != 0) {\n if (!group->meth->field_set_to_one(group, p->Z, ctx))\n goto err;\n } else {\n if (!BN_one(p->Z))\n goto err;\n }\n p->Z_is_one = 1;\n }\n }\n\n ret = 1;\n\n err:\n BN_CTX_end(ctx);\n BN_CTX_free(new_ctx);\n if (prod_Z != NULL) {\n for (i = 0; i < num; i++) {\n if (prod_Z[i] == NULL)\n break;\n BN_clear_free(prod_Z[i]);\n }\n OPENSSL_free(prod_Z);\n }\n return ret;\n}\n\nint ec_GFp_simple_field_mul(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *ctx)\n{\n return BN_mod_mul(r, a, b, group->field, ctx);\n}\n\nint ec_GFp_simple_field_sqr(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,\n BN_CTX *ctx)\n{\n return BN_mod_sqr(r, a, group->field, ctx);\n}\n\n/*-\n * Computes the multiplicative inverse of a in GF(p), storing the result in r.\n * If a is zero (or equivalent), you'll get a EC_R_CANNOT_INVERT error.\n * Since we don't have a Mont structure here, SCA hardening is with blinding.\n * NB: \"a\" must be in _decoded_ form. (i.e. field_decode must precede.)\n */\nint ec_GFp_simple_field_inv(const EC_GROUP *group, BIGNUM *r, const BIGNUM *a,\n BN_CTX *ctx)\n{\n BIGNUM *e = NULL;\n BN_CTX *new_ctx = NULL;\n int ret = 0;\n\n if (ctx == NULL && (ctx = new_ctx = BN_CTX_secure_new()) == NULL)\n return 0;\n\n BN_CTX_start(ctx);\n if ((e = BN_CTX_get(ctx)) == NULL)\n goto err;\n\n do {\n if (!BN_priv_rand_range(e, group->field))\n goto err;\n } while (BN_is_zero(e));\n\n /* r := a * e */\n if (!group->meth->field_mul(group, r, a, e, ctx))\n goto err;\n /* r := 1/(a * e) */\n if (!BN_mod_inverse(r, r, group->field, ctx)) {\n ECerr(EC_F_EC_GFP_SIMPLE_FIELD_INV, EC_R_CANNOT_INVERT);\n goto err;\n }\n /* r := e/(a * e) = 1/a */\n if (!group->meth->field_mul(group, r, r, e, ctx))\n goto err;\n\n ret = 1;\n\n err:\n BN_CTX_end(ctx);\n BN_CTX_free(new_ctx);\n return ret;\n}\n\n/*-\n * Apply randomization of EC point projective coordinates:\n *\n * (X, Y ,Z ) = (lambda^2*X, lambda^3*Y, lambda*Z)\n * lambda = [1,group->field)\n *\n */\nint ec_GFp_simple_blind_coordinates(const EC_GROUP *group, EC_POINT *p,\n BN_CTX *ctx)\n{\n int ret = 0;\n BIGNUM *lambda = NULL;\n BIGNUM *temp = NULL;\n\n BN_CTX_start(ctx);\n lambda = BN_CTX_get(ctx);\n temp = BN_CTX_get(ctx);\n if (temp == NULL) {\n ECerr(EC_F_EC_GFP_SIMPLE_BLIND_COORDINATES, ERR_R_MALLOC_FAILURE);\n goto end;\n }\n\n /*-\n * Make sure lambda is not zero.\n * If the RNG fails, we cannot blind but nevertheless want\n * code to continue smoothly and not clobber the error stack.\n */\n do {\n ERR_set_mark();\n ret = BN_priv_rand_range(lambda, group->field);\n ERR_pop_to_mark();\n if (ret == 0) {\n ret = 1;\n goto end;\n }\n } while (BN_is_zero(lambda));\n\n /* if field_encode defined convert between representations */\n if ((group->meth->field_encode != NULL\n && !group->meth->field_encode(group, lambda, lambda, ctx))\n || !group->meth->field_mul(group, p->Z, p->Z, lambda, ctx)\n || !group->meth->field_sqr(group, temp, lambda, ctx)\n || !group->meth->field_mul(group, p->X, p->X, temp, ctx)\n || !group->meth->field_mul(group, temp, temp, lambda, ctx)\n || !group->meth->field_mul(group, p->Y, p->Y, temp, ctx))\n goto end;\n\n p->Z_is_one = 0;\n ret = 1;\n\n end:\n BN_CTX_end(ctx);\n return ret;\n}\n\n/*-\n * Input:\n * - p: affine coordinates\n *\n * Output:\n * - s := p, r := 2p: blinded projective (homogeneous) coordinates\n *\n * For doubling we use Formula 3 from Izu-Takagi \"A fast parallel elliptic curve\n * multiplication resistant against side channel attacks\" appendix, described at\n * https://hyperelliptic.org/EFD/g1p/auto-shortw-xz.html#doubling-dbl-2002-it-2\n * simplified for Z1=1.\n *\n * Blinding uses the equivalence relation (\\lambda X, \\lambda Y, \\lambda Z)\n * for any non-zero \\lambda that holds for projective (homogeneous) coords.\n */\nint ec_GFp_simple_ladder_pre(const EC_GROUP *group,\n EC_POINT *r, EC_POINT *s,\n EC_POINT *p, BN_CTX *ctx)\n{\n BIGNUM *t1, *t2, *t3, *t4, *t5 = NULL;\n\n t1 = s->Z;\n t2 = r->Z;\n t3 = s->X;\n t4 = r->X;\n t5 = s->Y;\n\n if (!p->Z_is_one /* r := 2p */\n || !group->meth->field_sqr(group, t3, p->X, ctx)\n || !BN_mod_sub_quick(t4, t3, group->a, group->field)\n || !group->meth->field_sqr(group, t4, t4, ctx)\n || !group->meth->field_mul(group, t5, p->X, group->b, ctx)\n || !BN_mod_lshift_quick(t5, t5, 3, group->field)\n /* r->X coord output */\n || !BN_mod_sub_quick(r->X, t4, t5, group->field)\n || !BN_mod_add_quick(t1, t3, group->a, group->field)\n || !group->meth->field_mul(group, t2, p->X, t1, ctx)\n || !BN_mod_add_quick(t2, group->b, t2, group->field)\n /* r->Z coord output */\n || !BN_mod_lshift_quick(r->Z, t2, 2, group->field))\n return 0;\n\n /* make sure lambda (r->Y here for storage) is not zero */\n do {\n if (!BN_priv_rand_range(r->Y, group->field))\n return 0;\n } while (BN_is_zero(r->Y));\n\n /* make sure lambda (s->Z here for storage) is not zero */\n do {\n if (!BN_priv_rand_range(s->Z, group->field))\n return 0;\n } while (BN_is_zero(s->Z));\n\n /* if field_encode defined convert between representations */\n if (group->meth->field_encode != NULL\n && (!group->meth->field_encode(group, r->Y, r->Y, ctx)\n || !group->meth->field_encode(group, s->Z, s->Z, ctx)))\n return 0;\n\n /* blind r and s independently */\n if (!group->meth->field_mul(group, r->Z, r->Z, r->Y, ctx)\n || !group->meth->field_mul(group, r->X, r->X, r->Y, ctx)\n || !group->meth->field_mul(group, s->X, p->X, s->Z, ctx)) /* s := p */\n return 0;\n\n r->Z_is_one = 0;\n s->Z_is_one = 0;\n\n return 1;\n}\n\n/*-\n * Input:\n * - s, r: projective (homogeneous) coordinates\n * - p: affine coordinates\n *\n * Output:\n * - s := r + s, r := 2r: projective (homogeneous) coordinates\n *\n * Differential addition-and-doubling using Eq. (9) and (10) from Izu-Takagi\n * \"A fast parallel elliptic curve multiplication resistant against side channel\n * attacks\", as described at\n * https://hyperelliptic.org/EFD/g1p/auto-shortw-xz.html#ladder-mladd-2002-it-4\n */\nint ec_GFp_simple_ladder_step(const EC_GROUP *group,\n EC_POINT *r, EC_POINT *s,\n EC_POINT *p, BN_CTX *ctx)\n{\n int ret = 0;\n BIGNUM *t0, *t1, *t2, *t3, *t4, *t5, *t6 = NULL;\n\n BN_CTX_start(ctx);\n t0 = BN_CTX_get(ctx);\n t1 = BN_CTX_get(ctx);\n t2 = BN_CTX_get(ctx);\n t3 = BN_CTX_get(ctx);\n t4 = BN_CTX_get(ctx);\n t5 = BN_CTX_get(ctx);\n t6 = BN_CTX_get(ctx);\n\n if (t6 == NULL\n || !group->meth->field_mul(group, t6, r->X, s->X, ctx)\n || !group->meth->field_mul(group, t0, r->Z, s->Z, ctx)\n || !group->meth->field_mul(group, t4, r->X, s->Z, ctx)\n || !group->meth->field_mul(group, t3, r->Z, s->X, ctx)\n || !group->meth->field_mul(group, t5, group->a, t0, ctx)\n || !BN_mod_add_quick(t5, t6, t5, group->field)\n || !BN_mod_add_quick(t6, t3, t4, group->field)\n || !group->meth->field_mul(group, t5, t6, t5, ctx)\n || !group->meth->field_sqr(group, t0, t0, ctx)\n || !BN_mod_lshift_quick(t2, group->b, 2, group->field)\n || !group->meth->field_mul(group, t0, t2, t0, ctx)\n || !BN_mod_lshift1_quick(t5, t5, group->field)\n || !BN_mod_sub_quick(t3, t4, t3, group->field)\n /* s->Z coord output */\n || !group->meth->field_sqr(group, s->Z, t3, ctx)\n || !group->meth->field_mul(group, t4, s->Z, p->X, ctx)\n || !BN_mod_add_quick(t0, t0, t5, group->field)\n /* s->X coord output */\n || !BN_mod_sub_quick(s->X, t0, t4, group->field)\n || !group->meth->field_sqr(group, t4, r->X, ctx)\n || !group->meth->field_sqr(group, t5, r->Z, ctx)\n || !group->meth->field_mul(group, t6, t5, group->a, ctx)\n || !BN_mod_add_quick(t1, r->X, r->Z, group->field)\n || !group->meth->field_sqr(group, t1, t1, ctx)\n || !BN_mod_sub_quick(t1, t1, t4, group->field)\n || !BN_mod_sub_quick(t1, t1, t5, group->field)\n || !BN_mod_sub_quick(t3, t4, t6, group->field)\n || !group->meth->field_sqr(group, t3, t3, ctx)\n || !group->meth->field_mul(group, t0, t5, t1, ctx)\n || !group->meth->field_mul(group, t0, t2, t0, ctx)\n /* r->X coord output */\n || !BN_mod_sub_quick(r->X, t3, t0, group->field)\n || !BN_mod_add_quick(t3, t4, t6, group->field)\n || !group->meth->field_sqr(group, t4, t5, ctx)\n || !group->meth->field_mul(group, t4, t4, t2, ctx)\n || !group->meth->field_mul(group, t1, t1, t3, ctx)\n || !BN_mod_lshift1_quick(t1, t1, group->field)\n /* r->Z coord output */\n || !BN_mod_add_quick(r->Z, t4, t1, group->field))\n goto err;\n\n ret = 1;\n\n err:\n BN_CTX_end(ctx);\n return ret;\n}\n\n/*-\n * Input:\n * - s, r: projective (homogeneous) coordinates\n * - p: affine coordinates\n *\n * Output:\n * - r := (x,y): affine coordinates\n *\n * Recovers the y-coordinate of r using Eq. (8) from Brier-Joye, \"Weierstrass\n * Elliptic Curves and Side-Channel Attacks\", modified to work in mixed\n * projective coords, i.e. p is affine and (r,s) in projective (homogeneous)\n * coords, and return r in affine coordinates.\n *\n * X4 = two*Y1*X2*Z3*Z2;\n * Y4 = two*b*Z3*SQR(Z2) + Z3*(a*Z2+X1*X2)*(X1*Z2+X2) - X3*SQR(X1*Z2-X2);\n * Z4 = two*Y1*Z3*SQR(Z2);\n *\n * Z4 != 0 because:\n * - Z2==0 implies r is at infinity (handled by the BN_is_zero(r->Z) branch);\n * - Z3==0 implies s is at infinity (handled by the BN_is_zero(s->Z) branch);\n * - Y1==0 implies p has order 2, so either r or s are infinity and handled by\n * one of the BN_is_zero(...) branches.\n */\nint ec_GFp_simple_ladder_post(const EC_GROUP *group,\n EC_POINT *r, EC_POINT *s,\n EC_POINT *p, BN_CTX *ctx)\n{\n int ret = 0;\n BIGNUM *t0, *t1, *t2, *t3, *t4, *t5, *t6 = NULL;\n\n if (BN_is_zero(r->Z))\n return EC_POINT_set_to_infinity(group, r);\n\n if (BN_is_zero(s->Z)) {\n if (!EC_POINT_copy(r, p)\n || !EC_POINT_invert(group, r, ctx))\n return 0;\n return 1;\n }\n\n BN_CTX_start(ctx);\n t0 = BN_CTX_get(ctx);\n t1 = BN_CTX_get(ctx);\n t2 = BN_CTX_get(ctx);\n t3 = BN_CTX_get(ctx);\n t4 = BN_CTX_get(ctx);\n t5 = BN_CTX_get(ctx);\n t6 = BN_CTX_get(ctx);\n\n if (t6 == NULL\n || !BN_mod_lshift1_quick(t4, p->Y, group->field)\n || !group->meth->field_mul(group, t6, r->X, t4, ctx)\n || !group->meth->field_mul(group, t6, s->Z, t6, ctx)\n || !group->meth->field_mul(group, t5, r->Z, t6, ctx)\n || !BN_mod_lshift1_quick(t1, group->b, group->field)\n || !group->meth->field_mul(group, t1, s->Z, t1, ctx)\n || !group->meth->field_sqr(group, t3, r->Z, ctx)\n || !group->meth->field_mul(group, t2, t3, t1, ctx)\n || !group->meth->field_mul(group, t6, r->Z, group->a, ctx)\n || !group->meth->field_mul(group, t1, p->X, r->X, ctx)\n || !BN_mod_add_quick(t1, t1, t6, group->field)\n || !group->meth->field_mul(group, t1, s->Z, t1, ctx)\n || !group->meth->field_mul(group, t0, p->X, r->Z, ctx)\n || !BN_mod_add_quick(t6, r->X, t0, group->field)\n || !group->meth->field_mul(group, t6, t6, t1, ctx)\n || !BN_mod_add_quick(t6, t6, t2, group->field)\n || !BN_mod_sub_quick(t0, t0, r->X, group->field)\n || !group->meth->field_sqr(group, t0, t0, ctx)\n || !group->meth->field_mul(group, t0, t0, s->X, ctx)\n || !BN_mod_sub_quick(t0, t6, t0, group->field)\n || !group->meth->field_mul(group, t1, s->Z, t4, ctx)\n || !group->meth->field_mul(group, t1, t3, t1, ctx)\n || (group->meth->field_decode != NULL\n && !group->meth->field_decode(group, t1, t1, ctx))\n || !group->meth->field_inv(group, t1, t1, ctx)\n || (group->meth->field_encode != NULL\n && !group->meth->field_encode(group, t1, t1, ctx))\n || !group->meth->field_mul(group, r->X, t5, t1, ctx)\n || !group->meth->field_mul(group, r->Y, t0, t1, ctx))\n goto err;\n\n if (group->meth->field_set_to_one != NULL) {\n if (!group->meth->field_set_to_one(group, r->Z, ctx))\n goto err;\n } else {\n if (!BN_one(r->Z))\n goto err;\n }\n\n r->Z_is_one = 1;\n ret = 1;\n\n err:\n BN_CTX_end(ctx);\n return ret;\n}\n" }, { "path": "cryptomini/include/crypto/__DECC_INCLUDE_EPILOGUE.H", "content": "/*\n * Copyright 2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * This file is only used by HP C on VMS, and is included automatically\n * after each header file from this directory\n */\n\n/* restore state. Must correspond to the save in __decc_include_prologue.h */\n#pragma names restore\n" }, { "path": "cryptomini/include/crypto/__DECC_INCLUDE_PROLOGUE.H", "content": "/*\n * Copyright 2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * This file is only used by HP C on VMS, and is included automatically\n * after each header file from this directory\n */\n\n/* save state */\n#pragma names save\n/* have the compiler shorten symbols larger than 31 chars to 23 chars\n * followed by a 8 hex char CRC\n */\n#pragma names as_is,shortened\n" }, { "path": "cryptomini/include/crypto/aria.h", "content": "/*\n * Copyright 2006-2018 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n /* Copyright (c) 2017 National Security Research Institute. All rights reserved. */\n\n#ifndef OSSL_CRYPTO_ARIA_H\n# define OSSL_CRYPTO_ARIA_H\n\n# include \n\n# ifdef OPENSSL_NO_ARIA\n# error ARIA is disabled.\n# endif\n\n# define ARIA_ENCRYPT 1\n# define ARIA_DECRYPT 0\n\n# define ARIA_BLOCK_SIZE 16 /* Size of each encryption/decryption block */\n# define ARIA_MAX_KEYS 17 /* Number of keys needed in the worst case */\n\ntypedef union {\n unsigned char c[ARIA_BLOCK_SIZE];\n unsigned int u[ARIA_BLOCK_SIZE / sizeof(unsigned int)];\n} ARIA_u128;\n\ntypedef unsigned char ARIA_c128[ARIA_BLOCK_SIZE];\n\nstruct aria_key_st {\n ARIA_u128 rd_key[ARIA_MAX_KEYS];\n unsigned int rounds;\n};\ntypedef struct aria_key_st ARIA_KEY;\n\n\nint aria_set_encrypt_key(const unsigned char *userKey, const int bits,\n ARIA_KEY *key);\nint aria_set_decrypt_key(const unsigned char *userKey, const int bits,\n ARIA_KEY *key);\n\nvoid aria_encrypt(const unsigned char *in, unsigned char *out,\n const ARIA_KEY *key);\n\n#endif\n" }, { "path": "cryptomini/include/crypto/asn1.h", "content": "/*\n * Copyright 2015-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/* Internal ASN1 structures and functions: not for application use */\n\n/* ASN1 public key method structure */\n\nstruct evp_pkey_asn1_method_st {\n int pkey_id;\n int pkey_base_id;\n unsigned long pkey_flags;\n char *pem_str;\n char *info;\n int (*pub_decode) (EVP_PKEY *pk, X509_PUBKEY *pub);\n int (*pub_encode) (X509_PUBKEY *pub, const EVP_PKEY *pk);\n int (*pub_cmp) (const EVP_PKEY *a, const EVP_PKEY *b);\n int (*pub_print) (BIO *out, const EVP_PKEY *pkey, int indent,\n ASN1_PCTX *pctx);\n int (*priv_decode) (EVP_PKEY *pk, const PKCS8_PRIV_KEY_INFO *p8inf);\n int (*priv_encode) (PKCS8_PRIV_KEY_INFO *p8, const EVP_PKEY *pk);\n int (*priv_print) (BIO *out, const EVP_PKEY *pkey, int indent,\n ASN1_PCTX *pctx);\n int (*pkey_size) (const EVP_PKEY *pk);\n int (*pkey_bits) (const EVP_PKEY *pk);\n int (*pkey_security_bits) (const EVP_PKEY *pk);\n int (*param_decode) (EVP_PKEY *pkey,\n const unsigned char **pder, int derlen);\n int (*param_encode) (const EVP_PKEY *pkey, unsigned char **pder);\n int (*param_missing) (const EVP_PKEY *pk);\n int (*param_copy) (EVP_PKEY *to, const EVP_PKEY *from);\n int (*param_cmp) (const EVP_PKEY *a, const EVP_PKEY *b);\n int (*param_print) (BIO *out, const EVP_PKEY *pkey, int indent,\n ASN1_PCTX *pctx);\n int (*sig_print) (BIO *out,\n const X509_ALGOR *sigalg, const ASN1_STRING *sig,\n int indent, ASN1_PCTX *pctx);\n void (*pkey_free) (EVP_PKEY *pkey);\n int (*pkey_ctrl) (EVP_PKEY *pkey, int op, long arg1, void *arg2);\n /* Legacy functions for old PEM */\n int (*old_priv_decode) (EVP_PKEY *pkey,\n const unsigned char **pder, int derlen);\n int (*old_priv_encode) (const EVP_PKEY *pkey, unsigned char **pder);\n /* Custom ASN1 signature verification */\n int (*item_verify) (EVP_MD_CTX *ctx, const ASN1_ITEM *it, void *asn,\n X509_ALGOR *a, ASN1_BIT_STRING *sig, EVP_PKEY *pkey);\n int (*item_sign) (EVP_MD_CTX *ctx, const ASN1_ITEM *it, void *asn,\n X509_ALGOR *alg1, X509_ALGOR *alg2,\n ASN1_BIT_STRING *sig);\n int (*siginf_set) (X509_SIG_INFO *siginf, const X509_ALGOR *alg,\n const ASN1_STRING *sig);\n /* Check */\n int (*pkey_check) (const EVP_PKEY *pk);\n int (*pkey_public_check) (const EVP_PKEY *pk);\n int (*pkey_param_check) (const EVP_PKEY *pk);\n /* Get/set raw private/public key data */\n int (*set_priv_key) (EVP_PKEY *pk, const unsigned char *priv, size_t len);\n int (*set_pub_key) (EVP_PKEY *pk, const unsigned char *pub, size_t len);\n int (*get_priv_key) (const EVP_PKEY *pk, unsigned char *priv, size_t *len);\n int (*get_pub_key) (const EVP_PKEY *pk, unsigned char *pub, size_t *len);\n} /* EVP_PKEY_ASN1_METHOD */ ;\n\nDEFINE_STACK_OF_CONST(EVP_PKEY_ASN1_METHOD)\n\nextern const EVP_PKEY_ASN1_METHOD cmac_asn1_meth;\nextern const EVP_PKEY_ASN1_METHOD dh_asn1_meth;\nextern const EVP_PKEY_ASN1_METHOD dhx_asn1_meth;\nextern const EVP_PKEY_ASN1_METHOD dsa_asn1_meths[5];\nextern const EVP_PKEY_ASN1_METHOD eckey_asn1_meth;\nextern const EVP_PKEY_ASN1_METHOD ecx25519_asn1_meth;\nextern const EVP_PKEY_ASN1_METHOD ecx448_asn1_meth;\nextern const EVP_PKEY_ASN1_METHOD ed25519_asn1_meth;\nextern const EVP_PKEY_ASN1_METHOD ed448_asn1_meth;\nextern const EVP_PKEY_ASN1_METHOD sm2_asn1_meth;\nextern const EVP_PKEY_ASN1_METHOD poly1305_asn1_meth;\n\nextern const EVP_PKEY_ASN1_METHOD hmac_asn1_meth;\nextern const EVP_PKEY_ASN1_METHOD rsa_asn1_meths[2];\nextern const EVP_PKEY_ASN1_METHOD rsa_pss_asn1_meth;\nextern const EVP_PKEY_ASN1_METHOD siphash_asn1_meth;\n\n/*\n * These are used internally in the ASN1_OBJECT to keep track of whether the\n * names and data need to be free()ed\n */\n# define ASN1_OBJECT_FLAG_DYNAMIC 0x01/* internal use */\n# define ASN1_OBJECT_FLAG_CRITICAL 0x02/* critical x509v3 object id */\n# define ASN1_OBJECT_FLAG_DYNAMIC_STRINGS 0x04/* internal use */\n# define ASN1_OBJECT_FLAG_DYNAMIC_DATA 0x08/* internal use */\nstruct asn1_object_st {\n const char *sn, *ln;\n int nid;\n int length;\n const unsigned char *data; /* data remains const after init */\n int flags; /* Should we free this one */\n};\n\n/* ASN1 print context structure */\n\nstruct asn1_pctx_st {\n unsigned long flags;\n unsigned long nm_flags;\n unsigned long cert_flags;\n unsigned long oid_flags;\n unsigned long str_flags;\n} /* ASN1_PCTX */ ;\n\nint asn1_d2i_read_bio(BIO *in, BUF_MEM **pb);\n" }, { "path": "cryptomini/include/crypto/async.h", "content": "/*\n * Copyright 2016-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\nint async_init(void);\nvoid async_deinit(void);\nvoid async_delete_thread_state(void);\n\n" }, { "path": "cryptomini/include/crypto/bn.h", "content": "/*\n * Copyright 2014-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_BN_H\n# define OSSL_CRYPTO_BN_H\n\n# include \n# include \n\nBIGNUM *bn_wexpand(BIGNUM *a, int words);\nBIGNUM *bn_expand2(BIGNUM *a, int words);\n\nvoid bn_correct_top(BIGNUM *a);\n\n/*\n * Determine the modified width-(w+1) Non-Adjacent Form (wNAF) of 'scalar'.\n * This is an array r[] of values that are either zero or odd with an\n * absolute value less than 2^w satisfying scalar = \\sum_j r[j]*2^j where at\n * most one of any w+1 consecutive digits is non-zero with the exception that\n * the most significant digit may be only w-1 zeros away from that next\n * non-zero digit.\n */\nsigned char *bn_compute_wNAF(const BIGNUM *scalar, int w, size_t *ret_len);\n\nint bn_get_top(const BIGNUM *a);\n\nint bn_get_dmax(const BIGNUM *a);\n\n/* Set all words to zero */\nvoid bn_set_all_zero(BIGNUM *a);\n\n/*\n * Copy the internal BIGNUM words into out which holds size elements (and size\n * must be bigger than top)\n */\nint bn_copy_words(BN_ULONG *out, const BIGNUM *in, int size);\n\nBN_ULONG *bn_get_words(const BIGNUM *a);\n\n/*\n * Set the internal data words in a to point to words which contains size\n * elements. The BN_FLG_STATIC_DATA flag is set\n */\nvoid bn_set_static_words(BIGNUM *a, const BN_ULONG *words, int size);\n\n/*\n * Copy words into the BIGNUM |a|, reallocating space as necessary.\n * The negative flag of |a| is not modified.\n * Returns 1 on success and 0 on failure.\n */\n/*\n * |num_words| is int because bn_expand2 takes an int. This is an internal\n * function so we simply trust callers not to pass negative values.\n */\nint bn_set_words(BIGNUM *a, const BN_ULONG *words, int num_words);\n\n/*\n * Some BIGNUM functions assume most significant limb to be non-zero, which\n * is customarily arranged by bn_correct_top. Output from below functions\n * is not processed with bn_correct_top, and for this reason it may not be\n * returned out of public API. It may only be passed internally into other\n * functions known to support non-minimal or zero-padded BIGNUMs. Even\n * though the goal is to facilitate constant-time-ness, not each subroutine\n * is constant-time by itself. They all have pre-conditions, consult source\n * code...\n */\nint bn_mul_mont_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n BN_MONT_CTX *mont, BN_CTX *ctx);\nint bn_to_mont_fixed_top(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,\n BN_CTX *ctx);\nint bn_from_mont_fixed_top(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,\n BN_CTX *ctx);\nint bn_mod_add_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n const BIGNUM *m);\nint bn_mod_sub_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n const BIGNUM *m);\nint bn_mul_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);\nint bn_sqr_fixed_top(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx);\nint bn_lshift_fixed_top(BIGNUM *r, const BIGNUM *a, int n);\nint bn_rshift_fixed_top(BIGNUM *r, const BIGNUM *a, int n);\nint bn_div_fixed_top(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,\n const BIGNUM *d, BN_CTX *ctx);\n\n#endif\n" }, { "path": "cryptomini/include/crypto/bn_conf.h", "content": "/* WARNING: do not edit! */\n/* Generated by Makefile from include/crypto/bn_conf.h.in */\n/*\n * Copyright 2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_BN_CONF_H\n# define OSSL_CRYPTO_BN_CONF_H\n\n/*\n * The contents of this file are not used in the UEFI build, as\n * both 32-bit and 64-bit builds are supported from a single run\n * of the Configure script.\n */\n\n/* Should we define BN_DIV2W here? */\n\n/* Only one for the following should be defined */\n#define SIXTY_FOUR_BIT_LONG\n#undef SIXTY_FOUR_BIT\n#undef THIRTY_TWO_BIT\n\n#endif\n" }, { "path": "cryptomini/include/crypto/bn_conf.h.in", "content": "{- join(\"\\n\",map { \"/* $_ */\" } @autowarntext) -}\n/*\n * Copyright 2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_BN_CONF_H\n# define OSSL_CRYPTO_BN_CONF_H\n\n/*\n * The contents of this file are not used in the UEFI build, as\n * both 32-bit and 64-bit builds are supported from a single run\n * of the Configure script.\n */\n\n/* Should we define BN_DIV2W here? */\n\n/* Only one for the following should be defined */\n{- $config{b64l} ? \"#define\" : \"#undef\" -} SIXTY_FOUR_BIT_LONG\n{- $config{b64} ? \"#define\" : \"#undef\" -} SIXTY_FOUR_BIT\n{- $config{b32} ? \"#define\" : \"#undef\" -} THIRTY_TWO_BIT\n\n#endif\n" }, { "path": "cryptomini/include/crypto/bn_dh.h", "content": "/*\n * Copyright 2015-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#define declare_dh_bn(x) \\\n extern const BIGNUM _bignum_dh##x##_p; \\\n extern const BIGNUM _bignum_dh##x##_g; \\\n extern const BIGNUM _bignum_dh##x##_q;\n\ndeclare_dh_bn(1024_160)\ndeclare_dh_bn(2048_224)\ndeclare_dh_bn(2048_256)\n\nextern const BIGNUM _bignum_ffdhe2048_p;\nextern const BIGNUM _bignum_ffdhe3072_p;\nextern const BIGNUM _bignum_ffdhe4096_p;\nextern const BIGNUM _bignum_ffdhe6144_p;\nextern const BIGNUM _bignum_ffdhe8192_p;\nextern const BIGNUM _bignum_const_2;\n" }, { "path": "cryptomini/include/crypto/bn_srp.h", "content": "/*\n * Copyright 2014-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OPENSSL_NO_SRP\n\nextern const BIGNUM bn_group_1024;\n\nextern const BIGNUM bn_group_1536;\n\nextern const BIGNUM bn_group_2048;\n\nextern const BIGNUM bn_group_3072;\n\nextern const BIGNUM bn_group_4096;\n\nextern const BIGNUM bn_group_6144;\n\nextern const BIGNUM bn_group_8192;\n\nextern const BIGNUM bn_generator_19;\n\nextern const BIGNUM bn_generator_5;\n\nextern const BIGNUM bn_generator_2;\n\n#endif\n" }, { "path": "cryptomini/include/crypto/chacha.h", "content": "/*\n * Copyright 2015-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_CHACHA_H\n#define OSSL_CRYPTO_CHACHA_H\n\n#include \n\n/*\n * ChaCha20_ctr32 encrypts |len| bytes from |inp| with the given key and\n * nonce and writes the result to |out|, which may be equal to |inp|.\n * The |key| is not 32 bytes of verbatim key material though, but the\n * said material collected into 8 32-bit elements array in host byte\n * order. Same approach applies to nonce: the |counter| argument is\n * pointer to concatenated nonce and counter values collected into 4\n * 32-bit elements. This, passing crypto material collected into 32-bit\n * elements as opposite to passing verbatim byte vectors, is chosen for\n * efficiency in multi-call scenarios.\n */\nvoid ChaCha20_ctr32(unsigned char *out, const unsigned char *inp,\n size_t len, const unsigned int key[8],\n const unsigned int counter[4]);\n/*\n * You can notice that there is no key setup procedure. Because it's\n * as trivial as collecting bytes into 32-bit elements, it's reckoned\n * that below macro is sufficient.\n */\n#define CHACHA_U8TOU32(p) ( \\\n ((unsigned int)(p)[0]) | ((unsigned int)(p)[1]<<8) | \\\n ((unsigned int)(p)[2]<<16) | ((unsigned int)(p)[3]<<24) )\n\n#define CHACHA_KEY_SIZE\t\t32\n#define CHACHA_CTR_SIZE\t\t16\n#define CHACHA_BLK_SIZE\t\t64\n\n#endif\n" }, { "path": "cryptomini/include/crypto/cryptlib.h", "content": "/*\n * Copyright 2016-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \"internal/cryptlib.h\"\n\n/* This file is not scanned by mkdef.pl, whereas cryptlib.h is */\n\nstruct thread_local_inits_st {\n int async;\n int err_state;\n int rand;\n};\n\nint ossl_init_thread_start(uint64_t opts);\n\n/*\n * OPENSSL_INIT flags. The primary list of these is in crypto.h. Flags below\n * are those omitted from crypto.h because they are \"reserved for internal\n * use\".\n */\n# define OPENSSL_INIT_ZLIB 0x00010000L\n# define OPENSSL_INIT_BASE_ONLY 0x00040000L\n\n/* OPENSSL_INIT_THREAD flags */\n# define OPENSSL_INIT_THREAD_ASYNC 0x01\n# define OPENSSL_INIT_THREAD_ERR_STATE 0x02\n# define OPENSSL_INIT_THREAD_RAND 0x04\n\nvoid ossl_malloc_setup_failures(void);\n" }, { "path": "cryptomini/include/crypto/ctype.h", "content": "/*\n * Copyright 2017-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * This version of ctype.h provides a standardised and platform\n * independent implementation that supports seven bit ASCII characters.\n * The specific intent is to not pass extended ASCII characters (> 127)\n * even if the host operating system would.\n *\n * There is EBCDIC support included for machines which use this. However,\n * there are a number of concerns about how well EBCDIC is supported\n * throughout the rest of the source code. Refer to issue #4154 for\n * details.\n */\n#ifndef OSSL_CRYPTO_CTYPE_H\n# define OSSL_CRYPTO_CTYPE_H\n\n# define CTYPE_MASK_lower 0x1\n# define CTYPE_MASK_upper 0x2\n# define CTYPE_MASK_digit 0x4\n# define CTYPE_MASK_space 0x8\n# define CTYPE_MASK_xdigit 0x10\n# define CTYPE_MASK_blank 0x20\n# define CTYPE_MASK_cntrl 0x40\n# define CTYPE_MASK_graph 0x80\n# define CTYPE_MASK_print 0x100\n# define CTYPE_MASK_punct 0x200\n# define CTYPE_MASK_base64 0x400\n# define CTYPE_MASK_asn1print 0x800\n\n# define CTYPE_MASK_alpha (CTYPE_MASK_lower | CTYPE_MASK_upper)\n# define CTYPE_MASK_alnum (CTYPE_MASK_alpha | CTYPE_MASK_digit)\n\n/*\n * The ascii mask assumes that any other classification implies that\n * the character is ASCII and that there are no ASCII characters\n * that aren't in any of the classifications.\n *\n * This assumption holds at the moment, but it might not in the future.\n */\n# define CTYPE_MASK_ascii (~0)\n\n# ifdef CHARSET_EBCDIC\nint ossl_toascii(int c);\nint ossl_fromascii(int c);\n# else\n# define ossl_toascii(c) (c)\n# define ossl_fromascii(c) (c)\n# endif\nint ossl_ctype_check(int c, unsigned int mask);\nint ossl_tolower(int c);\nint ossl_toupper(int c);\n\nint ascii_isdigit(const char inchar);\n\n# define ossl_isalnum(c) (ossl_ctype_check((c), CTYPE_MASK_alnum))\n# define ossl_isalpha(c) (ossl_ctype_check((c), CTYPE_MASK_alpha))\n# ifdef CHARSET_EBCDIC\n# define ossl_isascii(c) (ossl_ctype_check((c), CTYPE_MASK_ascii))\n# else\n# define ossl_isascii(c) (((c) & ~127) == 0)\n# endif\n# define ossl_isblank(c) (ossl_ctype_check((c), CTYPE_MASK_blank))\n# define ossl_iscntrl(c) (ossl_ctype_check((c), CTYPE_MASK_cntrl))\n# define ossl_isdigit(c) (ossl_ctype_check((c), CTYPE_MASK_digit))\n# define ossl_isgraph(c) (ossl_ctype_check((c), CTYPE_MASK_graph))\n# define ossl_islower(c) (ossl_ctype_check((c), CTYPE_MASK_lower))\n# define ossl_isprint(c) (ossl_ctype_check((c), CTYPE_MASK_print))\n# define ossl_ispunct(c) (ossl_ctype_check((c), CTYPE_MASK_punct))\n# define ossl_isspace(c) (ossl_ctype_check((c), CTYPE_MASK_space))\n# define ossl_isupper(c) (ossl_ctype_check((c), CTYPE_MASK_upper))\n# define ossl_isxdigit(c) (ossl_ctype_check((c), CTYPE_MASK_xdigit))\n# define ossl_isbase64(c) (ossl_ctype_check((c), CTYPE_MASK_base64))\n# define ossl_isasn1print(c) (ossl_ctype_check((c), CTYPE_MASK_asn1print))\n\n#endif\n" }, { "path": "cryptomini/include/crypto/dso_conf.h", "content": "/* WARNING: do not edit! */\n/* Generated by Makefile from include/crypto/dso_conf.h.in */\n/*\n * Copyright 2016-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_DSO_CONF_H\n# define OSSL_CRYPTO_DSO_CONF_H\n# define DSO_NONE\n# define DSO_EXTENSION \".so\"\n#endif\n" }, { "path": "cryptomini/include/crypto/dso_conf.h.in", "content": "{- join(\"\\n\",map { \"/* $_ */\" } @autowarntext) -}\n/*\n * Copyright 2016-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_DSO_CONF_H\n# define OSSL_CRYPTO_DSO_CONF_H\n{- # The DSO code currently always implements all functions so that no\n # applications will have to worry about that from a compilation point\n # of view. However, the \"method\"s may return zero unless that platform\n # has support compiled in for them. Currently each method is enabled\n # by a define \"DSO_\" ... we translate the \"dso_scheme\" config\n # string entry into using the following logic;\n my $scheme = $disabled{dso} ? undef : uc $target{dso_scheme};\n if (!$scheme) {\n $scheme = \"NONE\";\n }\n my @macros = ( \"DSO_$scheme\" );\n if ($scheme eq 'DLFCN') {\n @macros = ( \"DSO_DLFCN\", \"HAVE_DLFCN_H\" );\n } elsif ($scheme eq \"DLFCN_NO_H\") {\n @macros = ( \"DSO_DLFCN\" );\n }\n join(\"\\n\", map { \"# define $_\" } @macros); -}\n# define DSO_EXTENSION \"{- $target{dso_extension} -}\"\n#endif\n" }, { "path": "cryptomini/include/crypto/ec.h", "content": "/*\n * Copyright 2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/* Internal EC functions for other submodules: not for application use */\n\n#ifndef OSSL_CRYPTO_EC_H\n# define OSSL_CRYPTO_EC_H\n# include \n\n# ifndef OPENSSL_NO_EC\n\n# include \n\n/*-\n * Computes the multiplicative inverse of x in the range\n * [1,EC_GROUP::order), where EC_GROUP::order is the cardinality of the\n * subgroup generated by the generator G:\n *\n * res := x^(-1) (mod EC_GROUP::order).\n *\n * This function expects the following two conditions to hold:\n * - the EC_GROUP order is prime, and\n * - x is included in the range [1, EC_GROUP::order).\n *\n * This function returns 1 on success, 0 on error.\n *\n * If the EC_GROUP order is even, this function explicitly returns 0 as\n * an error.\n * In case any of the two conditions stated above is not satisfied,\n * the correctness of its output is not guaranteed, even if the return\n * value could still be 1 (as primality testing and a conditional modular\n * reduction round on the input can be omitted by the underlying\n * implementations for better SCA properties on regular input values).\n */\n__owur int ec_group_do_inverse_ord(const EC_GROUP *group, BIGNUM *res,\n const BIGNUM *x, BN_CTX *ctx);\n\n/*-\n * ECDH Key Derivation Function as defined in ANSI X9.63\n */\nint ecdh_KDF_X9_63(unsigned char *out, size_t outlen,\n const unsigned char *Z, size_t Zlen,\n const unsigned char *sinfo, size_t sinfolen,\n const EVP_MD *md);\n\n# endif /* OPENSSL_NO_EC */\n#endif\n" }, { "path": "cryptomini/include/crypto/engine.h", "content": "/*\n * Copyright 2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\nvoid engine_load_openssl_int(void);\nvoid engine_load_devcrypto_int(void);\nvoid engine_load_rdrand_int(void);\nvoid engine_load_dynamic_int(void);\nvoid engine_load_padlock_int(void);\nvoid engine_load_capi_int(void);\nvoid engine_load_dasync_int(void);\nvoid engine_load_afalg_int(void);\nvoid engine_cleanup_int(void);\n" }, { "path": "cryptomini/include/crypto/err.h", "content": "/*\n * Copyright 2016-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_ERR_H\n# define OSSL_CRYPTO_ERR_H\n\nint err_load_crypto_strings_int(void);\nvoid err_cleanup(void);\nvoid err_delete_thread_state(void);\nint err_shelve_state(void **);\nvoid err_unshelve_state(void *);\n\n#endif\n" }, { "path": "cryptomini/include/crypto/evp.h", "content": "/*\n * Copyright 2015-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \"internal/refcount.h\"\n\n/*\n * Don't free up md_ctx->pctx in EVP_MD_CTX_reset, use the reserved flag\n * values in evp.h\n */\n#define EVP_MD_CTX_FLAG_KEEP_PKEY_CTX 0x0400\n\nstruct evp_pkey_ctx_st {\n /* Method associated with this operation */\n const EVP_PKEY_METHOD *pmeth;\n /* Engine that implements this method or NULL if builtin */\n ENGINE *engine;\n /* Key: may be NULL */\n EVP_PKEY *pkey;\n /* Peer key for key agreement, may be NULL */\n EVP_PKEY *peerkey;\n /* Actual operation */\n int operation;\n /* Algorithm specific data */\n void *data;\n /* Application specific data */\n void *app_data;\n /* Keygen callback */\n EVP_PKEY_gen_cb *pkey_gencb;\n /* implementation specific keygen data */\n int *keygen_info;\n int keygen_info_count;\n} /* EVP_PKEY_CTX */ ;\n\n#define EVP_PKEY_FLAG_DYNAMIC 1\n\nstruct evp_pkey_method_st {\n int pkey_id;\n int flags;\n int (*init) (EVP_PKEY_CTX *ctx);\n int (*copy) (EVP_PKEY_CTX *dst, EVP_PKEY_CTX *src);\n void (*cleanup) (EVP_PKEY_CTX *ctx);\n int (*paramgen_init) (EVP_PKEY_CTX *ctx);\n int (*paramgen) (EVP_PKEY_CTX *ctx, EVP_PKEY *pkey);\n int (*keygen_init) (EVP_PKEY_CTX *ctx);\n int (*keygen) (EVP_PKEY_CTX *ctx, EVP_PKEY *pkey);\n int (*sign_init) (EVP_PKEY_CTX *ctx);\n int (*sign) (EVP_PKEY_CTX *ctx, unsigned char *sig, size_t *siglen,\n const unsigned char *tbs, size_t tbslen);\n int (*verify_init) (EVP_PKEY_CTX *ctx);\n int (*verify) (EVP_PKEY_CTX *ctx,\n const unsigned char *sig, size_t siglen,\n const unsigned char *tbs, size_t tbslen);\n int (*verify_recover_init) (EVP_PKEY_CTX *ctx);\n int (*verify_recover) (EVP_PKEY_CTX *ctx,\n unsigned char *rout, size_t *routlen,\n const unsigned char *sig, size_t siglen);\n int (*signctx_init) (EVP_PKEY_CTX *ctx, EVP_MD_CTX *mctx);\n int (*signctx) (EVP_PKEY_CTX *ctx, unsigned char *sig, size_t *siglen,\n EVP_MD_CTX *mctx);\n int (*verifyctx_init) (EVP_PKEY_CTX *ctx, EVP_MD_CTX *mctx);\n int (*verifyctx) (EVP_PKEY_CTX *ctx, const unsigned char *sig, int siglen,\n EVP_MD_CTX *mctx);\n int (*encrypt_init) (EVP_PKEY_CTX *ctx);\n int (*encrypt) (EVP_PKEY_CTX *ctx, unsigned char *out, size_t *outlen,\n const unsigned char *in, size_t inlen);\n int (*decrypt_init) (EVP_PKEY_CTX *ctx);\n int (*decrypt) (EVP_PKEY_CTX *ctx, unsigned char *out, size_t *outlen,\n const unsigned char *in, size_t inlen);\n int (*derive_init) (EVP_PKEY_CTX *ctx);\n int (*derive) (EVP_PKEY_CTX *ctx, unsigned char *key, size_t *keylen);\n int (*ctrl) (EVP_PKEY_CTX *ctx, int type, int p1, void *p2);\n int (*ctrl_str) (EVP_PKEY_CTX *ctx, const char *type, const char *value);\n int (*digestsign) (EVP_MD_CTX *ctx, unsigned char *sig, size_t *siglen,\n const unsigned char *tbs, size_t tbslen);\n int (*digestverify) (EVP_MD_CTX *ctx, const unsigned char *sig,\n size_t siglen, const unsigned char *tbs,\n size_t tbslen);\n int (*check) (EVP_PKEY *pkey);\n int (*public_check) (EVP_PKEY *pkey);\n int (*param_check) (EVP_PKEY *pkey);\n\n int (*digest_custom) (EVP_PKEY_CTX *ctx, EVP_MD_CTX *mctx);\n} /* EVP_PKEY_METHOD */ ;\n\nDEFINE_STACK_OF_CONST(EVP_PKEY_METHOD)\n\nvoid evp_pkey_set_cb_translate(BN_GENCB *cb, EVP_PKEY_CTX *ctx);\n\nextern const EVP_PKEY_METHOD cmac_pkey_meth;\nextern const EVP_PKEY_METHOD dh_pkey_meth;\nextern const EVP_PKEY_METHOD dhx_pkey_meth;\nextern const EVP_PKEY_METHOD dsa_pkey_meth;\nextern const EVP_PKEY_METHOD ec_pkey_meth;\nextern const EVP_PKEY_METHOD sm2_pkey_meth;\nextern const EVP_PKEY_METHOD ecx25519_pkey_meth;\nextern const EVP_PKEY_METHOD ecx448_pkey_meth;\nextern const EVP_PKEY_METHOD ed25519_pkey_meth;\nextern const EVP_PKEY_METHOD ed448_pkey_meth;\nextern const EVP_PKEY_METHOD hmac_pkey_meth;\nextern const EVP_PKEY_METHOD rsa_pkey_meth;\nextern const EVP_PKEY_METHOD rsa_pss_pkey_meth;\nextern const EVP_PKEY_METHOD scrypt_pkey_meth;\nextern const EVP_PKEY_METHOD tls1_prf_pkey_meth;\nextern const EVP_PKEY_METHOD hkdf_pkey_meth;\nextern const EVP_PKEY_METHOD poly1305_pkey_meth;\nextern const EVP_PKEY_METHOD siphash_pkey_meth;\n\nstruct evp_md_st {\n int type;\n int pkey_type;\n int md_size;\n unsigned long flags;\n int (*init) (EVP_MD_CTX *ctx);\n int (*update) (EVP_MD_CTX *ctx, const void *data, size_t count);\n int (*final) (EVP_MD_CTX *ctx, unsigned char *md);\n int (*copy) (EVP_MD_CTX *to, const EVP_MD_CTX *from);\n int (*cleanup) (EVP_MD_CTX *ctx);\n int block_size;\n int ctx_size; /* how big does the ctx->md_data need to be */\n /* control function */\n int (*md_ctrl) (EVP_MD_CTX *ctx, int cmd, int p1, void *p2);\n} /* EVP_MD */ ;\n\nstruct evp_cipher_st {\n int nid;\n int block_size;\n /* Default value for variable length ciphers */\n int key_len;\n int iv_len;\n /* Various flags */\n unsigned long flags;\n /* init key */\n int (*init) (EVP_CIPHER_CTX *ctx, const unsigned char *key,\n const unsigned char *iv, int enc);\n /* encrypt/decrypt data */\n int (*do_cipher) (EVP_CIPHER_CTX *ctx, unsigned char *out,\n const unsigned char *in, size_t inl);\n /* cleanup ctx */\n int (*cleanup) (EVP_CIPHER_CTX *);\n /* how big ctx->cipher_data needs to be */\n int ctx_size;\n /* Populate a ASN1_TYPE with parameters */\n int (*set_asn1_parameters) (EVP_CIPHER_CTX *, ASN1_TYPE *);\n /* Get parameters from a ASN1_TYPE */\n int (*get_asn1_parameters) (EVP_CIPHER_CTX *, ASN1_TYPE *);\n /* Miscellaneous operations */\n int (*ctrl) (EVP_CIPHER_CTX *, int type, int arg, void *ptr);\n /* Application data */\n void *app_data;\n} /* EVP_CIPHER */ ;\n\n/* Macros to code block cipher wrappers */\n\n/* Wrapper functions for each cipher mode */\n\n#define EVP_C_DATA(kstruct, ctx) \\\n ((kstruct *)EVP_CIPHER_CTX_get_cipher_data(ctx))\n\n#define BLOCK_CIPHER_ecb_loop() \\\n size_t i, bl; \\\n bl = EVP_CIPHER_CTX_cipher(ctx)->block_size; \\\n if (inl < bl) return 1;\\\n inl -= bl; \\\n for (i=0; i <= inl; i+=bl)\n\n#define BLOCK_CIPHER_func_ecb(cname, cprefix, kstruct, ksched) \\\nstatic int cname##_ecb_cipher(EVP_CIPHER_CTX *ctx, unsigned char *out, const unsigned char *in, size_t inl) \\\n{\\\n BLOCK_CIPHER_ecb_loop() \\\n cprefix##_ecb_encrypt(in + i, out + i, &EVP_C_DATA(kstruct,ctx)->ksched, EVP_CIPHER_CTX_encrypting(ctx)); \\\n return 1;\\\n}\n\n#define EVP_MAXCHUNK ((size_t)1<<(sizeof(long)*8-2))\n\n#define BLOCK_CIPHER_func_ofb(cname, cprefix, cbits, kstruct, ksched) \\\n static int cname##_ofb_cipher(EVP_CIPHER_CTX *ctx, unsigned char *out, const unsigned char *in, size_t inl) \\\n{\\\n while(inl>=EVP_MAXCHUNK) {\\\n int num = EVP_CIPHER_CTX_num(ctx);\\\n cprefix##_ofb##cbits##_encrypt(in, out, (long)EVP_MAXCHUNK, &EVP_C_DATA(kstruct,ctx)->ksched, EVP_CIPHER_CTX_iv_noconst(ctx), &num); \\\n EVP_CIPHER_CTX_set_num(ctx, num);\\\n inl-=EVP_MAXCHUNK;\\\n in +=EVP_MAXCHUNK;\\\n out+=EVP_MAXCHUNK;\\\n }\\\n if (inl) {\\\n int num = EVP_CIPHER_CTX_num(ctx);\\\n cprefix##_ofb##cbits##_encrypt(in, out, (long)inl, &EVP_C_DATA(kstruct,ctx)->ksched, EVP_CIPHER_CTX_iv_noconst(ctx), &num); \\\n EVP_CIPHER_CTX_set_num(ctx, num);\\\n }\\\n return 1;\\\n}\n\n#define BLOCK_CIPHER_func_cbc(cname, cprefix, kstruct, ksched) \\\nstatic int cname##_cbc_cipher(EVP_CIPHER_CTX *ctx, unsigned char *out, const unsigned char *in, size_t inl) \\\n{\\\n while(inl>=EVP_MAXCHUNK) \\\n {\\\n cprefix##_cbc_encrypt(in, out, (long)EVP_MAXCHUNK, &EVP_C_DATA(kstruct,ctx)->ksched, EVP_CIPHER_CTX_iv_noconst(ctx), EVP_CIPHER_CTX_encrypting(ctx));\\\n inl-=EVP_MAXCHUNK;\\\n in +=EVP_MAXCHUNK;\\\n out+=EVP_MAXCHUNK;\\\n }\\\n if (inl)\\\n cprefix##_cbc_encrypt(in, out, (long)inl, &EVP_C_DATA(kstruct,ctx)->ksched, EVP_CIPHER_CTX_iv_noconst(ctx), EVP_CIPHER_CTX_encrypting(ctx));\\\n return 1;\\\n}\n\n#define BLOCK_CIPHER_func_cfb(cname, cprefix, cbits, kstruct, ksched) \\\nstatic int cname##_cfb##cbits##_cipher(EVP_CIPHER_CTX *ctx, unsigned char *out, const unsigned char *in, size_t inl) \\\n{\\\n size_t chunk = EVP_MAXCHUNK;\\\n if (cbits == 1) chunk >>= 3;\\\n if (inl < chunk) chunk = inl;\\\n while (inl && inl >= chunk)\\\n {\\\n int num = EVP_CIPHER_CTX_num(ctx);\\\n cprefix##_cfb##cbits##_encrypt(in, out, (long) \\\n ((cbits == 1) \\\n && !EVP_CIPHER_CTX_test_flags(ctx, EVP_CIPH_FLAG_LENGTH_BITS) \\\n ? chunk*8 : chunk), \\\n &EVP_C_DATA(kstruct, ctx)->ksched, EVP_CIPHER_CTX_iv_noconst(ctx),\\\n &num, EVP_CIPHER_CTX_encrypting(ctx));\\\n EVP_CIPHER_CTX_set_num(ctx, num);\\\n inl -= chunk;\\\n in += chunk;\\\n out += chunk;\\\n if (inl < chunk) chunk = inl;\\\n }\\\n return 1;\\\n}\n\n#define BLOCK_CIPHER_all_funcs(cname, cprefix, cbits, kstruct, ksched) \\\n BLOCK_CIPHER_func_cbc(cname, cprefix, kstruct, ksched) \\\n BLOCK_CIPHER_func_cfb(cname, cprefix, cbits, kstruct, ksched) \\\n BLOCK_CIPHER_func_ecb(cname, cprefix, kstruct, ksched) \\\n BLOCK_CIPHER_func_ofb(cname, cprefix, cbits, kstruct, ksched)\n\n#define BLOCK_CIPHER_def1(cname, nmode, mode, MODE, kstruct, nid, block_size, \\\n key_len, iv_len, flags, init_key, cleanup, \\\n set_asn1, get_asn1, ctrl) \\\nstatic const EVP_CIPHER cname##_##mode = { \\\n nid##_##nmode, block_size, key_len, iv_len, \\\n flags | EVP_CIPH_##MODE##_MODE, \\\n init_key, \\\n cname##_##mode##_cipher, \\\n cleanup, \\\n sizeof(kstruct), \\\n set_asn1, get_asn1,\\\n ctrl, \\\n NULL \\\n}; \\\nconst EVP_CIPHER *EVP_##cname##_##mode(void) { return &cname##_##mode; }\n\n#define BLOCK_CIPHER_def_cbc(cname, kstruct, nid, block_size, key_len, \\\n iv_len, flags, init_key, cleanup, set_asn1, \\\n get_asn1, ctrl) \\\nBLOCK_CIPHER_def1(cname, cbc, cbc, CBC, kstruct, nid, block_size, key_len, \\\n iv_len, flags, init_key, cleanup, set_asn1, get_asn1, ctrl)\n\n#define BLOCK_CIPHER_def_cfb(cname, kstruct, nid, key_len, \\\n iv_len, cbits, flags, init_key, cleanup, \\\n set_asn1, get_asn1, ctrl) \\\nBLOCK_CIPHER_def1(cname, cfb##cbits, cfb##cbits, CFB, kstruct, nid, 1, \\\n key_len, iv_len, flags, init_key, cleanup, set_asn1, \\\n get_asn1, ctrl)\n\n#define BLOCK_CIPHER_def_ofb(cname, kstruct, nid, key_len, \\\n iv_len, cbits, flags, init_key, cleanup, \\\n set_asn1, get_asn1, ctrl) \\\nBLOCK_CIPHER_def1(cname, ofb##cbits, ofb, OFB, kstruct, nid, 1, \\\n key_len, iv_len, flags, init_key, cleanup, set_asn1, \\\n get_asn1, ctrl)\n\n#define BLOCK_CIPHER_def_ecb(cname, kstruct, nid, block_size, key_len, \\\n flags, init_key, cleanup, set_asn1, \\\n get_asn1, ctrl) \\\nBLOCK_CIPHER_def1(cname, ecb, ecb, ECB, kstruct, nid, block_size, key_len, \\\n 0, flags, init_key, cleanup, set_asn1, get_asn1, ctrl)\n\n#define BLOCK_CIPHER_defs(cname, kstruct, \\\n nid, block_size, key_len, iv_len, cbits, flags, \\\n init_key, cleanup, set_asn1, get_asn1, ctrl) \\\nBLOCK_CIPHER_def_cbc(cname, kstruct, nid, block_size, key_len, iv_len, flags, \\\n init_key, cleanup, set_asn1, get_asn1, ctrl) \\\nBLOCK_CIPHER_def_cfb(cname, kstruct, nid, key_len, iv_len, cbits, \\\n flags, init_key, cleanup, set_asn1, get_asn1, ctrl) \\\nBLOCK_CIPHER_def_ofb(cname, kstruct, nid, key_len, iv_len, cbits, \\\n flags, init_key, cleanup, set_asn1, get_asn1, ctrl) \\\nBLOCK_CIPHER_def_ecb(cname, kstruct, nid, block_size, key_len, flags, \\\n init_key, cleanup, set_asn1, get_asn1, ctrl)\n\n/*-\n#define BLOCK_CIPHER_defs(cname, kstruct, \\\n nid, block_size, key_len, iv_len, flags,\\\n init_key, cleanup, set_asn1, get_asn1, ctrl)\\\nstatic const EVP_CIPHER cname##_cbc = {\\\n nid##_cbc, block_size, key_len, iv_len, \\\n flags | EVP_CIPH_CBC_MODE,\\\n init_key,\\\n cname##_cbc_cipher,\\\n cleanup,\\\n sizeof(EVP_CIPHER_CTX)-sizeof((((EVP_CIPHER_CTX *)NULL)->c))+\\\n sizeof((((EVP_CIPHER_CTX *)NULL)->c.kstruct)),\\\n set_asn1, get_asn1,\\\n ctrl, \\\n NULL \\\n};\\\nconst EVP_CIPHER *EVP_##cname##_cbc(void) { return &cname##_cbc; }\\\nstatic const EVP_CIPHER cname##_cfb = {\\\n nid##_cfb64, 1, key_len, iv_len, \\\n flags | EVP_CIPH_CFB_MODE,\\\n init_key,\\\n cname##_cfb_cipher,\\\n cleanup,\\\n sizeof(EVP_CIPHER_CTX)-sizeof((((EVP_CIPHER_CTX *)NULL)->c))+\\\n sizeof((((EVP_CIPHER_CTX *)NULL)->c.kstruct)),\\\n set_asn1, get_asn1,\\\n ctrl,\\\n NULL \\\n};\\\nconst EVP_CIPHER *EVP_##cname##_cfb(void) { return &cname##_cfb; }\\\nstatic const EVP_CIPHER cname##_ofb = {\\\n nid##_ofb64, 1, key_len, iv_len, \\\n flags | EVP_CIPH_OFB_MODE,\\\n init_key,\\\n cname##_ofb_cipher,\\\n cleanup,\\\n sizeof(EVP_CIPHER_CTX)-sizeof((((EVP_CIPHER_CTX *)NULL)->c))+\\\n sizeof((((EVP_CIPHER_CTX *)NULL)->c.kstruct)),\\\n set_asn1, get_asn1,\\\n ctrl,\\\n NULL \\\n};\\\nconst EVP_CIPHER *EVP_##cname##_ofb(void) { return &cname##_ofb; }\\\nstatic const EVP_CIPHER cname##_ecb = {\\\n nid##_ecb, block_size, key_len, iv_len, \\\n flags | EVP_CIPH_ECB_MODE,\\\n init_key,\\\n cname##_ecb_cipher,\\\n cleanup,\\\n sizeof(EVP_CIPHER_CTX)-sizeof((((EVP_CIPHER_CTX *)NULL)->c))+\\\n sizeof((((EVP_CIPHER_CTX *)NULL)->c.kstruct)),\\\n set_asn1, get_asn1,\\\n ctrl,\\\n NULL \\\n};\\\nconst EVP_CIPHER *EVP_##cname##_ecb(void) { return &cname##_ecb; }\n*/\n\n#define IMPLEMENT_BLOCK_CIPHER(cname, ksched, cprefix, kstruct, nid, \\\n block_size, key_len, iv_len, cbits, \\\n flags, init_key, \\\n cleanup, set_asn1, get_asn1, ctrl) \\\n BLOCK_CIPHER_all_funcs(cname, cprefix, cbits, kstruct, ksched) \\\n BLOCK_CIPHER_defs(cname, kstruct, nid, block_size, key_len, iv_len, \\\n cbits, flags, init_key, cleanup, set_asn1, \\\n get_asn1, ctrl)\n\n#define IMPLEMENT_CFBR(cipher,cprefix,kstruct,ksched,keysize,cbits,iv_len,fl) \\\n BLOCK_CIPHER_func_cfb(cipher##_##keysize,cprefix,cbits,kstruct,ksched) \\\n BLOCK_CIPHER_def_cfb(cipher##_##keysize,kstruct, \\\n NID_##cipher##_##keysize, keysize/8, iv_len, cbits, \\\n (fl)|EVP_CIPH_FLAG_DEFAULT_ASN1, \\\n cipher##_init_key, NULL, NULL, NULL, NULL)\n\n\n# ifndef OPENSSL_NO_EC\n\n#define X25519_KEYLEN 32\n#define X448_KEYLEN 56\n#define ED448_KEYLEN 57\n\n#define MAX_KEYLEN ED448_KEYLEN\n\ntypedef struct {\n unsigned char pubkey[MAX_KEYLEN];\n unsigned char *privkey;\n} ECX_KEY;\n\n#endif\n\n/*\n * Type needs to be a bit field Sub-type needs to be for variations on the\n * method, as in, can it do arbitrary encryption....\n */\nstruct evp_pkey_st {\n int type;\n int save_type;\n CRYPTO_REF_COUNT references;\n const EVP_PKEY_ASN1_METHOD *ameth;\n ENGINE *engine;\n ENGINE *pmeth_engine; /* If not NULL public key ENGINE to use */\n union {\n void *ptr;\n# ifndef OPENSSL_NO_RSA\n struct rsa_st *rsa; /* RSA */\n# endif\n# ifndef OPENSSL_NO_DSA\n struct dsa_st *dsa; /* DSA */\n# endif\n# ifndef OPENSSL_NO_DH\n struct dh_st *dh; /* DH */\n# endif\n# ifndef OPENSSL_NO_EC\n struct ec_key_st *ec; /* ECC */\n ECX_KEY *ecx; /* X25519, X448, Ed25519, Ed448 */\n# endif\n } pkey;\n int save_parameters;\n STACK_OF(X509_ATTRIBUTE) *attributes; /* [ 0 ] */\n CRYPTO_RWLOCK *lock;\n} /* EVP_PKEY */ ;\n\n\nvoid openssl_add_all_ciphers_int(void);\nvoid openssl_add_all_digests_int(void);\nvoid evp_cleanup_int(void);\nvoid evp_app_cleanup_int(void);\n\n/* Pulling defines out of C source files */\n\n#define EVP_RC4_KEY_SIZE 16\n#ifndef TLS1_1_VERSION\n# define TLS1_1_VERSION 0x0302\n#endif\n\nvoid evp_encode_ctx_set_flags(EVP_ENCODE_CTX *ctx, unsigned int flags);\n\n/* EVP_ENCODE_CTX flags */\n/* Don't generate new lines when encoding */\n#define EVP_ENCODE_CTX_NO_NEWLINES 1\n/* Use the SRP base64 alphabet instead of the standard one */\n#define EVP_ENCODE_CTX_USE_SRP_ALPHABET 2\n" }, { "path": "cryptomini/include/crypto/lhash.h", "content": "/*\n * Copyright 2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_LHASH_H\n# define OSSL_CRYPTO_LHASH_H\n\nunsigned long openssl_lh_strcasehash(const char *);\n\n#endif\n" }, { "path": "cryptomini/include/crypto/md32_common.h", "content": "/*\n * Copyright 1999-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*-\n * This is a generic 32 bit \"collector\" for message digest algorithms.\n * Whenever needed it collects input character stream into chunks of\n * 32 bit values and invokes a block function that performs actual hash\n * calculations.\n *\n * Porting guide.\n *\n * Obligatory macros:\n *\n * DATA_ORDER_IS_BIG_ENDIAN or DATA_ORDER_IS_LITTLE_ENDIAN\n * this macro defines byte order of input stream.\n * HASH_CBLOCK\n * size of a unit chunk HASH_BLOCK operates on.\n * HASH_LONG\n * has to be at least 32 bit wide.\n * HASH_CTX\n * context structure that at least contains following\n * members:\n * typedef struct {\n * ...\n * HASH_LONG Nl,Nh;\n * either {\n * HASH_LONG data[HASH_LBLOCK];\n * unsigned char data[HASH_CBLOCK];\n * };\n * unsigned int num;\n * ...\n * } HASH_CTX;\n * data[] vector is expected to be zeroed upon first call to\n * HASH_UPDATE.\n * HASH_UPDATE\n * name of \"Update\" function, implemented here.\n * HASH_TRANSFORM\n * name of \"Transform\" function, implemented here.\n * HASH_FINAL\n * name of \"Final\" function, implemented here.\n * HASH_BLOCK_DATA_ORDER\n * name of \"block\" function capable of treating *unaligned* input\n * message in original (data) byte order, implemented externally.\n * HASH_MAKE_STRING\n * macro converting context variables to an ASCII hash string.\n *\n * MD5 example:\n *\n * #define DATA_ORDER_IS_LITTLE_ENDIAN\n *\n * #define HASH_LONG MD5_LONG\n * #define HASH_CTX MD5_CTX\n * #define HASH_CBLOCK MD5_CBLOCK\n * #define HASH_UPDATE MD5_Update\n * #define HASH_TRANSFORM MD5_Transform\n * #define HASH_FINAL MD5_Final\n * #define HASH_BLOCK_DATA_ORDER md5_block_data_order\n */\n\n#include \n\n#if !defined(DATA_ORDER_IS_BIG_ENDIAN) && !defined(DATA_ORDER_IS_LITTLE_ENDIAN)\n# error \"DATA_ORDER must be defined!\"\n#endif\n\n#ifndef HASH_CBLOCK\n# error \"HASH_CBLOCK must be defined!\"\n#endif\n#ifndef HASH_LONG\n# error \"HASH_LONG must be defined!\"\n#endif\n#ifndef HASH_CTX\n# error \"HASH_CTX must be defined!\"\n#endif\n\n#ifndef HASH_UPDATE\n# error \"HASH_UPDATE must be defined!\"\n#endif\n#ifndef HASH_TRANSFORM\n# error \"HASH_TRANSFORM must be defined!\"\n#endif\n#ifndef HASH_FINAL\n# error \"HASH_FINAL must be defined!\"\n#endif\n\n#ifndef HASH_BLOCK_DATA_ORDER\n# error \"HASH_BLOCK_DATA_ORDER must be defined!\"\n#endif\n\n#define ROTATE(a,n) (((a)<<(n))|(((a)&0xffffffff)>>(32-(n))))\n\n#if defined(DATA_ORDER_IS_BIG_ENDIAN)\n\n# define HOST_c2l(c,l) (l =(((unsigned long)(*((c)++)))<<24), \\\n l|=(((unsigned long)(*((c)++)))<<16), \\\n l|=(((unsigned long)(*((c)++)))<< 8), \\\n l|=(((unsigned long)(*((c)++))) ) )\n# define HOST_l2c(l,c) (*((c)++)=(unsigned char)(((l)>>24)&0xff), \\\n *((c)++)=(unsigned char)(((l)>>16)&0xff), \\\n *((c)++)=(unsigned char)(((l)>> 8)&0xff), \\\n *((c)++)=(unsigned char)(((l) )&0xff), \\\n l)\n\n#elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)\n\n# define HOST_c2l(c,l) (l =(((unsigned long)(*((c)++))) ), \\\n l|=(((unsigned long)(*((c)++)))<< 8), \\\n l|=(((unsigned long)(*((c)++)))<<16), \\\n l|=(((unsigned long)(*((c)++)))<<24) )\n# define HOST_l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \\\n *((c)++)=(unsigned char)(((l)>> 8)&0xff), \\\n *((c)++)=(unsigned char)(((l)>>16)&0xff), \\\n *((c)++)=(unsigned char)(((l)>>24)&0xff), \\\n l)\n\n#endif\n\n/*\n * Time for some action :-)\n */\n\nint HASH_UPDATE(HASH_CTX *c, const void *data_, size_t len)\n{\n const unsigned char *data = data_;\n unsigned char *p;\n HASH_LONG l;\n size_t n;\n\n if (len == 0)\n return 1;\n\n l = (c->Nl + (((HASH_LONG) len) << 3)) & 0xffffffffUL;\n if (l < c->Nl) /* overflow */\n c->Nh++;\n c->Nh += (HASH_LONG) (len >> 29); /* might cause compiler warning on\n * 16-bit */\n c->Nl = l;\n\n n = c->num;\n if (n != 0) {\n p = (unsigned char *)c->data;\n\n if (len >= HASH_CBLOCK || len + n >= HASH_CBLOCK) {\n memcpy(p + n, data, HASH_CBLOCK - n);\n HASH_BLOCK_DATA_ORDER(c, p, 1);\n n = HASH_CBLOCK - n;\n data += n;\n len -= n;\n c->num = 0;\n /*\n * We use memset rather than OPENSSL_cleanse() here deliberately.\n * Using OPENSSL_cleanse() here could be a performance issue. It\n * will get properly cleansed on finalisation so this isn't a\n * security problem.\n */\n memset(p, 0, HASH_CBLOCK); /* keep it zeroed */\n } else {\n memcpy(p + n, data, len);\n c->num += (unsigned int)len;\n return 1;\n }\n }\n\n n = len / HASH_CBLOCK;\n if (n > 0) {\n HASH_BLOCK_DATA_ORDER(c, data, n);\n n *= HASH_CBLOCK;\n data += n;\n len -= n;\n }\n\n if (len != 0) {\n p = (unsigned char *)c->data;\n c->num = (unsigned int)len;\n memcpy(p, data, len);\n }\n return 1;\n}\n\nvoid HASH_TRANSFORM(HASH_CTX *c, const unsigned char *data)\n{\n HASH_BLOCK_DATA_ORDER(c, data, 1);\n}\n\nint HASH_FINAL(unsigned char *md, HASH_CTX *c)\n{\n unsigned char *p = (unsigned char *)c->data;\n size_t n = c->num;\n\n p[n] = 0x80; /* there is always room for one */\n n++;\n\n if (n > (HASH_CBLOCK - 8)) {\n memset(p + n, 0, HASH_CBLOCK - n);\n n = 0;\n HASH_BLOCK_DATA_ORDER(c, p, 1);\n }\n memset(p + n, 0, HASH_CBLOCK - 8 - n);\n\n p += HASH_CBLOCK - 8;\n#if defined(DATA_ORDER_IS_BIG_ENDIAN)\n (void)HOST_l2c(c->Nh, p);\n (void)HOST_l2c(c->Nl, p);\n#elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)\n (void)HOST_l2c(c->Nl, p);\n (void)HOST_l2c(c->Nh, p);\n#endif\n p -= HASH_CBLOCK;\n HASH_BLOCK_DATA_ORDER(c, p, 1);\n c->num = 0;\n OPENSSL_cleanse(p, HASH_CBLOCK);\n\n#ifndef HASH_MAKE_STRING\n# error \"HASH_MAKE_STRING must be defined!\"\n#else\n HASH_MAKE_STRING(c, md);\n#endif\n\n return 1;\n}\n\n#ifndef MD32_REG_T\n# if defined(__alpha) || defined(__sparcv9) || defined(__mips)\n# define MD32_REG_T long\n/*\n * This comment was originally written for MD5, which is why it\n * discusses A-D. But it basically applies to all 32-bit digests,\n * which is why it was moved to common header file.\n *\n * In case you wonder why A-D are declared as long and not\n * as MD5_LONG. Doing so results in slight performance\n * boost on LP64 architectures. The catch is we don't\n * really care if 32 MSBs of a 64-bit register get polluted\n * with eventual overflows as we *save* only 32 LSBs in\n * *either* case. Now declaring 'em long excuses the compiler\n * from keeping 32 MSBs zeroed resulting in 13% performance\n * improvement under SPARC Solaris7/64 and 5% under AlphaLinux.\n * Well, to be honest it should say that this *prevents*\n * performance degradation.\n */\n# else\n/*\n * Above is not absolute and there are LP64 compilers that\n * generate better code if MD32_REG_T is defined int. The above\n * pre-processor condition reflects the circumstances under which\n * the conclusion was made and is subject to further extension.\n */\n# define MD32_REG_T int\n# endif\n#endif\n" }, { "path": "cryptomini/include/crypto/objects.h", "content": "/*\n * Copyright 2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\nvoid obj_cleanup_int(void);\n" }, { "path": "cryptomini/include/crypto/poly1305.h", "content": "/*\n * Copyright 2015-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\n#define POLY1305_BLOCK_SIZE 16\n#define POLY1305_DIGEST_SIZE 16\n#define POLY1305_KEY_SIZE 32\n\ntypedef struct poly1305_context POLY1305;\n\nsize_t Poly1305_ctx_size(void);\nvoid Poly1305_Init(POLY1305 *ctx, const unsigned char key[32]);\nvoid Poly1305_Update(POLY1305 *ctx, const unsigned char *inp, size_t len);\nvoid Poly1305_Final(POLY1305 *ctx, unsigned char mac[16]);\n" }, { "path": "cryptomini/include/crypto/rand.h", "content": "/*\n * Copyright 2016-2021 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * Licensed under the OpenSSL licenses, (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * https://www.openssl.org/source/license.html\n * or in the file LICENSE in the source distribution.\n */\n\n#ifndef OSSL_CRYPTO_RAND_H\n# define OSSL_CRYPTO_RAND_H\n\n# include \n\n# if defined(__APPLE__) && !defined(OPENSSL_NO_APPLE_CRYPTO_RANDOM)\n# include \n# if (defined(__MAC_OS_X_VERSION_MIN_REQUIRED) && __MAC_OS_X_VERSION_MIN_REQUIRED >= 101200) || \\\n (defined(__IPHONE_OS_VERSION_MIN_REQUIRED) && __IPHONE_OS_VERSION_MIN_REQUIRED >= 80000)\n# define OPENSSL_APPLE_CRYPTO_RANDOM 1\n# include \n# include \n# endif\n# endif\n\n/* forward declaration */\ntypedef struct rand_pool_st RAND_POOL;\n\nvoid rand_cleanup_int(void);\nvoid rand_drbg_cleanup_int(void);\nvoid drbg_delete_thread_state(void);\n\n/* Hardware-based seeding functions. */\nsize_t rand_acquire_entropy_from_tsc(RAND_POOL *pool);\nsize_t rand_acquire_entropy_from_cpu(RAND_POOL *pool);\n\n/* DRBG entropy callbacks. */\nsize_t rand_drbg_get_entropy(RAND_DRBG *drbg,\n unsigned char **pout,\n int entropy, size_t min_len, size_t max_len,\n int prediction_resistance);\nvoid rand_drbg_cleanup_entropy(RAND_DRBG *drbg,\n unsigned char *out, size_t outlen);\nsize_t rand_drbg_get_nonce(RAND_DRBG *drbg,\n unsigned char **pout,\n int entropy, size_t min_len, size_t max_len);\nvoid rand_drbg_cleanup_nonce(RAND_DRBG *drbg,\n unsigned char *out, size_t outlen);\n\nsize_t rand_drbg_get_additional_data(RAND_POOL *pool, unsigned char **pout);\n\nvoid rand_drbg_cleanup_additional_data(RAND_POOL *pool, unsigned char *out);\n\n/*\n * RAND_POOL functions\n */\nRAND_POOL *rand_pool_new(int entropy_requested, int secure,\n size_t min_len, size_t max_len);\nRAND_POOL *rand_pool_attach(const unsigned char *buffer, size_t len,\n size_t entropy);\nvoid rand_pool_free(RAND_POOL *pool);\n\nconst unsigned char *rand_pool_buffer(RAND_POOL *pool);\nunsigned char *rand_pool_detach(RAND_POOL *pool);\nvoid rand_pool_reattach(RAND_POOL *pool, unsigned char *buffer);\n\nsize_t rand_pool_entropy(RAND_POOL *pool);\nsize_t rand_pool_length(RAND_POOL *pool);\n\nsize_t rand_pool_entropy_available(RAND_POOL *pool);\nsize_t rand_pool_entropy_needed(RAND_POOL *pool);\n/* |entropy_factor| expresses how many bits of data contain 1 bit of entropy */\nsize_t rand_pool_bytes_needed(RAND_POOL *pool, unsigned int entropy_factor);\nsize_t rand_pool_bytes_remaining(RAND_POOL *pool);\n\nint rand_pool_add(RAND_POOL *pool,\n const unsigned char *buffer, size_t len, size_t entropy);\nunsigned char *rand_pool_add_begin(RAND_POOL *pool, size_t len);\nint rand_pool_add_end(RAND_POOL *pool, size_t len, size_t entropy);\n\n\n/*\n * Add random bytes to the pool to acquire requested amount of entropy\n *\n * This function is platform specific and tries to acquire the requested\n * amount of entropy by polling platform specific entropy sources.\n *\n * If the function succeeds in acquiring at least |entropy_requested| bits\n * of entropy, the total entropy count is returned. If it fails, it returns\n * an entropy count of 0.\n */\nsize_t rand_pool_acquire_entropy(RAND_POOL *pool);\n\n/*\n * Add some application specific nonce data\n *\n * This function is platform specific and adds some application specific\n * data to the nonce used for instantiating the drbg.\n *\n * This data currently consists of the process and thread id, and a high\n * resolution timestamp. The data does not include an atomic counter,\n * because that is added by the calling function rand_drbg_get_nonce().\n *\n * Returns 1 on success and 0 on failure.\n */\nint rand_pool_add_nonce_data(RAND_POOL *pool);\n\n\n/*\n * Add some platform specific additional data\n *\n * This function is platform specific and adds some random noise to the\n * additional data used for generating random bytes and for reseeding\n * the drbg.\n *\n * Returns 1 on success and 0 on failure.\n */\nint rand_pool_add_additional_data(RAND_POOL *pool);\n\n/*\n * Initialise the random pool reseeding sources.\n *\n * Returns 1 on success and 0 on failure.\n */\nint rand_pool_init(void);\n\n/*\n * Finalise the random pool reseeding sources.\n */\nvoid rand_pool_cleanup(void);\n\n/*\n * Control the random pool use of open file descriptors.\n */\nvoid rand_pool_keep_random_devices_open(int keep);\n\n#endif\n" }, { "path": "cryptomini/include/crypto/sha.h", "content": "/*\n * Copyright 2018 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_SHA_H\n# define OSSL_CRYPTO_SHA_H\n\n# include \n\nint sha512_224_init(SHA512_CTX *);\nint sha512_256_init(SHA512_CTX *);\n\n#endif\n" }, { "path": "cryptomini/include/crypto/siphash.h", "content": "/*\n * Copyright 2017-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\n#define SIPHASH_BLOCK_SIZE 8\n#define SIPHASH_KEY_SIZE 16\n#define SIPHASH_MIN_DIGEST_SIZE 8\n#define SIPHASH_MAX_DIGEST_SIZE 16\n\ntypedef struct siphash_st SIPHASH;\n\nsize_t SipHash_ctx_size(void);\nsize_t SipHash_hash_size(SIPHASH *ctx);\nint SipHash_set_hash_size(SIPHASH *ctx, size_t hash_size);\nint SipHash_Init(SIPHASH *ctx, const unsigned char *k,\n int crounds, int drounds);\nvoid SipHash_Update(SIPHASH *ctx, const unsigned char *in, size_t inlen);\nint SipHash_Final(SIPHASH *ctx, unsigned char *out, size_t outlen);\n" }, { "path": "cryptomini/include/crypto/sm2.h", "content": "/*\n * Copyright 2017-2021 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright 2017 Ribose Inc. All Rights Reserved.\n * Ported from Ribose contributions from Botan.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_SM2_H\n# define OSSL_CRYPTO_SM2_H\n# include \n\n# ifndef OPENSSL_NO_SM2\n\n# include \n\n/* The default user id as specified in GM/T 0009-2012 */\n# define SM2_DEFAULT_USERID \"1234567812345678\"\n\nint sm2_compute_z_digest(uint8_t *out,\n const EVP_MD *digest,\n const uint8_t *id,\n const size_t id_len,\n const EC_KEY *key);\n\n/*\n * SM2 signature operation. Computes Z and then signs H(Z || msg) using SM2\n */\nECDSA_SIG *sm2_do_sign(const EC_KEY *key,\n const EVP_MD *digest,\n const uint8_t *id,\n const size_t id_len,\n const uint8_t *msg, size_t msg_len);\n\nint sm2_do_verify(const EC_KEY *key,\n const EVP_MD *digest,\n const ECDSA_SIG *signature,\n const uint8_t *id,\n const size_t id_len,\n const uint8_t *msg, size_t msg_len);\n\n/*\n * SM2 signature generation.\n */\nint sm2_sign(const unsigned char *dgst, int dgstlen,\n unsigned char *sig, unsigned int *siglen, EC_KEY *eckey);\n\n/*\n * SM2 signature verification.\n */\nint sm2_verify(const unsigned char *dgst, int dgstlen,\n const unsigned char *sig, int siglen, EC_KEY *eckey);\n\n/*\n * SM2 encryption\n */\nint sm2_ciphertext_size(const EC_KEY *key, const EVP_MD *digest, size_t msg_len,\n size_t *ct_size);\n\nint sm2_plaintext_size(const unsigned char *ct, size_t ct_size, size_t *pt_size);\n\nint sm2_encrypt(const EC_KEY *key,\n const EVP_MD *digest,\n const uint8_t *msg,\n size_t msg_len,\n uint8_t *ciphertext_buf, size_t *ciphertext_len);\n\nint sm2_decrypt(const EC_KEY *key,\n const EVP_MD *digest,\n const uint8_t *ciphertext,\n size_t ciphertext_len, uint8_t *ptext_buf, size_t *ptext_len);\n\n# endif /* OPENSSL_NO_SM2 */\n#endif\n" }, { "path": "cryptomini/include/crypto/sm2err.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_SM2ERR_H\n# define OSSL_CRYPTO_SM2ERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# include \n\n# ifndef OPENSSL_NO_SM2\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_SM2_strings(void);\n\n/*\n * SM2 function codes.\n */\n# define SM2_F_PKEY_SM2_COPY 115\n# define SM2_F_PKEY_SM2_CTRL 109\n# define SM2_F_PKEY_SM2_CTRL_STR 110\n# define SM2_F_PKEY_SM2_DIGEST_CUSTOM 114\n# define SM2_F_PKEY_SM2_INIT 111\n# define SM2_F_PKEY_SM2_SIGN 112\n# define SM2_F_SM2_COMPUTE_MSG_HASH 100\n# define SM2_F_SM2_COMPUTE_USERID_DIGEST 101\n# define SM2_F_SM2_COMPUTE_Z_DIGEST 113\n# define SM2_F_SM2_DECRYPT 102\n# define SM2_F_SM2_ENCRYPT 103\n# define SM2_F_SM2_PLAINTEXT_SIZE 104\n# define SM2_F_SM2_SIGN 105\n# define SM2_F_SM2_SIG_GEN 106\n# define SM2_F_SM2_SIG_VERIFY 107\n# define SM2_F_SM2_VERIFY 108\n\n/*\n * SM2 reason codes.\n */\n# define SM2_R_ASN1_ERROR 100\n# define SM2_R_BAD_SIGNATURE 101\n# define SM2_R_BUFFER_TOO_SMALL 107\n# define SM2_R_DIST_ID_TOO_LARGE 110\n# define SM2_R_ID_NOT_SET 112\n# define SM2_R_ID_TOO_LARGE 111\n# define SM2_R_INVALID_CURVE 108\n# define SM2_R_INVALID_DIGEST 102\n# define SM2_R_INVALID_DIGEST_TYPE 103\n# define SM2_R_INVALID_ENCODING 104\n# define SM2_R_INVALID_FIELD 105\n# define SM2_R_NO_PARAMETERS_SET 109\n# define SM2_R_USER_ID_TOO_LARGE 106\n\n# endif\n#endif\n" }, { "path": "cryptomini/include/crypto/sm3.h", "content": "/*\n * Copyright 2017 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright 2017 Ribose Inc. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_SM3_H\n# define OSSL_CRYPTO_SM3_H\n\n# include \n\n# ifdef OPENSSL_NO_SM3\n# error SM3 is disabled.\n# endif\n\n# define SM3_DIGEST_LENGTH 32\n# define SM3_WORD unsigned int\n\n# define SM3_CBLOCK 64\n# define SM3_LBLOCK (SM3_CBLOCK/4)\n\ntypedef struct SM3state_st {\n SM3_WORD A, B, C, D, E, F, G, H;\n SM3_WORD Nl, Nh;\n SM3_WORD data[SM3_LBLOCK];\n unsigned int num;\n} SM3_CTX;\n\nint sm3_init(SM3_CTX *c);\nint sm3_update(SM3_CTX *c, const void *data, size_t len);\nint sm3_final(unsigned char *md, SM3_CTX *c);\n\nvoid sm3_block_data_order(SM3_CTX *c, const void *p, size_t num);\n\n#endif\n" }, { "path": "cryptomini/include/crypto/sm4.h", "content": "/*\n * Copyright 2017 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright 2017 Ribose Inc. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_SM4_H\n# define OSSL_CRYPTO_SM4_H\n\n# include \n# include \n\n# ifdef OPENSSL_NO_SM4\n# error SM4 is disabled.\n# endif\n\n# define SM4_ENCRYPT 1\n# define SM4_DECRYPT 0\n\n# define SM4_BLOCK_SIZE 16\n# define SM4_KEY_SCHEDULE 32\n\ntypedef struct SM4_KEY_st {\n uint32_t rk[SM4_KEY_SCHEDULE];\n} SM4_KEY;\n\nint SM4_set_key(const uint8_t *key, SM4_KEY *ks);\n\nvoid SM4_encrypt(const uint8_t *in, uint8_t *out, const SM4_KEY *ks);\n\nvoid SM4_decrypt(const uint8_t *in, uint8_t *out, const SM4_KEY *ks);\n\n#endif\n" }, { "path": "cryptomini/include/crypto/store.h", "content": "/*\n * Copyright 2016-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_CRYPTO_STORE_H\n# define OSSL_CRYPTO_STORE_H\n\n# include \n# include \n# include \n\n/*\n * Two functions to read PEM data off an already opened BIO. To be used\n * instead of OSSLSTORE_open() and OSSLSTORE_close(). Everything is done\n * as usual with OSSLSTORE_load() and OSSLSTORE_eof().\n */\nOSSL_STORE_CTX *ossl_store_attach_pem_bio(BIO *bp, const UI_METHOD *ui_method,\n void *ui_data);\nint ossl_store_detach_pem_bio(OSSL_STORE_CTX *ctx);\n\nvoid ossl_store_cleanup_int(void);\n\n#endif\n" }, { "path": "cryptomini/include/crypto/x509.h", "content": "/*\n * Copyright 2015-2021 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \"internal/refcount.h\"\n#include \n#include \n\n/* Internal X509 structures and functions: not for application use */\n\n/* Note: unless otherwise stated a field pointer is mandatory and should\n * never be set to NULL: the ASN.1 code and accessors rely on mandatory\n * fields never being NULL.\n */\n\n/*\n * name entry structure, equivalent to AttributeTypeAndValue defined\n * in RFC5280 et al.\n */\nstruct X509_name_entry_st {\n ASN1_OBJECT *object; /* AttributeType */\n ASN1_STRING *value; /* AttributeValue */\n int set; /* index of RDNSequence for this entry */\n int size; /* temp variable */\n};\n\n/* Name from RFC 5280. */\nstruct X509_name_st {\n STACK_OF(X509_NAME_ENTRY) *entries; /* DN components */\n int modified; /* true if 'bytes' needs to be built */\n BUF_MEM *bytes; /* cached encoding: cannot be NULL */\n /* canonical encoding used for rapid Name comparison */\n unsigned char *canon_enc;\n int canon_enclen;\n} /* X509_NAME */ ;\n\n/* Signature info structure */\n\nstruct x509_sig_info_st {\n /* NID of message digest */\n int mdnid;\n /* NID of public key algorithm */\n int pknid;\n /* Security bits */\n int secbits;\n /* Various flags */\n uint32_t flags;\n};\n\n/* PKCS#10 certificate request */\n\nstruct X509_req_info_st {\n ASN1_ENCODING enc; /* cached encoding of signed part */\n ASN1_INTEGER *version; /* version, defaults to v1(0) so can be NULL */\n X509_NAME *subject; /* certificate request DN */\n X509_PUBKEY *pubkey; /* public key of request */\n /*\n * Zero or more attributes.\n * NB: although attributes is a mandatory field some broken\n * encodings omit it so this may be NULL in that case.\n */\n STACK_OF(X509_ATTRIBUTE) *attributes;\n};\n\nstruct X509_req_st {\n X509_REQ_INFO req_info; /* signed certificate request data */\n X509_ALGOR sig_alg; /* signature algorithm */\n ASN1_BIT_STRING *signature; /* signature */\n CRYPTO_REF_COUNT references;\n CRYPTO_RWLOCK *lock;\n};\n\nstruct X509_crl_info_st {\n ASN1_INTEGER *version; /* version: defaults to v1(0) so may be NULL */\n X509_ALGOR sig_alg; /* signature algorithm */\n X509_NAME *issuer; /* CRL issuer name */\n ASN1_TIME *lastUpdate; /* lastUpdate field */\n ASN1_TIME *nextUpdate; /* nextUpdate field: optional */\n STACK_OF(X509_REVOKED) *revoked; /* revoked entries: optional */\n STACK_OF(X509_EXTENSION) *extensions; /* extensions: optional */\n ASN1_ENCODING enc; /* encoding of signed portion of CRL */\n};\n\nstruct X509_crl_st {\n X509_CRL_INFO crl; /* signed CRL data */\n X509_ALGOR sig_alg; /* CRL signature algorithm */\n ASN1_BIT_STRING signature; /* CRL signature */\n CRYPTO_REF_COUNT references;\n int flags;\n /*\n * Cached copies of decoded extension values, since extensions\n * are optional any of these can be NULL.\n */\n AUTHORITY_KEYID *akid;\n ISSUING_DIST_POINT *idp;\n /* Convenient breakdown of IDP */\n int idp_flags;\n int idp_reasons;\n /* CRL and base CRL numbers for delta processing */\n ASN1_INTEGER *crl_number;\n ASN1_INTEGER *base_crl_number;\n STACK_OF(GENERAL_NAMES) *issuers;\n /* hash of CRL */\n unsigned char sha1_hash[SHA_DIGEST_LENGTH];\n /* alternative method to handle this CRL */\n const X509_CRL_METHOD *meth;\n void *meth_data;\n CRYPTO_RWLOCK *lock;\n};\n\nstruct x509_revoked_st {\n ASN1_INTEGER serialNumber; /* revoked entry serial number */\n ASN1_TIME *revocationDate; /* revocation date */\n STACK_OF(X509_EXTENSION) *extensions; /* CRL entry extensions: optional */\n /* decoded value of CRLissuer extension: set if indirect CRL */\n STACK_OF(GENERAL_NAME) *issuer;\n /* revocation reason: set to CRL_REASON_NONE if reason extension absent */\n int reason;\n /*\n * CRL entries are reordered for faster lookup of serial numbers. This\n * field contains the original load sequence for this entry.\n */\n int sequence;\n};\n\n/*\n * This stuff is certificate \"auxiliary info\": it contains details which are\n * useful in certificate stores and databases. When used this is tagged onto\n * the end of the certificate itself. OpenSSL specific structure not defined\n * in any RFC.\n */\n\nstruct x509_cert_aux_st {\n STACK_OF(ASN1_OBJECT) *trust; /* trusted uses */\n STACK_OF(ASN1_OBJECT) *reject; /* rejected uses */\n ASN1_UTF8STRING *alias; /* \"friendly name\" */\n ASN1_OCTET_STRING *keyid; /* key id of private key */\n STACK_OF(X509_ALGOR) *other; /* other unspecified info */\n};\n\nstruct x509_cinf_st {\n ASN1_INTEGER *version; /* [ 0 ] default of v1 */\n ASN1_INTEGER serialNumber;\n X509_ALGOR signature;\n X509_NAME *issuer;\n X509_VAL validity;\n X509_NAME *subject;\n X509_PUBKEY *key;\n ASN1_BIT_STRING *issuerUID; /* [ 1 ] optional in v2 */\n ASN1_BIT_STRING *subjectUID; /* [ 2 ] optional in v2 */\n STACK_OF(X509_EXTENSION) *extensions; /* [ 3 ] optional in v3 */\n ASN1_ENCODING enc;\n};\n\nstruct x509_st {\n X509_CINF cert_info;\n X509_ALGOR sig_alg;\n ASN1_BIT_STRING signature;\n X509_SIG_INFO siginf;\n CRYPTO_REF_COUNT references;\n CRYPTO_EX_DATA ex_data;\n /* These contain copies of various extension values */\n long ex_pathlen;\n long ex_pcpathlen;\n uint32_t ex_flags;\n uint32_t ex_kusage;\n uint32_t ex_xkusage;\n uint32_t ex_nscert;\n ASN1_OCTET_STRING *skid;\n AUTHORITY_KEYID *akid;\n X509_POLICY_CACHE *policy_cache;\n STACK_OF(DIST_POINT) *crldp;\n STACK_OF(GENERAL_NAME) *altname;\n NAME_CONSTRAINTS *nc;\n#ifndef OPENSSL_NO_RFC3779\n STACK_OF(IPAddressFamily) *rfc3779_addr;\n struct ASIdentifiers_st *rfc3779_asid;\n# endif\n unsigned char sha1_hash[SHA_DIGEST_LENGTH];\n X509_CERT_AUX *aux;\n CRYPTO_RWLOCK *lock;\n volatile int ex_cached;\n} /* X509 */ ;\n\n/*\n * This is a used when verifying cert chains. Since the gathering of the\n * cert chain can take some time (and have to be 'retried', this needs to be\n * kept and passed around.\n */\nstruct x509_store_ctx_st { /* X509_STORE_CTX */\n X509_STORE *ctx;\n /* The following are set by the caller */\n /* The cert to check */\n X509 *cert;\n /* chain of X509s - untrusted - passed in */\n STACK_OF(X509) *untrusted;\n /* set of CRLs passed in */\n STACK_OF(X509_CRL) *crls;\n X509_VERIFY_PARAM *param;\n /* Other info for use with get_issuer() */\n void *other_ctx;\n /* Callbacks for various operations */\n /* called to verify a certificate */\n int (*verify) (X509_STORE_CTX *ctx);\n /* error callback */\n int (*verify_cb) (int ok, X509_STORE_CTX *ctx);\n /* get issuers cert from ctx */\n int (*get_issuer) (X509 **issuer, X509_STORE_CTX *ctx, X509 *x);\n /* check issued */\n int (*check_issued) (X509_STORE_CTX *ctx, X509 *x, X509 *issuer);\n /* Check revocation status of chain */\n int (*check_revocation) (X509_STORE_CTX *ctx);\n /* retrieve CRL */\n int (*get_crl) (X509_STORE_CTX *ctx, X509_CRL **crl, X509 *x);\n /* Check CRL validity */\n int (*check_crl) (X509_STORE_CTX *ctx, X509_CRL *crl);\n /* Check certificate against CRL */\n int (*cert_crl) (X509_STORE_CTX *ctx, X509_CRL *crl, X509 *x);\n /* Check policy status of the chain */\n int (*check_policy) (X509_STORE_CTX *ctx);\n STACK_OF(X509) *(*lookup_certs) (X509_STORE_CTX *ctx, X509_NAME *nm);\n STACK_OF(X509_CRL) *(*lookup_crls) (X509_STORE_CTX *ctx, X509_NAME *nm);\n int (*cleanup) (X509_STORE_CTX *ctx);\n /* The following is built up */\n /* if 0, rebuild chain */\n int valid;\n /* number of untrusted certs */\n int num_untrusted;\n /* chain of X509s - built up and trusted */\n STACK_OF(X509) *chain;\n /* Valid policy tree */\n X509_POLICY_TREE *tree;\n /* Require explicit policy value */\n int explicit_policy;\n /* When something goes wrong, this is why */\n int error_depth;\n int error;\n X509 *current_cert;\n /* cert currently being tested as valid issuer */\n X509 *current_issuer;\n /* current CRL */\n X509_CRL *current_crl;\n /* score of current CRL */\n int current_crl_score;\n /* Reason mask */\n unsigned int current_reasons;\n /* For CRL path validation: parent context */\n X509_STORE_CTX *parent;\n CRYPTO_EX_DATA ex_data;\n SSL_DANE *dane;\n /* signed via bare TA public key, rather than CA certificate */\n int bare_ta_signed;\n};\n\n/* PKCS#8 private key info structure */\n\nstruct pkcs8_priv_key_info_st {\n ASN1_INTEGER *version;\n X509_ALGOR *pkeyalg;\n ASN1_OCTET_STRING *pkey;\n STACK_OF(X509_ATTRIBUTE) *attributes;\n};\n\nstruct X509_sig_st {\n X509_ALGOR *algor;\n ASN1_OCTET_STRING *digest;\n};\n\nstruct x509_object_st {\n /* one of the above types */\n X509_LOOKUP_TYPE type;\n union {\n char *ptr;\n X509 *x509;\n X509_CRL *crl;\n EVP_PKEY *pkey;\n } data;\n};\n\nint a2i_ipadd(unsigned char *ipout, const char *ipasc);\nint x509_set1_time(ASN1_TIME **ptm, const ASN1_TIME *tm);\n\nvoid x509_init_sig_info(X509 *x);\n\nint x509v3_add_len_value_uchar(const char *name, const unsigned char *value,\n size_t vallen, STACK_OF(CONF_VALUE) **extlist);\n" }, { "path": "cryptomini/include/intercept/intercept.h", "content": "\n#include \n\n// #define malloc sbi_malloc\n// #define free sbi_free\n// #define memset sbi_memset\n\n// void *sbi_malloc(size_t size);\n// void sbi_free(void *ptr);\n// void *sbi_memset(void *s, int c, size_t count);\n" }, { "path": "cryptomini/include/internal/__DECC_INCLUDE_EPILOGUE.H", "content": "/*\n * Copyright 2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * This file is only used by HP C on VMS, and is included automatically\n * after each header file from this directory\n */\n\n/* restore state. Must correspond to the save in __decc_include_prologue.h */\n#pragma names restore\n" }, { "path": "cryptomini/include/internal/__DECC_INCLUDE_PROLOGUE.H", "content": "/*\n * Copyright 2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * This file is only used by HP C on VMS, and is included automatically\n * after each header file from this directory\n */\n\n/* save state */\n#pragma names save\n/* have the compiler shorten symbols larger than 31 chars to 23 chars\n * followed by a 8 hex char CRC\n */\n#pragma names as_is,shortened\n" }, { "path": "cryptomini/include/internal/bio.h", "content": "/*\n * Copyright 2016-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\nstruct bio_method_st {\n int type;\n char *name;\n int (*bwrite) (BIO *, const char *, size_t, size_t *);\n int (*bwrite_old) (BIO *, const char *, int);\n int (*bread) (BIO *, char *, size_t, size_t *);\n int (*bread_old) (BIO *, char *, int);\n int (*bputs) (BIO *, const char *);\n int (*bgets) (BIO *, char *, int);\n long (*ctrl) (BIO *, int, long, void *);\n int (*create) (BIO *);\n int (*destroy) (BIO *);\n long (*callback_ctrl) (BIO *, int, BIO_info_cb *);\n};\n\nvoid bio_free_ex_data(BIO *bio);\nvoid bio_cleanup(void);\n\n\n/* Old style to new style BIO_METHOD conversion functions */\nint bwrite_conv(BIO *bio, const char *data, size_t datal, size_t *written);\nint bread_conv(BIO *bio, char *data, size_t datal, size_t *read);\n" }, { "path": "cryptomini/include/internal/comp.h", "content": "/*\n * Copyright 2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\nvoid comp_zlib_cleanup_int(void);\n" }, { "path": "cryptomini/include/internal/conf.h", "content": "/*\n * Copyright 2016-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_INTERNAL_CONF_H\n# define OSSL_INTERNAL_CONF_H\n\n#include \n\n#define DEFAULT_CONF_MFLAGS \\\n (CONF_MFLAGS_DEFAULT_SECTION | \\\n CONF_MFLAGS_IGNORE_MISSING_FILE | \\\n CONF_MFLAGS_IGNORE_RETURN_CODES)\n\nstruct ossl_init_settings_st {\n char *filename;\n char *appname;\n unsigned long flags;\n};\n\nint openssl_config_int(const OPENSSL_INIT_SETTINGS *);\nvoid openssl_no_config_int(void);\nvoid conf_modules_free_int(void);\n\n#endif\n" }, { "path": "cryptomini/include/internal/constant_time.h", "content": "/*\n * Copyright 2014-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_INTERNAL_CONSTANT_TIME_H\n# define OSSL_INTERNAL_CONSTANT_TIME_H\n\n# include \n# include \n# include /* For 'ossl_inline' */\n\n/*-\n * The boolean methods return a bitmask of all ones (0xff...f) for true\n * and 0 for false. This is useful for choosing a value based on the result\n * of a conditional in constant time. For example,\n * if (a < b) {\n * c = a;\n * } else {\n * c = b;\n * }\n * can be written as\n * unsigned int lt = constant_time_lt(a, b);\n * c = constant_time_select(lt, a, b);\n */\n\n/* Returns the given value with the MSB copied to all the other bits. */\nstatic ossl_inline unsigned int constant_time_msb(unsigned int a);\n/* Convenience method for uint32_t. */\nstatic ossl_inline uint32_t constant_time_msb_32(uint32_t a);\n/* Convenience method for uint64_t. */\nstatic ossl_inline uint64_t constant_time_msb_64(uint64_t a);\n\n/* Returns 0xff..f if a < b and 0 otherwise. */\nstatic ossl_inline unsigned int constant_time_lt(unsigned int a,\n unsigned int b);\n/* Convenience method for getting an 8-bit mask. */\nstatic ossl_inline unsigned char constant_time_lt_8(unsigned int a,\n unsigned int b);\n/* Convenience method for uint64_t. */\nstatic ossl_inline uint64_t constant_time_lt_64(uint64_t a, uint64_t b);\n\n/* Returns 0xff..f if a >= b and 0 otherwise. */\nstatic ossl_inline unsigned int constant_time_ge(unsigned int a,\n unsigned int b);\n/* Convenience method for getting an 8-bit mask. */\nstatic ossl_inline unsigned char constant_time_ge_8(unsigned int a,\n unsigned int b);\n\n/* Returns 0xff..f if a == 0 and 0 otherwise. */\nstatic ossl_inline unsigned int constant_time_is_zero(unsigned int a);\n/* Convenience method for getting an 8-bit mask. */\nstatic ossl_inline unsigned char constant_time_is_zero_8(unsigned int a);\n/* Convenience method for getting a 32-bit mask. */\nstatic ossl_inline uint32_t constant_time_is_zero_32(uint32_t a);\n\n/* Returns 0xff..f if a == b and 0 otherwise. */\nstatic ossl_inline unsigned int constant_time_eq(unsigned int a,\n unsigned int b);\n/* Convenience method for getting an 8-bit mask. */\nstatic ossl_inline unsigned char constant_time_eq_8(unsigned int a,\n unsigned int b);\n/* Signed integers. */\nstatic ossl_inline unsigned int constant_time_eq_int(int a, int b);\n/* Convenience method for getting an 8-bit mask. */\nstatic ossl_inline unsigned char constant_time_eq_int_8(int a, int b);\n\n/*-\n * Returns (mask & a) | (~mask & b).\n *\n * When |mask| is all 1s or all 0s (as returned by the methods above),\n * the select methods return either |a| (if |mask| is nonzero) or |b|\n * (if |mask| is zero).\n */\nstatic ossl_inline unsigned int constant_time_select(unsigned int mask,\n unsigned int a,\n unsigned int b);\n/* Convenience method for unsigned chars. */\nstatic ossl_inline unsigned char constant_time_select_8(unsigned char mask,\n unsigned char a,\n unsigned char b);\n\n/* Convenience method for uint32_t. */\nstatic ossl_inline uint32_t constant_time_select_32(uint32_t mask, uint32_t a,\n uint32_t b);\n\n/* Convenience method for uint64_t. */\nstatic ossl_inline uint64_t constant_time_select_64(uint64_t mask, uint64_t a,\n uint64_t b);\n/* Convenience method for signed integers. */\nstatic ossl_inline int constant_time_select_int(unsigned int mask, int a,\n int b);\n\n\nstatic ossl_inline unsigned int constant_time_msb(unsigned int a)\n{\n return 0 - (a >> (sizeof(a) * 8 - 1));\n}\n\n\nstatic ossl_inline uint32_t constant_time_msb_32(uint32_t a)\n{\n return 0 - (a >> 31);\n}\n\nstatic ossl_inline uint64_t constant_time_msb_64(uint64_t a)\n{\n return 0 - (a >> 63);\n}\n\nstatic ossl_inline size_t constant_time_msb_s(size_t a)\n{\n return 0 - (a >> (sizeof(a) * 8 - 1));\n}\n\nstatic ossl_inline unsigned int constant_time_lt(unsigned int a,\n unsigned int b)\n{\n return constant_time_msb(a ^ ((a ^ b) | ((a - b) ^ b)));\n}\n\nstatic ossl_inline size_t constant_time_lt_s(size_t a, size_t b)\n{\n return constant_time_msb_s(a ^ ((a ^ b) | ((a - b) ^ b)));\n}\n\nstatic ossl_inline unsigned char constant_time_lt_8(unsigned int a,\n unsigned int b)\n{\n return (unsigned char)constant_time_lt(a, b);\n}\n\nstatic ossl_inline uint64_t constant_time_lt_64(uint64_t a, uint64_t b)\n{\n return constant_time_msb_64(a ^ ((a ^ b) | ((a - b) ^ b)));\n}\n\nstatic ossl_inline unsigned int constant_time_ge(unsigned int a,\n unsigned int b)\n{\n return ~constant_time_lt(a, b);\n}\n\nstatic ossl_inline size_t constant_time_ge_s(size_t a, size_t b)\n{\n return ~constant_time_lt_s(a, b);\n}\n\nstatic ossl_inline unsigned char constant_time_ge_8(unsigned int a,\n unsigned int b)\n{\n return (unsigned char)constant_time_ge(a, b);\n}\n\nstatic ossl_inline unsigned char constant_time_ge_8_s(size_t a, size_t b)\n{\n return (unsigned char)constant_time_ge_s(a, b);\n}\n\nstatic ossl_inline unsigned int constant_time_is_zero(unsigned int a)\n{\n return constant_time_msb(~a & (a - 1));\n}\n\nstatic ossl_inline size_t constant_time_is_zero_s(size_t a)\n{\n return constant_time_msb_s(~a & (a - 1));\n}\n\nstatic ossl_inline unsigned char constant_time_is_zero_8(unsigned int a)\n{\n return (unsigned char)constant_time_is_zero(a);\n}\n\nstatic ossl_inline uint32_t constant_time_is_zero_32(uint32_t a)\n{\n return constant_time_msb_32(~a & (a - 1));\n}\n\nstatic ossl_inline unsigned int constant_time_eq(unsigned int a,\n unsigned int b)\n{\n return constant_time_is_zero(a ^ b);\n}\n\nstatic ossl_inline size_t constant_time_eq_s(size_t a, size_t b)\n{\n return constant_time_is_zero_s(a ^ b);\n}\n\nstatic ossl_inline unsigned char constant_time_eq_8(unsigned int a,\n unsigned int b)\n{\n return (unsigned char)constant_time_eq(a, b);\n}\n\nstatic ossl_inline unsigned char constant_time_eq_8_s(size_t a, size_t b)\n{\n return (unsigned char)constant_time_eq_s(a, b);\n}\n\nstatic ossl_inline unsigned int constant_time_eq_int(int a, int b)\n{\n return constant_time_eq((unsigned)(a), (unsigned)(b));\n}\n\nstatic ossl_inline unsigned char constant_time_eq_int_8(int a, int b)\n{\n return constant_time_eq_8((unsigned)(a), (unsigned)(b));\n}\n\n/*\n * Returns the value unmodified, but avoids optimizations.\n * The barriers prevent the compiler from narrowing down the\n * possible value range of the mask and ~mask in the select\n * statements, which avoids the recognition of the select\n * and turning it into a conditional load or branch.\n */\nstatic ossl_inline unsigned int value_barrier(unsigned int a)\n{\n#if !defined(OPENSSL_NO_ASM) && defined(__GNUC__)\n unsigned int r;\n __asm__(\"\" : \"=r\"(r) : \"0\"(a));\n#else\n volatile unsigned int r = a;\n#endif\n return r;\n}\n\n/* Convenience method for uint32_t. */\nstatic ossl_inline uint32_t value_barrier_32(uint32_t a)\n{\n#if !defined(OPENSSL_NO_ASM) && defined(__GNUC__)\n uint32_t r;\n __asm__(\"\" : \"=r\"(r) : \"0\"(a));\n#else\n volatile uint32_t r = a;\n#endif\n return r;\n}\n\n/* Convenience method for uint64_t. */\nstatic ossl_inline uint64_t value_barrier_64(uint64_t a)\n{\n#if !defined(OPENSSL_NO_ASM) && defined(__GNUC__)\n uint64_t r;\n __asm__(\"\" : \"=r\"(r) : \"0\"(a));\n#else\n volatile uint64_t r = a;\n#endif\n return r;\n}\n\n/* Convenience method for size_t. */\nstatic ossl_inline size_t value_barrier_s(size_t a)\n{\n#if !defined(OPENSSL_NO_ASM) && defined(__GNUC__)\n size_t r;\n __asm__(\"\" : \"=r\"(r) : \"0\"(a));\n#else\n volatile size_t r = a;\n#endif\n return r;\n}\n\nstatic ossl_inline unsigned int constant_time_select(unsigned int mask,\n unsigned int a,\n unsigned int b)\n{\n return (value_barrier(mask) & a) | (value_barrier(~mask) & b);\n}\n\nstatic ossl_inline size_t constant_time_select_s(size_t mask,\n size_t a,\n size_t b)\n{\n return (value_barrier_s(mask) & a) | (value_barrier_s(~mask) & b);\n}\n\nstatic ossl_inline unsigned char constant_time_select_8(unsigned char mask,\n unsigned char a,\n unsigned char b)\n{\n return (unsigned char)constant_time_select(mask, a, b);\n}\n\nstatic ossl_inline int constant_time_select_int(unsigned int mask, int a,\n int b)\n{\n return (int)constant_time_select(mask, (unsigned)(a), (unsigned)(b));\n}\n\nstatic ossl_inline int constant_time_select_int_s(size_t mask, int a, int b)\n{\n return (int)constant_time_select((unsigned)mask, (unsigned)(a),\n (unsigned)(b));\n}\n\nstatic ossl_inline uint32_t constant_time_select_32(uint32_t mask, uint32_t a,\n uint32_t b)\n{\n return (value_barrier_32(mask) & a) | (value_barrier_32(~mask) & b);\n}\n\nstatic ossl_inline uint64_t constant_time_select_64(uint64_t mask, uint64_t a,\n uint64_t b)\n{\n return (value_barrier_64(mask) & a) | (value_barrier_64(~mask) & b);\n}\n\n/*\n * mask must be 0xFFFFFFFF or 0x00000000.\n *\n * if (mask) {\n * uint32_t tmp = *a;\n *\n * *a = *b;\n * *b = tmp;\n * }\n */\nstatic ossl_inline void constant_time_cond_swap_32(uint32_t mask, uint32_t *a,\n uint32_t *b)\n{\n uint32_t xor = *a ^ *b;\n\n xor &= mask;\n *a ^= xor;\n *b ^= xor;\n}\n\n/*\n * mask must be 0xFFFFFFFF or 0x00000000.\n *\n * if (mask) {\n * uint64_t tmp = *a;\n *\n * *a = *b;\n * *b = tmp;\n * }\n */\nstatic ossl_inline void constant_time_cond_swap_64(uint64_t mask, uint64_t *a,\n uint64_t *b)\n{\n uint64_t xor = *a ^ *b;\n\n xor &= mask;\n *a ^= xor;\n *b ^= xor;\n}\n\n/*\n * table is a two dimensional array of bytes. Each row has rowsize elements.\n * Copies row number idx into out. rowsize and numrows are not considered\n * private.\n */\nstatic ossl_inline void constant_time_lookup(void *out,\n const void *table,\n size_t rowsize,\n size_t numrows,\n size_t idx)\n{\n size_t i, j;\n const unsigned char *tablec = (const unsigned char *)table;\n unsigned char *outc = (unsigned char *)out;\n unsigned char mask;\n\n memset(out, 0, rowsize);\n\n /* Note idx may underflow - but that is well defined */\n for (i = 0; i < numrows; i++, idx--) {\n mask = (unsigned char)constant_time_is_zero_s(idx);\n for (j = 0; j < rowsize; j++)\n *(outc + j) |= constant_time_select_8(mask, *(tablec++), 0);\n }\n}\n\n/*\n * Expected usage pattern is to unconditionally set error and then\n * wipe it if there was no actual error. |clear| is 1 or 0.\n */\nvoid err_clear_last_constant_time(int clear);\n\n#endif /* OSSL_INTERNAL_CONSTANT_TIME_H */\n" }, { "path": "cryptomini/include/internal/cryptlib.h", "content": "/*\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_INTERNAL_CRYPTLIB_H\n# define OSSL_INTERNAL_CRYPTLIB_H\n\n# include \n# include \n\n# ifdef OPENSSL_USE_APPLINK\n# undef BIO_FLAGS_UPLINK\n# define BIO_FLAGS_UPLINK 0x8000\n# include \"ms/uplink.h\"\n# endif\n\n# include \n# include \n# include \n# include \n# include \"internal/nelem.h\"\n\n#ifdef NDEBUG\n# define ossl_assert(x) ((x) != 0)\n#else\n__owur static ossl_inline int ossl_assert_int(int expr, const char *exprstr,\n const char *file, int line)\n{\n if (!expr)\n OPENSSL_die(exprstr, file, line);\n\n return expr;\n}\n\n# define ossl_assert(x) ossl_assert_int((x) != 0, \"Assertion failed: \"#x, \\\n __FILE__, __LINE__)\n\n#endif\n\ntypedef struct ex_callback_st EX_CALLBACK;\n\nDEFINE_STACK_OF(EX_CALLBACK)\n\ntypedef struct app_mem_info_st APP_INFO;\n\ntypedef struct mem_st MEM;\nDEFINE_LHASH_OF(MEM);\n\n# define OPENSSL_CONF \"openssl.cnf\"\n\n# ifndef OPENSSL_SYS_VMS\n# define X509_CERT_AREA OPENSSLDIR\n# define X509_CERT_DIR OPENSSLDIR \"/certs\"\n# define X509_CERT_FILE OPENSSLDIR \"/cert.pem\"\n# define X509_PRIVATE_DIR OPENSSLDIR \"/private\"\n# define CTLOG_FILE OPENSSLDIR \"/ct_log_list.cnf\"\n# else\n# define X509_CERT_AREA \"OSSL$DATAROOT:[000000]\"\n# define X509_CERT_DIR \"OSSL$DATAROOT:[CERTS]\"\n# define X509_CERT_FILE \"OSSL$DATAROOT:[000000]cert.pem\"\n# define X509_PRIVATE_DIR \"OSSL$DATAROOT:[PRIVATE]\"\n# define CTLOG_FILE \"OSSL$DATAROOT:[000000]ct_log_list.cnf\"\n# endif\n\n# define X509_CERT_DIR_EVP \"SSL_CERT_DIR\"\n# define X509_CERT_FILE_EVP \"SSL_CERT_FILE\"\n# define CTLOG_FILE_EVP \"CTLOG_FILE\"\n\n/* size of string representations */\n# define DECIMAL_SIZE(type) ((sizeof(type)*8+2)/3+1)\n# define HEX_SIZE(type) (sizeof(type)*2)\n\nvoid OPENSSL_cpuid_setup(void);\nextern unsigned int OPENSSL_ia32cap_P[];\nvoid OPENSSL_showfatal(const char *fmta, ...);\nvoid crypto_cleanup_all_ex_data_int(void);\nint openssl_init_fork_handlers(void);\nint openssl_get_fork_id(void);\n\nchar *ossl_safe_getenv(const char *name);\n\nextern CRYPTO_RWLOCK *memdbg_lock;\nint openssl_strerror_r(int errnum, char *buf, size_t buflen);\n# if !defined(OPENSSL_NO_STDIO)\nFILE *openssl_fopen(const char *filename, const char *mode);\n# else\nvoid *openssl_fopen(const char *filename, const char *mode);\n# endif\n\nuint32_t OPENSSL_rdtsc(void);\nsize_t OPENSSL_instrument_bus(unsigned int *, size_t);\nsize_t OPENSSL_instrument_bus2(unsigned int *, size_t, size_t);\n\n#endif\n" }, { "path": "cryptomini/include/internal/dane.h", "content": "/*\n * Copyright 2015-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_INTERNAL_DANE_H\n#define OSSL_INTERNAL_DANE_H\n\n#include \n\n/*-\n * Certificate usages:\n * https://tools.ietf.org/html/rfc6698#section-2.1.1\n */\n#define DANETLS_USAGE_PKIX_TA 0\n#define DANETLS_USAGE_PKIX_EE 1\n#define DANETLS_USAGE_DANE_TA 2\n#define DANETLS_USAGE_DANE_EE 3\n#define DANETLS_USAGE_LAST DANETLS_USAGE_DANE_EE\n\n/*-\n * Selectors:\n * https://tools.ietf.org/html/rfc6698#section-2.1.2\n */\n#define DANETLS_SELECTOR_CERT 0\n#define DANETLS_SELECTOR_SPKI 1\n#define DANETLS_SELECTOR_LAST DANETLS_SELECTOR_SPKI\n\n/*-\n * Matching types:\n * https://tools.ietf.org/html/rfc6698#section-2.1.3\n */\n#define DANETLS_MATCHING_FULL 0\n#define DANETLS_MATCHING_2256 1\n#define DANETLS_MATCHING_2512 2\n#define DANETLS_MATCHING_LAST DANETLS_MATCHING_2512\n\ntypedef struct danetls_record_st {\n uint8_t usage;\n uint8_t selector;\n uint8_t mtype;\n unsigned char *data;\n size_t dlen;\n EVP_PKEY *spki;\n} danetls_record;\n\nDEFINE_STACK_OF(danetls_record)\n\n/*\n * Shared DANE context\n */\nstruct dane_ctx_st {\n const EVP_MD **mdevp; /* mtype -> digest */\n uint8_t *mdord; /* mtype -> preference */\n uint8_t mdmax; /* highest supported mtype */\n unsigned long flags; /* feature bitmask */\n};\n\n/*\n * Per connection DANE state\n */\nstruct ssl_dane_st {\n struct dane_ctx_st *dctx;\n STACK_OF(danetls_record) *trecs;\n STACK_OF(X509) *certs; /* DANE-TA(2) Cert(0) Full(0) certs */\n danetls_record *mtlsa; /* Matching TLSA record */\n X509 *mcert; /* DANE matched cert */\n uint32_t umask; /* Usages present */\n int mdpth; /* Depth of matched cert */\n int pdpth; /* Depth of PKIX trust */\n unsigned long flags; /* feature bitmask */\n};\n\n#define DANETLS_ENABLED(dane) \\\n ((dane) != NULL && sk_danetls_record_num((dane)->trecs) > 0)\n\n#define DANETLS_USAGE_BIT(u) (((uint32_t)1) << u)\n\n#define DANETLS_PKIX_TA_MASK (DANETLS_USAGE_BIT(DANETLS_USAGE_PKIX_TA))\n#define DANETLS_PKIX_EE_MASK (DANETLS_USAGE_BIT(DANETLS_USAGE_PKIX_EE))\n#define DANETLS_DANE_TA_MASK (DANETLS_USAGE_BIT(DANETLS_USAGE_DANE_TA))\n#define DANETLS_DANE_EE_MASK (DANETLS_USAGE_BIT(DANETLS_USAGE_DANE_EE))\n\n#define DANETLS_PKIX_MASK (DANETLS_PKIX_TA_MASK | DANETLS_PKIX_EE_MASK)\n#define DANETLS_DANE_MASK (DANETLS_DANE_TA_MASK | DANETLS_DANE_EE_MASK)\n#define DANETLS_TA_MASK (DANETLS_PKIX_TA_MASK | DANETLS_DANE_TA_MASK)\n#define DANETLS_EE_MASK (DANETLS_PKIX_EE_MASK | DANETLS_DANE_EE_MASK)\n\n#define DANETLS_HAS_PKIX(dane) ((dane) && ((dane)->umask & DANETLS_PKIX_MASK))\n#define DANETLS_HAS_DANE(dane) ((dane) && ((dane)->umask & DANETLS_DANE_MASK))\n#define DANETLS_HAS_TA(dane) ((dane) && ((dane)->umask & DANETLS_TA_MASK))\n#define DANETLS_HAS_EE(dane) ((dane) && ((dane)->umask & DANETLS_EE_MASK))\n\n#define DANETLS_HAS_PKIX_TA(dane) ((dane)&&((dane)->umask & DANETLS_PKIX_TA_MASK))\n#define DANETLS_HAS_PKIX_EE(dane) ((dane)&&((dane)->umask & DANETLS_PKIX_EE_MASK))\n#define DANETLS_HAS_DANE_TA(dane) ((dane)&&((dane)->umask & DANETLS_DANE_TA_MASK))\n#define DANETLS_HAS_DANE_EE(dane) ((dane)&&((dane)->umask & DANETLS_DANE_EE_MASK))\n\n#endif /* OSSL_INTERNAL_DANE_H */\n" }, { "path": "cryptomini/include/internal/dso.h", "content": "/*\n * Copyright 2000-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_INTERNAL_DSO_H\n# define OSSL_INTERNAL_DSO_H\n\n# include \n# include \"internal/dsoerr.h\"\n\n/* These values are used as commands to DSO_ctrl() */\n# define DSO_CTRL_GET_FLAGS 1\n# define DSO_CTRL_SET_FLAGS 2\n# define DSO_CTRL_OR_FLAGS 3\n\n/*\n * By default, DSO_load() will translate the provided filename into a form\n * typical for the platform using the dso_name_converter function of the\n * method. Eg. win32 will transform \"blah\" into \"blah.dll\", and dlfcn will\n * transform it into \"libblah.so\". This callback could even utilise the\n * DSO_METHOD's converter too if it only wants to override behaviour for\n * one or two possible DSO methods. However, the following flag can be\n * set in a DSO to prevent *any* native name-translation at all - eg. if\n * the caller has prompted the user for a path to a driver library so the\n * filename should be interpreted as-is.\n */\n# define DSO_FLAG_NO_NAME_TRANSLATION 0x01\n/*\n * An extra flag to give if only the extension should be added as\n * translation. This is obviously only of importance on Unix and other\n * operating systems where the translation also may prefix the name with\n * something, like 'lib', and ignored everywhere else. This flag is also\n * ignored if DSO_FLAG_NO_NAME_TRANSLATION is used at the same time.\n */\n# define DSO_FLAG_NAME_TRANSLATION_EXT_ONLY 0x02\n\n/*\n * Don't unload the DSO when we call DSO_free()\n */\n# define DSO_FLAG_NO_UNLOAD_ON_FREE 0x04\n\n/*\n * This flag loads the library with public symbols. Meaning: The exported\n * symbols of this library are public to all libraries loaded after this\n * library. At the moment only implemented in unix.\n */\n# define DSO_FLAG_GLOBAL_SYMBOLS 0x20\n\ntypedef void (*DSO_FUNC_TYPE) (void);\n\ntypedef struct dso_st DSO;\ntypedef struct dso_meth_st DSO_METHOD;\n\n/*\n * The function prototype used for method functions (or caller-provided\n * callbacks) that transform filenames. They are passed a DSO structure\n * pointer (or NULL if they are to be used independently of a DSO object) and\n * a filename to transform. They should either return NULL (if there is an\n * error condition) or a newly allocated string containing the transformed\n * form that the caller will need to free with OPENSSL_free() when done.\n */\ntypedef char *(*DSO_NAME_CONVERTER_FUNC)(DSO *, const char *);\n/*\n * The function prototype used for method functions (or caller-provided\n * callbacks) that merge two file specifications. They are passed a DSO\n * structure pointer (or NULL if they are to be used independently of a DSO\n * object) and two file specifications to merge. They should either return\n * NULL (if there is an error condition) or a newly allocated string\n * containing the result of merging that the caller will need to free with\n * OPENSSL_free() when done. Here, merging means that bits and pieces are\n * taken from each of the file specifications and added together in whatever\n * fashion that is sensible for the DSO method in question. The only rule\n * that really applies is that if the two specification contain pieces of the\n * same type, the copy from the first string takes priority. One could see\n * it as the first specification is the one given by the user and the second\n * being a bunch of defaults to add on if they're missing in the first.\n */\ntypedef char *(*DSO_MERGER_FUNC)(DSO *, const char *, const char *);\n\nDSO *DSO_new(void);\nint DSO_free(DSO *dso);\nint DSO_flags(DSO *dso);\nint DSO_up_ref(DSO *dso);\nlong DSO_ctrl(DSO *dso, int cmd, long larg, void *parg);\n\n/*\n * These functions can be used to get/set the platform-independent filename\n * used for a DSO. NB: set will fail if the DSO is already loaded.\n */\nconst char *DSO_get_filename(DSO *dso);\nint DSO_set_filename(DSO *dso, const char *filename);\n/*\n * This function will invoke the DSO's name_converter callback to translate a\n * filename, or if the callback isn't set it will instead use the DSO_METHOD's\n * converter. If \"filename\" is NULL, the \"filename\" in the DSO itself will be\n * used. If the DSO_FLAG_NO_NAME_TRANSLATION flag is set, then the filename is\n * simply duplicated. NB: This function is usually called from within a\n * DSO_METHOD during the processing of a DSO_load() call, and is exposed so\n * that caller-created DSO_METHODs can do the same thing. A non-NULL return\n * value will need to be OPENSSL_free()'d.\n */\nchar *DSO_convert_filename(DSO *dso, const char *filename);\n/*\n * This function will invoke the DSO's merger callback to merge two file\n * specifications, or if the callback isn't set it will instead use the\n * DSO_METHOD's merger. A non-NULL return value will need to be\n * OPENSSL_free()'d.\n */\nchar *DSO_merge(DSO *dso, const char *filespec1, const char *filespec2);\n\n/*\n * The all-singing all-dancing load function, you normally pass NULL for the\n * first and third parameters. Use DSO_up_ref and DSO_free for subsequent\n * reference count handling. Any flags passed in will be set in the\n * constructed DSO after its init() function but before the load operation.\n * If 'dso' is non-NULL, 'flags' is ignored.\n */\nDSO *DSO_load(DSO *dso, const char *filename, DSO_METHOD *meth, int flags);\n\n/* This function binds to a function inside a shared library. */\nDSO_FUNC_TYPE DSO_bind_func(DSO *dso, const char *symname);\n\n/*\n * This method is the default, but will beg, borrow, or steal whatever method\n * should be the default on any particular platform (including\n * DSO_METH_null() if necessary).\n */\nDSO_METHOD *DSO_METHOD_openssl(void);\n\n/*\n * This function writes null-terminated pathname of DSO module containing\n * 'addr' into 'sz' large caller-provided 'path' and returns the number of\n * characters [including trailing zero] written to it. If 'sz' is 0 or\n * negative, 'path' is ignored and required amount of characters [including\n * trailing zero] to accommodate pathname is returned. If 'addr' is NULL, then\n * pathname of cryptolib itself is returned. Negative or zero return value\n * denotes error.\n */\nint DSO_pathbyaddr(void *addr, char *path, int sz);\n\n/*\n * Like DSO_pathbyaddr() but instead returns a handle to the DSO for the symbol\n * or NULL on error.\n */\nDSO *DSO_dsobyaddr(void *addr, int flags);\n\n/*\n * This function should be used with caution! It looks up symbols in *all*\n * loaded modules and if module gets unloaded by somebody else attempt to\n * dereference the pointer is doomed to have fatal consequences. Primary\n * usage for this function is to probe *core* system functionality, e.g.\n * check if getnameinfo(3) is available at run-time without bothering about\n * OS-specific details such as libc.so.versioning or where does it actually\n * reside: in libc itself or libsocket.\n */\nvoid *DSO_global_lookup(const char *name);\n\nint ERR_load_DSO_strings(void);\n\n#endif\n" }, { "path": "cryptomini/include/internal/dsoerr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_INTERNAL_DSOERR_H\n# define OSSL_INTERNAL_DSOERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_DSO_strings(void);\n\n/*\n * DSO function codes.\n */\n# define DSO_F_DLFCN_BIND_FUNC 100\n# define DSO_F_DLFCN_LOAD 102\n# define DSO_F_DLFCN_MERGER 130\n# define DSO_F_DLFCN_NAME_CONVERTER 123\n# define DSO_F_DLFCN_UNLOAD 103\n# define DSO_F_DL_BIND_FUNC 104\n# define DSO_F_DL_LOAD 106\n# define DSO_F_DL_MERGER 131\n# define DSO_F_DL_NAME_CONVERTER 124\n# define DSO_F_DL_UNLOAD 107\n# define DSO_F_DSO_BIND_FUNC 108\n# define DSO_F_DSO_CONVERT_FILENAME 126\n# define DSO_F_DSO_CTRL 110\n# define DSO_F_DSO_FREE 111\n# define DSO_F_DSO_GET_FILENAME 127\n# define DSO_F_DSO_GLOBAL_LOOKUP 139\n# define DSO_F_DSO_LOAD 112\n# define DSO_F_DSO_MERGE 132\n# define DSO_F_DSO_NEW_METHOD 113\n# define DSO_F_DSO_PATHBYADDR 105\n# define DSO_F_DSO_SET_FILENAME 129\n# define DSO_F_DSO_UP_REF 114\n# define DSO_F_VMS_BIND_SYM 115\n# define DSO_F_VMS_LOAD 116\n# define DSO_F_VMS_MERGER 133\n# define DSO_F_VMS_UNLOAD 117\n# define DSO_F_WIN32_BIND_FUNC 101\n# define DSO_F_WIN32_GLOBALLOOKUP 142\n# define DSO_F_WIN32_JOINER 135\n# define DSO_F_WIN32_LOAD 120\n# define DSO_F_WIN32_MERGER 134\n# define DSO_F_WIN32_NAME_CONVERTER 125\n# define DSO_F_WIN32_PATHBYADDR 109\n# define DSO_F_WIN32_SPLITTER 136\n# define DSO_F_WIN32_UNLOAD 121\n\n/*\n * DSO reason codes.\n */\n# define DSO_R_CTRL_FAILED 100\n# define DSO_R_DSO_ALREADY_LOADED 110\n# define DSO_R_EMPTY_FILE_STRUCTURE 113\n# define DSO_R_FAILURE 114\n# define DSO_R_FILENAME_TOO_BIG 101\n# define DSO_R_FINISH_FAILED 102\n# define DSO_R_INCORRECT_FILE_SYNTAX 115\n# define DSO_R_LOAD_FAILED 103\n# define DSO_R_NAME_TRANSLATION_FAILED 109\n# define DSO_R_NO_FILENAME 111\n# define DSO_R_NULL_HANDLE 104\n# define DSO_R_SET_FILENAME_FAILED 112\n# define DSO_R_STACK_ERROR 105\n# define DSO_R_SYM_FAILURE 106\n# define DSO_R_UNLOAD_FAILED 107\n# define DSO_R_UNSUPPORTED 108\n\n#endif\n" }, { "path": "cryptomini/include/internal/err.h", "content": "/*\n * Copyright 2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_INTERNAL_ERR_H\n# define OSSL_INTERNAL_ERR_H\n\nvoid err_free_strings_int(void);\n\n#endif\n" }, { "path": "cryptomini/include/internal/nelem.h", "content": "/*\n * Copyright 2017 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_INTERNAL_NELEM_H\n# define OSSL_INTERNAL_NELEM_H\n\n# define OSSL_NELEM(x) (sizeof(x)/sizeof((x)[0]))\n#endif\n" }, { "path": "cryptomini/include/internal/numbers.h", "content": "/*\n * Copyright 2015-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_INTERNAL_NUMBERS_H\n# define OSSL_INTERNAL_NUMBERS_H\n\n# include \n\n# if (-1 & 3) == 0x03\t\t/* Two's complement */\n\n# define __MAXUINT__(T) ((T) -1)\n# define __MAXINT__(T) ((T) ((((T) 1) << ((sizeof(T) * CHAR_BIT) - 1)) ^ __MAXUINT__(T)))\n# define __MININT__(T) (-__MAXINT__(T) - 1)\n\n# elif (-1 & 3) == 0x02\t\t/* One's complement */\n\n# define __MAXUINT__(T) (((T) -1) + 1)\n# define __MAXINT__(T) ((T) ((((T) 1) << ((sizeof(T) * CHAR_BIT) - 1)) ^ __MAXUINT__(T)))\n# define __MININT__(T) (-__MAXINT__(T))\n\n# elif (-1 & 3) == 0x01\t\t/* Sign/magnitude */\n\n# define __MAXINT__(T) ((T) (((((T) 1) << ((sizeof(T) * CHAR_BIT) - 2)) - 1) | (((T) 1) << ((sizeof(T) * CHAR_BIT) - 2))))\n# define __MAXUINT__(T) ((T) (__MAXINT__(T) | (((T) 1) << ((sizeof(T) * CHAR_BIT) - 1))))\n# define __MININT__(T) (-__MAXINT__(T))\n\n# else\n\n# error \"do not know the integer encoding on this architecture\"\n\n# endif\n\n# ifndef INT8_MAX\n# define INT8_MIN __MININT__(int8_t)\n# define INT8_MAX __MAXINT__(int8_t)\n# define UINT8_MAX __MAXUINT__(uint8_t)\n# endif\n\n# ifndef INT16_MAX\n# define INT16_MIN __MININT__(int16_t)\n# define INT16_MAX __MAXINT__(int16_t)\n# define UINT16_MAX __MAXUINT__(uint16_t)\n# endif\n\n# ifndef INT32_MAX\n# define INT32_MIN __MININT__(int32_t)\n# define INT32_MAX __MAXINT__(int32_t)\n# define UINT32_MAX __MAXUINT__(uint32_t)\n# endif\n\n# ifndef INT64_MAX\n# define INT64_MIN __MININT__(int64_t)\n# define INT64_MAX __MAXINT__(int64_t)\n# define UINT64_MAX __MAXUINT__(uint64_t)\n# endif\n\n# ifndef SIZE_MAX\n# define SIZE_MAX __MAXUINT__(size_t)\n# endif\n\n#endif\n\n" }, { "path": "cryptomini/include/internal/o_dir.h", "content": "/*\n * Copyright 2004-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * This file is dual-licensed and is also available under the following\n * terms:\n *\n * Copyright (c) 2004, Richard Levitte \n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\n * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n */\n\n#ifndef OSSL_INTERNAL_O_DIR_H\n# define OSSL_INTERNAL_O_DIR_H\n\ntypedef struct OPENSSL_dir_context_st OPENSSL_DIR_CTX;\n\n/*\n * returns NULL on error or end-of-directory. If it is end-of-directory,\n * errno will be zero\n */\nconst char *OPENSSL_DIR_read(OPENSSL_DIR_CTX **ctx, const char *directory);\n/* returns 1 on success, 0 on error */\nint OPENSSL_DIR_end(OPENSSL_DIR_CTX **ctx);\n\n#endif /* LPDIR_H */\n" }, { "path": "cryptomini/include/internal/o_str.h", "content": "/*\n * Copyright 2003-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_INTERNAL_O_STR_H\n# define OSSL_INTERNAL_O_STR_H\n\n# include /* to get size_t */\n\nint OPENSSL_memcmp(const void *p1, const void *p2, size_t n);\n\n#endif\n" }, { "path": "cryptomini/include/internal/refcount.h", "content": "/*\n * Copyright 2016-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n#ifndef OSSL_INTERNAL_REFCOUNT_H\n# define OSSL_INTERNAL_REFCOUNT_H\n\n/* Used to checking reference counts, most while doing perl5 stuff :-) */\n# if defined(OPENSSL_NO_STDIO)\n# if defined(REF_PRINT)\n# error \"REF_PRINT requires stdio\"\n# endif\n# endif\n\n# if defined(__STDC_VERSION__) && __STDC_VERSION__ >= 201112L \\\n && !defined(__STDC_NO_ATOMICS__)\n# include \n# define HAVE_C11_ATOMICS\n# endif\n\n# if defined(HAVE_C11_ATOMICS) && defined(ATOMIC_INT_LOCK_FREE) \\\n && ATOMIC_INT_LOCK_FREE > 0\n\n# define HAVE_ATOMICS 1\n\ntypedef _Atomic int CRYPTO_REF_COUNT;\n\nstatic inline int CRYPTO_UP_REF(_Atomic int *val, int *ret, void *lock)\n{\n *ret = atomic_fetch_add_explicit(val, 1, memory_order_relaxed) + 1;\n return 1;\n}\n\n/*\n * Changes to shared structure other than reference counter have to be\n * serialized. And any kind of serialization implies a release fence. This\n * means that by the time reference counter is decremented all other\n * changes are visible on all processors. Hence decrement itself can be\n * relaxed. In case it hits zero, object will be destructed. Since it's\n * last use of the object, destructor programmer might reason that access\n * to mutable members doesn't have to be serialized anymore, which would\n * otherwise imply an acquire fence. Hence conditional acquire fence...\n */\nstatic inline int CRYPTO_DOWN_REF(_Atomic int *val, int *ret, void *lock)\n{\n *ret = atomic_fetch_sub_explicit(val, 1, memory_order_relaxed) - 1;\n if (*ret == 0)\n atomic_thread_fence(memory_order_acquire);\n return 1;\n}\n\n# elif defined(__GNUC__) && defined(__ATOMIC_RELAXED) && __GCC_ATOMIC_INT_LOCK_FREE > 0\n\n# define HAVE_ATOMICS 1\n\ntypedef int CRYPTO_REF_COUNT;\n\nstatic __inline__ int CRYPTO_UP_REF(int *val, int *ret, void *lock)\n{\n *ret = __atomic_fetch_add(val, 1, __ATOMIC_RELAXED) + 1;\n return 1;\n}\n\nstatic __inline__ int CRYPTO_DOWN_REF(int *val, int *ret, void *lock)\n{\n *ret = __atomic_fetch_sub(val, 1, __ATOMIC_RELAXED) - 1;\n if (*ret == 0)\n __atomic_thread_fence(__ATOMIC_ACQUIRE);\n return 1;\n}\n\n# elif defined(_MSC_VER) && _MSC_VER>=1200\n\n# define HAVE_ATOMICS 1\n\ntypedef volatile int CRYPTO_REF_COUNT;\n\n# if (defined(_M_ARM) && _M_ARM>=7 && !defined(_WIN32_WCE)) || defined(_M_ARM64)\n# include \n# if defined(_M_ARM64) && !defined(_ARM_BARRIER_ISH)\n# define _ARM_BARRIER_ISH _ARM64_BARRIER_ISH\n# endif\n\nstatic __inline int CRYPTO_UP_REF(volatile int *val, int *ret, void *lock)\n{\n *ret = _InterlockedExchangeAdd_nf(val, 1) + 1;\n return 1;\n}\n\nstatic __inline int CRYPTO_DOWN_REF(volatile int *val, int *ret, void *lock)\n{\n *ret = _InterlockedExchangeAdd_nf(val, -1) - 1;\n if (*ret == 0)\n __dmb(_ARM_BARRIER_ISH);\n return 1;\n}\n# else\n# if !defined(_WIN32_WCE)\n# pragma intrinsic(_InterlockedExchangeAdd)\n# else\n# if _WIN32_WCE >= 0x600\n extern long __cdecl _InterlockedExchangeAdd(long volatile*, long);\n# else\n /* under Windows CE we still have old-style Interlocked* functions */\n extern long __cdecl InterlockedExchangeAdd(long volatile*, long);\n# define _InterlockedExchangeAdd InterlockedExchangeAdd\n# endif\n# endif\n\nstatic __inline int CRYPTO_UP_REF(volatile int *val, int *ret, void *lock)\n{\n *ret = _InterlockedExchangeAdd(val, 1) + 1;\n return 1;\n}\n\nstatic __inline int CRYPTO_DOWN_REF(volatile int *val, int *ret, void *lock)\n{\n *ret = _InterlockedExchangeAdd(val, -1) - 1;\n return 1;\n}\n# endif\n\n# else\n\ntypedef int CRYPTO_REF_COUNT;\n\n# define CRYPTO_UP_REF(val, ret, lock) CRYPTO_atomic_add(val, 1, ret, lock)\n# define CRYPTO_DOWN_REF(val, ret, lock) CRYPTO_atomic_add(val, -1, ret, lock)\n\n# endif\n\n# if !defined(NDEBUG) && !defined(OPENSSL_NO_STDIO)\n# define REF_ASSERT_ISNT(test) \\\n (void)((test) ? (OPENSSL_die(\"refcount error\", __FILE__, __LINE__), 1) : 0)\n# else\n# define REF_ASSERT_ISNT(i)\n# endif\n\n# ifdef REF_PRINT\n# define REF_PRINT_COUNT(a, b) \\\n fprintf(stderr, \"%p:%4d:%s\\n\", b, b->references, a)\n# else\n# define REF_PRINT_COUNT(a, b)\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/internal/sockets.h", "content": "/*\n * Copyright 1995-2022 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n\n#ifndef OSSL_INTERNAL_SOCKETS_H\n# define OSSL_INTERNAL_SOCKETS_H\n\n# if defined(OPENSSL_SYS_VXWORKS) || defined(OPENSSL_SYS_UEFI)\n# define NO_SYS_PARAM_H\n# endif\n# ifdef WIN32\n# define NO_SYS_UN_H\n# endif\n# ifdef OPENSSL_SYS_VMS\n# define NO_SYS_PARAM_H\n# define NO_SYS_UN_H\n# endif\n\n# ifdef OPENSSL_NO_SOCK\n\n# elif defined(OPENSSL_SYS_WINDOWS) || defined(OPENSSL_SYS_MSDOS)\n# if defined(__DJGPP__)\n# include \n# include \n# include \n# include \n# include \n# include \n# elif defined(_WIN32_WCE) && _WIN32_WCE<410\n# define getservbyname _masked_declaration_getservbyname\n# endif\n# if !defined(IPPROTO_IP)\n /* winsock[2].h was included already? */\n# include \n# endif\n# ifdef getservbyname\n /* this is used to be wcecompat/include/winsock_extras.h */\n# undef getservbyname\nstruct servent *PASCAL getservbyname(const char *, const char *);\n# endif\n\n# ifdef _WIN64\n/*\n * Even though sizeof(SOCKET) is 8, it's safe to cast it to int, because\n * the value constitutes an index in per-process table of limited size\n * and not a real pointer. And we also depend on fact that all processors\n * Windows run on happen to be two's-complement, which allows to\n * interchange INVALID_SOCKET and -1.\n */\n# define socket(d,t,p) ((int)socket(d,t,p))\n# define accept(s,f,l) ((int)accept(s,f,l))\n# endif\n\n# else\n\n# ifndef NO_SYS_PARAM_H\n# include \n# endif\n# ifdef OPENSSL_SYS_VXWORKS\n# include \n# endif\n\n# include \n# if defined(OPENSSL_SYS_VMS_NODECC)\n# include \n# include \n# include \n# else\n# include \n# ifndef NO_SYS_UN_H\n# include \n# ifndef UNIX_PATH_MAX\n# define UNIX_PATH_MAX sizeof(((struct sockaddr_un *)NULL)->sun_path)\n# endif\n# endif\n# ifdef FILIO_H\n# include /* FIONBIO in some SVR4, e.g. unixware, solaris */\n# endif\n# include \n# include \n# include \n# endif\n\n# ifdef OPENSSL_SYS_AIX\n# include \n# endif\n\n# ifndef VMS\n# include \n# else\n# if !defined(TCPIP_TYPE_SOCKETSHR) && defined(__VMS_VER) && (__VMS_VER > 70000000)\n /* ioctl is only in VMS > 7.0 and when socketshr is not used */\n# include \n# endif\n# include \n# if defined(TCPIP_TYPE_SOCKETSHR)\n# include \n# endif\n# endif\n\n# ifndef INVALID_SOCKET\n# define INVALID_SOCKET (-1)\n# endif\n# endif\n\n/*\n * Some IPv6 implementations are broken, you can disable them in known\n * bad versions.\n */\n# if !defined(OPENSSL_USE_IPV6)\n# if defined(AF_INET6)\n# define OPENSSL_USE_IPV6 1\n# else\n# define OPENSSL_USE_IPV6 0\n# endif\n# endif\n\n# define get_last_socket_error() errno\n# define clear_socket_error() errno=0\n\n# if defined(OPENSSL_SYS_WINDOWS)\n# undef get_last_socket_error\n# undef clear_socket_error\n# define get_last_socket_error() WSAGetLastError()\n# define clear_socket_error() WSASetLastError(0)\n# define readsocket(s,b,n) recv((s),(b),(n),0)\n# define writesocket(s,b,n) send((s),(b),(n),0)\n# elif defined(__DJGPP__)\n# define WATT32\n# define WATT32_NO_OLDIES\n# define closesocket(s) close_s(s)\n# define readsocket(s,b,n) read_s(s,b,n)\n# define writesocket(s,b,n) send(s,b,n,0)\n# elif defined(OPENSSL_SYS_VMS)\n# define ioctlsocket(a,b,c) ioctl(a,b,c)\n# define closesocket(s) close(s)\n# define readsocket(s,b,n) recv((s),(b),(n),0)\n# define writesocket(s,b,n) send((s),(b),(n),0)\n# elif defined(OPENSSL_SYS_VXWORKS)\n# define ioctlsocket(a,b,c) ioctl((a),(b),(int)(c))\n# define closesocket(s) close(s)\n# define readsocket(s,b,n) read((s),(b),(n))\n# define writesocket(s,b,n) write((s),(char *)(b),(n))\n# else\n# define ioctlsocket(a,b,c) ioctl(a,b,c)\n# define closesocket(s) close(s)\n# define readsocket(s,b,n) read((s),(b),(n))\n# define writesocket(s,b,n) write((s),(b),(n))\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/internal/sslconf.h", "content": "/*\n * Copyright 2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef OSSL_INTERNAL_SSLCONF_H\n# define OSSL_INTERNAL_SSLCONF_H\n\ntypedef struct ssl_conf_cmd_st SSL_CONF_CMD;\n\nconst SSL_CONF_CMD *conf_ssl_get(size_t idx, const char **name, size_t *cnt);\nint conf_ssl_name_find(const char *name, size_t *idx);\nvoid conf_ssl_get_cmd(const SSL_CONF_CMD *cmd, size_t idx, char **cmdstr,\n char **arg);\n\n#endif\n" }, { "path": "cryptomini/include/internal/thread_once.h", "content": "/*\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\n/*\n * DEFINE_RUN_ONCE: Define an initialiser function that should be run exactly\n * once. It takes no arguments and returns and int result (1 for success or\n * 0 for failure). Typical usage might be:\n *\n * DEFINE_RUN_ONCE(myinitfunc)\n * {\n * do_some_initialisation();\n * if (init_is_successful())\n * return 1;\n *\n * return 0;\n * }\n */\n#define DEFINE_RUN_ONCE(init) \\\n static int init(void); \\\n int init##_ossl_ret_ = 0; \\\n void init##_ossl_(void) \\\n { \\\n init##_ossl_ret_ = init(); \\\n } \\\n static int init(void)\n\n/*\n * DECLARE_RUN_ONCE: Declare an initialiser function that should be run exactly\n * once that has been defined in another file via DEFINE_RUN_ONCE().\n */\n#define DECLARE_RUN_ONCE(init) \\\n extern int init##_ossl_ret_; \\\n void init##_ossl_(void);\n\n/*\n * DEFINE_RUN_ONCE_STATIC: Define an initialiser function that should be run\n * exactly once. This function will be declared as static within the file. It\n * takes no arguments and returns and int result (1 for success or 0 for\n * failure). Typical usage might be:\n *\n * DEFINE_RUN_ONCE_STATIC(myinitfunc)\n * {\n * do_some_initialisation();\n * if (init_is_successful())\n * return 1;\n *\n * return 0;\n * }\n */\n#define DEFINE_RUN_ONCE_STATIC(init) \\\n static int init(void); \\\n static int init##_ossl_ret_ = 0; \\\n static void init##_ossl_(void) \\\n { \\\n init##_ossl_ret_ = init(); \\\n } \\\n static int init(void)\n\n/*\n * DEFINE_RUN_ONCE_STATIC_ALT: Define an alternative initialiser function. This\n * function will be declared as static within the file. It takes no arguments\n * and returns an int result (1 for success or 0 for failure). An alternative\n * initialiser function is expected to be associated with a primary initialiser\n * function defined via DEFINE_ONCE_STATIC where both functions use the same\n * CRYPTO_ONCE object to synchronise. Where an alternative initialiser function\n * is used only one of the primary or the alternative initialiser function will\n * ever be called - and that function will be called exactly once. Definition\n * of an alternative initialiser function MUST occur AFTER the definition of the\n * primary initialiser function.\n *\n * Typical usage might be:\n *\n * DEFINE_RUN_ONCE_STATIC(myinitfunc)\n * {\n * do_some_initialisation();\n * if (init_is_successful())\n * return 1;\n *\n * return 0;\n * }\n *\n * DEFINE_RUN_ONCE_STATIC_ALT(myaltinitfunc, myinitfunc)\n * {\n * do_some_alternative_initialisation();\n * if (init_is_successful())\n * return 1;\n *\n * return 0;\n * }\n */\n#define DEFINE_RUN_ONCE_STATIC_ALT(initalt, init) \\\n static int initalt(void); \\\n static void initalt##_ossl_(void) \\\n { \\\n init##_ossl_ret_ = initalt(); \\\n } \\\n static int initalt(void)\n\n/*\n * RUN_ONCE - use CRYPTO_THREAD_run_once, and check if the init succeeded\n * @once: pointer to static object of type CRYPTO_ONCE\n * @init: function name that was previously given to DEFINE_RUN_ONCE,\n * DEFINE_RUN_ONCE_STATIC or DECLARE_RUN_ONCE. This function\n * must return 1 for success or 0 for failure.\n *\n * The return value is 1 on success (*) or 0 in case of error.\n *\n * (*) by convention, since the init function must return 1 on success.\n */\n#define RUN_ONCE(once, init) \\\n (CRYPTO_THREAD_run_once(once, init##_ossl_) ? init##_ossl_ret_ : 0)\n\n/*\n * RUN_ONCE_ALT - use CRYPTO_THREAD_run_once, to run an alternative initialiser\n * function and check if that initialisation succeeded\n * @once: pointer to static object of type CRYPTO_ONCE\n * @initalt: alternative initialiser function name that was previously given to\n * DEFINE_RUN_ONCE_STATIC_ALT. This function must return 1 for\n * success or 0 for failure.\n * @init: primary initialiser function name that was previously given to\n * DEFINE_RUN_ONCE_STATIC. This function must return 1 for success or\n * 0 for failure.\n *\n * The return value is 1 on success (*) or 0 in case of error.\n *\n * (*) by convention, since the init function must return 1 on success.\n */\n#define RUN_ONCE_ALT(once, initalt, init) \\\n (CRYPTO_THREAD_run_once(once, initalt##_ossl_) ? init##_ossl_ret_ : 0)\n" }, { "path": "cryptomini/include/internal/tsan_assist.h", "content": "/*\n * Copyright 2018-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * Contemporary compilers implement lock-free atomic memory access\n * primitives that facilitate writing \"thread-opportunistic\" or even real\n * multi-threading low-overhead code. \"Thread-opportunistic\" is when\n * exact result is not required, e.g. some statistics, or execution flow\n * doesn't have to be unambiguous. Simplest example is lazy \"constant\"\n * initialization when one can synchronize on variable itself, e.g.\n *\n * if (var == NOT_YET_INITIALIZED)\n * var = function_returning_same_value();\n *\n * This does work provided that loads and stores are single-instruction\n * operations (and integer ones are on *all* supported platforms), but\n * it upsets Thread Sanitizer. Suggested solution is\n *\n * if (tsan_load(&var) == NOT_YET_INITIALIZED)\n * tsan_store(&var, function_returning_same_value());\n *\n * Production machine code would be the same, so one can wonder why\n * bother. Having Thread Sanitizer accept \"thread-opportunistic\" code\n * allows to move on trouble-shooting real bugs.\n *\n * Resolving Thread Sanitizer nits was the initial purpose for this module,\n * but it was later extended with more nuanced primitives that are useful\n * even in \"non-opportunistic\" scenarios. Most notably verifying if a shared\n * structure is fully initialized and bypassing the initialization lock.\n * It's suggested to view macros defined in this module as \"annotations\" for\n * thread-safe lock-free code, \"Thread-Safe ANnotations\"...\n *\n * It's assumed that ATOMIC_{LONG|INT}_LOCK_FREE are assigned same value as\n * ATOMIC_POINTER_LOCK_FREE. And check for >= 2 ensures that corresponding\n * code is inlined. It should be noted that statistics counters become\n * accurate in such case.\n *\n * Special note about TSAN_QUALIFIER. It might be undesired to use it in\n * a shared header. Because whether operation on specific variable or member\n * is atomic or not might be irrelevant in other modules. In such case one\n * can use TSAN_QUALIFIER in cast specifically when it has to count.\n */\n\n#if defined(__STDC_VERSION__) && __STDC_VERSION__ >= 201112L \\\n && !defined(__STDC_NO_ATOMICS__)\n# include \n\n# if defined(ATOMIC_POINTER_LOCK_FREE) \\\n && ATOMIC_POINTER_LOCK_FREE >= 2\n# define TSAN_QUALIFIER _Atomic\n# define tsan_load(ptr) atomic_load_explicit((ptr), memory_order_relaxed)\n# define tsan_store(ptr, val) atomic_store_explicit((ptr), (val), memory_order_relaxed)\n# define tsan_counter(ptr) atomic_fetch_add_explicit((ptr), 1, memory_order_relaxed)\n# define tsan_decr(ptr) atomic_fetch_add_explicit((ptr), -1, memory_order_relaxed)\n# define tsan_ld_acq(ptr) atomic_load_explicit((ptr), memory_order_acquire)\n# define tsan_st_rel(ptr, val) atomic_store_explicit((ptr), (val), memory_order_release)\n# endif\n\n#elif defined(__GNUC__) && defined(__ATOMIC_RELAXED)\n\n# if defined(__GCC_ATOMIC_POINTER_LOCK_FREE) \\\n && __GCC_ATOMIC_POINTER_LOCK_FREE >= 2\n# define TSAN_QUALIFIER volatile\n# define tsan_load(ptr) __atomic_load_n((ptr), __ATOMIC_RELAXED)\n# define tsan_store(ptr, val) __atomic_store_n((ptr), (val), __ATOMIC_RELAXED)\n# define tsan_counter(ptr) __atomic_fetch_add((ptr), 1, __ATOMIC_RELAXED)\n# define tsan_decr(ptr) __atomic_fetch_add((ptr), -1, __ATOMIC_RELAXED)\n# define tsan_ld_acq(ptr) __atomic_load_n((ptr), __ATOMIC_ACQUIRE)\n# define tsan_st_rel(ptr, val) __atomic_store_n((ptr), (val), __ATOMIC_RELEASE)\n# endif\n\n#elif defined(_MSC_VER) && _MSC_VER>=1200 \\\n && (defined(_M_IX86) || defined(_M_AMD64) || defined(_M_X64) || \\\n defined(_M_ARM64) || (defined(_M_ARM) && _M_ARM >= 7 && !defined(_WIN32_WCE)))\n/*\n * There is subtle dependency on /volatile: command-line option.\n * \"ms\" implies same semantic as memory_order_acquire for loads and\n * memory_order_release for stores, while \"iso\" - memory_order_relaxed for\n * either. Real complication is that defaults are different on x86 and ARM.\n * There is explanation for that, \"ms\" is backward compatible with earlier\n * compiler versions, while multi-processor ARM can be viewed as brand new\n * platform to MSC and its users, and with non-relaxed semantic taking toll\n * with additional instructions and penalties, it kind of makes sense to\n * default to \"iso\"...\n */\n# define TSAN_QUALIFIER volatile\n# if defined(_M_ARM) || defined(_M_ARM64)\n# define _InterlockedExchangeAdd _InterlockedExchangeAdd_nf\n# pragma intrinsic(_InterlockedExchangeAdd_nf)\n# pragma intrinsic(__iso_volatile_load32, __iso_volatile_store32)\n# ifdef _WIN64\n# define _InterlockedExchangeAdd64 _InterlockedExchangeAdd64_nf\n# pragma intrinsic(_InterlockedExchangeAdd64_nf)\n# pragma intrinsic(__iso_volatile_load64, __iso_volatile_store64)\n# define tsan_load(ptr) (sizeof(*(ptr)) == 8 ? __iso_volatile_load64(ptr) \\\n : __iso_volatile_load32(ptr))\n# define tsan_store(ptr, val) (sizeof(*(ptr)) == 8 ? __iso_volatile_store64((ptr), (val)) \\\n : __iso_volatile_store32((ptr), (val)))\n# else\n# define tsan_load(ptr) __iso_volatile_load32(ptr)\n# define tsan_store(ptr, val) __iso_volatile_store32((ptr), (val))\n# endif\n# else\n# define tsan_load(ptr) (*(ptr))\n# define tsan_store(ptr, val) (*(ptr) = (val))\n# endif\n# pragma intrinsic(_InterlockedExchangeAdd)\n# ifdef _WIN64\n# pragma intrinsic(_InterlockedExchangeAdd64)\n# define tsan_counter(ptr) (sizeof(*(ptr)) == 8 ? _InterlockedExchangeAdd64((ptr), 1) \\\n : _InterlockedExchangeAdd((ptr), 1))\n# define tsan_decr(ptr) (sizeof(*(ptr)) == 8 ? _InterlockedExchangeAdd64((ptr), -1) \\\n : _InterlockedExchangeAdd((ptr), -1))\n# else\n# define tsan_counter(ptr) _InterlockedExchangeAdd((ptr), 1)\n# define tsan_decr(ptr) _InterlockedExchangeAdd((ptr), -1)\n# endif\n# if !defined(_ISO_VOLATILE)\n# define tsan_ld_acq(ptr) (*(ptr))\n# define tsan_st_rel(ptr, val) (*(ptr) = (val))\n# endif\n\n#endif\n\n#ifndef TSAN_QUALIFIER\n\n# define TSAN_QUALIFIER volatile\n# define tsan_load(ptr) (*(ptr))\n# define tsan_store(ptr, val) (*(ptr) = (val))\n# define tsan_counter(ptr) ((*(ptr))++)\n# define tsan_decr(ptr) ((*(ptr))--)\n/*\n * Lack of tsan_ld_acq and tsan_ld_rel means that compiler support is not\n * sophisticated enough to support them. Code that relies on them should be\n * protected with #ifdef tsan_ld_acq with locked fallback.\n */\n\n#endif\n" }, { "path": "cryptomini/include/openssl/__DECC_INCLUDE_EPILOGUE.H", "content": "/*\n * Copyright 2016-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * This file is only used by HP C/C++ on VMS, and is included automatically\n * after each header file from this directory\n */\n\n/*\n * The C++ compiler doesn't understand these pragmas, even though it\n * understands the corresponding command line qualifier.\n */\n#ifndef __cplusplus\n/* restore state. Must correspond to the save in __decc_include_prologue.h */\n# pragma names restore\n#endif\n" }, { "path": "cryptomini/include/openssl/__DECC_INCLUDE_PROLOGUE.H", "content": "/*\n * Copyright 2016-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * This file is only used by HP C/C++ on VMS, and is included automatically\n * after each header file from this directory\n */\n\n/*\n * The C++ compiler doesn't understand these pragmas, even though it\n * understands the corresponding command line qualifier.\n */\n#ifndef __cplusplus\n/* save state */\n# pragma names save\n/* have the compiler shorten symbols larger than 31 chars to 23 chars\n * followed by a 8 hex char CRC\n */\n# pragma names as_is,shortened\n#endif\n" }, { "path": "cryptomini/include/openssl/aes.h", "content": "/*\n * Copyright 2002-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_AES_H\n# define HEADER_AES_H\n\n# include \n\n# include \n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n# define AES_ENCRYPT 1\n# define AES_DECRYPT 0\n\n/*\n * Because array size can't be a const in C, the following two are macros.\n * Both sizes are in bytes.\n */\n# define AES_MAXNR 14\n# define AES_BLOCK_SIZE 16\n\n/* This should be a hidden type, but EVP requires that the size be known */\nstruct aes_key_st {\n# ifdef AES_LONG\n unsigned long rd_key[4 * (AES_MAXNR + 1)];\n# else\n unsigned int rd_key[4 * (AES_MAXNR + 1)];\n# endif\n int rounds;\n};\ntypedef struct aes_key_st AES_KEY;\n\nconst char *AES_options(void);\n\nint AES_set_encrypt_key(const unsigned char *userKey, const int bits,\n AES_KEY *key);\nint AES_set_decrypt_key(const unsigned char *userKey, const int bits,\n AES_KEY *key);\n\nvoid AES_encrypt(const unsigned char *in, unsigned char *out,\n const AES_KEY *key);\nvoid AES_decrypt(const unsigned char *in, unsigned char *out,\n const AES_KEY *key);\n\nvoid AES_ecb_encrypt(const unsigned char *in, unsigned char *out,\n const AES_KEY *key, const int enc);\nvoid AES_cbc_encrypt(const unsigned char *in, unsigned char *out,\n size_t length, const AES_KEY *key,\n unsigned char *ivec, const int enc);\nvoid AES_cfb128_encrypt(const unsigned char *in, unsigned char *out,\n size_t length, const AES_KEY *key,\n unsigned char *ivec, int *num, const int enc);\nvoid AES_cfb1_encrypt(const unsigned char *in, unsigned char *out,\n size_t length, const AES_KEY *key,\n unsigned char *ivec, int *num, const int enc);\nvoid AES_cfb8_encrypt(const unsigned char *in, unsigned char *out,\n size_t length, const AES_KEY *key,\n unsigned char *ivec, int *num, const int enc);\nvoid AES_ofb128_encrypt(const unsigned char *in, unsigned char *out,\n size_t length, const AES_KEY *key,\n unsigned char *ivec, int *num);\n/* NB: the IV is _two_ blocks long */\nvoid AES_ige_encrypt(const unsigned char *in, unsigned char *out,\n size_t length, const AES_KEY *key,\n unsigned char *ivec, const int enc);\n/* NB: the IV is _four_ blocks long */\nvoid AES_bi_ige_encrypt(const unsigned char *in, unsigned char *out,\n size_t length, const AES_KEY *key,\n const AES_KEY *key2, const unsigned char *ivec,\n const int enc);\n\nint AES_wrap_key(AES_KEY *key, const unsigned char *iv,\n unsigned char *out,\n const unsigned char *in, unsigned int inlen);\nint AES_unwrap_key(AES_KEY *key, const unsigned char *iv,\n unsigned char *out,\n const unsigned char *in, unsigned int inlen);\n\n\n# ifdef __cplusplus\n}\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/asn1.h", "content": "/*\n * Copyright 1995-2017 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_ASN1_H\n# define HEADER_ASN1_H\n\n# include \n# include \n# include \n# include \n# include \n# include \n# include \n\n# include \n# if OPENSSL_API_COMPAT < 0x10100000L\n# include \n# endif\n\n# ifdef OPENSSL_BUILD_SHLIBCRYPTO\n# undef OPENSSL_EXTERN\n# define OPENSSL_EXTERN OPENSSL_EXPORT\n# endif\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# define V_ASN1_UNIVERSAL 0x00\n# define V_ASN1_APPLICATION 0x40\n# define V_ASN1_CONTEXT_SPECIFIC 0x80\n# define V_ASN1_PRIVATE 0xc0\n\n# define V_ASN1_CONSTRUCTED 0x20\n# define V_ASN1_PRIMITIVE_TAG 0x1f\n# define V_ASN1_PRIMATIVE_TAG /*compat*/ V_ASN1_PRIMITIVE_TAG\n\n# define V_ASN1_APP_CHOOSE -2/* let the recipient choose */\n# define V_ASN1_OTHER -3/* used in ASN1_TYPE */\n# define V_ASN1_ANY -4/* used in ASN1 template code */\n\n# define V_ASN1_UNDEF -1\n/* ASN.1 tag values */\n# define V_ASN1_EOC 0\n# define V_ASN1_BOOLEAN 1 /**/\n# define V_ASN1_INTEGER 2\n# define V_ASN1_BIT_STRING 3\n# define V_ASN1_OCTET_STRING 4\n# define V_ASN1_NULL 5\n# define V_ASN1_OBJECT 6\n# define V_ASN1_OBJECT_DESCRIPTOR 7\n# define V_ASN1_EXTERNAL 8\n# define V_ASN1_REAL 9\n# define V_ASN1_ENUMERATED 10\n# define V_ASN1_UTF8STRING 12\n# define V_ASN1_SEQUENCE 16\n# define V_ASN1_SET 17\n# define V_ASN1_NUMERICSTRING 18 /**/\n# define V_ASN1_PRINTABLESTRING 19\n# define V_ASN1_T61STRING 20\n# define V_ASN1_TELETEXSTRING 20/* alias */\n# define V_ASN1_VIDEOTEXSTRING 21 /**/\n# define V_ASN1_IA5STRING 22\n# define V_ASN1_UTCTIME 23\n# define V_ASN1_GENERALIZEDTIME 24 /**/\n# define V_ASN1_GRAPHICSTRING 25 /**/\n# define V_ASN1_ISO64STRING 26 /**/\n# define V_ASN1_VISIBLESTRING 26/* alias */\n# define V_ASN1_GENERALSTRING 27 /**/\n# define V_ASN1_UNIVERSALSTRING 28 /**/\n# define V_ASN1_BMPSTRING 30\n\n/*\n * NB the constants below are used internally by ASN1_INTEGER\n * and ASN1_ENUMERATED to indicate the sign. They are *not* on\n * the wire tag values.\n */\n\n# define V_ASN1_NEG 0x100\n# define V_ASN1_NEG_INTEGER (2 | V_ASN1_NEG)\n# define V_ASN1_NEG_ENUMERATED (10 | V_ASN1_NEG)\n\n/* For use with d2i_ASN1_type_bytes() */\n# define B_ASN1_NUMERICSTRING 0x0001\n# define B_ASN1_PRINTABLESTRING 0x0002\n# define B_ASN1_T61STRING 0x0004\n# define B_ASN1_TELETEXSTRING 0x0004\n# define B_ASN1_VIDEOTEXSTRING 0x0008\n# define B_ASN1_IA5STRING 0x0010\n# define B_ASN1_GRAPHICSTRING 0x0020\n# define B_ASN1_ISO64STRING 0x0040\n# define B_ASN1_VISIBLESTRING 0x0040\n# define B_ASN1_GENERALSTRING 0x0080\n# define B_ASN1_UNIVERSALSTRING 0x0100\n# define B_ASN1_OCTET_STRING 0x0200\n# define B_ASN1_BIT_STRING 0x0400\n# define B_ASN1_BMPSTRING 0x0800\n# define B_ASN1_UNKNOWN 0x1000\n# define B_ASN1_UTF8STRING 0x2000\n# define B_ASN1_UTCTIME 0x4000\n# define B_ASN1_GENERALIZEDTIME 0x8000\n# define B_ASN1_SEQUENCE 0x10000\n/* For use with ASN1_mbstring_copy() */\n# define MBSTRING_FLAG 0x1000\n# define MBSTRING_UTF8 (MBSTRING_FLAG)\n# define MBSTRING_ASC (MBSTRING_FLAG|1)\n# define MBSTRING_BMP (MBSTRING_FLAG|2)\n# define MBSTRING_UNIV (MBSTRING_FLAG|4)\n# define SMIME_OLDMIME 0x400\n# define SMIME_CRLFEOL 0x800\n# define SMIME_STREAM 0x1000\n struct X509_algor_st;\nDEFINE_STACK_OF(X509_ALGOR)\n\n# define ASN1_STRING_FLAG_BITS_LEFT 0x08/* Set if 0x07 has bits left value */\n/*\n * This indicates that the ASN1_STRING is not a real value but just a place\n * holder for the location where indefinite length constructed data should be\n * inserted in the memory buffer\n */\n# define ASN1_STRING_FLAG_NDEF 0x010\n\n/*\n * This flag is used by the CMS code to indicate that a string is not\n * complete and is a place holder for content when it had all been accessed.\n * The flag will be reset when content has been written to it.\n */\n\n# define ASN1_STRING_FLAG_CONT 0x020\n/*\n * This flag is used by ASN1 code to indicate an ASN1_STRING is an MSTRING\n * type.\n */\n# define ASN1_STRING_FLAG_MSTRING 0x040\n/* String is embedded and only content should be freed */\n# define ASN1_STRING_FLAG_EMBED 0x080\n/* String should be parsed in RFC 5280's time format */\n# define ASN1_STRING_FLAG_X509_TIME 0x100\n/* This is the base type that holds just about everything :-) */\nstruct asn1_string_st {\n int length;\n int type;\n unsigned char *data;\n /*\n * The value of the following field depends on the type being held. It\n * is mostly being used for BIT_STRING so if the input data has a\n * non-zero 'unused bits' value, it will be handled correctly\n */\n long flags;\n};\n\n/*\n * ASN1_ENCODING structure: this is used to save the received encoding of an\n * ASN1 type. This is useful to get round problems with invalid encodings\n * which can break signatures.\n */\n\ntypedef struct ASN1_ENCODING_st {\n unsigned char *enc; /* DER encoding */\n long len; /* Length of encoding */\n int modified; /* set to 1 if 'enc' is invalid */\n} ASN1_ENCODING;\n\n/* Used with ASN1 LONG type: if a long is set to this it is omitted */\n# define ASN1_LONG_UNDEF 0x7fffffffL\n\n# define STABLE_FLAGS_MALLOC 0x01\n/*\n * A zero passed to ASN1_STRING_TABLE_new_add for the flags is interpreted\n * as \"don't change\" and STABLE_FLAGS_MALLOC is always set. By setting\n * STABLE_FLAGS_MALLOC only we can clear the existing value. Use the alias\n * STABLE_FLAGS_CLEAR to reflect this.\n */\n# define STABLE_FLAGS_CLEAR STABLE_FLAGS_MALLOC\n# define STABLE_NO_MASK 0x02\n# define DIRSTRING_TYPE \\\n (B_ASN1_PRINTABLESTRING|B_ASN1_T61STRING|B_ASN1_BMPSTRING|B_ASN1_UTF8STRING)\n# define PKCS9STRING_TYPE (DIRSTRING_TYPE|B_ASN1_IA5STRING)\n\ntypedef struct asn1_string_table_st {\n int nid;\n long minsize;\n long maxsize;\n unsigned long mask;\n unsigned long flags;\n} ASN1_STRING_TABLE;\n\nDEFINE_STACK_OF(ASN1_STRING_TABLE)\n\n/* size limits: this stuff is taken straight from RFC2459 */\n\n# define ub_name 32768\n# define ub_common_name 64\n# define ub_locality_name 128\n# define ub_state_name 128\n# define ub_organization_name 64\n# define ub_organization_unit_name 64\n# define ub_title 64\n# define ub_email_address 128\n\n/*\n * Declarations for template structures: for full definitions see asn1t.h\n */\ntypedef struct ASN1_TEMPLATE_st ASN1_TEMPLATE;\ntypedef struct ASN1_TLC_st ASN1_TLC;\n/* This is just an opaque pointer */\ntypedef struct ASN1_VALUE_st ASN1_VALUE;\n\n/* Declare ASN1 functions: the implement macro in in asn1t.h */\n\n# define DECLARE_ASN1_FUNCTIONS(type) DECLARE_ASN1_FUNCTIONS_name(type, type)\n\n# define DECLARE_ASN1_ALLOC_FUNCTIONS(type) \\\n DECLARE_ASN1_ALLOC_FUNCTIONS_name(type, type)\n\n# define DECLARE_ASN1_FUNCTIONS_name(type, name) \\\n DECLARE_ASN1_ALLOC_FUNCTIONS_name(type, name) \\\n DECLARE_ASN1_ENCODE_FUNCTIONS(type, name, name)\n\n# define DECLARE_ASN1_FUNCTIONS_fname(type, itname, name) \\\n DECLARE_ASN1_ALLOC_FUNCTIONS_name(type, name) \\\n DECLARE_ASN1_ENCODE_FUNCTIONS(type, itname, name)\n\n# define DECLARE_ASN1_ENCODE_FUNCTIONS(type, itname, name) \\\n type *d2i_##name(type **a, const unsigned char **in, long len); \\\n int i2d_##name(type *a, unsigned char **out); \\\n DECLARE_ASN1_ITEM(itname)\n\n# define DECLARE_ASN1_ENCODE_FUNCTIONS_const(type, name) \\\n type *d2i_##name(type **a, const unsigned char **in, long len); \\\n int i2d_##name(const type *a, unsigned char **out); \\\n DECLARE_ASN1_ITEM(name)\n\n# define DECLARE_ASN1_NDEF_FUNCTION(name) \\\n int i2d_##name##_NDEF(name *a, unsigned char **out);\n\n# define DECLARE_ASN1_FUNCTIONS_const(name) \\\n DECLARE_ASN1_ALLOC_FUNCTIONS(name) \\\n DECLARE_ASN1_ENCODE_FUNCTIONS_const(name, name)\n\n# define DECLARE_ASN1_ALLOC_FUNCTIONS_name(type, name) \\\n type *name##_new(void); \\\n void name##_free(type *a);\n\n# define DECLARE_ASN1_PRINT_FUNCTION(stname) \\\n DECLARE_ASN1_PRINT_FUNCTION_fname(stname, stname)\n\n# define DECLARE_ASN1_PRINT_FUNCTION_fname(stname, fname) \\\n int fname##_print_ctx(BIO *out, stname *x, int indent, \\\n const ASN1_PCTX *pctx);\n\n# define D2I_OF(type) type *(*)(type **,const unsigned char **,long)\n# define I2D_OF(type) int (*)(type *,unsigned char **)\n# define I2D_OF_const(type) int (*)(const type *,unsigned char **)\n\n# define CHECKED_D2I_OF(type, d2i) \\\n ((d2i_of_void*) (1 ? d2i : ((D2I_OF(type))0)))\n# define CHECKED_I2D_OF(type, i2d) \\\n ((i2d_of_void*) (1 ? i2d : ((I2D_OF(type))0)))\n# define CHECKED_NEW_OF(type, xnew) \\\n ((void *(*)(void)) (1 ? xnew : ((type *(*)(void))0)))\n# define CHECKED_PTR_OF(type, p) \\\n ((void*) (1 ? p : (type*)0))\n# define CHECKED_PPTR_OF(type, p) \\\n ((void**) (1 ? p : (type**)0))\n\n# define TYPEDEF_D2I_OF(type) typedef type *d2i_of_##type(type **,const unsigned char **,long)\n# define TYPEDEF_I2D_OF(type) typedef int i2d_of_##type(type *,unsigned char **)\n# define TYPEDEF_D2I2D_OF(type) TYPEDEF_D2I_OF(type); TYPEDEF_I2D_OF(type)\n\nTYPEDEF_D2I2D_OF(void);\n\n/*-\n * The following macros and typedefs allow an ASN1_ITEM\n * to be embedded in a structure and referenced. Since\n * the ASN1_ITEM pointers need to be globally accessible\n * (possibly from shared libraries) they may exist in\n * different forms. On platforms that support it the\n * ASN1_ITEM structure itself will be globally exported.\n * Other platforms will export a function that returns\n * an ASN1_ITEM pointer.\n *\n * To handle both cases transparently the macros below\n * should be used instead of hard coding an ASN1_ITEM\n * pointer in a structure.\n *\n * The structure will look like this:\n *\n * typedef struct SOMETHING_st {\n * ...\n * ASN1_ITEM_EXP *iptr;\n * ...\n * } SOMETHING;\n *\n * It would be initialised as e.g.:\n *\n * SOMETHING somevar = {...,ASN1_ITEM_ref(X509),...};\n *\n * and the actual pointer extracted with:\n *\n * const ASN1_ITEM *it = ASN1_ITEM_ptr(somevar.iptr);\n *\n * Finally an ASN1_ITEM pointer can be extracted from an\n * appropriate reference with: ASN1_ITEM_rptr(X509). This\n * would be used when a function takes an ASN1_ITEM * argument.\n *\n */\n\n# ifndef OPENSSL_EXPORT_VAR_AS_FUNCTION\n\n/* ASN1_ITEM pointer exported type */\ntypedef const ASN1_ITEM ASN1_ITEM_EXP;\n\n/* Macro to obtain ASN1_ITEM pointer from exported type */\n# define ASN1_ITEM_ptr(iptr) (iptr)\n\n/* Macro to include ASN1_ITEM pointer from base type */\n# define ASN1_ITEM_ref(iptr) (&(iptr##_it))\n\n# define ASN1_ITEM_rptr(ref) (&(ref##_it))\n\n# define DECLARE_ASN1_ITEM(name) \\\n OPENSSL_EXTERN const ASN1_ITEM name##_it;\n\n# else\n\n/*\n * Platforms that can't easily handle shared global variables are declared as\n * functions returning ASN1_ITEM pointers.\n */\n\n/* ASN1_ITEM pointer exported type */\ntypedef const ASN1_ITEM *ASN1_ITEM_EXP (void);\n\n/* Macro to obtain ASN1_ITEM pointer from exported type */\n# define ASN1_ITEM_ptr(iptr) (iptr())\n\n/* Macro to include ASN1_ITEM pointer from base type */\n# define ASN1_ITEM_ref(iptr) (iptr##_it)\n\n# define ASN1_ITEM_rptr(ref) (ref##_it())\n\n# define DECLARE_ASN1_ITEM(name) \\\n const ASN1_ITEM * name##_it(void);\n\n# endif\n\n/* Parameters used by ASN1_STRING_print_ex() */\n\n/*\n * These determine which characters to escape: RFC2253 special characters,\n * control characters and MSB set characters\n */\n\n# define ASN1_STRFLGS_ESC_2253 1\n# define ASN1_STRFLGS_ESC_CTRL 2\n# define ASN1_STRFLGS_ESC_MSB 4\n\n/*\n * This flag determines how we do escaping: normally RC2253 backslash only,\n * set this to use backslash and quote.\n */\n\n# define ASN1_STRFLGS_ESC_QUOTE 8\n\n/* These three flags are internal use only. */\n\n/* Character is a valid PrintableString character */\n# define CHARTYPE_PRINTABLESTRING 0x10\n/* Character needs escaping if it is the first character */\n# define CHARTYPE_FIRST_ESC_2253 0x20\n/* Character needs escaping if it is the last character */\n# define CHARTYPE_LAST_ESC_2253 0x40\n\n/*\n * NB the internal flags are safely reused below by flags handled at the top\n * level.\n */\n\n/*\n * If this is set we convert all character strings to UTF8 first\n */\n\n# define ASN1_STRFLGS_UTF8_CONVERT 0x10\n\n/*\n * If this is set we don't attempt to interpret content: just assume all\n * strings are 1 byte per character. This will produce some pretty odd\n * looking output!\n */\n\n# define ASN1_STRFLGS_IGNORE_TYPE 0x20\n\n/* If this is set we include the string type in the output */\n# define ASN1_STRFLGS_SHOW_TYPE 0x40\n\n/*\n * This determines which strings to display and which to 'dump' (hex dump of\n * content octets or DER encoding). We can only dump non character strings or\n * everything. If we don't dump 'unknown' they are interpreted as character\n * strings with 1 octet per character and are subject to the usual escaping\n * options.\n */\n\n# define ASN1_STRFLGS_DUMP_ALL 0x80\n# define ASN1_STRFLGS_DUMP_UNKNOWN 0x100\n\n/*\n * These determine what 'dumping' does, we can dump the content octets or the\n * DER encoding: both use the RFC2253 #XXXXX notation.\n */\n\n# define ASN1_STRFLGS_DUMP_DER 0x200\n\n/*\n * This flag specifies that RC2254 escaping shall be performed.\n */\n#define ASN1_STRFLGS_ESC_2254 0x400\n\n/*\n * All the string flags consistent with RFC2253, escaping control characters\n * isn't essential in RFC2253 but it is advisable anyway.\n */\n\n# define ASN1_STRFLGS_RFC2253 (ASN1_STRFLGS_ESC_2253 | \\\n ASN1_STRFLGS_ESC_CTRL | \\\n ASN1_STRFLGS_ESC_MSB | \\\n ASN1_STRFLGS_UTF8_CONVERT | \\\n ASN1_STRFLGS_DUMP_UNKNOWN | \\\n ASN1_STRFLGS_DUMP_DER)\n\nDEFINE_STACK_OF(ASN1_INTEGER)\n\nDEFINE_STACK_OF(ASN1_GENERALSTRING)\n\nDEFINE_STACK_OF(ASN1_UTF8STRING)\n\ntypedef struct asn1_type_st {\n int type;\n union {\n char *ptr;\n ASN1_BOOLEAN boolean;\n ASN1_STRING *asn1_string;\n ASN1_OBJECT *object;\n ASN1_INTEGER *integer;\n ASN1_ENUMERATED *enumerated;\n ASN1_BIT_STRING *bit_string;\n ASN1_OCTET_STRING *octet_string;\n ASN1_PRINTABLESTRING *printablestring;\n ASN1_T61STRING *t61string;\n ASN1_IA5STRING *ia5string;\n ASN1_GENERALSTRING *generalstring;\n ASN1_BMPSTRING *bmpstring;\n ASN1_UNIVERSALSTRING *universalstring;\n ASN1_UTCTIME *utctime;\n ASN1_GENERALIZEDTIME *generalizedtime;\n ASN1_VISIBLESTRING *visiblestring;\n ASN1_UTF8STRING *utf8string;\n /*\n * set and sequence are left complete and still contain the set or\n * sequence bytes\n */\n ASN1_STRING *set;\n ASN1_STRING *sequence;\n ASN1_VALUE *asn1_value;\n } value;\n} ASN1_TYPE;\n\nDEFINE_STACK_OF(ASN1_TYPE)\n\ntypedef STACK_OF(ASN1_TYPE) ASN1_SEQUENCE_ANY;\n\nDECLARE_ASN1_ENCODE_FUNCTIONS_const(ASN1_SEQUENCE_ANY, ASN1_SEQUENCE_ANY)\nDECLARE_ASN1_ENCODE_FUNCTIONS_const(ASN1_SEQUENCE_ANY, ASN1_SET_ANY)\n\n/* This is used to contain a list of bit names */\ntypedef struct BIT_STRING_BITNAME_st {\n int bitnum;\n const char *lname;\n const char *sname;\n} BIT_STRING_BITNAME;\n\n# define B_ASN1_TIME \\\n B_ASN1_UTCTIME | \\\n B_ASN1_GENERALIZEDTIME\n\n# define B_ASN1_PRINTABLE \\\n B_ASN1_NUMERICSTRING| \\\n B_ASN1_PRINTABLESTRING| \\\n B_ASN1_T61STRING| \\\n B_ASN1_IA5STRING| \\\n B_ASN1_BIT_STRING| \\\n B_ASN1_UNIVERSALSTRING|\\\n B_ASN1_BMPSTRING|\\\n B_ASN1_UTF8STRING|\\\n B_ASN1_SEQUENCE|\\\n B_ASN1_UNKNOWN\n\n# define B_ASN1_DIRECTORYSTRING \\\n B_ASN1_PRINTABLESTRING| \\\n B_ASN1_TELETEXSTRING|\\\n B_ASN1_BMPSTRING|\\\n B_ASN1_UNIVERSALSTRING|\\\n B_ASN1_UTF8STRING\n\n# define B_ASN1_DISPLAYTEXT \\\n B_ASN1_IA5STRING| \\\n B_ASN1_VISIBLESTRING| \\\n B_ASN1_BMPSTRING|\\\n B_ASN1_UTF8STRING\n\nDECLARE_ASN1_FUNCTIONS_fname(ASN1_TYPE, ASN1_ANY, ASN1_TYPE)\n\nint ASN1_TYPE_get(const ASN1_TYPE *a);\nvoid ASN1_TYPE_set(ASN1_TYPE *a, int type, void *value);\nint ASN1_TYPE_set1(ASN1_TYPE *a, int type, const void *value);\nint ASN1_TYPE_cmp(const ASN1_TYPE *a, const ASN1_TYPE *b);\n\nASN1_TYPE *ASN1_TYPE_pack_sequence(const ASN1_ITEM *it, void *s, ASN1_TYPE **t);\nvoid *ASN1_TYPE_unpack_sequence(const ASN1_ITEM *it, const ASN1_TYPE *t);\n\nASN1_OBJECT *ASN1_OBJECT_new(void);\nvoid ASN1_OBJECT_free(ASN1_OBJECT *a);\nint i2d_ASN1_OBJECT(const ASN1_OBJECT *a, unsigned char **pp);\nASN1_OBJECT *d2i_ASN1_OBJECT(ASN1_OBJECT **a, const unsigned char **pp,\n long length);\n\nDECLARE_ASN1_ITEM(ASN1_OBJECT)\n\nDEFINE_STACK_OF(ASN1_OBJECT)\n\nASN1_STRING *ASN1_STRING_new(void);\nvoid ASN1_STRING_free(ASN1_STRING *a);\nvoid ASN1_STRING_clear_free(ASN1_STRING *a);\nint ASN1_STRING_copy(ASN1_STRING *dst, const ASN1_STRING *str);\nASN1_STRING *ASN1_STRING_dup(const ASN1_STRING *a);\nASN1_STRING *ASN1_STRING_type_new(int type);\nint ASN1_STRING_cmp(const ASN1_STRING *a, const ASN1_STRING *b);\n /*\n * Since this is used to store all sorts of things, via macros, for now,\n * make its data void *\n */\nint ASN1_STRING_set(ASN1_STRING *str, const void *data, int len);\nvoid ASN1_STRING_set0(ASN1_STRING *str, void *data, int len);\nint ASN1_STRING_length(const ASN1_STRING *x);\nvoid ASN1_STRING_length_set(ASN1_STRING *x, int n);\nint ASN1_STRING_type(const ASN1_STRING *x);\nDEPRECATEDIN_1_1_0(unsigned char *ASN1_STRING_data(ASN1_STRING *x))\nconst unsigned char *ASN1_STRING_get0_data(const ASN1_STRING *x);\n\nDECLARE_ASN1_FUNCTIONS(ASN1_BIT_STRING)\nint ASN1_BIT_STRING_set(ASN1_BIT_STRING *a, unsigned char *d, int length);\nint ASN1_BIT_STRING_set_bit(ASN1_BIT_STRING *a, int n, int value);\nint ASN1_BIT_STRING_get_bit(const ASN1_BIT_STRING *a, int n);\nint ASN1_BIT_STRING_check(const ASN1_BIT_STRING *a,\n const unsigned char *flags, int flags_len);\n\nint ASN1_BIT_STRING_name_print(BIO *out, ASN1_BIT_STRING *bs,\n BIT_STRING_BITNAME *tbl, int indent);\nint ASN1_BIT_STRING_num_asc(const char *name, BIT_STRING_BITNAME *tbl);\nint ASN1_BIT_STRING_set_asc(ASN1_BIT_STRING *bs, const char *name, int value,\n BIT_STRING_BITNAME *tbl);\n\nDECLARE_ASN1_FUNCTIONS(ASN1_INTEGER)\nASN1_INTEGER *d2i_ASN1_UINTEGER(ASN1_INTEGER **a, const unsigned char **pp,\n long length);\nASN1_INTEGER *ASN1_INTEGER_dup(const ASN1_INTEGER *x);\nint ASN1_INTEGER_cmp(const ASN1_INTEGER *x, const ASN1_INTEGER *y);\n\nDECLARE_ASN1_FUNCTIONS(ASN1_ENUMERATED)\n\nint ASN1_UTCTIME_check(const ASN1_UTCTIME *a);\nASN1_UTCTIME *ASN1_UTCTIME_set(ASN1_UTCTIME *s, time_t t);\nASN1_UTCTIME *ASN1_UTCTIME_adj(ASN1_UTCTIME *s, time_t t,\n int offset_day, long offset_sec);\nint ASN1_UTCTIME_set_string(ASN1_UTCTIME *s, const char *str);\nint ASN1_UTCTIME_cmp_time_t(const ASN1_UTCTIME *s, time_t t);\n\nint ASN1_GENERALIZEDTIME_check(const ASN1_GENERALIZEDTIME *a);\nASN1_GENERALIZEDTIME *ASN1_GENERALIZEDTIME_set(ASN1_GENERALIZEDTIME *s,\n time_t t);\nASN1_GENERALIZEDTIME *ASN1_GENERALIZEDTIME_adj(ASN1_GENERALIZEDTIME *s,\n time_t t, int offset_day,\n long offset_sec);\nint ASN1_GENERALIZEDTIME_set_string(ASN1_GENERALIZEDTIME *s, const char *str);\n\nint ASN1_TIME_diff(int *pday, int *psec,\n const ASN1_TIME *from, const ASN1_TIME *to);\n\nDECLARE_ASN1_FUNCTIONS(ASN1_OCTET_STRING)\nASN1_OCTET_STRING *ASN1_OCTET_STRING_dup(const ASN1_OCTET_STRING *a);\nint ASN1_OCTET_STRING_cmp(const ASN1_OCTET_STRING *a,\n const ASN1_OCTET_STRING *b);\nint ASN1_OCTET_STRING_set(ASN1_OCTET_STRING *str, const unsigned char *data,\n int len);\n\nDECLARE_ASN1_FUNCTIONS(ASN1_VISIBLESTRING)\nDECLARE_ASN1_FUNCTIONS(ASN1_UNIVERSALSTRING)\nDECLARE_ASN1_FUNCTIONS(ASN1_UTF8STRING)\nDECLARE_ASN1_FUNCTIONS(ASN1_NULL)\nDECLARE_ASN1_FUNCTIONS(ASN1_BMPSTRING)\n\nint UTF8_getc(const unsigned char *str, int len, unsigned long *val);\nint UTF8_putc(unsigned char *str, int len, unsigned long value);\n\nDECLARE_ASN1_FUNCTIONS_name(ASN1_STRING, ASN1_PRINTABLE)\n\nDECLARE_ASN1_FUNCTIONS_name(ASN1_STRING, DIRECTORYSTRING)\nDECLARE_ASN1_FUNCTIONS_name(ASN1_STRING, DISPLAYTEXT)\nDECLARE_ASN1_FUNCTIONS(ASN1_PRINTABLESTRING)\nDECLARE_ASN1_FUNCTIONS(ASN1_T61STRING)\nDECLARE_ASN1_FUNCTIONS(ASN1_IA5STRING)\nDECLARE_ASN1_FUNCTIONS(ASN1_GENERALSTRING)\nDECLARE_ASN1_FUNCTIONS(ASN1_UTCTIME)\nDECLARE_ASN1_FUNCTIONS(ASN1_GENERALIZEDTIME)\nDECLARE_ASN1_FUNCTIONS(ASN1_TIME)\n\nDECLARE_ASN1_ITEM(ASN1_OCTET_STRING_NDEF)\n\nASN1_TIME *ASN1_TIME_set(ASN1_TIME *s, time_t t);\nASN1_TIME *ASN1_TIME_adj(ASN1_TIME *s, time_t t,\n int offset_day, long offset_sec);\nint ASN1_TIME_check(const ASN1_TIME *t);\nASN1_GENERALIZEDTIME *ASN1_TIME_to_generalizedtime(const ASN1_TIME *t,\n ASN1_GENERALIZEDTIME **out);\nint ASN1_TIME_set_string(ASN1_TIME *s, const char *str);\nint ASN1_TIME_set_string_X509(ASN1_TIME *s, const char *str);\nint ASN1_TIME_to_tm(const ASN1_TIME *s, struct tm *tm);\nint ASN1_TIME_normalize(ASN1_TIME *s);\nint ASN1_TIME_cmp_time_t(const ASN1_TIME *s, time_t t);\nint ASN1_TIME_compare(const ASN1_TIME *a, const ASN1_TIME *b);\n\nint i2a_ASN1_INTEGER(BIO *bp, const ASN1_INTEGER *a);\nint a2i_ASN1_INTEGER(BIO *bp, ASN1_INTEGER *bs, char *buf, int size);\nint i2a_ASN1_ENUMERATED(BIO *bp, const ASN1_ENUMERATED *a);\nint a2i_ASN1_ENUMERATED(BIO *bp, ASN1_ENUMERATED *bs, char *buf, int size);\nint i2a_ASN1_OBJECT(BIO *bp, const ASN1_OBJECT *a);\nint a2i_ASN1_STRING(BIO *bp, ASN1_STRING *bs, char *buf, int size);\nint i2a_ASN1_STRING(BIO *bp, const ASN1_STRING *a, int type);\nint i2t_ASN1_OBJECT(char *buf, int buf_len, const ASN1_OBJECT *a);\n\nint a2d_ASN1_OBJECT(unsigned char *out, int olen, const char *buf, int num);\nASN1_OBJECT *ASN1_OBJECT_create(int nid, unsigned char *data, int len,\n const char *sn, const char *ln);\n\nint ASN1_INTEGER_get_int64(int64_t *pr, const ASN1_INTEGER *a);\nint ASN1_INTEGER_set_int64(ASN1_INTEGER *a, int64_t r);\nint ASN1_INTEGER_get_uint64(uint64_t *pr, const ASN1_INTEGER *a);\nint ASN1_INTEGER_set_uint64(ASN1_INTEGER *a, uint64_t r);\n\nint ASN1_INTEGER_set(ASN1_INTEGER *a, long v);\nlong ASN1_INTEGER_get(const ASN1_INTEGER *a);\nASN1_INTEGER *BN_to_ASN1_INTEGER(const BIGNUM *bn, ASN1_INTEGER *ai);\nBIGNUM *ASN1_INTEGER_to_BN(const ASN1_INTEGER *ai, BIGNUM *bn);\n\nint ASN1_ENUMERATED_get_int64(int64_t *pr, const ASN1_ENUMERATED *a);\nint ASN1_ENUMERATED_set_int64(ASN1_ENUMERATED *a, int64_t r);\n\n\nint ASN1_ENUMERATED_set(ASN1_ENUMERATED *a, long v);\nlong ASN1_ENUMERATED_get(const ASN1_ENUMERATED *a);\nASN1_ENUMERATED *BN_to_ASN1_ENUMERATED(const BIGNUM *bn, ASN1_ENUMERATED *ai);\nBIGNUM *ASN1_ENUMERATED_to_BN(const ASN1_ENUMERATED *ai, BIGNUM *bn);\n\n/* General */\n/* given a string, return the correct type, max is the maximum length */\nint ASN1_PRINTABLE_type(const unsigned char *s, int max);\n\nunsigned long ASN1_tag2bit(int tag);\n\n/* SPECIALS */\nint ASN1_get_object(const unsigned char **pp, long *plength, int *ptag,\n int *pclass, long omax);\nint ASN1_check_infinite_end(unsigned char **p, long len);\nint ASN1_const_check_infinite_end(const unsigned char **p, long len);\nvoid ASN1_put_object(unsigned char **pp, int constructed, int length,\n int tag, int xclass);\nint ASN1_put_eoc(unsigned char **pp);\nint ASN1_object_size(int constructed, int length, int tag);\n\n/* Used to implement other functions */\nvoid *ASN1_dup(i2d_of_void *i2d, d2i_of_void *d2i, void *x);\n\n# define ASN1_dup_of(type,i2d,d2i,x) \\\n ((type*)ASN1_dup(CHECKED_I2D_OF(type, i2d), \\\n CHECKED_D2I_OF(type, d2i), \\\n CHECKED_PTR_OF(type, x)))\n\n# define ASN1_dup_of_const(type,i2d,d2i,x) \\\n ((type*)ASN1_dup(CHECKED_I2D_OF(const type, i2d), \\\n CHECKED_D2I_OF(type, d2i), \\\n CHECKED_PTR_OF(const type, x)))\n\nvoid *ASN1_item_dup(const ASN1_ITEM *it, void *x);\n\n/* ASN1 alloc/free macros for when a type is only used internally */\n\n# define M_ASN1_new_of(type) (type *)ASN1_item_new(ASN1_ITEM_rptr(type))\n# define M_ASN1_free_of(x, type) \\\n ASN1_item_free(CHECKED_PTR_OF(type, x), ASN1_ITEM_rptr(type))\n\n# ifndef OPENSSL_NO_STDIO\nvoid *ASN1_d2i_fp(void *(*xnew) (void), d2i_of_void *d2i, FILE *in, void **x);\n\n# define ASN1_d2i_fp_of(type,xnew,d2i,in,x) \\\n ((type*)ASN1_d2i_fp(CHECKED_NEW_OF(type, xnew), \\\n CHECKED_D2I_OF(type, d2i), \\\n in, \\\n CHECKED_PPTR_OF(type, x)))\n\nvoid *ASN1_item_d2i_fp(const ASN1_ITEM *it, FILE *in, void *x);\nint ASN1_i2d_fp(i2d_of_void *i2d, FILE *out, void *x);\n\n# define ASN1_i2d_fp_of(type,i2d,out,x) \\\n (ASN1_i2d_fp(CHECKED_I2D_OF(type, i2d), \\\n out, \\\n CHECKED_PTR_OF(type, x)))\n\n# define ASN1_i2d_fp_of_const(type,i2d,out,x) \\\n (ASN1_i2d_fp(CHECKED_I2D_OF(const type, i2d), \\\n out, \\\n CHECKED_PTR_OF(const type, x)))\n\nint ASN1_item_i2d_fp(const ASN1_ITEM *it, FILE *out, void *x);\nint ASN1_STRING_print_ex_fp(FILE *fp, const ASN1_STRING *str, unsigned long flags);\n# endif\n\nint ASN1_STRING_to_UTF8(unsigned char **out, const ASN1_STRING *in);\n\nvoid *ASN1_d2i_bio(void *(*xnew) (void), d2i_of_void *d2i, BIO *in, void **x);\n\n# define ASN1_d2i_bio_of(type,xnew,d2i,in,x) \\\n ((type*)ASN1_d2i_bio( CHECKED_NEW_OF(type, xnew), \\\n CHECKED_D2I_OF(type, d2i), \\\n in, \\\n CHECKED_PPTR_OF(type, x)))\n\nvoid *ASN1_item_d2i_bio(const ASN1_ITEM *it, BIO *in, void *x);\nint ASN1_i2d_bio(i2d_of_void *i2d, BIO *out, unsigned char *x);\n\n# define ASN1_i2d_bio_of(type,i2d,out,x) \\\n (ASN1_i2d_bio(CHECKED_I2D_OF(type, i2d), \\\n out, \\\n CHECKED_PTR_OF(type, x)))\n\n# define ASN1_i2d_bio_of_const(type,i2d,out,x) \\\n (ASN1_i2d_bio(CHECKED_I2D_OF(const type, i2d), \\\n out, \\\n CHECKED_PTR_OF(const type, x)))\n\nint ASN1_item_i2d_bio(const ASN1_ITEM *it, BIO *out, void *x);\nint ASN1_UTCTIME_print(BIO *fp, const ASN1_UTCTIME *a);\nint ASN1_GENERALIZEDTIME_print(BIO *fp, const ASN1_GENERALIZEDTIME *a);\nint ASN1_TIME_print(BIO *fp, const ASN1_TIME *a);\nint ASN1_STRING_print(BIO *bp, const ASN1_STRING *v);\nint ASN1_STRING_print_ex(BIO *out, const ASN1_STRING *str, unsigned long flags);\nint ASN1_buf_print(BIO *bp, const unsigned char *buf, size_t buflen, int off);\nint ASN1_bn_print(BIO *bp, const char *number, const BIGNUM *num,\n unsigned char *buf, int off);\nint ASN1_parse(BIO *bp, const unsigned char *pp, long len, int indent);\nint ASN1_parse_dump(BIO *bp, const unsigned char *pp, long len, int indent,\n int dump);\nconst char *ASN1_tag2str(int tag);\n\n/* Used to load and write Netscape format cert */\n\nint ASN1_UNIVERSALSTRING_to_string(ASN1_UNIVERSALSTRING *s);\n\nint ASN1_TYPE_set_octetstring(ASN1_TYPE *a, unsigned char *data, int len);\nint ASN1_TYPE_get_octetstring(const ASN1_TYPE *a, unsigned char *data, int max_len);\nint ASN1_TYPE_set_int_octetstring(ASN1_TYPE *a, long num,\n unsigned char *data, int len);\nint ASN1_TYPE_get_int_octetstring(const ASN1_TYPE *a, long *num,\n unsigned char *data, int max_len);\n\nvoid *ASN1_item_unpack(const ASN1_STRING *oct, const ASN1_ITEM *it);\n\nASN1_STRING *ASN1_item_pack(void *obj, const ASN1_ITEM *it,\n ASN1_OCTET_STRING **oct);\n\nvoid ASN1_STRING_set_default_mask(unsigned long mask);\nint ASN1_STRING_set_default_mask_asc(const char *p);\nunsigned long ASN1_STRING_get_default_mask(void);\nint ASN1_mbstring_copy(ASN1_STRING **out, const unsigned char *in, int len,\n int inform, unsigned long mask);\nint ASN1_mbstring_ncopy(ASN1_STRING **out, const unsigned char *in, int len,\n int inform, unsigned long mask,\n long minsize, long maxsize);\n\nASN1_STRING *ASN1_STRING_set_by_NID(ASN1_STRING **out,\n const unsigned char *in, int inlen,\n int inform, int nid);\nASN1_STRING_TABLE *ASN1_STRING_TABLE_get(int nid);\nint ASN1_STRING_TABLE_add(int, long, long, unsigned long, unsigned long);\nvoid ASN1_STRING_TABLE_cleanup(void);\n\n/* ASN1 template functions */\n\n/* Old API compatible functions */\nASN1_VALUE *ASN1_item_new(const ASN1_ITEM *it);\nvoid ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it);\nASN1_VALUE *ASN1_item_d2i(ASN1_VALUE **val, const unsigned char **in,\n long len, const ASN1_ITEM *it);\nint ASN1_item_i2d(ASN1_VALUE *val, unsigned char **out, const ASN1_ITEM *it);\nint ASN1_item_ndef_i2d(ASN1_VALUE *val, unsigned char **out,\n const ASN1_ITEM *it);\n\nvoid ASN1_add_oid_module(void);\nvoid ASN1_add_stable_module(void);\n\nASN1_TYPE *ASN1_generate_nconf(const char *str, CONF *nconf);\nASN1_TYPE *ASN1_generate_v3(const char *str, X509V3_CTX *cnf);\nint ASN1_str2mask(const char *str, unsigned long *pmask);\n\n/* ASN1 Print flags */\n\n/* Indicate missing OPTIONAL fields */\n# define ASN1_PCTX_FLAGS_SHOW_ABSENT 0x001\n/* Mark start and end of SEQUENCE */\n# define ASN1_PCTX_FLAGS_SHOW_SEQUENCE 0x002\n/* Mark start and end of SEQUENCE/SET OF */\n# define ASN1_PCTX_FLAGS_SHOW_SSOF 0x004\n/* Show the ASN1 type of primitives */\n# define ASN1_PCTX_FLAGS_SHOW_TYPE 0x008\n/* Don't show ASN1 type of ANY */\n# define ASN1_PCTX_FLAGS_NO_ANY_TYPE 0x010\n/* Don't show ASN1 type of MSTRINGs */\n# define ASN1_PCTX_FLAGS_NO_MSTRING_TYPE 0x020\n/* Don't show field names in SEQUENCE */\n# define ASN1_PCTX_FLAGS_NO_FIELD_NAME 0x040\n/* Show structure names of each SEQUENCE field */\n# define ASN1_PCTX_FLAGS_SHOW_FIELD_STRUCT_NAME 0x080\n/* Don't show structure name even at top level */\n# define ASN1_PCTX_FLAGS_NO_STRUCT_NAME 0x100\n\nint ASN1_item_print(BIO *out, ASN1_VALUE *ifld, int indent,\n const ASN1_ITEM *it, const ASN1_PCTX *pctx);\nASN1_PCTX *ASN1_PCTX_new(void);\nvoid ASN1_PCTX_free(ASN1_PCTX *p);\nunsigned long ASN1_PCTX_get_flags(const ASN1_PCTX *p);\nvoid ASN1_PCTX_set_flags(ASN1_PCTX *p, unsigned long flags);\nunsigned long ASN1_PCTX_get_nm_flags(const ASN1_PCTX *p);\nvoid ASN1_PCTX_set_nm_flags(ASN1_PCTX *p, unsigned long flags);\nunsigned long ASN1_PCTX_get_cert_flags(const ASN1_PCTX *p);\nvoid ASN1_PCTX_set_cert_flags(ASN1_PCTX *p, unsigned long flags);\nunsigned long ASN1_PCTX_get_oid_flags(const ASN1_PCTX *p);\nvoid ASN1_PCTX_set_oid_flags(ASN1_PCTX *p, unsigned long flags);\nunsigned long ASN1_PCTX_get_str_flags(const ASN1_PCTX *p);\nvoid ASN1_PCTX_set_str_flags(ASN1_PCTX *p, unsigned long flags);\n\nASN1_SCTX *ASN1_SCTX_new(int (*scan_cb) (ASN1_SCTX *ctx));\nvoid ASN1_SCTX_free(ASN1_SCTX *p);\nconst ASN1_ITEM *ASN1_SCTX_get_item(ASN1_SCTX *p);\nconst ASN1_TEMPLATE *ASN1_SCTX_get_template(ASN1_SCTX *p);\nunsigned long ASN1_SCTX_get_flags(ASN1_SCTX *p);\nvoid ASN1_SCTX_set_app_data(ASN1_SCTX *p, void *data);\nvoid *ASN1_SCTX_get_app_data(ASN1_SCTX *p);\n\nconst BIO_METHOD *BIO_f_asn1(void);\n\nBIO *BIO_new_NDEF(BIO *out, ASN1_VALUE *val, const ASN1_ITEM *it);\n\nint i2d_ASN1_bio_stream(BIO *out, ASN1_VALUE *val, BIO *in, int flags,\n const ASN1_ITEM *it);\nint PEM_write_bio_ASN1_stream(BIO *out, ASN1_VALUE *val, BIO *in, int flags,\n const char *hdr, const ASN1_ITEM *it);\nint SMIME_write_ASN1(BIO *bio, ASN1_VALUE *val, BIO *data, int flags,\n int ctype_nid, int econt_nid,\n STACK_OF(X509_ALGOR) *mdalgs, const ASN1_ITEM *it);\nASN1_VALUE *SMIME_read_ASN1(BIO *bio, BIO **bcont, const ASN1_ITEM *it);\nint SMIME_crlf_copy(BIO *in, BIO *out, int flags);\nint SMIME_text(BIO *in, BIO *out);\n\nconst ASN1_ITEM *ASN1_ITEM_lookup(const char *name);\nconst ASN1_ITEM *ASN1_ITEM_get(size_t i);\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/asn1_mac.h", "content": "/*\n * Copyright 2015-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#error \"This file is obsolete; please update your software.\"\n" }, { "path": "cryptomini/include/openssl/asn1err.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_ASN1ERR_H\n# define HEADER_ASN1ERR_H\n\n# include \n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_ASN1_strings(void);\n\n/*\n * ASN1 function codes.\n */\n# define ASN1_F_A2D_ASN1_OBJECT 100\n# define ASN1_F_A2I_ASN1_INTEGER 102\n# define ASN1_F_A2I_ASN1_STRING 103\n# define ASN1_F_APPEND_EXP 176\n# define ASN1_F_ASN1_BIO_INIT 113\n# define ASN1_F_ASN1_BIT_STRING_SET_BIT 183\n# define ASN1_F_ASN1_CB 177\n# define ASN1_F_ASN1_CHECK_TLEN 104\n# define ASN1_F_ASN1_COLLECT 106\n# define ASN1_F_ASN1_D2I_EX_PRIMITIVE 108\n# define ASN1_F_ASN1_D2I_FP 109\n# define ASN1_F_ASN1_D2I_READ_BIO 107\n# define ASN1_F_ASN1_DIGEST 184\n# define ASN1_F_ASN1_DO_ADB 110\n# define ASN1_F_ASN1_DO_LOCK 233\n# define ASN1_F_ASN1_DUP 111\n# define ASN1_F_ASN1_ENC_SAVE 115\n# define ASN1_F_ASN1_EX_C2I 204\n# define ASN1_F_ASN1_FIND_END 190\n# define ASN1_F_ASN1_GENERALIZEDTIME_ADJ 216\n# define ASN1_F_ASN1_GENERATE_V3 178\n# define ASN1_F_ASN1_GET_INT64 224\n# define ASN1_F_ASN1_GET_OBJECT 114\n# define ASN1_F_ASN1_GET_UINT64 225\n# define ASN1_F_ASN1_I2D_BIO 116\n# define ASN1_F_ASN1_I2D_FP 117\n# define ASN1_F_ASN1_ITEM_D2I_FP 206\n# define ASN1_F_ASN1_ITEM_DUP 191\n# define ASN1_F_ASN1_ITEM_EMBED_D2I 120\n# define ASN1_F_ASN1_ITEM_EMBED_NEW 121\n# define ASN1_F_ASN1_ITEM_EX_I2D 144\n# define ASN1_F_ASN1_ITEM_FLAGS_I2D 118\n# define ASN1_F_ASN1_ITEM_I2D_BIO 192\n# define ASN1_F_ASN1_ITEM_I2D_FP 193\n# define ASN1_F_ASN1_ITEM_PACK 198\n# define ASN1_F_ASN1_ITEM_SIGN 195\n# define ASN1_F_ASN1_ITEM_SIGN_CTX 220\n# define ASN1_F_ASN1_ITEM_UNPACK 199\n# define ASN1_F_ASN1_ITEM_VERIFY 197\n# define ASN1_F_ASN1_MBSTRING_NCOPY 122\n# define ASN1_F_ASN1_OBJECT_NEW 123\n# define ASN1_F_ASN1_OUTPUT_DATA 214\n# define ASN1_F_ASN1_PCTX_NEW 205\n# define ASN1_F_ASN1_PRIMITIVE_NEW 119\n# define ASN1_F_ASN1_SCTX_NEW 221\n# define ASN1_F_ASN1_SIGN 128\n# define ASN1_F_ASN1_STR2TYPE 179\n# define ASN1_F_ASN1_STRING_GET_INT64 227\n# define ASN1_F_ASN1_STRING_GET_UINT64 230\n# define ASN1_F_ASN1_STRING_SET 186\n# define ASN1_F_ASN1_STRING_TABLE_ADD 129\n# define ASN1_F_ASN1_STRING_TO_BN 228\n# define ASN1_F_ASN1_STRING_TYPE_NEW 130\n# define ASN1_F_ASN1_TEMPLATE_EX_D2I 132\n# define ASN1_F_ASN1_TEMPLATE_NEW 133\n# define ASN1_F_ASN1_TEMPLATE_NOEXP_D2I 131\n# define ASN1_F_ASN1_TIME_ADJ 217\n# define ASN1_F_ASN1_TYPE_GET_INT_OCTETSTRING 134\n# define ASN1_F_ASN1_TYPE_GET_OCTETSTRING 135\n# define ASN1_F_ASN1_UTCTIME_ADJ 218\n# define ASN1_F_ASN1_VERIFY 137\n# define ASN1_F_B64_READ_ASN1 209\n# define ASN1_F_B64_WRITE_ASN1 210\n# define ASN1_F_BIO_NEW_NDEF 208\n# define ASN1_F_BITSTR_CB 180\n# define ASN1_F_BN_TO_ASN1_STRING 229\n# define ASN1_F_C2I_ASN1_BIT_STRING 189\n# define ASN1_F_C2I_ASN1_INTEGER 194\n# define ASN1_F_C2I_ASN1_OBJECT 196\n# define ASN1_F_C2I_IBUF 226\n# define ASN1_F_C2I_UINT64_INT 101\n# define ASN1_F_COLLECT_DATA 140\n# define ASN1_F_D2I_ASN1_OBJECT 147\n# define ASN1_F_D2I_ASN1_UINTEGER 150\n# define ASN1_F_D2I_AUTOPRIVATEKEY 207\n# define ASN1_F_D2I_PRIVATEKEY 154\n# define ASN1_F_D2I_PUBLICKEY 155\n# define ASN1_F_DO_BUF 142\n# define ASN1_F_DO_CREATE 124\n# define ASN1_F_DO_DUMP 125\n# define ASN1_F_DO_TCREATE 222\n# define ASN1_F_I2A_ASN1_OBJECT 126\n# define ASN1_F_I2D_ASN1_BIO_STREAM 211\n# define ASN1_F_I2D_ASN1_OBJECT 143\n# define ASN1_F_I2D_DSA_PUBKEY 161\n# define ASN1_F_I2D_EC_PUBKEY 181\n# define ASN1_F_I2D_PRIVATEKEY 163\n# define ASN1_F_I2D_PUBLICKEY 164\n# define ASN1_F_I2D_RSA_PUBKEY 165\n# define ASN1_F_LONG_C2I 166\n# define ASN1_F_NDEF_PREFIX 127\n# define ASN1_F_NDEF_SUFFIX 136\n# define ASN1_F_OID_MODULE_INIT 174\n# define ASN1_F_PARSE_TAGGING 182\n# define ASN1_F_PKCS5_PBE2_SET_IV 167\n# define ASN1_F_PKCS5_PBE2_SET_SCRYPT 231\n# define ASN1_F_PKCS5_PBE_SET 202\n# define ASN1_F_PKCS5_PBE_SET0_ALGOR 215\n# define ASN1_F_PKCS5_PBKDF2_SET 219\n# define ASN1_F_PKCS5_SCRYPT_SET 232\n# define ASN1_F_SMIME_READ_ASN1 212\n# define ASN1_F_SMIME_TEXT 213\n# define ASN1_F_STABLE_GET 138\n# define ASN1_F_STBL_MODULE_INIT 223\n# define ASN1_F_UINT32_C2I 105\n# define ASN1_F_UINT32_NEW 139\n# define ASN1_F_UINT64_C2I 112\n# define ASN1_F_UINT64_NEW 141\n# define ASN1_F_X509_CRL_ADD0_REVOKED 169\n# define ASN1_F_X509_INFO_NEW 170\n# define ASN1_F_X509_NAME_ENCODE 203\n# define ASN1_F_X509_NAME_EX_D2I 158\n# define ASN1_F_X509_NAME_EX_NEW 171\n# define ASN1_F_X509_PKEY_NEW 173\n\n/*\n * ASN1 reason codes.\n */\n# define ASN1_R_ADDING_OBJECT 171\n# define ASN1_R_ASN1_PARSE_ERROR 203\n# define ASN1_R_ASN1_SIG_PARSE_ERROR 204\n# define ASN1_R_AUX_ERROR 100\n# define ASN1_R_BAD_OBJECT_HEADER 102\n# define ASN1_R_BAD_TEMPLATE 230\n# define ASN1_R_BMPSTRING_IS_WRONG_LENGTH 214\n# define ASN1_R_BN_LIB 105\n# define ASN1_R_BOOLEAN_IS_WRONG_LENGTH 106\n# define ASN1_R_BUFFER_TOO_SMALL 107\n# define ASN1_R_CIPHER_HAS_NO_OBJECT_IDENTIFIER 108\n# define ASN1_R_CONTEXT_NOT_INITIALISED 217\n# define ASN1_R_DATA_IS_WRONG 109\n# define ASN1_R_DECODE_ERROR 110\n# define ASN1_R_DEPTH_EXCEEDED 174\n# define ASN1_R_DIGEST_AND_KEY_TYPE_NOT_SUPPORTED 198\n# define ASN1_R_ENCODE_ERROR 112\n# define ASN1_R_ERROR_GETTING_TIME 173\n# define ASN1_R_ERROR_LOADING_SECTION 172\n# define ASN1_R_ERROR_SETTING_CIPHER_PARAMS 114\n# define ASN1_R_EXPECTING_AN_INTEGER 115\n# define ASN1_R_EXPECTING_AN_OBJECT 116\n# define ASN1_R_EXPLICIT_LENGTH_MISMATCH 119\n# define ASN1_R_EXPLICIT_TAG_NOT_CONSTRUCTED 120\n# define ASN1_R_FIELD_MISSING 121\n# define ASN1_R_FIRST_NUM_TOO_LARGE 122\n# define ASN1_R_HEADER_TOO_LONG 123\n# define ASN1_R_ILLEGAL_BITSTRING_FORMAT 175\n# define ASN1_R_ILLEGAL_BOOLEAN 176\n# define ASN1_R_ILLEGAL_CHARACTERS 124\n# define ASN1_R_ILLEGAL_FORMAT 177\n# define ASN1_R_ILLEGAL_HEX 178\n# define ASN1_R_ILLEGAL_IMPLICIT_TAG 179\n# define ASN1_R_ILLEGAL_INTEGER 180\n# define ASN1_R_ILLEGAL_NEGATIVE_VALUE 226\n# define ASN1_R_ILLEGAL_NESTED_TAGGING 181\n# define ASN1_R_ILLEGAL_NULL 125\n# define ASN1_R_ILLEGAL_NULL_VALUE 182\n# define ASN1_R_ILLEGAL_OBJECT 183\n# define ASN1_R_ILLEGAL_OPTIONAL_ANY 126\n# define ASN1_R_ILLEGAL_OPTIONS_ON_ITEM_TEMPLATE 170\n# define ASN1_R_ILLEGAL_PADDING 221\n# define ASN1_R_ILLEGAL_TAGGED_ANY 127\n# define ASN1_R_ILLEGAL_TIME_VALUE 184\n# define ASN1_R_ILLEGAL_ZERO_CONTENT 222\n# define ASN1_R_INTEGER_NOT_ASCII_FORMAT 185\n# define ASN1_R_INTEGER_TOO_LARGE_FOR_LONG 128\n# define ASN1_R_INVALID_BIT_STRING_BITS_LEFT 220\n# define ASN1_R_INVALID_BMPSTRING_LENGTH 129\n# define ASN1_R_INVALID_DIGIT 130\n# define ASN1_R_INVALID_MIME_TYPE 205\n# define ASN1_R_INVALID_MODIFIER 186\n# define ASN1_R_INVALID_NUMBER 187\n# define ASN1_R_INVALID_OBJECT_ENCODING 216\n# define ASN1_R_INVALID_SCRYPT_PARAMETERS 227\n# define ASN1_R_INVALID_SEPARATOR 131\n# define ASN1_R_INVALID_STRING_TABLE_VALUE 218\n# define ASN1_R_INVALID_UNIVERSALSTRING_LENGTH 133\n# define ASN1_R_INVALID_UTF8STRING 134\n# define ASN1_R_INVALID_VALUE 219\n# define ASN1_R_LIST_ERROR 188\n# define ASN1_R_MIME_NO_CONTENT_TYPE 206\n# define ASN1_R_MIME_PARSE_ERROR 207\n# define ASN1_R_MIME_SIG_PARSE_ERROR 208\n# define ASN1_R_MISSING_EOC 137\n# define ASN1_R_MISSING_SECOND_NUMBER 138\n# define ASN1_R_MISSING_VALUE 189\n# define ASN1_R_MSTRING_NOT_UNIVERSAL 139\n# define ASN1_R_MSTRING_WRONG_TAG 140\n# define ASN1_R_NESTED_ASN1_STRING 197\n# define ASN1_R_NESTED_TOO_DEEP 201\n# define ASN1_R_NON_HEX_CHARACTERS 141\n# define ASN1_R_NOT_ASCII_FORMAT 190\n# define ASN1_R_NOT_ENOUGH_DATA 142\n# define ASN1_R_NO_CONTENT_TYPE 209\n# define ASN1_R_NO_MATCHING_CHOICE_TYPE 143\n# define ASN1_R_NO_MULTIPART_BODY_FAILURE 210\n# define ASN1_R_NO_MULTIPART_BOUNDARY 211\n# define ASN1_R_NO_SIG_CONTENT_TYPE 212\n# define ASN1_R_NULL_IS_WRONG_LENGTH 144\n# define ASN1_R_OBJECT_NOT_ASCII_FORMAT 191\n# define ASN1_R_ODD_NUMBER_OF_CHARS 145\n# define ASN1_R_SECOND_NUMBER_TOO_LARGE 147\n# define ASN1_R_SEQUENCE_LENGTH_MISMATCH 148\n# define ASN1_R_SEQUENCE_NOT_CONSTRUCTED 149\n# define ASN1_R_SEQUENCE_OR_SET_NEEDS_CONFIG 192\n# define ASN1_R_SHORT_LINE 150\n# define ASN1_R_SIG_INVALID_MIME_TYPE 213\n# define ASN1_R_STREAMING_NOT_SUPPORTED 202\n# define ASN1_R_STRING_TOO_LONG 151\n# define ASN1_R_STRING_TOO_SHORT 152\n# define ASN1_R_THE_ASN1_OBJECT_IDENTIFIER_IS_NOT_KNOWN_FOR_THIS_MD 154\n# define ASN1_R_TIME_NOT_ASCII_FORMAT 193\n# define ASN1_R_TOO_LARGE 223\n# define ASN1_R_TOO_LONG 155\n# define ASN1_R_TOO_SMALL 224\n# define ASN1_R_TYPE_NOT_CONSTRUCTED 156\n# define ASN1_R_TYPE_NOT_PRIMITIVE 195\n# define ASN1_R_UNEXPECTED_EOC 159\n# define ASN1_R_UNIVERSALSTRING_IS_WRONG_LENGTH 215\n# define ASN1_R_UNKNOWN_FORMAT 160\n# define ASN1_R_UNKNOWN_MESSAGE_DIGEST_ALGORITHM 161\n# define ASN1_R_UNKNOWN_OBJECT_TYPE 162\n# define ASN1_R_UNKNOWN_PUBLIC_KEY_TYPE 163\n# define ASN1_R_UNKNOWN_SIGNATURE_ALGORITHM 199\n# define ASN1_R_UNKNOWN_TAG 194\n# define ASN1_R_UNSUPPORTED_ANY_DEFINED_BY_TYPE 164\n# define ASN1_R_UNSUPPORTED_CIPHER 228\n# define ASN1_R_UNSUPPORTED_PUBLIC_KEY_TYPE 167\n# define ASN1_R_UNSUPPORTED_TYPE 196\n# define ASN1_R_WRONG_INTEGER_TYPE 225\n# define ASN1_R_WRONG_PUBLIC_KEY_TYPE 200\n# define ASN1_R_WRONG_TAG 168\n\n#endif\n" }, { "path": "cryptomini/include/openssl/asn1t.h", "content": "/*\n * Copyright 2000-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_ASN1T_H\n# define HEADER_ASN1T_H\n\n# include \n# include \n# include \n\n# ifdef OPENSSL_BUILD_SHLIBCRYPTO\n# undef OPENSSL_EXTERN\n# define OPENSSL_EXTERN OPENSSL_EXPORT\n# endif\n\n/* ASN1 template defines, structures and functions */\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# ifndef OPENSSL_EXPORT_VAR_AS_FUNCTION\n\n/* Macro to obtain ASN1_ADB pointer from a type (only used internally) */\n# define ASN1_ADB_ptr(iptr) ((const ASN1_ADB *)(iptr))\n\n/* Macros for start and end of ASN1_ITEM definition */\n\n# define ASN1_ITEM_start(itname) \\\n const ASN1_ITEM itname##_it = {\n\n# define static_ASN1_ITEM_start(itname) \\\n static const ASN1_ITEM itname##_it = {\n\n# define ASN1_ITEM_end(itname) \\\n };\n\n# else\n\n/* Macro to obtain ASN1_ADB pointer from a type (only used internally) */\n# define ASN1_ADB_ptr(iptr) ((const ASN1_ADB *)((iptr)()))\n\n/* Macros for start and end of ASN1_ITEM definition */\n\n# define ASN1_ITEM_start(itname) \\\n const ASN1_ITEM * itname##_it(void) \\\n { \\\n static const ASN1_ITEM local_it = {\n\n# define static_ASN1_ITEM_start(itname) \\\n static ASN1_ITEM_start(itname)\n\n# define ASN1_ITEM_end(itname) \\\n }; \\\n return &local_it; \\\n }\n\n# endif\n\n/* Macros to aid ASN1 template writing */\n\n# define ASN1_ITEM_TEMPLATE(tname) \\\n static const ASN1_TEMPLATE tname##_item_tt\n\n# define ASN1_ITEM_TEMPLATE_END(tname) \\\n ;\\\n ASN1_ITEM_start(tname) \\\n ASN1_ITYPE_PRIMITIVE,\\\n -1,\\\n &tname##_item_tt,\\\n 0,\\\n NULL,\\\n 0,\\\n #tname \\\n ASN1_ITEM_end(tname)\n# define static_ASN1_ITEM_TEMPLATE_END(tname) \\\n ;\\\n static_ASN1_ITEM_start(tname) \\\n ASN1_ITYPE_PRIMITIVE,\\\n -1,\\\n &tname##_item_tt,\\\n 0,\\\n NULL,\\\n 0,\\\n #tname \\\n ASN1_ITEM_end(tname)\n\n/* This is a ASN1 type which just embeds a template */\n\n/*-\n * This pair helps declare a SEQUENCE. We can do:\n *\n * ASN1_SEQUENCE(stname) = {\n * ... SEQUENCE components ...\n * } ASN1_SEQUENCE_END(stname)\n *\n * This will produce an ASN1_ITEM called stname_it\n * for a structure called stname.\n *\n * If you want the same structure but a different\n * name then use:\n *\n * ASN1_SEQUENCE(itname) = {\n * ... SEQUENCE components ...\n * } ASN1_SEQUENCE_END_name(stname, itname)\n *\n * This will create an item called itname_it using\n * a structure called stname.\n */\n\n# define ASN1_SEQUENCE(tname) \\\n static const ASN1_TEMPLATE tname##_seq_tt[]\n\n# define ASN1_SEQUENCE_END(stname) ASN1_SEQUENCE_END_name(stname, stname)\n\n# define static_ASN1_SEQUENCE_END(stname) static_ASN1_SEQUENCE_END_name(stname, stname)\n\n# define ASN1_SEQUENCE_END_name(stname, tname) \\\n ;\\\n ASN1_ITEM_start(tname) \\\n ASN1_ITYPE_SEQUENCE,\\\n V_ASN1_SEQUENCE,\\\n tname##_seq_tt,\\\n sizeof(tname##_seq_tt) / sizeof(ASN1_TEMPLATE),\\\n NULL,\\\n sizeof(stname),\\\n #tname \\\n ASN1_ITEM_end(tname)\n\n# define static_ASN1_SEQUENCE_END_name(stname, tname) \\\n ;\\\n static_ASN1_ITEM_start(tname) \\\n ASN1_ITYPE_SEQUENCE,\\\n V_ASN1_SEQUENCE,\\\n tname##_seq_tt,\\\n sizeof(tname##_seq_tt) / sizeof(ASN1_TEMPLATE),\\\n NULL,\\\n sizeof(stname),\\\n #stname \\\n ASN1_ITEM_end(tname)\n\n# define ASN1_NDEF_SEQUENCE(tname) \\\n ASN1_SEQUENCE(tname)\n\n# define ASN1_NDEF_SEQUENCE_cb(tname, cb) \\\n ASN1_SEQUENCE_cb(tname, cb)\n\n# define ASN1_SEQUENCE_cb(tname, cb) \\\n static const ASN1_AUX tname##_aux = {NULL, 0, 0, 0, cb, 0}; \\\n ASN1_SEQUENCE(tname)\n\n# define ASN1_BROKEN_SEQUENCE(tname) \\\n static const ASN1_AUX tname##_aux = {NULL, ASN1_AFLG_BROKEN, 0, 0, 0, 0}; \\\n ASN1_SEQUENCE(tname)\n\n# define ASN1_SEQUENCE_ref(tname, cb) \\\n static const ASN1_AUX tname##_aux = {NULL, ASN1_AFLG_REFCOUNT, offsetof(tname, references), offsetof(tname, lock), cb, 0}; \\\n ASN1_SEQUENCE(tname)\n\n# define ASN1_SEQUENCE_enc(tname, enc, cb) \\\n static const ASN1_AUX tname##_aux = {NULL, ASN1_AFLG_ENCODING, 0, 0, cb, offsetof(tname, enc)}; \\\n ASN1_SEQUENCE(tname)\n\n# define ASN1_NDEF_SEQUENCE_END(tname) \\\n ;\\\n ASN1_ITEM_start(tname) \\\n ASN1_ITYPE_NDEF_SEQUENCE,\\\n V_ASN1_SEQUENCE,\\\n tname##_seq_tt,\\\n sizeof(tname##_seq_tt) / sizeof(ASN1_TEMPLATE),\\\n NULL,\\\n sizeof(tname),\\\n #tname \\\n ASN1_ITEM_end(tname)\n# define static_ASN1_NDEF_SEQUENCE_END(tname) \\\n ;\\\n static_ASN1_ITEM_start(tname) \\\n ASN1_ITYPE_NDEF_SEQUENCE,\\\n V_ASN1_SEQUENCE,\\\n tname##_seq_tt,\\\n sizeof(tname##_seq_tt) / sizeof(ASN1_TEMPLATE),\\\n NULL,\\\n sizeof(tname),\\\n #tname \\\n ASN1_ITEM_end(tname)\n\n# define ASN1_BROKEN_SEQUENCE_END(stname) ASN1_SEQUENCE_END_ref(stname, stname)\n# define static_ASN1_BROKEN_SEQUENCE_END(stname) \\\n static_ASN1_SEQUENCE_END_ref(stname, stname)\n\n# define ASN1_SEQUENCE_END_enc(stname, tname) ASN1_SEQUENCE_END_ref(stname, tname)\n\n# define ASN1_SEQUENCE_END_cb(stname, tname) ASN1_SEQUENCE_END_ref(stname, tname)\n# define static_ASN1_SEQUENCE_END_cb(stname, tname) static_ASN1_SEQUENCE_END_ref(stname, tname)\n\n# define ASN1_SEQUENCE_END_ref(stname, tname) \\\n ;\\\n ASN1_ITEM_start(tname) \\\n ASN1_ITYPE_SEQUENCE,\\\n V_ASN1_SEQUENCE,\\\n tname##_seq_tt,\\\n sizeof(tname##_seq_tt) / sizeof(ASN1_TEMPLATE),\\\n &tname##_aux,\\\n sizeof(stname),\\\n #tname \\\n ASN1_ITEM_end(tname)\n# define static_ASN1_SEQUENCE_END_ref(stname, tname) \\\n ;\\\n static_ASN1_ITEM_start(tname) \\\n ASN1_ITYPE_SEQUENCE,\\\n V_ASN1_SEQUENCE,\\\n tname##_seq_tt,\\\n sizeof(tname##_seq_tt) / sizeof(ASN1_TEMPLATE),\\\n &tname##_aux,\\\n sizeof(stname),\\\n #stname \\\n ASN1_ITEM_end(tname)\n\n# define ASN1_NDEF_SEQUENCE_END_cb(stname, tname) \\\n ;\\\n ASN1_ITEM_start(tname) \\\n ASN1_ITYPE_NDEF_SEQUENCE,\\\n V_ASN1_SEQUENCE,\\\n tname##_seq_tt,\\\n sizeof(tname##_seq_tt) / sizeof(ASN1_TEMPLATE),\\\n &tname##_aux,\\\n sizeof(stname),\\\n #stname \\\n ASN1_ITEM_end(tname)\n\n/*-\n * This pair helps declare a CHOICE type. We can do:\n *\n * ASN1_CHOICE(chname) = {\n * ... CHOICE options ...\n * ASN1_CHOICE_END(chname)\n *\n * This will produce an ASN1_ITEM called chname_it\n * for a structure called chname. The structure\n * definition must look like this:\n * typedef struct {\n * int type;\n * union {\n * ASN1_SOMETHING *opt1;\n * ASN1_SOMEOTHER *opt2;\n * } value;\n * } chname;\n *\n * the name of the selector must be 'type'.\n * to use an alternative selector name use the\n * ASN1_CHOICE_END_selector() version.\n */\n\n# define ASN1_CHOICE(tname) \\\n static const ASN1_TEMPLATE tname##_ch_tt[]\n\n# define ASN1_CHOICE_cb(tname, cb) \\\n static const ASN1_AUX tname##_aux = {NULL, 0, 0, 0, cb, 0}; \\\n ASN1_CHOICE(tname)\n\n# define ASN1_CHOICE_END(stname) ASN1_CHOICE_END_name(stname, stname)\n\n# define static_ASN1_CHOICE_END(stname) static_ASN1_CHOICE_END_name(stname, stname)\n\n# define ASN1_CHOICE_END_name(stname, tname) ASN1_CHOICE_END_selector(stname, tname, type)\n\n# define static_ASN1_CHOICE_END_name(stname, tname) static_ASN1_CHOICE_END_selector(stname, tname, type)\n\n# define ASN1_CHOICE_END_selector(stname, tname, selname) \\\n ;\\\n ASN1_ITEM_start(tname) \\\n ASN1_ITYPE_CHOICE,\\\n offsetof(stname,selname) ,\\\n tname##_ch_tt,\\\n sizeof(tname##_ch_tt) / sizeof(ASN1_TEMPLATE),\\\n NULL,\\\n sizeof(stname),\\\n #stname \\\n ASN1_ITEM_end(tname)\n\n# define static_ASN1_CHOICE_END_selector(stname, tname, selname) \\\n ;\\\n static_ASN1_ITEM_start(tname) \\\n ASN1_ITYPE_CHOICE,\\\n offsetof(stname,selname) ,\\\n tname##_ch_tt,\\\n sizeof(tname##_ch_tt) / sizeof(ASN1_TEMPLATE),\\\n NULL,\\\n sizeof(stname),\\\n #stname \\\n ASN1_ITEM_end(tname)\n\n# define ASN1_CHOICE_END_cb(stname, tname, selname) \\\n ;\\\n ASN1_ITEM_start(tname) \\\n ASN1_ITYPE_CHOICE,\\\n offsetof(stname,selname) ,\\\n tname##_ch_tt,\\\n sizeof(tname##_ch_tt) / sizeof(ASN1_TEMPLATE),\\\n &tname##_aux,\\\n sizeof(stname),\\\n #stname \\\n ASN1_ITEM_end(tname)\n\n/* This helps with the template wrapper form of ASN1_ITEM */\n\n# define ASN1_EX_TEMPLATE_TYPE(flags, tag, name, type) { \\\n (flags), (tag), 0,\\\n #name, ASN1_ITEM_ref(type) }\n\n/* These help with SEQUENCE or CHOICE components */\n\n/* used to declare other types */\n\n# define ASN1_EX_TYPE(flags, tag, stname, field, type) { \\\n (flags), (tag), offsetof(stname, field),\\\n #field, ASN1_ITEM_ref(type) }\n\n/* implicit and explicit helper macros */\n\n# define ASN1_IMP_EX(stname, field, type, tag, ex) \\\n ASN1_EX_TYPE(ASN1_TFLG_IMPLICIT | (ex), tag, stname, field, type)\n\n# define ASN1_EXP_EX(stname, field, type, tag, ex) \\\n ASN1_EX_TYPE(ASN1_TFLG_EXPLICIT | (ex), tag, stname, field, type)\n\n/* Any defined by macros: the field used is in the table itself */\n\n# ifndef OPENSSL_EXPORT_VAR_AS_FUNCTION\n# define ASN1_ADB_OBJECT(tblname) { ASN1_TFLG_ADB_OID, -1, 0, #tblname, (const ASN1_ITEM *)&(tblname##_adb) }\n# define ASN1_ADB_INTEGER(tblname) { ASN1_TFLG_ADB_INT, -1, 0, #tblname, (const ASN1_ITEM *)&(tblname##_adb) }\n# else\n# define ASN1_ADB_OBJECT(tblname) { ASN1_TFLG_ADB_OID, -1, 0, #tblname, tblname##_adb }\n# define ASN1_ADB_INTEGER(tblname) { ASN1_TFLG_ADB_INT, -1, 0, #tblname, tblname##_adb }\n# endif\n/* Plain simple type */\n# define ASN1_SIMPLE(stname, field, type) ASN1_EX_TYPE(0,0, stname, field, type)\n/* Embedded simple type */\n# define ASN1_EMBED(stname, field, type) ASN1_EX_TYPE(ASN1_TFLG_EMBED,0, stname, field, type)\n\n/* OPTIONAL simple type */\n# define ASN1_OPT(stname, field, type) ASN1_EX_TYPE(ASN1_TFLG_OPTIONAL, 0, stname, field, type)\n# define ASN1_OPT_EMBED(stname, field, type) ASN1_EX_TYPE(ASN1_TFLG_OPTIONAL|ASN1_TFLG_EMBED, 0, stname, field, type)\n\n/* IMPLICIT tagged simple type */\n# define ASN1_IMP(stname, field, type, tag) ASN1_IMP_EX(stname, field, type, tag, 0)\n# define ASN1_IMP_EMBED(stname, field, type, tag) ASN1_IMP_EX(stname, field, type, tag, ASN1_TFLG_EMBED)\n\n/* IMPLICIT tagged OPTIONAL simple type */\n# define ASN1_IMP_OPT(stname, field, type, tag) ASN1_IMP_EX(stname, field, type, tag, ASN1_TFLG_OPTIONAL)\n# define ASN1_IMP_OPT_EMBED(stname, field, type, tag) ASN1_IMP_EX(stname, field, type, tag, ASN1_TFLG_OPTIONAL|ASN1_TFLG_EMBED)\n\n/* Same as above but EXPLICIT */\n\n# define ASN1_EXP(stname, field, type, tag) ASN1_EXP_EX(stname, field, type, tag, 0)\n# define ASN1_EXP_EMBED(stname, field, type, tag) ASN1_EXP_EX(stname, field, type, tag, ASN1_TFLG_EMBED)\n# define ASN1_EXP_OPT(stname, field, type, tag) ASN1_EXP_EX(stname, field, type, tag, ASN1_TFLG_OPTIONAL)\n# define ASN1_EXP_OPT_EMBED(stname, field, type, tag) ASN1_EXP_EX(stname, field, type, tag, ASN1_TFLG_OPTIONAL|ASN1_TFLG_EMBED)\n\n/* SEQUENCE OF type */\n# define ASN1_SEQUENCE_OF(stname, field, type) \\\n ASN1_EX_TYPE(ASN1_TFLG_SEQUENCE_OF, 0, stname, field, type)\n\n/* OPTIONAL SEQUENCE OF */\n# define ASN1_SEQUENCE_OF_OPT(stname, field, type) \\\n ASN1_EX_TYPE(ASN1_TFLG_SEQUENCE_OF|ASN1_TFLG_OPTIONAL, 0, stname, field, type)\n\n/* Same as above but for SET OF */\n\n# define ASN1_SET_OF(stname, field, type) \\\n ASN1_EX_TYPE(ASN1_TFLG_SET_OF, 0, stname, field, type)\n\n# define ASN1_SET_OF_OPT(stname, field, type) \\\n ASN1_EX_TYPE(ASN1_TFLG_SET_OF|ASN1_TFLG_OPTIONAL, 0, stname, field, type)\n\n/* Finally compound types of SEQUENCE, SET, IMPLICIT, EXPLICIT and OPTIONAL */\n\n# define ASN1_IMP_SET_OF(stname, field, type, tag) \\\n ASN1_IMP_EX(stname, field, type, tag, ASN1_TFLG_SET_OF)\n\n# define ASN1_EXP_SET_OF(stname, field, type, tag) \\\n ASN1_EXP_EX(stname, field, type, tag, ASN1_TFLG_SET_OF)\n\n# define ASN1_IMP_SET_OF_OPT(stname, field, type, tag) \\\n ASN1_IMP_EX(stname, field, type, tag, ASN1_TFLG_SET_OF|ASN1_TFLG_OPTIONAL)\n\n# define ASN1_EXP_SET_OF_OPT(stname, field, type, tag) \\\n ASN1_EXP_EX(stname, field, type, tag, ASN1_TFLG_SET_OF|ASN1_TFLG_OPTIONAL)\n\n# define ASN1_IMP_SEQUENCE_OF(stname, field, type, tag) \\\n ASN1_IMP_EX(stname, field, type, tag, ASN1_TFLG_SEQUENCE_OF)\n\n# define ASN1_IMP_SEQUENCE_OF_OPT(stname, field, type, tag) \\\n ASN1_IMP_EX(stname, field, type, tag, ASN1_TFLG_SEQUENCE_OF|ASN1_TFLG_OPTIONAL)\n\n# define ASN1_EXP_SEQUENCE_OF(stname, field, type, tag) \\\n ASN1_EXP_EX(stname, field, type, tag, ASN1_TFLG_SEQUENCE_OF)\n\n# define ASN1_EXP_SEQUENCE_OF_OPT(stname, field, type, tag) \\\n ASN1_EXP_EX(stname, field, type, tag, ASN1_TFLG_SEQUENCE_OF|ASN1_TFLG_OPTIONAL)\n\n/* EXPLICIT using indefinite length constructed form */\n# define ASN1_NDEF_EXP(stname, field, type, tag) \\\n ASN1_EXP_EX(stname, field, type, tag, ASN1_TFLG_NDEF)\n\n/* EXPLICIT OPTIONAL using indefinite length constructed form */\n# define ASN1_NDEF_EXP_OPT(stname, field, type, tag) \\\n ASN1_EXP_EX(stname, field, type, tag, ASN1_TFLG_OPTIONAL|ASN1_TFLG_NDEF)\n\n/* Macros for the ASN1_ADB structure */\n\n# define ASN1_ADB(name) \\\n static const ASN1_ADB_TABLE name##_adbtbl[]\n\n# ifndef OPENSSL_EXPORT_VAR_AS_FUNCTION\n\n# define ASN1_ADB_END(name, flags, field, adb_cb, def, none) \\\n ;\\\n static const ASN1_ADB name##_adb = {\\\n flags,\\\n offsetof(name, field),\\\n adb_cb,\\\n name##_adbtbl,\\\n sizeof(name##_adbtbl) / sizeof(ASN1_ADB_TABLE),\\\n def,\\\n none\\\n }\n\n# else\n\n# define ASN1_ADB_END(name, flags, field, adb_cb, def, none) \\\n ;\\\n static const ASN1_ITEM *name##_adb(void) \\\n { \\\n static const ASN1_ADB internal_adb = \\\n {\\\n flags,\\\n offsetof(name, field),\\\n adb_cb,\\\n name##_adbtbl,\\\n sizeof(name##_adbtbl) / sizeof(ASN1_ADB_TABLE),\\\n def,\\\n none\\\n }; \\\n return (const ASN1_ITEM *) &internal_adb; \\\n } \\\n void dummy_function(void)\n\n# endif\n\n# define ADB_ENTRY(val, template) {val, template}\n\n# define ASN1_ADB_TEMPLATE(name) \\\n static const ASN1_TEMPLATE name##_tt\n\n/*\n * This is the ASN1 template structure that defines a wrapper round the\n * actual type. It determines the actual position of the field in the value\n * structure, various flags such as OPTIONAL and the field name.\n */\n\nstruct ASN1_TEMPLATE_st {\n unsigned long flags; /* Various flags */\n long tag; /* tag, not used if no tagging */\n unsigned long offset; /* Offset of this field in structure */\n const char *field_name; /* Field name */\n ASN1_ITEM_EXP *item; /* Relevant ASN1_ITEM or ASN1_ADB */\n};\n\n/* Macro to extract ASN1_ITEM and ASN1_ADB pointer from ASN1_TEMPLATE */\n\n# define ASN1_TEMPLATE_item(t) (t->item_ptr)\n# define ASN1_TEMPLATE_adb(t) (t->item_ptr)\n\ntypedef struct ASN1_ADB_TABLE_st ASN1_ADB_TABLE;\ntypedef struct ASN1_ADB_st ASN1_ADB;\n\nstruct ASN1_ADB_st {\n unsigned long flags; /* Various flags */\n unsigned long offset; /* Offset of selector field */\n int (*adb_cb)(long *psel); /* Application callback */\n const ASN1_ADB_TABLE *tbl; /* Table of possible types */\n long tblcount; /* Number of entries in tbl */\n const ASN1_TEMPLATE *default_tt; /* Type to use if no match */\n const ASN1_TEMPLATE *null_tt; /* Type to use if selector is NULL */\n};\n\nstruct ASN1_ADB_TABLE_st {\n long value; /* NID for an object or value for an int */\n const ASN1_TEMPLATE tt; /* item for this value */\n};\n\n/* template flags */\n\n/* Field is optional */\n# define ASN1_TFLG_OPTIONAL (0x1)\n\n/* Field is a SET OF */\n# define ASN1_TFLG_SET_OF (0x1 << 1)\n\n/* Field is a SEQUENCE OF */\n# define ASN1_TFLG_SEQUENCE_OF (0x2 << 1)\n\n/*\n * Special case: this refers to a SET OF that will be sorted into DER order\n * when encoded *and* the corresponding STACK will be modified to match the\n * new order.\n */\n# define ASN1_TFLG_SET_ORDER (0x3 << 1)\n\n/* Mask for SET OF or SEQUENCE OF */\n# define ASN1_TFLG_SK_MASK (0x3 << 1)\n\n/*\n * These flags mean the tag should be taken from the tag field. If EXPLICIT\n * then the underlying type is used for the inner tag.\n */\n\n/* IMPLICIT tagging */\n# define ASN1_TFLG_IMPTAG (0x1 << 3)\n\n/* EXPLICIT tagging, inner tag from underlying type */\n# define ASN1_TFLG_EXPTAG (0x2 << 3)\n\n# define ASN1_TFLG_TAG_MASK (0x3 << 3)\n\n/* context specific IMPLICIT */\n# define ASN1_TFLG_IMPLICIT (ASN1_TFLG_IMPTAG|ASN1_TFLG_CONTEXT)\n\n/* context specific EXPLICIT */\n# define ASN1_TFLG_EXPLICIT (ASN1_TFLG_EXPTAG|ASN1_TFLG_CONTEXT)\n\n/*\n * If tagging is in force these determine the type of tag to use. Otherwise\n * the tag is determined by the underlying type. These values reflect the\n * actual octet format.\n */\n\n/* Universal tag */\n# define ASN1_TFLG_UNIVERSAL (0x0<<6)\n/* Application tag */\n# define ASN1_TFLG_APPLICATION (0x1<<6)\n/* Context specific tag */\n# define ASN1_TFLG_CONTEXT (0x2<<6)\n/* Private tag */\n# define ASN1_TFLG_PRIVATE (0x3<<6)\n\n# define ASN1_TFLG_TAG_CLASS (0x3<<6)\n\n/*\n * These are for ANY DEFINED BY type. In this case the 'item' field points to\n * an ASN1_ADB structure which contains a table of values to decode the\n * relevant type\n */\n\n# define ASN1_TFLG_ADB_MASK (0x3<<8)\n\n# define ASN1_TFLG_ADB_OID (0x1<<8)\n\n# define ASN1_TFLG_ADB_INT (0x1<<9)\n\n/*\n * This flag when present in a SEQUENCE OF, SET OF or EXPLICIT causes\n * indefinite length constructed encoding to be used if required.\n */\n\n# define ASN1_TFLG_NDEF (0x1<<11)\n\n/* Field is embedded and not a pointer */\n# define ASN1_TFLG_EMBED (0x1 << 12)\n\n/* This is the actual ASN1 item itself */\n\nstruct ASN1_ITEM_st {\n char itype; /* The item type, primitive, SEQUENCE, CHOICE\n * or extern */\n long utype; /* underlying type */\n const ASN1_TEMPLATE *templates; /* If SEQUENCE or CHOICE this contains\n * the contents */\n long tcount; /* Number of templates if SEQUENCE or CHOICE */\n const void *funcs; /* functions that handle this type */\n long size; /* Structure size (usually) */\n const char *sname; /* Structure name */\n};\n\n/*-\n * These are values for the itype field and\n * determine how the type is interpreted.\n *\n * For PRIMITIVE types the underlying type\n * determines the behaviour if items is NULL.\n *\n * Otherwise templates must contain a single\n * template and the type is treated in the\n * same way as the type specified in the template.\n *\n * For SEQUENCE types the templates field points\n * to the members, the size field is the\n * structure size.\n *\n * For CHOICE types the templates field points\n * to each possible member (typically a union)\n * and the 'size' field is the offset of the\n * selector.\n *\n * The 'funcs' field is used for application\n * specific functions.\n *\n * The EXTERN type uses a new style d2i/i2d.\n * The new style should be used where possible\n * because it avoids things like the d2i IMPLICIT\n * hack.\n *\n * MSTRING is a multiple string type, it is used\n * for a CHOICE of character strings where the\n * actual strings all occupy an ASN1_STRING\n * structure. In this case the 'utype' field\n * has a special meaning, it is used as a mask\n * of acceptable types using the B_ASN1 constants.\n *\n * NDEF_SEQUENCE is the same as SEQUENCE except\n * that it will use indefinite length constructed\n * encoding if requested.\n *\n */\n\n# define ASN1_ITYPE_PRIMITIVE 0x0\n\n# define ASN1_ITYPE_SEQUENCE 0x1\n\n# define ASN1_ITYPE_CHOICE 0x2\n\n# define ASN1_ITYPE_EXTERN 0x4\n\n# define ASN1_ITYPE_MSTRING 0x5\n\n# define ASN1_ITYPE_NDEF_SEQUENCE 0x6\n\n/*\n * Cache for ASN1 tag and length, so we don't keep re-reading it for things\n * like CHOICE\n */\n\nstruct ASN1_TLC_st {\n char valid; /* Values below are valid */\n int ret; /* return value */\n long plen; /* length */\n int ptag; /* class value */\n int pclass; /* class value */\n int hdrlen; /* header length */\n};\n\n/* Typedefs for ASN1 function pointers */\ntypedef int ASN1_ex_d2i(ASN1_VALUE **pval, const unsigned char **in, long len,\n const ASN1_ITEM *it, int tag, int aclass, char opt,\n ASN1_TLC *ctx);\n\ntypedef int ASN1_ex_i2d(ASN1_VALUE **pval, unsigned char **out,\n const ASN1_ITEM *it, int tag, int aclass);\ntypedef int ASN1_ex_new_func(ASN1_VALUE **pval, const ASN1_ITEM *it);\ntypedef void ASN1_ex_free_func(ASN1_VALUE **pval, const ASN1_ITEM *it);\n\ntypedef int ASN1_ex_print_func(BIO *out, ASN1_VALUE **pval,\n int indent, const char *fname,\n const ASN1_PCTX *pctx);\n\ntypedef int ASN1_primitive_i2c(ASN1_VALUE **pval, unsigned char *cont,\n int *putype, const ASN1_ITEM *it);\ntypedef int ASN1_primitive_c2i(ASN1_VALUE **pval, const unsigned char *cont,\n int len, int utype, char *free_cont,\n const ASN1_ITEM *it);\ntypedef int ASN1_primitive_print(BIO *out, ASN1_VALUE **pval,\n const ASN1_ITEM *it, int indent,\n const ASN1_PCTX *pctx);\n\ntypedef struct ASN1_EXTERN_FUNCS_st {\n void *app_data;\n ASN1_ex_new_func *asn1_ex_new;\n ASN1_ex_free_func *asn1_ex_free;\n ASN1_ex_free_func *asn1_ex_clear;\n ASN1_ex_d2i *asn1_ex_d2i;\n ASN1_ex_i2d *asn1_ex_i2d;\n ASN1_ex_print_func *asn1_ex_print;\n} ASN1_EXTERN_FUNCS;\n\ntypedef struct ASN1_PRIMITIVE_FUNCS_st {\n void *app_data;\n unsigned long flags;\n ASN1_ex_new_func *prim_new;\n ASN1_ex_free_func *prim_free;\n ASN1_ex_free_func *prim_clear;\n ASN1_primitive_c2i *prim_c2i;\n ASN1_primitive_i2c *prim_i2c;\n ASN1_primitive_print *prim_print;\n} ASN1_PRIMITIVE_FUNCS;\n\n/*\n * This is the ASN1_AUX structure: it handles various miscellaneous\n * requirements. For example the use of reference counts and an informational\n * callback. The \"informational callback\" is called at various points during\n * the ASN1 encoding and decoding. It can be used to provide minor\n * customisation of the structures used. This is most useful where the\n * supplied routines *almost* do the right thing but need some extra help at\n * a few points. If the callback returns zero then it is assumed a fatal\n * error has occurred and the main operation should be abandoned. If major\n * changes in the default behaviour are required then an external type is\n * more appropriate.\n */\n\ntypedef int ASN1_aux_cb(int operation, ASN1_VALUE **in, const ASN1_ITEM *it,\n void *exarg);\n\ntypedef struct ASN1_AUX_st {\n void *app_data;\n int flags;\n int ref_offset; /* Offset of reference value */\n int ref_lock; /* Lock type to use */\n ASN1_aux_cb *asn1_cb;\n int enc_offset; /* Offset of ASN1_ENCODING structure */\n} ASN1_AUX;\n\n/* For print related callbacks exarg points to this structure */\ntypedef struct ASN1_PRINT_ARG_st {\n BIO *out;\n int indent;\n const ASN1_PCTX *pctx;\n} ASN1_PRINT_ARG;\n\n/* For streaming related callbacks exarg points to this structure */\ntypedef struct ASN1_STREAM_ARG_st {\n /* BIO to stream through */\n BIO *out;\n /* BIO with filters appended */\n BIO *ndef_bio;\n /* Streaming I/O boundary */\n unsigned char **boundary;\n} ASN1_STREAM_ARG;\n\n/* Flags in ASN1_AUX */\n\n/* Use a reference count */\n# define ASN1_AFLG_REFCOUNT 1\n/* Save the encoding of structure (useful for signatures) */\n# define ASN1_AFLG_ENCODING 2\n/* The Sequence length is invalid */\n# define ASN1_AFLG_BROKEN 4\n\n/* operation values for asn1_cb */\n\n# define ASN1_OP_NEW_PRE 0\n# define ASN1_OP_NEW_POST 1\n# define ASN1_OP_FREE_PRE 2\n# define ASN1_OP_FREE_POST 3\n# define ASN1_OP_D2I_PRE 4\n# define ASN1_OP_D2I_POST 5\n# define ASN1_OP_I2D_PRE 6\n# define ASN1_OP_I2D_POST 7\n# define ASN1_OP_PRINT_PRE 8\n# define ASN1_OP_PRINT_POST 9\n# define ASN1_OP_STREAM_PRE 10\n# define ASN1_OP_STREAM_POST 11\n# define ASN1_OP_DETACHED_PRE 12\n# define ASN1_OP_DETACHED_POST 13\n\n/* Macro to implement a primitive type */\n# define IMPLEMENT_ASN1_TYPE(stname) IMPLEMENT_ASN1_TYPE_ex(stname, stname, 0)\n# define IMPLEMENT_ASN1_TYPE_ex(itname, vname, ex) \\\n ASN1_ITEM_start(itname) \\\n ASN1_ITYPE_PRIMITIVE, V_##vname, NULL, 0, NULL, ex, #itname \\\n ASN1_ITEM_end(itname)\n\n/* Macro to implement a multi string type */\n# define IMPLEMENT_ASN1_MSTRING(itname, mask) \\\n ASN1_ITEM_start(itname) \\\n ASN1_ITYPE_MSTRING, mask, NULL, 0, NULL, sizeof(ASN1_STRING), #itname \\\n ASN1_ITEM_end(itname)\n\n# define IMPLEMENT_EXTERN_ASN1(sname, tag, fptrs) \\\n ASN1_ITEM_start(sname) \\\n ASN1_ITYPE_EXTERN, \\\n tag, \\\n NULL, \\\n 0, \\\n &fptrs, \\\n 0, \\\n #sname \\\n ASN1_ITEM_end(sname)\n\n/* Macro to implement standard functions in terms of ASN1_ITEM structures */\n\n# define IMPLEMENT_ASN1_FUNCTIONS(stname) IMPLEMENT_ASN1_FUNCTIONS_fname(stname, stname, stname)\n\n# define IMPLEMENT_ASN1_FUNCTIONS_name(stname, itname) IMPLEMENT_ASN1_FUNCTIONS_fname(stname, itname, itname)\n\n# define IMPLEMENT_ASN1_FUNCTIONS_ENCODE_name(stname, itname) \\\n IMPLEMENT_ASN1_FUNCTIONS_ENCODE_fname(stname, itname, itname)\n\n# define IMPLEMENT_STATIC_ASN1_ALLOC_FUNCTIONS(stname) \\\n IMPLEMENT_ASN1_ALLOC_FUNCTIONS_pfname(static, stname, stname, stname)\n\n# define IMPLEMENT_ASN1_ALLOC_FUNCTIONS(stname) \\\n IMPLEMENT_ASN1_ALLOC_FUNCTIONS_fname(stname, stname, stname)\n\n# define IMPLEMENT_ASN1_ALLOC_FUNCTIONS_pfname(pre, stname, itname, fname) \\\n pre stname *fname##_new(void) \\\n { \\\n return (stname *)ASN1_item_new(ASN1_ITEM_rptr(itname)); \\\n } \\\n pre void fname##_free(stname *a) \\\n { \\\n ASN1_item_free((ASN1_VALUE *)a, ASN1_ITEM_rptr(itname)); \\\n }\n\n# define IMPLEMENT_ASN1_ALLOC_FUNCTIONS_fname(stname, itname, fname) \\\n stname *fname##_new(void) \\\n { \\\n return (stname *)ASN1_item_new(ASN1_ITEM_rptr(itname)); \\\n } \\\n void fname##_free(stname *a) \\\n { \\\n ASN1_item_free((ASN1_VALUE *)a, ASN1_ITEM_rptr(itname)); \\\n }\n\n# define IMPLEMENT_ASN1_FUNCTIONS_fname(stname, itname, fname) \\\n IMPLEMENT_ASN1_ENCODE_FUNCTIONS_fname(stname, itname, fname) \\\n IMPLEMENT_ASN1_ALLOC_FUNCTIONS_fname(stname, itname, fname)\n\n# define IMPLEMENT_ASN1_ENCODE_FUNCTIONS_fname(stname, itname, fname) \\\n stname *d2i_##fname(stname **a, const unsigned char **in, long len) \\\n { \\\n return (stname *)ASN1_item_d2i((ASN1_VALUE **)a, in, len, ASN1_ITEM_rptr(itname));\\\n } \\\n int i2d_##fname(stname *a, unsigned char **out) \\\n { \\\n return ASN1_item_i2d((ASN1_VALUE *)a, out, ASN1_ITEM_rptr(itname));\\\n }\n\n# define IMPLEMENT_ASN1_NDEF_FUNCTION(stname) \\\n int i2d_##stname##_NDEF(stname *a, unsigned char **out) \\\n { \\\n return ASN1_item_ndef_i2d((ASN1_VALUE *)a, out, ASN1_ITEM_rptr(stname));\\\n }\n\n# define IMPLEMENT_STATIC_ASN1_ENCODE_FUNCTIONS(stname) \\\n static stname *d2i_##stname(stname **a, \\\n const unsigned char **in, long len) \\\n { \\\n return (stname *)ASN1_item_d2i((ASN1_VALUE **)a, in, len, \\\n ASN1_ITEM_rptr(stname)); \\\n } \\\n static int i2d_##stname(stname *a, unsigned char **out) \\\n { \\\n return ASN1_item_i2d((ASN1_VALUE *)a, out, \\\n ASN1_ITEM_rptr(stname)); \\\n }\n\n/*\n * This includes evil casts to remove const: they will go away when full ASN1\n * constification is done.\n */\n# define IMPLEMENT_ASN1_ENCODE_FUNCTIONS_const_fname(stname, itname, fname) \\\n stname *d2i_##fname(stname **a, const unsigned char **in, long len) \\\n { \\\n return (stname *)ASN1_item_d2i((ASN1_VALUE **)a, in, len, ASN1_ITEM_rptr(itname));\\\n } \\\n int i2d_##fname(const stname *a, unsigned char **out) \\\n { \\\n return ASN1_item_i2d((ASN1_VALUE *)a, out, ASN1_ITEM_rptr(itname));\\\n }\n\n# define IMPLEMENT_ASN1_DUP_FUNCTION(stname) \\\n stname * stname##_dup(stname *x) \\\n { \\\n return ASN1_item_dup(ASN1_ITEM_rptr(stname), x); \\\n }\n\n# define IMPLEMENT_ASN1_PRINT_FUNCTION(stname) \\\n IMPLEMENT_ASN1_PRINT_FUNCTION_fname(stname, stname, stname)\n\n# define IMPLEMENT_ASN1_PRINT_FUNCTION_fname(stname, itname, fname) \\\n int fname##_print_ctx(BIO *out, stname *x, int indent, \\\n const ASN1_PCTX *pctx) \\\n { \\\n return ASN1_item_print(out, (ASN1_VALUE *)x, indent, \\\n ASN1_ITEM_rptr(itname), pctx); \\\n }\n\n# define IMPLEMENT_ASN1_FUNCTIONS_const(name) \\\n IMPLEMENT_ASN1_FUNCTIONS_const_fname(name, name, name)\n\n# define IMPLEMENT_ASN1_FUNCTIONS_const_fname(stname, itname, fname) \\\n IMPLEMENT_ASN1_ENCODE_FUNCTIONS_const_fname(stname, itname, fname) \\\n IMPLEMENT_ASN1_ALLOC_FUNCTIONS_fname(stname, itname, fname)\n\n/* external definitions for primitive types */\n\nDECLARE_ASN1_ITEM(ASN1_BOOLEAN)\nDECLARE_ASN1_ITEM(ASN1_TBOOLEAN)\nDECLARE_ASN1_ITEM(ASN1_FBOOLEAN)\nDECLARE_ASN1_ITEM(ASN1_SEQUENCE)\nDECLARE_ASN1_ITEM(CBIGNUM)\nDECLARE_ASN1_ITEM(BIGNUM)\nDECLARE_ASN1_ITEM(INT32)\nDECLARE_ASN1_ITEM(ZINT32)\nDECLARE_ASN1_ITEM(UINT32)\nDECLARE_ASN1_ITEM(ZUINT32)\nDECLARE_ASN1_ITEM(INT64)\nDECLARE_ASN1_ITEM(ZINT64)\nDECLARE_ASN1_ITEM(UINT64)\nDECLARE_ASN1_ITEM(ZUINT64)\n\n# if OPENSSL_API_COMPAT < 0x10200000L\n/*\n * LONG and ZLONG are strongly discouraged for use as stored data, as the\n * underlying C type (long) differs in size depending on the architecture.\n * They are designed with 32-bit longs in mind.\n */\nDECLARE_ASN1_ITEM(LONG)\nDECLARE_ASN1_ITEM(ZLONG)\n# endif\n\nDEFINE_STACK_OF(ASN1_VALUE)\n\n/* Functions used internally by the ASN1 code */\n\nint ASN1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it);\nvoid ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it);\n\nint ASN1_item_ex_d2i(ASN1_VALUE **pval, const unsigned char **in, long len,\n const ASN1_ITEM *it, int tag, int aclass, char opt,\n ASN1_TLC *ctx);\n\nint ASN1_item_ex_i2d(ASN1_VALUE **pval, unsigned char **out,\n const ASN1_ITEM *it, int tag, int aclass);\n\n#ifdef __cplusplus\n}\n#endif\n#endif\n" }, { "path": "cryptomini/include/openssl/async.h", "content": "/*\n * Copyright 2015-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\n#ifndef HEADER_ASYNC_H\n# define HEADER_ASYNC_H\n\n#if defined(_WIN32)\n# if defined(BASETYPES) || defined(_WINDEF_H)\n/* application has to include to use this */\n#define OSSL_ASYNC_FD HANDLE\n#define OSSL_BAD_ASYNC_FD INVALID_HANDLE_VALUE\n# endif\n#else\n#define OSSL_ASYNC_FD int\n#define OSSL_BAD_ASYNC_FD -1\n#endif\n# include \n\n\n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\ntypedef struct async_job_st ASYNC_JOB;\ntypedef struct async_wait_ctx_st ASYNC_WAIT_CTX;\n\n#define ASYNC_ERR 0\n#define ASYNC_NO_JOBS 1\n#define ASYNC_PAUSE 2\n#define ASYNC_FINISH 3\n\nint ASYNC_init_thread(size_t max_size, size_t init_size);\nvoid ASYNC_cleanup_thread(void);\n\n#ifdef OSSL_ASYNC_FD\nASYNC_WAIT_CTX *ASYNC_WAIT_CTX_new(void);\nvoid ASYNC_WAIT_CTX_free(ASYNC_WAIT_CTX *ctx);\nint ASYNC_WAIT_CTX_set_wait_fd(ASYNC_WAIT_CTX *ctx, const void *key,\n OSSL_ASYNC_FD fd,\n void *custom_data,\n void (*cleanup)(ASYNC_WAIT_CTX *, const void *,\n OSSL_ASYNC_FD, void *));\nint ASYNC_WAIT_CTX_get_fd(ASYNC_WAIT_CTX *ctx, const void *key,\n OSSL_ASYNC_FD *fd, void **custom_data);\nint ASYNC_WAIT_CTX_get_all_fds(ASYNC_WAIT_CTX *ctx, OSSL_ASYNC_FD *fd,\n size_t *numfds);\nint ASYNC_WAIT_CTX_get_changed_fds(ASYNC_WAIT_CTX *ctx, OSSL_ASYNC_FD *addfd,\n size_t *numaddfds, OSSL_ASYNC_FD *delfd,\n size_t *numdelfds);\nint ASYNC_WAIT_CTX_clear_fd(ASYNC_WAIT_CTX *ctx, const void *key);\n#endif\n\nint ASYNC_is_capable(void);\n\nint ASYNC_start_job(ASYNC_JOB **job, ASYNC_WAIT_CTX *ctx, int *ret,\n int (*func)(void *), void *args, size_t size);\nint ASYNC_pause_job(void);\n\nASYNC_JOB *ASYNC_get_current_job(void);\nASYNC_WAIT_CTX *ASYNC_get_wait_ctx(ASYNC_JOB *job);\nvoid ASYNC_block_pause(void);\nvoid ASYNC_unblock_pause(void);\n\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/asyncerr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_ASYNCERR_H\n# define HEADER_ASYNCERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_ASYNC_strings(void);\n\n/*\n * ASYNC function codes.\n */\n# define ASYNC_F_ASYNC_CTX_NEW 100\n# define ASYNC_F_ASYNC_INIT_THREAD 101\n# define ASYNC_F_ASYNC_JOB_NEW 102\n# define ASYNC_F_ASYNC_PAUSE_JOB 103\n# define ASYNC_F_ASYNC_START_FUNC 104\n# define ASYNC_F_ASYNC_START_JOB 105\n# define ASYNC_F_ASYNC_WAIT_CTX_SET_WAIT_FD 106\n\n/*\n * ASYNC reason codes.\n */\n# define ASYNC_R_FAILED_TO_SET_POOL 101\n# define ASYNC_R_FAILED_TO_SWAP_CONTEXT 102\n# define ASYNC_R_INIT_FAILED 105\n# define ASYNC_R_INVALID_POOL_SIZE 103\n\n#endif\n" }, { "path": "cryptomini/include/openssl/bio.h", "content": "/*\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_BIO_H\n# define HEADER_BIO_H\n\n# include \n\n# ifndef OPENSSL_NO_STDIO\n# include \n# endif\n# include \n\n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/* There are the classes of BIOs */\n# define BIO_TYPE_DESCRIPTOR 0x0100 /* socket, fd, connect or accept */\n# define BIO_TYPE_FILTER 0x0200\n# define BIO_TYPE_SOURCE_SINK 0x0400\n\n/* These are the 'types' of BIOs */\n# define BIO_TYPE_NONE 0\n# define BIO_TYPE_MEM ( 1|BIO_TYPE_SOURCE_SINK)\n# define BIO_TYPE_FILE ( 2|BIO_TYPE_SOURCE_SINK)\n\n# define BIO_TYPE_FD ( 4|BIO_TYPE_SOURCE_SINK|BIO_TYPE_DESCRIPTOR)\n# define BIO_TYPE_SOCKET ( 5|BIO_TYPE_SOURCE_SINK|BIO_TYPE_DESCRIPTOR)\n# define BIO_TYPE_NULL ( 6|BIO_TYPE_SOURCE_SINK)\n# define BIO_TYPE_SSL ( 7|BIO_TYPE_FILTER)\n# define BIO_TYPE_MD ( 8|BIO_TYPE_FILTER)\n# define BIO_TYPE_BUFFER ( 9|BIO_TYPE_FILTER)\n# define BIO_TYPE_CIPHER (10|BIO_TYPE_FILTER)\n# define BIO_TYPE_BASE64 (11|BIO_TYPE_FILTER)\n# define BIO_TYPE_CONNECT (12|BIO_TYPE_SOURCE_SINK|BIO_TYPE_DESCRIPTOR)\n# define BIO_TYPE_ACCEPT (13|BIO_TYPE_SOURCE_SINK|BIO_TYPE_DESCRIPTOR)\n\n# define BIO_TYPE_NBIO_TEST (16|BIO_TYPE_FILTER)/* server proxy BIO */\n# define BIO_TYPE_NULL_FILTER (17|BIO_TYPE_FILTER)\n# define BIO_TYPE_BIO (19|BIO_TYPE_SOURCE_SINK)/* half a BIO pair */\n# define BIO_TYPE_LINEBUFFER (20|BIO_TYPE_FILTER)\n# define BIO_TYPE_DGRAM (21|BIO_TYPE_SOURCE_SINK|BIO_TYPE_DESCRIPTOR)\n# define BIO_TYPE_ASN1 (22|BIO_TYPE_FILTER)\n# define BIO_TYPE_COMP (23|BIO_TYPE_FILTER)\n# ifndef OPENSSL_NO_SCTP\n# define BIO_TYPE_DGRAM_SCTP (24|BIO_TYPE_SOURCE_SINK|BIO_TYPE_DESCRIPTOR)\n# endif\n\n#define BIO_TYPE_START 128\n\n/*\n * BIO_FILENAME_READ|BIO_CLOSE to open or close on free.\n * BIO_set_fp(in,stdin,BIO_NOCLOSE);\n */\n# define BIO_NOCLOSE 0x00\n# define BIO_CLOSE 0x01\n\n/*\n * These are used in the following macros and are passed to BIO_ctrl()\n */\n# define BIO_CTRL_RESET 1/* opt - rewind/zero etc */\n# define BIO_CTRL_EOF 2/* opt - are we at the eof */\n# define BIO_CTRL_INFO 3/* opt - extra tit-bits */\n# define BIO_CTRL_SET 4/* man - set the 'IO' type */\n# define BIO_CTRL_GET 5/* man - get the 'IO' type */\n# define BIO_CTRL_PUSH 6/* opt - internal, used to signify change */\n# define BIO_CTRL_POP 7/* opt - internal, used to signify change */\n# define BIO_CTRL_GET_CLOSE 8/* man - set the 'close' on free */\n# define BIO_CTRL_SET_CLOSE 9/* man - set the 'close' on free */\n# define BIO_CTRL_PENDING 10/* opt - is their more data buffered */\n# define BIO_CTRL_FLUSH 11/* opt - 'flush' buffered output */\n# define BIO_CTRL_DUP 12/* man - extra stuff for 'duped' BIO */\n# define BIO_CTRL_WPENDING 13/* opt - number of bytes still to write */\n# define BIO_CTRL_SET_CALLBACK 14/* opt - set callback function */\n# define BIO_CTRL_GET_CALLBACK 15/* opt - set callback function */\n\n# define BIO_CTRL_PEEK 29/* BIO_f_buffer special */\n# define BIO_CTRL_SET_FILENAME 30/* BIO_s_file special */\n\n/* dgram BIO stuff */\n# define BIO_CTRL_DGRAM_CONNECT 31/* BIO dgram special */\n# define BIO_CTRL_DGRAM_SET_CONNECTED 32/* allow for an externally connected\n * socket to be passed in */\n# define BIO_CTRL_DGRAM_SET_RECV_TIMEOUT 33/* setsockopt, essentially */\n# define BIO_CTRL_DGRAM_GET_RECV_TIMEOUT 34/* getsockopt, essentially */\n# define BIO_CTRL_DGRAM_SET_SEND_TIMEOUT 35/* setsockopt, essentially */\n# define BIO_CTRL_DGRAM_GET_SEND_TIMEOUT 36/* getsockopt, essentially */\n\n# define BIO_CTRL_DGRAM_GET_RECV_TIMER_EXP 37/* flag whether the last */\n# define BIO_CTRL_DGRAM_GET_SEND_TIMER_EXP 38/* I/O operation tiemd out */\n\n/* #ifdef IP_MTU_DISCOVER */\n# define BIO_CTRL_DGRAM_MTU_DISCOVER 39/* set DF bit on egress packets */\n/* #endif */\n\n# define BIO_CTRL_DGRAM_QUERY_MTU 40/* as kernel for current MTU */\n# define BIO_CTRL_DGRAM_GET_FALLBACK_MTU 47\n# define BIO_CTRL_DGRAM_GET_MTU 41/* get cached value for MTU */\n# define BIO_CTRL_DGRAM_SET_MTU 42/* set cached value for MTU.\n * want to use this if asking\n * the kernel fails */\n\n# define BIO_CTRL_DGRAM_MTU_EXCEEDED 43/* check whether the MTU was\n * exceed in the previous write\n * operation */\n\n# define BIO_CTRL_DGRAM_GET_PEER 46\n# define BIO_CTRL_DGRAM_SET_PEER 44/* Destination for the data */\n\n# define BIO_CTRL_DGRAM_SET_NEXT_TIMEOUT 45/* Next DTLS handshake timeout\n * to adjust socket timeouts */\n# define BIO_CTRL_DGRAM_SET_DONT_FRAG 48\n\n# define BIO_CTRL_DGRAM_GET_MTU_OVERHEAD 49\n\n/* Deliberately outside of OPENSSL_NO_SCTP - used in bss_dgram.c */\n# define BIO_CTRL_DGRAM_SCTP_SET_IN_HANDSHAKE 50\n# ifndef OPENSSL_NO_SCTP\n/* SCTP stuff */\n# define BIO_CTRL_DGRAM_SCTP_ADD_AUTH_KEY 51\n# define BIO_CTRL_DGRAM_SCTP_NEXT_AUTH_KEY 52\n# define BIO_CTRL_DGRAM_SCTP_AUTH_CCS_RCVD 53\n# define BIO_CTRL_DGRAM_SCTP_GET_SNDINFO 60\n# define BIO_CTRL_DGRAM_SCTP_SET_SNDINFO 61\n# define BIO_CTRL_DGRAM_SCTP_GET_RCVINFO 62\n# define BIO_CTRL_DGRAM_SCTP_SET_RCVINFO 63\n# define BIO_CTRL_DGRAM_SCTP_GET_PRINFO 64\n# define BIO_CTRL_DGRAM_SCTP_SET_PRINFO 65\n# define BIO_CTRL_DGRAM_SCTP_SAVE_SHUTDOWN 70\n# endif\n\n# define BIO_CTRL_DGRAM_SET_PEEK_MODE 71\n\n/* modifiers */\n# define BIO_FP_READ 0x02\n# define BIO_FP_WRITE 0x04\n# define BIO_FP_APPEND 0x08\n# define BIO_FP_TEXT 0x10\n\n# define BIO_FLAGS_READ 0x01\n# define BIO_FLAGS_WRITE 0x02\n# define BIO_FLAGS_IO_SPECIAL 0x04\n# define BIO_FLAGS_RWS (BIO_FLAGS_READ|BIO_FLAGS_WRITE|BIO_FLAGS_IO_SPECIAL)\n# define BIO_FLAGS_SHOULD_RETRY 0x08\n# ifndef BIO_FLAGS_UPLINK\n/*\n * \"UPLINK\" flag denotes file descriptors provided by application. It\n * defaults to 0, as most platforms don't require UPLINK interface.\n */\n# define BIO_FLAGS_UPLINK 0\n# endif\n\n# define BIO_FLAGS_BASE64_NO_NL 0x100\n\n/*\n * This is used with memory BIOs:\n * BIO_FLAGS_MEM_RDONLY means we shouldn't free up or change the data in any way;\n * BIO_FLAGS_NONCLEAR_RST means we shouldn't clear data on reset.\n */\n# define BIO_FLAGS_MEM_RDONLY 0x200\n# define BIO_FLAGS_NONCLEAR_RST 0x400\n# define BIO_FLAGS_IN_EOF 0x800\n\ntypedef union bio_addr_st BIO_ADDR;\ntypedef struct bio_addrinfo_st BIO_ADDRINFO;\n\nint BIO_get_new_index(void);\nvoid BIO_set_flags(BIO *b, int flags);\nint BIO_test_flags(const BIO *b, int flags);\nvoid BIO_clear_flags(BIO *b, int flags);\n\n# define BIO_get_flags(b) BIO_test_flags(b, ~(0x0))\n# define BIO_set_retry_special(b) \\\n BIO_set_flags(b, (BIO_FLAGS_IO_SPECIAL|BIO_FLAGS_SHOULD_RETRY))\n# define BIO_set_retry_read(b) \\\n BIO_set_flags(b, (BIO_FLAGS_READ|BIO_FLAGS_SHOULD_RETRY))\n# define BIO_set_retry_write(b) \\\n BIO_set_flags(b, (BIO_FLAGS_WRITE|BIO_FLAGS_SHOULD_RETRY))\n\n/* These are normally used internally in BIOs */\n# define BIO_clear_retry_flags(b) \\\n BIO_clear_flags(b, (BIO_FLAGS_RWS|BIO_FLAGS_SHOULD_RETRY))\n# define BIO_get_retry_flags(b) \\\n BIO_test_flags(b, (BIO_FLAGS_RWS|BIO_FLAGS_SHOULD_RETRY))\n\n/* These should be used by the application to tell why we should retry */\n# define BIO_should_read(a) BIO_test_flags(a, BIO_FLAGS_READ)\n# define BIO_should_write(a) BIO_test_flags(a, BIO_FLAGS_WRITE)\n# define BIO_should_io_special(a) BIO_test_flags(a, BIO_FLAGS_IO_SPECIAL)\n# define BIO_retry_type(a) BIO_test_flags(a, BIO_FLAGS_RWS)\n# define BIO_should_retry(a) BIO_test_flags(a, BIO_FLAGS_SHOULD_RETRY)\n\n/*\n * The next three are used in conjunction with the BIO_should_io_special()\n * condition. After this returns true, BIO *BIO_get_retry_BIO(BIO *bio, int\n * *reason); will walk the BIO stack and return the 'reason' for the special\n * and the offending BIO. Given a BIO, BIO_get_retry_reason(bio) will return\n * the code.\n */\n/*\n * Returned from the SSL bio when the certificate retrieval code had an error\n */\n# define BIO_RR_SSL_X509_LOOKUP 0x01\n/* Returned from the connect BIO when a connect would have blocked */\n# define BIO_RR_CONNECT 0x02\n/* Returned from the accept BIO when an accept would have blocked */\n# define BIO_RR_ACCEPT 0x03\n\n/* These are passed by the BIO callback */\n# define BIO_CB_FREE 0x01\n# define BIO_CB_READ 0x02\n# define BIO_CB_WRITE 0x03\n# define BIO_CB_PUTS 0x04\n# define BIO_CB_GETS 0x05\n# define BIO_CB_CTRL 0x06\n\n/*\n * The callback is called before and after the underling operation, The\n * BIO_CB_RETURN flag indicates if it is after the call\n */\n# define BIO_CB_RETURN 0x80\n# define BIO_CB_return(a) ((a)|BIO_CB_RETURN)\n# define BIO_cb_pre(a) (!((a)&BIO_CB_RETURN))\n# define BIO_cb_post(a) ((a)&BIO_CB_RETURN)\n\ntypedef long (*BIO_callback_fn)(BIO *b, int oper, const char *argp, int argi,\n long argl, long ret);\ntypedef long (*BIO_callback_fn_ex)(BIO *b, int oper, const char *argp,\n size_t len, int argi,\n long argl, int ret, size_t *processed);\nBIO_callback_fn BIO_get_callback(const BIO *b);\nvoid BIO_set_callback(BIO *b, BIO_callback_fn callback);\n\nBIO_callback_fn_ex BIO_get_callback_ex(const BIO *b);\nvoid BIO_set_callback_ex(BIO *b, BIO_callback_fn_ex callback);\n\nchar *BIO_get_callback_arg(const BIO *b);\nvoid BIO_set_callback_arg(BIO *b, char *arg);\n\ntypedef struct bio_method_st BIO_METHOD;\n\nconst char *BIO_method_name(const BIO *b);\nint BIO_method_type(const BIO *b);\n\ntypedef int BIO_info_cb(BIO *, int, int);\ntypedef BIO_info_cb bio_info_cb; /* backward compatibility */\n\nDEFINE_STACK_OF(BIO)\n\n/* Prefix and suffix callback in ASN1 BIO */\ntypedef int asn1_ps_func (BIO *b, unsigned char **pbuf, int *plen,\n void *parg);\n\n# ifndef OPENSSL_NO_SCTP\n/* SCTP parameter structs */\nstruct bio_dgram_sctp_sndinfo {\n uint16_t snd_sid;\n uint16_t snd_flags;\n uint32_t snd_ppid;\n uint32_t snd_context;\n};\n\nstruct bio_dgram_sctp_rcvinfo {\n uint16_t rcv_sid;\n uint16_t rcv_ssn;\n uint16_t rcv_flags;\n uint32_t rcv_ppid;\n uint32_t rcv_tsn;\n uint32_t rcv_cumtsn;\n uint32_t rcv_context;\n};\n\nstruct bio_dgram_sctp_prinfo {\n uint16_t pr_policy;\n uint32_t pr_value;\n};\n# endif\n\n/*\n * #define BIO_CONN_get_param_hostname BIO_ctrl\n */\n\n# define BIO_C_SET_CONNECT 100\n# define BIO_C_DO_STATE_MACHINE 101\n# define BIO_C_SET_NBIO 102\n/* # define BIO_C_SET_PROXY_PARAM 103 */\n# define BIO_C_SET_FD 104\n# define BIO_C_GET_FD 105\n# define BIO_C_SET_FILE_PTR 106\n# define BIO_C_GET_FILE_PTR 107\n# define BIO_C_SET_FILENAME 108\n# define BIO_C_SET_SSL 109\n# define BIO_C_GET_SSL 110\n# define BIO_C_SET_MD 111\n# define BIO_C_GET_MD 112\n# define BIO_C_GET_CIPHER_STATUS 113\n# define BIO_C_SET_BUF_MEM 114\n# define BIO_C_GET_BUF_MEM_PTR 115\n# define BIO_C_GET_BUFF_NUM_LINES 116\n# define BIO_C_SET_BUFF_SIZE 117\n# define BIO_C_SET_ACCEPT 118\n# define BIO_C_SSL_MODE 119\n# define BIO_C_GET_MD_CTX 120\n/* # define BIO_C_GET_PROXY_PARAM 121 */\n# define BIO_C_SET_BUFF_READ_DATA 122/* data to read first */\n# define BIO_C_GET_CONNECT 123\n# define BIO_C_GET_ACCEPT 124\n# define BIO_C_SET_SSL_RENEGOTIATE_BYTES 125\n# define BIO_C_GET_SSL_NUM_RENEGOTIATES 126\n# define BIO_C_SET_SSL_RENEGOTIATE_TIMEOUT 127\n# define BIO_C_FILE_SEEK 128\n# define BIO_C_GET_CIPHER_CTX 129\n# define BIO_C_SET_BUF_MEM_EOF_RETURN 130/* return end of input\n * value */\n# define BIO_C_SET_BIND_MODE 131\n# define BIO_C_GET_BIND_MODE 132\n# define BIO_C_FILE_TELL 133\n# define BIO_C_GET_SOCKS 134\n# define BIO_C_SET_SOCKS 135\n\n# define BIO_C_SET_WRITE_BUF_SIZE 136/* for BIO_s_bio */\n# define BIO_C_GET_WRITE_BUF_SIZE 137\n# define BIO_C_MAKE_BIO_PAIR 138\n# define BIO_C_DESTROY_BIO_PAIR 139\n# define BIO_C_GET_WRITE_GUARANTEE 140\n# define BIO_C_GET_READ_REQUEST 141\n# define BIO_C_SHUTDOWN_WR 142\n# define BIO_C_NREAD0 143\n# define BIO_C_NREAD 144\n# define BIO_C_NWRITE0 145\n# define BIO_C_NWRITE 146\n# define BIO_C_RESET_READ_REQUEST 147\n# define BIO_C_SET_MD_CTX 148\n\n# define BIO_C_SET_PREFIX 149\n# define BIO_C_GET_PREFIX 150\n# define BIO_C_SET_SUFFIX 151\n# define BIO_C_GET_SUFFIX 152\n\n# define BIO_C_SET_EX_ARG 153\n# define BIO_C_GET_EX_ARG 154\n\n# define BIO_C_SET_CONNECT_MODE 155\n\n# define BIO_set_app_data(s,arg) BIO_set_ex_data(s,0,arg)\n# define BIO_get_app_data(s) BIO_get_ex_data(s,0)\n\n# define BIO_set_nbio(b,n) BIO_ctrl(b,BIO_C_SET_NBIO,(n),NULL)\n\n# ifndef OPENSSL_NO_SOCK\n/* IP families we support, for BIO_s_connect() and BIO_s_accept() */\n/* Note: the underlying operating system may not support some of them */\n# define BIO_FAMILY_IPV4 4\n# define BIO_FAMILY_IPV6 6\n# define BIO_FAMILY_IPANY 256\n\n/* BIO_s_connect() */\n# define BIO_set_conn_hostname(b,name) BIO_ctrl(b,BIO_C_SET_CONNECT,0, \\\n (char *)(name))\n# define BIO_set_conn_port(b,port) BIO_ctrl(b,BIO_C_SET_CONNECT,1, \\\n (char *)(port))\n# define BIO_set_conn_address(b,addr) BIO_ctrl(b,BIO_C_SET_CONNECT,2, \\\n (char *)(addr))\n# define BIO_set_conn_ip_family(b,f) BIO_int_ctrl(b,BIO_C_SET_CONNECT,3,f)\n# define BIO_get_conn_hostname(b) ((const char *)BIO_ptr_ctrl(b,BIO_C_GET_CONNECT,0))\n# define BIO_get_conn_port(b) ((const char *)BIO_ptr_ctrl(b,BIO_C_GET_CONNECT,1))\n# define BIO_get_conn_address(b) ((const BIO_ADDR *)BIO_ptr_ctrl(b,BIO_C_GET_CONNECT,2))\n# define BIO_get_conn_ip_family(b) BIO_ctrl(b,BIO_C_GET_CONNECT,3,NULL)\n# define BIO_set_conn_mode(b,n) BIO_ctrl(b,BIO_C_SET_CONNECT_MODE,(n),NULL)\n\n/* BIO_s_accept() */\n# define BIO_set_accept_name(b,name) BIO_ctrl(b,BIO_C_SET_ACCEPT,0, \\\n (char *)(name))\n# define BIO_set_accept_port(b,port) BIO_ctrl(b,BIO_C_SET_ACCEPT,1, \\\n (char *)(port))\n# define BIO_get_accept_name(b) ((const char *)BIO_ptr_ctrl(b,BIO_C_GET_ACCEPT,0))\n# define BIO_get_accept_port(b) ((const char *)BIO_ptr_ctrl(b,BIO_C_GET_ACCEPT,1))\n# define BIO_get_peer_name(b) ((const char *)BIO_ptr_ctrl(b,BIO_C_GET_ACCEPT,2))\n# define BIO_get_peer_port(b) ((const char *)BIO_ptr_ctrl(b,BIO_C_GET_ACCEPT,3))\n/* #define BIO_set_nbio(b,n) BIO_ctrl(b,BIO_C_SET_NBIO,(n),NULL) */\n# define BIO_set_nbio_accept(b,n) BIO_ctrl(b,BIO_C_SET_ACCEPT,2,(n)?(void *)\"a\":NULL)\n# define BIO_set_accept_bios(b,bio) BIO_ctrl(b,BIO_C_SET_ACCEPT,3, \\\n (char *)(bio))\n# define BIO_set_accept_ip_family(b,f) BIO_int_ctrl(b,BIO_C_SET_ACCEPT,4,f)\n# define BIO_get_accept_ip_family(b) BIO_ctrl(b,BIO_C_GET_ACCEPT,4,NULL)\n\n/* Aliases kept for backward compatibility */\n# define BIO_BIND_NORMAL 0\n# define BIO_BIND_REUSEADDR BIO_SOCK_REUSEADDR\n# define BIO_BIND_REUSEADDR_IF_UNUSED BIO_SOCK_REUSEADDR\n# define BIO_set_bind_mode(b,mode) BIO_ctrl(b,BIO_C_SET_BIND_MODE,mode,NULL)\n# define BIO_get_bind_mode(b) BIO_ctrl(b,BIO_C_GET_BIND_MODE,0,NULL)\n\n/* BIO_s_accept() and BIO_s_connect() */\n# define BIO_do_connect(b) BIO_do_handshake(b)\n# define BIO_do_accept(b) BIO_do_handshake(b)\n# endif /* OPENSSL_NO_SOCK */\n\n# define BIO_do_handshake(b) BIO_ctrl(b,BIO_C_DO_STATE_MACHINE,0,NULL)\n\n/* BIO_s_datagram(), BIO_s_fd(), BIO_s_socket(), BIO_s_accept() and BIO_s_connect() */\n# define BIO_set_fd(b,fd,c) BIO_int_ctrl(b,BIO_C_SET_FD,c,fd)\n# define BIO_get_fd(b,c) BIO_ctrl(b,BIO_C_GET_FD,0,(char *)(c))\n\n/* BIO_s_file() */\n# define BIO_set_fp(b,fp,c) BIO_ctrl(b,BIO_C_SET_FILE_PTR,c,(char *)(fp))\n# define BIO_get_fp(b,fpp) BIO_ctrl(b,BIO_C_GET_FILE_PTR,0,(char *)(fpp))\n\n/* BIO_s_fd() and BIO_s_file() */\n# define BIO_seek(b,ofs) (int)BIO_ctrl(b,BIO_C_FILE_SEEK,ofs,NULL)\n# define BIO_tell(b) (int)BIO_ctrl(b,BIO_C_FILE_TELL,0,NULL)\n\n/*\n * name is cast to lose const, but might be better to route through a\n * function so we can do it safely\n */\n# ifdef CONST_STRICT\n/*\n * If you are wondering why this isn't defined, its because CONST_STRICT is\n * purely a compile-time kludge to allow const to be checked.\n */\nint BIO_read_filename(BIO *b, const char *name);\n# else\n# define BIO_read_filename(b,name) (int)BIO_ctrl(b,BIO_C_SET_FILENAME, \\\n BIO_CLOSE|BIO_FP_READ,(char *)(name))\n# endif\n# define BIO_write_filename(b,name) (int)BIO_ctrl(b,BIO_C_SET_FILENAME, \\\n BIO_CLOSE|BIO_FP_WRITE,name)\n# define BIO_append_filename(b,name) (int)BIO_ctrl(b,BIO_C_SET_FILENAME, \\\n BIO_CLOSE|BIO_FP_APPEND,name)\n# define BIO_rw_filename(b,name) (int)BIO_ctrl(b,BIO_C_SET_FILENAME, \\\n BIO_CLOSE|BIO_FP_READ|BIO_FP_WRITE,name)\n\n/*\n * WARNING WARNING, this ups the reference count on the read bio of the SSL\n * structure. This is because the ssl read BIO is now pointed to by the\n * next_bio field in the bio. So when you free the BIO, make sure you are\n * doing a BIO_free_all() to catch the underlying BIO.\n */\n# define BIO_set_ssl(b,ssl,c) BIO_ctrl(b,BIO_C_SET_SSL,c,(char *)(ssl))\n# define BIO_get_ssl(b,sslp) BIO_ctrl(b,BIO_C_GET_SSL,0,(char *)(sslp))\n# define BIO_set_ssl_mode(b,client) BIO_ctrl(b,BIO_C_SSL_MODE,client,NULL)\n# define BIO_set_ssl_renegotiate_bytes(b,num) \\\n BIO_ctrl(b,BIO_C_SET_SSL_RENEGOTIATE_BYTES,num,NULL)\n# define BIO_get_num_renegotiates(b) \\\n BIO_ctrl(b,BIO_C_GET_SSL_NUM_RENEGOTIATES,0,NULL)\n# define BIO_set_ssl_renegotiate_timeout(b,seconds) \\\n BIO_ctrl(b,BIO_C_SET_SSL_RENEGOTIATE_TIMEOUT,seconds,NULL)\n\n/* defined in evp.h */\n/* #define BIO_set_md(b,md) BIO_ctrl(b,BIO_C_SET_MD,1,(char *)(md)) */\n\n# define BIO_get_mem_data(b,pp) BIO_ctrl(b,BIO_CTRL_INFO,0,(char *)(pp))\n# define BIO_set_mem_buf(b,bm,c) BIO_ctrl(b,BIO_C_SET_BUF_MEM,c,(char *)(bm))\n# define BIO_get_mem_ptr(b,pp) BIO_ctrl(b,BIO_C_GET_BUF_MEM_PTR,0, \\\n (char *)(pp))\n# define BIO_set_mem_eof_return(b,v) \\\n BIO_ctrl(b,BIO_C_SET_BUF_MEM_EOF_RETURN,v,NULL)\n\n/* For the BIO_f_buffer() type */\n# define BIO_get_buffer_num_lines(b) BIO_ctrl(b,BIO_C_GET_BUFF_NUM_LINES,0,NULL)\n# define BIO_set_buffer_size(b,size) BIO_ctrl(b,BIO_C_SET_BUFF_SIZE,size,NULL)\n# define BIO_set_read_buffer_size(b,size) BIO_int_ctrl(b,BIO_C_SET_BUFF_SIZE,size,0)\n# define BIO_set_write_buffer_size(b,size) BIO_int_ctrl(b,BIO_C_SET_BUFF_SIZE,size,1)\n# define BIO_set_buffer_read_data(b,buf,num) BIO_ctrl(b,BIO_C_SET_BUFF_READ_DATA,num,buf)\n\n/* Don't use the next one unless you know what you are doing :-) */\n# define BIO_dup_state(b,ret) BIO_ctrl(b,BIO_CTRL_DUP,0,(char *)(ret))\n\n# define BIO_reset(b) (int)BIO_ctrl(b,BIO_CTRL_RESET,0,NULL)\n# define BIO_eof(b) (int)BIO_ctrl(b,BIO_CTRL_EOF,0,NULL)\n# define BIO_set_close(b,c) (int)BIO_ctrl(b,BIO_CTRL_SET_CLOSE,(c),NULL)\n# define BIO_get_close(b) (int)BIO_ctrl(b,BIO_CTRL_GET_CLOSE,0,NULL)\n# define BIO_pending(b) (int)BIO_ctrl(b,BIO_CTRL_PENDING,0,NULL)\n# define BIO_wpending(b) (int)BIO_ctrl(b,BIO_CTRL_WPENDING,0,NULL)\n/* ...pending macros have inappropriate return type */\nsize_t BIO_ctrl_pending(BIO *b);\nsize_t BIO_ctrl_wpending(BIO *b);\n# define BIO_flush(b) (int)BIO_ctrl(b,BIO_CTRL_FLUSH,0,NULL)\n# define BIO_get_info_callback(b,cbp) (int)BIO_ctrl(b,BIO_CTRL_GET_CALLBACK,0, \\\n cbp)\n# define BIO_set_info_callback(b,cb) (int)BIO_callback_ctrl(b,BIO_CTRL_SET_CALLBACK,cb)\n\n/* For the BIO_f_buffer() type */\n# define BIO_buffer_get_num_lines(b) BIO_ctrl(b,BIO_CTRL_GET,0,NULL)\n# define BIO_buffer_peek(b,s,l) BIO_ctrl(b,BIO_CTRL_PEEK,(l),(s))\n\n/* For BIO_s_bio() */\n# define BIO_set_write_buf_size(b,size) (int)BIO_ctrl(b,BIO_C_SET_WRITE_BUF_SIZE,size,NULL)\n# define BIO_get_write_buf_size(b,size) (size_t)BIO_ctrl(b,BIO_C_GET_WRITE_BUF_SIZE,size,NULL)\n# define BIO_make_bio_pair(b1,b2) (int)BIO_ctrl(b1,BIO_C_MAKE_BIO_PAIR,0,b2)\n# define BIO_destroy_bio_pair(b) (int)BIO_ctrl(b,BIO_C_DESTROY_BIO_PAIR,0,NULL)\n# define BIO_shutdown_wr(b) (int)BIO_ctrl(b, BIO_C_SHUTDOWN_WR, 0, NULL)\n/* macros with inappropriate type -- but ...pending macros use int too: */\n# define BIO_get_write_guarantee(b) (int)BIO_ctrl(b,BIO_C_GET_WRITE_GUARANTEE,0,NULL)\n# define BIO_get_read_request(b) (int)BIO_ctrl(b,BIO_C_GET_READ_REQUEST,0,NULL)\nsize_t BIO_ctrl_get_write_guarantee(BIO *b);\nsize_t BIO_ctrl_get_read_request(BIO *b);\nint BIO_ctrl_reset_read_request(BIO *b);\n\n/* ctrl macros for dgram */\n# define BIO_ctrl_dgram_connect(b,peer) \\\n (int)BIO_ctrl(b,BIO_CTRL_DGRAM_CONNECT,0, (char *)(peer))\n# define BIO_ctrl_set_connected(b,peer) \\\n (int)BIO_ctrl(b, BIO_CTRL_DGRAM_SET_CONNECTED, 0, (char *)(peer))\n# define BIO_dgram_recv_timedout(b) \\\n (int)BIO_ctrl(b, BIO_CTRL_DGRAM_GET_RECV_TIMER_EXP, 0, NULL)\n# define BIO_dgram_send_timedout(b) \\\n (int)BIO_ctrl(b, BIO_CTRL_DGRAM_GET_SEND_TIMER_EXP, 0, NULL)\n# define BIO_dgram_get_peer(b,peer) \\\n (int)BIO_ctrl(b, BIO_CTRL_DGRAM_GET_PEER, 0, (char *)(peer))\n# define BIO_dgram_set_peer(b,peer) \\\n (int)BIO_ctrl(b, BIO_CTRL_DGRAM_SET_PEER, 0, (char *)(peer))\n# define BIO_dgram_get_mtu_overhead(b) \\\n (unsigned int)BIO_ctrl((b), BIO_CTRL_DGRAM_GET_MTU_OVERHEAD, 0, NULL)\n\n#define BIO_get_ex_new_index(l, p, newf, dupf, freef) \\\n CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_BIO, l, p, newf, dupf, freef)\nint BIO_set_ex_data(BIO *bio, int idx, void *data);\nvoid *BIO_get_ex_data(BIO *bio, int idx);\nuint64_t BIO_number_read(BIO *bio);\nuint64_t BIO_number_written(BIO *bio);\n\n/* For BIO_f_asn1() */\nint BIO_asn1_set_prefix(BIO *b, asn1_ps_func *prefix,\n asn1_ps_func *prefix_free);\nint BIO_asn1_get_prefix(BIO *b, asn1_ps_func **pprefix,\n asn1_ps_func **pprefix_free);\nint BIO_asn1_set_suffix(BIO *b, asn1_ps_func *suffix,\n asn1_ps_func *suffix_free);\nint BIO_asn1_get_suffix(BIO *b, asn1_ps_func **psuffix,\n asn1_ps_func **psuffix_free);\n\nconst BIO_METHOD *BIO_s_file(void);\nBIO *BIO_new_file(const char *filename, const char *mode);\n# ifndef OPENSSL_NO_STDIO\nBIO *BIO_new_fp(FILE *stream, int close_flag);\n# endif\nBIO *BIO_new(const BIO_METHOD *type);\nint BIO_free(BIO *a);\nvoid BIO_set_data(BIO *a, void *ptr);\nvoid *BIO_get_data(BIO *a);\nvoid BIO_set_init(BIO *a, int init);\nint BIO_get_init(BIO *a);\nvoid BIO_set_shutdown(BIO *a, int shut);\nint BIO_get_shutdown(BIO *a);\nvoid BIO_vfree(BIO *a);\nint BIO_up_ref(BIO *a);\nint BIO_read(BIO *b, void *data, int dlen);\nint BIO_read_ex(BIO *b, void *data, size_t dlen, size_t *readbytes);\nint BIO_gets(BIO *bp, char *buf, int size);\nint BIO_write(BIO *b, const void *data, int dlen);\nint BIO_write_ex(BIO *b, const void *data, size_t dlen, size_t *written);\nint BIO_puts(BIO *bp, const char *buf);\nint BIO_indent(BIO *b, int indent, int max);\nlong BIO_ctrl(BIO *bp, int cmd, long larg, void *parg);\nlong BIO_callback_ctrl(BIO *b, int cmd, BIO_info_cb *fp);\nvoid *BIO_ptr_ctrl(BIO *bp, int cmd, long larg);\nlong BIO_int_ctrl(BIO *bp, int cmd, long larg, int iarg);\nBIO *BIO_push(BIO *b, BIO *append);\nBIO *BIO_pop(BIO *b);\nvoid BIO_free_all(BIO *a);\nBIO *BIO_find_type(BIO *b, int bio_type);\nBIO *BIO_next(BIO *b);\nvoid BIO_set_next(BIO *b, BIO *next);\nBIO *BIO_get_retry_BIO(BIO *bio, int *reason);\nint BIO_get_retry_reason(BIO *bio);\nvoid BIO_set_retry_reason(BIO *bio, int reason);\nBIO *BIO_dup_chain(BIO *in);\n\nint BIO_nread0(BIO *bio, char **buf);\nint BIO_nread(BIO *bio, char **buf, int num);\nint BIO_nwrite0(BIO *bio, char **buf);\nint BIO_nwrite(BIO *bio, char **buf, int num);\n\nlong BIO_debug_callback(BIO *bio, int cmd, const char *argp, int argi,\n long argl, long ret);\n\nconst BIO_METHOD *BIO_s_mem(void);\nconst BIO_METHOD *BIO_s_secmem(void);\nBIO *BIO_new_mem_buf(const void *buf, int len);\n# ifndef OPENSSL_NO_SOCK\nconst BIO_METHOD *BIO_s_socket(void);\nconst BIO_METHOD *BIO_s_connect(void);\nconst BIO_METHOD *BIO_s_accept(void);\n# endif\nconst BIO_METHOD *BIO_s_fd(void);\nconst BIO_METHOD *BIO_s_log(void);\nconst BIO_METHOD *BIO_s_bio(void);\nconst BIO_METHOD *BIO_s_null(void);\nconst BIO_METHOD *BIO_f_null(void);\nconst BIO_METHOD *BIO_f_buffer(void);\nconst BIO_METHOD *BIO_f_linebuffer(void);\nconst BIO_METHOD *BIO_f_nbio_test(void);\n# ifndef OPENSSL_NO_DGRAM\nconst BIO_METHOD *BIO_s_datagram(void);\nint BIO_dgram_non_fatal_error(int error);\nBIO *BIO_new_dgram(int fd, int close_flag);\n# ifndef OPENSSL_NO_SCTP\nconst BIO_METHOD *BIO_s_datagram_sctp(void);\nBIO *BIO_new_dgram_sctp(int fd, int close_flag);\nint BIO_dgram_is_sctp(BIO *bio);\nint BIO_dgram_sctp_notification_cb(BIO *b,\n void (*handle_notifications) (BIO *bio,\n void *context,\n void *buf),\n void *context);\nint BIO_dgram_sctp_wait_for_dry(BIO *b);\nint BIO_dgram_sctp_msg_waiting(BIO *b);\n# endif\n# endif\n\n# ifndef OPENSSL_NO_SOCK\nint BIO_sock_should_retry(int i);\nint BIO_sock_non_fatal_error(int error);\n# endif\n\nint BIO_fd_should_retry(int i);\nint BIO_fd_non_fatal_error(int error);\nint BIO_dump_cb(int (*cb) (const void *data, size_t len, void *u),\n void *u, const char *s, int len);\nint BIO_dump_indent_cb(int (*cb) (const void *data, size_t len, void *u),\n void *u, const char *s, int len, int indent);\nint BIO_dump(BIO *b, const char *bytes, int len);\nint BIO_dump_indent(BIO *b, const char *bytes, int len, int indent);\n# ifndef OPENSSL_NO_STDIO\nint BIO_dump_fp(FILE *fp, const char *s, int len);\nint BIO_dump_indent_fp(FILE *fp, const char *s, int len, int indent);\n# endif\nint BIO_hex_string(BIO *out, int indent, int width, unsigned char *data,\n int datalen);\n\n# ifndef OPENSSL_NO_SOCK\nBIO_ADDR *BIO_ADDR_new(void);\nint BIO_ADDR_rawmake(BIO_ADDR *ap, int family,\n const void *where, size_t wherelen, unsigned short port);\nvoid BIO_ADDR_free(BIO_ADDR *);\nvoid BIO_ADDR_clear(BIO_ADDR *ap);\nint BIO_ADDR_family(const BIO_ADDR *ap);\nint BIO_ADDR_rawaddress(const BIO_ADDR *ap, void *p, size_t *l);\nunsigned short BIO_ADDR_rawport(const BIO_ADDR *ap);\nchar *BIO_ADDR_hostname_string(const BIO_ADDR *ap, int numeric);\nchar *BIO_ADDR_service_string(const BIO_ADDR *ap, int numeric);\nchar *BIO_ADDR_path_string(const BIO_ADDR *ap);\n\nconst BIO_ADDRINFO *BIO_ADDRINFO_next(const BIO_ADDRINFO *bai);\nint BIO_ADDRINFO_family(const BIO_ADDRINFO *bai);\nint BIO_ADDRINFO_socktype(const BIO_ADDRINFO *bai);\nint BIO_ADDRINFO_protocol(const BIO_ADDRINFO *bai);\nconst BIO_ADDR *BIO_ADDRINFO_address(const BIO_ADDRINFO *bai);\nvoid BIO_ADDRINFO_free(BIO_ADDRINFO *bai);\n\nenum BIO_hostserv_priorities {\n BIO_PARSE_PRIO_HOST, BIO_PARSE_PRIO_SERV\n};\nint BIO_parse_hostserv(const char *hostserv, char **host, char **service,\n enum BIO_hostserv_priorities hostserv_prio);\nenum BIO_lookup_type {\n BIO_LOOKUP_CLIENT, BIO_LOOKUP_SERVER\n};\nint BIO_lookup(const char *host, const char *service,\n enum BIO_lookup_type lookup_type,\n int family, int socktype, BIO_ADDRINFO **res);\nint BIO_lookup_ex(const char *host, const char *service,\n int lookup_type, int family, int socktype, int protocol,\n BIO_ADDRINFO **res);\nint BIO_sock_error(int sock);\nint BIO_socket_ioctl(int fd, long type, void *arg);\nint BIO_socket_nbio(int fd, int mode);\nint BIO_sock_init(void);\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define BIO_sock_cleanup() while(0) continue\n# endif\nint BIO_set_tcp_ndelay(int sock, int turn_on);\n\nDEPRECATEDIN_1_1_0(struct hostent *BIO_gethostbyname(const char *name))\nDEPRECATEDIN_1_1_0(int BIO_get_port(const char *str, unsigned short *port_ptr))\nDEPRECATEDIN_1_1_0(int BIO_get_host_ip(const char *str, unsigned char *ip))\nDEPRECATEDIN_1_1_0(int BIO_get_accept_socket(char *host_port, int mode))\nDEPRECATEDIN_1_1_0(int BIO_accept(int sock, char **ip_port))\n\nunion BIO_sock_info_u {\n BIO_ADDR *addr;\n};\nenum BIO_sock_info_type {\n BIO_SOCK_INFO_ADDRESS\n};\nint BIO_sock_info(int sock,\n enum BIO_sock_info_type type, union BIO_sock_info_u *info);\n\n# define BIO_SOCK_REUSEADDR 0x01\n# define BIO_SOCK_V6_ONLY 0x02\n# define BIO_SOCK_KEEPALIVE 0x04\n# define BIO_SOCK_NONBLOCK 0x08\n# define BIO_SOCK_NODELAY 0x10\n\nint BIO_socket(int domain, int socktype, int protocol, int options);\nint BIO_connect(int sock, const BIO_ADDR *addr, int options);\nint BIO_bind(int sock, const BIO_ADDR *addr, int options);\nint BIO_listen(int sock, const BIO_ADDR *addr, int options);\nint BIO_accept_ex(int accept_sock, BIO_ADDR *addr, int options);\nint BIO_closesocket(int sock);\n\nBIO *BIO_new_socket(int sock, int close_flag);\nBIO *BIO_new_connect(const char *host_port);\nBIO *BIO_new_accept(const char *host_port);\n# endif /* OPENSSL_NO_SOCK*/\n\nBIO *BIO_new_fd(int fd, int close_flag);\n\nint BIO_new_bio_pair(BIO **bio1, size_t writebuf1,\n BIO **bio2, size_t writebuf2);\n/*\n * If successful, returns 1 and in *bio1, *bio2 two BIO pair endpoints.\n * Otherwise returns 0 and sets *bio1 and *bio2 to NULL. Size 0 uses default\n * value.\n */\n\nvoid BIO_copy_next_retry(BIO *b);\n\n/*\n * long BIO_ghbn_ctrl(int cmd,int iarg,char *parg);\n */\n\n# define ossl_bio__attr__(x)\n# if defined(__GNUC__) && defined(__STDC_VERSION__) \\\n && !defined(__APPLE__)\n /*\n * Because we support the 'z' modifier, which made its appearance in C99,\n * we can't use __attribute__ with pre C99 dialects.\n */\n# if __STDC_VERSION__ >= 199901L\n# undef ossl_bio__attr__\n# define ossl_bio__attr__ __attribute__\n# if __GNUC__*10 + __GNUC_MINOR__ >= 44\n# define ossl_bio__printf__ __gnu_printf__\n# else\n# define ossl_bio__printf__ __printf__\n# endif\n# endif\n# endif\nint BIO_printf(BIO *bio, const char *format, ...)\nossl_bio__attr__((__format__(ossl_bio__printf__, 2, 3)));\nint BIO_vprintf(BIO *bio, const char *format, va_list args)\nossl_bio__attr__((__format__(ossl_bio__printf__, 2, 0)));\nint BIO_snprintf(char *buf, size_t n, const char *format, ...)\nossl_bio__attr__((__format__(ossl_bio__printf__, 3, 4)));\nint BIO_vsnprintf(char *buf, size_t n, const char *format, va_list args)\nossl_bio__attr__((__format__(ossl_bio__printf__, 3, 0)));\n# undef ossl_bio__attr__\n# undef ossl_bio__printf__\n\n\nBIO_METHOD *BIO_meth_new(int type, const char *name);\nvoid BIO_meth_free(BIO_METHOD *biom);\nint (*BIO_meth_get_write(const BIO_METHOD *biom)) (BIO *, const char *, int);\nint (*BIO_meth_get_write_ex(const BIO_METHOD *biom)) (BIO *, const char *, size_t,\n size_t *);\nint BIO_meth_set_write(BIO_METHOD *biom,\n int (*write) (BIO *, const char *, int));\nint BIO_meth_set_write_ex(BIO_METHOD *biom,\n int (*bwrite) (BIO *, const char *, size_t, size_t *));\nint (*BIO_meth_get_read(const BIO_METHOD *biom)) (BIO *, char *, int);\nint (*BIO_meth_get_read_ex(const BIO_METHOD *biom)) (BIO *, char *, size_t, size_t *);\nint BIO_meth_set_read(BIO_METHOD *biom,\n int (*read) (BIO *, char *, int));\nint BIO_meth_set_read_ex(BIO_METHOD *biom,\n int (*bread) (BIO *, char *, size_t, size_t *));\nint (*BIO_meth_get_puts(const BIO_METHOD *biom)) (BIO *, const char *);\nint BIO_meth_set_puts(BIO_METHOD *biom,\n int (*puts) (BIO *, const char *));\nint (*BIO_meth_get_gets(const BIO_METHOD *biom)) (BIO *, char *, int);\nint BIO_meth_set_gets(BIO_METHOD *biom,\n int (*gets) (BIO *, char *, int));\nlong (*BIO_meth_get_ctrl(const BIO_METHOD *biom)) (BIO *, int, long, void *);\nint BIO_meth_set_ctrl(BIO_METHOD *biom,\n long (*ctrl) (BIO *, int, long, void *));\nint (*BIO_meth_get_create(const BIO_METHOD *bion)) (BIO *);\nint BIO_meth_set_create(BIO_METHOD *biom, int (*create) (BIO *));\nint (*BIO_meth_get_destroy(const BIO_METHOD *biom)) (BIO *);\nint BIO_meth_set_destroy(BIO_METHOD *biom, int (*destroy) (BIO *));\nlong (*BIO_meth_get_callback_ctrl(const BIO_METHOD *biom))\n (BIO *, int, BIO_info_cb *);\nint BIO_meth_set_callback_ctrl(BIO_METHOD *biom,\n long (*callback_ctrl) (BIO *, int,\n BIO_info_cb *));\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/bioerr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_BIOERR_H\n# define HEADER_BIOERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_BIO_strings(void);\n\n/*\n * BIO function codes.\n */\n# define BIO_F_ACPT_STATE 100\n# define BIO_F_ADDRINFO_WRAP 148\n# define BIO_F_ADDR_STRINGS 134\n# define BIO_F_BIO_ACCEPT 101\n# define BIO_F_BIO_ACCEPT_EX 137\n# define BIO_F_BIO_ACCEPT_NEW 152\n# define BIO_F_BIO_ADDR_NEW 144\n# define BIO_F_BIO_BIND 147\n# define BIO_F_BIO_CALLBACK_CTRL 131\n# define BIO_F_BIO_CONNECT 138\n# define BIO_F_BIO_CONNECT_NEW 153\n# define BIO_F_BIO_CTRL 103\n# define BIO_F_BIO_GETS 104\n# define BIO_F_BIO_GET_HOST_IP 106\n# define BIO_F_BIO_GET_NEW_INDEX 102\n# define BIO_F_BIO_GET_PORT 107\n# define BIO_F_BIO_LISTEN 139\n# define BIO_F_BIO_LOOKUP 135\n# define BIO_F_BIO_LOOKUP_EX 143\n# define BIO_F_BIO_MAKE_PAIR 121\n# define BIO_F_BIO_METH_NEW 146\n# define BIO_F_BIO_NEW 108\n# define BIO_F_BIO_NEW_DGRAM_SCTP 145\n# define BIO_F_BIO_NEW_FILE 109\n# define BIO_F_BIO_NEW_MEM_BUF 126\n# define BIO_F_BIO_NREAD 123\n# define BIO_F_BIO_NREAD0 124\n# define BIO_F_BIO_NWRITE 125\n# define BIO_F_BIO_NWRITE0 122\n# define BIO_F_BIO_PARSE_HOSTSERV 136\n# define BIO_F_BIO_PUTS 110\n# define BIO_F_BIO_READ 111\n# define BIO_F_BIO_READ_EX 105\n# define BIO_F_BIO_READ_INTERN 120\n# define BIO_F_BIO_SOCKET 140\n# define BIO_F_BIO_SOCKET_NBIO 142\n# define BIO_F_BIO_SOCK_INFO 141\n# define BIO_F_BIO_SOCK_INIT 112\n# define BIO_F_BIO_WRITE 113\n# define BIO_F_BIO_WRITE_EX 119\n# define BIO_F_BIO_WRITE_INTERN 128\n# define BIO_F_BUFFER_CTRL 114\n# define BIO_F_CONN_CTRL 127\n# define BIO_F_CONN_STATE 115\n# define BIO_F_DGRAM_SCTP_NEW 149\n# define BIO_F_DGRAM_SCTP_READ 132\n# define BIO_F_DGRAM_SCTP_WRITE 133\n# define BIO_F_DOAPR_OUTCH 150\n# define BIO_F_FILE_CTRL 116\n# define BIO_F_FILE_READ 130\n# define BIO_F_LINEBUFFER_CTRL 129\n# define BIO_F_LINEBUFFER_NEW 151\n# define BIO_F_MEM_WRITE 117\n# define BIO_F_NBIOF_NEW 154\n# define BIO_F_SLG_WRITE 155\n# define BIO_F_SSL_NEW 118\n\n/*\n * BIO reason codes.\n */\n# define BIO_R_ACCEPT_ERROR 100\n# define BIO_R_ADDRINFO_ADDR_IS_NOT_AF_INET 141\n# define BIO_R_AMBIGUOUS_HOST_OR_SERVICE 129\n# define BIO_R_BAD_FOPEN_MODE 101\n# define BIO_R_BROKEN_PIPE 124\n# define BIO_R_CONNECT_ERROR 103\n# define BIO_R_GETHOSTBYNAME_ADDR_IS_NOT_AF_INET 107\n# define BIO_R_GETSOCKNAME_ERROR 132\n# define BIO_R_GETSOCKNAME_TRUNCATED_ADDRESS 133\n# define BIO_R_GETTING_SOCKTYPE 134\n# define BIO_R_INVALID_ARGUMENT 125\n# define BIO_R_INVALID_SOCKET 135\n# define BIO_R_IN_USE 123\n# define BIO_R_LENGTH_TOO_LONG 102\n# define BIO_R_LISTEN_V6_ONLY 136\n# define BIO_R_LOOKUP_RETURNED_NOTHING 142\n# define BIO_R_MALFORMED_HOST_OR_SERVICE 130\n# define BIO_R_NBIO_CONNECT_ERROR 110\n# define BIO_R_NO_ACCEPT_ADDR_OR_SERVICE_SPECIFIED 143\n# define BIO_R_NO_HOSTNAME_OR_SERVICE_SPECIFIED 144\n# define BIO_R_NO_PORT_DEFINED 113\n# define BIO_R_NO_SUCH_FILE 128\n# define BIO_R_NULL_PARAMETER 115\n# define BIO_R_UNABLE_TO_BIND_SOCKET 117\n# define BIO_R_UNABLE_TO_CREATE_SOCKET 118\n# define BIO_R_UNABLE_TO_KEEPALIVE 137\n# define BIO_R_UNABLE_TO_LISTEN_SOCKET 119\n# define BIO_R_UNABLE_TO_NODELAY 138\n# define BIO_R_UNABLE_TO_REUSEADDR 139\n# define BIO_R_UNAVAILABLE_IP_FAMILY 145\n# define BIO_R_UNINITIALIZED 120\n# define BIO_R_UNKNOWN_INFO_TYPE 140\n# define BIO_R_UNSUPPORTED_IP_FAMILY 146\n# define BIO_R_UNSUPPORTED_METHOD 121\n# define BIO_R_UNSUPPORTED_PROTOCOL_FAMILY 131\n# define BIO_R_WRITE_TO_READ_ONLY_BIO 126\n# define BIO_R_WSASTARTUP 122\n\n#endif\n" }, { "path": "cryptomini/include/openssl/blowfish.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_BLOWFISH_H\n# define HEADER_BLOWFISH_H\n\n# include \n\n# ifndef OPENSSL_NO_BF\n# include \n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n# define BF_ENCRYPT 1\n# define BF_DECRYPT 0\n\n/*-\n * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n * ! BF_LONG has to be at least 32 bits wide. !\n * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n */\n# define BF_LONG unsigned int\n\n# define BF_ROUNDS 16\n# define BF_BLOCK 8\n\ntypedef struct bf_key_st {\n BF_LONG P[BF_ROUNDS + 2];\n BF_LONG S[4 * 256];\n} BF_KEY;\n\nvoid BF_set_key(BF_KEY *key, int len, const unsigned char *data);\n\nvoid BF_encrypt(BF_LONG *data, const BF_KEY *key);\nvoid BF_decrypt(BF_LONG *data, const BF_KEY *key);\n\nvoid BF_ecb_encrypt(const unsigned char *in, unsigned char *out,\n const BF_KEY *key, int enc);\nvoid BF_cbc_encrypt(const unsigned char *in, unsigned char *out, long length,\n const BF_KEY *schedule, unsigned char *ivec, int enc);\nvoid BF_cfb64_encrypt(const unsigned char *in, unsigned char *out,\n long length, const BF_KEY *schedule,\n unsigned char *ivec, int *num, int enc);\nvoid BF_ofb64_encrypt(const unsigned char *in, unsigned char *out,\n long length, const BF_KEY *schedule,\n unsigned char *ivec, int *num);\nconst char *BF_options(void);\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/bn.h", "content": "/*\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_BN_H\n# define HEADER_BN_H\n\n# include \n# ifndef OPENSSL_NO_STDIO\n# include \n# endif\n# include \n# include \n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/*\n * 64-bit processor with LP64 ABI\n */\n# ifdef SIXTY_FOUR_BIT_LONG\n# define BN_ULONG unsigned long\n# define BN_BYTES 8\n# endif\n\n/*\n * 64-bit processor other than LP64 ABI\n */\n# ifdef SIXTY_FOUR_BIT\n# define BN_ULONG unsigned long long\n# define BN_BYTES 8\n# endif\n\n# ifdef THIRTY_TWO_BIT\n# define BN_ULONG unsigned int\n# define BN_BYTES 4\n# endif\n\n# define BN_BITS2 (BN_BYTES * 8)\n# define BN_BITS (BN_BITS2 * 2)\n# define BN_TBIT ((BN_ULONG)1 << (BN_BITS2 - 1))\n\n# define BN_FLG_MALLOCED 0x01\n# define BN_FLG_STATIC_DATA 0x02\n\n/*\n * avoid leaking exponent information through timing,\n * BN_mod_exp_mont() will call BN_mod_exp_mont_consttime,\n * BN_div() will call BN_div_no_branch,\n * BN_mod_inverse() will call bn_mod_inverse_no_branch.\n */\n# define BN_FLG_CONSTTIME 0x04\n# define BN_FLG_SECURE 0x08\n\n# if OPENSSL_API_COMPAT < 0x00908000L\n/* deprecated name for the flag */\n# define BN_FLG_EXP_CONSTTIME BN_FLG_CONSTTIME\n# define BN_FLG_FREE 0x8000 /* used for debugging */\n# endif\n\nvoid BN_set_flags(BIGNUM *b, int n);\nint BN_get_flags(const BIGNUM *b, int n);\n\n/* Values for |top| in BN_rand() */\n#define BN_RAND_TOP_ANY -1\n#define BN_RAND_TOP_ONE 0\n#define BN_RAND_TOP_TWO 1\n\n/* Values for |bottom| in BN_rand() */\n#define BN_RAND_BOTTOM_ANY 0\n#define BN_RAND_BOTTOM_ODD 1\n\n/*\n * get a clone of a BIGNUM with changed flags, for *temporary* use only (the\n * two BIGNUMs cannot be used in parallel!). Also only for *read only* use. The\n * value |dest| should be a newly allocated BIGNUM obtained via BN_new() that\n * has not been otherwise initialised or used.\n */\nvoid BN_with_flags(BIGNUM *dest, const BIGNUM *b, int flags);\n\n/* Wrapper function to make using BN_GENCB easier */\nint BN_GENCB_call(BN_GENCB *cb, int a, int b);\n\nBN_GENCB *BN_GENCB_new(void);\nvoid BN_GENCB_free(BN_GENCB *cb);\n\n/* Populate a BN_GENCB structure with an \"old\"-style callback */\nvoid BN_GENCB_set_old(BN_GENCB *gencb, void (*callback) (int, int, void *),\n void *cb_arg);\n\n/* Populate a BN_GENCB structure with a \"new\"-style callback */\nvoid BN_GENCB_set(BN_GENCB *gencb, int (*callback) (int, int, BN_GENCB *),\n void *cb_arg);\n\nvoid *BN_GENCB_get_arg(BN_GENCB *cb);\n\n# define BN_prime_checks 0 /* default: select number of iterations based\n * on the size of the number */\n\n/*\n * BN_prime_checks_for_size() returns the number of Miller-Rabin iterations\n * that will be done for checking that a random number is probably prime. The\n * error rate for accepting a composite number as prime depends on the size of\n * the prime |b|. The error rates used are for calculating an RSA key with 2 primes,\n * and so the level is what you would expect for a key of double the size of the\n * prime.\n *\n * This table is generated using the algorithm of FIPS PUB 186-4\n * Digital Signature Standard (DSS), section F.1, page 117.\n * (https://dx.doi.org/10.6028/NIST.FIPS.186-4)\n *\n * The following magma script was used to generate the output:\n * securitybits:=125;\n * k:=1024;\n * for t:=1 to 65 do\n * for M:=3 to Floor(2*Sqrt(k-1)-1) do\n * S:=0;\n * // Sum over m\n * for m:=3 to M do\n * s:=0;\n * // Sum over j\n * for j:=2 to m do\n * s+:=(RealField(32)!2)^-(j+(k-1)/j);\n * end for;\n * S+:=2^(m-(m-1)*t)*s;\n * end for;\n * A:=2^(k-2-M*t);\n * B:=8*(Pi(RealField(32))^2-6)/3*2^(k-2)*S;\n * pkt:=2.00743*Log(2)*k*2^-k*(A+B);\n * seclevel:=Floor(-Log(2,pkt));\n * if seclevel ge securitybits then\n * printf \"k: %5o, security: %o bits (t: %o, M: %o)\\n\",k,seclevel,t,M;\n * break;\n * end if;\n * end for;\n * if seclevel ge securitybits then break; end if;\n * end for;\n *\n * It can be run online at:\n * http://magma.maths.usyd.edu.au/calc\n *\n * And will output:\n * k: 1024, security: 129 bits (t: 6, M: 23)\n *\n * k is the number of bits of the prime, securitybits is the level we want to\n * reach.\n *\n * prime length | RSA key size | # MR tests | security level\n * -------------+--------------|------------+---------------\n * (b) >= 6394 | >= 12788 | 3 | 256 bit\n * (b) >= 3747 | >= 7494 | 3 | 192 bit\n * (b) >= 1345 | >= 2690 | 4 | 128 bit\n * (b) >= 1080 | >= 2160 | 5 | 128 bit\n * (b) >= 852 | >= 1704 | 5 | 112 bit\n * (b) >= 476 | >= 952 | 5 | 80 bit\n * (b) >= 400 | >= 800 | 6 | 80 bit\n * (b) >= 347 | >= 694 | 7 | 80 bit\n * (b) >= 308 | >= 616 | 8 | 80 bit\n * (b) >= 55 | >= 110 | 27 | 64 bit\n * (b) >= 6 | >= 12 | 34 | 64 bit\n */\n\n# define BN_prime_checks_for_size(b) ((b) >= 3747 ? 3 : \\\n (b) >= 1345 ? 4 : \\\n (b) >= 476 ? 5 : \\\n (b) >= 400 ? 6 : \\\n (b) >= 347 ? 7 : \\\n (b) >= 308 ? 8 : \\\n (b) >= 55 ? 27 : \\\n /* b >= 6 */ 34)\n\n# define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)\n\nint BN_abs_is_word(const BIGNUM *a, const BN_ULONG w);\nint BN_is_zero(const BIGNUM *a);\nint BN_is_one(const BIGNUM *a);\nint BN_is_word(const BIGNUM *a, const BN_ULONG w);\nint BN_is_odd(const BIGNUM *a);\n\n# define BN_one(a) (BN_set_word((a),1))\n\nvoid BN_zero_ex(BIGNUM *a);\n\n# if OPENSSL_API_COMPAT >= 0x00908000L\n# define BN_zero(a) BN_zero_ex(a)\n# else\n# define BN_zero(a) (BN_set_word((a),0))\n# endif\n\nconst BIGNUM *BN_value_one(void);\nchar *BN_options(void);\nBN_CTX *BN_CTX_new(void);\nBN_CTX *BN_CTX_secure_new(void);\nvoid BN_CTX_free(BN_CTX *c);\nvoid BN_CTX_start(BN_CTX *ctx);\nBIGNUM *BN_CTX_get(BN_CTX *ctx);\nvoid BN_CTX_end(BN_CTX *ctx);\nint BN_rand(BIGNUM *rnd, int bits, int top, int bottom);\nint BN_priv_rand(BIGNUM *rnd, int bits, int top, int bottom);\nint BN_rand_range(BIGNUM *rnd, const BIGNUM *range);\nint BN_priv_rand_range(BIGNUM *rnd, const BIGNUM *range);\nint BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom);\nint BN_pseudo_rand_range(BIGNUM *rnd, const BIGNUM *range);\nint BN_num_bits(const BIGNUM *a);\nint BN_num_bits_word(BN_ULONG l);\nint BN_security_bits(int L, int N);\nBIGNUM *BN_new(void);\nBIGNUM *BN_secure_new(void);\nvoid BN_clear_free(BIGNUM *a);\nBIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b);\nvoid BN_swap(BIGNUM *a, BIGNUM *b);\nBIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret);\nint BN_bn2bin(const BIGNUM *a, unsigned char *to);\nint BN_bn2binpad(const BIGNUM *a, unsigned char *to, int tolen);\nBIGNUM *BN_lebin2bn(const unsigned char *s, int len, BIGNUM *ret);\nint BN_bn2lebinpad(const BIGNUM *a, unsigned char *to, int tolen);\nBIGNUM *BN_mpi2bn(const unsigned char *s, int len, BIGNUM *ret);\nint BN_bn2mpi(const BIGNUM *a, unsigned char *to);\nint BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);\nint BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);\nint BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);\nint BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);\nint BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);\nint BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx);\n/** BN_set_negative sets sign of a BIGNUM\n * \\param b pointer to the BIGNUM object\n * \\param n 0 if the BIGNUM b should be positive and a value != 0 otherwise\n */\nvoid BN_set_negative(BIGNUM *b, int n);\n/** BN_is_negative returns 1 if the BIGNUM is negative\n * \\param b pointer to the BIGNUM object\n * \\return 1 if a < 0 and 0 otherwise\n */\nint BN_is_negative(const BIGNUM *b);\n\nint BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,\n BN_CTX *ctx);\n# define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))\nint BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx);\nint BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,\n BN_CTX *ctx);\nint BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n const BIGNUM *m);\nint BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,\n BN_CTX *ctx);\nint BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n const BIGNUM *m);\nint BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,\n BN_CTX *ctx);\nint BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);\nint BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);\nint BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m);\nint BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m,\n BN_CTX *ctx);\nint BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m);\n\nBN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);\nBN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);\nint BN_mul_word(BIGNUM *a, BN_ULONG w);\nint BN_add_word(BIGNUM *a, BN_ULONG w);\nint BN_sub_word(BIGNUM *a, BN_ULONG w);\nint BN_set_word(BIGNUM *a, BN_ULONG w);\nBN_ULONG BN_get_word(const BIGNUM *a);\n\nint BN_cmp(const BIGNUM *a, const BIGNUM *b);\nvoid BN_free(BIGNUM *a);\nint BN_is_bit_set(const BIGNUM *a, int n);\nint BN_lshift(BIGNUM *r, const BIGNUM *a, int n);\nint BN_lshift1(BIGNUM *r, const BIGNUM *a);\nint BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);\n\nint BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\n const BIGNUM *m, BN_CTX *ctx);\nint BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\n const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);\nint BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,\n const BIGNUM *m, BN_CTX *ctx,\n BN_MONT_CTX *in_mont);\nint BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,\n const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);\nint BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1,\n const BIGNUM *a2, const BIGNUM *p2, const BIGNUM *m,\n BN_CTX *ctx, BN_MONT_CTX *m_ctx);\nint BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\n const BIGNUM *m, BN_CTX *ctx);\n\nint BN_mask_bits(BIGNUM *a, int n);\n# ifndef OPENSSL_NO_STDIO\nint BN_print_fp(FILE *fp, const BIGNUM *a);\n# endif\nint BN_print(BIO *bio, const BIGNUM *a);\nint BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx);\nint BN_rshift(BIGNUM *r, const BIGNUM *a, int n);\nint BN_rshift1(BIGNUM *r, const BIGNUM *a);\nvoid BN_clear(BIGNUM *a);\nBIGNUM *BN_dup(const BIGNUM *a);\nint BN_ucmp(const BIGNUM *a, const BIGNUM *b);\nint BN_set_bit(BIGNUM *a, int n);\nint BN_clear_bit(BIGNUM *a, int n);\nchar *BN_bn2hex(const BIGNUM *a);\nchar *BN_bn2dec(const BIGNUM *a);\nint BN_hex2bn(BIGNUM **a, const char *str);\nint BN_dec2bn(BIGNUM **a, const char *str);\nint BN_asc2bn(BIGNUM **a, const char *str);\nint BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);\nint BN_kronecker(const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); /* returns\n * -2 for\n * error */\nBIGNUM *BN_mod_inverse(BIGNUM *ret,\n const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);\nBIGNUM *BN_mod_sqrt(BIGNUM *ret,\n const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);\n\nvoid BN_consttime_swap(BN_ULONG swap, BIGNUM *a, BIGNUM *b, int nwords);\n\n/* Deprecated versions */\nDEPRECATEDIN_0_9_8(BIGNUM *BN_generate_prime(BIGNUM *ret, int bits, int safe,\n const BIGNUM *add,\n const BIGNUM *rem,\n void (*callback) (int, int,\n void *),\n void *cb_arg))\nDEPRECATEDIN_0_9_8(int\n BN_is_prime(const BIGNUM *p, int nchecks,\n void (*callback) (int, int, void *),\n BN_CTX *ctx, void *cb_arg))\nDEPRECATEDIN_0_9_8(int\n BN_is_prime_fasttest(const BIGNUM *p, int nchecks,\n void (*callback) (int, int, void *),\n BN_CTX *ctx, void *cb_arg,\n int do_trial_division))\n\n/* Newer versions */\nint BN_generate_prime_ex(BIGNUM *ret, int bits, int safe, const BIGNUM *add,\n const BIGNUM *rem, BN_GENCB *cb);\nint BN_is_prime_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx, BN_GENCB *cb);\nint BN_is_prime_fasttest_ex(const BIGNUM *p, int nchecks, BN_CTX *ctx,\n int do_trial_division, BN_GENCB *cb);\n\nint BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx);\n\nint BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,\n const BIGNUM *Xp, const BIGNUM *Xp1,\n const BIGNUM *Xp2, const BIGNUM *e, BN_CTX *ctx,\n BN_GENCB *cb);\nint BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2, BIGNUM *Xp1,\n BIGNUM *Xp2, const BIGNUM *Xp, const BIGNUM *e,\n BN_CTX *ctx, BN_GENCB *cb);\n\nBN_MONT_CTX *BN_MONT_CTX_new(void);\nint BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n BN_MONT_CTX *mont, BN_CTX *ctx);\nint BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,\n BN_CTX *ctx);\nint BN_from_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,\n BN_CTX *ctx);\nvoid BN_MONT_CTX_free(BN_MONT_CTX *mont);\nint BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx);\nBN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, BN_MONT_CTX *from);\nBN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, CRYPTO_RWLOCK *lock,\n const BIGNUM *mod, BN_CTX *ctx);\n\n/* BN_BLINDING flags */\n# define BN_BLINDING_NO_UPDATE 0x00000001\n# define BN_BLINDING_NO_RECREATE 0x00000002\n\nBN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod);\nvoid BN_BLINDING_free(BN_BLINDING *b);\nint BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx);\nint BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);\nint BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);\nint BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *);\nint BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b,\n BN_CTX *);\n\nint BN_BLINDING_is_current_thread(BN_BLINDING *b);\nvoid BN_BLINDING_set_current_thread(BN_BLINDING *b);\nint BN_BLINDING_lock(BN_BLINDING *b);\nint BN_BLINDING_unlock(BN_BLINDING *b);\n\nunsigned long BN_BLINDING_get_flags(const BN_BLINDING *);\nvoid BN_BLINDING_set_flags(BN_BLINDING *, unsigned long);\nBN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b,\n const BIGNUM *e, BIGNUM *m, BN_CTX *ctx,\n int (*bn_mod_exp) (BIGNUM *r,\n const BIGNUM *a,\n const BIGNUM *p,\n const BIGNUM *m,\n BN_CTX *ctx,\n BN_MONT_CTX *m_ctx),\n BN_MONT_CTX *m_ctx);\n\nDEPRECATEDIN_0_9_8(void BN_set_params(int mul, int high, int low, int mont))\nDEPRECATEDIN_0_9_8(int BN_get_params(int which)) /* 0, mul, 1 high, 2 low, 3\n * mont */\n\nBN_RECP_CTX *BN_RECP_CTX_new(void);\nvoid BN_RECP_CTX_free(BN_RECP_CTX *recp);\nint BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *rdiv, BN_CTX *ctx);\nint BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,\n BN_RECP_CTX *recp, BN_CTX *ctx);\nint BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\n const BIGNUM *m, BN_CTX *ctx);\nint BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,\n BN_RECP_CTX *recp, BN_CTX *ctx);\n\n# ifndef OPENSSL_NO_EC2M\n\n/*\n * Functions for arithmetic over binary polynomials represented by BIGNUMs.\n * The BIGNUM::neg property of BIGNUMs representing binary polynomials is\n * ignored. Note that input arguments are not const so that their bit arrays\n * can be expanded to the appropriate size if needed.\n */\n\n/*\n * r = a + b\n */\nint BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);\n# define BN_GF2m_sub(r, a, b) BN_GF2m_add(r, a, b)\n/*\n * r=a mod p\n */\nint BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p);\n/* r = (a * b) mod p */\nint BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n const BIGNUM *p, BN_CTX *ctx);\n/* r = (a * a) mod p */\nint BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);\n/* r = (1 / b) mod p */\nint BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *b, const BIGNUM *p, BN_CTX *ctx);\n/* r = (a / b) mod p */\nint BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n const BIGNUM *p, BN_CTX *ctx);\n/* r = (a ^ b) mod p */\nint BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n const BIGNUM *p, BN_CTX *ctx);\n/* r = sqrt(a) mod p */\nint BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\n BN_CTX *ctx);\n/* r^2 + r = a mod p */\nint BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\n BN_CTX *ctx);\n# define BN_GF2m_cmp(a, b) BN_ucmp((a), (b))\n/*-\n * Some functions allow for representation of the irreducible polynomials\n * as an unsigned int[], say p. The irreducible f(t) is then of the form:\n * t^p[0] + t^p[1] + ... + t^p[k]\n * where m = p[0] > p[1] > ... > p[k] = 0.\n */\n/* r = a mod p */\nint BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[]);\n/* r = (a * b) mod p */\nint BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n const int p[], BN_CTX *ctx);\n/* r = (a * a) mod p */\nint BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],\n BN_CTX *ctx);\n/* r = (1 / b) mod p */\nint BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *b, const int p[],\n BN_CTX *ctx);\n/* r = (a / b) mod p */\nint BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n const int p[], BN_CTX *ctx);\n/* r = (a ^ b) mod p */\nint BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,\n const int p[], BN_CTX *ctx);\n/* r = sqrt(a) mod p */\nint BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a,\n const int p[], BN_CTX *ctx);\n/* r^2 + r = a mod p */\nint BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a,\n const int p[], BN_CTX *ctx);\nint BN_GF2m_poly2arr(const BIGNUM *a, int p[], int max);\nint BN_GF2m_arr2poly(const int p[], BIGNUM *a);\n\n# endif\n\n/*\n * faster mod functions for the 'NIST primes' 0 <= a < p^2\n */\nint BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);\nint BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);\nint BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);\nint BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);\nint BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);\n\nconst BIGNUM *BN_get0_nist_prime_192(void);\nconst BIGNUM *BN_get0_nist_prime_224(void);\nconst BIGNUM *BN_get0_nist_prime_256(void);\nconst BIGNUM *BN_get0_nist_prime_384(void);\nconst BIGNUM *BN_get0_nist_prime_521(void);\n\nint (*BN_nist_mod_func(const BIGNUM *p)) (BIGNUM *r, const BIGNUM *a,\n const BIGNUM *field, BN_CTX *ctx);\n\nint BN_generate_dsa_nonce(BIGNUM *out, const BIGNUM *range,\n const BIGNUM *priv, const unsigned char *message,\n size_t message_len, BN_CTX *ctx);\n\n/* Primes from RFC 2409 */\nBIGNUM *BN_get_rfc2409_prime_768(BIGNUM *bn);\nBIGNUM *BN_get_rfc2409_prime_1024(BIGNUM *bn);\n\n/* Primes from RFC 3526 */\nBIGNUM *BN_get_rfc3526_prime_1536(BIGNUM *bn);\nBIGNUM *BN_get_rfc3526_prime_2048(BIGNUM *bn);\nBIGNUM *BN_get_rfc3526_prime_3072(BIGNUM *bn);\nBIGNUM *BN_get_rfc3526_prime_4096(BIGNUM *bn);\nBIGNUM *BN_get_rfc3526_prime_6144(BIGNUM *bn);\nBIGNUM *BN_get_rfc3526_prime_8192(BIGNUM *bn);\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define get_rfc2409_prime_768 BN_get_rfc2409_prime_768\n# define get_rfc2409_prime_1024 BN_get_rfc2409_prime_1024\n# define get_rfc3526_prime_1536 BN_get_rfc3526_prime_1536\n# define get_rfc3526_prime_2048 BN_get_rfc3526_prime_2048\n# define get_rfc3526_prime_3072 BN_get_rfc3526_prime_3072\n# define get_rfc3526_prime_4096 BN_get_rfc3526_prime_4096\n# define get_rfc3526_prime_6144 BN_get_rfc3526_prime_6144\n# define get_rfc3526_prime_8192 BN_get_rfc3526_prime_8192\n# endif\n\nint BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom);\n\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/bnerr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_BNERR_H\n# define HEADER_BNERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_BN_strings(void);\n\n/*\n * BN function codes.\n */\n# define BN_F_BNRAND 127\n# define BN_F_BNRAND_RANGE 138\n# define BN_F_BN_BLINDING_CONVERT_EX 100\n# define BN_F_BN_BLINDING_CREATE_PARAM 128\n# define BN_F_BN_BLINDING_INVERT_EX 101\n# define BN_F_BN_BLINDING_NEW 102\n# define BN_F_BN_BLINDING_UPDATE 103\n# define BN_F_BN_BN2DEC 104\n# define BN_F_BN_BN2HEX 105\n# define BN_F_BN_COMPUTE_WNAF 142\n# define BN_F_BN_CTX_GET 116\n# define BN_F_BN_CTX_NEW 106\n# define BN_F_BN_CTX_START 129\n# define BN_F_BN_DIV 107\n# define BN_F_BN_DIV_RECP 130\n# define BN_F_BN_EXP 123\n# define BN_F_BN_EXPAND_INTERNAL 120\n# define BN_F_BN_GENCB_NEW 143\n# define BN_F_BN_GENERATE_DSA_NONCE 140\n# define BN_F_BN_GENERATE_PRIME_EX 141\n# define BN_F_BN_GF2M_MOD 131\n# define BN_F_BN_GF2M_MOD_EXP 132\n# define BN_F_BN_GF2M_MOD_MUL 133\n# define BN_F_BN_GF2M_MOD_SOLVE_QUAD 134\n# define BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR 135\n# define BN_F_BN_GF2M_MOD_SQR 136\n# define BN_F_BN_GF2M_MOD_SQRT 137\n# define BN_F_BN_LSHIFT 145\n# define BN_F_BN_MOD_EXP2_MONT 118\n# define BN_F_BN_MOD_EXP_MONT 109\n# define BN_F_BN_MOD_EXP_MONT_CONSTTIME 124\n# define BN_F_BN_MOD_EXP_MONT_WORD 117\n# define BN_F_BN_MOD_EXP_RECP 125\n# define BN_F_BN_MOD_EXP_SIMPLE 126\n# define BN_F_BN_MOD_INVERSE 110\n# define BN_F_BN_MOD_INVERSE_NO_BRANCH 139\n# define BN_F_BN_MOD_LSHIFT_QUICK 119\n# define BN_F_BN_MOD_SQRT 121\n# define BN_F_BN_MONT_CTX_NEW 149\n# define BN_F_BN_MPI2BN 112\n# define BN_F_BN_NEW 113\n# define BN_F_BN_POOL_GET 147\n# define BN_F_BN_RAND 114\n# define BN_F_BN_RAND_RANGE 122\n# define BN_F_BN_RECP_CTX_NEW 150\n# define BN_F_BN_RSHIFT 146\n# define BN_F_BN_SET_WORDS 144\n# define BN_F_BN_STACK_PUSH 148\n# define BN_F_BN_USUB 115\n\n/*\n * BN reason codes.\n */\n# define BN_R_ARG2_LT_ARG3 100\n# define BN_R_BAD_RECIPROCAL 101\n# define BN_R_BIGNUM_TOO_LONG 114\n# define BN_R_BITS_TOO_SMALL 118\n# define BN_R_CALLED_WITH_EVEN_MODULUS 102\n# define BN_R_DIV_BY_ZERO 103\n# define BN_R_ENCODING_ERROR 104\n# define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA 105\n# define BN_R_INPUT_NOT_REDUCED 110\n# define BN_R_INVALID_LENGTH 106\n# define BN_R_INVALID_RANGE 115\n# define BN_R_INVALID_SHIFT 119\n# define BN_R_NOT_A_SQUARE 111\n# define BN_R_NOT_INITIALIZED 107\n# define BN_R_NO_INVERSE 108\n# define BN_R_NO_SOLUTION 116\n# define BN_R_PRIVATE_KEY_TOO_LARGE 117\n# define BN_R_P_IS_NOT_PRIME 112\n# define BN_R_TOO_MANY_ITERATIONS 113\n# define BN_R_TOO_MANY_TEMPORARY_VARIABLES 109\n\n#endif\n" }, { "path": "cryptomini/include/openssl/buffer.h", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_BUFFER_H\n# define HEADER_BUFFER_H\n\n# include \n# ifndef HEADER_CRYPTO_H\n# include \n# endif\n# include \n\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# include \n# include \n\n/*\n * These names are outdated as of OpenSSL 1.1; a future release\n * will move them to be deprecated.\n */\n# define BUF_strdup(s) OPENSSL_strdup(s)\n# define BUF_strndup(s, size) OPENSSL_strndup(s, size)\n# define BUF_memdup(data, size) OPENSSL_memdup(data, size)\n# define BUF_strlcpy(dst, src, size) OPENSSL_strlcpy(dst, src, size)\n# define BUF_strlcat(dst, src, size) OPENSSL_strlcat(dst, src, size)\n# define BUF_strnlen(str, maxlen) OPENSSL_strnlen(str, maxlen)\n\nstruct buf_mem_st {\n size_t length; /* current number of bytes */\n char *data;\n size_t max; /* size of buffer */\n unsigned long flags;\n};\n\n# define BUF_MEM_FLAG_SECURE 0x01\n\nBUF_MEM *BUF_MEM_new(void);\nBUF_MEM *BUF_MEM_new_ex(unsigned long flags);\nvoid BUF_MEM_free(BUF_MEM *a);\nsize_t BUF_MEM_grow(BUF_MEM *str, size_t len);\nsize_t BUF_MEM_grow_clean(BUF_MEM *str, size_t len);\nvoid BUF_reverse(unsigned char *out, const unsigned char *in, size_t siz);\n\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/buffererr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_BUFERR_H\n# define HEADER_BUFERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_BUF_strings(void);\n\n/*\n * BUF function codes.\n */\n# define BUF_F_BUF_MEM_GROW 100\n# define BUF_F_BUF_MEM_GROW_CLEAN 105\n# define BUF_F_BUF_MEM_NEW 101\n\n/*\n * BUF reason codes.\n */\n\n#endif\n" }, { "path": "cryptomini/include/openssl/camellia.h", "content": "/*\n * Copyright 2006-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_CAMELLIA_H\n# define HEADER_CAMELLIA_H\n\n# include \n\n# ifndef OPENSSL_NO_CAMELLIA\n# include \n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# define CAMELLIA_ENCRYPT 1\n# define CAMELLIA_DECRYPT 0\n\n/*\n * Because array size can't be a const in C, the following two are macros.\n * Both sizes are in bytes.\n */\n\n/* This should be a hidden type, but EVP requires that the size be known */\n\n# define CAMELLIA_BLOCK_SIZE 16\n# define CAMELLIA_TABLE_BYTE_LEN 272\n# define CAMELLIA_TABLE_WORD_LEN (CAMELLIA_TABLE_BYTE_LEN / 4)\n\ntypedef unsigned int KEY_TABLE_TYPE[CAMELLIA_TABLE_WORD_LEN]; /* to match\n * with WORD */\n\nstruct camellia_key_st {\n union {\n double d; /* ensures 64-bit align */\n KEY_TABLE_TYPE rd_key;\n } u;\n int grand_rounds;\n};\ntypedef struct camellia_key_st CAMELLIA_KEY;\n\nint Camellia_set_key(const unsigned char *userKey, const int bits,\n CAMELLIA_KEY *key);\n\nvoid Camellia_encrypt(const unsigned char *in, unsigned char *out,\n const CAMELLIA_KEY *key);\nvoid Camellia_decrypt(const unsigned char *in, unsigned char *out,\n const CAMELLIA_KEY *key);\n\nvoid Camellia_ecb_encrypt(const unsigned char *in, unsigned char *out,\n const CAMELLIA_KEY *key, const int enc);\nvoid Camellia_cbc_encrypt(const unsigned char *in, unsigned char *out,\n size_t length, const CAMELLIA_KEY *key,\n unsigned char *ivec, const int enc);\nvoid Camellia_cfb128_encrypt(const unsigned char *in, unsigned char *out,\n size_t length, const CAMELLIA_KEY *key,\n unsigned char *ivec, int *num, const int enc);\nvoid Camellia_cfb1_encrypt(const unsigned char *in, unsigned char *out,\n size_t length, const CAMELLIA_KEY *key,\n unsigned char *ivec, int *num, const int enc);\nvoid Camellia_cfb8_encrypt(const unsigned char *in, unsigned char *out,\n size_t length, const CAMELLIA_KEY *key,\n unsigned char *ivec, int *num, const int enc);\nvoid Camellia_ofb128_encrypt(const unsigned char *in, unsigned char *out,\n size_t length, const CAMELLIA_KEY *key,\n unsigned char *ivec, int *num);\nvoid Camellia_ctr128_encrypt(const unsigned char *in, unsigned char *out,\n size_t length, const CAMELLIA_KEY *key,\n unsigned char ivec[CAMELLIA_BLOCK_SIZE],\n unsigned char ecount_buf[CAMELLIA_BLOCK_SIZE],\n unsigned int *num);\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/cast.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_CAST_H\n# define HEADER_CAST_H\n\n# include \n\n# ifndef OPENSSL_NO_CAST\n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n# define CAST_ENCRYPT 1\n# define CAST_DECRYPT 0\n\n# define CAST_LONG unsigned int\n\n# define CAST_BLOCK 8\n# define CAST_KEY_LENGTH 16\n\ntypedef struct cast_key_st {\n CAST_LONG data[32];\n int short_key; /* Use reduced rounds for short key */\n} CAST_KEY;\n\nvoid CAST_set_key(CAST_KEY *key, int len, const unsigned char *data);\nvoid CAST_ecb_encrypt(const unsigned char *in, unsigned char *out,\n const CAST_KEY *key, int enc);\nvoid CAST_encrypt(CAST_LONG *data, const CAST_KEY *key);\nvoid CAST_decrypt(CAST_LONG *data, const CAST_KEY *key);\nvoid CAST_cbc_encrypt(const unsigned char *in, unsigned char *out,\n long length, const CAST_KEY *ks, unsigned char *iv,\n int enc);\nvoid CAST_cfb64_encrypt(const unsigned char *in, unsigned char *out,\n long length, const CAST_KEY *schedule,\n unsigned char *ivec, int *num, int enc);\nvoid CAST_ofb64_encrypt(const unsigned char *in, unsigned char *out,\n long length, const CAST_KEY *schedule,\n unsigned char *ivec, int *num);\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/cmac.h", "content": "/*\n * Copyright 2010-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_CMAC_H\n# define HEADER_CMAC_H\n\n# ifndef OPENSSL_NO_CMAC\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# include \n\n/* Opaque */\ntypedef struct CMAC_CTX_st CMAC_CTX;\n\nCMAC_CTX *CMAC_CTX_new(void);\nvoid CMAC_CTX_cleanup(CMAC_CTX *ctx);\nvoid CMAC_CTX_free(CMAC_CTX *ctx);\nEVP_CIPHER_CTX *CMAC_CTX_get0_cipher_ctx(CMAC_CTX *ctx);\nint CMAC_CTX_copy(CMAC_CTX *out, const CMAC_CTX *in);\n\nint CMAC_Init(CMAC_CTX *ctx, const void *key, size_t keylen,\n const EVP_CIPHER *cipher, ENGINE *impl);\nint CMAC_Update(CMAC_CTX *ctx, const void *data, size_t dlen);\nint CMAC_Final(CMAC_CTX *ctx, unsigned char *out, size_t *poutlen);\nint CMAC_resume(CMAC_CTX *ctx);\n\n#ifdef __cplusplus\n}\n#endif\n\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/cms.h", "content": "/*\n * Copyright 2008-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_CMS_H\n# define HEADER_CMS_H\n\n# include \n\n# ifndef OPENSSL_NO_CMS\n# include \n# include \n# include \n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\ntypedef struct CMS_ContentInfo_st CMS_ContentInfo;\ntypedef struct CMS_SignerInfo_st CMS_SignerInfo;\ntypedef struct CMS_CertificateChoices CMS_CertificateChoices;\ntypedef struct CMS_RevocationInfoChoice_st CMS_RevocationInfoChoice;\ntypedef struct CMS_RecipientInfo_st CMS_RecipientInfo;\ntypedef struct CMS_ReceiptRequest_st CMS_ReceiptRequest;\ntypedef struct CMS_Receipt_st CMS_Receipt;\ntypedef struct CMS_RecipientEncryptedKey_st CMS_RecipientEncryptedKey;\ntypedef struct CMS_OtherKeyAttribute_st CMS_OtherKeyAttribute;\n\nDEFINE_STACK_OF(CMS_SignerInfo)\nDEFINE_STACK_OF(CMS_RecipientEncryptedKey)\nDEFINE_STACK_OF(CMS_RecipientInfo)\nDEFINE_STACK_OF(CMS_RevocationInfoChoice)\nDECLARE_ASN1_FUNCTIONS(CMS_ContentInfo)\nDECLARE_ASN1_FUNCTIONS(CMS_ReceiptRequest)\nDECLARE_ASN1_PRINT_FUNCTION(CMS_ContentInfo)\n\n# define CMS_SIGNERINFO_ISSUER_SERIAL 0\n# define CMS_SIGNERINFO_KEYIDENTIFIER 1\n\n# define CMS_RECIPINFO_NONE -1\n# define CMS_RECIPINFO_TRANS 0\n# define CMS_RECIPINFO_AGREE 1\n# define CMS_RECIPINFO_KEK 2\n# define CMS_RECIPINFO_PASS 3\n# define CMS_RECIPINFO_OTHER 4\n\n/* S/MIME related flags */\n\n# define CMS_TEXT 0x1\n# define CMS_NOCERTS 0x2\n# define CMS_NO_CONTENT_VERIFY 0x4\n# define CMS_NO_ATTR_VERIFY 0x8\n# define CMS_NOSIGS \\\n (CMS_NO_CONTENT_VERIFY|CMS_NO_ATTR_VERIFY)\n# define CMS_NOINTERN 0x10\n# define CMS_NO_SIGNER_CERT_VERIFY 0x20\n# define CMS_NOVERIFY 0x20\n# define CMS_DETACHED 0x40\n# define CMS_BINARY 0x80\n# define CMS_NOATTR 0x100\n# define CMS_NOSMIMECAP 0x200\n# define CMS_NOOLDMIMETYPE 0x400\n# define CMS_CRLFEOL 0x800\n# define CMS_STREAM 0x1000\n# define CMS_NOCRL 0x2000\n# define CMS_PARTIAL 0x4000\n# define CMS_REUSE_DIGEST 0x8000\n# define CMS_USE_KEYID 0x10000\n# define CMS_DEBUG_DECRYPT 0x20000\n# define CMS_KEY_PARAM 0x40000\n# define CMS_ASCIICRLF 0x80000\n\nconst ASN1_OBJECT *CMS_get0_type(const CMS_ContentInfo *cms);\n\nBIO *CMS_dataInit(CMS_ContentInfo *cms, BIO *icont);\nint CMS_dataFinal(CMS_ContentInfo *cms, BIO *bio);\n\nASN1_OCTET_STRING **CMS_get0_content(CMS_ContentInfo *cms);\nint CMS_is_detached(CMS_ContentInfo *cms);\nint CMS_set_detached(CMS_ContentInfo *cms, int detached);\n\n# ifdef HEADER_PEM_H\nDECLARE_PEM_rw_const(CMS, CMS_ContentInfo)\n# endif\nint CMS_stream(unsigned char ***boundary, CMS_ContentInfo *cms);\nCMS_ContentInfo *d2i_CMS_bio(BIO *bp, CMS_ContentInfo **cms);\nint i2d_CMS_bio(BIO *bp, CMS_ContentInfo *cms);\n\nBIO *BIO_new_CMS(BIO *out, CMS_ContentInfo *cms);\nint i2d_CMS_bio_stream(BIO *out, CMS_ContentInfo *cms, BIO *in, int flags);\nint PEM_write_bio_CMS_stream(BIO *out, CMS_ContentInfo *cms, BIO *in,\n int flags);\nCMS_ContentInfo *SMIME_read_CMS(BIO *bio, BIO **bcont);\nint SMIME_write_CMS(BIO *bio, CMS_ContentInfo *cms, BIO *data, int flags);\n\nint CMS_final(CMS_ContentInfo *cms, BIO *data, BIO *dcont,\n unsigned int flags);\n\nCMS_ContentInfo *CMS_sign(X509 *signcert, EVP_PKEY *pkey,\n STACK_OF(X509) *certs, BIO *data,\n unsigned int flags);\n\nCMS_ContentInfo *CMS_sign_receipt(CMS_SignerInfo *si,\n X509 *signcert, EVP_PKEY *pkey,\n STACK_OF(X509) *certs, unsigned int flags);\n\nint CMS_data(CMS_ContentInfo *cms, BIO *out, unsigned int flags);\nCMS_ContentInfo *CMS_data_create(BIO *in, unsigned int flags);\n\nint CMS_digest_verify(CMS_ContentInfo *cms, BIO *dcont, BIO *out,\n unsigned int flags);\nCMS_ContentInfo *CMS_digest_create(BIO *in, const EVP_MD *md,\n unsigned int flags);\n\nint CMS_EncryptedData_decrypt(CMS_ContentInfo *cms,\n const unsigned char *key, size_t keylen,\n BIO *dcont, BIO *out, unsigned int flags);\n\nCMS_ContentInfo *CMS_EncryptedData_encrypt(BIO *in, const EVP_CIPHER *cipher,\n const unsigned char *key,\n size_t keylen, unsigned int flags);\n\nint CMS_EncryptedData_set1_key(CMS_ContentInfo *cms, const EVP_CIPHER *ciph,\n const unsigned char *key, size_t keylen);\n\nint CMS_verify(CMS_ContentInfo *cms, STACK_OF(X509) *certs,\n X509_STORE *store, BIO *dcont, BIO *out, unsigned int flags);\n\nint CMS_verify_receipt(CMS_ContentInfo *rcms, CMS_ContentInfo *ocms,\n STACK_OF(X509) *certs,\n X509_STORE *store, unsigned int flags);\n\nSTACK_OF(X509) *CMS_get0_signers(CMS_ContentInfo *cms);\n\nCMS_ContentInfo *CMS_encrypt(STACK_OF(X509) *certs, BIO *in,\n const EVP_CIPHER *cipher, unsigned int flags);\n\nint CMS_decrypt(CMS_ContentInfo *cms, EVP_PKEY *pkey, X509 *cert,\n BIO *dcont, BIO *out, unsigned int flags);\n\nint CMS_decrypt_set1_pkey(CMS_ContentInfo *cms, EVP_PKEY *pk, X509 *cert);\nint CMS_decrypt_set1_key(CMS_ContentInfo *cms,\n unsigned char *key, size_t keylen,\n const unsigned char *id, size_t idlen);\nint CMS_decrypt_set1_password(CMS_ContentInfo *cms,\n unsigned char *pass, ossl_ssize_t passlen);\n\nSTACK_OF(CMS_RecipientInfo) *CMS_get0_RecipientInfos(CMS_ContentInfo *cms);\nint CMS_RecipientInfo_type(CMS_RecipientInfo *ri);\nEVP_PKEY_CTX *CMS_RecipientInfo_get0_pkey_ctx(CMS_RecipientInfo *ri);\nCMS_ContentInfo *CMS_EnvelopedData_create(const EVP_CIPHER *cipher);\nCMS_RecipientInfo *CMS_add1_recipient_cert(CMS_ContentInfo *cms,\n X509 *recip, unsigned int flags);\nint CMS_RecipientInfo_set0_pkey(CMS_RecipientInfo *ri, EVP_PKEY *pkey);\nint CMS_RecipientInfo_ktri_cert_cmp(CMS_RecipientInfo *ri, X509 *cert);\nint CMS_RecipientInfo_ktri_get0_algs(CMS_RecipientInfo *ri,\n EVP_PKEY **pk, X509 **recip,\n X509_ALGOR **palg);\nint CMS_RecipientInfo_ktri_get0_signer_id(CMS_RecipientInfo *ri,\n ASN1_OCTET_STRING **keyid,\n X509_NAME **issuer,\n ASN1_INTEGER **sno);\n\nCMS_RecipientInfo *CMS_add0_recipient_key(CMS_ContentInfo *cms, int nid,\n unsigned char *key, size_t keylen,\n unsigned char *id, size_t idlen,\n ASN1_GENERALIZEDTIME *date,\n ASN1_OBJECT *otherTypeId,\n ASN1_TYPE *otherType);\n\nint CMS_RecipientInfo_kekri_get0_id(CMS_RecipientInfo *ri,\n X509_ALGOR **palg,\n ASN1_OCTET_STRING **pid,\n ASN1_GENERALIZEDTIME **pdate,\n ASN1_OBJECT **potherid,\n ASN1_TYPE **pothertype);\n\nint CMS_RecipientInfo_set0_key(CMS_RecipientInfo *ri,\n unsigned char *key, size_t keylen);\n\nint CMS_RecipientInfo_kekri_id_cmp(CMS_RecipientInfo *ri,\n const unsigned char *id, size_t idlen);\n\nint CMS_RecipientInfo_set0_password(CMS_RecipientInfo *ri,\n unsigned char *pass,\n ossl_ssize_t passlen);\n\nCMS_RecipientInfo *CMS_add0_recipient_password(CMS_ContentInfo *cms,\n int iter, int wrap_nid,\n int pbe_nid,\n unsigned char *pass,\n ossl_ssize_t passlen,\n const EVP_CIPHER *kekciph);\n\nint CMS_RecipientInfo_decrypt(CMS_ContentInfo *cms, CMS_RecipientInfo *ri);\nint CMS_RecipientInfo_encrypt(CMS_ContentInfo *cms, CMS_RecipientInfo *ri);\n\nint CMS_uncompress(CMS_ContentInfo *cms, BIO *dcont, BIO *out,\n unsigned int flags);\nCMS_ContentInfo *CMS_compress(BIO *in, int comp_nid, unsigned int flags);\n\nint CMS_set1_eContentType(CMS_ContentInfo *cms, const ASN1_OBJECT *oid);\nconst ASN1_OBJECT *CMS_get0_eContentType(CMS_ContentInfo *cms);\n\nCMS_CertificateChoices *CMS_add0_CertificateChoices(CMS_ContentInfo *cms);\nint CMS_add0_cert(CMS_ContentInfo *cms, X509 *cert);\nint CMS_add1_cert(CMS_ContentInfo *cms, X509 *cert);\nSTACK_OF(X509) *CMS_get1_certs(CMS_ContentInfo *cms);\n\nCMS_RevocationInfoChoice *CMS_add0_RevocationInfoChoice(CMS_ContentInfo *cms);\nint CMS_add0_crl(CMS_ContentInfo *cms, X509_CRL *crl);\nint CMS_add1_crl(CMS_ContentInfo *cms, X509_CRL *crl);\nSTACK_OF(X509_CRL) *CMS_get1_crls(CMS_ContentInfo *cms);\n\nint CMS_SignedData_init(CMS_ContentInfo *cms);\nCMS_SignerInfo *CMS_add1_signer(CMS_ContentInfo *cms,\n X509 *signer, EVP_PKEY *pk, const EVP_MD *md,\n unsigned int flags);\nEVP_PKEY_CTX *CMS_SignerInfo_get0_pkey_ctx(CMS_SignerInfo *si);\nEVP_MD_CTX *CMS_SignerInfo_get0_md_ctx(CMS_SignerInfo *si);\nSTACK_OF(CMS_SignerInfo) *CMS_get0_SignerInfos(CMS_ContentInfo *cms);\n\nvoid CMS_SignerInfo_set1_signer_cert(CMS_SignerInfo *si, X509 *signer);\nint CMS_SignerInfo_get0_signer_id(CMS_SignerInfo *si,\n ASN1_OCTET_STRING **keyid,\n X509_NAME **issuer, ASN1_INTEGER **sno);\nint CMS_SignerInfo_cert_cmp(CMS_SignerInfo *si, X509 *cert);\nint CMS_set1_signers_certs(CMS_ContentInfo *cms, STACK_OF(X509) *certs,\n unsigned int flags);\nvoid CMS_SignerInfo_get0_algs(CMS_SignerInfo *si, EVP_PKEY **pk,\n X509 **signer, X509_ALGOR **pdig,\n X509_ALGOR **psig);\nASN1_OCTET_STRING *CMS_SignerInfo_get0_signature(CMS_SignerInfo *si);\nint CMS_SignerInfo_sign(CMS_SignerInfo *si);\nint CMS_SignerInfo_verify(CMS_SignerInfo *si);\nint CMS_SignerInfo_verify_content(CMS_SignerInfo *si, BIO *chain);\n\nint CMS_add_smimecap(CMS_SignerInfo *si, STACK_OF(X509_ALGOR) *algs);\nint CMS_add_simple_smimecap(STACK_OF(X509_ALGOR) **algs,\n int algnid, int keysize);\nint CMS_add_standard_smimecap(STACK_OF(X509_ALGOR) **smcap);\n\nint CMS_signed_get_attr_count(const CMS_SignerInfo *si);\nint CMS_signed_get_attr_by_NID(const CMS_SignerInfo *si, int nid,\n int lastpos);\nint CMS_signed_get_attr_by_OBJ(const CMS_SignerInfo *si, const ASN1_OBJECT *obj,\n int lastpos);\nX509_ATTRIBUTE *CMS_signed_get_attr(const CMS_SignerInfo *si, int loc);\nX509_ATTRIBUTE *CMS_signed_delete_attr(CMS_SignerInfo *si, int loc);\nint CMS_signed_add1_attr(CMS_SignerInfo *si, X509_ATTRIBUTE *attr);\nint CMS_signed_add1_attr_by_OBJ(CMS_SignerInfo *si,\n const ASN1_OBJECT *obj, int type,\n const void *bytes, int len);\nint CMS_signed_add1_attr_by_NID(CMS_SignerInfo *si,\n int nid, int type,\n const void *bytes, int len);\nint CMS_signed_add1_attr_by_txt(CMS_SignerInfo *si,\n const char *attrname, int type,\n const void *bytes, int len);\nvoid *CMS_signed_get0_data_by_OBJ(CMS_SignerInfo *si, const ASN1_OBJECT *oid,\n int lastpos, int type);\n\nint CMS_unsigned_get_attr_count(const CMS_SignerInfo *si);\nint CMS_unsigned_get_attr_by_NID(const CMS_SignerInfo *si, int nid,\n int lastpos);\nint CMS_unsigned_get_attr_by_OBJ(const CMS_SignerInfo *si,\n const ASN1_OBJECT *obj, int lastpos);\nX509_ATTRIBUTE *CMS_unsigned_get_attr(const CMS_SignerInfo *si, int loc);\nX509_ATTRIBUTE *CMS_unsigned_delete_attr(CMS_SignerInfo *si, int loc);\nint CMS_unsigned_add1_attr(CMS_SignerInfo *si, X509_ATTRIBUTE *attr);\nint CMS_unsigned_add1_attr_by_OBJ(CMS_SignerInfo *si,\n const ASN1_OBJECT *obj, int type,\n const void *bytes, int len);\nint CMS_unsigned_add1_attr_by_NID(CMS_SignerInfo *si,\n int nid, int type,\n const void *bytes, int len);\nint CMS_unsigned_add1_attr_by_txt(CMS_SignerInfo *si,\n const char *attrname, int type,\n const void *bytes, int len);\nvoid *CMS_unsigned_get0_data_by_OBJ(CMS_SignerInfo *si, ASN1_OBJECT *oid,\n int lastpos, int type);\n\nint CMS_get1_ReceiptRequest(CMS_SignerInfo *si, CMS_ReceiptRequest **prr);\nCMS_ReceiptRequest *CMS_ReceiptRequest_create0(unsigned char *id, int idlen,\n int allorfirst,\n STACK_OF(GENERAL_NAMES)\n *receiptList, STACK_OF(GENERAL_NAMES)\n *receiptsTo);\nint CMS_add1_ReceiptRequest(CMS_SignerInfo *si, CMS_ReceiptRequest *rr);\nvoid CMS_ReceiptRequest_get0_values(CMS_ReceiptRequest *rr,\n ASN1_STRING **pcid,\n int *pallorfirst,\n STACK_OF(GENERAL_NAMES) **plist,\n STACK_OF(GENERAL_NAMES) **prto);\nint CMS_RecipientInfo_kari_get0_alg(CMS_RecipientInfo *ri,\n X509_ALGOR **palg,\n ASN1_OCTET_STRING **pukm);\nSTACK_OF(CMS_RecipientEncryptedKey)\n*CMS_RecipientInfo_kari_get0_reks(CMS_RecipientInfo *ri);\n\nint CMS_RecipientInfo_kari_get0_orig_id(CMS_RecipientInfo *ri,\n X509_ALGOR **pubalg,\n ASN1_BIT_STRING **pubkey,\n ASN1_OCTET_STRING **keyid,\n X509_NAME **issuer,\n ASN1_INTEGER **sno);\n\nint CMS_RecipientInfo_kari_orig_id_cmp(CMS_RecipientInfo *ri, X509 *cert);\n\nint CMS_RecipientEncryptedKey_get0_id(CMS_RecipientEncryptedKey *rek,\n ASN1_OCTET_STRING **keyid,\n ASN1_GENERALIZEDTIME **tm,\n CMS_OtherKeyAttribute **other,\n X509_NAME **issuer, ASN1_INTEGER **sno);\nint CMS_RecipientEncryptedKey_cert_cmp(CMS_RecipientEncryptedKey *rek,\n X509 *cert);\nint CMS_RecipientInfo_kari_set0_pkey(CMS_RecipientInfo *ri, EVP_PKEY *pk);\nEVP_CIPHER_CTX *CMS_RecipientInfo_kari_get0_ctx(CMS_RecipientInfo *ri);\nint CMS_RecipientInfo_kari_decrypt(CMS_ContentInfo *cms,\n CMS_RecipientInfo *ri,\n CMS_RecipientEncryptedKey *rek);\n\nint CMS_SharedInfo_encode(unsigned char **pder, X509_ALGOR *kekalg,\n ASN1_OCTET_STRING *ukm, int keylen);\n\n/* Backward compatibility for spelling errors. */\n# define CMS_R_UNKNOWN_DIGEST_ALGORITM CMS_R_UNKNOWN_DIGEST_ALGORITHM\n# define CMS_R_UNSUPPORTED_RECPIENTINFO_TYPE \\\n CMS_R_UNSUPPORTED_RECIPIENTINFO_TYPE\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/cmserr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_CMSERR_H\n# define HEADER_CMSERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# include \n\n# ifndef OPENSSL_NO_CMS\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_CMS_strings(void);\n\n/*\n * CMS function codes.\n */\n# define CMS_F_CHECK_CONTENT 99\n# define CMS_F_CMS_ADD0_CERT 164\n# define CMS_F_CMS_ADD0_RECIPIENT_KEY 100\n# define CMS_F_CMS_ADD0_RECIPIENT_PASSWORD 165\n# define CMS_F_CMS_ADD1_RECEIPTREQUEST 158\n# define CMS_F_CMS_ADD1_RECIPIENT_CERT 101\n# define CMS_F_CMS_ADD1_SIGNER 102\n# define CMS_F_CMS_ADD1_SIGNINGTIME 103\n# define CMS_F_CMS_COMPRESS 104\n# define CMS_F_CMS_COMPRESSEDDATA_CREATE 105\n# define CMS_F_CMS_COMPRESSEDDATA_INIT_BIO 106\n# define CMS_F_CMS_COPY_CONTENT 107\n# define CMS_F_CMS_COPY_MESSAGEDIGEST 108\n# define CMS_F_CMS_DATA 109\n# define CMS_F_CMS_DATAFINAL 110\n# define CMS_F_CMS_DATAINIT 111\n# define CMS_F_CMS_DECRYPT 112\n# define CMS_F_CMS_DECRYPT_SET1_KEY 113\n# define CMS_F_CMS_DECRYPT_SET1_PASSWORD 166\n# define CMS_F_CMS_DECRYPT_SET1_PKEY 114\n# define CMS_F_CMS_DIGESTALGORITHM_FIND_CTX 115\n# define CMS_F_CMS_DIGESTALGORITHM_INIT_BIO 116\n# define CMS_F_CMS_DIGESTEDDATA_DO_FINAL 117\n# define CMS_F_CMS_DIGEST_VERIFY 118\n# define CMS_F_CMS_ENCODE_RECEIPT 161\n# define CMS_F_CMS_ENCRYPT 119\n# define CMS_F_CMS_ENCRYPTEDCONTENT_INIT 179\n# define CMS_F_CMS_ENCRYPTEDCONTENT_INIT_BIO 120\n# define CMS_F_CMS_ENCRYPTEDDATA_DECRYPT 121\n# define CMS_F_CMS_ENCRYPTEDDATA_ENCRYPT 122\n# define CMS_F_CMS_ENCRYPTEDDATA_SET1_KEY 123\n# define CMS_F_CMS_ENVELOPEDDATA_CREATE 124\n# define CMS_F_CMS_ENVELOPEDDATA_INIT_BIO 125\n# define CMS_F_CMS_ENVELOPED_DATA_INIT 126\n# define CMS_F_CMS_ENV_ASN1_CTRL 171\n# define CMS_F_CMS_FINAL 127\n# define CMS_F_CMS_GET0_CERTIFICATE_CHOICES 128\n# define CMS_F_CMS_GET0_CONTENT 129\n# define CMS_F_CMS_GET0_ECONTENT_TYPE 130\n# define CMS_F_CMS_GET0_ENVELOPED 131\n# define CMS_F_CMS_GET0_REVOCATION_CHOICES 132\n# define CMS_F_CMS_GET0_SIGNED 133\n# define CMS_F_CMS_MSGSIGDIGEST_ADD1 162\n# define CMS_F_CMS_RECEIPTREQUEST_CREATE0 159\n# define CMS_F_CMS_RECEIPT_VERIFY 160\n# define CMS_F_CMS_RECIPIENTINFO_DECRYPT 134\n# define CMS_F_CMS_RECIPIENTINFO_ENCRYPT 169\n# define CMS_F_CMS_RECIPIENTINFO_KARI_ENCRYPT 178\n# define CMS_F_CMS_RECIPIENTINFO_KARI_GET0_ALG 175\n# define CMS_F_CMS_RECIPIENTINFO_KARI_GET0_ORIG_ID 173\n# define CMS_F_CMS_RECIPIENTINFO_KARI_GET0_REKS 172\n# define CMS_F_CMS_RECIPIENTINFO_KARI_ORIG_ID_CMP 174\n# define CMS_F_CMS_RECIPIENTINFO_KEKRI_DECRYPT 135\n# define CMS_F_CMS_RECIPIENTINFO_KEKRI_ENCRYPT 136\n# define CMS_F_CMS_RECIPIENTINFO_KEKRI_GET0_ID 137\n# define CMS_F_CMS_RECIPIENTINFO_KEKRI_ID_CMP 138\n# define CMS_F_CMS_RECIPIENTINFO_KTRI_CERT_CMP 139\n# define CMS_F_CMS_RECIPIENTINFO_KTRI_DECRYPT 140\n# define CMS_F_CMS_RECIPIENTINFO_KTRI_ENCRYPT 141\n# define CMS_F_CMS_RECIPIENTINFO_KTRI_GET0_ALGS 142\n# define CMS_F_CMS_RECIPIENTINFO_KTRI_GET0_SIGNER_ID 143\n# define CMS_F_CMS_RECIPIENTINFO_PWRI_CRYPT 167\n# define CMS_F_CMS_RECIPIENTINFO_SET0_KEY 144\n# define CMS_F_CMS_RECIPIENTINFO_SET0_PASSWORD 168\n# define CMS_F_CMS_RECIPIENTINFO_SET0_PKEY 145\n# define CMS_F_CMS_SD_ASN1_CTRL 170\n# define CMS_F_CMS_SET1_IAS 176\n# define CMS_F_CMS_SET1_KEYID 177\n# define CMS_F_CMS_SET1_SIGNERIDENTIFIER 146\n# define CMS_F_CMS_SET_DETACHED 147\n# define CMS_F_CMS_SIGN 148\n# define CMS_F_CMS_SIGNED_DATA_INIT 149\n# define CMS_F_CMS_SIGNERINFO_CONTENT_SIGN 150\n# define CMS_F_CMS_SIGNERINFO_SIGN 151\n# define CMS_F_CMS_SIGNERINFO_VERIFY 152\n# define CMS_F_CMS_SIGNERINFO_VERIFY_CERT 153\n# define CMS_F_CMS_SIGNERINFO_VERIFY_CONTENT 154\n# define CMS_F_CMS_SIGN_RECEIPT 163\n# define CMS_F_CMS_SI_CHECK_ATTRIBUTES 183\n# define CMS_F_CMS_STREAM 155\n# define CMS_F_CMS_UNCOMPRESS 156\n# define CMS_F_CMS_VERIFY 157\n# define CMS_F_KEK_UNWRAP_KEY 180\n\n/*\n * CMS reason codes.\n */\n# define CMS_R_ADD_SIGNER_ERROR 99\n# define CMS_R_ATTRIBUTE_ERROR 161\n# define CMS_R_CERTIFICATE_ALREADY_PRESENT 175\n# define CMS_R_CERTIFICATE_HAS_NO_KEYID 160\n# define CMS_R_CERTIFICATE_VERIFY_ERROR 100\n# define CMS_R_CIPHER_INITIALISATION_ERROR 101\n# define CMS_R_CIPHER_PARAMETER_INITIALISATION_ERROR 102\n# define CMS_R_CMS_DATAFINAL_ERROR 103\n# define CMS_R_CMS_LIB 104\n# define CMS_R_CONTENTIDENTIFIER_MISMATCH 170\n# define CMS_R_CONTENT_NOT_FOUND 105\n# define CMS_R_CONTENT_TYPE_MISMATCH 171\n# define CMS_R_CONTENT_TYPE_NOT_COMPRESSED_DATA 106\n# define CMS_R_CONTENT_TYPE_NOT_ENVELOPED_DATA 107\n# define CMS_R_CONTENT_TYPE_NOT_SIGNED_DATA 108\n# define CMS_R_CONTENT_VERIFY_ERROR 109\n# define CMS_R_CTRL_ERROR 110\n# define CMS_R_CTRL_FAILURE 111\n# define CMS_R_DECRYPT_ERROR 112\n# define CMS_R_ERROR_GETTING_PUBLIC_KEY 113\n# define CMS_R_ERROR_READING_MESSAGEDIGEST_ATTRIBUTE 114\n# define CMS_R_ERROR_SETTING_KEY 115\n# define CMS_R_ERROR_SETTING_RECIPIENTINFO 116\n# define CMS_R_INVALID_ENCRYPTED_KEY_LENGTH 117\n# define CMS_R_INVALID_KEY_ENCRYPTION_PARAMETER 176\n# define CMS_R_INVALID_KEY_LENGTH 118\n# define CMS_R_MD_BIO_INIT_ERROR 119\n# define CMS_R_MESSAGEDIGEST_ATTRIBUTE_WRONG_LENGTH 120\n# define CMS_R_MESSAGEDIGEST_WRONG_LENGTH 121\n# define CMS_R_MSGSIGDIGEST_ERROR 172\n# define CMS_R_MSGSIGDIGEST_VERIFICATION_FAILURE 162\n# define CMS_R_MSGSIGDIGEST_WRONG_LENGTH 163\n# define CMS_R_NEED_ONE_SIGNER 164\n# define CMS_R_NOT_A_SIGNED_RECEIPT 165\n# define CMS_R_NOT_ENCRYPTED_DATA 122\n# define CMS_R_NOT_KEK 123\n# define CMS_R_NOT_KEY_AGREEMENT 181\n# define CMS_R_NOT_KEY_TRANSPORT 124\n# define CMS_R_NOT_PWRI 177\n# define CMS_R_NOT_SUPPORTED_FOR_THIS_KEY_TYPE 125\n# define CMS_R_NO_CIPHER 126\n# define CMS_R_NO_CONTENT 127\n# define CMS_R_NO_CONTENT_TYPE 173\n# define CMS_R_NO_DEFAULT_DIGEST 128\n# define CMS_R_NO_DIGEST_SET 129\n# define CMS_R_NO_KEY 130\n# define CMS_R_NO_KEY_OR_CERT 174\n# define CMS_R_NO_MATCHING_DIGEST 131\n# define CMS_R_NO_MATCHING_RECIPIENT 132\n# define CMS_R_NO_MATCHING_SIGNATURE 166\n# define CMS_R_NO_MSGSIGDIGEST 167\n# define CMS_R_NO_PASSWORD 178\n# define CMS_R_NO_PRIVATE_KEY 133\n# define CMS_R_NO_PUBLIC_KEY 134\n# define CMS_R_NO_RECEIPT_REQUEST 168\n# define CMS_R_NO_SIGNERS 135\n# define CMS_R_PRIVATE_KEY_DOES_NOT_MATCH_CERTIFICATE 136\n# define CMS_R_RECEIPT_DECODE_ERROR 169\n# define CMS_R_RECIPIENT_ERROR 137\n# define CMS_R_SIGNER_CERTIFICATE_NOT_FOUND 138\n# define CMS_R_SIGNFINAL_ERROR 139\n# define CMS_R_SMIME_TEXT_ERROR 140\n# define CMS_R_STORE_INIT_ERROR 141\n# define CMS_R_TYPE_NOT_COMPRESSED_DATA 142\n# define CMS_R_TYPE_NOT_DATA 143\n# define CMS_R_TYPE_NOT_DIGESTED_DATA 144\n# define CMS_R_TYPE_NOT_ENCRYPTED_DATA 145\n# define CMS_R_TYPE_NOT_ENVELOPED_DATA 146\n# define CMS_R_UNABLE_TO_FINALIZE_CONTEXT 147\n# define CMS_R_UNKNOWN_CIPHER 148\n# define CMS_R_UNKNOWN_DIGEST_ALGORITHM 149\n# define CMS_R_UNKNOWN_ID 150\n# define CMS_R_UNSUPPORTED_COMPRESSION_ALGORITHM 151\n# define CMS_R_UNSUPPORTED_CONTENT_TYPE 152\n# define CMS_R_UNSUPPORTED_KEK_ALGORITHM 153\n# define CMS_R_UNSUPPORTED_KEY_ENCRYPTION_ALGORITHM 179\n# define CMS_R_UNSUPPORTED_RECIPIENTINFO_TYPE 155\n# define CMS_R_UNSUPPORTED_RECIPIENT_TYPE 154\n# define CMS_R_UNSUPPORTED_TYPE 156\n# define CMS_R_UNWRAP_ERROR 157\n# define CMS_R_UNWRAP_FAILURE 180\n# define CMS_R_VERIFICATION_FAILURE 158\n# define CMS_R_WRAP_ERROR 159\n\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/comp.h", "content": "/*\n * Copyright 2015-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_COMP_H\n# define HEADER_COMP_H\n\n# include \n\n# ifndef OPENSSL_NO_COMP\n# include \n# include \n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n\n\nCOMP_CTX *COMP_CTX_new(COMP_METHOD *meth);\nconst COMP_METHOD *COMP_CTX_get_method(const COMP_CTX *ctx);\nint COMP_CTX_get_type(const COMP_CTX* comp);\nint COMP_get_type(const COMP_METHOD *meth);\nconst char *COMP_get_name(const COMP_METHOD *meth);\nvoid COMP_CTX_free(COMP_CTX *ctx);\n\nint COMP_compress_block(COMP_CTX *ctx, unsigned char *out, int olen,\n unsigned char *in, int ilen);\nint COMP_expand_block(COMP_CTX *ctx, unsigned char *out, int olen,\n unsigned char *in, int ilen);\n\nCOMP_METHOD *COMP_zlib(void);\n\n#if OPENSSL_API_COMPAT < 0x10100000L\n#define COMP_zlib_cleanup() while(0) continue\n#endif\n\n# ifdef HEADER_BIO_H\n# ifdef ZLIB\nconst BIO_METHOD *BIO_f_zlib(void);\n# endif\n# endif\n\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/comperr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_COMPERR_H\n# define HEADER_COMPERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# include \n\n# ifndef OPENSSL_NO_COMP\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_COMP_strings(void);\n\n/*\n * COMP function codes.\n */\n# define COMP_F_BIO_ZLIB_FLUSH 99\n# define COMP_F_BIO_ZLIB_NEW 100\n# define COMP_F_BIO_ZLIB_READ 101\n# define COMP_F_BIO_ZLIB_WRITE 102\n# define COMP_F_COMP_CTX_NEW 103\n\n/*\n * COMP reason codes.\n */\n# define COMP_R_ZLIB_DEFLATE_ERROR 99\n# define COMP_R_ZLIB_INFLATE_ERROR 100\n# define COMP_R_ZLIB_NOT_SUPPORTED 101\n\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/conf.h", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_CONF_H\n# define HEADER_CONF_H\n\n# include \n# include \n# include \n# include \n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\ntypedef struct {\n char *section;\n char *name;\n char *value;\n} CONF_VALUE;\n\nDEFINE_STACK_OF(CONF_VALUE)\nDEFINE_LHASH_OF(CONF_VALUE);\n\nstruct conf_st;\nstruct conf_method_st;\ntypedef struct conf_method_st CONF_METHOD;\n\nstruct conf_method_st {\n const char *name;\n CONF *(*create) (CONF_METHOD *meth);\n int (*init) (CONF *conf);\n int (*destroy) (CONF *conf);\n int (*destroy_data) (CONF *conf);\n int (*load_bio) (CONF *conf, BIO *bp, long *eline);\n int (*dump) (const CONF *conf, BIO *bp);\n int (*is_number) (const CONF *conf, char c);\n int (*to_int) (const CONF *conf, char c);\n int (*load) (CONF *conf, const char *name, long *eline);\n};\n\n/* Module definitions */\n\ntypedef struct conf_imodule_st CONF_IMODULE;\ntypedef struct conf_module_st CONF_MODULE;\n\nDEFINE_STACK_OF(CONF_MODULE)\nDEFINE_STACK_OF(CONF_IMODULE)\n\n/* DSO module function typedefs */\ntypedef int conf_init_func (CONF_IMODULE *md, const CONF *cnf);\ntypedef void conf_finish_func (CONF_IMODULE *md);\n\n# define CONF_MFLAGS_IGNORE_ERRORS 0x1\n# define CONF_MFLAGS_IGNORE_RETURN_CODES 0x2\n# define CONF_MFLAGS_SILENT 0x4\n# define CONF_MFLAGS_NO_DSO 0x8\n# define CONF_MFLAGS_IGNORE_MISSING_FILE 0x10\n# define CONF_MFLAGS_DEFAULT_SECTION 0x20\n\nint CONF_set_default_method(CONF_METHOD *meth);\nvoid CONF_set_nconf(CONF *conf, LHASH_OF(CONF_VALUE) *hash);\nLHASH_OF(CONF_VALUE) *CONF_load(LHASH_OF(CONF_VALUE) *conf, const char *file,\n long *eline);\n# ifndef OPENSSL_NO_STDIO\nLHASH_OF(CONF_VALUE) *CONF_load_fp(LHASH_OF(CONF_VALUE) *conf, FILE *fp,\n long *eline);\n# endif\nLHASH_OF(CONF_VALUE) *CONF_load_bio(LHASH_OF(CONF_VALUE) *conf, BIO *bp,\n long *eline);\nSTACK_OF(CONF_VALUE) *CONF_get_section(LHASH_OF(CONF_VALUE) *conf,\n const char *section);\nchar *CONF_get_string(LHASH_OF(CONF_VALUE) *conf, const char *group,\n const char *name);\nlong CONF_get_number(LHASH_OF(CONF_VALUE) *conf, const char *group,\n const char *name);\nvoid CONF_free(LHASH_OF(CONF_VALUE) *conf);\n#ifndef OPENSSL_NO_STDIO\nint CONF_dump_fp(LHASH_OF(CONF_VALUE) *conf, FILE *out);\n#endif\nint CONF_dump_bio(LHASH_OF(CONF_VALUE) *conf, BIO *out);\n\nDEPRECATEDIN_1_1_0(void OPENSSL_config(const char *config_name))\n\n#if OPENSSL_API_COMPAT < 0x10100000L\n# define OPENSSL_no_config() \\\n OPENSSL_init_crypto(OPENSSL_INIT_NO_LOAD_CONFIG, NULL)\n#endif\n\n/*\n * New conf code. The semantics are different from the functions above. If\n * that wasn't the case, the above functions would have been replaced\n */\n\nstruct conf_st {\n CONF_METHOD *meth;\n void *meth_data;\n LHASH_OF(CONF_VALUE) *data;\n};\n\nCONF *NCONF_new(CONF_METHOD *meth);\nCONF_METHOD *NCONF_default(void);\nCONF_METHOD *NCONF_WIN32(void);\nvoid NCONF_free(CONF *conf);\nvoid NCONF_free_data(CONF *conf);\n\nint NCONF_load(CONF *conf, const char *file, long *eline);\n# ifndef OPENSSL_NO_STDIO\nint NCONF_load_fp(CONF *conf, FILE *fp, long *eline);\n# endif\nint NCONF_load_bio(CONF *conf, BIO *bp, long *eline);\nSTACK_OF(CONF_VALUE) *NCONF_get_section(const CONF *conf,\n const char *section);\nchar *NCONF_get_string(const CONF *conf, const char *group, const char *name);\nint NCONF_get_number_e(const CONF *conf, const char *group, const char *name,\n long *result);\n#ifndef OPENSSL_NO_STDIO\nint NCONF_dump_fp(const CONF *conf, FILE *out);\n#endif\nint NCONF_dump_bio(const CONF *conf, BIO *out);\n\n#define NCONF_get_number(c,g,n,r) NCONF_get_number_e(c,g,n,r)\n\n/* Module functions */\n\nint CONF_modules_load(const CONF *cnf, const char *appname,\n unsigned long flags);\nint CONF_modules_load_file(const char *filename, const char *appname,\n unsigned long flags);\nvoid CONF_modules_unload(int all);\nvoid CONF_modules_finish(void);\n#if OPENSSL_API_COMPAT < 0x10100000L\n# define CONF_modules_free() while(0) continue\n#endif\nint CONF_module_add(const char *name, conf_init_func *ifunc,\n conf_finish_func *ffunc);\n\nconst char *CONF_imodule_get_name(const CONF_IMODULE *md);\nconst char *CONF_imodule_get_value(const CONF_IMODULE *md);\nvoid *CONF_imodule_get_usr_data(const CONF_IMODULE *md);\nvoid CONF_imodule_set_usr_data(CONF_IMODULE *md, void *usr_data);\nCONF_MODULE *CONF_imodule_get_module(const CONF_IMODULE *md);\nunsigned long CONF_imodule_get_flags(const CONF_IMODULE *md);\nvoid CONF_imodule_set_flags(CONF_IMODULE *md, unsigned long flags);\nvoid *CONF_module_get_usr_data(CONF_MODULE *pmod);\nvoid CONF_module_set_usr_data(CONF_MODULE *pmod, void *usr_data);\n\nchar *CONF_get1_default_config_file(void);\n\nint CONF_parse_list(const char *list, int sep, int nospc,\n int (*list_cb) (const char *elem, int len, void *usr),\n void *arg);\n\nvoid OPENSSL_load_builtin_modules(void);\n\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/conf_api.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_CONF_API_H\n# define HEADER_CONF_API_H\n\n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/* Up until OpenSSL 0.9.5a, this was new_section */\nCONF_VALUE *_CONF_new_section(CONF *conf, const char *section);\n/* Up until OpenSSL 0.9.5a, this was get_section */\nCONF_VALUE *_CONF_get_section(const CONF *conf, const char *section);\n/* Up until OpenSSL 0.9.5a, this was CONF_get_section */\nSTACK_OF(CONF_VALUE) *_CONF_get_section_values(const CONF *conf,\n const char *section);\n\nint _CONF_add_string(CONF *conf, CONF_VALUE *section, CONF_VALUE *value);\nchar *_CONF_get_string(const CONF *conf, const char *section,\n const char *name);\nlong _CONF_get_number(const CONF *conf, const char *section,\n const char *name);\n\nint _CONF_new_data(CONF *conf);\nvoid _CONF_free_data(CONF *conf);\n\n#ifdef __cplusplus\n}\n#endif\n#endif\n" }, { "path": "cryptomini/include/openssl/conferr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_CONFERR_H\n# define HEADER_CONFERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_CONF_strings(void);\n\n/*\n * CONF function codes.\n */\n# define CONF_F_CONF_DUMP_FP 104\n# define CONF_F_CONF_LOAD 100\n# define CONF_F_CONF_LOAD_FP 103\n# define CONF_F_CONF_PARSE_LIST 119\n# define CONF_F_DEF_LOAD 120\n# define CONF_F_DEF_LOAD_BIO 121\n# define CONF_F_GET_NEXT_FILE 107\n# define CONF_F_MODULE_ADD 122\n# define CONF_F_MODULE_INIT 115\n# define CONF_F_MODULE_LOAD_DSO 117\n# define CONF_F_MODULE_RUN 118\n# define CONF_F_NCONF_DUMP_BIO 105\n# define CONF_F_NCONF_DUMP_FP 106\n# define CONF_F_NCONF_GET_NUMBER_E 112\n# define CONF_F_NCONF_GET_SECTION 108\n# define CONF_F_NCONF_GET_STRING 109\n# define CONF_F_NCONF_LOAD 113\n# define CONF_F_NCONF_LOAD_BIO 110\n# define CONF_F_NCONF_LOAD_FP 114\n# define CONF_F_NCONF_NEW 111\n# define CONF_F_PROCESS_INCLUDE 116\n# define CONF_F_SSL_MODULE_INIT 123\n# define CONF_F_STR_COPY 101\n\n/*\n * CONF reason codes.\n */\n# define CONF_R_ERROR_LOADING_DSO 110\n# define CONF_R_LIST_CANNOT_BE_NULL 115\n# define CONF_R_MISSING_CLOSE_SQUARE_BRACKET 100\n# define CONF_R_MISSING_EQUAL_SIGN 101\n# define CONF_R_MISSING_INIT_FUNCTION 112\n# define CONF_R_MODULE_INITIALIZATION_ERROR 109\n# define CONF_R_NO_CLOSE_BRACE 102\n# define CONF_R_NO_CONF 105\n# define CONF_R_NO_CONF_OR_ENVIRONMENT_VARIABLE 106\n# define CONF_R_NO_SECTION 107\n# define CONF_R_NO_SUCH_FILE 114\n# define CONF_R_NO_VALUE 108\n# define CONF_R_NUMBER_TOO_LARGE 121\n# define CONF_R_RECURSIVE_DIRECTORY_INCLUDE 111\n# define CONF_R_SSL_COMMAND_SECTION_EMPTY 117\n# define CONF_R_SSL_COMMAND_SECTION_NOT_FOUND 118\n# define CONF_R_SSL_SECTION_EMPTY 119\n# define CONF_R_SSL_SECTION_NOT_FOUND 120\n# define CONF_R_UNABLE_TO_CREATE_NEW_SECTION 103\n# define CONF_R_UNKNOWN_MODULE_NAME 113\n# define CONF_R_VARIABLE_EXPANSION_TOO_LONG 116\n# define CONF_R_VARIABLE_HAS_NO_VALUE 104\n\n#endif\n" }, { "path": "cryptomini/include/openssl/crypto.h", "content": "/*\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_CRYPTO_H\n# define HEADER_CRYPTO_H\n\n# include \n# include \n\n# include \n\n# ifndef OPENSSL_NO_STDIO\n# include \n# endif\n\n# include \n# include \n# include \n# include \n# include \n\n# ifdef CHARSET_EBCDIC\n# include \n# endif\n\n/*\n * Resolve problems on some operating systems with symbol names that clash\n * one way or another\n */\n# include \n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# include \n# endif\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define SSLeay OpenSSL_version_num\n# define SSLeay_version OpenSSL_version\n# define SSLEAY_VERSION_NUMBER OPENSSL_VERSION_NUMBER\n# define SSLEAY_VERSION OPENSSL_VERSION\n# define SSLEAY_CFLAGS OPENSSL_CFLAGS\n# define SSLEAY_BUILT_ON OPENSSL_BUILT_ON\n# define SSLEAY_PLATFORM OPENSSL_PLATFORM\n# define SSLEAY_DIR OPENSSL_DIR\n\n/*\n * Old type for allocating dynamic locks. No longer used. Use the new thread\n * API instead.\n */\ntypedef struct {\n int dummy;\n} CRYPTO_dynlock;\n\n# endif /* OPENSSL_API_COMPAT */\n\ntypedef void CRYPTO_RWLOCK;\n\nCRYPTO_RWLOCK *CRYPTO_THREAD_lock_new(void);\nint CRYPTO_THREAD_read_lock(CRYPTO_RWLOCK *lock);\nint CRYPTO_THREAD_write_lock(CRYPTO_RWLOCK *lock);\nint CRYPTO_THREAD_unlock(CRYPTO_RWLOCK *lock);\nvoid CRYPTO_THREAD_lock_free(CRYPTO_RWLOCK *lock);\n\nint CRYPTO_atomic_add(int *val, int amount, int *ret, CRYPTO_RWLOCK *lock);\n\n/*\n * The following can be used to detect memory leaks in the library. If\n * used, it turns on malloc checking\n */\n# define CRYPTO_MEM_CHECK_OFF 0x0 /* Control only */\n# define CRYPTO_MEM_CHECK_ON 0x1 /* Control and mode bit */\n# define CRYPTO_MEM_CHECK_ENABLE 0x2 /* Control and mode bit */\n# define CRYPTO_MEM_CHECK_DISABLE 0x3 /* Control only */\n\nstruct crypto_ex_data_st {\n STACK_OF(void) *sk;\n};\nDEFINE_STACK_OF(void)\n\n/*\n * Per class, we have a STACK of function pointers.\n */\n# define CRYPTO_EX_INDEX_SSL 0\n# define CRYPTO_EX_INDEX_SSL_CTX 1\n# define CRYPTO_EX_INDEX_SSL_SESSION 2\n# define CRYPTO_EX_INDEX_X509 3\n# define CRYPTO_EX_INDEX_X509_STORE 4\n# define CRYPTO_EX_INDEX_X509_STORE_CTX 5\n# define CRYPTO_EX_INDEX_DH 6\n# define CRYPTO_EX_INDEX_DSA 7\n# define CRYPTO_EX_INDEX_EC_KEY 8\n# define CRYPTO_EX_INDEX_RSA 9\n# define CRYPTO_EX_INDEX_ENGINE 10\n# define CRYPTO_EX_INDEX_UI 11\n# define CRYPTO_EX_INDEX_BIO 12\n# define CRYPTO_EX_INDEX_APP 13\n# define CRYPTO_EX_INDEX_UI_METHOD 14\n# define CRYPTO_EX_INDEX_DRBG 15\n# define CRYPTO_EX_INDEX__COUNT 16\n\n/* No longer needed, so this is a no-op */\n#define OPENSSL_malloc_init() while(0) continue\n\nint CRYPTO_mem_ctrl(int mode);\n\n# define OPENSSL_malloc(num) \\\n CRYPTO_malloc(num, OPENSSL_FILE, OPENSSL_LINE)\n# define OPENSSL_zalloc(num) \\\n CRYPTO_zalloc(num, OPENSSL_FILE, OPENSSL_LINE)\n// # define OPENSSL_realloc(addr, num) \n// CRYPTO_realloc(addr, num, OPENSSL_FILE, OPENSSL_LINE)\n# define OPENSSL_clear_realloc(addr, old_num, num) \\\n CRYPTO_clear_realloc(addr, old_num, num, OPENSSL_FILE, OPENSSL_LINE)\n# define OPENSSL_clear_free(addr, num) \\\n CRYPTO_clear_free(addr, num, OPENSSL_FILE, OPENSSL_LINE)\n# define OPENSSL_free(addr) \\\n CRYPTO_free(addr, OPENSSL_FILE, OPENSSL_LINE)\n# define OPENSSL_memdup(str, s) \\\n CRYPTO_memdup((str), s, OPENSSL_FILE, OPENSSL_LINE)\n# define OPENSSL_strdup(str) \\\n CRYPTO_strdup(str, OPENSSL_FILE, OPENSSL_LINE)\n# define OPENSSL_strndup(str, n) \\\n CRYPTO_strndup(str, n, OPENSSL_FILE, OPENSSL_LINE)\n# define OPENSSL_secure_malloc(num) \\\n CRYPTO_secure_malloc(num, OPENSSL_FILE, OPENSSL_LINE)\n# define OPENSSL_secure_zalloc(num) \\\n CRYPTO_secure_zalloc(num, OPENSSL_FILE, OPENSSL_LINE)\n# define OPENSSL_secure_free(addr) \\\n CRYPTO_secure_free(addr, OPENSSL_FILE, OPENSSL_LINE)\n# define OPENSSL_secure_clear_free(addr, num) \\\n CRYPTO_secure_clear_free(addr, num, OPENSSL_FILE, OPENSSL_LINE)\n# define OPENSSL_secure_actual_size(ptr) \\\n CRYPTO_secure_actual_size(ptr)\n\nsize_t OPENSSL_strlcpy(char *dst, const char *src, size_t siz);\nsize_t OPENSSL_strlcat(char *dst, const char *src, size_t siz);\nsize_t OPENSSL_strnlen(const char *str, size_t maxlen);\nchar *OPENSSL_buf2hexstr(const unsigned char *buffer, long len);\nunsigned char *OPENSSL_hexstr2buf(const char *str, long *len);\nint OPENSSL_hexchar2int(unsigned char c);\n\n# define OPENSSL_MALLOC_MAX_NELEMS(type) (((1U<<(sizeof(int)*8-1))-1)/sizeof(type))\n\nunsigned long OpenSSL_version_num(void);\nconst char *OpenSSL_version(int type);\n# define OPENSSL_VERSION 0\n# define OPENSSL_CFLAGS 1\n# define OPENSSL_BUILT_ON 2\n# define OPENSSL_PLATFORM 3\n# define OPENSSL_DIR 4\n# define OPENSSL_ENGINES_DIR 5\n\nint OPENSSL_issetugid(void);\n\ntypedef void CRYPTO_EX_new (void *parent, void *ptr, CRYPTO_EX_DATA *ad,\n int idx, long argl, void *argp);\ntypedef void CRYPTO_EX_free (void *parent, void *ptr, CRYPTO_EX_DATA *ad,\n int idx, long argl, void *argp);\ntypedef int CRYPTO_EX_dup (CRYPTO_EX_DATA *to, const CRYPTO_EX_DATA *from,\n void *from_d, int idx, long argl, void *argp);\n__owur int CRYPTO_get_ex_new_index(int class_index, long argl, void *argp,\n CRYPTO_EX_new *new_func, CRYPTO_EX_dup *dup_func,\n CRYPTO_EX_free *free_func);\n/* No longer use an index. */\nint CRYPTO_free_ex_index(int class_index, int idx);\n\n/*\n * Initialise/duplicate/free CRYPTO_EX_DATA variables corresponding to a\n * given class (invokes whatever per-class callbacks are applicable)\n */\nint CRYPTO_new_ex_data(int class_index, void *obj, CRYPTO_EX_DATA *ad);\nint CRYPTO_dup_ex_data(int class_index, CRYPTO_EX_DATA *to,\n const CRYPTO_EX_DATA *from);\n\nvoid CRYPTO_free_ex_data(int class_index, void *obj, CRYPTO_EX_DATA *ad);\n\n/*\n * Get/set data in a CRYPTO_EX_DATA variable corresponding to a particular\n * index (relative to the class type involved)\n */\nint CRYPTO_set_ex_data(CRYPTO_EX_DATA *ad, int idx, void *val);\nvoid *CRYPTO_get_ex_data(const CRYPTO_EX_DATA *ad, int idx);\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n/*\n * This function cleans up all \"ex_data\" state. It mustn't be called under\n * potential race-conditions.\n */\n# define CRYPTO_cleanup_all_ex_data() while(0) continue\n\n/*\n * The old locking functions have been removed completely without compatibility\n * macros. This is because the old functions either could not properly report\n * errors, or the returned error values were not clearly documented.\n * Replacing the locking functions with no-ops would cause race condition\n * issues in the affected applications. It is far better for them to fail at\n * compile time.\n * On the other hand, the locking callbacks are no longer used. Consequently,\n * the callback management functions can be safely replaced with no-op macros.\n */\n# define CRYPTO_num_locks() (1)\n# define CRYPTO_set_locking_callback(func)\n# define CRYPTO_get_locking_callback() (NULL)\n# define CRYPTO_set_add_lock_callback(func)\n# define CRYPTO_get_add_lock_callback() (NULL)\n\n/*\n * These defines where used in combination with the old locking callbacks,\n * they are not called anymore, but old code that's not called might still\n * use them.\n */\n# define CRYPTO_LOCK 1\n# define CRYPTO_UNLOCK 2\n# define CRYPTO_READ 4\n# define CRYPTO_WRITE 8\n\n/* This structure is no longer used */\ntypedef struct crypto_threadid_st {\n int dummy;\n} CRYPTO_THREADID;\n/* Only use CRYPTO_THREADID_set_[numeric|pointer]() within callbacks */\n# define CRYPTO_THREADID_set_numeric(id, val)\n# define CRYPTO_THREADID_set_pointer(id, ptr)\n# define CRYPTO_THREADID_set_callback(threadid_func) (0)\n# define CRYPTO_THREADID_get_callback() (NULL)\n# define CRYPTO_THREADID_current(id)\n# define CRYPTO_THREADID_cmp(a, b) (-1)\n# define CRYPTO_THREADID_cpy(dest, src)\n# define CRYPTO_THREADID_hash(id) (0UL)\n\n# if OPENSSL_API_COMPAT < 0x10000000L\n# define CRYPTO_set_id_callback(func)\n# define CRYPTO_get_id_callback() (NULL)\n# define CRYPTO_thread_id() (0UL)\n# endif /* OPENSSL_API_COMPAT < 0x10000000L */\n\n# define CRYPTO_set_dynlock_create_callback(dyn_create_function)\n# define CRYPTO_set_dynlock_lock_callback(dyn_lock_function)\n# define CRYPTO_set_dynlock_destroy_callback(dyn_destroy_function)\n# define CRYPTO_get_dynlock_create_callback() (NULL)\n# define CRYPTO_get_dynlock_lock_callback() (NULL)\n# define CRYPTO_get_dynlock_destroy_callback() (NULL)\n# endif /* OPENSSL_API_COMPAT < 0x10100000L */\n\nint CRYPTO_set_mem_functions(\n void *(*m) (size_t, const char *, int),\n void *(*r) (void *, size_t, const char *, int),\n void (*f) (void *, const char *, int));\nint CRYPTO_set_mem_debug(int flag);\nvoid CRYPTO_get_mem_functions(\n void *(**m) (size_t, const char *, int),\n void *(**r) (void *, size_t, const char *, int),\n void (**f) (void *, const char *, int));\n\nvoid *CRYPTO_malloc(size_t num, const char *file, int line);\nvoid *CRYPTO_zalloc(size_t num, const char *file, int line);\nvoid *CRYPTO_memdup(const void *str, size_t siz, const char *file, int line);\nchar *CRYPTO_strdup(const char *str, const char *file, int line);\nchar *CRYPTO_strndup(const char *str, size_t s, const char *file, int line);\nvoid CRYPTO_free(void *ptr, const char *file, int line);\nvoid CRYPTO_clear_free(void *ptr, size_t num, const char *file, int line);\nvoid *CRYPTO_realloc(void *addr, size_t num, const char *file, int line);\nvoid *CRYPTO_clear_realloc(void *addr, size_t old_num, size_t num,\n const char *file, int line);\n\nint CRYPTO_secure_malloc_init(size_t sz, int minsize);\nint CRYPTO_secure_malloc_done(void);\nvoid *CRYPTO_secure_malloc(size_t num, const char *file, int line);\nvoid *CRYPTO_secure_zalloc(size_t num, const char *file, int line);\nvoid CRYPTO_secure_free(void *ptr, const char *file, int line);\nvoid CRYPTO_secure_clear_free(void *ptr, size_t num,\n const char *file, int line);\nint CRYPTO_secure_allocated(const void *ptr);\nint CRYPTO_secure_malloc_initialized(void);\nsize_t CRYPTO_secure_actual_size(void *ptr);\nsize_t CRYPTO_secure_used(void);\n\nvoid OPENSSL_cleanse(void *ptr, size_t len);\n\n# ifndef OPENSSL_NO_CRYPTO_MDEBUG\n# define OPENSSL_mem_debug_push(info) \\\n CRYPTO_mem_debug_push(info, OPENSSL_FILE, OPENSSL_LINE)\n# define OPENSSL_mem_debug_pop() \\\n CRYPTO_mem_debug_pop()\nint CRYPTO_mem_debug_push(const char *info, const char *file, int line);\nint CRYPTO_mem_debug_pop(void);\nvoid CRYPTO_get_alloc_counts(int *mcount, int *rcount, int *fcount);\n\n/*-\n * Debugging functions (enabled by CRYPTO_set_mem_debug(1))\n * The flag argument has the following significance:\n * 0: called before the actual memory allocation has taken place\n * 1: called after the actual memory allocation has taken place\n */\nvoid CRYPTO_mem_debug_malloc(void *addr, size_t num, int flag,\n const char *file, int line);\nvoid CRYPTO_mem_debug_realloc(void *addr1, void *addr2, size_t num, int flag,\n const char *file, int line);\nvoid CRYPTO_mem_debug_free(void *addr, int flag,\n const char *file, int line);\n\nint CRYPTO_mem_leaks_cb(int (*cb) (const char *str, size_t len, void *u),\n void *u);\n# ifndef OPENSSL_NO_STDIO\nint CRYPTO_mem_leaks_fp(FILE *);\n# endif\nint CRYPTO_mem_leaks(BIO *bio);\n# endif\n\n/* die if we have to */\nossl_noreturn void OPENSSL_die(const char *assertion, const char *file, int line);\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define OpenSSLDie(f,l,a) OPENSSL_die((a),(f),(l))\n# endif\n# define OPENSSL_assert(e) \\\n (void)((e) ? 0 : (OPENSSL_die(\"assertion failed: \" #e, OPENSSL_FILE, OPENSSL_LINE), 1))\n\nint OPENSSL_isservice(void);\n\nint FIPS_mode(void);\nint FIPS_mode_set(int r);\n\nvoid OPENSSL_init(void);\n# ifdef OPENSSL_SYS_UNIX\nvoid OPENSSL_fork_prepare(void);\nvoid OPENSSL_fork_parent(void);\nvoid OPENSSL_fork_child(void);\n# endif\n\nstruct tm *OPENSSL_gmtime(const time_t *timer, struct tm *result);\nint OPENSSL_gmtime_adj(struct tm *tm, int offset_day, long offset_sec);\nint OPENSSL_gmtime_diff(int *pday, int *psec,\n const struct tm *from, const struct tm *to);\n\n/*\n * CRYPTO_memcmp returns zero iff the |len| bytes at |a| and |b| are equal.\n * It takes an amount of time dependent on |len|, but independent of the\n * contents of |a| and |b|. Unlike memcmp, it cannot be used to put elements\n * into a defined order as the return value when a != b is undefined, other\n * than to be non-zero.\n */\nint CRYPTO_memcmp(const void * in_a, const void * in_b, size_t len);\n\n/* Standard initialisation options */\n# define OPENSSL_INIT_NO_LOAD_CRYPTO_STRINGS 0x00000001L\n# define OPENSSL_INIT_LOAD_CRYPTO_STRINGS 0x00000002L\n# define OPENSSL_INIT_ADD_ALL_CIPHERS 0x00000004L\n# define OPENSSL_INIT_ADD_ALL_DIGESTS 0x00000008L\n# define OPENSSL_INIT_NO_ADD_ALL_CIPHERS 0x00000010L\n# define OPENSSL_INIT_NO_ADD_ALL_DIGESTS 0x00000020L\n# define OPENSSL_INIT_LOAD_CONFIG 0x00000040L\n# define OPENSSL_INIT_NO_LOAD_CONFIG 0x00000080L\n# define OPENSSL_INIT_ASYNC 0x00000100L\n# define OPENSSL_INIT_ENGINE_RDRAND 0x00000200L\n# define OPENSSL_INIT_ENGINE_DYNAMIC 0x00000400L\n# define OPENSSL_INIT_ENGINE_OPENSSL 0x00000800L\n# define OPENSSL_INIT_ENGINE_CRYPTODEV 0x00001000L\n# define OPENSSL_INIT_ENGINE_CAPI 0x00002000L\n# define OPENSSL_INIT_ENGINE_PADLOCK 0x00004000L\n# define OPENSSL_INIT_ENGINE_AFALG 0x00008000L\n/* OPENSSL_INIT_ZLIB 0x00010000L */\n# define OPENSSL_INIT_ATFORK 0x00020000L\n/* OPENSSL_INIT_BASE_ONLY 0x00040000L */\n# define OPENSSL_INIT_NO_ATEXIT 0x00080000L\n/* OPENSSL_INIT flag range 0xfff00000 reserved for OPENSSL_init_ssl() */\n/* Max OPENSSL_INIT flag value is 0x80000000 */\n\n/* openssl and dasync not counted as builtin */\n# define OPENSSL_INIT_ENGINE_ALL_BUILTIN \\\n (OPENSSL_INIT_ENGINE_RDRAND | OPENSSL_INIT_ENGINE_DYNAMIC \\\n | OPENSSL_INIT_ENGINE_CRYPTODEV | OPENSSL_INIT_ENGINE_CAPI | \\\n OPENSSL_INIT_ENGINE_PADLOCK)\n\n\n/* Library initialisation functions */\nvoid OPENSSL_cleanup(void);\nint OPENSSL_init_crypto(uint64_t opts, const OPENSSL_INIT_SETTINGS *settings);\nint OPENSSL_atexit(void (*handler)(void));\nvoid OPENSSL_thread_stop(void);\n\n/* Low-level control of initialization */\nOPENSSL_INIT_SETTINGS *OPENSSL_INIT_new(void);\n# ifndef OPENSSL_NO_STDIO\nint OPENSSL_INIT_set_config_filename(OPENSSL_INIT_SETTINGS *settings,\n const char *config_filename);\nvoid OPENSSL_INIT_set_config_file_flags(OPENSSL_INIT_SETTINGS *settings,\n unsigned long flags);\nint OPENSSL_INIT_set_config_appname(OPENSSL_INIT_SETTINGS *settings,\n const char *config_appname);\n# endif\nvoid OPENSSL_INIT_free(OPENSSL_INIT_SETTINGS *settings);\n\n# if defined(OPENSSL_THREADS) && !defined(CRYPTO_TDEBUG)\n# if defined(_WIN32)\n# if defined(BASETYPES) || defined(_WINDEF_H)\n/* application has to include in order to use this */\ntypedef DWORD CRYPTO_THREAD_LOCAL;\ntypedef DWORD CRYPTO_THREAD_ID;\n\ntypedef LONG CRYPTO_ONCE;\n# define CRYPTO_ONCE_STATIC_INIT 0\n# endif\n# else\n# include \ntypedef pthread_once_t CRYPTO_ONCE;\ntypedef pthread_key_t CRYPTO_THREAD_LOCAL;\ntypedef pthread_t CRYPTO_THREAD_ID;\n\n# define CRYPTO_ONCE_STATIC_INIT PTHREAD_ONCE_INIT\n# endif\n# endif\n\n# if !defined(CRYPTO_ONCE_STATIC_INIT)\ntypedef unsigned int CRYPTO_ONCE;\ntypedef unsigned int CRYPTO_THREAD_LOCAL;\ntypedef unsigned int CRYPTO_THREAD_ID;\n# define CRYPTO_ONCE_STATIC_INIT 0\n# endif\n\nint CRYPTO_THREAD_run_once(CRYPTO_ONCE *once, void (*init)(void));\n\nint CRYPTO_THREAD_init_local(CRYPTO_THREAD_LOCAL *key, void (*cleanup)(void *));\nvoid *CRYPTO_THREAD_get_local(CRYPTO_THREAD_LOCAL *key);\nint CRYPTO_THREAD_set_local(CRYPTO_THREAD_LOCAL *key, void *val);\nint CRYPTO_THREAD_cleanup_local(CRYPTO_THREAD_LOCAL *key);\n\nCRYPTO_THREAD_ID CRYPTO_THREAD_get_current_id(void);\nint CRYPTO_THREAD_compare_id(CRYPTO_THREAD_ID a, CRYPTO_THREAD_ID b);\n\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/cryptoerr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_CRYPTOERR_H\n# define HEADER_CRYPTOERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_CRYPTO_strings(void);\n\n/*\n * CRYPTO function codes.\n */\n# define CRYPTO_F_CMAC_CTX_NEW 120\n# define CRYPTO_F_CRYPTO_DUP_EX_DATA 110\n# define CRYPTO_F_CRYPTO_FREE_EX_DATA 111\n# define CRYPTO_F_CRYPTO_GET_EX_NEW_INDEX 100\n# define CRYPTO_F_CRYPTO_MEMDUP 115\n# define CRYPTO_F_CRYPTO_NEW_EX_DATA 112\n# define CRYPTO_F_CRYPTO_OCB128_COPY_CTX 121\n# define CRYPTO_F_CRYPTO_OCB128_INIT 122\n# define CRYPTO_F_CRYPTO_SET_EX_DATA 102\n# define CRYPTO_F_FIPS_MODE_SET 109\n# define CRYPTO_F_GET_AND_LOCK 113\n# define CRYPTO_F_OPENSSL_ATEXIT 114\n# define CRYPTO_F_OPENSSL_BUF2HEXSTR 117\n# define CRYPTO_F_OPENSSL_FOPEN 119\n# define CRYPTO_F_OPENSSL_HEXSTR2BUF 118\n# define CRYPTO_F_OPENSSL_INIT_CRYPTO 116\n# define CRYPTO_F_OPENSSL_LH_NEW 126\n# define CRYPTO_F_OPENSSL_SK_DEEP_COPY 127\n# define CRYPTO_F_OPENSSL_SK_DUP 128\n# define CRYPTO_F_PKEY_HMAC_INIT 123\n# define CRYPTO_F_PKEY_POLY1305_INIT 124\n# define CRYPTO_F_PKEY_SIPHASH_INIT 125\n# define CRYPTO_F_SK_RESERVE 129\n\n/*\n * CRYPTO reason codes.\n */\n# define CRYPTO_R_FIPS_MODE_NOT_SUPPORTED 101\n# define CRYPTO_R_ILLEGAL_HEX_DIGIT 102\n# define CRYPTO_R_ODD_NUMBER_OF_DIGITS 103\n\n#endif\n" }, { "path": "cryptomini/include/openssl/ct.h", "content": "/*\n * Copyright 2016-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_CT_H\n# define HEADER_CT_H\n\n# include \n\n# ifndef OPENSSL_NO_CT\n# include \n# include \n# include \n# include \n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n\n/* Minimum RSA key size, from RFC6962 */\n# define SCT_MIN_RSA_BITS 2048\n\n/* All hashes are SHA256 in v1 of Certificate Transparency */\n# define CT_V1_HASHLEN SHA256_DIGEST_LENGTH\n\ntypedef enum {\n CT_LOG_ENTRY_TYPE_NOT_SET = -1,\n CT_LOG_ENTRY_TYPE_X509 = 0,\n CT_LOG_ENTRY_TYPE_PRECERT = 1\n} ct_log_entry_type_t;\n\ntypedef enum {\n SCT_VERSION_NOT_SET = -1,\n SCT_VERSION_V1 = 0\n} sct_version_t;\n\ntypedef enum {\n SCT_SOURCE_UNKNOWN,\n SCT_SOURCE_TLS_EXTENSION,\n SCT_SOURCE_X509V3_EXTENSION,\n SCT_SOURCE_OCSP_STAPLED_RESPONSE\n} sct_source_t;\n\ntypedef enum {\n SCT_VALIDATION_STATUS_NOT_SET,\n SCT_VALIDATION_STATUS_UNKNOWN_LOG,\n SCT_VALIDATION_STATUS_VALID,\n SCT_VALIDATION_STATUS_INVALID,\n SCT_VALIDATION_STATUS_UNVERIFIED,\n SCT_VALIDATION_STATUS_UNKNOWN_VERSION\n} sct_validation_status_t;\n\nDEFINE_STACK_OF(SCT)\nDEFINE_STACK_OF(CTLOG)\n\n/******************************************\n * CT policy evaluation context functions *\n ******************************************/\n\n/*\n * Creates a new, empty policy evaluation context.\n * The caller is responsible for calling CT_POLICY_EVAL_CTX_free when finished\n * with the CT_POLICY_EVAL_CTX.\n */\nCT_POLICY_EVAL_CTX *CT_POLICY_EVAL_CTX_new(void);\n\n/* Deletes a policy evaluation context and anything it owns. */\nvoid CT_POLICY_EVAL_CTX_free(CT_POLICY_EVAL_CTX *ctx);\n\n/* Gets the peer certificate that the SCTs are for */\nX509* CT_POLICY_EVAL_CTX_get0_cert(const CT_POLICY_EVAL_CTX *ctx);\n\n/*\n * Sets the certificate associated with the received SCTs.\n * Increments the reference count of cert.\n * Returns 1 on success, 0 otherwise.\n */\nint CT_POLICY_EVAL_CTX_set1_cert(CT_POLICY_EVAL_CTX *ctx, X509 *cert);\n\n/* Gets the issuer of the aforementioned certificate */\nX509* CT_POLICY_EVAL_CTX_get0_issuer(const CT_POLICY_EVAL_CTX *ctx);\n\n/*\n * Sets the issuer of the certificate associated with the received SCTs.\n * Increments the reference count of issuer.\n * Returns 1 on success, 0 otherwise.\n */\nint CT_POLICY_EVAL_CTX_set1_issuer(CT_POLICY_EVAL_CTX *ctx, X509 *issuer);\n\n/* Gets the CT logs that are trusted sources of SCTs */\nconst CTLOG_STORE *CT_POLICY_EVAL_CTX_get0_log_store(const CT_POLICY_EVAL_CTX *ctx);\n\n/* Sets the log store that is in use. It must outlive the CT_POLICY_EVAL_CTX. */\nvoid CT_POLICY_EVAL_CTX_set_shared_CTLOG_STORE(CT_POLICY_EVAL_CTX *ctx,\n CTLOG_STORE *log_store);\n\n/*\n * Gets the time, in milliseconds since the Unix epoch, that will be used as the\n * current time when checking whether an SCT was issued in the future.\n * Such SCTs will fail validation, as required by RFC6962.\n */\nuint64_t CT_POLICY_EVAL_CTX_get_time(const CT_POLICY_EVAL_CTX *ctx);\n\n/*\n * Sets the time to evaluate SCTs against, in milliseconds since the Unix epoch.\n * If an SCT's timestamp is after this time, it will be interpreted as having\n * been issued in the future. RFC6962 states that \"TLS clients MUST reject SCTs\n * whose timestamp is in the future\", so an SCT will not validate in this case.\n */\nvoid CT_POLICY_EVAL_CTX_set_time(CT_POLICY_EVAL_CTX *ctx, uint64_t time_in_ms);\n\n/*****************\n * SCT functions *\n *****************/\n\n/*\n * Creates a new, blank SCT.\n * The caller is responsible for calling SCT_free when finished with the SCT.\n */\nSCT *SCT_new(void);\n\n/*\n * Creates a new SCT from some base64-encoded strings.\n * The caller is responsible for calling SCT_free when finished with the SCT.\n */\nSCT *SCT_new_from_base64(unsigned char version,\n const char *logid_base64,\n ct_log_entry_type_t entry_type,\n uint64_t timestamp,\n const char *extensions_base64,\n const char *signature_base64);\n\n/*\n * Frees the SCT and the underlying data structures.\n */\nvoid SCT_free(SCT *sct);\n\n/*\n * Free a stack of SCTs, and the underlying SCTs themselves.\n * Intended to be compatible with X509V3_EXT_FREE.\n */\nvoid SCT_LIST_free(STACK_OF(SCT) *a);\n\n/*\n * Returns the version of the SCT.\n */\nsct_version_t SCT_get_version(const SCT *sct);\n\n/*\n * Set the version of an SCT.\n * Returns 1 on success, 0 if the version is unrecognized.\n */\n__owur int SCT_set_version(SCT *sct, sct_version_t version);\n\n/*\n * Returns the log entry type of the SCT.\n */\nct_log_entry_type_t SCT_get_log_entry_type(const SCT *sct);\n\n/*\n * Set the log entry type of an SCT.\n * Returns 1 on success, 0 otherwise.\n */\n__owur int SCT_set_log_entry_type(SCT *sct, ct_log_entry_type_t entry_type);\n\n/*\n * Gets the ID of the log that an SCT came from.\n * Ownership of the log ID remains with the SCT.\n * Returns the length of the log ID.\n */\nsize_t SCT_get0_log_id(const SCT *sct, unsigned char **log_id);\n\n/*\n * Set the log ID of an SCT to point directly to the *log_id specified.\n * The SCT takes ownership of the specified pointer.\n * Returns 1 on success, 0 otherwise.\n */\n__owur int SCT_set0_log_id(SCT *sct, unsigned char *log_id, size_t log_id_len);\n\n/*\n * Set the log ID of an SCT.\n * This makes a copy of the log_id.\n * Returns 1 on success, 0 otherwise.\n */\n__owur int SCT_set1_log_id(SCT *sct, const unsigned char *log_id,\n size_t log_id_len);\n\n/*\n * Returns the timestamp for the SCT (epoch time in milliseconds).\n */\nuint64_t SCT_get_timestamp(const SCT *sct);\n\n/*\n * Set the timestamp of an SCT (epoch time in milliseconds).\n */\nvoid SCT_set_timestamp(SCT *sct, uint64_t timestamp);\n\n/*\n * Return the NID for the signature used by the SCT.\n * For CT v1, this will be either NID_sha256WithRSAEncryption or\n * NID_ecdsa_with_SHA256 (or NID_undef if incorrect/unset).\n */\nint SCT_get_signature_nid(const SCT *sct);\n\n/*\n * Set the signature type of an SCT\n * For CT v1, this should be either NID_sha256WithRSAEncryption or\n * NID_ecdsa_with_SHA256.\n * Returns 1 on success, 0 otherwise.\n */\n__owur int SCT_set_signature_nid(SCT *sct, int nid);\n\n/*\n * Set *ext to point to the extension data for the SCT. ext must not be NULL.\n * The SCT retains ownership of this pointer.\n * Returns length of the data pointed to.\n */\nsize_t SCT_get0_extensions(const SCT *sct, unsigned char **ext);\n\n/*\n * Set the extensions of an SCT to point directly to the *ext specified.\n * The SCT takes ownership of the specified pointer.\n */\nvoid SCT_set0_extensions(SCT *sct, unsigned char *ext, size_t ext_len);\n\n/*\n * Set the extensions of an SCT.\n * This takes a copy of the ext.\n * Returns 1 on success, 0 otherwise.\n */\n__owur int SCT_set1_extensions(SCT *sct, const unsigned char *ext,\n size_t ext_len);\n\n/*\n * Set *sig to point to the signature for the SCT. sig must not be NULL.\n * The SCT retains ownership of this pointer.\n * Returns length of the data pointed to.\n */\nsize_t SCT_get0_signature(const SCT *sct, unsigned char **sig);\n\n/*\n * Set the signature of an SCT to point directly to the *sig specified.\n * The SCT takes ownership of the specified pointer.\n */\nvoid SCT_set0_signature(SCT *sct, unsigned char *sig, size_t sig_len);\n\n/*\n * Set the signature of an SCT to be a copy of the *sig specified.\n * Returns 1 on success, 0 otherwise.\n */\n__owur int SCT_set1_signature(SCT *sct, const unsigned char *sig,\n size_t sig_len);\n\n/*\n * The origin of this SCT, e.g. TLS extension, OCSP response, etc.\n */\nsct_source_t SCT_get_source(const SCT *sct);\n\n/*\n * Set the origin of this SCT, e.g. TLS extension, OCSP response, etc.\n * Returns 1 on success, 0 otherwise.\n */\n__owur int SCT_set_source(SCT *sct, sct_source_t source);\n\n/*\n * Returns a text string describing the validation status of |sct|.\n */\nconst char *SCT_validation_status_string(const SCT *sct);\n\n/*\n * Pretty-prints an |sct| to |out|.\n * It will be indented by the number of spaces specified by |indent|.\n * If |logs| is not NULL, it will be used to lookup the CT log that the SCT came\n * from, so that the log name can be printed.\n */\nvoid SCT_print(const SCT *sct, BIO *out, int indent, const CTLOG_STORE *logs);\n\n/*\n * Pretty-prints an |sct_list| to |out|.\n * It will be indented by the number of spaces specified by |indent|.\n * SCTs will be delimited by |separator|.\n * If |logs| is not NULL, it will be used to lookup the CT log that each SCT\n * came from, so that the log names can be printed.\n */\nvoid SCT_LIST_print(const STACK_OF(SCT) *sct_list, BIO *out, int indent,\n const char *separator, const CTLOG_STORE *logs);\n\n/*\n * Gets the last result of validating this SCT.\n * If it has not been validated yet, returns SCT_VALIDATION_STATUS_NOT_SET.\n */\nsct_validation_status_t SCT_get_validation_status(const SCT *sct);\n\n/*\n * Validates the given SCT with the provided context.\n * Sets the \"validation_status\" field of the SCT.\n * Returns 1 if the SCT is valid and the signature verifies.\n * Returns 0 if the SCT is invalid or could not be verified.\n * Returns -1 if an error occurs.\n */\n__owur int SCT_validate(SCT *sct, const CT_POLICY_EVAL_CTX *ctx);\n\n/*\n * Validates the given list of SCTs with the provided context.\n * Sets the \"validation_status\" field of each SCT.\n * Returns 1 if there are no invalid SCTs and all signatures verify.\n * Returns 0 if at least one SCT is invalid or could not be verified.\n * Returns a negative integer if an error occurs.\n */\n__owur int SCT_LIST_validate(const STACK_OF(SCT) *scts,\n CT_POLICY_EVAL_CTX *ctx);\n\n\n/*********************************\n * SCT parsing and serialisation *\n *********************************/\n\n/*\n * Serialize (to TLS format) a stack of SCTs and return the length.\n * \"a\" must not be NULL.\n * If \"pp\" is NULL, just return the length of what would have been serialized.\n * If \"pp\" is not NULL and \"*pp\" is null, function will allocate a new pointer\n * for data that caller is responsible for freeing (only if function returns\n * successfully).\n * If \"pp\" is NULL and \"*pp\" is not NULL, caller is responsible for ensuring\n * that \"*pp\" is large enough to accept all of the serialized data.\n * Returns < 0 on error, >= 0 indicating bytes written (or would have been)\n * on success.\n */\n__owur int i2o_SCT_LIST(const STACK_OF(SCT) *a, unsigned char **pp);\n\n/*\n * Convert TLS format SCT list to a stack of SCTs.\n * If \"a\" or \"*a\" is NULL, a new stack will be created that the caller is\n * responsible for freeing (by calling SCT_LIST_free).\n * \"**pp\" and \"*pp\" must not be NULL.\n * Upon success, \"*pp\" will point to after the last bytes read, and a stack\n * will be returned.\n * Upon failure, a NULL pointer will be returned, and the position of \"*pp\" is\n * not defined.\n */\nSTACK_OF(SCT) *o2i_SCT_LIST(STACK_OF(SCT) **a, const unsigned char **pp,\n size_t len);\n\n/*\n * Serialize (to DER format) a stack of SCTs and return the length.\n * \"a\" must not be NULL.\n * If \"pp\" is NULL, just returns the length of what would have been serialized.\n * If \"pp\" is not NULL and \"*pp\" is null, function will allocate a new pointer\n * for data that caller is responsible for freeing (only if function returns\n * successfully).\n * If \"pp\" is NULL and \"*pp\" is not NULL, caller is responsible for ensuring\n * that \"*pp\" is large enough to accept all of the serialized data.\n * Returns < 0 on error, >= 0 indicating bytes written (or would have been)\n * on success.\n */\n__owur int i2d_SCT_LIST(const STACK_OF(SCT) *a, unsigned char **pp);\n\n/*\n * Parses an SCT list in DER format and returns it.\n * If \"a\" or \"*a\" is NULL, a new stack will be created that the caller is\n * responsible for freeing (by calling SCT_LIST_free).\n * \"**pp\" and \"*pp\" must not be NULL.\n * Upon success, \"*pp\" will point to after the last bytes read, and a stack\n * will be returned.\n * Upon failure, a NULL pointer will be returned, and the position of \"*pp\" is\n * not defined.\n */\nSTACK_OF(SCT) *d2i_SCT_LIST(STACK_OF(SCT) **a, const unsigned char **pp,\n long len);\n\n/*\n * Serialize (to TLS format) an |sct| and write it to |out|.\n * If |out| is null, no SCT will be output but the length will still be returned.\n * If |out| points to a null pointer, a string will be allocated to hold the\n * TLS-format SCT. It is the responsibility of the caller to free it.\n * If |out| points to an allocated string, the TLS-format SCT will be written\n * to it.\n * The length of the SCT in TLS format will be returned.\n */\n__owur int i2o_SCT(const SCT *sct, unsigned char **out);\n\n/*\n * Parses an SCT in TLS format and returns it.\n * If |psct| is not null, it will end up pointing to the parsed SCT. If it\n * already points to a non-null pointer, the pointer will be free'd.\n * |in| should be a pointer to a string containing the TLS-format SCT.\n * |in| will be advanced to the end of the SCT if parsing succeeds.\n * |len| should be the length of the SCT in |in|.\n * Returns NULL if an error occurs.\n * If the SCT is an unsupported version, only the SCT's 'sct' and 'sct_len'\n * fields will be populated (with |in| and |len| respectively).\n */\nSCT *o2i_SCT(SCT **psct, const unsigned char **in, size_t len);\n\n/********************\n * CT log functions *\n ********************/\n\n/*\n * Creates a new CT log instance with the given |public_key| and |name|.\n * Takes ownership of |public_key| but copies |name|.\n * Returns NULL if malloc fails or if |public_key| cannot be converted to DER.\n * Should be deleted by the caller using CTLOG_free when no longer needed.\n */\nCTLOG *CTLOG_new(EVP_PKEY *public_key, const char *name);\n\n/*\n * Creates a new CTLOG instance with the base64-encoded SubjectPublicKeyInfo DER\n * in |pkey_base64|. The |name| is a string to help users identify this log.\n * Returns 1 on success, 0 on failure.\n * Should be deleted by the caller using CTLOG_free when no longer needed.\n */\nint CTLOG_new_from_base64(CTLOG ** ct_log,\n const char *pkey_base64, const char *name);\n\n/*\n * Deletes a CT log instance and its fields.\n */\nvoid CTLOG_free(CTLOG *log);\n\n/* Gets the name of the CT log */\nconst char *CTLOG_get0_name(const CTLOG *log);\n/* Gets the ID of the CT log */\nvoid CTLOG_get0_log_id(const CTLOG *log, const uint8_t **log_id,\n size_t *log_id_len);\n/* Gets the public key of the CT log */\nEVP_PKEY *CTLOG_get0_public_key(const CTLOG *log);\n\n/**************************\n * CT log store functions *\n **************************/\n\n/*\n * Creates a new CT log store.\n * Should be deleted by the caller using CTLOG_STORE_free when no longer needed.\n */\nCTLOG_STORE *CTLOG_STORE_new(void);\n\n/*\n * Deletes a CT log store and all of the CT log instances held within.\n */\nvoid CTLOG_STORE_free(CTLOG_STORE *store);\n\n/*\n * Finds a CT log in the store based on its log ID.\n * Returns the CT log, or NULL if no match is found.\n */\nconst CTLOG *CTLOG_STORE_get0_log_by_id(const CTLOG_STORE *store,\n const uint8_t *log_id,\n size_t log_id_len);\n\n/*\n * Loads a CT log list into a |store| from a |file|.\n * Returns 1 if loading is successful, or 0 otherwise.\n */\n__owur int CTLOG_STORE_load_file(CTLOG_STORE *store, const char *file);\n\n/*\n * Loads the default CT log list into a |store|.\n * Returns 1 if loading is successful, or 0 otherwise.\n */\n__owur int CTLOG_STORE_load_default_file(CTLOG_STORE *store);\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/cterr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_CTERR_H\n# define HEADER_CTERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# include \n\n# ifndef OPENSSL_NO_CT\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_CT_strings(void);\n\n/*\n * CT function codes.\n */\n# define CT_F_CTLOG_NEW 117\n# define CT_F_CTLOG_NEW_FROM_BASE64 118\n# define CT_F_CTLOG_NEW_FROM_CONF 119\n# define CT_F_CTLOG_STORE_LOAD_CTX_NEW 122\n# define CT_F_CTLOG_STORE_LOAD_FILE 123\n# define CT_F_CTLOG_STORE_LOAD_LOG 130\n# define CT_F_CTLOG_STORE_NEW 131\n# define CT_F_CT_BASE64_DECODE 124\n# define CT_F_CT_POLICY_EVAL_CTX_NEW 133\n# define CT_F_CT_V1_LOG_ID_FROM_PKEY 125\n# define CT_F_I2O_SCT 107\n# define CT_F_I2O_SCT_LIST 108\n# define CT_F_I2O_SCT_SIGNATURE 109\n# define CT_F_O2I_SCT 110\n# define CT_F_O2I_SCT_LIST 111\n# define CT_F_O2I_SCT_SIGNATURE 112\n# define CT_F_SCT_CTX_NEW 126\n# define CT_F_SCT_CTX_VERIFY 128\n# define CT_F_SCT_NEW 100\n# define CT_F_SCT_NEW_FROM_BASE64 127\n# define CT_F_SCT_SET0_LOG_ID 101\n# define CT_F_SCT_SET1_EXTENSIONS 114\n# define CT_F_SCT_SET1_LOG_ID 115\n# define CT_F_SCT_SET1_SIGNATURE 116\n# define CT_F_SCT_SET_LOG_ENTRY_TYPE 102\n# define CT_F_SCT_SET_SIGNATURE_NID 103\n# define CT_F_SCT_SET_VERSION 104\n\n/*\n * CT reason codes.\n */\n# define CT_R_BASE64_DECODE_ERROR 108\n# define CT_R_INVALID_LOG_ID_LENGTH 100\n# define CT_R_LOG_CONF_INVALID 109\n# define CT_R_LOG_CONF_INVALID_KEY 110\n# define CT_R_LOG_CONF_MISSING_DESCRIPTION 111\n# define CT_R_LOG_CONF_MISSING_KEY 112\n# define CT_R_LOG_KEY_INVALID 113\n# define CT_R_SCT_FUTURE_TIMESTAMP 116\n# define CT_R_SCT_INVALID 104\n# define CT_R_SCT_INVALID_SIGNATURE 107\n# define CT_R_SCT_LIST_INVALID 105\n# define CT_R_SCT_LOG_ID_MISMATCH 114\n# define CT_R_SCT_NOT_SET 106\n# define CT_R_SCT_UNSUPPORTED_VERSION 115\n# define CT_R_UNRECOGNIZED_SIGNATURE_NID 101\n# define CT_R_UNSUPPORTED_ENTRY_TYPE 102\n# define CT_R_UNSUPPORTED_VERSION 103\n\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/des.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_DES_H\n# define HEADER_DES_H\n\n# include \n\n# ifndef OPENSSL_NO_DES\n# ifdef __cplusplus\nextern \"C\" {\n# endif\n# include \n\ntypedef unsigned int DES_LONG;\n\n# ifdef OPENSSL_BUILD_SHLIBCRYPTO\n# undef OPENSSL_EXTERN\n# define OPENSSL_EXTERN OPENSSL_EXPORT\n# endif\n\ntypedef unsigned char DES_cblock[8];\ntypedef /* const */ unsigned char const_DES_cblock[8];\n/*\n * With \"const\", gcc 2.8.1 on Solaris thinks that DES_cblock * and\n * const_DES_cblock * are incompatible pointer types.\n */\n\ntypedef struct DES_ks {\n union {\n DES_cblock cblock;\n /*\n * make sure things are correct size on machines with 8 byte longs\n */\n DES_LONG deslong[2];\n } ks[16];\n} DES_key_schedule;\n\n# define DES_KEY_SZ (sizeof(DES_cblock))\n# define DES_SCHEDULE_SZ (sizeof(DES_key_schedule))\n\n# define DES_ENCRYPT 1\n# define DES_DECRYPT 0\n\n# define DES_CBC_MODE 0\n# define DES_PCBC_MODE 1\n\n# define DES_ecb2_encrypt(i,o,k1,k2,e) \\\n DES_ecb3_encrypt((i),(o),(k1),(k2),(k1),(e))\n\n# define DES_ede2_cbc_encrypt(i,o,l,k1,k2,iv,e) \\\n DES_ede3_cbc_encrypt((i),(o),(l),(k1),(k2),(k1),(iv),(e))\n\n# define DES_ede2_cfb64_encrypt(i,o,l,k1,k2,iv,n,e) \\\n DES_ede3_cfb64_encrypt((i),(o),(l),(k1),(k2),(k1),(iv),(n),(e))\n\n# define DES_ede2_ofb64_encrypt(i,o,l,k1,k2,iv,n) \\\n DES_ede3_ofb64_encrypt((i),(o),(l),(k1),(k2),(k1),(iv),(n))\n\nOPENSSL_DECLARE_GLOBAL(int, DES_check_key); /* defaults to false */\n# define DES_check_key OPENSSL_GLOBAL_REF(DES_check_key)\n\nconst char *DES_options(void);\nvoid DES_ecb3_encrypt(const_DES_cblock *input, DES_cblock *output,\n DES_key_schedule *ks1, DES_key_schedule *ks2,\n DES_key_schedule *ks3, int enc);\nDES_LONG DES_cbc_cksum(const unsigned char *input, DES_cblock *output,\n long length, DES_key_schedule *schedule,\n const_DES_cblock *ivec);\n/* DES_cbc_encrypt does not update the IV! Use DES_ncbc_encrypt instead. */\nvoid DES_cbc_encrypt(const unsigned char *input, unsigned char *output,\n long length, DES_key_schedule *schedule,\n DES_cblock *ivec, int enc);\nvoid DES_ncbc_encrypt(const unsigned char *input, unsigned char *output,\n long length, DES_key_schedule *schedule,\n DES_cblock *ivec, int enc);\nvoid DES_xcbc_encrypt(const unsigned char *input, unsigned char *output,\n long length, DES_key_schedule *schedule,\n DES_cblock *ivec, const_DES_cblock *inw,\n const_DES_cblock *outw, int enc);\nvoid DES_cfb_encrypt(const unsigned char *in, unsigned char *out, int numbits,\n long length, DES_key_schedule *schedule,\n DES_cblock *ivec, int enc);\nvoid DES_ecb_encrypt(const_DES_cblock *input, DES_cblock *output,\n DES_key_schedule *ks, int enc);\n\n/*\n * This is the DES encryption function that gets called by just about every\n * other DES routine in the library. You should not use this function except\n * to implement 'modes' of DES. I say this because the functions that call\n * this routine do the conversion from 'char *' to long, and this needs to be\n * done to make sure 'non-aligned' memory access do not occur. The\n * characters are loaded 'little endian'. Data is a pointer to 2 unsigned\n * long's and ks is the DES_key_schedule to use. enc, is non zero specifies\n * encryption, zero if decryption.\n */\nvoid DES_encrypt1(DES_LONG *data, DES_key_schedule *ks, int enc);\n\n/*\n * This functions is the same as DES_encrypt1() except that the DES initial\n * permutation (IP) and final permutation (FP) have been left out. As for\n * DES_encrypt1(), you should not use this function. It is used by the\n * routines in the library that implement triple DES. IP() DES_encrypt2()\n * DES_encrypt2() DES_encrypt2() FP() is the same as DES_encrypt1()\n * DES_encrypt1() DES_encrypt1() except faster :-).\n */\nvoid DES_encrypt2(DES_LONG *data, DES_key_schedule *ks, int enc);\n\nvoid DES_encrypt3(DES_LONG *data, DES_key_schedule *ks1,\n DES_key_schedule *ks2, DES_key_schedule *ks3);\nvoid DES_decrypt3(DES_LONG *data, DES_key_schedule *ks1,\n DES_key_schedule *ks2, DES_key_schedule *ks3);\nvoid DES_ede3_cbc_encrypt(const unsigned char *input, unsigned char *output,\n long length,\n DES_key_schedule *ks1, DES_key_schedule *ks2,\n DES_key_schedule *ks3, DES_cblock *ivec, int enc);\nvoid DES_ede3_cfb64_encrypt(const unsigned char *in, unsigned char *out,\n long length, DES_key_schedule *ks1,\n DES_key_schedule *ks2, DES_key_schedule *ks3,\n DES_cblock *ivec, int *num, int enc);\nvoid DES_ede3_cfb_encrypt(const unsigned char *in, unsigned char *out,\n int numbits, long length, DES_key_schedule *ks1,\n DES_key_schedule *ks2, DES_key_schedule *ks3,\n DES_cblock *ivec, int enc);\nvoid DES_ede3_ofb64_encrypt(const unsigned char *in, unsigned char *out,\n long length, DES_key_schedule *ks1,\n DES_key_schedule *ks2, DES_key_schedule *ks3,\n DES_cblock *ivec, int *num);\nchar *DES_fcrypt(const char *buf, const char *salt, char *ret);\nchar *DES_crypt(const char *buf, const char *salt);\nvoid DES_ofb_encrypt(const unsigned char *in, unsigned char *out, int numbits,\n long length, DES_key_schedule *schedule,\n DES_cblock *ivec);\nvoid DES_pcbc_encrypt(const unsigned char *input, unsigned char *output,\n long length, DES_key_schedule *schedule,\n DES_cblock *ivec, int enc);\nDES_LONG DES_quad_cksum(const unsigned char *input, DES_cblock output[],\n long length, int out_count, DES_cblock *seed);\nint DES_random_key(DES_cblock *ret);\nvoid DES_set_odd_parity(DES_cblock *key);\nint DES_check_key_parity(const_DES_cblock *key);\nint DES_is_weak_key(const_DES_cblock *key);\n/*\n * DES_set_key (= set_key = DES_key_sched = key_sched) calls\n * DES_set_key_checked if global variable DES_check_key is set,\n * DES_set_key_unchecked otherwise.\n */\nint DES_set_key(const_DES_cblock *key, DES_key_schedule *schedule);\nint DES_key_sched(const_DES_cblock *key, DES_key_schedule *schedule);\nint DES_set_key_checked(const_DES_cblock *key, DES_key_schedule *schedule);\nvoid DES_set_key_unchecked(const_DES_cblock *key, DES_key_schedule *schedule);\nvoid DES_string_to_key(const char *str, DES_cblock *key);\nvoid DES_string_to_2keys(const char *str, DES_cblock *key1, DES_cblock *key2);\nvoid DES_cfb64_encrypt(const unsigned char *in, unsigned char *out,\n long length, DES_key_schedule *schedule,\n DES_cblock *ivec, int *num, int enc);\nvoid DES_ofb64_encrypt(const unsigned char *in, unsigned char *out,\n long length, DES_key_schedule *schedule,\n DES_cblock *ivec, int *num);\n\n# define DES_fixup_key_parity DES_set_odd_parity\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/dh.h", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_DH_H\n# define HEADER_DH_H\n\n# include \n\n# ifndef OPENSSL_NO_DH\n# include \n# include \n# include \n# include \n# if OPENSSL_API_COMPAT < 0x10100000L\n# include \n# endif\n# include \n\n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n# ifndef OPENSSL_DH_MAX_MODULUS_BITS\n# define OPENSSL_DH_MAX_MODULUS_BITS 10000\n# endif\n\n# define OPENSSL_DH_FIPS_MIN_MODULUS_BITS 1024\n\n# define DH_FLAG_CACHE_MONT_P 0x01\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n/*\n * Does nothing. Previously this switched off constant time behaviour.\n */\n# define DH_FLAG_NO_EXP_CONSTTIME 0x00\n# endif\n\n/*\n * If this flag is set the DH method is FIPS compliant and can be used in\n * FIPS mode. This is set in the validated module method. If an application\n * sets this flag in its own methods it is its responsibility to ensure the\n * result is compliant.\n */\n\n# define DH_FLAG_FIPS_METHOD 0x0400\n\n/*\n * If this flag is set the operations normally disabled in FIPS mode are\n * permitted it is then the applications responsibility to ensure that the\n * usage is compliant.\n */\n\n# define DH_FLAG_NON_FIPS_ALLOW 0x0400\n\n/* Already defined in ossl_typ.h */\n/* typedef struct dh_st DH; */\n/* typedef struct dh_method DH_METHOD; */\n\nDECLARE_ASN1_ITEM(DHparams)\n\n# define DH_GENERATOR_2 2\n/* #define DH_GENERATOR_3 3 */\n# define DH_GENERATOR_5 5\n\n/* DH_check error codes */\n# define DH_CHECK_P_NOT_PRIME 0x01\n# define DH_CHECK_P_NOT_SAFE_PRIME 0x02\n# define DH_UNABLE_TO_CHECK_GENERATOR 0x04\n# define DH_NOT_SUITABLE_GENERATOR 0x08\n# define DH_CHECK_Q_NOT_PRIME 0x10\n# define DH_CHECK_INVALID_Q_VALUE 0x20\n# define DH_CHECK_INVALID_J_VALUE 0x40\n\n/* DH_check_pub_key error codes */\n# define DH_CHECK_PUBKEY_TOO_SMALL 0x01\n# define DH_CHECK_PUBKEY_TOO_LARGE 0x02\n# define DH_CHECK_PUBKEY_INVALID 0x04\n\n/*\n * primes p where (p-1)/2 is prime too are called \"safe\"; we define this for\n * backward compatibility:\n */\n# define DH_CHECK_P_NOT_STRONG_PRIME DH_CHECK_P_NOT_SAFE_PRIME\n\n# define d2i_DHparams_fp(fp,x) \\\n (DH *)ASN1_d2i_fp((char *(*)())DH_new, \\\n (char *(*)())d2i_DHparams, \\\n (fp), \\\n (unsigned char **)(x))\n# define i2d_DHparams_fp(fp,x) \\\n ASN1_i2d_fp(i2d_DHparams,(fp), (unsigned char *)(x))\n# define d2i_DHparams_bio(bp,x) \\\n ASN1_d2i_bio_of(DH, DH_new, d2i_DHparams, bp, x)\n# define i2d_DHparams_bio(bp,x) \\\n ASN1_i2d_bio_of_const(DH,i2d_DHparams,bp,x)\n\n# define d2i_DHxparams_fp(fp,x) \\\n (DH *)ASN1_d2i_fp((char *(*)())DH_new, \\\n (char *(*)())d2i_DHxparams, \\\n (fp), \\\n (unsigned char **)(x))\n# define i2d_DHxparams_fp(fp,x) \\\n ASN1_i2d_fp(i2d_DHxparams,(fp), (unsigned char *)(x))\n# define d2i_DHxparams_bio(bp,x) \\\n ASN1_d2i_bio_of(DH, DH_new, d2i_DHxparams, bp, x)\n# define i2d_DHxparams_bio(bp,x) \\\n ASN1_i2d_bio_of_const(DH, i2d_DHxparams, bp, x)\n\nDH *DHparams_dup(DH *);\n\nconst DH_METHOD *DH_OpenSSL(void);\n\nvoid DH_set_default_method(const DH_METHOD *meth);\nconst DH_METHOD *DH_get_default_method(void);\nint DH_set_method(DH *dh, const DH_METHOD *meth);\nDH *DH_new_method(ENGINE *engine);\n\nDH *DH_new(void);\nvoid DH_free(DH *dh);\nint DH_up_ref(DH *dh);\nint DH_bits(const DH *dh);\nint DH_size(const DH *dh);\nint DH_security_bits(const DH *dh);\n#define DH_get_ex_new_index(l, p, newf, dupf, freef) \\\n CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_DH, l, p, newf, dupf, freef)\nint DH_set_ex_data(DH *d, int idx, void *arg);\nvoid *DH_get_ex_data(DH *d, int idx);\n\n/* Deprecated version */\nDEPRECATEDIN_0_9_8(DH *DH_generate_parameters(int prime_len, int generator,\n void (*callback) (int, int,\n void *),\n void *cb_arg))\n\n/* New version */\nint DH_generate_parameters_ex(DH *dh, int prime_len, int generator,\n BN_GENCB *cb);\n\nint DH_check_params_ex(const DH *dh);\nint DH_check_ex(const DH *dh);\nint DH_check_pub_key_ex(const DH *dh, const BIGNUM *pub_key);\nint DH_check_params(const DH *dh, int *ret);\nint DH_check(const DH *dh, int *codes);\nint DH_check_pub_key(const DH *dh, const BIGNUM *pub_key, int *codes);\nint DH_generate_key(DH *dh);\nint DH_compute_key(unsigned char *key, const BIGNUM *pub_key, DH *dh);\nint DH_compute_key_padded(unsigned char *key, const BIGNUM *pub_key, DH *dh);\nDH *d2i_DHparams(DH **a, const unsigned char **pp, long length);\nint i2d_DHparams(const DH *a, unsigned char **pp);\nDH *d2i_DHxparams(DH **a, const unsigned char **pp, long length);\nint i2d_DHxparams(const DH *a, unsigned char **pp);\n# ifndef OPENSSL_NO_STDIO\nint DHparams_print_fp(FILE *fp, const DH *x);\n# endif\nint DHparams_print(BIO *bp, const DH *x);\n\n/* RFC 5114 parameters */\nDH *DH_get_1024_160(void);\nDH *DH_get_2048_224(void);\nDH *DH_get_2048_256(void);\n\n/* Named parameters, currently RFC7919 */\nDH *DH_new_by_nid(int nid);\nint DH_get_nid(const DH *dh);\n\n# ifndef OPENSSL_NO_CMS\n/* RFC2631 KDF */\nint DH_KDF_X9_42(unsigned char *out, size_t outlen,\n const unsigned char *Z, size_t Zlen,\n ASN1_OBJECT *key_oid,\n const unsigned char *ukm, size_t ukmlen, const EVP_MD *md);\n# endif\n\nvoid DH_get0_pqg(const DH *dh,\n const BIGNUM **p, const BIGNUM **q, const BIGNUM **g);\nint DH_set0_pqg(DH *dh, BIGNUM *p, BIGNUM *q, BIGNUM *g);\nvoid DH_get0_key(const DH *dh,\n const BIGNUM **pub_key, const BIGNUM **priv_key);\nint DH_set0_key(DH *dh, BIGNUM *pub_key, BIGNUM *priv_key);\nconst BIGNUM *DH_get0_p(const DH *dh);\nconst BIGNUM *DH_get0_q(const DH *dh);\nconst BIGNUM *DH_get0_g(const DH *dh);\nconst BIGNUM *DH_get0_priv_key(const DH *dh);\nconst BIGNUM *DH_get0_pub_key(const DH *dh);\nvoid DH_clear_flags(DH *dh, int flags);\nint DH_test_flags(const DH *dh, int flags);\nvoid DH_set_flags(DH *dh, int flags);\nENGINE *DH_get0_engine(DH *d);\nlong DH_get_length(const DH *dh);\nint DH_set_length(DH *dh, long length);\n\nDH_METHOD *DH_meth_new(const char *name, int flags);\nvoid DH_meth_free(DH_METHOD *dhm);\nDH_METHOD *DH_meth_dup(const DH_METHOD *dhm);\nconst char *DH_meth_get0_name(const DH_METHOD *dhm);\nint DH_meth_set1_name(DH_METHOD *dhm, const char *name);\nint DH_meth_get_flags(const DH_METHOD *dhm);\nint DH_meth_set_flags(DH_METHOD *dhm, int flags);\nvoid *DH_meth_get0_app_data(const DH_METHOD *dhm);\nint DH_meth_set0_app_data(DH_METHOD *dhm, void *app_data);\nint (*DH_meth_get_generate_key(const DH_METHOD *dhm)) (DH *);\nint DH_meth_set_generate_key(DH_METHOD *dhm, int (*generate_key) (DH *));\nint (*DH_meth_get_compute_key(const DH_METHOD *dhm))\n (unsigned char *key, const BIGNUM *pub_key, DH *dh);\nint DH_meth_set_compute_key(DH_METHOD *dhm,\n int (*compute_key) (unsigned char *key, const BIGNUM *pub_key, DH *dh));\nint (*DH_meth_get_bn_mod_exp(const DH_METHOD *dhm))\n (const DH *, BIGNUM *, const BIGNUM *, const BIGNUM *, const BIGNUM *,\n BN_CTX *, BN_MONT_CTX *);\nint DH_meth_set_bn_mod_exp(DH_METHOD *dhm,\n int (*bn_mod_exp) (const DH *, BIGNUM *, const BIGNUM *, const BIGNUM *,\n const BIGNUM *, BN_CTX *, BN_MONT_CTX *));\nint (*DH_meth_get_init(const DH_METHOD *dhm))(DH *);\nint DH_meth_set_init(DH_METHOD *dhm, int (*init)(DH *));\nint (*DH_meth_get_finish(const DH_METHOD *dhm)) (DH *);\nint DH_meth_set_finish(DH_METHOD *dhm, int (*finish) (DH *));\nint (*DH_meth_get_generate_params(const DH_METHOD *dhm))\n (DH *, int, int, BN_GENCB *);\nint DH_meth_set_generate_params(DH_METHOD *dhm,\n int (*generate_params) (DH *, int, int, BN_GENCB *));\n\n\n# define EVP_PKEY_CTX_set_dh_paramgen_prime_len(ctx, len) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DH, EVP_PKEY_OP_PARAMGEN, \\\n EVP_PKEY_CTRL_DH_PARAMGEN_PRIME_LEN, len, NULL)\n\n# define EVP_PKEY_CTX_set_dh_paramgen_subprime_len(ctx, len) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DH, EVP_PKEY_OP_PARAMGEN, \\\n EVP_PKEY_CTRL_DH_PARAMGEN_SUBPRIME_LEN, len, NULL)\n\n# define EVP_PKEY_CTX_set_dh_paramgen_type(ctx, typ) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DH, EVP_PKEY_OP_PARAMGEN, \\\n EVP_PKEY_CTRL_DH_PARAMGEN_TYPE, typ, NULL)\n\n# define EVP_PKEY_CTX_set_dh_paramgen_generator(ctx, gen) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DH, EVP_PKEY_OP_PARAMGEN, \\\n EVP_PKEY_CTRL_DH_PARAMGEN_GENERATOR, gen, NULL)\n\n# define EVP_PKEY_CTX_set_dh_rfc5114(ctx, gen) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DHX, EVP_PKEY_OP_PARAMGEN, \\\n EVP_PKEY_CTRL_DH_RFC5114, gen, NULL)\n\n# define EVP_PKEY_CTX_set_dhx_rfc5114(ctx, gen) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DHX, EVP_PKEY_OP_PARAMGEN, \\\n EVP_PKEY_CTRL_DH_RFC5114, gen, NULL)\n\n# define EVP_PKEY_CTX_set_dh_nid(ctx, nid) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DH, \\\n EVP_PKEY_OP_PARAMGEN | EVP_PKEY_OP_KEYGEN, \\\n EVP_PKEY_CTRL_DH_NID, nid, NULL)\n\n# define EVP_PKEY_CTX_set_dh_pad(ctx, pad) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DH, EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_DH_PAD, pad, NULL)\n\n# define EVP_PKEY_CTX_set_dh_kdf_type(ctx, kdf) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DHX, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_DH_KDF_TYPE, kdf, NULL)\n\n# define EVP_PKEY_CTX_get_dh_kdf_type(ctx) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DHX, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_DH_KDF_TYPE, -2, NULL)\n\n# define EVP_PKEY_CTX_set0_dh_kdf_oid(ctx, oid) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DHX, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_DH_KDF_OID, 0, (void *)(oid))\n\n# define EVP_PKEY_CTX_get0_dh_kdf_oid(ctx, poid) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DHX, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_GET_DH_KDF_OID, 0, (void *)(poid))\n\n# define EVP_PKEY_CTX_set_dh_kdf_md(ctx, md) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DHX, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_DH_KDF_MD, 0, (void *)(md))\n\n# define EVP_PKEY_CTX_get_dh_kdf_md(ctx, pmd) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DHX, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_GET_DH_KDF_MD, 0, (void *)(pmd))\n\n# define EVP_PKEY_CTX_set_dh_kdf_outlen(ctx, len) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DHX, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_DH_KDF_OUTLEN, len, NULL)\n\n# define EVP_PKEY_CTX_get_dh_kdf_outlen(ctx, plen) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DHX, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_GET_DH_KDF_OUTLEN, 0, (void *)(plen))\n\n# define EVP_PKEY_CTX_set0_dh_kdf_ukm(ctx, p, plen) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DHX, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_DH_KDF_UKM, plen, (void *)(p))\n\n# define EVP_PKEY_CTX_get0_dh_kdf_ukm(ctx, p) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DHX, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_GET_DH_KDF_UKM, 0, (void *)(p))\n\n# define EVP_PKEY_CTRL_DH_PARAMGEN_PRIME_LEN (EVP_PKEY_ALG_CTRL + 1)\n# define EVP_PKEY_CTRL_DH_PARAMGEN_GENERATOR (EVP_PKEY_ALG_CTRL + 2)\n# define EVP_PKEY_CTRL_DH_RFC5114 (EVP_PKEY_ALG_CTRL + 3)\n# define EVP_PKEY_CTRL_DH_PARAMGEN_SUBPRIME_LEN (EVP_PKEY_ALG_CTRL + 4)\n# define EVP_PKEY_CTRL_DH_PARAMGEN_TYPE (EVP_PKEY_ALG_CTRL + 5)\n# define EVP_PKEY_CTRL_DH_KDF_TYPE (EVP_PKEY_ALG_CTRL + 6)\n# define EVP_PKEY_CTRL_DH_KDF_MD (EVP_PKEY_ALG_CTRL + 7)\n# define EVP_PKEY_CTRL_GET_DH_KDF_MD (EVP_PKEY_ALG_CTRL + 8)\n# define EVP_PKEY_CTRL_DH_KDF_OUTLEN (EVP_PKEY_ALG_CTRL + 9)\n# define EVP_PKEY_CTRL_GET_DH_KDF_OUTLEN (EVP_PKEY_ALG_CTRL + 10)\n# define EVP_PKEY_CTRL_DH_KDF_UKM (EVP_PKEY_ALG_CTRL + 11)\n# define EVP_PKEY_CTRL_GET_DH_KDF_UKM (EVP_PKEY_ALG_CTRL + 12)\n# define EVP_PKEY_CTRL_DH_KDF_OID (EVP_PKEY_ALG_CTRL + 13)\n# define EVP_PKEY_CTRL_GET_DH_KDF_OID (EVP_PKEY_ALG_CTRL + 14)\n# define EVP_PKEY_CTRL_DH_NID (EVP_PKEY_ALG_CTRL + 15)\n# define EVP_PKEY_CTRL_DH_PAD (EVP_PKEY_ALG_CTRL + 16)\n\n/* KDF types */\n# define EVP_PKEY_DH_KDF_NONE 1\n# ifndef OPENSSL_NO_CMS\n# define EVP_PKEY_DH_KDF_X9_42 2\n# endif\n\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/dherr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_DHERR_H\n# define HEADER_DHERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# include \n\n# ifndef OPENSSL_NO_DH\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_DH_strings(void);\n\n/*\n * DH function codes.\n */\n# define DH_F_COMPUTE_KEY 102\n# define DH_F_DHPARAMS_PRINT_FP 101\n# define DH_F_DH_BUILTIN_GENPARAMS 106\n# define DH_F_DH_CHECK_EX 121\n# define DH_F_DH_CHECK_PARAMS_EX 122\n# define DH_F_DH_CHECK_PUB_KEY_EX 123\n# define DH_F_DH_CMS_DECRYPT 114\n# define DH_F_DH_CMS_SET_PEERKEY 115\n# define DH_F_DH_CMS_SET_SHARED_INFO 116\n# define DH_F_DH_METH_DUP 117\n# define DH_F_DH_METH_NEW 118\n# define DH_F_DH_METH_SET1_NAME 119\n# define DH_F_DH_NEW_BY_NID 104\n# define DH_F_DH_NEW_METHOD 105\n# define DH_F_DH_PARAM_DECODE 107\n# define DH_F_DH_PKEY_PUBLIC_CHECK 124\n# define DH_F_DH_PRIV_DECODE 110\n# define DH_F_DH_PRIV_ENCODE 111\n# define DH_F_DH_PUB_DECODE 108\n# define DH_F_DH_PUB_ENCODE 109\n# define DH_F_DO_DH_PRINT 100\n# define DH_F_GENERATE_KEY 103\n# define DH_F_PKEY_DH_CTRL_STR 120\n# define DH_F_PKEY_DH_DERIVE 112\n# define DH_F_PKEY_DH_INIT 125\n# define DH_F_PKEY_DH_KEYGEN 113\n\n/*\n * DH reason codes.\n */\n# define DH_R_BAD_GENERATOR 101\n# define DH_R_BN_DECODE_ERROR 109\n# define DH_R_BN_ERROR 106\n# define DH_R_CHECK_INVALID_J_VALUE 115\n# define DH_R_CHECK_INVALID_Q_VALUE 116\n# define DH_R_CHECK_PUBKEY_INVALID 122\n# define DH_R_CHECK_PUBKEY_TOO_LARGE 123\n# define DH_R_CHECK_PUBKEY_TOO_SMALL 124\n# define DH_R_CHECK_P_NOT_PRIME 117\n# define DH_R_CHECK_P_NOT_SAFE_PRIME 118\n# define DH_R_CHECK_Q_NOT_PRIME 119\n# define DH_R_DECODE_ERROR 104\n# define DH_R_INVALID_PARAMETER_NAME 110\n# define DH_R_INVALID_PARAMETER_NID 114\n# define DH_R_INVALID_PUBKEY 102\n# define DH_R_KDF_PARAMETER_ERROR 112\n# define DH_R_KEYS_NOT_SET 108\n# define DH_R_MISSING_PUBKEY 125\n# define DH_R_MODULUS_TOO_LARGE 103\n# define DH_R_NOT_SUITABLE_GENERATOR 120\n# define DH_R_NO_PARAMETERS_SET 107\n# define DH_R_NO_PRIVATE_VALUE 100\n# define DH_R_PARAMETER_ENCODING_ERROR 105\n# define DH_R_PEER_KEY_ERROR 111\n# define DH_R_SHARED_INFO_ERROR 113\n# define DH_R_UNABLE_TO_CHECK_GENERATOR 121\n\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/dsa.h", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_DSA_H\n# define HEADER_DSA_H\n\n# include \n\n# ifndef OPENSSL_NO_DSA\n# ifdef __cplusplus\nextern \"C\" {\n# endif\n# include \n# include \n# include \n# include \n# include \n# if OPENSSL_API_COMPAT < 0x10100000L\n# include \n# endif\n# include \n\n# ifndef OPENSSL_DSA_MAX_MODULUS_BITS\n# define OPENSSL_DSA_MAX_MODULUS_BITS 10000\n# endif\n\n# define OPENSSL_DSA_FIPS_MIN_MODULUS_BITS 1024\n\n# define DSA_FLAG_CACHE_MONT_P 0x01\n# if OPENSSL_API_COMPAT < 0x10100000L\n/*\n * Does nothing. Previously this switched off constant time behaviour.\n */\n# define DSA_FLAG_NO_EXP_CONSTTIME 0x00\n# endif\n\n/*\n * If this flag is set the DSA method is FIPS compliant and can be used in\n * FIPS mode. This is set in the validated module method. If an application\n * sets this flag in its own methods it is its responsibility to ensure the\n * result is compliant.\n */\n\n# define DSA_FLAG_FIPS_METHOD 0x0400\n\n/*\n * If this flag is set the operations normally disabled in FIPS mode are\n * permitted it is then the applications responsibility to ensure that the\n * usage is compliant.\n */\n\n# define DSA_FLAG_NON_FIPS_ALLOW 0x0400\n# define DSA_FLAG_FIPS_CHECKED 0x0800\n\n/* Already defined in ossl_typ.h */\n/* typedef struct dsa_st DSA; */\n/* typedef struct dsa_method DSA_METHOD; */\n\ntypedef struct DSA_SIG_st DSA_SIG;\n\n# define d2i_DSAparams_fp(fp,x) (DSA *)ASN1_d2i_fp((char *(*)())DSA_new, \\\n (char *(*)())d2i_DSAparams,(fp),(unsigned char **)(x))\n# define i2d_DSAparams_fp(fp,x) ASN1_i2d_fp(i2d_DSAparams,(fp), \\\n (unsigned char *)(x))\n# define d2i_DSAparams_bio(bp,x) ASN1_d2i_bio_of(DSA,DSA_new,d2i_DSAparams,bp,x)\n# define i2d_DSAparams_bio(bp,x) ASN1_i2d_bio_of_const(DSA,i2d_DSAparams,bp,x)\n\nDSA *DSAparams_dup(DSA *x);\nDSA_SIG *DSA_SIG_new(void);\nvoid DSA_SIG_free(DSA_SIG *a);\nint i2d_DSA_SIG(const DSA_SIG *a, unsigned char **pp);\nDSA_SIG *d2i_DSA_SIG(DSA_SIG **v, const unsigned char **pp, long length);\nvoid DSA_SIG_get0(const DSA_SIG *sig, const BIGNUM **pr, const BIGNUM **ps);\nint DSA_SIG_set0(DSA_SIG *sig, BIGNUM *r, BIGNUM *s);\n\nDSA_SIG *DSA_do_sign(const unsigned char *dgst, int dlen, DSA *dsa);\nint DSA_do_verify(const unsigned char *dgst, int dgst_len,\n DSA_SIG *sig, DSA *dsa);\n\nconst DSA_METHOD *DSA_OpenSSL(void);\n\nvoid DSA_set_default_method(const DSA_METHOD *);\nconst DSA_METHOD *DSA_get_default_method(void);\nint DSA_set_method(DSA *dsa, const DSA_METHOD *);\nconst DSA_METHOD *DSA_get_method(DSA *d);\n\nDSA *DSA_new(void);\nDSA *DSA_new_method(ENGINE *engine);\nvoid DSA_free(DSA *r);\n/* \"up\" the DSA object's reference count */\nint DSA_up_ref(DSA *r);\nint DSA_size(const DSA *);\nint DSA_bits(const DSA *d);\nint DSA_security_bits(const DSA *d);\n /* next 4 return -1 on error */\nDEPRECATEDIN_1_2_0(int DSA_sign_setup(DSA *dsa, BN_CTX *ctx_in, BIGNUM **kinvp, BIGNUM **rp))\nint DSA_sign(int type, const unsigned char *dgst, int dlen,\n unsigned char *sig, unsigned int *siglen, DSA *dsa);\nint DSA_verify(int type, const unsigned char *dgst, int dgst_len,\n const unsigned char *sigbuf, int siglen, DSA *dsa);\n#define DSA_get_ex_new_index(l, p, newf, dupf, freef) \\\n CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_DSA, l, p, newf, dupf, freef)\nint DSA_set_ex_data(DSA *d, int idx, void *arg);\nvoid *DSA_get_ex_data(DSA *d, int idx);\n\nDSA *d2i_DSAPublicKey(DSA **a, const unsigned char **pp, long length);\nDSA *d2i_DSAPrivateKey(DSA **a, const unsigned char **pp, long length);\nDSA *d2i_DSAparams(DSA **a, const unsigned char **pp, long length);\n\n/* Deprecated version */\nDEPRECATEDIN_0_9_8(DSA *DSA_generate_parameters(int bits,\n unsigned char *seed,\n int seed_len,\n int *counter_ret,\n unsigned long *h_ret, void\n (*callback) (int, int,\n void *),\n void *cb_arg))\n\n/* New version */\nint DSA_generate_parameters_ex(DSA *dsa, int bits,\n const unsigned char *seed, int seed_len,\n int *counter_ret, unsigned long *h_ret,\n BN_GENCB *cb);\n\nint DSA_generate_key(DSA *a);\nint i2d_DSAPublicKey(const DSA *a, unsigned char **pp);\nint i2d_DSAPrivateKey(const DSA *a, unsigned char **pp);\nint i2d_DSAparams(const DSA *a, unsigned char **pp);\n\nint DSAparams_print(BIO *bp, const DSA *x);\nint DSA_print(BIO *bp, const DSA *x, int off);\n# ifndef OPENSSL_NO_STDIO\nint DSAparams_print_fp(FILE *fp, const DSA *x);\nint DSA_print_fp(FILE *bp, const DSA *x, int off);\n# endif\n\n# define DSS_prime_checks 64\n/*\n * Primality test according to FIPS PUB 186-4, Appendix C.3. Since we only\n * have one value here we set the number of checks to 64 which is the 128 bit\n * security level that is the highest level and valid for creating a 3072 bit\n * DSA key.\n */\n# define DSA_is_prime(n, callback, cb_arg) \\\n BN_is_prime(n, DSS_prime_checks, callback, NULL, cb_arg)\n\n# ifndef OPENSSL_NO_DH\n/*\n * Convert DSA structure (key or just parameters) into DH structure (be\n * careful to avoid small subgroup attacks when using this!)\n */\nDH *DSA_dup_DH(const DSA *r);\n# endif\n\n# define EVP_PKEY_CTX_set_dsa_paramgen_bits(ctx, nbits) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DSA, EVP_PKEY_OP_PARAMGEN, \\\n EVP_PKEY_CTRL_DSA_PARAMGEN_BITS, nbits, NULL)\n# define EVP_PKEY_CTX_set_dsa_paramgen_q_bits(ctx, qbits) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DSA, EVP_PKEY_OP_PARAMGEN, \\\n EVP_PKEY_CTRL_DSA_PARAMGEN_Q_BITS, qbits, NULL)\n# define EVP_PKEY_CTX_set_dsa_paramgen_md(ctx, md) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_DSA, EVP_PKEY_OP_PARAMGEN, \\\n EVP_PKEY_CTRL_DSA_PARAMGEN_MD, 0, (void *)(md))\n\n# define EVP_PKEY_CTRL_DSA_PARAMGEN_BITS (EVP_PKEY_ALG_CTRL + 1)\n# define EVP_PKEY_CTRL_DSA_PARAMGEN_Q_BITS (EVP_PKEY_ALG_CTRL + 2)\n# define EVP_PKEY_CTRL_DSA_PARAMGEN_MD (EVP_PKEY_ALG_CTRL + 3)\n\nvoid DSA_get0_pqg(const DSA *d,\n const BIGNUM **p, const BIGNUM **q, const BIGNUM **g);\nint DSA_set0_pqg(DSA *d, BIGNUM *p, BIGNUM *q, BIGNUM *g);\nvoid DSA_get0_key(const DSA *d,\n const BIGNUM **pub_key, const BIGNUM **priv_key);\nint DSA_set0_key(DSA *d, BIGNUM *pub_key, BIGNUM *priv_key);\nconst BIGNUM *DSA_get0_p(const DSA *d);\nconst BIGNUM *DSA_get0_q(const DSA *d);\nconst BIGNUM *DSA_get0_g(const DSA *d);\nconst BIGNUM *DSA_get0_pub_key(const DSA *d);\nconst BIGNUM *DSA_get0_priv_key(const DSA *d);\nvoid DSA_clear_flags(DSA *d, int flags);\nint DSA_test_flags(const DSA *d, int flags);\nvoid DSA_set_flags(DSA *d, int flags);\nENGINE *DSA_get0_engine(DSA *d);\n\nDSA_METHOD *DSA_meth_new(const char *name, int flags);\nvoid DSA_meth_free(DSA_METHOD *dsam);\nDSA_METHOD *DSA_meth_dup(const DSA_METHOD *dsam);\nconst char *DSA_meth_get0_name(const DSA_METHOD *dsam);\nint DSA_meth_set1_name(DSA_METHOD *dsam, const char *name);\nint DSA_meth_get_flags(const DSA_METHOD *dsam);\nint DSA_meth_set_flags(DSA_METHOD *dsam, int flags);\nvoid *DSA_meth_get0_app_data(const DSA_METHOD *dsam);\nint DSA_meth_set0_app_data(DSA_METHOD *dsam, void *app_data);\nDSA_SIG *(*DSA_meth_get_sign(const DSA_METHOD *dsam))\n (const unsigned char *, int, DSA *);\nint DSA_meth_set_sign(DSA_METHOD *dsam,\n DSA_SIG *(*sign) (const unsigned char *, int, DSA *));\nint (*DSA_meth_get_sign_setup(const DSA_METHOD *dsam))\n (DSA *, BN_CTX *, BIGNUM **, BIGNUM **);\nint DSA_meth_set_sign_setup(DSA_METHOD *dsam,\n int (*sign_setup) (DSA *, BN_CTX *, BIGNUM **, BIGNUM **));\nint (*DSA_meth_get_verify(const DSA_METHOD *dsam))\n (const unsigned char *, int, DSA_SIG *, DSA *);\nint DSA_meth_set_verify(DSA_METHOD *dsam,\n int (*verify) (const unsigned char *, int, DSA_SIG *, DSA *));\nint (*DSA_meth_get_mod_exp(const DSA_METHOD *dsam))\n (DSA *, BIGNUM *, const BIGNUM *, const BIGNUM *, const BIGNUM *,\n const BIGNUM *, const BIGNUM *, BN_CTX *, BN_MONT_CTX *);\nint DSA_meth_set_mod_exp(DSA_METHOD *dsam,\n int (*mod_exp) (DSA *, BIGNUM *, const BIGNUM *, const BIGNUM *,\n const BIGNUM *, const BIGNUM *, const BIGNUM *, BN_CTX *,\n BN_MONT_CTX *));\nint (*DSA_meth_get_bn_mod_exp(const DSA_METHOD *dsam))\n (DSA *, BIGNUM *, const BIGNUM *, const BIGNUM *, const BIGNUM *,\n BN_CTX *, BN_MONT_CTX *);\nint DSA_meth_set_bn_mod_exp(DSA_METHOD *dsam,\n int (*bn_mod_exp) (DSA *, BIGNUM *, const BIGNUM *, const BIGNUM *,\n const BIGNUM *, BN_CTX *, BN_MONT_CTX *));\nint (*DSA_meth_get_init(const DSA_METHOD *dsam))(DSA *);\nint DSA_meth_set_init(DSA_METHOD *dsam, int (*init)(DSA *));\nint (*DSA_meth_get_finish(const DSA_METHOD *dsam)) (DSA *);\nint DSA_meth_set_finish(DSA_METHOD *dsam, int (*finish) (DSA *));\nint (*DSA_meth_get_paramgen(const DSA_METHOD *dsam))\n (DSA *, int, const unsigned char *, int, int *, unsigned long *,\n BN_GENCB *);\nint DSA_meth_set_paramgen(DSA_METHOD *dsam,\n int (*paramgen) (DSA *, int, const unsigned char *, int, int *,\n unsigned long *, BN_GENCB *));\nint (*DSA_meth_get_keygen(const DSA_METHOD *dsam)) (DSA *);\nint DSA_meth_set_keygen(DSA_METHOD *dsam, int (*keygen) (DSA *));\n\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/dsaerr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_DSAERR_H\n# define HEADER_DSAERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# include \n\n# ifndef OPENSSL_NO_DSA\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_DSA_strings(void);\n\n/*\n * DSA function codes.\n */\n# define DSA_F_DSAPARAMS_PRINT 100\n# define DSA_F_DSAPARAMS_PRINT_FP 101\n# define DSA_F_DSA_BUILTIN_PARAMGEN 125\n# define DSA_F_DSA_BUILTIN_PARAMGEN2 126\n# define DSA_F_DSA_DO_SIGN 112\n# define DSA_F_DSA_DO_VERIFY 113\n# define DSA_F_DSA_METH_DUP 127\n# define DSA_F_DSA_METH_NEW 128\n# define DSA_F_DSA_METH_SET1_NAME 129\n# define DSA_F_DSA_NEW_METHOD 103\n# define DSA_F_DSA_PARAM_DECODE 119\n# define DSA_F_DSA_PRINT_FP 105\n# define DSA_F_DSA_PRIV_DECODE 115\n# define DSA_F_DSA_PRIV_ENCODE 116\n# define DSA_F_DSA_PUB_DECODE 117\n# define DSA_F_DSA_PUB_ENCODE 118\n# define DSA_F_DSA_SIGN 106\n# define DSA_F_DSA_SIGN_SETUP 107\n# define DSA_F_DSA_SIG_NEW 102\n# define DSA_F_OLD_DSA_PRIV_DECODE 122\n# define DSA_F_PKEY_DSA_CTRL 120\n# define DSA_F_PKEY_DSA_CTRL_STR 104\n# define DSA_F_PKEY_DSA_KEYGEN 121\n\n/*\n * DSA reason codes.\n */\n# define DSA_R_BAD_Q_VALUE 102\n# define DSA_R_BN_DECODE_ERROR 108\n# define DSA_R_BN_ERROR 109\n# define DSA_R_DECODE_ERROR 104\n# define DSA_R_INVALID_DIGEST_TYPE 106\n# define DSA_R_INVALID_PARAMETERS 112\n# define DSA_R_MISSING_PARAMETERS 101\n# define DSA_R_MISSING_PRIVATE_KEY 111\n# define DSA_R_MODULUS_TOO_LARGE 103\n# define DSA_R_NO_PARAMETERS_SET 107\n# define DSA_R_PARAMETER_ENCODING_ERROR 105\n# define DSA_R_Q_NOT_PRIME 113\n# define DSA_R_SEED_LEN_SMALL 110\n\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/dtls1.h", "content": "/*\n * Copyright 2005-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_DTLS1_H\n# define HEADER_DTLS1_H\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# define DTLS1_VERSION 0xFEFF\n# define DTLS1_2_VERSION 0xFEFD\n# define DTLS_MIN_VERSION DTLS1_VERSION\n# define DTLS_MAX_VERSION DTLS1_2_VERSION\n# define DTLS1_VERSION_MAJOR 0xFE\n\n# define DTLS1_BAD_VER 0x0100\n\n/* Special value for method supporting multiple versions */\n# define DTLS_ANY_VERSION 0x1FFFF\n\n/* lengths of messages */\n/*\n * Actually the max cookie length in DTLS is 255. But we can't change this now\n * due to compatibility concerns.\n */\n# define DTLS1_COOKIE_LENGTH 256\n\n# define DTLS1_RT_HEADER_LENGTH 13\n\n# define DTLS1_HM_HEADER_LENGTH 12\n\n# define DTLS1_HM_BAD_FRAGMENT -2\n# define DTLS1_HM_FRAGMENT_RETRY -3\n\n# define DTLS1_CCS_HEADER_LENGTH 1\n\n# define DTLS1_AL_HEADER_LENGTH 2\n\n/* Timeout multipliers */\n# define DTLS1_TMO_READ_COUNT 2\n# define DTLS1_TMO_WRITE_COUNT 2\n\n# define DTLS1_TMO_ALERT_COUNT 12\n\n#ifdef __cplusplus\n}\n#endif\n#endif\n" }, { "path": "cryptomini/include/openssl/e_os2.h", "content": "/*\n * Copyright 1995-2021 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_E_OS2_H\n# define HEADER_E_OS2_H\n\n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/******************************************************************************\n * Detect operating systems. This probably needs completing.\n * The result is that at least one OPENSSL_SYS_os macro should be defined.\n * However, if none is defined, Unix is assumed.\n **/\n\n# define OPENSSL_SYS_UNIX\n\n/* --------------------- Microsoft operating systems ---------------------- */\n\n/*\n * Note that MSDOS actually denotes 32-bit environments running on top of\n * MS-DOS, such as DJGPP one.\n */\n# if defined(OPENSSL_SYS_MSDOS)\n# undef OPENSSL_SYS_UNIX\n# endif\n\n/*\n * For 32 bit environment, there seems to be the CygWin environment and then\n * all the others that try to do the same thing Microsoft does...\n */\n/*\n * UEFI lives here because it might be built with a Microsoft toolchain and\n * we need to avoid the false positive match on Windows.\n */\n# if defined(OPENSSL_SYS_UEFI)\n# undef OPENSSL_SYS_UNIX\n# elif defined(OPENSSL_SYS_UWIN)\n# undef OPENSSL_SYS_UNIX\n# define OPENSSL_SYS_WIN32_UWIN\n# else\n# if defined(__CYGWIN__) || defined(OPENSSL_SYS_CYGWIN)\n# define OPENSSL_SYS_WIN32_CYGWIN\n# else\n# if defined(_WIN32) || defined(OPENSSL_SYS_WIN32)\n# undef OPENSSL_SYS_UNIX\n# if !defined(OPENSSL_SYS_WIN32)\n# define OPENSSL_SYS_WIN32\n# endif\n# endif\n# if defined(_WIN64) || defined(OPENSSL_SYS_WIN64)\n# undef OPENSSL_SYS_UNIX\n# if !defined(OPENSSL_SYS_WIN64)\n# define OPENSSL_SYS_WIN64\n# endif\n# endif\n# if defined(OPENSSL_SYS_WINNT)\n# undef OPENSSL_SYS_UNIX\n# endif\n# if defined(OPENSSL_SYS_WINCE)\n# undef OPENSSL_SYS_UNIX\n# endif\n# endif\n# endif\n\n/* Anything that tries to look like Microsoft is \"Windows\" */\n# if defined(OPENSSL_SYS_WIN32) || defined(OPENSSL_SYS_WIN64) || defined(OPENSSL_SYS_WINNT) || defined(OPENSSL_SYS_WINCE)\n# undef OPENSSL_SYS_UNIX\n# define OPENSSL_SYS_WINDOWS\n# ifndef OPENSSL_SYS_MSDOS\n# define OPENSSL_SYS_MSDOS\n# endif\n# endif\n\n/*\n * DLL settings. This part is a bit tough, because it's up to the\n * application implementor how he or she will link the application, so it\n * requires some macro to be used.\n */\n# ifdef OPENSSL_SYS_WINDOWS\n# ifndef OPENSSL_OPT_WINDLL\n# if defined(_WINDLL) /* This is used when building OpenSSL to\n * indicate that DLL linkage should be used */\n# define OPENSSL_OPT_WINDLL\n# endif\n# endif\n# endif\n\n/* ------------------------------- OpenVMS -------------------------------- */\n# if defined(__VMS) || defined(VMS) || defined(OPENSSL_SYS_VMS)\n# if !defined(OPENSSL_SYS_VMS)\n# undef OPENSSL_SYS_UNIX\n# endif\n# define OPENSSL_SYS_VMS\n# if defined(__DECC)\n# define OPENSSL_SYS_VMS_DECC\n# elif defined(__DECCXX)\n# define OPENSSL_SYS_VMS_DECC\n# define OPENSSL_SYS_VMS_DECCXX\n# else\n# define OPENSSL_SYS_VMS_NODECC\n# endif\n# endif\n\n/* -------------------------------- Unix ---------------------------------- */\n# ifdef OPENSSL_SYS_UNIX\n# if defined(linux) || defined(__linux__) && !defined(OPENSSL_SYS_LINUX)\n# define OPENSSL_SYS_LINUX\n# endif\n# if defined(_AIX) && !defined(OPENSSL_SYS_AIX)\n# define OPENSSL_SYS_AIX\n# endif\n# endif\n\n/* -------------------------------- VOS ----------------------------------- */\n# if defined(__VOS__) && !defined(OPENSSL_SYS_VOS)\n# define OPENSSL_SYS_VOS\n# ifdef __HPPA__\n# define OPENSSL_SYS_VOS_HPPA\n# endif\n# ifdef __IA32__\n# define OPENSSL_SYS_VOS_IA32\n# endif\n# endif\n\n/**\n * That's it for OS-specific stuff\n *****************************************************************************/\n\n/* Specials for I/O an exit */\n# ifdef OPENSSL_SYS_MSDOS\n# define OPENSSL_UNISTD_IO \n# define OPENSSL_DECLARE_EXIT extern void exit(int);\n# else\n# define OPENSSL_UNISTD_IO OPENSSL_UNISTD\n# define OPENSSL_DECLARE_EXIT /* declared in unistd.h */\n# endif\n\n/*-\n * OPENSSL_EXTERN is normally used to declare a symbol with possible extra\n * attributes to handle its presence in a shared library.\n * OPENSSL_EXPORT is used to define a symbol with extra possible attributes\n * to make it visible in a shared library.\n * Care needs to be taken when a header file is used both to declare and\n * define symbols. Basically, for any library that exports some global\n * variables, the following code must be present in the header file that\n * declares them, before OPENSSL_EXTERN is used:\n *\n * #ifdef SOME_BUILD_FLAG_MACRO\n * # undef OPENSSL_EXTERN\n * # define OPENSSL_EXTERN OPENSSL_EXPORT\n * #endif\n *\n * The default is to have OPENSSL_EXPORT and OPENSSL_EXTERN\n * have some generally sensible values.\n */\n\n# if defined(OPENSSL_SYS_WINDOWS) && defined(OPENSSL_OPT_WINDLL)\n# define OPENSSL_EXPORT extern __declspec(dllexport)\n# define OPENSSL_EXTERN extern __declspec(dllimport)\n# else\n# define OPENSSL_EXPORT extern\n# define OPENSSL_EXTERN extern\n# endif\n\n/*-\n * Macros to allow global variables to be reached through function calls when\n * required (if a shared library version requires it, for example.\n * The way it's done allows definitions like this:\n *\n * // in foobar.c\n * OPENSSL_IMPLEMENT_GLOBAL(int,foobar,0)\n * // in foobar.h\n * OPENSSL_DECLARE_GLOBAL(int,foobar);\n * #define foobar OPENSSL_GLOBAL_REF(foobar)\n */\n# ifdef OPENSSL_EXPORT_VAR_AS_FUNCTION\n# define OPENSSL_IMPLEMENT_GLOBAL(type,name,value) \\\n type *_shadow_##name(void) \\\n { static type _hide_##name=value; return &_hide_##name; }\n# define OPENSSL_DECLARE_GLOBAL(type,name) type *_shadow_##name(void)\n# define OPENSSL_GLOBAL_REF(name) (*(_shadow_##name()))\n# else\n# define OPENSSL_IMPLEMENT_GLOBAL(type,name,value) type _shadow_##name=value;\n# define OPENSSL_DECLARE_GLOBAL(type,name) OPENSSL_EXPORT type _shadow_##name\n# define OPENSSL_GLOBAL_REF(name) _shadow_##name\n# endif\n\n# ifdef _WIN32\n# ifdef _WIN64\n# define ossl_ssize_t __int64\n# define OSSL_SSIZE_MAX _I64_MAX\n# else\n# define ossl_ssize_t int\n# define OSSL_SSIZE_MAX INT_MAX\n# endif\n# endif\n\n# if defined(OPENSSL_SYS_UEFI) && !defined(ossl_ssize_t)\n# define ossl_ssize_t INTN\n# define OSSL_SSIZE_MAX MAX_INTN\n# endif\n\n# ifndef ossl_ssize_t\n# define ossl_ssize_t ssize_t\n# if defined(SSIZE_MAX)\n# define OSSL_SSIZE_MAX SSIZE_MAX\n# elif defined(_POSIX_SSIZE_MAX)\n# define OSSL_SSIZE_MAX _POSIX_SSIZE_MAX\n# else\n# define OSSL_SSIZE_MAX ((ssize_t)(SIZE_MAX>>1))\n# endif\n# endif\n\n# ifdef DEBUG_UNUSED\n# define __owur __attribute__((__warn_unused_result__))\n# else\n# define __owur\n# endif\n\n/* Standard integer types */\n# if defined(OPENSSL_SYS_UEFI)\ntypedef INT8 int8_t;\ntypedef UINT8 uint8_t;\ntypedef INT16 int16_t;\ntypedef UINT16 uint16_t;\ntypedef INT32 int32_t;\ntypedef UINT32 uint32_t;\ntypedef INT64 int64_t;\ntypedef UINT64 uint64_t;\n# elif (defined(__STDC_VERSION__) && __STDC_VERSION__ >= 199901L) || \\\n defined(__osf__) || defined(__sgi) || defined(__hpux) || \\\n defined(OPENSSL_SYS_VMS) || defined (__OpenBSD__)\n# include \n# elif defined(_MSC_VER) && _MSC_VER<1600\n/*\n * minimally required typdefs for systems not supporting inttypes.h or\n * stdint.h: currently just older VC++\n */\ntypedef signed char int8_t;\ntypedef unsigned char uint8_t;\ntypedef short int16_t;\ntypedef unsigned short uint16_t;\ntypedef int int32_t;\ntypedef unsigned int uint32_t;\ntypedef __int64 int64_t;\ntypedef unsigned __int64 uint64_t;\n# else\n# include \n# endif\n\n/* ossl_inline: portable inline definition usable in public headers */\n# if !defined(inline) && !defined(__cplusplus)\n# if defined(__STDC_VERSION__) && __STDC_VERSION__>=199901L\n /* just use inline */\n# define ossl_inline inline\n# elif defined(__GNUC__) && __GNUC__>=2\n# define ossl_inline __inline__\n# elif defined(_MSC_VER)\n /*\n * Visual Studio: inline is available in C++ only, however\n * __inline is available for C, see\n * http://msdn.microsoft.com/en-us/library/z8y1yy88.aspx\n */\n# define ossl_inline __inline\n# else\n# define ossl_inline\n# endif\n# else\n# define ossl_inline inline\n# endif\n\n# if defined(__STDC_VERSION__) && __STDC_VERSION__ >= 201112L && \\\n !defined(__cplusplus) \n# define ossl_noreturn _Noreturn\n# elif defined(__GNUC__) && __GNUC__ >= 2\n# define ossl_noreturn __attribute__((noreturn))\n# else\n# define ossl_noreturn\n# endif\n\n/* ossl_unused: portable unused attribute for use in public headers */\n# if defined(__GNUC__)\n# define ossl_unused __attribute__((unused))\n# else\n# define ossl_unused\n# endif\n\n#ifdef __cplusplus\n}\n#endif\n#endif\n" }, { "path": "cryptomini/include/openssl/ebcdic.h", "content": "/*\n * Copyright 1999-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_EBCDIC_H\n# define HEADER_EBCDIC_H\n\n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/* Avoid name clashes with other applications */\n# define os_toascii _openssl_os_toascii\n# define os_toebcdic _openssl_os_toebcdic\n# define ebcdic2ascii _openssl_ebcdic2ascii\n# define ascii2ebcdic _openssl_ascii2ebcdic\n\nextern const unsigned char os_toascii[256];\nextern const unsigned char os_toebcdic[256];\nvoid *ebcdic2ascii(void *dest, const void *srce, size_t count);\nvoid *ascii2ebcdic(void *dest, const void *srce, size_t count);\n\n#ifdef __cplusplus\n}\n#endif\n#endif\n" }, { "path": "cryptomini/include/openssl/ec.h", "content": "/*\n * Copyright 2002-2021 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_EC_H\n# define HEADER_EC_H\n\n# include \n\n# ifndef OPENSSL_NO_EC\n# include \n# include \n# if OPENSSL_API_COMPAT < 0x10100000L\n# include \n# endif\n# include \n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n# ifndef OPENSSL_ECC_MAX_FIELD_BITS\n# define OPENSSL_ECC_MAX_FIELD_BITS 661\n# endif\n\n/** Enum for the point conversion form as defined in X9.62 (ECDSA)\n * for the encoding of a elliptic curve point (x,y) */\ntypedef enum {\n /** the point is encoded as z||x, where the octet z specifies\n * which solution of the quadratic equation y is */\n POINT_CONVERSION_COMPRESSED = 2,\n /** the point is encoded as z||x||y, where z is the octet 0x04 */\n POINT_CONVERSION_UNCOMPRESSED = 4,\n /** the point is encoded as z||x||y, where the octet z specifies\n * which solution of the quadratic equation y is */\n POINT_CONVERSION_HYBRID = 6\n} point_conversion_form_t;\n\ntypedef struct ec_method_st EC_METHOD;\ntypedef struct ec_group_st EC_GROUP;\ntypedef struct ec_point_st EC_POINT;\ntypedef struct ecpk_parameters_st ECPKPARAMETERS;\ntypedef struct ec_parameters_st ECPARAMETERS;\n\n/********************************************************************/\n/* EC_METHODs for curves over GF(p) */\n/********************************************************************/\n\n/** Returns the basic GFp ec methods which provides the basis for the\n * optimized methods.\n * \\return EC_METHOD object\n */\nconst EC_METHOD *EC_GFp_simple_method(void);\n\n/** Returns GFp methods using montgomery multiplication.\n * \\return EC_METHOD object\n */\nconst EC_METHOD *EC_GFp_mont_method(void);\n\n/** Returns GFp methods using optimized methods for NIST recommended curves\n * \\return EC_METHOD object\n */\nconst EC_METHOD *EC_GFp_nist_method(void);\n\n# ifndef OPENSSL_NO_EC_NISTP_64_GCC_128\n/** Returns 64-bit optimized methods for nistp224\n * \\return EC_METHOD object\n */\nconst EC_METHOD *EC_GFp_nistp224_method(void);\n\n/** Returns 64-bit optimized methods for nistp256\n * \\return EC_METHOD object\n */\nconst EC_METHOD *EC_GFp_nistp256_method(void);\n\n/** Returns 64-bit optimized methods for nistp521\n * \\return EC_METHOD object\n */\nconst EC_METHOD *EC_GFp_nistp521_method(void);\n# endif\n\n# ifndef OPENSSL_NO_EC2M\n/********************************************************************/\n/* EC_METHOD for curves over GF(2^m) */\n/********************************************************************/\n\n/** Returns the basic GF2m ec method\n * \\return EC_METHOD object\n */\nconst EC_METHOD *EC_GF2m_simple_method(void);\n\n# endif\n\n/********************************************************************/\n/* EC_GROUP functions */\n/********************************************************************/\n\n/** Creates a new EC_GROUP object\n * \\param meth EC_METHOD to use\n * \\return newly created EC_GROUP object or NULL in case of an error.\n */\nEC_GROUP *EC_GROUP_new(const EC_METHOD *meth);\n\n/** Frees a EC_GROUP object\n * \\param group EC_GROUP object to be freed.\n */\nvoid EC_GROUP_free(EC_GROUP *group);\n\n/** Clears and frees a EC_GROUP object\n * \\param group EC_GROUP object to be cleared and freed.\n */\nvoid EC_GROUP_clear_free(EC_GROUP *group);\n\n/** Copies EC_GROUP objects. Note: both EC_GROUPs must use the same EC_METHOD.\n * \\param dst destination EC_GROUP object\n * \\param src source EC_GROUP object\n * \\return 1 on success and 0 if an error occurred.\n */\nint EC_GROUP_copy(EC_GROUP *dst, const EC_GROUP *src);\n\n/** Creates a new EC_GROUP object and copies the copies the content\n * form src to the newly created EC_KEY object\n * \\param src source EC_GROUP object\n * \\return newly created EC_GROUP object or NULL in case of an error.\n */\nEC_GROUP *EC_GROUP_dup(const EC_GROUP *src);\n\n/** Returns the EC_METHOD of the EC_GROUP object.\n * \\param group EC_GROUP object\n * \\return EC_METHOD used in this EC_GROUP object.\n */\nconst EC_METHOD *EC_GROUP_method_of(const EC_GROUP *group);\n\n/** Returns the field type of the EC_METHOD.\n * \\param meth EC_METHOD object\n * \\return NID of the underlying field type OID.\n */\nint EC_METHOD_get_field_type(const EC_METHOD *meth);\n\n/** Sets the generator and its order/cofactor of a EC_GROUP object.\n * \\param group EC_GROUP object\n * \\param generator EC_POINT object with the generator.\n * \\param order the order of the group generated by the generator.\n * \\param cofactor the index of the sub-group generated by the generator\n * in the group of all points on the elliptic curve.\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_GROUP_set_generator(EC_GROUP *group, const EC_POINT *generator,\n const BIGNUM *order, const BIGNUM *cofactor);\n\n/** Returns the generator of a EC_GROUP object.\n * \\param group EC_GROUP object\n * \\return the currently used generator (possibly NULL).\n */\nconst EC_POINT *EC_GROUP_get0_generator(const EC_GROUP *group);\n\n/** Returns the montgomery data for order(Generator)\n * \\param group EC_GROUP object\n * \\return the currently used montgomery data (possibly NULL).\n*/\nBN_MONT_CTX *EC_GROUP_get_mont_data(const EC_GROUP *group);\n\n/** Gets the order of a EC_GROUP\n * \\param group EC_GROUP object\n * \\param order BIGNUM to which the order is copied\n * \\param ctx unused\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_GROUP_get_order(const EC_GROUP *group, BIGNUM *order, BN_CTX *ctx);\n\n/** Gets the order of an EC_GROUP\n * \\param group EC_GROUP object\n * \\return the group order\n */\nconst BIGNUM *EC_GROUP_get0_order(const EC_GROUP *group);\n\n/** Gets the number of bits of the order of an EC_GROUP\n * \\param group EC_GROUP object\n * \\return number of bits of group order.\n */\nint EC_GROUP_order_bits(const EC_GROUP *group);\n\n/** Gets the cofactor of a EC_GROUP\n * \\param group EC_GROUP object\n * \\param cofactor BIGNUM to which the cofactor is copied\n * \\param ctx unused\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_GROUP_get_cofactor(const EC_GROUP *group, BIGNUM *cofactor,\n BN_CTX *ctx);\n\n/** Gets the cofactor of an EC_GROUP\n * \\param group EC_GROUP object\n * \\return the group cofactor\n */\nconst BIGNUM *EC_GROUP_get0_cofactor(const EC_GROUP *group);\n\n/** Sets the name of a EC_GROUP object\n * \\param group EC_GROUP object\n * \\param nid NID of the curve name OID\n */\nvoid EC_GROUP_set_curve_name(EC_GROUP *group, int nid);\n\n/** Returns the curve name of a EC_GROUP object\n * \\param group EC_GROUP object\n * \\return NID of the curve name OID or 0 if not set.\n */\nint EC_GROUP_get_curve_name(const EC_GROUP *group);\n\nvoid EC_GROUP_set_asn1_flag(EC_GROUP *group, int flag);\nint EC_GROUP_get_asn1_flag(const EC_GROUP *group);\n\nvoid EC_GROUP_set_point_conversion_form(EC_GROUP *group,\n point_conversion_form_t form);\npoint_conversion_form_t EC_GROUP_get_point_conversion_form(const EC_GROUP *);\n\nunsigned char *EC_GROUP_get0_seed(const EC_GROUP *x);\nsize_t EC_GROUP_get_seed_len(const EC_GROUP *);\nsize_t EC_GROUP_set_seed(EC_GROUP *, const unsigned char *, size_t len);\n\n/** Sets the parameters of a ec curve defined by y^2 = x^3 + a*x + b (for GFp)\n * or y^2 + x*y = x^3 + a*x^2 + b (for GF2m)\n * \\param group EC_GROUP object\n * \\param p BIGNUM with the prime number (GFp) or the polynomial\n * defining the underlying field (GF2m)\n * \\param a BIGNUM with parameter a of the equation\n * \\param b BIGNUM with parameter b of the equation\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_GROUP_set_curve(EC_GROUP *group, const BIGNUM *p, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *ctx);\n\n/** Gets the parameters of the ec curve defined by y^2 = x^3 + a*x + b (for GFp)\n * or y^2 + x*y = x^3 + a*x^2 + b (for GF2m)\n * \\param group EC_GROUP object\n * \\param p BIGNUM with the prime number (GFp) or the polynomial\n * defining the underlying field (GF2m)\n * \\param a BIGNUM for parameter a of the equation\n * \\param b BIGNUM for parameter b of the equation\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_GROUP_get_curve(const EC_GROUP *group, BIGNUM *p, BIGNUM *a, BIGNUM *b,\n BN_CTX *ctx);\n\n/** Sets the parameters of an ec curve. Synonym for EC_GROUP_set_curve\n * \\param group EC_GROUP object\n * \\param p BIGNUM with the prime number (GFp) or the polynomial\n * defining the underlying field (GF2m)\n * \\param a BIGNUM with parameter a of the equation\n * \\param b BIGNUM with parameter b of the equation\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nDEPRECATEDIN_1_2_0(int EC_GROUP_set_curve_GFp(EC_GROUP *group, const BIGNUM *p,\n const BIGNUM *a, const BIGNUM *b,\n BN_CTX *ctx))\n\n/** Gets the parameters of an ec curve. Synonym for EC_GROUP_get_curve\n * \\param group EC_GROUP object\n * \\param p BIGNUM with the prime number (GFp) or the polynomial\n * defining the underlying field (GF2m)\n * \\param a BIGNUM for parameter a of the equation\n * \\param b BIGNUM for parameter b of the equation\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nDEPRECATEDIN_1_2_0(int EC_GROUP_get_curve_GFp(const EC_GROUP *group, BIGNUM *p,\n BIGNUM *a, BIGNUM *b,\n BN_CTX *ctx))\n\n# ifndef OPENSSL_NO_EC2M\n/** Sets the parameter of an ec curve. Synonym for EC_GROUP_set_curve\n * \\param group EC_GROUP object\n * \\param p BIGNUM with the prime number (GFp) or the polynomial\n * defining the underlying field (GF2m)\n * \\param a BIGNUM with parameter a of the equation\n * \\param b BIGNUM with parameter b of the equation\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nDEPRECATEDIN_1_2_0(int EC_GROUP_set_curve_GF2m(EC_GROUP *group, const BIGNUM *p,\n const BIGNUM *a, const BIGNUM *b,\n BN_CTX *ctx))\n\n/** Gets the parameters of an ec curve. Synonym for EC_GROUP_get_curve\n * \\param group EC_GROUP object\n * \\param p BIGNUM with the prime number (GFp) or the polynomial\n * defining the underlying field (GF2m)\n * \\param a BIGNUM for parameter a of the equation\n * \\param b BIGNUM for parameter b of the equation\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nDEPRECATEDIN_1_2_0(int EC_GROUP_get_curve_GF2m(const EC_GROUP *group, BIGNUM *p,\n BIGNUM *a, BIGNUM *b,\n BN_CTX *ctx))\n# endif\n/** Returns the number of bits needed to represent a field element\n * \\param group EC_GROUP object\n * \\return number of bits needed to represent a field element\n */\nint EC_GROUP_get_degree(const EC_GROUP *group);\n\n/** Checks whether the parameter in the EC_GROUP define a valid ec group\n * \\param group EC_GROUP object\n * \\param ctx BN_CTX object (optional)\n * \\return 1 if group is a valid ec group and 0 otherwise\n */\nint EC_GROUP_check(const EC_GROUP *group, BN_CTX *ctx);\n\n/** Checks whether the discriminant of the elliptic curve is zero or not\n * \\param group EC_GROUP object\n * \\param ctx BN_CTX object (optional)\n * \\return 1 if the discriminant is not zero and 0 otherwise\n */\nint EC_GROUP_check_discriminant(const EC_GROUP *group, BN_CTX *ctx);\n\n/** Compares two EC_GROUP objects\n * \\param a first EC_GROUP object\n * \\param b second EC_GROUP object\n * \\param ctx BN_CTX object (optional)\n * \\return 0 if the groups are equal, 1 if not, or -1 on error\n */\nint EC_GROUP_cmp(const EC_GROUP *a, const EC_GROUP *b, BN_CTX *ctx);\n\n/*\n * EC_GROUP_new_GF*() calls EC_GROUP_new() and EC_GROUP_set_GF*() after\n * choosing an appropriate EC_METHOD\n */\n\n/** Creates a new EC_GROUP object with the specified parameters defined\n * over GFp (defined by the equation y^2 = x^3 + a*x + b)\n * \\param p BIGNUM with the prime number\n * \\param a BIGNUM with the parameter a of the equation\n * \\param b BIGNUM with the parameter b of the equation\n * \\param ctx BN_CTX object (optional)\n * \\return newly created EC_GROUP object with the specified parameters\n */\nEC_GROUP *EC_GROUP_new_curve_GFp(const BIGNUM *p, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *ctx);\n# ifndef OPENSSL_NO_EC2M\n/** Creates a new EC_GROUP object with the specified parameters defined\n * over GF2m (defined by the equation y^2 + x*y = x^3 + a*x^2 + b)\n * \\param p BIGNUM with the polynomial defining the underlying field\n * \\param a BIGNUM with the parameter a of the equation\n * \\param b BIGNUM with the parameter b of the equation\n * \\param ctx BN_CTX object (optional)\n * \\return newly created EC_GROUP object with the specified parameters\n */\nEC_GROUP *EC_GROUP_new_curve_GF2m(const BIGNUM *p, const BIGNUM *a,\n const BIGNUM *b, BN_CTX *ctx);\n# endif\n\n/** Creates a EC_GROUP object with a curve specified by a NID\n * \\param nid NID of the OID of the curve name\n * \\return newly created EC_GROUP object with specified curve or NULL\n * if an error occurred\n */\nEC_GROUP *EC_GROUP_new_by_curve_name(int nid);\n\n/** Creates a new EC_GROUP object from an ECPARAMETERS object\n * \\param params pointer to the ECPARAMETERS object\n * \\return newly created EC_GROUP object with specified curve or NULL\n * if an error occurred\n */\nEC_GROUP *EC_GROUP_new_from_ecparameters(const ECPARAMETERS *params);\n\n/** Creates an ECPARAMETERS object for the given EC_GROUP object.\n * \\param group pointer to the EC_GROUP object\n * \\param params pointer to an existing ECPARAMETERS object or NULL\n * \\return pointer to the new ECPARAMETERS object or NULL\n * if an error occurred.\n */\nECPARAMETERS *EC_GROUP_get_ecparameters(const EC_GROUP *group,\n ECPARAMETERS *params);\n\n/** Creates a new EC_GROUP object from an ECPKPARAMETERS object\n * \\param params pointer to an existing ECPKPARAMETERS object, or NULL\n * \\return newly created EC_GROUP object with specified curve, or NULL\n * if an error occurred\n */\nEC_GROUP *EC_GROUP_new_from_ecpkparameters(const ECPKPARAMETERS *params);\n\n/** Creates an ECPKPARAMETERS object for the given EC_GROUP object.\n * \\param group pointer to the EC_GROUP object\n * \\param params pointer to an existing ECPKPARAMETERS object or NULL\n * \\return pointer to the new ECPKPARAMETERS object or NULL\n * if an error occurred.\n */\nECPKPARAMETERS *EC_GROUP_get_ecpkparameters(const EC_GROUP *group,\n ECPKPARAMETERS *params);\n\n/********************************************************************/\n/* handling of internal curves */\n/********************************************************************/\n\ntypedef struct {\n int nid;\n const char *comment;\n} EC_builtin_curve;\n\n/*\n * EC_builtin_curves(EC_builtin_curve *r, size_t size) returns number of all\n * available curves or zero if a error occurred. In case r is not zero,\n * nitems EC_builtin_curve structures are filled with the data of the first\n * nitems internal groups\n */\nsize_t EC_get_builtin_curves(EC_builtin_curve *r, size_t nitems);\n\nconst char *EC_curve_nid2nist(int nid);\nint EC_curve_nist2nid(const char *name);\n\n/********************************************************************/\n/* EC_POINT functions */\n/********************************************************************/\n\n/** Creates a new EC_POINT object for the specified EC_GROUP\n * \\param group EC_GROUP the underlying EC_GROUP object\n * \\return newly created EC_POINT object or NULL if an error occurred\n */\nEC_POINT *EC_POINT_new(const EC_GROUP *group);\n\n/** Frees a EC_POINT object\n * \\param point EC_POINT object to be freed\n */\nvoid EC_POINT_free(EC_POINT *point);\n\n/** Clears and frees a EC_POINT object\n * \\param point EC_POINT object to be cleared and freed\n */\nvoid EC_POINT_clear_free(EC_POINT *point);\n\n/** Copies EC_POINT object\n * \\param dst destination EC_POINT object\n * \\param src source EC_POINT object\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_POINT_copy(EC_POINT *dst, const EC_POINT *src);\n\n/** Creates a new EC_POINT object and copies the content of the supplied\n * EC_POINT\n * \\param src source EC_POINT object\n * \\param group underlying the EC_GROUP object\n * \\return newly created EC_POINT object or NULL if an error occurred\n */\nEC_POINT *EC_POINT_dup(const EC_POINT *src, const EC_GROUP *group);\n\n/** Returns the EC_METHOD used in EC_POINT object\n * \\param point EC_POINT object\n * \\return the EC_METHOD used\n */\nconst EC_METHOD *EC_POINT_method_of(const EC_POINT *point);\n\n/** Sets a point to infinity (neutral element)\n * \\param group underlying EC_GROUP object\n * \\param point EC_POINT to set to infinity\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_POINT_set_to_infinity(const EC_GROUP *group, EC_POINT *point);\n\n/** Sets the jacobian projective coordinates of a EC_POINT over GFp\n * \\param group underlying EC_GROUP object\n * \\param p EC_POINT object\n * \\param x BIGNUM with the x-coordinate\n * \\param y BIGNUM with the y-coordinate\n * \\param z BIGNUM with the z-coordinate\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_POINT_set_Jprojective_coordinates_GFp(const EC_GROUP *group,\n EC_POINT *p, const BIGNUM *x,\n const BIGNUM *y, const BIGNUM *z,\n BN_CTX *ctx);\n\n/** Gets the jacobian projective coordinates of a EC_POINT over GFp\n * \\param group underlying EC_GROUP object\n * \\param p EC_POINT object\n * \\param x BIGNUM for the x-coordinate\n * \\param y BIGNUM for the y-coordinate\n * \\param z BIGNUM for the z-coordinate\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_POINT_get_Jprojective_coordinates_GFp(const EC_GROUP *group,\n const EC_POINT *p, BIGNUM *x,\n BIGNUM *y, BIGNUM *z,\n BN_CTX *ctx);\n\n/** Sets the affine coordinates of an EC_POINT\n * \\param group underlying EC_GROUP object\n * \\param p EC_POINT object\n * \\param x BIGNUM with the x-coordinate\n * \\param y BIGNUM with the y-coordinate\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_POINT_set_affine_coordinates(const EC_GROUP *group, EC_POINT *p,\n const BIGNUM *x, const BIGNUM *y,\n BN_CTX *ctx);\n\n/** Gets the affine coordinates of an EC_POINT.\n * \\param group underlying EC_GROUP object\n * \\param p EC_POINT object\n * \\param x BIGNUM for the x-coordinate\n * \\param y BIGNUM for the y-coordinate\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_POINT_get_affine_coordinates(const EC_GROUP *group, const EC_POINT *p,\n BIGNUM *x, BIGNUM *y, BN_CTX *ctx);\n\n/** Sets the affine coordinates of an EC_POINT. A synonym of\n * EC_POINT_set_affine_coordinates\n * \\param group underlying EC_GROUP object\n * \\param p EC_POINT object\n * \\param x BIGNUM with the x-coordinate\n * \\param y BIGNUM with the y-coordinate\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nDEPRECATEDIN_1_2_0(int EC_POINT_set_affine_coordinates_GFp(const EC_GROUP *group,\n EC_POINT *p,\n const BIGNUM *x,\n const BIGNUM *y,\n BN_CTX *ctx))\n\n/** Gets the affine coordinates of an EC_POINT. A synonym of\n * EC_POINT_get_affine_coordinates\n * \\param group underlying EC_GROUP object\n * \\param p EC_POINT object\n * \\param x BIGNUM for the x-coordinate\n * \\param y BIGNUM for the y-coordinate\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nDEPRECATEDIN_1_2_0(int EC_POINT_get_affine_coordinates_GFp(const EC_GROUP *group,\n const EC_POINT *p,\n BIGNUM *x,\n BIGNUM *y,\n BN_CTX *ctx))\n\n/** Sets the x9.62 compressed coordinates of a EC_POINT\n * \\param group underlying EC_GROUP object\n * \\param p EC_POINT object\n * \\param x BIGNUM with x-coordinate\n * \\param y_bit integer with the y-Bit (either 0 or 1)\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_POINT_set_compressed_coordinates(const EC_GROUP *group, EC_POINT *p,\n const BIGNUM *x, int y_bit,\n BN_CTX *ctx);\n\n/** Sets the x9.62 compressed coordinates of a EC_POINT. A synonym of\n * EC_POINT_set_compressed_coordinates\n * \\param group underlying EC_GROUP object\n * \\param p EC_POINT object\n * \\param x BIGNUM with x-coordinate\n * \\param y_bit integer with the y-Bit (either 0 or 1)\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nDEPRECATEDIN_1_2_0(int EC_POINT_set_compressed_coordinates_GFp(const EC_GROUP *group,\n EC_POINT *p,\n const BIGNUM *x,\n int y_bit,\n BN_CTX *ctx))\n# ifndef OPENSSL_NO_EC2M\n/** Sets the affine coordinates of an EC_POINT. A synonym of\n * EC_POINT_set_affine_coordinates\n * \\param group underlying EC_GROUP object\n * \\param p EC_POINT object\n * \\param x BIGNUM with the x-coordinate\n * \\param y BIGNUM with the y-coordinate\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nDEPRECATEDIN_1_2_0(int EC_POINT_set_affine_coordinates_GF2m(const EC_GROUP *group,\n EC_POINT *p,\n const BIGNUM *x,\n const BIGNUM *y,\n BN_CTX *ctx))\n\n/** Gets the affine coordinates of an EC_POINT. A synonym of\n * EC_POINT_get_affine_coordinates\n * \\param group underlying EC_GROUP object\n * \\param p EC_POINT object\n * \\param x BIGNUM for the x-coordinate\n * \\param y BIGNUM for the y-coordinate\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nDEPRECATEDIN_1_2_0(int EC_POINT_get_affine_coordinates_GF2m(const EC_GROUP *group,\n const EC_POINT *p,\n BIGNUM *x,\n BIGNUM *y,\n BN_CTX *ctx))\n\n/** Sets the x9.62 compressed coordinates of a EC_POINT. A synonym of\n * EC_POINT_set_compressed_coordinates\n * \\param group underlying EC_GROUP object\n * \\param p EC_POINT object\n * \\param x BIGNUM with x-coordinate\n * \\param y_bit integer with the y-Bit (either 0 or 1)\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nDEPRECATEDIN_1_2_0(int EC_POINT_set_compressed_coordinates_GF2m(const EC_GROUP *group,\n EC_POINT *p,\n const BIGNUM *x,\n int y_bit,\n BN_CTX *ctx))\n# endif\n/** Encodes a EC_POINT object to a octet string\n * \\param group underlying EC_GROUP object\n * \\param p EC_POINT object\n * \\param form point conversion form\n * \\param buf memory buffer for the result. If NULL the function returns\n * required buffer size.\n * \\param len length of the memory buffer\n * \\param ctx BN_CTX object (optional)\n * \\return the length of the encoded octet string or 0 if an error occurred\n */\nsize_t EC_POINT_point2oct(const EC_GROUP *group, const EC_POINT *p,\n point_conversion_form_t form,\n unsigned char *buf, size_t len, BN_CTX *ctx);\n\n/** Decodes a EC_POINT from a octet string\n * \\param group underlying EC_GROUP object\n * \\param p EC_POINT object\n * \\param buf memory buffer with the encoded ec point\n * \\param len length of the encoded ec point\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_POINT_oct2point(const EC_GROUP *group, EC_POINT *p,\n const unsigned char *buf, size_t len, BN_CTX *ctx);\n\n/** Encodes an EC_POINT object to an allocated octet string\n * \\param group underlying EC_GROUP object\n * \\param point EC_POINT object\n * \\param form point conversion form\n * \\param pbuf returns pointer to allocated buffer\n * \\param ctx BN_CTX object (optional)\n * \\return the length of the encoded octet string or 0 if an error occurred\n */\nsize_t EC_POINT_point2buf(const EC_GROUP *group, const EC_POINT *point,\n point_conversion_form_t form,\n unsigned char **pbuf, BN_CTX *ctx);\n\n/* other interfaces to point2oct/oct2point: */\nBIGNUM *EC_POINT_point2bn(const EC_GROUP *, const EC_POINT *,\n point_conversion_form_t form, BIGNUM *, BN_CTX *);\nEC_POINT *EC_POINT_bn2point(const EC_GROUP *, const BIGNUM *,\n EC_POINT *, BN_CTX *);\nchar *EC_POINT_point2hex(const EC_GROUP *, const EC_POINT *,\n point_conversion_form_t form, BN_CTX *);\nEC_POINT *EC_POINT_hex2point(const EC_GROUP *, const char *,\n EC_POINT *, BN_CTX *);\n\n/********************************************************************/\n/* functions for doing EC_POINT arithmetic */\n/********************************************************************/\n\n/** Computes the sum of two EC_POINT\n * \\param group underlying EC_GROUP object\n * \\param r EC_POINT object for the result (r = a + b)\n * \\param a EC_POINT object with the first summand\n * \\param b EC_POINT object with the second summand\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_POINT_add(const EC_GROUP *group, EC_POINT *r, const EC_POINT *a,\n const EC_POINT *b, BN_CTX *ctx);\n\n/** Computes the double of a EC_POINT\n * \\param group underlying EC_GROUP object\n * \\param r EC_POINT object for the result (r = 2 * a)\n * \\param a EC_POINT object\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_POINT_dbl(const EC_GROUP *group, EC_POINT *r, const EC_POINT *a,\n BN_CTX *ctx);\n\n/** Computes the inverse of a EC_POINT\n * \\param group underlying EC_GROUP object\n * \\param a EC_POINT object to be inverted (it's used for the result as well)\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_POINT_invert(const EC_GROUP *group, EC_POINT *a, BN_CTX *ctx);\n\n/** Checks whether the point is the neutral element of the group\n * \\param group the underlying EC_GROUP object\n * \\param p EC_POINT object\n * \\return 1 if the point is the neutral element and 0 otherwise\n */\nint EC_POINT_is_at_infinity(const EC_GROUP *group, const EC_POINT *p);\n\n/** Checks whether the point is on the curve\n * \\param group underlying EC_GROUP object\n * \\param point EC_POINT object to check\n * \\param ctx BN_CTX object (optional)\n * \\return 1 if the point is on the curve, 0 if not, or -1 on error\n */\nint EC_POINT_is_on_curve(const EC_GROUP *group, const EC_POINT *point,\n BN_CTX *ctx);\n\n/** Compares two EC_POINTs\n * \\param group underlying EC_GROUP object\n * \\param a first EC_POINT object\n * \\param b second EC_POINT object\n * \\param ctx BN_CTX object (optional)\n * \\return 1 if the points are not equal, 0 if they are, or -1 on error\n */\nint EC_POINT_cmp(const EC_GROUP *group, const EC_POINT *a, const EC_POINT *b,\n BN_CTX *ctx);\n\nint EC_POINT_make_affine(const EC_GROUP *group, EC_POINT *point, BN_CTX *ctx);\nint EC_POINTs_make_affine(const EC_GROUP *group, size_t num,\n EC_POINT *points[], BN_CTX *ctx);\n\n/** Computes r = generator * n + sum_{i=0}^{num-1} p[i] * m[i]\n * \\param group underlying EC_GROUP object\n * \\param r EC_POINT object for the result\n * \\param n BIGNUM with the multiplier for the group generator (optional)\n * \\param num number further summands\n * \\param p array of size num of EC_POINT objects\n * \\param m array of size num of BIGNUM objects\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_POINTs_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *n,\n size_t num, const EC_POINT *p[], const BIGNUM *m[],\n BN_CTX *ctx);\n\n/** Computes r = generator * n + q * m\n * \\param group underlying EC_GROUP object\n * \\param r EC_POINT object for the result\n * \\param n BIGNUM with the multiplier for the group generator (optional)\n * \\param q EC_POINT object with the first factor of the second summand\n * \\param m BIGNUM with the second factor of the second summand\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_POINT_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *n,\n const EC_POINT *q, const BIGNUM *m, BN_CTX *ctx);\n\n/** Stores multiples of generator for faster point multiplication\n * \\param group EC_GROUP object\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_GROUP_precompute_mult(EC_GROUP *group, BN_CTX *ctx);\n\n/** Reports whether a precomputation has been done\n * \\param group EC_GROUP object\n * \\return 1 if a pre-computation has been done and 0 otherwise\n */\nint EC_GROUP_have_precompute_mult(const EC_GROUP *group);\n\n/********************************************************************/\n/* ASN1 stuff */\n/********************************************************************/\n\nDECLARE_ASN1_ITEM(ECPKPARAMETERS)\nDECLARE_ASN1_ALLOC_FUNCTIONS(ECPKPARAMETERS)\nDECLARE_ASN1_ITEM(ECPARAMETERS)\nDECLARE_ASN1_ALLOC_FUNCTIONS(ECPARAMETERS)\n\n/*\n * EC_GROUP_get_basis_type() returns the NID of the basis type used to\n * represent the field elements\n */\nint EC_GROUP_get_basis_type(const EC_GROUP *);\n# ifndef OPENSSL_NO_EC2M\nint EC_GROUP_get_trinomial_basis(const EC_GROUP *, unsigned int *k);\nint EC_GROUP_get_pentanomial_basis(const EC_GROUP *, unsigned int *k1,\n unsigned int *k2, unsigned int *k3);\n# endif\n\n# define OPENSSL_EC_EXPLICIT_CURVE 0x000\n# define OPENSSL_EC_NAMED_CURVE 0x001\n\nEC_GROUP *d2i_ECPKParameters(EC_GROUP **, const unsigned char **in, long len);\nint i2d_ECPKParameters(const EC_GROUP *, unsigned char **out);\n\n# define d2i_ECPKParameters_bio(bp,x) \\\n ASN1_d2i_bio_of(EC_GROUP, NULL, d2i_ECPKParameters, bp, x)\n# define i2d_ECPKParameters_bio(bp,x) \\\n ASN1_i2d_bio_of_const(EC_GROUP, i2d_ECPKParameters, bp, x)\n# define d2i_ECPKParameters_fp(fp,x) \\\n (EC_GROUP *)ASN1_d2i_fp(NULL, (d2i_of_void *)d2i_ECPKParameters, (fp), \\\n (void **)(x))\n# define i2d_ECPKParameters_fp(fp,x) \\\n ASN1_i2d_fp((i2d_of_void *)i2d_ECPKParameters, (fp), (void *)(x))\n\nint ECPKParameters_print(BIO *bp, const EC_GROUP *x, int off);\n# ifndef OPENSSL_NO_STDIO\nint ECPKParameters_print_fp(FILE *fp, const EC_GROUP *x, int off);\n# endif\n\n/********************************************************************/\n/* EC_KEY functions */\n/********************************************************************/\n\n/* some values for the encoding_flag */\n# define EC_PKEY_NO_PARAMETERS 0x001\n# define EC_PKEY_NO_PUBKEY 0x002\n\n/* some values for the flags field */\n# define EC_FLAG_NON_FIPS_ALLOW 0x1\n# define EC_FLAG_FIPS_CHECKED 0x2\n# define EC_FLAG_COFACTOR_ECDH 0x1000\n\n/** Creates a new EC_KEY object.\n * \\return EC_KEY object or NULL if an error occurred.\n */\nEC_KEY *EC_KEY_new(void);\n\nint EC_KEY_get_flags(const EC_KEY *key);\n\nvoid EC_KEY_set_flags(EC_KEY *key, int flags);\n\nvoid EC_KEY_clear_flags(EC_KEY *key, int flags);\n\nint EC_KEY_decoded_from_explicit_params(const EC_KEY *key);\n\n/** Creates a new EC_KEY object using a named curve as underlying\n * EC_GROUP object.\n * \\param nid NID of the named curve.\n * \\return EC_KEY object or NULL if an error occurred.\n */\nEC_KEY *EC_KEY_new_by_curve_name(int nid);\n\n/** Frees a EC_KEY object.\n * \\param key EC_KEY object to be freed.\n */\nvoid EC_KEY_free(EC_KEY *key);\n\n/** Copies a EC_KEY object.\n * \\param dst destination EC_KEY object\n * \\param src src EC_KEY object\n * \\return dst or NULL if an error occurred.\n */\nEC_KEY *EC_KEY_copy(EC_KEY *dst, const EC_KEY *src);\n\n/** Creates a new EC_KEY object and copies the content from src to it.\n * \\param src the source EC_KEY object\n * \\return newly created EC_KEY object or NULL if an error occurred.\n */\nEC_KEY *EC_KEY_dup(const EC_KEY *src);\n\n/** Increases the internal reference count of a EC_KEY object.\n * \\param key EC_KEY object\n * \\return 1 on success and 0 if an error occurred.\n */\nint EC_KEY_up_ref(EC_KEY *key);\n\n/** Returns the ENGINE object of a EC_KEY object\n * \\param eckey EC_KEY object\n * \\return the ENGINE object (possibly NULL).\n */\nENGINE *EC_KEY_get0_engine(const EC_KEY *eckey);\n\n/** Returns the EC_GROUP object of a EC_KEY object\n * \\param key EC_KEY object\n * \\return the EC_GROUP object (possibly NULL).\n */\nconst EC_GROUP *EC_KEY_get0_group(const EC_KEY *key);\n\n/** Sets the EC_GROUP of a EC_KEY object.\n * \\param key EC_KEY object\n * \\param group EC_GROUP to use in the EC_KEY object (note: the EC_KEY\n * object will use an own copy of the EC_GROUP).\n * \\return 1 on success and 0 if an error occurred.\n */\nint EC_KEY_set_group(EC_KEY *key, const EC_GROUP *group);\n\n/** Returns the private key of a EC_KEY object.\n * \\param key EC_KEY object\n * \\return a BIGNUM with the private key (possibly NULL).\n */\nconst BIGNUM *EC_KEY_get0_private_key(const EC_KEY *key);\n\n/** Sets the private key of a EC_KEY object.\n * \\param key EC_KEY object\n * \\param prv BIGNUM with the private key (note: the EC_KEY object\n * will use an own copy of the BIGNUM).\n * \\return 1 on success and 0 if an error occurred.\n */\nint EC_KEY_set_private_key(EC_KEY *key, const BIGNUM *prv);\n\n/** Returns the public key of a EC_KEY object.\n * \\param key the EC_KEY object\n * \\return a EC_POINT object with the public key (possibly NULL)\n */\nconst EC_POINT *EC_KEY_get0_public_key(const EC_KEY *key);\n\n/** Sets the public key of a EC_KEY object.\n * \\param key EC_KEY object\n * \\param pub EC_POINT object with the public key (note: the EC_KEY object\n * will use an own copy of the EC_POINT object).\n * \\return 1 on success and 0 if an error occurred.\n */\nint EC_KEY_set_public_key(EC_KEY *key, const EC_POINT *pub);\n\nunsigned EC_KEY_get_enc_flags(const EC_KEY *key);\nvoid EC_KEY_set_enc_flags(EC_KEY *eckey, unsigned int flags);\npoint_conversion_form_t EC_KEY_get_conv_form(const EC_KEY *key);\nvoid EC_KEY_set_conv_form(EC_KEY *eckey, point_conversion_form_t cform);\n\n#define EC_KEY_get_ex_new_index(l, p, newf, dupf, freef) \\\n CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_EC_KEY, l, p, newf, dupf, freef)\nint EC_KEY_set_ex_data(EC_KEY *key, int idx, void *arg);\nvoid *EC_KEY_get_ex_data(const EC_KEY *key, int idx);\n\n/* wrapper functions for the underlying EC_GROUP object */\nvoid EC_KEY_set_asn1_flag(EC_KEY *eckey, int asn1_flag);\n\n/** Creates a table of pre-computed multiples of the generator to\n * accelerate further EC_KEY operations.\n * \\param key EC_KEY object\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred.\n */\nint EC_KEY_precompute_mult(EC_KEY *key, BN_CTX *ctx);\n\n/** Creates a new ec private (and optional a new public) key.\n * \\param key EC_KEY object\n * \\return 1 on success and 0 if an error occurred.\n */\nint EC_KEY_generate_key(EC_KEY *key);\n\n/** Verifies that a private and/or public key is valid.\n * \\param key the EC_KEY object\n * \\return 1 on success and 0 otherwise.\n */\nint EC_KEY_check_key(const EC_KEY *key);\n\n/** Indicates if an EC_KEY can be used for signing.\n * \\param eckey the EC_KEY object\n * \\return 1 if can can sign and 0 otherwise.\n */\nint EC_KEY_can_sign(const EC_KEY *eckey);\n\n/** Sets a public key from affine coordinates performing\n * necessary NIST PKV tests.\n * \\param key the EC_KEY object\n * \\param x public key x coordinate\n * \\param y public key y coordinate\n * \\return 1 on success and 0 otherwise.\n */\nint EC_KEY_set_public_key_affine_coordinates(EC_KEY *key, BIGNUM *x,\n BIGNUM *y);\n\n/** Encodes an EC_KEY public key to an allocated octet string\n * \\param key key to encode\n * \\param form point conversion form\n * \\param pbuf returns pointer to allocated buffer\n * \\param ctx BN_CTX object (optional)\n * \\return the length of the encoded octet string or 0 if an error occurred\n */\nsize_t EC_KEY_key2buf(const EC_KEY *key, point_conversion_form_t form,\n unsigned char **pbuf, BN_CTX *ctx);\n\n/** Decodes a EC_KEY public key from a octet string\n * \\param key key to decode\n * \\param buf memory buffer with the encoded ec point\n * \\param len length of the encoded ec point\n * \\param ctx BN_CTX object (optional)\n * \\return 1 on success and 0 if an error occurred\n */\n\nint EC_KEY_oct2key(EC_KEY *key, const unsigned char *buf, size_t len,\n BN_CTX *ctx);\n\n/** Decodes an EC_KEY private key from an octet string\n * \\param key key to decode\n * \\param buf memory buffer with the encoded private key\n * \\param len length of the encoded key\n * \\return 1 on success and 0 if an error occurred\n */\n\nint EC_KEY_oct2priv(EC_KEY *key, const unsigned char *buf, size_t len);\n\n/** Encodes a EC_KEY private key to an octet string\n * \\param key key to encode\n * \\param buf memory buffer for the result. If NULL the function returns\n * required buffer size.\n * \\param len length of the memory buffer\n * \\return the length of the encoded octet string or 0 if an error occurred\n */\n\nsize_t EC_KEY_priv2oct(const EC_KEY *key, unsigned char *buf, size_t len);\n\n/** Encodes an EC_KEY private key to an allocated octet string\n * \\param eckey key to encode\n * \\param pbuf returns pointer to allocated buffer\n * \\return the length of the encoded octet string or 0 if an error occurred\n */\nsize_t EC_KEY_priv2buf(const EC_KEY *eckey, unsigned char **pbuf);\n\n/********************************************************************/\n/* de- and encoding functions for SEC1 ECPrivateKey */\n/********************************************************************/\n\n/** Decodes a private key from a memory buffer.\n * \\param key a pointer to a EC_KEY object which should be used (or NULL)\n * \\param in pointer to memory with the DER encoded private key\n * \\param len length of the DER encoded private key\n * \\return the decoded private key or NULL if an error occurred.\n */\nEC_KEY *d2i_ECPrivateKey(EC_KEY **key, const unsigned char **in, long len);\n\n/** Encodes a private key object and stores the result in a buffer.\n * \\param key the EC_KEY object to encode\n * \\param out the buffer for the result (if NULL the function returns number\n * of bytes needed).\n * \\return 1 on success and 0 if an error occurred.\n */\nint i2d_ECPrivateKey(EC_KEY *key, unsigned char **out);\n\n/********************************************************************/\n/* de- and encoding functions for EC parameters */\n/********************************************************************/\n\n/** Decodes ec parameter from a memory buffer.\n * \\param key a pointer to a EC_KEY object which should be used (or NULL)\n * \\param in pointer to memory with the DER encoded ec parameters\n * \\param len length of the DER encoded ec parameters\n * \\return a EC_KEY object with the decoded parameters or NULL if an error\n * occurred.\n */\nEC_KEY *d2i_ECParameters(EC_KEY **key, const unsigned char **in, long len);\n\n/** Encodes ec parameter and stores the result in a buffer.\n * \\param key the EC_KEY object with ec parameters to encode\n * \\param out the buffer for the result (if NULL the function returns number\n * of bytes needed).\n * \\return 1 on success and 0 if an error occurred.\n */\nint i2d_ECParameters(EC_KEY *key, unsigned char **out);\n\n/********************************************************************/\n/* de- and encoding functions for EC public key */\n/* (octet string, not DER -- hence 'o2i' and 'i2o') */\n/********************************************************************/\n\n/** Decodes a ec public key from a octet string.\n * \\param key a pointer to a EC_KEY object which should be used\n * \\param in memory buffer with the encoded public key\n * \\param len length of the encoded public key\n * \\return EC_KEY object with decoded public key or NULL if an error\n * occurred.\n */\nEC_KEY *o2i_ECPublicKey(EC_KEY **key, const unsigned char **in, long len);\n\n/** Encodes a ec public key in an octet string.\n * \\param key the EC_KEY object with the public key\n * \\param out the buffer for the result (if NULL the function returns number\n * of bytes needed).\n * \\return 1 on success and 0 if an error occurred\n */\nint i2o_ECPublicKey(const EC_KEY *key, unsigned char **out);\n\n/** Prints out the ec parameters on human readable form.\n * \\param bp BIO object to which the information is printed\n * \\param key EC_KEY object\n * \\return 1 on success and 0 if an error occurred\n */\nint ECParameters_print(BIO *bp, const EC_KEY *key);\n\n/** Prints out the contents of a EC_KEY object\n * \\param bp BIO object to which the information is printed\n * \\param key EC_KEY object\n * \\param off line offset\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_KEY_print(BIO *bp, const EC_KEY *key, int off);\n\n# ifndef OPENSSL_NO_STDIO\n/** Prints out the ec parameters on human readable form.\n * \\param fp file descriptor to which the information is printed\n * \\param key EC_KEY object\n * \\return 1 on success and 0 if an error occurred\n */\nint ECParameters_print_fp(FILE *fp, const EC_KEY *key);\n\n/** Prints out the contents of a EC_KEY object\n * \\param fp file descriptor to which the information is printed\n * \\param key EC_KEY object\n * \\param off line offset\n * \\return 1 on success and 0 if an error occurred\n */\nint EC_KEY_print_fp(FILE *fp, const EC_KEY *key, int off);\n\n# endif\n\nconst EC_KEY_METHOD *EC_KEY_OpenSSL(void);\nconst EC_KEY_METHOD *EC_KEY_get_default_method(void);\nvoid EC_KEY_set_default_method(const EC_KEY_METHOD *meth);\nconst EC_KEY_METHOD *EC_KEY_get_method(const EC_KEY *key);\nint EC_KEY_set_method(EC_KEY *key, const EC_KEY_METHOD *meth);\nEC_KEY *EC_KEY_new_method(ENGINE *engine);\n\n/** The old name for ecdh_KDF_X9_63\n * The ECDH KDF specification has been mistakingly attributed to ANSI X9.62,\n * it is actually specified in ANSI X9.63.\n * This identifier is retained for backwards compatibility\n */\nint ECDH_KDF_X9_62(unsigned char *out, size_t outlen,\n const unsigned char *Z, size_t Zlen,\n const unsigned char *sinfo, size_t sinfolen,\n const EVP_MD *md);\n\nint ECDH_compute_key(void *out, size_t outlen, const EC_POINT *pub_key,\n const EC_KEY *ecdh,\n void *(*KDF) (const void *in, size_t inlen,\n void *out, size_t *outlen));\n\ntypedef struct ECDSA_SIG_st ECDSA_SIG;\n\n/** Allocates and initialize a ECDSA_SIG structure\n * \\return pointer to a ECDSA_SIG structure or NULL if an error occurred\n */\nECDSA_SIG *ECDSA_SIG_new(void);\n\n/** frees a ECDSA_SIG structure\n * \\param sig pointer to the ECDSA_SIG structure\n */\nvoid ECDSA_SIG_free(ECDSA_SIG *sig);\n\n/** DER encode content of ECDSA_SIG object (note: this function modifies *pp\n * (*pp += length of the DER encoded signature)).\n * \\param sig pointer to the ECDSA_SIG object\n * \\param pp pointer to a unsigned char pointer for the output or NULL\n * \\return the length of the DER encoded ECDSA_SIG object or a negative value\n * on error\n */\nint i2d_ECDSA_SIG(const ECDSA_SIG *sig, unsigned char **pp);\n\n/** Decodes a DER encoded ECDSA signature (note: this function changes *pp\n * (*pp += len)).\n * \\param sig pointer to ECDSA_SIG pointer (may be NULL)\n * \\param pp memory buffer with the DER encoded signature\n * \\param len length of the buffer\n * \\return pointer to the decoded ECDSA_SIG structure (or NULL)\n */\nECDSA_SIG *d2i_ECDSA_SIG(ECDSA_SIG **sig, const unsigned char **pp, long len);\n\n/** Accessor for r and s fields of ECDSA_SIG\n * \\param sig pointer to ECDSA_SIG structure\n * \\param pr pointer to BIGNUM pointer for r (may be NULL)\n * \\param ps pointer to BIGNUM pointer for s (may be NULL)\n */\nvoid ECDSA_SIG_get0(const ECDSA_SIG *sig, const BIGNUM **pr, const BIGNUM **ps);\n\n/** Accessor for r field of ECDSA_SIG\n * \\param sig pointer to ECDSA_SIG structure\n */\nconst BIGNUM *ECDSA_SIG_get0_r(const ECDSA_SIG *sig);\n\n/** Accessor for s field of ECDSA_SIG\n * \\param sig pointer to ECDSA_SIG structure\n */\nconst BIGNUM *ECDSA_SIG_get0_s(const ECDSA_SIG *sig);\n\n/** Setter for r and s fields of ECDSA_SIG\n * \\param sig pointer to ECDSA_SIG structure\n * \\param r pointer to BIGNUM for r (may be NULL)\n * \\param s pointer to BIGNUM for s (may be NULL)\n */\nint ECDSA_SIG_set0(ECDSA_SIG *sig, BIGNUM *r, BIGNUM *s);\n\n/** Computes the ECDSA signature of the given hash value using\n * the supplied private key and returns the created signature.\n * \\param dgst pointer to the hash value\n * \\param dgst_len length of the hash value\n * \\param eckey EC_KEY object containing a private EC key\n * \\return pointer to a ECDSA_SIG structure or NULL if an error occurred\n */\nECDSA_SIG *ECDSA_do_sign(const unsigned char *dgst, int dgst_len,\n EC_KEY *eckey);\n\n/** Computes ECDSA signature of a given hash value using the supplied\n * private key (note: sig must point to ECDSA_size(eckey) bytes of memory).\n * \\param dgst pointer to the hash value to sign\n * \\param dgstlen length of the hash value\n * \\param kinv BIGNUM with a pre-computed inverse k (optional)\n * \\param rp BIGNUM with a pre-computed rp value (optional),\n * see ECDSA_sign_setup\n * \\param eckey EC_KEY object containing a private EC key\n * \\return pointer to a ECDSA_SIG structure or NULL if an error occurred\n */\nECDSA_SIG *ECDSA_do_sign_ex(const unsigned char *dgst, int dgstlen,\n const BIGNUM *kinv, const BIGNUM *rp,\n EC_KEY *eckey);\n\n/** Verifies that the supplied signature is a valid ECDSA\n * signature of the supplied hash value using the supplied public key.\n * \\param dgst pointer to the hash value\n * \\param dgst_len length of the hash value\n * \\param sig ECDSA_SIG structure\n * \\param eckey EC_KEY object containing a public EC key\n * \\return 1 if the signature is valid, 0 if the signature is invalid\n * and -1 on error\n */\nint ECDSA_do_verify(const unsigned char *dgst, int dgst_len,\n const ECDSA_SIG *sig, EC_KEY *eckey);\n\n/** Precompute parts of the signing operation\n * \\param eckey EC_KEY object containing a private EC key\n * \\param ctx BN_CTX object (optional)\n * \\param kinv BIGNUM pointer for the inverse of k\n * \\param rp BIGNUM pointer for x coordinate of k * generator\n * \\return 1 on success and 0 otherwise\n */\nint ECDSA_sign_setup(EC_KEY *eckey, BN_CTX *ctx, BIGNUM **kinv, BIGNUM **rp);\n\n/** Computes ECDSA signature of a given hash value using the supplied\n * private key (note: sig must point to ECDSA_size(eckey) bytes of memory).\n * \\param type this parameter is ignored\n * \\param dgst pointer to the hash value to sign\n * \\param dgstlen length of the hash value\n * \\param sig memory for the DER encoded created signature\n * \\param siglen pointer to the length of the returned signature\n * \\param eckey EC_KEY object containing a private EC key\n * \\return 1 on success and 0 otherwise\n */\nint ECDSA_sign(int type, const unsigned char *dgst, int dgstlen,\n unsigned char *sig, unsigned int *siglen, EC_KEY *eckey);\n\n/** Computes ECDSA signature of a given hash value using the supplied\n * private key (note: sig must point to ECDSA_size(eckey) bytes of memory).\n * \\param type this parameter is ignored\n * \\param dgst pointer to the hash value to sign\n * \\param dgstlen length of the hash value\n * \\param sig buffer to hold the DER encoded signature\n * \\param siglen pointer to the length of the returned signature\n * \\param kinv BIGNUM with a pre-computed inverse k (optional)\n * \\param rp BIGNUM with a pre-computed rp value (optional),\n * see ECDSA_sign_setup\n * \\param eckey EC_KEY object containing a private EC key\n * \\return 1 on success and 0 otherwise\n */\nint ECDSA_sign_ex(int type, const unsigned char *dgst, int dgstlen,\n unsigned char *sig, unsigned int *siglen,\n const BIGNUM *kinv, const BIGNUM *rp, EC_KEY *eckey);\n\n/** Verifies that the given signature is valid ECDSA signature\n * of the supplied hash value using the specified public key.\n * \\param type this parameter is ignored\n * \\param dgst pointer to the hash value\n * \\param dgstlen length of the hash value\n * \\param sig pointer to the DER encoded signature\n * \\param siglen length of the DER encoded signature\n * \\param eckey EC_KEY object containing a public EC key\n * \\return 1 if the signature is valid, 0 if the signature is invalid\n * and -1 on error\n */\nint ECDSA_verify(int type, const unsigned char *dgst, int dgstlen,\n const unsigned char *sig, int siglen, EC_KEY *eckey);\n\n/** Returns the maximum length of the DER encoded signature\n * \\param eckey EC_KEY object\n * \\return numbers of bytes required for the DER encoded signature\n */\nint ECDSA_size(const EC_KEY *eckey);\n\n/********************************************************************/\n/* EC_KEY_METHOD constructors, destructors, writers and accessors */\n/********************************************************************/\n\nEC_KEY_METHOD *EC_KEY_METHOD_new(const EC_KEY_METHOD *meth);\nvoid EC_KEY_METHOD_free(EC_KEY_METHOD *meth);\nvoid EC_KEY_METHOD_set_init(EC_KEY_METHOD *meth,\n int (*init)(EC_KEY *key),\n void (*finish)(EC_KEY *key),\n int (*copy)(EC_KEY *dest, const EC_KEY *src),\n int (*set_group)(EC_KEY *key, const EC_GROUP *grp),\n int (*set_private)(EC_KEY *key,\n const BIGNUM *priv_key),\n int (*set_public)(EC_KEY *key,\n const EC_POINT *pub_key));\n\nvoid EC_KEY_METHOD_set_keygen(EC_KEY_METHOD *meth,\n int (*keygen)(EC_KEY *key));\n\nvoid EC_KEY_METHOD_set_compute_key(EC_KEY_METHOD *meth,\n int (*ckey)(unsigned char **psec,\n size_t *pseclen,\n const EC_POINT *pub_key,\n const EC_KEY *ecdh));\n\nvoid EC_KEY_METHOD_set_sign(EC_KEY_METHOD *meth,\n int (*sign)(int type, const unsigned char *dgst,\n int dlen, unsigned char *sig,\n unsigned int *siglen,\n const BIGNUM *kinv, const BIGNUM *r,\n EC_KEY *eckey),\n int (*sign_setup)(EC_KEY *eckey, BN_CTX *ctx_in,\n BIGNUM **kinvp, BIGNUM **rp),\n ECDSA_SIG *(*sign_sig)(const unsigned char *dgst,\n int dgst_len,\n const BIGNUM *in_kinv,\n const BIGNUM *in_r,\n EC_KEY *eckey));\n\nvoid EC_KEY_METHOD_set_verify(EC_KEY_METHOD *meth,\n int (*verify)(int type, const unsigned\n char *dgst, int dgst_len,\n const unsigned char *sigbuf,\n int sig_len, EC_KEY *eckey),\n int (*verify_sig)(const unsigned char *dgst,\n int dgst_len,\n const ECDSA_SIG *sig,\n EC_KEY *eckey));\n\nvoid EC_KEY_METHOD_get_init(const EC_KEY_METHOD *meth,\n int (**pinit)(EC_KEY *key),\n void (**pfinish)(EC_KEY *key),\n int (**pcopy)(EC_KEY *dest, const EC_KEY *src),\n int (**pset_group)(EC_KEY *key,\n const EC_GROUP *grp),\n int (**pset_private)(EC_KEY *key,\n const BIGNUM *priv_key),\n int (**pset_public)(EC_KEY *key,\n const EC_POINT *pub_key));\n\nvoid EC_KEY_METHOD_get_keygen(const EC_KEY_METHOD *meth,\n int (**pkeygen)(EC_KEY *key));\n\nvoid EC_KEY_METHOD_get_compute_key(const EC_KEY_METHOD *meth,\n int (**pck)(unsigned char **psec,\n size_t *pseclen,\n const EC_POINT *pub_key,\n const EC_KEY *ecdh));\n\nvoid EC_KEY_METHOD_get_sign(const EC_KEY_METHOD *meth,\n int (**psign)(int type, const unsigned char *dgst,\n int dlen, unsigned char *sig,\n unsigned int *siglen,\n const BIGNUM *kinv, const BIGNUM *r,\n EC_KEY *eckey),\n int (**psign_setup)(EC_KEY *eckey, BN_CTX *ctx_in,\n BIGNUM **kinvp, BIGNUM **rp),\n ECDSA_SIG *(**psign_sig)(const unsigned char *dgst,\n int dgst_len,\n const BIGNUM *in_kinv,\n const BIGNUM *in_r,\n EC_KEY *eckey));\n\nvoid EC_KEY_METHOD_get_verify(const EC_KEY_METHOD *meth,\n int (**pverify)(int type, const unsigned\n char *dgst, int dgst_len,\n const unsigned char *sigbuf,\n int sig_len, EC_KEY *eckey),\n int (**pverify_sig)(const unsigned char *dgst,\n int dgst_len,\n const ECDSA_SIG *sig,\n EC_KEY *eckey));\n\n# define ECParameters_dup(x) ASN1_dup_of(EC_KEY,i2d_ECParameters,d2i_ECParameters,x)\n\n# ifndef __cplusplus\n# if defined(__SUNPRO_C)\n# if __SUNPRO_C >= 0x520\n# pragma error_messages (default,E_ARRAY_OF_INCOMPLETE_NONAME,E_ARRAY_OF_INCOMPLETE)\n# endif\n# endif\n# endif\n\n# define EVP_PKEY_CTX_set_ec_paramgen_curve_nid(ctx, nid) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_EC, \\\n EVP_PKEY_OP_PARAMGEN|EVP_PKEY_OP_KEYGEN, \\\n EVP_PKEY_CTRL_EC_PARAMGEN_CURVE_NID, nid, NULL)\n\n# define EVP_PKEY_CTX_set_ec_param_enc(ctx, flag) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_EC, \\\n EVP_PKEY_OP_PARAMGEN|EVP_PKEY_OP_KEYGEN, \\\n EVP_PKEY_CTRL_EC_PARAM_ENC, flag, NULL)\n\n# define EVP_PKEY_CTX_set_ecdh_cofactor_mode(ctx, flag) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_EC, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_EC_ECDH_COFACTOR, flag, NULL)\n\n# define EVP_PKEY_CTX_get_ecdh_cofactor_mode(ctx) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_EC, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_EC_ECDH_COFACTOR, -2, NULL)\n\n# define EVP_PKEY_CTX_set_ecdh_kdf_type(ctx, kdf) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_EC, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_EC_KDF_TYPE, kdf, NULL)\n\n# define EVP_PKEY_CTX_get_ecdh_kdf_type(ctx) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_EC, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_EC_KDF_TYPE, -2, NULL)\n\n# define EVP_PKEY_CTX_set_ecdh_kdf_md(ctx, md) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_EC, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_EC_KDF_MD, 0, (void *)(md))\n\n# define EVP_PKEY_CTX_get_ecdh_kdf_md(ctx, pmd) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_EC, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_GET_EC_KDF_MD, 0, (void *)(pmd))\n\n# define EVP_PKEY_CTX_set_ecdh_kdf_outlen(ctx, len) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_EC, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_EC_KDF_OUTLEN, len, NULL)\n\n# define EVP_PKEY_CTX_get_ecdh_kdf_outlen(ctx, plen) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_EC, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_GET_EC_KDF_OUTLEN, 0, \\\n (void *)(plen))\n\n# define EVP_PKEY_CTX_set0_ecdh_kdf_ukm(ctx, p, plen) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_EC, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_EC_KDF_UKM, plen, (void *)(p))\n\n# define EVP_PKEY_CTX_get0_ecdh_kdf_ukm(ctx, p) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_EC, \\\n EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_GET_EC_KDF_UKM, 0, (void *)(p))\n\n/* SM2 will skip the operation check so no need to pass operation here */\n# define EVP_PKEY_CTX_set1_id(ctx, id, id_len) \\\n EVP_PKEY_CTX_ctrl(ctx, -1, -1, \\\n EVP_PKEY_CTRL_SET1_ID, (int)id_len, (void*)(id))\n\n# define EVP_PKEY_CTX_get1_id(ctx, id) \\\n EVP_PKEY_CTX_ctrl(ctx, -1, -1, \\\n EVP_PKEY_CTRL_GET1_ID, 0, (void*)(id))\n\n# define EVP_PKEY_CTX_get1_id_len(ctx, id_len) \\\n EVP_PKEY_CTX_ctrl(ctx, -1, -1, \\\n EVP_PKEY_CTRL_GET1_ID_LEN, 0, (void*)(id_len))\n\n# define EVP_PKEY_CTRL_EC_PARAMGEN_CURVE_NID (EVP_PKEY_ALG_CTRL + 1)\n# define EVP_PKEY_CTRL_EC_PARAM_ENC (EVP_PKEY_ALG_CTRL + 2)\n# define EVP_PKEY_CTRL_EC_ECDH_COFACTOR (EVP_PKEY_ALG_CTRL + 3)\n# define EVP_PKEY_CTRL_EC_KDF_TYPE (EVP_PKEY_ALG_CTRL + 4)\n# define EVP_PKEY_CTRL_EC_KDF_MD (EVP_PKEY_ALG_CTRL + 5)\n# define EVP_PKEY_CTRL_GET_EC_KDF_MD (EVP_PKEY_ALG_CTRL + 6)\n# define EVP_PKEY_CTRL_EC_KDF_OUTLEN (EVP_PKEY_ALG_CTRL + 7)\n# define EVP_PKEY_CTRL_GET_EC_KDF_OUTLEN (EVP_PKEY_ALG_CTRL + 8)\n# define EVP_PKEY_CTRL_EC_KDF_UKM (EVP_PKEY_ALG_CTRL + 9)\n# define EVP_PKEY_CTRL_GET_EC_KDF_UKM (EVP_PKEY_ALG_CTRL + 10)\n# define EVP_PKEY_CTRL_SET1_ID (EVP_PKEY_ALG_CTRL + 11)\n# define EVP_PKEY_CTRL_GET1_ID (EVP_PKEY_ALG_CTRL + 12)\n# define EVP_PKEY_CTRL_GET1_ID_LEN (EVP_PKEY_ALG_CTRL + 13)\n/* KDF types */\n# define EVP_PKEY_ECDH_KDF_NONE 1\n# define EVP_PKEY_ECDH_KDF_X9_63 2\n/** The old name for EVP_PKEY_ECDH_KDF_X9_63\n * The ECDH KDF specification has been mistakingly attributed to ANSI X9.62,\n * it is actually specified in ANSI X9.63.\n * This identifier is retained for backwards compatibility\n */\n# define EVP_PKEY_ECDH_KDF_X9_62 EVP_PKEY_ECDH_KDF_X9_63\n\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/ecdh.h", "content": "/*\n * Copyright 2002-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n" }, { "path": "cryptomini/include/openssl/ecdsa.h", "content": "/*\n * Copyright 2002-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n" }, { "path": "cryptomini/include/openssl/ecerr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_ECERR_H\n# define HEADER_ECERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# include \n\n# ifndef OPENSSL_NO_EC\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_EC_strings(void);\n\n/*\n * EC function codes.\n */\n# define EC_F_BN_TO_FELEM 224\n# define EC_F_D2I_ECPARAMETERS 144\n# define EC_F_D2I_ECPKPARAMETERS 145\n# define EC_F_D2I_ECPRIVATEKEY 146\n# define EC_F_DO_EC_KEY_PRINT 221\n# define EC_F_ECDH_CMS_DECRYPT 238\n# define EC_F_ECDH_CMS_SET_SHARED_INFO 239\n# define EC_F_ECDH_COMPUTE_KEY 246\n# define EC_F_ECDH_SIMPLE_COMPUTE_KEY 257\n# define EC_F_ECDSA_DO_SIGN_EX 251\n# define EC_F_ECDSA_DO_VERIFY 252\n# define EC_F_ECDSA_SIGN_EX 254\n# define EC_F_ECDSA_SIGN_SETUP 248\n# define EC_F_ECDSA_SIG_NEW 265\n# define EC_F_ECDSA_VERIFY 253\n# define EC_F_ECD_ITEM_VERIFY 270\n# define EC_F_ECKEY_PARAM2TYPE 223\n# define EC_F_ECKEY_PARAM_DECODE 212\n# define EC_F_ECKEY_PRIV_DECODE 213\n# define EC_F_ECKEY_PRIV_ENCODE 214\n# define EC_F_ECKEY_PUB_DECODE 215\n# define EC_F_ECKEY_PUB_ENCODE 216\n# define EC_F_ECKEY_TYPE2PARAM 220\n# define EC_F_ECPARAMETERS_PRINT 147\n# define EC_F_ECPARAMETERS_PRINT_FP 148\n# define EC_F_ECPKPARAMETERS_PRINT 149\n# define EC_F_ECPKPARAMETERS_PRINT_FP 150\n# define EC_F_ECP_NISTZ256_GET_AFFINE 240\n# define EC_F_ECP_NISTZ256_INV_MOD_ORD 275\n# define EC_F_ECP_NISTZ256_MULT_PRECOMPUTE 243\n# define EC_F_ECP_NISTZ256_POINTS_MUL 241\n# define EC_F_ECP_NISTZ256_PRE_COMP_NEW 244\n# define EC_F_ECP_NISTZ256_WINDOWED_MUL 242\n# define EC_F_ECX_KEY_OP 266\n# define EC_F_ECX_PRIV_ENCODE 267\n# define EC_F_ECX_PUB_ENCODE 268\n# define EC_F_EC_ASN1_GROUP2CURVE 153\n# define EC_F_EC_ASN1_GROUP2FIELDID 154\n# define EC_F_EC_GF2M_MONTGOMERY_POINT_MULTIPLY 208\n# define EC_F_EC_GF2M_SIMPLE_FIELD_INV 296\n# define EC_F_EC_GF2M_SIMPLE_GROUP_CHECK_DISCRIMINANT 159\n# define EC_F_EC_GF2M_SIMPLE_GROUP_SET_CURVE 195\n# define EC_F_EC_GF2M_SIMPLE_LADDER_POST 285\n# define EC_F_EC_GF2M_SIMPLE_LADDER_PRE 288\n# define EC_F_EC_GF2M_SIMPLE_OCT2POINT 160\n# define EC_F_EC_GF2M_SIMPLE_POINT2OCT 161\n# define EC_F_EC_GF2M_SIMPLE_POINTS_MUL 289\n# define EC_F_EC_GF2M_SIMPLE_POINT_GET_AFFINE_COORDINATES 162\n# define EC_F_EC_GF2M_SIMPLE_POINT_SET_AFFINE_COORDINATES 163\n# define EC_F_EC_GF2M_SIMPLE_SET_COMPRESSED_COORDINATES 164\n# define EC_F_EC_GFP_MONT_FIELD_DECODE 133\n# define EC_F_EC_GFP_MONT_FIELD_ENCODE 134\n# define EC_F_EC_GFP_MONT_FIELD_INV 297\n# define EC_F_EC_GFP_MONT_FIELD_MUL 131\n# define EC_F_EC_GFP_MONT_FIELD_SET_TO_ONE 209\n# define EC_F_EC_GFP_MONT_FIELD_SQR 132\n# define EC_F_EC_GFP_MONT_GROUP_SET_CURVE 189\n# define EC_F_EC_GFP_NISTP224_GROUP_SET_CURVE 225\n# define EC_F_EC_GFP_NISTP224_POINTS_MUL 228\n# define EC_F_EC_GFP_NISTP224_POINT_GET_AFFINE_COORDINATES 226\n# define EC_F_EC_GFP_NISTP256_GROUP_SET_CURVE 230\n# define EC_F_EC_GFP_NISTP256_POINTS_MUL 231\n# define EC_F_EC_GFP_NISTP256_POINT_GET_AFFINE_COORDINATES 232\n# define EC_F_EC_GFP_NISTP521_GROUP_SET_CURVE 233\n# define EC_F_EC_GFP_NISTP521_POINTS_MUL 234\n# define EC_F_EC_GFP_NISTP521_POINT_GET_AFFINE_COORDINATES 235\n# define EC_F_EC_GFP_NIST_FIELD_MUL 200\n# define EC_F_EC_GFP_NIST_FIELD_SQR 201\n# define EC_F_EC_GFP_NIST_GROUP_SET_CURVE 202\n# define EC_F_EC_GFP_SIMPLE_BLIND_COORDINATES 287\n# define EC_F_EC_GFP_SIMPLE_FIELD_INV 298\n# define EC_F_EC_GFP_SIMPLE_GROUP_CHECK_DISCRIMINANT 165\n# define EC_F_EC_GFP_SIMPLE_GROUP_SET_CURVE 166\n# define EC_F_EC_GFP_SIMPLE_MAKE_AFFINE 102\n# define EC_F_EC_GFP_SIMPLE_OCT2POINT 103\n# define EC_F_EC_GFP_SIMPLE_POINT2OCT 104\n# define EC_F_EC_GFP_SIMPLE_POINTS_MAKE_AFFINE 137\n# define EC_F_EC_GFP_SIMPLE_POINT_GET_AFFINE_COORDINATES 167\n# define EC_F_EC_GFP_SIMPLE_POINT_SET_AFFINE_COORDINATES 168\n# define EC_F_EC_GFP_SIMPLE_SET_COMPRESSED_COORDINATES 169\n# define EC_F_EC_GROUP_CHECK 170\n# define EC_F_EC_GROUP_CHECK_DISCRIMINANT 171\n# define EC_F_EC_GROUP_COPY 106\n# define EC_F_EC_GROUP_GET_CURVE 291\n# define EC_F_EC_GROUP_GET_CURVE_GF2M 172\n# define EC_F_EC_GROUP_GET_CURVE_GFP 130\n# define EC_F_EC_GROUP_GET_DEGREE 173\n# define EC_F_EC_GROUP_GET_ECPARAMETERS 261\n# define EC_F_EC_GROUP_GET_ECPKPARAMETERS 262\n# define EC_F_EC_GROUP_GET_PENTANOMIAL_BASIS 193\n# define EC_F_EC_GROUP_GET_TRINOMIAL_BASIS 194\n# define EC_F_EC_GROUP_NEW 108\n# define EC_F_EC_GROUP_NEW_BY_CURVE_NAME 174\n# define EC_F_EC_GROUP_NEW_FROM_DATA 175\n# define EC_F_EC_GROUP_NEW_FROM_ECPARAMETERS 263\n# define EC_F_EC_GROUP_NEW_FROM_ECPKPARAMETERS 264\n# define EC_F_EC_GROUP_SET_CURVE 292\n# define EC_F_EC_GROUP_SET_CURVE_GF2M 176\n# define EC_F_EC_GROUP_SET_CURVE_GFP 109\n# define EC_F_EC_GROUP_SET_GENERATOR 111\n# define EC_F_EC_GROUP_SET_SEED 286\n# define EC_F_EC_KEY_CHECK_KEY 177\n# define EC_F_EC_KEY_COPY 178\n# define EC_F_EC_KEY_GENERATE_KEY 179\n# define EC_F_EC_KEY_NEW 182\n# define EC_F_EC_KEY_NEW_METHOD 245\n# define EC_F_EC_KEY_OCT2PRIV 255\n# define EC_F_EC_KEY_PRINT 180\n# define EC_F_EC_KEY_PRINT_FP 181\n# define EC_F_EC_KEY_PRIV2BUF 279\n# define EC_F_EC_KEY_PRIV2OCT 256\n# define EC_F_EC_KEY_SET_PUBLIC_KEY_AFFINE_COORDINATES 229\n# define EC_F_EC_KEY_SIMPLE_CHECK_KEY 258\n# define EC_F_EC_KEY_SIMPLE_OCT2PRIV 259\n# define EC_F_EC_KEY_SIMPLE_PRIV2OCT 260\n# define EC_F_EC_PKEY_CHECK 273\n# define EC_F_EC_PKEY_PARAM_CHECK 274\n# define EC_F_EC_POINTS_MAKE_AFFINE 136\n# define EC_F_EC_POINTS_MUL 290\n# define EC_F_EC_POINT_ADD 112\n# define EC_F_EC_POINT_BN2POINT 280\n# define EC_F_EC_POINT_CMP 113\n# define EC_F_EC_POINT_COPY 114\n# define EC_F_EC_POINT_DBL 115\n# define EC_F_EC_POINT_GET_AFFINE_COORDINATES 293\n# define EC_F_EC_POINT_GET_AFFINE_COORDINATES_GF2M 183\n# define EC_F_EC_POINT_GET_AFFINE_COORDINATES_GFP 116\n# define EC_F_EC_POINT_GET_JPROJECTIVE_COORDINATES_GFP 117\n# define EC_F_EC_POINT_INVERT 210\n# define EC_F_EC_POINT_IS_AT_INFINITY 118\n# define EC_F_EC_POINT_IS_ON_CURVE 119\n# define EC_F_EC_POINT_MAKE_AFFINE 120\n# define EC_F_EC_POINT_NEW 121\n# define EC_F_EC_POINT_OCT2POINT 122\n# define EC_F_EC_POINT_POINT2BUF 281\n# define EC_F_EC_POINT_POINT2OCT 123\n# define EC_F_EC_POINT_SET_AFFINE_COORDINATES 294\n# define EC_F_EC_POINT_SET_AFFINE_COORDINATES_GF2M 185\n# define EC_F_EC_POINT_SET_AFFINE_COORDINATES_GFP 124\n# define EC_F_EC_POINT_SET_COMPRESSED_COORDINATES 295\n# define EC_F_EC_POINT_SET_COMPRESSED_COORDINATES_GF2M 186\n# define EC_F_EC_POINT_SET_COMPRESSED_COORDINATES_GFP 125\n# define EC_F_EC_POINT_SET_JPROJECTIVE_COORDINATES_GFP 126\n# define EC_F_EC_POINT_SET_TO_INFINITY 127\n# define EC_F_EC_PRE_COMP_NEW 196\n# define EC_F_EC_SCALAR_MUL_LADDER 284\n# define EC_F_EC_WNAF_MUL 187\n# define EC_F_EC_WNAF_PRECOMPUTE_MULT 188\n# define EC_F_I2D_ECPARAMETERS 190\n# define EC_F_I2D_ECPKPARAMETERS 191\n# define EC_F_I2D_ECPRIVATEKEY 192\n# define EC_F_I2O_ECPUBLICKEY 151\n# define EC_F_NISTP224_PRE_COMP_NEW 227\n# define EC_F_NISTP256_PRE_COMP_NEW 236\n# define EC_F_NISTP521_PRE_COMP_NEW 237\n# define EC_F_O2I_ECPUBLICKEY 152\n# define EC_F_OLD_EC_PRIV_DECODE 222\n# define EC_F_OSSL_ECDH_COMPUTE_KEY 247\n# define EC_F_OSSL_ECDSA_SIGN_SIG 249\n# define EC_F_OSSL_ECDSA_VERIFY_SIG 250\n# define EC_F_PKEY_ECD_CTRL 271\n# define EC_F_PKEY_ECD_DIGESTSIGN 272\n# define EC_F_PKEY_ECD_DIGESTSIGN25519 276\n# define EC_F_PKEY_ECD_DIGESTSIGN448 277\n# define EC_F_PKEY_ECX_DERIVE 269\n# define EC_F_PKEY_EC_CTRL 197\n# define EC_F_PKEY_EC_CTRL_STR 198\n# define EC_F_PKEY_EC_DERIVE 217\n# define EC_F_PKEY_EC_INIT 282\n# define EC_F_PKEY_EC_KDF_DERIVE 283\n# define EC_F_PKEY_EC_KEYGEN 199\n# define EC_F_PKEY_EC_PARAMGEN 219\n# define EC_F_PKEY_EC_SIGN 218\n# define EC_F_VALIDATE_ECX_DERIVE 278\n\n/*\n * EC reason codes.\n */\n# define EC_R_ASN1_ERROR 115\n# define EC_R_BAD_SIGNATURE 156\n# define EC_R_BIGNUM_OUT_OF_RANGE 144\n# define EC_R_BUFFER_TOO_SMALL 100\n# define EC_R_CANNOT_INVERT 165\n# define EC_R_COORDINATES_OUT_OF_RANGE 146\n# define EC_R_CURVE_DOES_NOT_SUPPORT_ECDH 160\n# define EC_R_CURVE_DOES_NOT_SUPPORT_SIGNING 159\n# define EC_R_D2I_ECPKPARAMETERS_FAILURE 117\n# define EC_R_DECODE_ERROR 142\n# define EC_R_DISCRIMINANT_IS_ZERO 118\n# define EC_R_EC_GROUP_NEW_BY_NAME_FAILURE 119\n# define EC_R_FIELD_TOO_LARGE 143\n# define EC_R_GF2M_NOT_SUPPORTED 147\n# define EC_R_GROUP2PKPARAMETERS_FAILURE 120\n# define EC_R_I2D_ECPKPARAMETERS_FAILURE 121\n# define EC_R_INCOMPATIBLE_OBJECTS 101\n# define EC_R_INVALID_ARGUMENT 112\n# define EC_R_INVALID_COMPRESSED_POINT 110\n# define EC_R_INVALID_COMPRESSION_BIT 109\n# define EC_R_INVALID_CURVE 141\n# define EC_R_INVALID_DIGEST 151\n# define EC_R_INVALID_DIGEST_TYPE 138\n# define EC_R_INVALID_ENCODING 102\n# define EC_R_INVALID_FIELD 103\n# define EC_R_INVALID_FORM 104\n# define EC_R_INVALID_GROUP_ORDER 122\n# define EC_R_INVALID_KEY 116\n# define EC_R_INVALID_OUTPUT_LENGTH 161\n# define EC_R_INVALID_PEER_KEY 133\n# define EC_R_INVALID_PENTANOMIAL_BASIS 132\n# define EC_R_INVALID_PRIVATE_KEY 123\n# define EC_R_INVALID_TRINOMIAL_BASIS 137\n# define EC_R_KDF_PARAMETER_ERROR 148\n# define EC_R_KEYS_NOT_SET 140\n# define EC_R_LADDER_POST_FAILURE 136\n# define EC_R_LADDER_PRE_FAILURE 153\n# define EC_R_LADDER_STEP_FAILURE 162\n# define EC_R_MISSING_OID 167\n# define EC_R_MISSING_PARAMETERS 124\n# define EC_R_MISSING_PRIVATE_KEY 125\n# define EC_R_NEED_NEW_SETUP_VALUES 157\n# define EC_R_NOT_A_NIST_PRIME 135\n# define EC_R_NOT_IMPLEMENTED 126\n# define EC_R_NOT_INITIALIZED 111\n# define EC_R_NO_PARAMETERS_SET 139\n# define EC_R_NO_PRIVATE_VALUE 154\n# define EC_R_OPERATION_NOT_SUPPORTED 152\n# define EC_R_PASSED_NULL_PARAMETER 134\n# define EC_R_PEER_KEY_ERROR 149\n# define EC_R_PKPARAMETERS2GROUP_FAILURE 127\n# define EC_R_POINT_ARITHMETIC_FAILURE 155\n# define EC_R_POINT_AT_INFINITY 106\n# define EC_R_POINT_COORDINATES_BLIND_FAILURE 163\n# define EC_R_POINT_IS_NOT_ON_CURVE 107\n# define EC_R_RANDOM_NUMBER_GENERATION_FAILED 158\n# define EC_R_SHARED_INFO_ERROR 150\n# define EC_R_SLOT_FULL 108\n# define EC_R_UNDEFINED_GENERATOR 113\n# define EC_R_UNDEFINED_ORDER 128\n# define EC_R_UNKNOWN_COFACTOR 164\n# define EC_R_UNKNOWN_GROUP 129\n# define EC_R_UNKNOWN_ORDER 114\n# define EC_R_UNSUPPORTED_FIELD 131\n# define EC_R_WRONG_CURVE_PARAMETERS 145\n# define EC_R_WRONG_ORDER 130\n\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/engine.h", "content": "/*\n * Copyright 2000-2022 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_ENGINE_H\n# define HEADER_ENGINE_H\n\n# include \n\n# ifndef OPENSSL_NO_ENGINE\n# if OPENSSL_API_COMPAT < 0x10100000L\n# include \n# include \n# include \n# include \n# include \n# include \n# include \n# include \n# endif\n# include \n# include \n# include \n# include \n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n/*\n * These flags are used to control combinations of algorithm (methods) by\n * bitwise \"OR\"ing.\n */\n# define ENGINE_METHOD_RSA (unsigned int)0x0001\n# define ENGINE_METHOD_DSA (unsigned int)0x0002\n# define ENGINE_METHOD_DH (unsigned int)0x0004\n# define ENGINE_METHOD_RAND (unsigned int)0x0008\n# define ENGINE_METHOD_CIPHERS (unsigned int)0x0040\n# define ENGINE_METHOD_DIGESTS (unsigned int)0x0080\n# define ENGINE_METHOD_PKEY_METHS (unsigned int)0x0200\n# define ENGINE_METHOD_PKEY_ASN1_METHS (unsigned int)0x0400\n# define ENGINE_METHOD_EC (unsigned int)0x0800\n/* Obvious all-or-nothing cases. */\n# define ENGINE_METHOD_ALL (unsigned int)0xFFFF\n# define ENGINE_METHOD_NONE (unsigned int)0x0000\n\n/*\n * This(ese) flag(s) controls behaviour of the ENGINE_TABLE mechanism used\n * internally to control registration of ENGINE implementations, and can be\n * set by ENGINE_set_table_flags(). The \"NOINIT\" flag prevents attempts to\n * initialise registered ENGINEs if they are not already initialised.\n */\n# define ENGINE_TABLE_FLAG_NOINIT (unsigned int)0x0001\n\n/* ENGINE flags that can be set by ENGINE_set_flags(). */\n/* Not used */\n/* #define ENGINE_FLAGS_MALLOCED 0x0001 */\n\n/*\n * This flag is for ENGINEs that wish to handle the various 'CMD'-related\n * control commands on their own. Without this flag, ENGINE_ctrl() handles\n * these control commands on behalf of the ENGINE using their \"cmd_defns\"\n * data.\n */\n# define ENGINE_FLAGS_MANUAL_CMD_CTRL (int)0x0002\n\n/*\n * This flag is for ENGINEs who return new duplicate structures when found\n * via \"ENGINE_by_id()\". When an ENGINE must store state (eg. if\n * ENGINE_ctrl() commands are called in sequence as part of some stateful\n * process like key-generation setup and execution), it can set this flag -\n * then each attempt to obtain the ENGINE will result in it being copied into\n * a new structure. Normally, ENGINEs don't declare this flag so\n * ENGINE_by_id() just increments the existing ENGINE's structural reference\n * count.\n */\n# define ENGINE_FLAGS_BY_ID_COPY (int)0x0004\n\n/*\n * This flag if for an ENGINE that does not want its methods registered as\n * part of ENGINE_register_all_complete() for example if the methods are not\n * usable as default methods.\n */\n\n# define ENGINE_FLAGS_NO_REGISTER_ALL (int)0x0008\n\n/*\n * ENGINEs can support their own command types, and these flags are used in\n * ENGINE_CTRL_GET_CMD_FLAGS to indicate to the caller what kind of input\n * each command expects. Currently only numeric and string input is\n * supported. If a control command supports none of the _NUMERIC, _STRING, or\n * _NO_INPUT options, then it is regarded as an \"internal\" control command -\n * and not for use in config setting situations. As such, they're not\n * available to the ENGINE_ctrl_cmd_string() function, only raw ENGINE_ctrl()\n * access. Changes to this list of 'command types' should be reflected\n * carefully in ENGINE_cmd_is_executable() and ENGINE_ctrl_cmd_string().\n */\n\n/* accepts a 'long' input value (3rd parameter to ENGINE_ctrl) */\n# define ENGINE_CMD_FLAG_NUMERIC (unsigned int)0x0001\n/*\n * accepts string input (cast from 'void*' to 'const char *', 4th parameter\n * to ENGINE_ctrl)\n */\n# define ENGINE_CMD_FLAG_STRING (unsigned int)0x0002\n/*\n * Indicates that the control command takes *no* input. Ie. the control\n * command is unparameterised.\n */\n# define ENGINE_CMD_FLAG_NO_INPUT (unsigned int)0x0004\n/*\n * Indicates that the control command is internal. This control command won't\n * be shown in any output, and is only usable through the ENGINE_ctrl_cmd()\n * function.\n */\n# define ENGINE_CMD_FLAG_INTERNAL (unsigned int)0x0008\n\n/*\n * NB: These 3 control commands are deprecated and should not be used.\n * ENGINEs relying on these commands should compile conditional support for\n * compatibility (eg. if these symbols are defined) but should also migrate\n * the same functionality to their own ENGINE-specific control functions that\n * can be \"discovered\" by calling applications. The fact these control\n * commands wouldn't be \"executable\" (ie. usable by text-based config)\n * doesn't change the fact that application code can find and use them\n * without requiring per-ENGINE hacking.\n */\n\n/*\n * These flags are used to tell the ctrl function what should be done. All\n * command numbers are shared between all engines, even if some don't make\n * sense to some engines. In such a case, they do nothing but return the\n * error ENGINE_R_CTRL_COMMAND_NOT_IMPLEMENTED.\n */\n# define ENGINE_CTRL_SET_LOGSTREAM 1\n# define ENGINE_CTRL_SET_PASSWORD_CALLBACK 2\n# define ENGINE_CTRL_HUP 3/* Close and reinitialise\n * any handles/connections\n * etc. */\n# define ENGINE_CTRL_SET_USER_INTERFACE 4/* Alternative to callback */\n# define ENGINE_CTRL_SET_CALLBACK_DATA 5/* User-specific data, used\n * when calling the password\n * callback and the user\n * interface */\n# define ENGINE_CTRL_LOAD_CONFIGURATION 6/* Load a configuration,\n * given a string that\n * represents a file name\n * or so */\n# define ENGINE_CTRL_LOAD_SECTION 7/* Load data from a given\n * section in the already\n * loaded configuration */\n\n/*\n * These control commands allow an application to deal with an arbitrary\n * engine in a dynamic way. Warn: Negative return values indicate errors FOR\n * THESE COMMANDS because zero is used to indicate 'end-of-list'. Other\n * commands, including ENGINE-specific command types, return zero for an\n * error. An ENGINE can choose to implement these ctrl functions, and can\n * internally manage things however it chooses - it does so by setting the\n * ENGINE_FLAGS_MANUAL_CMD_CTRL flag (using ENGINE_set_flags()). Otherwise\n * the ENGINE_ctrl() code handles this on the ENGINE's behalf using the\n * cmd_defns data (set using ENGINE_set_cmd_defns()). This means an ENGINE's\n * ctrl() handler need only implement its own commands - the above \"meta\"\n * commands will be taken care of.\n */\n\n/*\n * Returns non-zero if the supplied ENGINE has a ctrl() handler. If \"not\",\n * then all the remaining control commands will return failure, so it is\n * worth checking this first if the caller is trying to \"discover\" the\n * engine's capabilities and doesn't want errors generated unnecessarily.\n */\n# define ENGINE_CTRL_HAS_CTRL_FUNCTION 10\n/*\n * Returns a positive command number for the first command supported by the\n * engine. Returns zero if no ctrl commands are supported.\n */\n# define ENGINE_CTRL_GET_FIRST_CMD_TYPE 11\n/*\n * The 'long' argument specifies a command implemented by the engine, and the\n * return value is the next command supported, or zero if there are no more.\n */\n# define ENGINE_CTRL_GET_NEXT_CMD_TYPE 12\n/*\n * The 'void*' argument is a command name (cast from 'const char *'), and the\n * return value is the command that corresponds to it.\n */\n# define ENGINE_CTRL_GET_CMD_FROM_NAME 13\n/*\n * The next two allow a command to be converted into its corresponding string\n * form. In each case, the 'long' argument supplies the command. In the\n * NAME_LEN case, the return value is the length of the command name (not\n * counting a trailing EOL). In the NAME case, the 'void*' argument must be a\n * string buffer large enough, and it will be populated with the name of the\n * command (WITH a trailing EOL).\n */\n# define ENGINE_CTRL_GET_NAME_LEN_FROM_CMD 14\n# define ENGINE_CTRL_GET_NAME_FROM_CMD 15\n/* The next two are similar but give a \"short description\" of a command. */\n# define ENGINE_CTRL_GET_DESC_LEN_FROM_CMD 16\n# define ENGINE_CTRL_GET_DESC_FROM_CMD 17\n/*\n * With this command, the return value is the OR'd combination of\n * ENGINE_CMD_FLAG_*** values that indicate what kind of input a given\n * engine-specific ctrl command expects.\n */\n# define ENGINE_CTRL_GET_CMD_FLAGS 18\n\n/*\n * ENGINE implementations should start the numbering of their own control\n * commands from this value. (ie. ENGINE_CMD_BASE, ENGINE_CMD_BASE + 1, etc).\n */\n# define ENGINE_CMD_BASE 200\n\n/*\n * NB: These 2 nCipher \"chil\" control commands are deprecated, and their\n * functionality is now available through ENGINE-specific control commands\n * (exposed through the above-mentioned 'CMD'-handling). Code using these 2\n * commands should be migrated to the more general command handling before\n * these are removed.\n */\n\n/* Flags specific to the nCipher \"chil\" engine */\n# define ENGINE_CTRL_CHIL_SET_FORKCHECK 100\n /*\n * Depending on the value of the (long)i argument, this sets or\n * unsets the SimpleForkCheck flag in the CHIL API to enable or\n * disable checking and workarounds for applications that fork().\n */\n# define ENGINE_CTRL_CHIL_NO_LOCKING 101\n /*\n * This prevents the initialisation function from providing mutex\n * callbacks to the nCipher library.\n */\n\n/*\n * If an ENGINE supports its own specific control commands and wishes the\n * framework to handle the above 'ENGINE_CMD_***'-manipulation commands on\n * its behalf, it should supply a null-terminated array of ENGINE_CMD_DEFN\n * entries to ENGINE_set_cmd_defns(). It should also implement a ctrl()\n * handler that supports the stated commands (ie. the \"cmd_num\" entries as\n * described by the array). NB: The array must be ordered in increasing order\n * of cmd_num. \"null-terminated\" means that the last ENGINE_CMD_DEFN element\n * has cmd_num set to zero and/or cmd_name set to NULL.\n */\ntypedef struct ENGINE_CMD_DEFN_st {\n unsigned int cmd_num; /* The command number */\n const char *cmd_name; /* The command name itself */\n const char *cmd_desc; /* A short description of the command */\n unsigned int cmd_flags; /* The input the command expects */\n} ENGINE_CMD_DEFN;\n\n/* Generic function pointer */\ntypedef int (*ENGINE_GEN_FUNC_PTR) (void);\n/* Generic function pointer taking no arguments */\ntypedef int (*ENGINE_GEN_INT_FUNC_PTR) (ENGINE *);\n/* Specific control function pointer */\ntypedef int (*ENGINE_CTRL_FUNC_PTR) (ENGINE *, int, long, void *,\n void (*f) (void));\n/* Generic load_key function pointer */\ntypedef EVP_PKEY *(*ENGINE_LOAD_KEY_PTR)(ENGINE *, const char *,\n UI_METHOD *ui_method,\n void *callback_data);\ntypedef int (*ENGINE_SSL_CLIENT_CERT_PTR) (ENGINE *, SSL *ssl,\n STACK_OF(X509_NAME) *ca_dn,\n X509 **pcert, EVP_PKEY **pkey,\n STACK_OF(X509) **pother,\n UI_METHOD *ui_method,\n void *callback_data);\n/*-\n * These callback types are for an ENGINE's handler for cipher and digest logic.\n * These handlers have these prototypes;\n * int foo(ENGINE *e, const EVP_CIPHER **cipher, const int **nids, int nid);\n * int foo(ENGINE *e, const EVP_MD **digest, const int **nids, int nid);\n * Looking at how to implement these handlers in the case of cipher support, if\n * the framework wants the EVP_CIPHER for 'nid', it will call;\n * foo(e, &p_evp_cipher, NULL, nid); (return zero for failure)\n * If the framework wants a list of supported 'nid's, it will call;\n * foo(e, NULL, &p_nids, 0); (returns number of 'nids' or -1 for error)\n */\n/*\n * Returns to a pointer to the array of supported cipher 'nid's. If the\n * second parameter is non-NULL it is set to the size of the returned array.\n */\ntypedef int (*ENGINE_CIPHERS_PTR) (ENGINE *, const EVP_CIPHER **,\n const int **, int);\ntypedef int (*ENGINE_DIGESTS_PTR) (ENGINE *, const EVP_MD **, const int **,\n int);\ntypedef int (*ENGINE_PKEY_METHS_PTR) (ENGINE *, EVP_PKEY_METHOD **,\n const int **, int);\ntypedef int (*ENGINE_PKEY_ASN1_METHS_PTR) (ENGINE *, EVP_PKEY_ASN1_METHOD **,\n const int **, int);\n/*\n * STRUCTURE functions ... all of these functions deal with pointers to\n * ENGINE structures where the pointers have a \"structural reference\". This\n * means that their reference is to allowed access to the structure but it\n * does not imply that the structure is functional. To simply increment or\n * decrement the structural reference count, use ENGINE_by_id and\n * ENGINE_free. NB: This is not required when iterating using ENGINE_get_next\n * as it will automatically decrement the structural reference count of the\n * \"current\" ENGINE and increment the structural reference count of the\n * ENGINE it returns (unless it is NULL).\n */\n\n/* Get the first/last \"ENGINE\" type available. */\nENGINE *ENGINE_get_first(void);\nENGINE *ENGINE_get_last(void);\n/* Iterate to the next/previous \"ENGINE\" type (NULL = end of the list). */\nENGINE *ENGINE_get_next(ENGINE *e);\nENGINE *ENGINE_get_prev(ENGINE *e);\n/* Add another \"ENGINE\" type into the array. */\nint ENGINE_add(ENGINE *e);\n/* Remove an existing \"ENGINE\" type from the array. */\nint ENGINE_remove(ENGINE *e);\n/* Retrieve an engine from the list by its unique \"id\" value. */\nENGINE *ENGINE_by_id(const char *id);\n\n#if OPENSSL_API_COMPAT < 0x10100000L\n# define ENGINE_load_openssl() \\\n OPENSSL_init_crypto(OPENSSL_INIT_ENGINE_OPENSSL, NULL)\n# define ENGINE_load_dynamic() \\\n OPENSSL_init_crypto(OPENSSL_INIT_ENGINE_DYNAMIC, NULL)\n# ifndef OPENSSL_NO_STATIC_ENGINE\n# define ENGINE_load_padlock() \\\n OPENSSL_init_crypto(OPENSSL_INIT_ENGINE_PADLOCK, NULL)\n# define ENGINE_load_capi() \\\n OPENSSL_init_crypto(OPENSSL_INIT_ENGINE_CAPI, NULL)\n# define ENGINE_load_afalg() \\\n OPENSSL_init_crypto(OPENSSL_INIT_ENGINE_AFALG, NULL)\n# endif\n# define ENGINE_load_cryptodev() \\\n OPENSSL_init_crypto(OPENSSL_INIT_ENGINE_CRYPTODEV, NULL)\n# define ENGINE_load_rdrand() \\\n OPENSSL_init_crypto(OPENSSL_INIT_ENGINE_RDRAND, NULL)\n#endif\nvoid ENGINE_load_builtin_engines(void);\n\n/*\n * Get and set global flags (ENGINE_TABLE_FLAG_***) for the implementation\n * \"registry\" handling.\n */\nunsigned int ENGINE_get_table_flags(void);\nvoid ENGINE_set_table_flags(unsigned int flags);\n\n/*- Manage registration of ENGINEs per \"table\". For each type, there are 3\n * functions;\n * ENGINE_register_***(e) - registers the implementation from 'e' (if it has one)\n * ENGINE_unregister_***(e) - unregister the implementation from 'e'\n * ENGINE_register_all_***() - call ENGINE_register_***() for each 'e' in the list\n * Cleanup is automatically registered from each table when required.\n */\n\nint ENGINE_register_RSA(ENGINE *e);\nvoid ENGINE_unregister_RSA(ENGINE *e);\nvoid ENGINE_register_all_RSA(void);\n\nint ENGINE_register_DSA(ENGINE *e);\nvoid ENGINE_unregister_DSA(ENGINE *e);\nvoid ENGINE_register_all_DSA(void);\n\nint ENGINE_register_EC(ENGINE *e);\nvoid ENGINE_unregister_EC(ENGINE *e);\nvoid ENGINE_register_all_EC(void);\n\nint ENGINE_register_DH(ENGINE *e);\nvoid ENGINE_unregister_DH(ENGINE *e);\nvoid ENGINE_register_all_DH(void);\n\nint ENGINE_register_RAND(ENGINE *e);\nvoid ENGINE_unregister_RAND(ENGINE *e);\nvoid ENGINE_register_all_RAND(void);\n\nint ENGINE_register_ciphers(ENGINE *e);\nvoid ENGINE_unregister_ciphers(ENGINE *e);\nvoid ENGINE_register_all_ciphers(void);\n\nint ENGINE_register_digests(ENGINE *e);\nvoid ENGINE_unregister_digests(ENGINE *e);\nvoid ENGINE_register_all_digests(void);\n\nint ENGINE_register_pkey_meths(ENGINE *e);\nvoid ENGINE_unregister_pkey_meths(ENGINE *e);\nvoid ENGINE_register_all_pkey_meths(void);\n\nint ENGINE_register_pkey_asn1_meths(ENGINE *e);\nvoid ENGINE_unregister_pkey_asn1_meths(ENGINE *e);\nvoid ENGINE_register_all_pkey_asn1_meths(void);\n\n/*\n * These functions register all support from the above categories. Note, use\n * of these functions can result in static linkage of code your application\n * may not need. If you only need a subset of functionality, consider using\n * more selective initialisation.\n */\nint ENGINE_register_complete(ENGINE *e);\nint ENGINE_register_all_complete(void);\n\n/*\n * Send parameterised control commands to the engine. The possibilities to\n * send down an integer, a pointer to data or a function pointer are\n * provided. Any of the parameters may or may not be NULL, depending on the\n * command number. In actuality, this function only requires a structural\n * (rather than functional) reference to an engine, but many control commands\n * may require the engine be functional. The caller should be aware of trying\n * commands that require an operational ENGINE, and only use functional\n * references in such situations.\n */\nint ENGINE_ctrl(ENGINE *e, int cmd, long i, void *p, void (*f) (void));\n\n/*\n * This function tests if an ENGINE-specific command is usable as a\n * \"setting\". Eg. in an application's config file that gets processed through\n * ENGINE_ctrl_cmd_string(). If this returns zero, it is not available to\n * ENGINE_ctrl_cmd_string(), only ENGINE_ctrl().\n */\nint ENGINE_cmd_is_executable(ENGINE *e, int cmd);\n\n/*\n * This function works like ENGINE_ctrl() with the exception of taking a\n * command name instead of a command number, and can handle optional\n * commands. See the comment on ENGINE_ctrl_cmd_string() for an explanation\n * on how to use the cmd_name and cmd_optional.\n */\nint ENGINE_ctrl_cmd(ENGINE *e, const char *cmd_name,\n long i, void *p, void (*f) (void), int cmd_optional);\n\n/*\n * This function passes a command-name and argument to an ENGINE. The\n * cmd_name is converted to a command number and the control command is\n * called using 'arg' as an argument (unless the ENGINE doesn't support such\n * a command, in which case no control command is called). The command is\n * checked for input flags, and if necessary the argument will be converted\n * to a numeric value. If cmd_optional is non-zero, then if the ENGINE\n * doesn't support the given cmd_name the return value will be success\n * anyway. This function is intended for applications to use so that users\n * (or config files) can supply engine-specific config data to the ENGINE at\n * run-time to control behaviour of specific engines. As such, it shouldn't\n * be used for calling ENGINE_ctrl() functions that return data, deal with\n * binary data, or that are otherwise supposed to be used directly through\n * ENGINE_ctrl() in application code. Any \"return\" data from an ENGINE_ctrl()\n * operation in this function will be lost - the return value is interpreted\n * as failure if the return value is zero, success otherwise, and this\n * function returns a boolean value as a result. In other words, vendors of\n * 'ENGINE'-enabled devices should write ENGINE implementations with\n * parameterisations that work in this scheme, so that compliant ENGINE-based\n * applications can work consistently with the same configuration for the\n * same ENGINE-enabled devices, across applications.\n */\nint ENGINE_ctrl_cmd_string(ENGINE *e, const char *cmd_name, const char *arg,\n int cmd_optional);\n\n/*\n * These functions are useful for manufacturing new ENGINE structures. They\n * don't address reference counting at all - one uses them to populate an\n * ENGINE structure with personalised implementations of things prior to\n * using it directly or adding it to the builtin ENGINE list in OpenSSL.\n * These are also here so that the ENGINE structure doesn't have to be\n * exposed and break binary compatibility!\n */\nENGINE *ENGINE_new(void);\nint ENGINE_free(ENGINE *e);\nint ENGINE_up_ref(ENGINE *e);\nint ENGINE_set_id(ENGINE *e, const char *id);\nint ENGINE_set_name(ENGINE *e, const char *name);\nint ENGINE_set_RSA(ENGINE *e, const RSA_METHOD *rsa_meth);\nint ENGINE_set_DSA(ENGINE *e, const DSA_METHOD *dsa_meth);\nint ENGINE_set_EC(ENGINE *e, const EC_KEY_METHOD *ecdsa_meth);\nint ENGINE_set_DH(ENGINE *e, const DH_METHOD *dh_meth);\nint ENGINE_set_RAND(ENGINE *e, const RAND_METHOD *rand_meth);\nint ENGINE_set_destroy_function(ENGINE *e, ENGINE_GEN_INT_FUNC_PTR destroy_f);\nint ENGINE_set_init_function(ENGINE *e, ENGINE_GEN_INT_FUNC_PTR init_f);\nint ENGINE_set_finish_function(ENGINE *e, ENGINE_GEN_INT_FUNC_PTR finish_f);\nint ENGINE_set_ctrl_function(ENGINE *e, ENGINE_CTRL_FUNC_PTR ctrl_f);\nint ENGINE_set_load_privkey_function(ENGINE *e,\n ENGINE_LOAD_KEY_PTR loadpriv_f);\nint ENGINE_set_load_pubkey_function(ENGINE *e, ENGINE_LOAD_KEY_PTR loadpub_f);\nint ENGINE_set_load_ssl_client_cert_function(ENGINE *e,\n ENGINE_SSL_CLIENT_CERT_PTR\n loadssl_f);\nint ENGINE_set_ciphers(ENGINE *e, ENGINE_CIPHERS_PTR f);\nint ENGINE_set_digests(ENGINE *e, ENGINE_DIGESTS_PTR f);\nint ENGINE_set_pkey_meths(ENGINE *e, ENGINE_PKEY_METHS_PTR f);\nint ENGINE_set_pkey_asn1_meths(ENGINE *e, ENGINE_PKEY_ASN1_METHS_PTR f);\nint ENGINE_set_flags(ENGINE *e, int flags);\nint ENGINE_set_cmd_defns(ENGINE *e, const ENGINE_CMD_DEFN *defns);\n/* These functions allow control over any per-structure ENGINE data. */\n#define ENGINE_get_ex_new_index(l, p, newf, dupf, freef) \\\n CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_ENGINE, l, p, newf, dupf, freef)\nint ENGINE_set_ex_data(ENGINE *e, int idx, void *arg);\nvoid *ENGINE_get_ex_data(const ENGINE *e, int idx);\n\n#if OPENSSL_API_COMPAT < 0x10100000L\n/*\n * This function previously cleaned up anything that needs it. Auto-deinit will\n * now take care of it so it is no longer required to call this function.\n */\n# define ENGINE_cleanup() while(0) continue\n#endif\n\n/*\n * These return values from within the ENGINE structure. These can be useful\n * with functional references as well as structural references - it depends\n * which you obtained. Using the result for functional purposes if you only\n * obtained a structural reference may be problematic!\n */\nconst char *ENGINE_get_id(const ENGINE *e);\nconst char *ENGINE_get_name(const ENGINE *e);\nconst RSA_METHOD *ENGINE_get_RSA(const ENGINE *e);\nconst DSA_METHOD *ENGINE_get_DSA(const ENGINE *e);\nconst EC_KEY_METHOD *ENGINE_get_EC(const ENGINE *e);\nconst DH_METHOD *ENGINE_get_DH(const ENGINE *e);\nconst RAND_METHOD *ENGINE_get_RAND(const ENGINE *e);\nENGINE_GEN_INT_FUNC_PTR ENGINE_get_destroy_function(const ENGINE *e);\nENGINE_GEN_INT_FUNC_PTR ENGINE_get_init_function(const ENGINE *e);\nENGINE_GEN_INT_FUNC_PTR ENGINE_get_finish_function(const ENGINE *e);\nENGINE_CTRL_FUNC_PTR ENGINE_get_ctrl_function(const ENGINE *e);\nENGINE_LOAD_KEY_PTR ENGINE_get_load_privkey_function(const ENGINE *e);\nENGINE_LOAD_KEY_PTR ENGINE_get_load_pubkey_function(const ENGINE *e);\nENGINE_SSL_CLIENT_CERT_PTR ENGINE_get_ssl_client_cert_function(const ENGINE\n *e);\nENGINE_CIPHERS_PTR ENGINE_get_ciphers(const ENGINE *e);\nENGINE_DIGESTS_PTR ENGINE_get_digests(const ENGINE *e);\nENGINE_PKEY_METHS_PTR ENGINE_get_pkey_meths(const ENGINE *e);\nENGINE_PKEY_ASN1_METHS_PTR ENGINE_get_pkey_asn1_meths(const ENGINE *e);\nconst EVP_CIPHER *ENGINE_get_cipher(ENGINE *e, int nid);\nconst EVP_MD *ENGINE_get_digest(ENGINE *e, int nid);\nconst EVP_PKEY_METHOD *ENGINE_get_pkey_meth(ENGINE *e, int nid);\nconst EVP_PKEY_ASN1_METHOD *ENGINE_get_pkey_asn1_meth(ENGINE *e, int nid);\nconst EVP_PKEY_ASN1_METHOD *ENGINE_get_pkey_asn1_meth_str(ENGINE *e,\n const char *str,\n int len);\nconst EVP_PKEY_ASN1_METHOD *ENGINE_pkey_asn1_find_str(ENGINE **pe,\n const char *str,\n int len);\nconst ENGINE_CMD_DEFN *ENGINE_get_cmd_defns(const ENGINE *e);\nint ENGINE_get_flags(const ENGINE *e);\n\n/*\n * FUNCTIONAL functions. These functions deal with ENGINE structures that\n * have (or will) be initialised for use. Broadly speaking, the structural\n * functions are useful for iterating the list of available engine types,\n * creating new engine types, and other \"list\" operations. These functions\n * actually deal with ENGINEs that are to be used. As such these functions\n * can fail (if applicable) when particular engines are unavailable - eg. if\n * a hardware accelerator is not attached or not functioning correctly. Each\n * ENGINE has 2 reference counts; structural and functional. Every time a\n * functional reference is obtained or released, a corresponding structural\n * reference is automatically obtained or released too.\n */\n\n/*\n * Initialise a engine type for use (or up its reference count if it's\n * already in use). This will fail if the engine is not currently operational\n * and cannot initialise.\n */\nint ENGINE_init(ENGINE *e);\n/*\n * Free a functional reference to a engine type. This does not require a\n * corresponding call to ENGINE_free as it also releases a structural\n * reference.\n */\nint ENGINE_finish(ENGINE *e);\n\n/*\n * The following functions handle keys that are stored in some secondary\n * location, handled by the engine. The storage may be on a card or\n * whatever.\n */\nEVP_PKEY *ENGINE_load_private_key(ENGINE *e, const char *key_id,\n UI_METHOD *ui_method, void *callback_data);\nEVP_PKEY *ENGINE_load_public_key(ENGINE *e, const char *key_id,\n UI_METHOD *ui_method, void *callback_data);\nint ENGINE_load_ssl_client_cert(ENGINE *e, SSL *s,\n STACK_OF(X509_NAME) *ca_dn, X509 **pcert,\n EVP_PKEY **ppkey, STACK_OF(X509) **pother,\n UI_METHOD *ui_method, void *callback_data);\n\n/*\n * This returns a pointer for the current ENGINE structure that is (by\n * default) performing any RSA operations. The value returned is an\n * incremented reference, so it should be free'd (ENGINE_finish) before it is\n * discarded.\n */\nENGINE *ENGINE_get_default_RSA(void);\n/* Same for the other \"methods\" */\nENGINE *ENGINE_get_default_DSA(void);\nENGINE *ENGINE_get_default_EC(void);\nENGINE *ENGINE_get_default_DH(void);\nENGINE *ENGINE_get_default_RAND(void);\n/*\n * These functions can be used to get a functional reference to perform\n * ciphering or digesting corresponding to \"nid\".\n */\nENGINE *ENGINE_get_cipher_engine(int nid);\nENGINE *ENGINE_get_digest_engine(int nid);\nENGINE *ENGINE_get_pkey_meth_engine(int nid);\nENGINE *ENGINE_get_pkey_asn1_meth_engine(int nid);\n\n/*\n * This sets a new default ENGINE structure for performing RSA operations. If\n * the result is non-zero (success) then the ENGINE structure will have had\n * its reference count up'd so the caller should still free their own\n * reference 'e'.\n */\nint ENGINE_set_default_RSA(ENGINE *e);\nint ENGINE_set_default_string(ENGINE *e, const char *def_list);\n/* Same for the other \"methods\" */\nint ENGINE_set_default_DSA(ENGINE *e);\nint ENGINE_set_default_EC(ENGINE *e);\nint ENGINE_set_default_DH(ENGINE *e);\nint ENGINE_set_default_RAND(ENGINE *e);\nint ENGINE_set_default_ciphers(ENGINE *e);\nint ENGINE_set_default_digests(ENGINE *e);\nint ENGINE_set_default_pkey_meths(ENGINE *e);\nint ENGINE_set_default_pkey_asn1_meths(ENGINE *e);\n\n/*\n * The combination \"set\" - the flags are bitwise \"OR\"d from the\n * ENGINE_METHOD_*** defines above. As with the \"ENGINE_register_complete()\"\n * function, this function can result in unnecessary static linkage. If your\n * application requires only specific functionality, consider using more\n * selective functions.\n */\nint ENGINE_set_default(ENGINE *e, unsigned int flags);\n\nvoid ENGINE_add_conf_module(void);\n\n/* Deprecated functions ... */\n/* int ENGINE_clear_defaults(void); */\n\n/**************************/\n/* DYNAMIC ENGINE SUPPORT */\n/**************************/\n\n/* Binary/behaviour compatibility levels */\n# define OSSL_DYNAMIC_VERSION (unsigned long)0x00030000\n/*\n * Binary versions older than this are too old for us (whether we're a loader\n * or a loadee)\n */\n# define OSSL_DYNAMIC_OLDEST (unsigned long)0x00030000\n\n/*\n * When compiling an ENGINE entirely as an external shared library, loadable\n * by the \"dynamic\" ENGINE, these types are needed. The 'dynamic_fns'\n * structure type provides the calling application's (or library's) error\n * functionality and memory management function pointers to the loaded\n * library. These should be used/set in the loaded library code so that the\n * loading application's 'state' will be used/changed in all operations. The\n * 'static_state' pointer allows the loaded library to know if it shares the\n * same static data as the calling application (or library), and thus whether\n * these callbacks need to be set or not.\n */\ntypedef void *(*dyn_MEM_malloc_fn) (size_t, const char *, int);\ntypedef void *(*dyn_MEM_realloc_fn) (void *, size_t, const char *, int);\ntypedef void (*dyn_MEM_free_fn) (void *, const char *, int);\ntypedef struct st_dynamic_MEM_fns {\n dyn_MEM_malloc_fn malloc_fn;\n dyn_MEM_realloc_fn realloc_fn;\n dyn_MEM_free_fn free_fn;\n} dynamic_MEM_fns;\n/*\n * FIXME: Perhaps the memory and locking code (crypto.h) should declare and\n * use these types so we (and any other dependent code) can simplify a bit??\n */\n/* The top-level structure */\ntypedef struct st_dynamic_fns {\n void *static_state;\n dynamic_MEM_fns mem_fns;\n} dynamic_fns;\n\n/*\n * The version checking function should be of this prototype. NB: The\n * ossl_version value passed in is the OSSL_DYNAMIC_VERSION of the loading\n * code. If this function returns zero, it indicates a (potential) version\n * incompatibility and the loaded library doesn't believe it can proceed.\n * Otherwise, the returned value is the (latest) version supported by the\n * loading library. The loader may still decide that the loaded code's\n * version is unsatisfactory and could veto the load. The function is\n * expected to be implemented with the symbol name \"v_check\", and a default\n * implementation can be fully instantiated with\n * IMPLEMENT_DYNAMIC_CHECK_FN().\n */\ntypedef unsigned long (*dynamic_v_check_fn) (unsigned long ossl_version);\n# define IMPLEMENT_DYNAMIC_CHECK_FN() \\\n OPENSSL_EXPORT unsigned long v_check(unsigned long v); \\\n OPENSSL_EXPORT unsigned long v_check(unsigned long v) { \\\n if (v >= OSSL_DYNAMIC_OLDEST) return OSSL_DYNAMIC_VERSION; \\\n return 0; }\n\n/*\n * This function is passed the ENGINE structure to initialise with its own\n * function and command settings. It should not adjust the structural or\n * functional reference counts. If this function returns zero, (a) the load\n * will be aborted, (b) the previous ENGINE state will be memcpy'd back onto\n * the structure, and (c) the shared library will be unloaded. So\n * implementations should do their own internal cleanup in failure\n * circumstances otherwise they could leak. The 'id' parameter, if non-NULL,\n * represents the ENGINE id that the loader is looking for. If this is NULL,\n * the shared library can choose to return failure or to initialise a\n * 'default' ENGINE. If non-NULL, the shared library must initialise only an\n * ENGINE matching the passed 'id'. The function is expected to be\n * implemented with the symbol name \"bind_engine\". A standard implementation\n * can be instantiated with IMPLEMENT_DYNAMIC_BIND_FN(fn) where the parameter\n * 'fn' is a callback function that populates the ENGINE structure and\n * returns an int value (zero for failure). 'fn' should have prototype;\n * [static] int fn(ENGINE *e, const char *id);\n */\ntypedef int (*dynamic_bind_engine) (ENGINE *e, const char *id,\n const dynamic_fns *fns);\n# define IMPLEMENT_DYNAMIC_BIND_FN(fn) \\\n OPENSSL_EXPORT \\\n int bind_engine(ENGINE *e, const char *id, const dynamic_fns *fns); \\\n OPENSSL_EXPORT \\\n int bind_engine(ENGINE *e, const char *id, const dynamic_fns *fns) { \\\n if (ENGINE_get_static_state() == fns->static_state) goto skip_cbs; \\\n CRYPTO_set_mem_functions(fns->mem_fns.malloc_fn, \\\n fns->mem_fns.realloc_fn, \\\n fns->mem_fns.free_fn); \\\n OPENSSL_init_crypto(OPENSSL_INIT_NO_ATEXIT, NULL); \\\n skip_cbs: \\\n if (!fn(e, id)) return 0; \\\n return 1; }\n\n/*\n * If the loading application (or library) and the loaded ENGINE library\n * share the same static data (eg. they're both dynamically linked to the\n * same libcrypto.so) we need a way to avoid trying to set system callbacks -\n * this would fail, and for the same reason that it's unnecessary to try. If\n * the loaded ENGINE has (or gets from through the loader) its own copy of\n * the libcrypto static data, we will need to set the callbacks. The easiest\n * way to detect this is to have a function that returns a pointer to some\n * static data and let the loading application and loaded ENGINE compare\n * their respective values.\n */\nvoid *ENGINE_get_static_state(void);\n\n# if defined(__OpenBSD__) || defined(__FreeBSD__) || defined(__DragonFly__)\nDEPRECATEDIN_1_1_0(void ENGINE_setup_bsd_cryptodev(void))\n# endif\n\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/engineerr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_ENGINEERR_H\n# define HEADER_ENGINEERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# include \n\n# ifndef OPENSSL_NO_ENGINE\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_ENGINE_strings(void);\n\n/*\n * ENGINE function codes.\n */\n# define ENGINE_F_DIGEST_UPDATE 198\n# define ENGINE_F_DYNAMIC_CTRL 180\n# define ENGINE_F_DYNAMIC_GET_DATA_CTX 181\n# define ENGINE_F_DYNAMIC_LOAD 182\n# define ENGINE_F_DYNAMIC_SET_DATA_CTX 183\n# define ENGINE_F_ENGINE_ADD 105\n# define ENGINE_F_ENGINE_BY_ID 106\n# define ENGINE_F_ENGINE_CMD_IS_EXECUTABLE 170\n# define ENGINE_F_ENGINE_CTRL 142\n# define ENGINE_F_ENGINE_CTRL_CMD 178\n# define ENGINE_F_ENGINE_CTRL_CMD_STRING 171\n# define ENGINE_F_ENGINE_FINISH 107\n# define ENGINE_F_ENGINE_GET_CIPHER 185\n# define ENGINE_F_ENGINE_GET_DIGEST 186\n# define ENGINE_F_ENGINE_GET_FIRST 195\n# define ENGINE_F_ENGINE_GET_LAST 196\n# define ENGINE_F_ENGINE_GET_NEXT 115\n# define ENGINE_F_ENGINE_GET_PKEY_ASN1_METH 193\n# define ENGINE_F_ENGINE_GET_PKEY_METH 192\n# define ENGINE_F_ENGINE_GET_PREV 116\n# define ENGINE_F_ENGINE_INIT 119\n# define ENGINE_F_ENGINE_LIST_ADD 120\n# define ENGINE_F_ENGINE_LIST_REMOVE 121\n# define ENGINE_F_ENGINE_LOAD_PRIVATE_KEY 150\n# define ENGINE_F_ENGINE_LOAD_PUBLIC_KEY 151\n# define ENGINE_F_ENGINE_LOAD_SSL_CLIENT_CERT 194\n# define ENGINE_F_ENGINE_NEW 122\n# define ENGINE_F_ENGINE_PKEY_ASN1_FIND_STR 197\n# define ENGINE_F_ENGINE_REMOVE 123\n# define ENGINE_F_ENGINE_SET_DEFAULT_STRING 189\n# define ENGINE_F_ENGINE_SET_ID 129\n# define ENGINE_F_ENGINE_SET_NAME 130\n# define ENGINE_F_ENGINE_TABLE_REGISTER 184\n# define ENGINE_F_ENGINE_UNLOCKED_FINISH 191\n# define ENGINE_F_ENGINE_UP_REF 190\n# define ENGINE_F_INT_CLEANUP_ITEM 199\n# define ENGINE_F_INT_CTRL_HELPER 172\n# define ENGINE_F_INT_ENGINE_CONFIGURE 188\n# define ENGINE_F_INT_ENGINE_MODULE_INIT 187\n# define ENGINE_F_OSSL_HMAC_INIT 200\n\n/*\n * ENGINE reason codes.\n */\n# define ENGINE_R_ALREADY_LOADED 100\n# define ENGINE_R_ARGUMENT_IS_NOT_A_NUMBER 133\n# define ENGINE_R_CMD_NOT_EXECUTABLE 134\n# define ENGINE_R_COMMAND_TAKES_INPUT 135\n# define ENGINE_R_COMMAND_TAKES_NO_INPUT 136\n# define ENGINE_R_CONFLICTING_ENGINE_ID 103\n# define ENGINE_R_CTRL_COMMAND_NOT_IMPLEMENTED 119\n# define ENGINE_R_DSO_FAILURE 104\n# define ENGINE_R_DSO_NOT_FOUND 132\n# define ENGINE_R_ENGINES_SECTION_ERROR 148\n# define ENGINE_R_ENGINE_CONFIGURATION_ERROR 102\n# define ENGINE_R_ENGINE_IS_NOT_IN_LIST 105\n# define ENGINE_R_ENGINE_SECTION_ERROR 149\n# define ENGINE_R_FAILED_LOADING_PRIVATE_KEY 128\n# define ENGINE_R_FAILED_LOADING_PUBLIC_KEY 129\n# define ENGINE_R_FINISH_FAILED 106\n# define ENGINE_R_ID_OR_NAME_MISSING 108\n# define ENGINE_R_INIT_FAILED 109\n# define ENGINE_R_INTERNAL_LIST_ERROR 110\n# define ENGINE_R_INVALID_ARGUMENT 143\n# define ENGINE_R_INVALID_CMD_NAME 137\n# define ENGINE_R_INVALID_CMD_NUMBER 138\n# define ENGINE_R_INVALID_INIT_VALUE 151\n# define ENGINE_R_INVALID_STRING 150\n# define ENGINE_R_NOT_INITIALISED 117\n# define ENGINE_R_NOT_LOADED 112\n# define ENGINE_R_NO_CONTROL_FUNCTION 120\n# define ENGINE_R_NO_INDEX 144\n# define ENGINE_R_NO_LOAD_FUNCTION 125\n# define ENGINE_R_NO_REFERENCE 130\n# define ENGINE_R_NO_SUCH_ENGINE 116\n# define ENGINE_R_UNIMPLEMENTED_CIPHER 146\n# define ENGINE_R_UNIMPLEMENTED_DIGEST 147\n# define ENGINE_R_UNIMPLEMENTED_PUBLIC_KEY_METHOD 101\n# define ENGINE_R_VERSION_INCOMPATIBILITY 145\n\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/err.h", "content": "/*\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_ERR_H\n# define HEADER_ERR_H\n\n# include \n\n# ifndef OPENSSL_NO_STDIO\n# include \n# include \n# endif\n\n# include \n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# ifndef OPENSSL_NO_ERR\n# define ERR_PUT_error(a,b,c,d,e) ERR_put_error(a,b,c,d,e)\n# else\n# define ERR_PUT_error(a,b,c,d,e) ERR_put_error(a,b,c,NULL,0)\n# endif\n\n# include \n\n# define ERR_TXT_MALLOCED 0x01\n# define ERR_TXT_STRING 0x02\n\n# define ERR_FLAG_MARK 0x01\n# define ERR_FLAG_CLEAR 0x02\n\n# define ERR_NUM_ERRORS 16\ntypedef struct err_state_st {\n int err_flags[ERR_NUM_ERRORS];\n unsigned long err_buffer[ERR_NUM_ERRORS];\n char *err_data[ERR_NUM_ERRORS];\n int err_data_flags[ERR_NUM_ERRORS];\n const char *err_file[ERR_NUM_ERRORS];\n int err_line[ERR_NUM_ERRORS];\n int top, bottom;\n} ERR_STATE;\n\n/* library */\n# define ERR_LIB_NONE 1\n# define ERR_LIB_SYS 2\n# define ERR_LIB_BN 3\n# define ERR_LIB_RSA 4\n# define ERR_LIB_DH 5\n# define ERR_LIB_EVP 6\n# define ERR_LIB_BUF 7\n# define ERR_LIB_OBJ 8\n# define ERR_LIB_PEM 9\n# define ERR_LIB_DSA 10\n# define ERR_LIB_X509 11\n/* #define ERR_LIB_METH 12 */\n# define ERR_LIB_ASN1 13\n# define ERR_LIB_CONF 14\n# define ERR_LIB_CRYPTO 15\n# define ERR_LIB_EC 16\n# define ERR_LIB_SSL 20\n/* #define ERR_LIB_SSL23 21 */\n/* #define ERR_LIB_SSL2 22 */\n/* #define ERR_LIB_SSL3 23 */\n/* #define ERR_LIB_RSAREF 30 */\n/* #define ERR_LIB_PROXY 31 */\n# define ERR_LIB_BIO 32\n# define ERR_LIB_PKCS7 33\n# define ERR_LIB_X509V3 34\n# define ERR_LIB_PKCS12 35\n# define ERR_LIB_RAND 36\n# define ERR_LIB_DSO 37\n# define ERR_LIB_ENGINE 38\n# define ERR_LIB_OCSP 39\n# define ERR_LIB_UI 40\n# define ERR_LIB_COMP 41\n# define ERR_LIB_ECDSA 42\n# define ERR_LIB_ECDH 43\n# define ERR_LIB_OSSL_STORE 44\n# define ERR_LIB_FIPS 45\n# define ERR_LIB_CMS 46\n# define ERR_LIB_TS 47\n# define ERR_LIB_HMAC 48\n/* # define ERR_LIB_JPAKE 49 */\n# define ERR_LIB_CT 50\n# define ERR_LIB_ASYNC 51\n# define ERR_LIB_KDF 52\n# define ERR_LIB_SM2 53\n\n# define ERR_LIB_USER 128\n\n# define SYSerr(f,r) ERR_PUT_error(ERR_LIB_SYS,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define BNerr(f,r) ERR_PUT_error(ERR_LIB_BN,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define RSAerr(f,r) ERR_PUT_error(ERR_LIB_RSA,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define DHerr(f,r) ERR_PUT_error(ERR_LIB_DH,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define EVPerr(f,r) ERR_PUT_error(ERR_LIB_EVP,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define BUFerr(f,r) ERR_PUT_error(ERR_LIB_BUF,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define OBJerr(f,r) ERR_PUT_error(ERR_LIB_OBJ,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define PEMerr(f,r) ERR_PUT_error(ERR_LIB_PEM,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define DSAerr(f,r) ERR_PUT_error(ERR_LIB_DSA,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define X509err(f,r) ERR_PUT_error(ERR_LIB_X509,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define ASN1err(f,r) ERR_PUT_error(ERR_LIB_ASN1,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define CONFerr(f,r) ERR_PUT_error(ERR_LIB_CONF,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define CRYPTOerr(f,r) ERR_PUT_error(ERR_LIB_CRYPTO,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define ECerr(f,r) ERR_PUT_error(ERR_LIB_EC,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define SSLerr(f,r) ERR_PUT_error(ERR_LIB_SSL,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define BIOerr(f,r) ERR_PUT_error(ERR_LIB_BIO,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define PKCS7err(f,r) ERR_PUT_error(ERR_LIB_PKCS7,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define X509V3err(f,r) ERR_PUT_error(ERR_LIB_X509V3,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define PKCS12err(f,r) ERR_PUT_error(ERR_LIB_PKCS12,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define RANDerr(f,r) ERR_PUT_error(ERR_LIB_RAND,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define DSOerr(f,r) ERR_PUT_error(ERR_LIB_DSO,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define ENGINEerr(f,r) ERR_PUT_error(ERR_LIB_ENGINE,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define OCSPerr(f,r) ERR_PUT_error(ERR_LIB_OCSP,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define UIerr(f,r) ERR_PUT_error(ERR_LIB_UI,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define COMPerr(f,r) ERR_PUT_error(ERR_LIB_COMP,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define ECDSAerr(f,r) ERR_PUT_error(ERR_LIB_ECDSA,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define ECDHerr(f,r) ERR_PUT_error(ERR_LIB_ECDH,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define OSSL_STOREerr(f,r) ERR_PUT_error(ERR_LIB_OSSL_STORE,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define FIPSerr(f,r) ERR_PUT_error(ERR_LIB_FIPS,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define CMSerr(f,r) ERR_PUT_error(ERR_LIB_CMS,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define TSerr(f,r) ERR_PUT_error(ERR_LIB_TS,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define HMACerr(f,r) ERR_PUT_error(ERR_LIB_HMAC,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define CTerr(f,r) ERR_PUT_error(ERR_LIB_CT,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define ASYNCerr(f,r) ERR_PUT_error(ERR_LIB_ASYNC,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define KDFerr(f,r) ERR_PUT_error(ERR_LIB_KDF,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n# define SM2err(f,r) ERR_PUT_error(ERR_LIB_SM2,(f),(r),OPENSSL_FILE,OPENSSL_LINE)\n\n# define ERR_PACK(l,f,r) ( \\\n (((unsigned int)(l) & 0x0FF) << 24L) | \\\n (((unsigned int)(f) & 0xFFF) << 12L) | \\\n (((unsigned int)(r) & 0xFFF) ) )\n# define ERR_GET_LIB(l) (int)(((l) >> 24L) & 0x0FFL)\n# define ERR_GET_FUNC(l) (int)(((l) >> 12L) & 0xFFFL)\n# define ERR_GET_REASON(l) (int)( (l) & 0xFFFL)\n# define ERR_FATAL_ERROR(l) (int)( (l) & ERR_R_FATAL)\n\n/* OS functions */\n# define SYS_F_FOPEN 1\n# define SYS_F_CONNECT 2\n# define SYS_F_GETSERVBYNAME 3\n# define SYS_F_SOCKET 4\n# define SYS_F_IOCTLSOCKET 5\n# define SYS_F_BIND 6\n# define SYS_F_LISTEN 7\n# define SYS_F_ACCEPT 8\n# define SYS_F_WSASTARTUP 9/* Winsock stuff */\n# define SYS_F_OPENDIR 10\n# define SYS_F_FREAD 11\n# define SYS_F_GETADDRINFO 12\n# define SYS_F_GETNAMEINFO 13\n# define SYS_F_SETSOCKOPT 14\n# define SYS_F_GETSOCKOPT 15\n# define SYS_F_GETSOCKNAME 16\n# define SYS_F_GETHOSTBYNAME 17\n# define SYS_F_FFLUSH 18\n# define SYS_F_OPEN 19\n# define SYS_F_CLOSE 20\n# define SYS_F_IOCTL 21\n# define SYS_F_STAT 22\n# define SYS_F_FCNTL 23\n# define SYS_F_FSTAT 24\n\n/* reasons */\n# define ERR_R_SYS_LIB ERR_LIB_SYS/* 2 */\n# define ERR_R_BN_LIB ERR_LIB_BN/* 3 */\n# define ERR_R_RSA_LIB ERR_LIB_RSA/* 4 */\n# define ERR_R_DH_LIB ERR_LIB_DH/* 5 */\n# define ERR_R_EVP_LIB ERR_LIB_EVP/* 6 */\n# define ERR_R_BUF_LIB ERR_LIB_BUF/* 7 */\n# define ERR_R_OBJ_LIB ERR_LIB_OBJ/* 8 */\n# define ERR_R_PEM_LIB ERR_LIB_PEM/* 9 */\n# define ERR_R_DSA_LIB ERR_LIB_DSA/* 10 */\n# define ERR_R_X509_LIB ERR_LIB_X509/* 11 */\n# define ERR_R_ASN1_LIB ERR_LIB_ASN1/* 13 */\n# define ERR_R_EC_LIB ERR_LIB_EC/* 16 */\n# define ERR_R_BIO_LIB ERR_LIB_BIO/* 32 */\n# define ERR_R_PKCS7_LIB ERR_LIB_PKCS7/* 33 */\n# define ERR_R_X509V3_LIB ERR_LIB_X509V3/* 34 */\n# define ERR_R_ENGINE_LIB ERR_LIB_ENGINE/* 38 */\n# define ERR_R_UI_LIB ERR_LIB_UI/* 40 */\n# define ERR_R_ECDSA_LIB ERR_LIB_ECDSA/* 42 */\n# define ERR_R_OSSL_STORE_LIB ERR_LIB_OSSL_STORE/* 44 */\n\n# define ERR_R_NESTED_ASN1_ERROR 58\n# define ERR_R_MISSING_ASN1_EOS 63\n\n/* fatal error */\n# define ERR_R_FATAL 64\n# define ERR_R_MALLOC_FAILURE (1|ERR_R_FATAL)\n# define ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED (2|ERR_R_FATAL)\n# define ERR_R_PASSED_NULL_PARAMETER (3|ERR_R_FATAL)\n# define ERR_R_INTERNAL_ERROR (4|ERR_R_FATAL)\n# define ERR_R_DISABLED (5|ERR_R_FATAL)\n# define ERR_R_INIT_FAIL (6|ERR_R_FATAL)\n# define ERR_R_PASSED_INVALID_ARGUMENT (7)\n# define ERR_R_OPERATION_FAIL (8|ERR_R_FATAL)\n\n/*\n * 99 is the maximum possible ERR_R_... code, higher values are reserved for\n * the individual libraries\n */\n\ntypedef struct ERR_string_data_st {\n unsigned long error;\n const char *string;\n} ERR_STRING_DATA;\n\nDEFINE_LHASH_OF(ERR_STRING_DATA);\n\nvoid ERR_put_error(int lib, int func, int reason, const char *file, int line);\nvoid ERR_set_error_data(char *data, int flags);\n\nunsigned long ERR_get_error(void);\nunsigned long ERR_get_error_line(const char **file, int *line);\nunsigned long ERR_get_error_line_data(const char **file, int *line,\n const char **data, int *flags);\nunsigned long ERR_peek_error(void);\nunsigned long ERR_peek_error_line(const char **file, int *line);\nunsigned long ERR_peek_error_line_data(const char **file, int *line,\n const char **data, int *flags);\nunsigned long ERR_peek_last_error(void);\nunsigned long ERR_peek_last_error_line(const char **file, int *line);\nunsigned long ERR_peek_last_error_line_data(const char **file, int *line,\n const char **data, int *flags);\nvoid ERR_clear_error(void);\nchar *ERR_error_string(unsigned long e, char *buf);\nvoid ERR_error_string_n(unsigned long e, char *buf, size_t len);\nconst char *ERR_lib_error_string(unsigned long e);\nconst char *ERR_func_error_string(unsigned long e);\nconst char *ERR_reason_error_string(unsigned long e);\nvoid ERR_print_errors_cb(int (*cb) (const char *str, size_t len, void *u),\n void *u);\n# ifndef OPENSSL_NO_STDIO\nvoid ERR_print_errors_fp(FILE *fp);\n# endif\nvoid ERR_print_errors(BIO *bp);\nvoid ERR_add_error_data(int num, ...);\nvoid ERR_add_error_vdata(int num, va_list args);\nint ERR_load_strings(int lib, ERR_STRING_DATA *str);\nint ERR_load_strings_const(const ERR_STRING_DATA *str);\nint ERR_unload_strings(int lib, ERR_STRING_DATA *str);\nint ERR_load_ERR_strings(void);\n\n#if OPENSSL_API_COMPAT < 0x10100000L\n# define ERR_load_crypto_strings() \\\n OPENSSL_init_crypto(OPENSSL_INIT_LOAD_CRYPTO_STRINGS, NULL)\n# define ERR_free_strings() while(0) continue\n#endif\n\nDEPRECATEDIN_1_1_0(void ERR_remove_thread_state(void *))\nDEPRECATEDIN_1_0_0(void ERR_remove_state(unsigned long pid))\nERR_STATE *ERR_get_state(void);\n\nint ERR_get_next_error_library(void);\n\nint ERR_set_mark(void);\nint ERR_pop_to_mark(void);\nint ERR_clear_last_mark(void);\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/evp.h", "content": "/*\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_ENVELOPE_H\n# define HEADER_ENVELOPE_H\n\n# include \n# include \n# include \n# include \n# include \n\n# define EVP_MAX_MD_SIZE 64/* longest known is SHA512 */\n# define EVP_MAX_KEY_LENGTH 64\n# define EVP_MAX_IV_LENGTH 16\n# define EVP_MAX_BLOCK_LENGTH 32\n\n# define PKCS5_SALT_LEN 8\n/* Default PKCS#5 iteration count */\n# define PKCS5_DEFAULT_ITER 2048\n\n# include \n\n# define EVP_PK_RSA 0x0001\n# define EVP_PK_DSA 0x0002\n# define EVP_PK_DH 0x0004\n# define EVP_PK_EC 0x0008\n# define EVP_PKT_SIGN 0x0010\n# define EVP_PKT_ENC 0x0020\n# define EVP_PKT_EXCH 0x0040\n# define EVP_PKS_RSA 0x0100\n# define EVP_PKS_DSA 0x0200\n# define EVP_PKS_EC 0x0400\n\n# define EVP_PKEY_NONE NID_undef\n# define EVP_PKEY_RSA NID_rsaEncryption\n# define EVP_PKEY_RSA2 NID_rsa\n# define EVP_PKEY_RSA_PSS NID_rsassaPss\n# define EVP_PKEY_DSA NID_dsa\n# define EVP_PKEY_DSA1 NID_dsa_2\n# define EVP_PKEY_DSA2 NID_dsaWithSHA\n# define EVP_PKEY_DSA3 NID_dsaWithSHA1\n# define EVP_PKEY_DSA4 NID_dsaWithSHA1_2\n# define EVP_PKEY_DH NID_dhKeyAgreement\n# define EVP_PKEY_DHX NID_dhpublicnumber\n# define EVP_PKEY_EC NID_X9_62_id_ecPublicKey\n# define EVP_PKEY_SM2 NID_sm2\n# define EVP_PKEY_HMAC NID_hmac\n# define EVP_PKEY_CMAC NID_cmac\n# define EVP_PKEY_SCRYPT NID_id_scrypt\n# define EVP_PKEY_TLS1_PRF NID_tls1_prf\n# define EVP_PKEY_HKDF NID_hkdf\n# define EVP_PKEY_POLY1305 NID_poly1305\n# define EVP_PKEY_SIPHASH NID_siphash\n# define EVP_PKEY_X25519 NID_X25519\n# define EVP_PKEY_ED25519 NID_ED25519\n# define EVP_PKEY_X448 NID_X448\n# define EVP_PKEY_ED448 NID_ED448\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# define EVP_PKEY_MO_SIGN 0x0001\n# define EVP_PKEY_MO_VERIFY 0x0002\n# define EVP_PKEY_MO_ENCRYPT 0x0004\n# define EVP_PKEY_MO_DECRYPT 0x0008\n\n# ifndef EVP_MD\nEVP_MD *EVP_MD_meth_new(int md_type, int pkey_type);\nEVP_MD *EVP_MD_meth_dup(const EVP_MD *md);\nvoid EVP_MD_meth_free(EVP_MD *md);\n\nint EVP_MD_meth_set_input_blocksize(EVP_MD *md, int blocksize);\nint EVP_MD_meth_set_result_size(EVP_MD *md, int resultsize);\nint EVP_MD_meth_set_app_datasize(EVP_MD *md, int datasize);\nint EVP_MD_meth_set_flags(EVP_MD *md, unsigned long flags);\nint EVP_MD_meth_set_init(EVP_MD *md, int (*init)(EVP_MD_CTX *ctx));\nint EVP_MD_meth_set_update(EVP_MD *md, int (*update)(EVP_MD_CTX *ctx,\n const void *data,\n size_t count));\nint EVP_MD_meth_set_final(EVP_MD *md, int (*final)(EVP_MD_CTX *ctx,\n unsigned char *md));\nint EVP_MD_meth_set_copy(EVP_MD *md, int (*copy)(EVP_MD_CTX *to,\n const EVP_MD_CTX *from));\nint EVP_MD_meth_set_cleanup(EVP_MD *md, int (*cleanup)(EVP_MD_CTX *ctx));\nint EVP_MD_meth_set_ctrl(EVP_MD *md, int (*ctrl)(EVP_MD_CTX *ctx, int cmd,\n int p1, void *p2));\n\nint EVP_MD_meth_get_input_blocksize(const EVP_MD *md);\nint EVP_MD_meth_get_result_size(const EVP_MD *md);\nint EVP_MD_meth_get_app_datasize(const EVP_MD *md);\nunsigned long EVP_MD_meth_get_flags(const EVP_MD *md);\nint (*EVP_MD_meth_get_init(const EVP_MD *md))(EVP_MD_CTX *ctx);\nint (*EVP_MD_meth_get_update(const EVP_MD *md))(EVP_MD_CTX *ctx,\n const void *data,\n size_t count);\nint (*EVP_MD_meth_get_final(const EVP_MD *md))(EVP_MD_CTX *ctx,\n unsigned char *md);\nint (*EVP_MD_meth_get_copy(const EVP_MD *md))(EVP_MD_CTX *to,\n const EVP_MD_CTX *from);\nint (*EVP_MD_meth_get_cleanup(const EVP_MD *md))(EVP_MD_CTX *ctx);\nint (*EVP_MD_meth_get_ctrl(const EVP_MD *md))(EVP_MD_CTX *ctx, int cmd,\n int p1, void *p2);\n\n/* digest can only handle a single block */\n# define EVP_MD_FLAG_ONESHOT 0x0001\n\n/* digest is extensible-output function, XOF */\n# define EVP_MD_FLAG_XOF 0x0002\n\n/* DigestAlgorithmIdentifier flags... */\n\n# define EVP_MD_FLAG_DIGALGID_MASK 0x0018\n\n/* NULL or absent parameter accepted. Use NULL */\n\n# define EVP_MD_FLAG_DIGALGID_NULL 0x0000\n\n/* NULL or absent parameter accepted. Use NULL for PKCS#1 otherwise absent */\n\n# define EVP_MD_FLAG_DIGALGID_ABSENT 0x0008\n\n/* Custom handling via ctrl */\n\n# define EVP_MD_FLAG_DIGALGID_CUSTOM 0x0018\n\n/* Note if suitable for use in FIPS mode */\n# define EVP_MD_FLAG_FIPS 0x0400\n\n/* Digest ctrls */\n\n# define EVP_MD_CTRL_DIGALGID 0x1\n# define EVP_MD_CTRL_MICALG 0x2\n# define EVP_MD_CTRL_XOF_LEN 0x3\n\n/* Minimum Algorithm specific ctrl value */\n\n# define EVP_MD_CTRL_ALG_CTRL 0x1000\n\n# endif /* !EVP_MD */\n\n/* values for EVP_MD_CTX flags */\n\n# define EVP_MD_CTX_FLAG_ONESHOT 0x0001/* digest update will be\n * called once only */\n# define EVP_MD_CTX_FLAG_CLEANED 0x0002/* context has already been\n * cleaned */\n# define EVP_MD_CTX_FLAG_REUSE 0x0004/* Don't free up ctx->md_data\n * in EVP_MD_CTX_reset */\n/*\n * FIPS and pad options are ignored in 1.0.0, definitions are here so we\n * don't accidentally reuse the values for other purposes.\n */\n\n# define EVP_MD_CTX_FLAG_NON_FIPS_ALLOW 0x0008/* Allow use of non FIPS\n * digest in FIPS mode */\n\n/*\n * The following PAD options are also currently ignored in 1.0.0, digest\n * parameters are handled through EVP_DigestSign*() and EVP_DigestVerify*()\n * instead.\n */\n# define EVP_MD_CTX_FLAG_PAD_MASK 0xF0/* RSA mode to use */\n# define EVP_MD_CTX_FLAG_PAD_PKCS1 0x00/* PKCS#1 v1.5 mode */\n# define EVP_MD_CTX_FLAG_PAD_X931 0x10/* X9.31 mode */\n# define EVP_MD_CTX_FLAG_PAD_PSS 0x20/* PSS mode */\n\n# define EVP_MD_CTX_FLAG_NO_INIT 0x0100/* Don't initialize md_data */\n/*\n * Some functions such as EVP_DigestSign only finalise copies of internal\n * contexts so additional data can be included after the finalisation call.\n * This is inefficient if this functionality is not required: it is disabled\n * if the following flag is set.\n */\n# define EVP_MD_CTX_FLAG_FINALISE 0x0200\n/* NOTE: 0x0400 is reserved for internal usage */\n\nEVP_CIPHER *EVP_CIPHER_meth_new(int cipher_type, int block_size, int key_len);\nEVP_CIPHER *EVP_CIPHER_meth_dup(const EVP_CIPHER *cipher);\nvoid EVP_CIPHER_meth_free(EVP_CIPHER *cipher);\n\nint EVP_CIPHER_meth_set_iv_length(EVP_CIPHER *cipher, int iv_len);\nint EVP_CIPHER_meth_set_flags(EVP_CIPHER *cipher, unsigned long flags);\nint EVP_CIPHER_meth_set_impl_ctx_size(EVP_CIPHER *cipher, int ctx_size);\nint EVP_CIPHER_meth_set_init(EVP_CIPHER *cipher,\n int (*init) (EVP_CIPHER_CTX *ctx,\n const unsigned char *key,\n const unsigned char *iv,\n int enc));\nint EVP_CIPHER_meth_set_do_cipher(EVP_CIPHER *cipher,\n int (*do_cipher) (EVP_CIPHER_CTX *ctx,\n unsigned char *out,\n const unsigned char *in,\n size_t inl));\nint EVP_CIPHER_meth_set_cleanup(EVP_CIPHER *cipher,\n int (*cleanup) (EVP_CIPHER_CTX *));\nint EVP_CIPHER_meth_set_set_asn1_params(EVP_CIPHER *cipher,\n int (*set_asn1_parameters) (EVP_CIPHER_CTX *,\n ASN1_TYPE *));\nint EVP_CIPHER_meth_set_get_asn1_params(EVP_CIPHER *cipher,\n int (*get_asn1_parameters) (EVP_CIPHER_CTX *,\n ASN1_TYPE *));\nint EVP_CIPHER_meth_set_ctrl(EVP_CIPHER *cipher,\n int (*ctrl) (EVP_CIPHER_CTX *, int type,\n int arg, void *ptr));\n\nint (*EVP_CIPHER_meth_get_init(const EVP_CIPHER *cipher))(EVP_CIPHER_CTX *ctx,\n const unsigned char *key,\n const unsigned char *iv,\n int enc);\nint (*EVP_CIPHER_meth_get_do_cipher(const EVP_CIPHER *cipher))(EVP_CIPHER_CTX *ctx,\n unsigned char *out,\n const unsigned char *in,\n size_t inl);\nint (*EVP_CIPHER_meth_get_cleanup(const EVP_CIPHER *cipher))(EVP_CIPHER_CTX *);\nint (*EVP_CIPHER_meth_get_set_asn1_params(const EVP_CIPHER *cipher))(EVP_CIPHER_CTX *,\n ASN1_TYPE *);\nint (*EVP_CIPHER_meth_get_get_asn1_params(const EVP_CIPHER *cipher))(EVP_CIPHER_CTX *,\n ASN1_TYPE *);\nint (*EVP_CIPHER_meth_get_ctrl(const EVP_CIPHER *cipher))(EVP_CIPHER_CTX *,\n int type, int arg,\n void *ptr);\n\n/* Values for cipher flags */\n\n/* Modes for ciphers */\n\n# define EVP_CIPH_STREAM_CIPHER 0x0\n# define EVP_CIPH_ECB_MODE 0x1\n# define EVP_CIPH_CBC_MODE 0x2\n# define EVP_CIPH_CFB_MODE 0x3\n# define EVP_CIPH_OFB_MODE 0x4\n# define EVP_CIPH_CTR_MODE 0x5\n# define EVP_CIPH_GCM_MODE 0x6\n# define EVP_CIPH_CCM_MODE 0x7\n# define EVP_CIPH_XTS_MODE 0x10001\n# define EVP_CIPH_WRAP_MODE 0x10002\n# define EVP_CIPH_OCB_MODE 0x10003\n# define EVP_CIPH_MODE 0xF0007\n/* Set if variable length cipher */\n# define EVP_CIPH_VARIABLE_LENGTH 0x8\n/* Set if the iv handling should be done by the cipher itself */\n# define EVP_CIPH_CUSTOM_IV 0x10\n/* Set if the cipher's init() function should be called if key is NULL */\n# define EVP_CIPH_ALWAYS_CALL_INIT 0x20\n/* Call ctrl() to init cipher parameters */\n# define EVP_CIPH_CTRL_INIT 0x40\n/* Don't use standard key length function */\n# define EVP_CIPH_CUSTOM_KEY_LENGTH 0x80\n/* Don't use standard block padding */\n# define EVP_CIPH_NO_PADDING 0x100\n/* cipher handles random key generation */\n# define EVP_CIPH_RAND_KEY 0x200\n/* cipher has its own additional copying logic */\n# define EVP_CIPH_CUSTOM_COPY 0x400\n/* Don't use standard iv length function */\n# define EVP_CIPH_CUSTOM_IV_LENGTH 0x800\n/* Allow use default ASN1 get/set iv */\n# define EVP_CIPH_FLAG_DEFAULT_ASN1 0x1000\n/* Buffer length in bits not bytes: CFB1 mode only */\n# define EVP_CIPH_FLAG_LENGTH_BITS 0x2000\n/* Note if suitable for use in FIPS mode */\n# define EVP_CIPH_FLAG_FIPS 0x4000\n/* Allow non FIPS cipher in FIPS mode */\n# define EVP_CIPH_FLAG_NON_FIPS_ALLOW 0x8000\n/*\n * Cipher handles any and all padding logic as well as finalisation.\n */\n# define EVP_CIPH_FLAG_CUSTOM_CIPHER 0x100000\n# define EVP_CIPH_FLAG_AEAD_CIPHER 0x200000\n# define EVP_CIPH_FLAG_TLS1_1_MULTIBLOCK 0x400000\n/* Cipher can handle pipeline operations */\n# define EVP_CIPH_FLAG_PIPELINE 0X800000\n\n/*\n * Cipher context flag to indicate we can handle wrap mode: if allowed in\n * older applications it could overflow buffers.\n */\n\n# define EVP_CIPHER_CTX_FLAG_WRAP_ALLOW 0x1\n\n/* ctrl() values */\n\n# define EVP_CTRL_INIT 0x0\n# define EVP_CTRL_SET_KEY_LENGTH 0x1\n# define EVP_CTRL_GET_RC2_KEY_BITS 0x2\n# define EVP_CTRL_SET_RC2_KEY_BITS 0x3\n# define EVP_CTRL_GET_RC5_ROUNDS 0x4\n# define EVP_CTRL_SET_RC5_ROUNDS 0x5\n# define EVP_CTRL_RAND_KEY 0x6\n# define EVP_CTRL_PBE_PRF_NID 0x7\n# define EVP_CTRL_COPY 0x8\n# define EVP_CTRL_AEAD_SET_IVLEN 0x9\n# define EVP_CTRL_AEAD_GET_TAG 0x10\n# define EVP_CTRL_AEAD_SET_TAG 0x11\n# define EVP_CTRL_AEAD_SET_IV_FIXED 0x12\n# define EVP_CTRL_GCM_SET_IVLEN EVP_CTRL_AEAD_SET_IVLEN\n# define EVP_CTRL_GCM_GET_TAG EVP_CTRL_AEAD_GET_TAG\n# define EVP_CTRL_GCM_SET_TAG EVP_CTRL_AEAD_SET_TAG\n# define EVP_CTRL_GCM_SET_IV_FIXED EVP_CTRL_AEAD_SET_IV_FIXED\n# define EVP_CTRL_GCM_IV_GEN 0x13\n# define EVP_CTRL_CCM_SET_IVLEN EVP_CTRL_AEAD_SET_IVLEN\n# define EVP_CTRL_CCM_GET_TAG EVP_CTRL_AEAD_GET_TAG\n# define EVP_CTRL_CCM_SET_TAG EVP_CTRL_AEAD_SET_TAG\n# define EVP_CTRL_CCM_SET_IV_FIXED EVP_CTRL_AEAD_SET_IV_FIXED\n# define EVP_CTRL_CCM_SET_L 0x14\n# define EVP_CTRL_CCM_SET_MSGLEN 0x15\n/*\n * AEAD cipher deduces payload length and returns number of bytes required to\n * store MAC and eventual padding. Subsequent call to EVP_Cipher even\n * appends/verifies MAC.\n */\n# define EVP_CTRL_AEAD_TLS1_AAD 0x16\n/* Used by composite AEAD ciphers, no-op in GCM, CCM... */\n# define EVP_CTRL_AEAD_SET_MAC_KEY 0x17\n/* Set the GCM invocation field, decrypt only */\n# define EVP_CTRL_GCM_SET_IV_INV 0x18\n\n# define EVP_CTRL_TLS1_1_MULTIBLOCK_AAD 0x19\n# define EVP_CTRL_TLS1_1_MULTIBLOCK_ENCRYPT 0x1a\n# define EVP_CTRL_TLS1_1_MULTIBLOCK_DECRYPT 0x1b\n# define EVP_CTRL_TLS1_1_MULTIBLOCK_MAX_BUFSIZE 0x1c\n\n# define EVP_CTRL_SSL3_MASTER_SECRET 0x1d\n\n/* EVP_CTRL_SET_SBOX takes the char * specifying S-boxes */\n# define EVP_CTRL_SET_SBOX 0x1e\n/*\n * EVP_CTRL_SBOX_USED takes a 'size_t' and 'char *', pointing at a\n * pre-allocated buffer with specified size\n */\n# define EVP_CTRL_SBOX_USED 0x1f\n/* EVP_CTRL_KEY_MESH takes 'size_t' number of bytes to mesh the key after,\n * 0 switches meshing off\n */\n# define EVP_CTRL_KEY_MESH 0x20\n/* EVP_CTRL_BLOCK_PADDING_MODE takes the padding mode */\n# define EVP_CTRL_BLOCK_PADDING_MODE 0x21\n\n/* Set the output buffers to use for a pipelined operation */\n# define EVP_CTRL_SET_PIPELINE_OUTPUT_BUFS 0x22\n/* Set the input buffers to use for a pipelined operation */\n# define EVP_CTRL_SET_PIPELINE_INPUT_BUFS 0x23\n/* Set the input buffer lengths to use for a pipelined operation */\n# define EVP_CTRL_SET_PIPELINE_INPUT_LENS 0x24\n\n# define EVP_CTRL_GET_IVLEN 0x25\n\n/* Padding modes */\n#define EVP_PADDING_PKCS7 1\n#define EVP_PADDING_ISO7816_4 2\n#define EVP_PADDING_ANSI923 3\n#define EVP_PADDING_ISO10126 4\n#define EVP_PADDING_ZERO 5\n\n/* RFC 5246 defines additional data to be 13 bytes in length */\n# define EVP_AEAD_TLS1_AAD_LEN 13\n\ntypedef struct {\n unsigned char *out;\n const unsigned char *inp;\n size_t len;\n unsigned int interleave;\n} EVP_CTRL_TLS1_1_MULTIBLOCK_PARAM;\n\n/* GCM TLS constants */\n/* Length of fixed part of IV derived from PRF */\n# define EVP_GCM_TLS_FIXED_IV_LEN 4\n/* Length of explicit part of IV part of TLS records */\n# define EVP_GCM_TLS_EXPLICIT_IV_LEN 8\n/* Length of tag for TLS */\n# define EVP_GCM_TLS_TAG_LEN 16\n\n/* CCM TLS constants */\n/* Length of fixed part of IV derived from PRF */\n# define EVP_CCM_TLS_FIXED_IV_LEN 4\n/* Length of explicit part of IV part of TLS records */\n# define EVP_CCM_TLS_EXPLICIT_IV_LEN 8\n/* Total length of CCM IV length for TLS */\n# define EVP_CCM_TLS_IV_LEN 12\n/* Length of tag for TLS */\n# define EVP_CCM_TLS_TAG_LEN 16\n/* Length of CCM8 tag for TLS */\n# define EVP_CCM8_TLS_TAG_LEN 8\n\n/* Length of tag for TLS */\n# define EVP_CHACHAPOLY_TLS_TAG_LEN 16\n\ntypedef struct evp_cipher_info_st {\n const EVP_CIPHER *cipher;\n unsigned char iv[EVP_MAX_IV_LENGTH];\n} EVP_CIPHER_INFO;\n\n\n/* Password based encryption function */\ntypedef int (EVP_PBE_KEYGEN) (EVP_CIPHER_CTX *ctx, const char *pass,\n int passlen, ASN1_TYPE *param,\n const EVP_CIPHER *cipher, const EVP_MD *md,\n int en_de);\n\n# ifndef OPENSSL_NO_RSA\n# define EVP_PKEY_assign_RSA(pkey,rsa) EVP_PKEY_assign((pkey),EVP_PKEY_RSA,\\\n (char *)(rsa))\n# endif\n\n# ifndef OPENSSL_NO_DSA\n# define EVP_PKEY_assign_DSA(pkey,dsa) EVP_PKEY_assign((pkey),EVP_PKEY_DSA,\\\n (char *)(dsa))\n# endif\n\n# ifndef OPENSSL_NO_DH\n# define EVP_PKEY_assign_DH(pkey,dh) EVP_PKEY_assign((pkey),EVP_PKEY_DH,\\\n (char *)(dh))\n# endif\n\n# ifndef OPENSSL_NO_EC\n# define EVP_PKEY_assign_EC_KEY(pkey,eckey) EVP_PKEY_assign((pkey),EVP_PKEY_EC,\\\n (char *)(eckey))\n# endif\n# ifndef OPENSSL_NO_SIPHASH\n# define EVP_PKEY_assign_SIPHASH(pkey,shkey) EVP_PKEY_assign((pkey),EVP_PKEY_SIPHASH,\\\n (char *)(shkey))\n# endif\n\n# ifndef OPENSSL_NO_POLY1305\n# define EVP_PKEY_assign_POLY1305(pkey,polykey) EVP_PKEY_assign((pkey),EVP_PKEY_POLY1305,\\\n (char *)(polykey))\n# endif\n\n/* Add some extra combinations */\n# define EVP_get_digestbynid(a) EVP_get_digestbyname(OBJ_nid2sn(a))\n# define EVP_get_digestbyobj(a) EVP_get_digestbynid(OBJ_obj2nid(a))\n# define EVP_get_cipherbynid(a) EVP_get_cipherbyname(OBJ_nid2sn(a))\n# define EVP_get_cipherbyobj(a) EVP_get_cipherbynid(OBJ_obj2nid(a))\n\nint EVP_MD_type(const EVP_MD *md);\n# define EVP_MD_nid(e) EVP_MD_type(e)\n# define EVP_MD_name(e) OBJ_nid2sn(EVP_MD_nid(e))\nint EVP_MD_pkey_type(const EVP_MD *md);\nint EVP_MD_size(const EVP_MD *md);\nint EVP_MD_block_size(const EVP_MD *md);\nunsigned long EVP_MD_flags(const EVP_MD *md);\n\nconst EVP_MD *EVP_MD_CTX_md(const EVP_MD_CTX *ctx);\nint (*EVP_MD_CTX_update_fn(EVP_MD_CTX *ctx))(EVP_MD_CTX *ctx,\n const void *data, size_t count);\nvoid EVP_MD_CTX_set_update_fn(EVP_MD_CTX *ctx,\n int (*update) (EVP_MD_CTX *ctx,\n const void *data, size_t count));\n# define EVP_MD_CTX_size(e) EVP_MD_size(EVP_MD_CTX_md(e))\n# define EVP_MD_CTX_block_size(e) EVP_MD_block_size(EVP_MD_CTX_md(e))\n# define EVP_MD_CTX_type(e) EVP_MD_type(EVP_MD_CTX_md(e))\nEVP_PKEY_CTX *EVP_MD_CTX_pkey_ctx(const EVP_MD_CTX *ctx);\nvoid EVP_MD_CTX_set_pkey_ctx(EVP_MD_CTX *ctx, EVP_PKEY_CTX *pctx);\nvoid *EVP_MD_CTX_md_data(const EVP_MD_CTX *ctx);\n\nint EVP_CIPHER_nid(const EVP_CIPHER *cipher);\n# define EVP_CIPHER_name(e) OBJ_nid2sn(EVP_CIPHER_nid(e))\nint EVP_CIPHER_block_size(const EVP_CIPHER *cipher);\nint EVP_CIPHER_impl_ctx_size(const EVP_CIPHER *cipher);\nint EVP_CIPHER_key_length(const EVP_CIPHER *cipher);\nint EVP_CIPHER_iv_length(const EVP_CIPHER *cipher);\nunsigned long EVP_CIPHER_flags(const EVP_CIPHER *cipher);\n# define EVP_CIPHER_mode(e) (EVP_CIPHER_flags(e) & EVP_CIPH_MODE)\n\nconst EVP_CIPHER *EVP_CIPHER_CTX_cipher(const EVP_CIPHER_CTX *ctx);\nint EVP_CIPHER_CTX_encrypting(const EVP_CIPHER_CTX *ctx);\nint EVP_CIPHER_CTX_nid(const EVP_CIPHER_CTX *ctx);\nint EVP_CIPHER_CTX_block_size(const EVP_CIPHER_CTX *ctx);\nint EVP_CIPHER_CTX_key_length(const EVP_CIPHER_CTX *ctx);\nint EVP_CIPHER_CTX_iv_length(const EVP_CIPHER_CTX *ctx);\nconst unsigned char *EVP_CIPHER_CTX_iv(const EVP_CIPHER_CTX *ctx);\nconst unsigned char *EVP_CIPHER_CTX_original_iv(const EVP_CIPHER_CTX *ctx);\nunsigned char *EVP_CIPHER_CTX_iv_noconst(EVP_CIPHER_CTX *ctx);\nunsigned char *EVP_CIPHER_CTX_buf_noconst(EVP_CIPHER_CTX *ctx);\nint EVP_CIPHER_CTX_num(const EVP_CIPHER_CTX *ctx);\nvoid EVP_CIPHER_CTX_set_num(EVP_CIPHER_CTX *ctx, int num);\nint EVP_CIPHER_CTX_copy(EVP_CIPHER_CTX *out, const EVP_CIPHER_CTX *in);\nvoid *EVP_CIPHER_CTX_get_app_data(const EVP_CIPHER_CTX *ctx);\nvoid EVP_CIPHER_CTX_set_app_data(EVP_CIPHER_CTX *ctx, void *data);\nvoid *EVP_CIPHER_CTX_get_cipher_data(const EVP_CIPHER_CTX *ctx);\nvoid *EVP_CIPHER_CTX_set_cipher_data(EVP_CIPHER_CTX *ctx, void *cipher_data);\n# define EVP_CIPHER_CTX_type(c) EVP_CIPHER_type(EVP_CIPHER_CTX_cipher(c))\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define EVP_CIPHER_CTX_flags(c) EVP_CIPHER_flags(EVP_CIPHER_CTX_cipher(c))\n# endif\n# define EVP_CIPHER_CTX_mode(c) EVP_CIPHER_mode(EVP_CIPHER_CTX_cipher(c))\n\n# define EVP_ENCODE_LENGTH(l) ((((l)+2)/3*4)+((l)/48+1)*2+80)\n# define EVP_DECODE_LENGTH(l) (((l)+3)/4*3+80)\n\n# define EVP_SignInit_ex(a,b,c) EVP_DigestInit_ex(a,b,c)\n# define EVP_SignInit(a,b) EVP_DigestInit(a,b)\n# define EVP_SignUpdate(a,b,c) EVP_DigestUpdate(a,b,c)\n# define EVP_VerifyInit_ex(a,b,c) EVP_DigestInit_ex(a,b,c)\n# define EVP_VerifyInit(a,b) EVP_DigestInit(a,b)\n# define EVP_VerifyUpdate(a,b,c) EVP_DigestUpdate(a,b,c)\n# define EVP_OpenUpdate(a,b,c,d,e) EVP_DecryptUpdate(a,b,c,d,e)\n# define EVP_SealUpdate(a,b,c,d,e) EVP_EncryptUpdate(a,b,c,d,e)\n# define EVP_DigestSignUpdate(a,b,c) EVP_DigestUpdate(a,b,c)\n# define EVP_DigestVerifyUpdate(a,b,c) EVP_DigestUpdate(a,b,c)\n\n# ifdef CONST_STRICT\nvoid BIO_set_md(BIO *, const EVP_MD *md);\n# else\n# define BIO_set_md(b,md) BIO_ctrl(b,BIO_C_SET_MD,0,(char *)(md))\n# endif\n# define BIO_get_md(b,mdp) BIO_ctrl(b,BIO_C_GET_MD,0,(char *)(mdp))\n# define BIO_get_md_ctx(b,mdcp) BIO_ctrl(b,BIO_C_GET_MD_CTX,0, \\\n (char *)(mdcp))\n# define BIO_set_md_ctx(b,mdcp) BIO_ctrl(b,BIO_C_SET_MD_CTX,0, \\\n (char *)(mdcp))\n# define BIO_get_cipher_status(b) BIO_ctrl(b,BIO_C_GET_CIPHER_STATUS,0,NULL)\n# define BIO_get_cipher_ctx(b,c_pp) BIO_ctrl(b,BIO_C_GET_CIPHER_CTX,0, \\\n (char *)(c_pp))\n\n/*__owur*/ int EVP_Cipher(EVP_CIPHER_CTX *c,\n unsigned char *out,\n const unsigned char *in, unsigned int inl);\n\n# define EVP_add_cipher_alias(n,alias) \\\n OBJ_NAME_add((alias),OBJ_NAME_TYPE_CIPHER_METH|OBJ_NAME_ALIAS,(n))\n# define EVP_add_digest_alias(n,alias) \\\n OBJ_NAME_add((alias),OBJ_NAME_TYPE_MD_METH|OBJ_NAME_ALIAS,(n))\n# define EVP_delete_cipher_alias(alias) \\\n OBJ_NAME_remove(alias,OBJ_NAME_TYPE_CIPHER_METH|OBJ_NAME_ALIAS);\n# define EVP_delete_digest_alias(alias) \\\n OBJ_NAME_remove(alias,OBJ_NAME_TYPE_MD_METH|OBJ_NAME_ALIAS);\n\nint EVP_MD_CTX_ctrl(EVP_MD_CTX *ctx, int cmd, int p1, void *p2);\nEVP_MD_CTX *EVP_MD_CTX_new(void);\nint EVP_MD_CTX_reset(EVP_MD_CTX *ctx);\nvoid EVP_MD_CTX_free(EVP_MD_CTX *ctx);\n# define EVP_MD_CTX_create() EVP_MD_CTX_new()\n# define EVP_MD_CTX_init(ctx) EVP_MD_CTX_reset((ctx))\n# define EVP_MD_CTX_destroy(ctx) EVP_MD_CTX_free((ctx))\n__owur int EVP_MD_CTX_copy_ex(EVP_MD_CTX *out, const EVP_MD_CTX *in);\nvoid EVP_MD_CTX_set_flags(EVP_MD_CTX *ctx, int flags);\nvoid EVP_MD_CTX_clear_flags(EVP_MD_CTX *ctx, int flags);\nint EVP_MD_CTX_test_flags(const EVP_MD_CTX *ctx, int flags);\n__owur int EVP_DigestInit_ex(EVP_MD_CTX *ctx, const EVP_MD *type,\n ENGINE *impl);\n__owur int EVP_DigestUpdate(EVP_MD_CTX *ctx, const void *d,\n size_t cnt);\n__owur int EVP_DigestFinal_ex(EVP_MD_CTX *ctx, unsigned char *md,\n unsigned int *s);\n__owur int EVP_Digest(const void *data, size_t count,\n unsigned char *md, unsigned int *size,\n const EVP_MD *type, ENGINE *impl);\n\n__owur int EVP_MD_CTX_copy(EVP_MD_CTX *out, const EVP_MD_CTX *in);\n__owur int EVP_DigestInit(EVP_MD_CTX *ctx, const EVP_MD *type);\n__owur int EVP_DigestFinal(EVP_MD_CTX *ctx, unsigned char *md,\n unsigned int *s);\n__owur int EVP_DigestFinalXOF(EVP_MD_CTX *ctx, unsigned char *md,\n size_t len);\n\nint EVP_read_pw_string(char *buf, int length, const char *prompt, int verify);\nint EVP_read_pw_string_min(char *buf, int minlen, int maxlen,\n const char *prompt, int verify);\nvoid EVP_set_pw_prompt(const char *prompt);\nchar *EVP_get_pw_prompt(void);\n\n__owur int EVP_BytesToKey(const EVP_CIPHER *type, const EVP_MD *md,\n const unsigned char *salt,\n const unsigned char *data, int datal, int count,\n unsigned char *key, unsigned char *iv);\n\nvoid EVP_CIPHER_CTX_set_flags(EVP_CIPHER_CTX *ctx, int flags);\nvoid EVP_CIPHER_CTX_clear_flags(EVP_CIPHER_CTX *ctx, int flags);\nint EVP_CIPHER_CTX_test_flags(const EVP_CIPHER_CTX *ctx, int flags);\n\n__owur int EVP_EncryptInit(EVP_CIPHER_CTX *ctx, const EVP_CIPHER *cipher,\n const unsigned char *key, const unsigned char *iv);\n/*__owur*/ int EVP_EncryptInit_ex(EVP_CIPHER_CTX *ctx,\n const EVP_CIPHER *cipher, ENGINE *impl,\n const unsigned char *key,\n const unsigned char *iv);\n/*__owur*/ int EVP_EncryptUpdate(EVP_CIPHER_CTX *ctx, unsigned char *out,\n int *outl, const unsigned char *in, int inl);\n/*__owur*/ int EVP_EncryptFinal_ex(EVP_CIPHER_CTX *ctx, unsigned char *out,\n int *outl);\n/*__owur*/ int EVP_EncryptFinal(EVP_CIPHER_CTX *ctx, unsigned char *out,\n int *outl);\n\n__owur int EVP_DecryptInit(EVP_CIPHER_CTX *ctx, const EVP_CIPHER *cipher,\n const unsigned char *key, const unsigned char *iv);\n/*__owur*/ int EVP_DecryptInit_ex(EVP_CIPHER_CTX *ctx,\n const EVP_CIPHER *cipher, ENGINE *impl,\n const unsigned char *key,\n const unsigned char *iv);\n/*__owur*/ int EVP_DecryptUpdate(EVP_CIPHER_CTX *ctx, unsigned char *out,\n int *outl, const unsigned char *in, int inl);\n__owur int EVP_DecryptFinal(EVP_CIPHER_CTX *ctx, unsigned char *outm,\n int *outl);\n/*__owur*/ int EVP_DecryptFinal_ex(EVP_CIPHER_CTX *ctx, unsigned char *outm,\n int *outl);\n\n__owur int EVP_CipherInit(EVP_CIPHER_CTX *ctx, const EVP_CIPHER *cipher,\n const unsigned char *key, const unsigned char *iv,\n int enc);\n/*__owur*/ int EVP_CipherInit_ex(EVP_CIPHER_CTX *ctx,\n const EVP_CIPHER *cipher, ENGINE *impl,\n const unsigned char *key,\n const unsigned char *iv, int enc);\n__owur int EVP_CipherUpdate(EVP_CIPHER_CTX *ctx, unsigned char *out,\n int *outl, const unsigned char *in, int inl);\n__owur int EVP_CipherFinal(EVP_CIPHER_CTX *ctx, unsigned char *outm,\n int *outl);\n__owur int EVP_CipherFinal_ex(EVP_CIPHER_CTX *ctx, unsigned char *outm,\n int *outl);\n\n__owur int EVP_SignFinal(EVP_MD_CTX *ctx, unsigned char *md, unsigned int *s,\n EVP_PKEY *pkey);\n\n__owur int EVP_DigestSign(EVP_MD_CTX *ctx, unsigned char *sigret,\n size_t *siglen, const unsigned char *tbs,\n size_t tbslen);\n\n__owur int EVP_VerifyFinal(EVP_MD_CTX *ctx, const unsigned char *sigbuf,\n unsigned int siglen, EVP_PKEY *pkey);\n\n__owur int EVP_DigestVerify(EVP_MD_CTX *ctx, const unsigned char *sigret,\n size_t siglen, const unsigned char *tbs,\n size_t tbslen);\n\n/*__owur*/ int EVP_DigestSignInit(EVP_MD_CTX *ctx, EVP_PKEY_CTX **pctx,\n const EVP_MD *type, ENGINE *e,\n EVP_PKEY *pkey);\n__owur int EVP_DigestSignFinal(EVP_MD_CTX *ctx, unsigned char *sigret,\n size_t *siglen);\n\n__owur int EVP_DigestVerifyInit(EVP_MD_CTX *ctx, EVP_PKEY_CTX **pctx,\n const EVP_MD *type, ENGINE *e,\n EVP_PKEY *pkey);\n__owur int EVP_DigestVerifyFinal(EVP_MD_CTX *ctx, const unsigned char *sig,\n size_t siglen);\n\n# ifndef OPENSSL_NO_RSA\n__owur int EVP_OpenInit(EVP_CIPHER_CTX *ctx, const EVP_CIPHER *type,\n const unsigned char *ek, int ekl,\n const unsigned char *iv, EVP_PKEY *priv);\n__owur int EVP_OpenFinal(EVP_CIPHER_CTX *ctx, unsigned char *out, int *outl);\n\n__owur int EVP_SealInit(EVP_CIPHER_CTX *ctx, const EVP_CIPHER *type,\n unsigned char **ek, int *ekl, unsigned char *iv,\n EVP_PKEY **pubk, int npubk);\n__owur int EVP_SealFinal(EVP_CIPHER_CTX *ctx, unsigned char *out, int *outl);\n# endif\n\nEVP_ENCODE_CTX *EVP_ENCODE_CTX_new(void);\nvoid EVP_ENCODE_CTX_free(EVP_ENCODE_CTX *ctx);\nint EVP_ENCODE_CTX_copy(EVP_ENCODE_CTX *dctx, EVP_ENCODE_CTX *sctx);\nint EVP_ENCODE_CTX_num(EVP_ENCODE_CTX *ctx);\nvoid EVP_EncodeInit(EVP_ENCODE_CTX *ctx);\nint EVP_EncodeUpdate(EVP_ENCODE_CTX *ctx, unsigned char *out, int *outl,\n const unsigned char *in, int inl);\nvoid EVP_EncodeFinal(EVP_ENCODE_CTX *ctx, unsigned char *out, int *outl);\nint EVP_EncodeBlock(unsigned char *t, const unsigned char *f, int n);\n\nvoid EVP_DecodeInit(EVP_ENCODE_CTX *ctx);\nint EVP_DecodeUpdate(EVP_ENCODE_CTX *ctx, unsigned char *out, int *outl,\n const unsigned char *in, int inl);\nint EVP_DecodeFinal(EVP_ENCODE_CTX *ctx, unsigned\n char *out, int *outl);\nint EVP_DecodeBlock(unsigned char *t, const unsigned char *f, int n);\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define EVP_CIPHER_CTX_init(c) EVP_CIPHER_CTX_reset(c)\n# define EVP_CIPHER_CTX_cleanup(c) EVP_CIPHER_CTX_reset(c)\n# endif\nEVP_CIPHER_CTX *EVP_CIPHER_CTX_new(void);\nint EVP_CIPHER_CTX_reset(EVP_CIPHER_CTX *c);\nvoid EVP_CIPHER_CTX_free(EVP_CIPHER_CTX *c);\nint EVP_CIPHER_CTX_set_key_length(EVP_CIPHER_CTX *x, int keylen);\nint EVP_CIPHER_CTX_set_padding(EVP_CIPHER_CTX *c, int pad);\nint EVP_CIPHER_CTX_ctrl(EVP_CIPHER_CTX *ctx, int type, int arg, void *ptr);\nint EVP_CIPHER_CTX_rand_key(EVP_CIPHER_CTX *ctx, unsigned char *key);\n\nconst BIO_METHOD *BIO_f_md(void);\nconst BIO_METHOD *BIO_f_base64(void);\nconst BIO_METHOD *BIO_f_cipher(void);\nconst BIO_METHOD *BIO_f_reliable(void);\n__owur int BIO_set_cipher(BIO *b, const EVP_CIPHER *c, const unsigned char *k,\n const unsigned char *i, int enc);\n\nconst EVP_MD *EVP_md_null(void);\n# ifndef OPENSSL_NO_MD2\nconst EVP_MD *EVP_md2(void);\n# endif\n# ifndef OPENSSL_NO_MD4\nconst EVP_MD *EVP_md4(void);\n# endif\n# ifndef OPENSSL_NO_MD5\nconst EVP_MD *EVP_md5(void);\nconst EVP_MD *EVP_md5_sha1(void);\n# endif\n# ifndef OPENSSL_NO_BLAKE2\nconst EVP_MD *EVP_blake2b512(void);\nconst EVP_MD *EVP_blake2s256(void);\n# endif\nconst EVP_MD *EVP_sha1(void);\nconst EVP_MD *EVP_sha224(void);\nconst EVP_MD *EVP_sha256(void);\nconst EVP_MD *EVP_sha384(void);\nconst EVP_MD *EVP_sha512(void);\nconst EVP_MD *EVP_sha512_224(void);\nconst EVP_MD *EVP_sha512_256(void);\nconst EVP_MD *EVP_sha3_224(void);\nconst EVP_MD *EVP_sha3_256(void);\nconst EVP_MD *EVP_sha3_384(void);\nconst EVP_MD *EVP_sha3_512(void);\nconst EVP_MD *EVP_shake128(void);\nconst EVP_MD *EVP_shake256(void);\n# ifndef OPENSSL_NO_MDC2\nconst EVP_MD *EVP_mdc2(void);\n# endif\n# ifndef OPENSSL_NO_RMD160\nconst EVP_MD *EVP_ripemd160(void);\n# endif\n# ifndef OPENSSL_NO_WHIRLPOOL\nconst EVP_MD *EVP_whirlpool(void);\n# endif\n# ifndef OPENSSL_NO_SM3\nconst EVP_MD *EVP_sm3(void);\n# endif\nconst EVP_CIPHER *EVP_enc_null(void); /* does nothing :-) */\n# ifndef OPENSSL_NO_DES\nconst EVP_CIPHER *EVP_des_ecb(void);\nconst EVP_CIPHER *EVP_des_ede(void);\nconst EVP_CIPHER *EVP_des_ede3(void);\nconst EVP_CIPHER *EVP_des_ede_ecb(void);\nconst EVP_CIPHER *EVP_des_ede3_ecb(void);\nconst EVP_CIPHER *EVP_des_cfb64(void);\n# define EVP_des_cfb EVP_des_cfb64\nconst EVP_CIPHER *EVP_des_cfb1(void);\nconst EVP_CIPHER *EVP_des_cfb8(void);\nconst EVP_CIPHER *EVP_des_ede_cfb64(void);\n# define EVP_des_ede_cfb EVP_des_ede_cfb64\nconst EVP_CIPHER *EVP_des_ede3_cfb64(void);\n# define EVP_des_ede3_cfb EVP_des_ede3_cfb64\nconst EVP_CIPHER *EVP_des_ede3_cfb1(void);\nconst EVP_CIPHER *EVP_des_ede3_cfb8(void);\nconst EVP_CIPHER *EVP_des_ofb(void);\nconst EVP_CIPHER *EVP_des_ede_ofb(void);\nconst EVP_CIPHER *EVP_des_ede3_ofb(void);\nconst EVP_CIPHER *EVP_des_cbc(void);\nconst EVP_CIPHER *EVP_des_ede_cbc(void);\nconst EVP_CIPHER *EVP_des_ede3_cbc(void);\nconst EVP_CIPHER *EVP_desx_cbc(void);\nconst EVP_CIPHER *EVP_des_ede3_wrap(void);\n/*\n * This should now be supported through the dev_crypto ENGINE. But also, why\n * are rc4 and md5 declarations made here inside a \"NO_DES\" precompiler\n * branch?\n */\n# endif\n# ifndef OPENSSL_NO_RC4\nconst EVP_CIPHER *EVP_rc4(void);\nconst EVP_CIPHER *EVP_rc4_40(void);\n# ifndef OPENSSL_NO_MD5\nconst EVP_CIPHER *EVP_rc4_hmac_md5(void);\n# endif\n# endif\n# ifndef OPENSSL_NO_IDEA\nconst EVP_CIPHER *EVP_idea_ecb(void);\nconst EVP_CIPHER *EVP_idea_cfb64(void);\n# define EVP_idea_cfb EVP_idea_cfb64\nconst EVP_CIPHER *EVP_idea_ofb(void);\nconst EVP_CIPHER *EVP_idea_cbc(void);\n# endif\n# ifndef OPENSSL_NO_RC2\nconst EVP_CIPHER *EVP_rc2_ecb(void);\nconst EVP_CIPHER *EVP_rc2_cbc(void);\nconst EVP_CIPHER *EVP_rc2_40_cbc(void);\nconst EVP_CIPHER *EVP_rc2_64_cbc(void);\nconst EVP_CIPHER *EVP_rc2_cfb64(void);\n# define EVP_rc2_cfb EVP_rc2_cfb64\nconst EVP_CIPHER *EVP_rc2_ofb(void);\n# endif\n# ifndef OPENSSL_NO_BF\nconst EVP_CIPHER *EVP_bf_ecb(void);\nconst EVP_CIPHER *EVP_bf_cbc(void);\nconst EVP_CIPHER *EVP_bf_cfb64(void);\n# define EVP_bf_cfb EVP_bf_cfb64\nconst EVP_CIPHER *EVP_bf_ofb(void);\n# endif\n# ifndef OPENSSL_NO_CAST\nconst EVP_CIPHER *EVP_cast5_ecb(void);\nconst EVP_CIPHER *EVP_cast5_cbc(void);\nconst EVP_CIPHER *EVP_cast5_cfb64(void);\n# define EVP_cast5_cfb EVP_cast5_cfb64\nconst EVP_CIPHER *EVP_cast5_ofb(void);\n# endif\n# ifndef OPENSSL_NO_RC5\nconst EVP_CIPHER *EVP_rc5_32_12_16_cbc(void);\nconst EVP_CIPHER *EVP_rc5_32_12_16_ecb(void);\nconst EVP_CIPHER *EVP_rc5_32_12_16_cfb64(void);\n# define EVP_rc5_32_12_16_cfb EVP_rc5_32_12_16_cfb64\nconst EVP_CIPHER *EVP_rc5_32_12_16_ofb(void);\n# endif\nconst EVP_CIPHER *EVP_aes_128_ecb(void);\nconst EVP_CIPHER *EVP_aes_128_cbc(void);\nconst EVP_CIPHER *EVP_aes_128_cfb1(void);\nconst EVP_CIPHER *EVP_aes_128_cfb8(void);\nconst EVP_CIPHER *EVP_aes_128_cfb128(void);\n# define EVP_aes_128_cfb EVP_aes_128_cfb128\nconst EVP_CIPHER *EVP_aes_128_ofb(void);\nconst EVP_CIPHER *EVP_aes_128_ctr(void);\nconst EVP_CIPHER *EVP_aes_128_ccm(void);\nconst EVP_CIPHER *EVP_aes_128_gcm(void);\nconst EVP_CIPHER *EVP_aes_128_xts(void);\nconst EVP_CIPHER *EVP_aes_128_wrap(void);\nconst EVP_CIPHER *EVP_aes_128_wrap_pad(void);\n# ifndef OPENSSL_NO_OCB\nconst EVP_CIPHER *EVP_aes_128_ocb(void);\n# endif\nconst EVP_CIPHER *EVP_aes_192_ecb(void);\nconst EVP_CIPHER *EVP_aes_192_cbc(void);\nconst EVP_CIPHER *EVP_aes_192_cfb1(void);\nconst EVP_CIPHER *EVP_aes_192_cfb8(void);\nconst EVP_CIPHER *EVP_aes_192_cfb128(void);\n# define EVP_aes_192_cfb EVP_aes_192_cfb128\nconst EVP_CIPHER *EVP_aes_192_ofb(void);\nconst EVP_CIPHER *EVP_aes_192_ctr(void);\nconst EVP_CIPHER *EVP_aes_192_ccm(void);\nconst EVP_CIPHER *EVP_aes_192_gcm(void);\nconst EVP_CIPHER *EVP_aes_192_wrap(void);\nconst EVP_CIPHER *EVP_aes_192_wrap_pad(void);\n# ifndef OPENSSL_NO_OCB\nconst EVP_CIPHER *EVP_aes_192_ocb(void);\n# endif\nconst EVP_CIPHER *EVP_aes_256_ecb(void);\nconst EVP_CIPHER *EVP_aes_256_cbc(void);\nconst EVP_CIPHER *EVP_aes_256_cfb1(void);\nconst EVP_CIPHER *EVP_aes_256_cfb8(void);\nconst EVP_CIPHER *EVP_aes_256_cfb128(void);\n# define EVP_aes_256_cfb EVP_aes_256_cfb128\nconst EVP_CIPHER *EVP_aes_256_ofb(void);\nconst EVP_CIPHER *EVP_aes_256_ctr(void);\nconst EVP_CIPHER *EVP_aes_256_ccm(void);\nconst EVP_CIPHER *EVP_aes_256_gcm(void);\nconst EVP_CIPHER *EVP_aes_256_xts(void);\nconst EVP_CIPHER *EVP_aes_256_wrap(void);\nconst EVP_CIPHER *EVP_aes_256_wrap_pad(void);\n# ifndef OPENSSL_NO_OCB\nconst EVP_CIPHER *EVP_aes_256_ocb(void);\n# endif\nconst EVP_CIPHER *EVP_aes_128_cbc_hmac_sha1(void);\nconst EVP_CIPHER *EVP_aes_256_cbc_hmac_sha1(void);\nconst EVP_CIPHER *EVP_aes_128_cbc_hmac_sha256(void);\nconst EVP_CIPHER *EVP_aes_256_cbc_hmac_sha256(void);\n# ifndef OPENSSL_NO_ARIA\nconst EVP_CIPHER *EVP_aria_128_ecb(void);\nconst EVP_CIPHER *EVP_aria_128_cbc(void);\nconst EVP_CIPHER *EVP_aria_128_cfb1(void);\nconst EVP_CIPHER *EVP_aria_128_cfb8(void);\nconst EVP_CIPHER *EVP_aria_128_cfb128(void);\n# define EVP_aria_128_cfb EVP_aria_128_cfb128\nconst EVP_CIPHER *EVP_aria_128_ctr(void);\nconst EVP_CIPHER *EVP_aria_128_ofb(void);\nconst EVP_CIPHER *EVP_aria_128_gcm(void);\nconst EVP_CIPHER *EVP_aria_128_ccm(void);\nconst EVP_CIPHER *EVP_aria_192_ecb(void);\nconst EVP_CIPHER *EVP_aria_192_cbc(void);\nconst EVP_CIPHER *EVP_aria_192_cfb1(void);\nconst EVP_CIPHER *EVP_aria_192_cfb8(void);\nconst EVP_CIPHER *EVP_aria_192_cfb128(void);\n# define EVP_aria_192_cfb EVP_aria_192_cfb128\nconst EVP_CIPHER *EVP_aria_192_ctr(void);\nconst EVP_CIPHER *EVP_aria_192_ofb(void);\nconst EVP_CIPHER *EVP_aria_192_gcm(void);\nconst EVP_CIPHER *EVP_aria_192_ccm(void);\nconst EVP_CIPHER *EVP_aria_256_ecb(void);\nconst EVP_CIPHER *EVP_aria_256_cbc(void);\nconst EVP_CIPHER *EVP_aria_256_cfb1(void);\nconst EVP_CIPHER *EVP_aria_256_cfb8(void);\nconst EVP_CIPHER *EVP_aria_256_cfb128(void);\n# define EVP_aria_256_cfb EVP_aria_256_cfb128\nconst EVP_CIPHER *EVP_aria_256_ctr(void);\nconst EVP_CIPHER *EVP_aria_256_ofb(void);\nconst EVP_CIPHER *EVP_aria_256_gcm(void);\nconst EVP_CIPHER *EVP_aria_256_ccm(void);\n# endif\n# ifndef OPENSSL_NO_CAMELLIA\nconst EVP_CIPHER *EVP_camellia_128_ecb(void);\nconst EVP_CIPHER *EVP_camellia_128_cbc(void);\nconst EVP_CIPHER *EVP_camellia_128_cfb1(void);\nconst EVP_CIPHER *EVP_camellia_128_cfb8(void);\nconst EVP_CIPHER *EVP_camellia_128_cfb128(void);\n# define EVP_camellia_128_cfb EVP_camellia_128_cfb128\nconst EVP_CIPHER *EVP_camellia_128_ofb(void);\nconst EVP_CIPHER *EVP_camellia_128_ctr(void);\nconst EVP_CIPHER *EVP_camellia_192_ecb(void);\nconst EVP_CIPHER *EVP_camellia_192_cbc(void);\nconst EVP_CIPHER *EVP_camellia_192_cfb1(void);\nconst EVP_CIPHER *EVP_camellia_192_cfb8(void);\nconst EVP_CIPHER *EVP_camellia_192_cfb128(void);\n# define EVP_camellia_192_cfb EVP_camellia_192_cfb128\nconst EVP_CIPHER *EVP_camellia_192_ofb(void);\nconst EVP_CIPHER *EVP_camellia_192_ctr(void);\nconst EVP_CIPHER *EVP_camellia_256_ecb(void);\nconst EVP_CIPHER *EVP_camellia_256_cbc(void);\nconst EVP_CIPHER *EVP_camellia_256_cfb1(void);\nconst EVP_CIPHER *EVP_camellia_256_cfb8(void);\nconst EVP_CIPHER *EVP_camellia_256_cfb128(void);\n# define EVP_camellia_256_cfb EVP_camellia_256_cfb128\nconst EVP_CIPHER *EVP_camellia_256_ofb(void);\nconst EVP_CIPHER *EVP_camellia_256_ctr(void);\n# endif\n# ifndef OPENSSL_NO_CHACHA\nconst EVP_CIPHER *EVP_chacha20(void);\n# ifndef OPENSSL_NO_POLY1305\nconst EVP_CIPHER *EVP_chacha20_poly1305(void);\n# endif\n# endif\n\n# ifndef OPENSSL_NO_SEED\nconst EVP_CIPHER *EVP_seed_ecb(void);\nconst EVP_CIPHER *EVP_seed_cbc(void);\nconst EVP_CIPHER *EVP_seed_cfb128(void);\n# define EVP_seed_cfb EVP_seed_cfb128\nconst EVP_CIPHER *EVP_seed_ofb(void);\n# endif\n\n# ifndef OPENSSL_NO_SM4\nconst EVP_CIPHER *EVP_sm4_ecb(void);\nconst EVP_CIPHER *EVP_sm4_cbc(void);\nconst EVP_CIPHER *EVP_sm4_cfb128(void);\n# define EVP_sm4_cfb EVP_sm4_cfb128\nconst EVP_CIPHER *EVP_sm4_ofb(void);\nconst EVP_CIPHER *EVP_sm4_ctr(void);\n# endif\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define OPENSSL_add_all_algorithms_conf() \\\n OPENSSL_init_crypto(OPENSSL_INIT_ADD_ALL_CIPHERS \\\n | OPENSSL_INIT_ADD_ALL_DIGESTS \\\n | OPENSSL_INIT_LOAD_CONFIG, NULL)\n# define OPENSSL_add_all_algorithms_noconf() \\\n OPENSSL_init_crypto(OPENSSL_INIT_ADD_ALL_CIPHERS \\\n | OPENSSL_INIT_ADD_ALL_DIGESTS, NULL)\n\n# ifdef OPENSSL_LOAD_CONF\n# define OpenSSL_add_all_algorithms() OPENSSL_add_all_algorithms_conf()\n# else\n# define OpenSSL_add_all_algorithms() OPENSSL_add_all_algorithms_noconf()\n# endif\n\n# define OpenSSL_add_all_ciphers() \\\n OPENSSL_init_crypto(OPENSSL_INIT_ADD_ALL_CIPHERS, NULL)\n# define OpenSSL_add_all_digests() \\\n OPENSSL_init_crypto(OPENSSL_INIT_ADD_ALL_DIGESTS, NULL)\n\n# define EVP_cleanup() while(0) continue\n# endif\n\nint EVP_add_cipher(const EVP_CIPHER *cipher);\nint EVP_add_digest(const EVP_MD *digest);\n\nconst EVP_CIPHER *EVP_get_cipherbyname(const char *name);\nconst EVP_MD *EVP_get_digestbyname(const char *name);\n\nvoid EVP_CIPHER_do_all(void (*fn) (const EVP_CIPHER *ciph,\n const char *from, const char *to, void *x),\n void *arg);\nvoid EVP_CIPHER_do_all_sorted(void (*fn)\n (const EVP_CIPHER *ciph, const char *from,\n const char *to, void *x), void *arg);\n\nvoid EVP_MD_do_all(void (*fn) (const EVP_MD *ciph,\n const char *from, const char *to, void *x),\n void *arg);\nvoid EVP_MD_do_all_sorted(void (*fn)\n (const EVP_MD *ciph, const char *from,\n const char *to, void *x), void *arg);\n\nint EVP_PKEY_decrypt_old(unsigned char *dec_key,\n const unsigned char *enc_key, int enc_key_len,\n EVP_PKEY *private_key);\nint EVP_PKEY_encrypt_old(unsigned char *enc_key,\n const unsigned char *key, int key_len,\n EVP_PKEY *pub_key);\nint EVP_PKEY_type(int type);\nint EVP_PKEY_id(const EVP_PKEY *pkey);\nint EVP_PKEY_base_id(const EVP_PKEY *pkey);\nint EVP_PKEY_bits(const EVP_PKEY *pkey);\nint EVP_PKEY_security_bits(const EVP_PKEY *pkey);\nint EVP_PKEY_size(const EVP_PKEY *pkey);\nint EVP_PKEY_set_type(EVP_PKEY *pkey, int type);\nint EVP_PKEY_set_type_str(EVP_PKEY *pkey, const char *str, int len);\nint EVP_PKEY_set_alias_type(EVP_PKEY *pkey, int type);\n# ifndef OPENSSL_NO_ENGINE\nint EVP_PKEY_set1_engine(EVP_PKEY *pkey, ENGINE *e);\nENGINE *EVP_PKEY_get0_engine(const EVP_PKEY *pkey);\n# endif\nint EVP_PKEY_assign(EVP_PKEY *pkey, int type, void *key);\nvoid *EVP_PKEY_get0(const EVP_PKEY *pkey);\nconst unsigned char *EVP_PKEY_get0_hmac(const EVP_PKEY *pkey, size_t *len);\n# ifndef OPENSSL_NO_POLY1305\nconst unsigned char *EVP_PKEY_get0_poly1305(const EVP_PKEY *pkey, size_t *len);\n# endif\n# ifndef OPENSSL_NO_SIPHASH\nconst unsigned char *EVP_PKEY_get0_siphash(const EVP_PKEY *pkey, size_t *len);\n# endif\n\n# ifndef OPENSSL_NO_RSA\nstruct rsa_st;\nint EVP_PKEY_set1_RSA(EVP_PKEY *pkey, struct rsa_st *key);\nstruct rsa_st *EVP_PKEY_get0_RSA(EVP_PKEY *pkey);\nstruct rsa_st *EVP_PKEY_get1_RSA(EVP_PKEY *pkey);\n# endif\n# ifndef OPENSSL_NO_DSA\nstruct dsa_st;\nint EVP_PKEY_set1_DSA(EVP_PKEY *pkey, struct dsa_st *key);\nstruct dsa_st *EVP_PKEY_get0_DSA(EVP_PKEY *pkey);\nstruct dsa_st *EVP_PKEY_get1_DSA(EVP_PKEY *pkey);\n# endif\n# ifndef OPENSSL_NO_DH\nstruct dh_st;\nint EVP_PKEY_set1_DH(EVP_PKEY *pkey, struct dh_st *key);\nstruct dh_st *EVP_PKEY_get0_DH(EVP_PKEY *pkey);\nstruct dh_st *EVP_PKEY_get1_DH(EVP_PKEY *pkey);\n# endif\n# ifndef OPENSSL_NO_EC\nstruct ec_key_st;\nint EVP_PKEY_set1_EC_KEY(EVP_PKEY *pkey, struct ec_key_st *key);\nstruct ec_key_st *EVP_PKEY_get0_EC_KEY(EVP_PKEY *pkey);\nstruct ec_key_st *EVP_PKEY_get1_EC_KEY(EVP_PKEY *pkey);\n# endif\n\nEVP_PKEY *EVP_PKEY_new(void);\nint EVP_PKEY_up_ref(EVP_PKEY *pkey);\nvoid EVP_PKEY_free(EVP_PKEY *pkey);\n\nEVP_PKEY *d2i_PublicKey(int type, EVP_PKEY **a, const unsigned char **pp,\n long length);\nint i2d_PublicKey(EVP_PKEY *a, unsigned char **pp);\n\nEVP_PKEY *d2i_PrivateKey(int type, EVP_PKEY **a, const unsigned char **pp,\n long length);\nEVP_PKEY *d2i_AutoPrivateKey(EVP_PKEY **a, const unsigned char **pp,\n long length);\nint i2d_PrivateKey(EVP_PKEY *a, unsigned char **pp);\n\nint EVP_PKEY_copy_parameters(EVP_PKEY *to, const EVP_PKEY *from);\nint EVP_PKEY_missing_parameters(const EVP_PKEY *pkey);\nint EVP_PKEY_save_parameters(EVP_PKEY *pkey, int mode);\nint EVP_PKEY_cmp_parameters(const EVP_PKEY *a, const EVP_PKEY *b);\n\nint EVP_PKEY_cmp(const EVP_PKEY *a, const EVP_PKEY *b);\n\nint EVP_PKEY_print_public(BIO *out, const EVP_PKEY *pkey,\n int indent, ASN1_PCTX *pctx);\nint EVP_PKEY_print_private(BIO *out, const EVP_PKEY *pkey,\n int indent, ASN1_PCTX *pctx);\nint EVP_PKEY_print_params(BIO *out, const EVP_PKEY *pkey,\n int indent, ASN1_PCTX *pctx);\n\nint EVP_PKEY_get_default_digest_nid(EVP_PKEY *pkey, int *pnid);\n\nint EVP_PKEY_set1_tls_encodedpoint(EVP_PKEY *pkey,\n const unsigned char *pt, size_t ptlen);\nsize_t EVP_PKEY_get1_tls_encodedpoint(EVP_PKEY *pkey, unsigned char **ppt);\n\nint EVP_CIPHER_type(const EVP_CIPHER *ctx);\n\n/* calls methods */\nint EVP_CIPHER_param_to_asn1(EVP_CIPHER_CTX *c, ASN1_TYPE *type);\nint EVP_CIPHER_asn1_to_param(EVP_CIPHER_CTX *c, ASN1_TYPE *type);\n\n/* These are used by EVP_CIPHER methods */\nint EVP_CIPHER_set_asn1_iv(EVP_CIPHER_CTX *c, ASN1_TYPE *type);\nint EVP_CIPHER_get_asn1_iv(EVP_CIPHER_CTX *c, ASN1_TYPE *type);\n\n/* PKCS5 password based encryption */\nint PKCS5_PBE_keyivgen(EVP_CIPHER_CTX *ctx, const char *pass, int passlen,\n ASN1_TYPE *param, const EVP_CIPHER *cipher,\n const EVP_MD *md, int en_de);\nint PKCS5_PBKDF2_HMAC_SHA1(const char *pass, int passlen,\n const unsigned char *salt, int saltlen, int iter,\n int keylen, unsigned char *out);\nint PKCS5_PBKDF2_HMAC(const char *pass, int passlen,\n const unsigned char *salt, int saltlen, int iter,\n const EVP_MD *digest, int keylen, unsigned char *out);\nint PKCS5_v2_PBE_keyivgen(EVP_CIPHER_CTX *ctx, const char *pass, int passlen,\n ASN1_TYPE *param, const EVP_CIPHER *cipher,\n const EVP_MD *md, int en_de);\n\n#ifndef OPENSSL_NO_SCRYPT\nint EVP_PBE_scrypt(const char *pass, size_t passlen,\n const unsigned char *salt, size_t saltlen,\n uint64_t N, uint64_t r, uint64_t p, uint64_t maxmem,\n unsigned char *key, size_t keylen);\n\nint PKCS5_v2_scrypt_keyivgen(EVP_CIPHER_CTX *ctx, const char *pass,\n int passlen, ASN1_TYPE *param,\n const EVP_CIPHER *c, const EVP_MD *md, int en_de);\n#endif\n\nvoid PKCS5_PBE_add(void);\n\nint EVP_PBE_CipherInit(ASN1_OBJECT *pbe_obj, const char *pass, int passlen,\n ASN1_TYPE *param, EVP_CIPHER_CTX *ctx, int en_de);\n\n/* PBE type */\n\n/* Can appear as the outermost AlgorithmIdentifier */\n# define EVP_PBE_TYPE_OUTER 0x0\n/* Is an PRF type OID */\n# define EVP_PBE_TYPE_PRF 0x1\n/* Is a PKCS#5 v2.0 KDF */\n# define EVP_PBE_TYPE_KDF 0x2\n\nint EVP_PBE_alg_add_type(int pbe_type, int pbe_nid, int cipher_nid,\n int md_nid, EVP_PBE_KEYGEN *keygen);\nint EVP_PBE_alg_add(int nid, const EVP_CIPHER *cipher, const EVP_MD *md,\n EVP_PBE_KEYGEN *keygen);\nint EVP_PBE_find(int type, int pbe_nid, int *pcnid, int *pmnid,\n EVP_PBE_KEYGEN **pkeygen);\nvoid EVP_PBE_cleanup(void);\nint EVP_PBE_get(int *ptype, int *ppbe_nid, size_t num);\n\n# define ASN1_PKEY_ALIAS 0x1\n# define ASN1_PKEY_DYNAMIC 0x2\n# define ASN1_PKEY_SIGPARAM_NULL 0x4\n\n# define ASN1_PKEY_CTRL_PKCS7_SIGN 0x1\n# define ASN1_PKEY_CTRL_PKCS7_ENCRYPT 0x2\n# define ASN1_PKEY_CTRL_DEFAULT_MD_NID 0x3\n# define ASN1_PKEY_CTRL_CMS_SIGN 0x5\n# define ASN1_PKEY_CTRL_CMS_ENVELOPE 0x7\n# define ASN1_PKEY_CTRL_CMS_RI_TYPE 0x8\n\n# define ASN1_PKEY_CTRL_SET1_TLS_ENCPT 0x9\n# define ASN1_PKEY_CTRL_GET1_TLS_ENCPT 0xa\n\nint EVP_PKEY_asn1_get_count(void);\nconst EVP_PKEY_ASN1_METHOD *EVP_PKEY_asn1_get0(int idx);\nconst EVP_PKEY_ASN1_METHOD *EVP_PKEY_asn1_find(ENGINE **pe, int type);\nconst EVP_PKEY_ASN1_METHOD *EVP_PKEY_asn1_find_str(ENGINE **pe,\n const char *str, int len);\nint EVP_PKEY_asn1_add0(const EVP_PKEY_ASN1_METHOD *ameth);\nint EVP_PKEY_asn1_add_alias(int to, int from);\nint EVP_PKEY_asn1_get0_info(int *ppkey_id, int *pkey_base_id,\n int *ppkey_flags, const char **pinfo,\n const char **ppem_str,\n const EVP_PKEY_ASN1_METHOD *ameth);\n\nconst EVP_PKEY_ASN1_METHOD *EVP_PKEY_get0_asn1(const EVP_PKEY *pkey);\nEVP_PKEY_ASN1_METHOD *EVP_PKEY_asn1_new(int id, int flags,\n const char *pem_str,\n const char *info);\nvoid EVP_PKEY_asn1_copy(EVP_PKEY_ASN1_METHOD *dst,\n const EVP_PKEY_ASN1_METHOD *src);\nvoid EVP_PKEY_asn1_free(EVP_PKEY_ASN1_METHOD *ameth);\nvoid EVP_PKEY_asn1_set_public(EVP_PKEY_ASN1_METHOD *ameth,\n int (*pub_decode) (EVP_PKEY *pk,\n X509_PUBKEY *pub),\n int (*pub_encode) (X509_PUBKEY *pub,\n const EVP_PKEY *pk),\n int (*pub_cmp) (const EVP_PKEY *a,\n const EVP_PKEY *b),\n int (*pub_print) (BIO *out,\n const EVP_PKEY *pkey,\n int indent, ASN1_PCTX *pctx),\n int (*pkey_size) (const EVP_PKEY *pk),\n int (*pkey_bits) (const EVP_PKEY *pk));\nvoid EVP_PKEY_asn1_set_private(EVP_PKEY_ASN1_METHOD *ameth,\n int (*priv_decode) (EVP_PKEY *pk,\n const PKCS8_PRIV_KEY_INFO\n *p8inf),\n int (*priv_encode) (PKCS8_PRIV_KEY_INFO *p8,\n const EVP_PKEY *pk),\n int (*priv_print) (BIO *out,\n const EVP_PKEY *pkey,\n int indent,\n ASN1_PCTX *pctx));\nvoid EVP_PKEY_asn1_set_param(EVP_PKEY_ASN1_METHOD *ameth,\n int (*param_decode) (EVP_PKEY *pkey,\n const unsigned char **pder,\n int derlen),\n int (*param_encode) (const EVP_PKEY *pkey,\n unsigned char **pder),\n int (*param_missing) (const EVP_PKEY *pk),\n int (*param_copy) (EVP_PKEY *to,\n const EVP_PKEY *from),\n int (*param_cmp) (const EVP_PKEY *a,\n const EVP_PKEY *b),\n int (*param_print) (BIO *out,\n const EVP_PKEY *pkey,\n int indent,\n ASN1_PCTX *pctx));\n\nvoid EVP_PKEY_asn1_set_free(EVP_PKEY_ASN1_METHOD *ameth,\n void (*pkey_free) (EVP_PKEY *pkey));\nvoid EVP_PKEY_asn1_set_ctrl(EVP_PKEY_ASN1_METHOD *ameth,\n int (*pkey_ctrl) (EVP_PKEY *pkey, int op,\n long arg1, void *arg2));\nvoid EVP_PKEY_asn1_set_item(EVP_PKEY_ASN1_METHOD *ameth,\n int (*item_verify) (EVP_MD_CTX *ctx,\n const ASN1_ITEM *it,\n void *asn,\n X509_ALGOR *a,\n ASN1_BIT_STRING *sig,\n EVP_PKEY *pkey),\n int (*item_sign) (EVP_MD_CTX *ctx,\n const ASN1_ITEM *it,\n void *asn,\n X509_ALGOR *alg1,\n X509_ALGOR *alg2,\n ASN1_BIT_STRING *sig));\n\nvoid EVP_PKEY_asn1_set_siginf(EVP_PKEY_ASN1_METHOD *ameth,\n int (*siginf_set) (X509_SIG_INFO *siginf,\n const X509_ALGOR *alg,\n const ASN1_STRING *sig));\n\nvoid EVP_PKEY_asn1_set_check(EVP_PKEY_ASN1_METHOD *ameth,\n int (*pkey_check) (const EVP_PKEY *pk));\n\nvoid EVP_PKEY_asn1_set_public_check(EVP_PKEY_ASN1_METHOD *ameth,\n int (*pkey_pub_check) (const EVP_PKEY *pk));\n\nvoid EVP_PKEY_asn1_set_param_check(EVP_PKEY_ASN1_METHOD *ameth,\n int (*pkey_param_check) (const EVP_PKEY *pk));\n\nvoid EVP_PKEY_asn1_set_set_priv_key(EVP_PKEY_ASN1_METHOD *ameth,\n int (*set_priv_key) (EVP_PKEY *pk,\n const unsigned char\n *priv,\n size_t len));\nvoid EVP_PKEY_asn1_set_set_pub_key(EVP_PKEY_ASN1_METHOD *ameth,\n int (*set_pub_key) (EVP_PKEY *pk,\n const unsigned char *pub,\n size_t len));\nvoid EVP_PKEY_asn1_set_get_priv_key(EVP_PKEY_ASN1_METHOD *ameth,\n int (*get_priv_key) (const EVP_PKEY *pk,\n unsigned char *priv,\n size_t *len));\nvoid EVP_PKEY_asn1_set_get_pub_key(EVP_PKEY_ASN1_METHOD *ameth,\n int (*get_pub_key) (const EVP_PKEY *pk,\n unsigned char *pub,\n size_t *len));\n\nvoid EVP_PKEY_asn1_set_security_bits(EVP_PKEY_ASN1_METHOD *ameth,\n int (*pkey_security_bits) (const EVP_PKEY\n *pk));\n\n# define EVP_PKEY_OP_UNDEFINED 0\n# define EVP_PKEY_OP_PARAMGEN (1<<1)\n# define EVP_PKEY_OP_KEYGEN (1<<2)\n# define EVP_PKEY_OP_SIGN (1<<3)\n# define EVP_PKEY_OP_VERIFY (1<<4)\n# define EVP_PKEY_OP_VERIFYRECOVER (1<<5)\n# define EVP_PKEY_OP_SIGNCTX (1<<6)\n# define EVP_PKEY_OP_VERIFYCTX (1<<7)\n# define EVP_PKEY_OP_ENCRYPT (1<<8)\n# define EVP_PKEY_OP_DECRYPT (1<<9)\n# define EVP_PKEY_OP_DERIVE (1<<10)\n\n# define EVP_PKEY_OP_TYPE_SIG \\\n (EVP_PKEY_OP_SIGN | EVP_PKEY_OP_VERIFY | EVP_PKEY_OP_VERIFYRECOVER \\\n | EVP_PKEY_OP_SIGNCTX | EVP_PKEY_OP_VERIFYCTX)\n\n# define EVP_PKEY_OP_TYPE_CRYPT \\\n (EVP_PKEY_OP_ENCRYPT | EVP_PKEY_OP_DECRYPT)\n\n# define EVP_PKEY_OP_TYPE_NOGEN \\\n (EVP_PKEY_OP_TYPE_SIG | EVP_PKEY_OP_TYPE_CRYPT | EVP_PKEY_OP_DERIVE)\n\n# define EVP_PKEY_OP_TYPE_GEN \\\n (EVP_PKEY_OP_PARAMGEN | EVP_PKEY_OP_KEYGEN)\n\n# define EVP_PKEY_CTX_set_signature_md(ctx, md) \\\n EVP_PKEY_CTX_ctrl(ctx, -1, EVP_PKEY_OP_TYPE_SIG, \\\n EVP_PKEY_CTRL_MD, 0, (void *)(md))\n\n# define EVP_PKEY_CTX_get_signature_md(ctx, pmd) \\\n EVP_PKEY_CTX_ctrl(ctx, -1, EVP_PKEY_OP_TYPE_SIG, \\\n EVP_PKEY_CTRL_GET_MD, 0, (void *)(pmd))\n\n# define EVP_PKEY_CTX_set_mac_key(ctx, key, len) \\\n EVP_PKEY_CTX_ctrl(ctx, -1, EVP_PKEY_OP_KEYGEN, \\\n EVP_PKEY_CTRL_SET_MAC_KEY, len, (void *)(key))\n\n# define EVP_PKEY_CTRL_MD 1\n# define EVP_PKEY_CTRL_PEER_KEY 2\n\n# define EVP_PKEY_CTRL_PKCS7_ENCRYPT 3\n# define EVP_PKEY_CTRL_PKCS7_DECRYPT 4\n\n# define EVP_PKEY_CTRL_PKCS7_SIGN 5\n\n# define EVP_PKEY_CTRL_SET_MAC_KEY 6\n\n# define EVP_PKEY_CTRL_DIGESTINIT 7\n\n/* Used by GOST key encryption in TLS */\n# define EVP_PKEY_CTRL_SET_IV 8\n\n# define EVP_PKEY_CTRL_CMS_ENCRYPT 9\n# define EVP_PKEY_CTRL_CMS_DECRYPT 10\n# define EVP_PKEY_CTRL_CMS_SIGN 11\n\n# define EVP_PKEY_CTRL_CIPHER 12\n\n# define EVP_PKEY_CTRL_GET_MD 13\n\n# define EVP_PKEY_CTRL_SET_DIGEST_SIZE 14\n\n# define EVP_PKEY_ALG_CTRL 0x1000\n\n# define EVP_PKEY_FLAG_AUTOARGLEN 2\n/*\n * Method handles all operations: don't assume any digest related defaults.\n */\n# define EVP_PKEY_FLAG_SIGCTX_CUSTOM 4\n\nconst EVP_PKEY_METHOD *EVP_PKEY_meth_find(int type);\nEVP_PKEY_METHOD *EVP_PKEY_meth_new(int id, int flags);\nvoid EVP_PKEY_meth_get0_info(int *ppkey_id, int *pflags,\n const EVP_PKEY_METHOD *meth);\nvoid EVP_PKEY_meth_copy(EVP_PKEY_METHOD *dst, const EVP_PKEY_METHOD *src);\nvoid EVP_PKEY_meth_free(EVP_PKEY_METHOD *pmeth);\nint EVP_PKEY_meth_add0(const EVP_PKEY_METHOD *pmeth);\nint EVP_PKEY_meth_remove(const EVP_PKEY_METHOD *pmeth);\nsize_t EVP_PKEY_meth_get_count(void);\nconst EVP_PKEY_METHOD *EVP_PKEY_meth_get0(size_t idx);\n\nEVP_PKEY_CTX *EVP_PKEY_CTX_new(EVP_PKEY *pkey, ENGINE *e);\nEVP_PKEY_CTX *EVP_PKEY_CTX_new_id(int id, ENGINE *e);\nEVP_PKEY_CTX *EVP_PKEY_CTX_dup(EVP_PKEY_CTX *ctx);\nvoid EVP_PKEY_CTX_free(EVP_PKEY_CTX *ctx);\n\nint EVP_PKEY_CTX_ctrl(EVP_PKEY_CTX *ctx, int keytype, int optype,\n int cmd, int p1, void *p2);\nint EVP_PKEY_CTX_ctrl_str(EVP_PKEY_CTX *ctx, const char *type,\n const char *value);\nint EVP_PKEY_CTX_ctrl_uint64(EVP_PKEY_CTX *ctx, int keytype, int optype,\n int cmd, uint64_t value);\n\nint EVP_PKEY_CTX_str2ctrl(EVP_PKEY_CTX *ctx, int cmd, const char *str);\nint EVP_PKEY_CTX_hex2ctrl(EVP_PKEY_CTX *ctx, int cmd, const char *hex);\n\nint EVP_PKEY_CTX_md(EVP_PKEY_CTX *ctx, int optype, int cmd, const char *md);\n\nint EVP_PKEY_CTX_get_operation(EVP_PKEY_CTX *ctx);\nvoid EVP_PKEY_CTX_set0_keygen_info(EVP_PKEY_CTX *ctx, int *dat, int datlen);\n\nEVP_PKEY *EVP_PKEY_new_mac_key(int type, ENGINE *e,\n const unsigned char *key, int keylen);\nEVP_PKEY *EVP_PKEY_new_raw_private_key(int type, ENGINE *e,\n const unsigned char *priv,\n size_t len);\nEVP_PKEY *EVP_PKEY_new_raw_public_key(int type, ENGINE *e,\n const unsigned char *pub,\n size_t len);\nint EVP_PKEY_get_raw_private_key(const EVP_PKEY *pkey, unsigned char *priv,\n size_t *len);\nint EVP_PKEY_get_raw_public_key(const EVP_PKEY *pkey, unsigned char *pub,\n size_t *len);\n\nEVP_PKEY *EVP_PKEY_new_CMAC_key(ENGINE *e, const unsigned char *priv,\n size_t len, const EVP_CIPHER *cipher);\n\nvoid EVP_PKEY_CTX_set_data(EVP_PKEY_CTX *ctx, void *data);\nvoid *EVP_PKEY_CTX_get_data(EVP_PKEY_CTX *ctx);\nEVP_PKEY *EVP_PKEY_CTX_get0_pkey(EVP_PKEY_CTX *ctx);\n\nEVP_PKEY *EVP_PKEY_CTX_get0_peerkey(EVP_PKEY_CTX *ctx);\n\nvoid EVP_PKEY_CTX_set_app_data(EVP_PKEY_CTX *ctx, void *data);\nvoid *EVP_PKEY_CTX_get_app_data(EVP_PKEY_CTX *ctx);\n\nint EVP_PKEY_sign_init(EVP_PKEY_CTX *ctx);\nint EVP_PKEY_sign(EVP_PKEY_CTX *ctx,\n unsigned char *sig, size_t *siglen,\n const unsigned char *tbs, size_t tbslen);\nint EVP_PKEY_verify_init(EVP_PKEY_CTX *ctx);\nint EVP_PKEY_verify(EVP_PKEY_CTX *ctx,\n const unsigned char *sig, size_t siglen,\n const unsigned char *tbs, size_t tbslen);\nint EVP_PKEY_verify_recover_init(EVP_PKEY_CTX *ctx);\nint EVP_PKEY_verify_recover(EVP_PKEY_CTX *ctx,\n unsigned char *rout, size_t *routlen,\n const unsigned char *sig, size_t siglen);\nint EVP_PKEY_encrypt_init(EVP_PKEY_CTX *ctx);\nint EVP_PKEY_encrypt(EVP_PKEY_CTX *ctx,\n unsigned char *out, size_t *outlen,\n const unsigned char *in, size_t inlen);\nint EVP_PKEY_decrypt_init(EVP_PKEY_CTX *ctx);\nint EVP_PKEY_decrypt(EVP_PKEY_CTX *ctx,\n unsigned char *out, size_t *outlen,\n const unsigned char *in, size_t inlen);\n\nint EVP_PKEY_derive_init(EVP_PKEY_CTX *ctx);\nint EVP_PKEY_derive_set_peer(EVP_PKEY_CTX *ctx, EVP_PKEY *peer);\nint EVP_PKEY_derive(EVP_PKEY_CTX *ctx, unsigned char *key, size_t *keylen);\n\ntypedef int EVP_PKEY_gen_cb(EVP_PKEY_CTX *ctx);\n\nint EVP_PKEY_paramgen_init(EVP_PKEY_CTX *ctx);\nint EVP_PKEY_paramgen(EVP_PKEY_CTX *ctx, EVP_PKEY **ppkey);\nint EVP_PKEY_keygen_init(EVP_PKEY_CTX *ctx);\nint EVP_PKEY_keygen(EVP_PKEY_CTX *ctx, EVP_PKEY **ppkey);\nint EVP_PKEY_check(EVP_PKEY_CTX *ctx);\nint EVP_PKEY_public_check(EVP_PKEY_CTX *ctx);\nint EVP_PKEY_param_check(EVP_PKEY_CTX *ctx);\n\nvoid EVP_PKEY_CTX_set_cb(EVP_PKEY_CTX *ctx, EVP_PKEY_gen_cb *cb);\nEVP_PKEY_gen_cb *EVP_PKEY_CTX_get_cb(EVP_PKEY_CTX *ctx);\n\nint EVP_PKEY_CTX_get_keygen_info(EVP_PKEY_CTX *ctx, int idx);\n\nvoid EVP_PKEY_meth_set_init(EVP_PKEY_METHOD *pmeth,\n int (*init) (EVP_PKEY_CTX *ctx));\n\nvoid EVP_PKEY_meth_set_copy(EVP_PKEY_METHOD *pmeth,\n int (*copy) (EVP_PKEY_CTX *dst,\n EVP_PKEY_CTX *src));\n\nvoid EVP_PKEY_meth_set_cleanup(EVP_PKEY_METHOD *pmeth,\n void (*cleanup) (EVP_PKEY_CTX *ctx));\n\nvoid EVP_PKEY_meth_set_paramgen(EVP_PKEY_METHOD *pmeth,\n int (*paramgen_init) (EVP_PKEY_CTX *ctx),\n int (*paramgen) (EVP_PKEY_CTX *ctx,\n EVP_PKEY *pkey));\n\nvoid EVP_PKEY_meth_set_keygen(EVP_PKEY_METHOD *pmeth,\n int (*keygen_init) (EVP_PKEY_CTX *ctx),\n int (*keygen) (EVP_PKEY_CTX *ctx,\n EVP_PKEY *pkey));\n\nvoid EVP_PKEY_meth_set_sign(EVP_PKEY_METHOD *pmeth,\n int (*sign_init) (EVP_PKEY_CTX *ctx),\n int (*sign) (EVP_PKEY_CTX *ctx,\n unsigned char *sig, size_t *siglen,\n const unsigned char *tbs,\n size_t tbslen));\n\nvoid EVP_PKEY_meth_set_verify(EVP_PKEY_METHOD *pmeth,\n int (*verify_init) (EVP_PKEY_CTX *ctx),\n int (*verify) (EVP_PKEY_CTX *ctx,\n const unsigned char *sig,\n size_t siglen,\n const unsigned char *tbs,\n size_t tbslen));\n\nvoid EVP_PKEY_meth_set_verify_recover(EVP_PKEY_METHOD *pmeth,\n int (*verify_recover_init) (EVP_PKEY_CTX\n *ctx),\n int (*verify_recover) (EVP_PKEY_CTX\n *ctx,\n unsigned char\n *sig,\n size_t *siglen,\n const unsigned\n char *tbs,\n size_t tbslen));\n\nvoid EVP_PKEY_meth_set_signctx(EVP_PKEY_METHOD *pmeth,\n int (*signctx_init) (EVP_PKEY_CTX *ctx,\n EVP_MD_CTX *mctx),\n int (*signctx) (EVP_PKEY_CTX *ctx,\n unsigned char *sig,\n size_t *siglen,\n EVP_MD_CTX *mctx));\n\nvoid EVP_PKEY_meth_set_verifyctx(EVP_PKEY_METHOD *pmeth,\n int (*verifyctx_init) (EVP_PKEY_CTX *ctx,\n EVP_MD_CTX *mctx),\n int (*verifyctx) (EVP_PKEY_CTX *ctx,\n const unsigned char *sig,\n int siglen,\n EVP_MD_CTX *mctx));\n\nvoid EVP_PKEY_meth_set_encrypt(EVP_PKEY_METHOD *pmeth,\n int (*encrypt_init) (EVP_PKEY_CTX *ctx),\n int (*encryptfn) (EVP_PKEY_CTX *ctx,\n unsigned char *out,\n size_t *outlen,\n const unsigned char *in,\n size_t inlen));\n\nvoid EVP_PKEY_meth_set_decrypt(EVP_PKEY_METHOD *pmeth,\n int (*decrypt_init) (EVP_PKEY_CTX *ctx),\n int (*decrypt) (EVP_PKEY_CTX *ctx,\n unsigned char *out,\n size_t *outlen,\n const unsigned char *in,\n size_t inlen));\n\nvoid EVP_PKEY_meth_set_derive(EVP_PKEY_METHOD *pmeth,\n int (*derive_init) (EVP_PKEY_CTX *ctx),\n int (*derive) (EVP_PKEY_CTX *ctx,\n unsigned char *key,\n size_t *keylen));\n\nvoid EVP_PKEY_meth_set_ctrl(EVP_PKEY_METHOD *pmeth,\n int (*ctrl) (EVP_PKEY_CTX *ctx, int type, int p1,\n void *p2),\n int (*ctrl_str) (EVP_PKEY_CTX *ctx,\n const char *type,\n const char *value));\n\nvoid EVP_PKEY_meth_set_digestsign(EVP_PKEY_METHOD *pmeth,\n int (*digestsign) (EVP_MD_CTX *ctx,\n unsigned char *sig,\n size_t *siglen,\n const unsigned char *tbs,\n size_t tbslen));\n\nvoid EVP_PKEY_meth_set_digestverify(EVP_PKEY_METHOD *pmeth,\n int (*digestverify) (EVP_MD_CTX *ctx,\n const unsigned char *sig,\n size_t siglen,\n const unsigned char *tbs,\n size_t tbslen));\n\nvoid EVP_PKEY_meth_set_check(EVP_PKEY_METHOD *pmeth,\n int (*check) (EVP_PKEY *pkey));\n\nvoid EVP_PKEY_meth_set_public_check(EVP_PKEY_METHOD *pmeth,\n int (*check) (EVP_PKEY *pkey));\n\nvoid EVP_PKEY_meth_set_param_check(EVP_PKEY_METHOD *pmeth,\n int (*check) (EVP_PKEY *pkey));\n\nvoid EVP_PKEY_meth_set_digest_custom(EVP_PKEY_METHOD *pmeth,\n int (*digest_custom) (EVP_PKEY_CTX *ctx,\n EVP_MD_CTX *mctx));\n\nvoid EVP_PKEY_meth_get_init(const EVP_PKEY_METHOD *pmeth,\n int (**pinit) (EVP_PKEY_CTX *ctx));\n\nvoid EVP_PKEY_meth_get_copy(const EVP_PKEY_METHOD *pmeth,\n int (**pcopy) (EVP_PKEY_CTX *dst,\n EVP_PKEY_CTX *src));\n\nvoid EVP_PKEY_meth_get_cleanup(const EVP_PKEY_METHOD *pmeth,\n void (**pcleanup) (EVP_PKEY_CTX *ctx));\n\nvoid EVP_PKEY_meth_get_paramgen(const EVP_PKEY_METHOD *pmeth,\n int (**pparamgen_init) (EVP_PKEY_CTX *ctx),\n int (**pparamgen) (EVP_PKEY_CTX *ctx,\n EVP_PKEY *pkey));\n\nvoid EVP_PKEY_meth_get_keygen(const EVP_PKEY_METHOD *pmeth,\n int (**pkeygen_init) (EVP_PKEY_CTX *ctx),\n int (**pkeygen) (EVP_PKEY_CTX *ctx,\n EVP_PKEY *pkey));\n\nvoid EVP_PKEY_meth_get_sign(const EVP_PKEY_METHOD *pmeth,\n int (**psign_init) (EVP_PKEY_CTX *ctx),\n int (**psign) (EVP_PKEY_CTX *ctx,\n unsigned char *sig, size_t *siglen,\n const unsigned char *tbs,\n size_t tbslen));\n\nvoid EVP_PKEY_meth_get_verify(const EVP_PKEY_METHOD *pmeth,\n int (**pverify_init) (EVP_PKEY_CTX *ctx),\n int (**pverify) (EVP_PKEY_CTX *ctx,\n const unsigned char *sig,\n size_t siglen,\n const unsigned char *tbs,\n size_t tbslen));\n\nvoid EVP_PKEY_meth_get_verify_recover(const EVP_PKEY_METHOD *pmeth,\n int (**pverify_recover_init) (EVP_PKEY_CTX\n *ctx),\n int (**pverify_recover) (EVP_PKEY_CTX\n *ctx,\n unsigned char\n *sig,\n size_t *siglen,\n const unsigned\n char *tbs,\n size_t tbslen));\n\nvoid EVP_PKEY_meth_get_signctx(const EVP_PKEY_METHOD *pmeth,\n int (**psignctx_init) (EVP_PKEY_CTX *ctx,\n EVP_MD_CTX *mctx),\n int (**psignctx) (EVP_PKEY_CTX *ctx,\n unsigned char *sig,\n size_t *siglen,\n EVP_MD_CTX *mctx));\n\nvoid EVP_PKEY_meth_get_verifyctx(const EVP_PKEY_METHOD *pmeth,\n int (**pverifyctx_init) (EVP_PKEY_CTX *ctx,\n EVP_MD_CTX *mctx),\n int (**pverifyctx) (EVP_PKEY_CTX *ctx,\n const unsigned char *sig,\n int siglen,\n EVP_MD_CTX *mctx));\n\nvoid EVP_PKEY_meth_get_encrypt(const EVP_PKEY_METHOD *pmeth,\n int (**pencrypt_init) (EVP_PKEY_CTX *ctx),\n int (**pencryptfn) (EVP_PKEY_CTX *ctx,\n unsigned char *out,\n size_t *outlen,\n const unsigned char *in,\n size_t inlen));\n\nvoid EVP_PKEY_meth_get_decrypt(const EVP_PKEY_METHOD *pmeth,\n int (**pdecrypt_init) (EVP_PKEY_CTX *ctx),\n int (**pdecrypt) (EVP_PKEY_CTX *ctx,\n unsigned char *out,\n size_t *outlen,\n const unsigned char *in,\n size_t inlen));\n\nvoid EVP_PKEY_meth_get_derive(const EVP_PKEY_METHOD *pmeth,\n int (**pderive_init) (EVP_PKEY_CTX *ctx),\n int (**pderive) (EVP_PKEY_CTX *ctx,\n unsigned char *key,\n size_t *keylen));\n\nvoid EVP_PKEY_meth_get_ctrl(const EVP_PKEY_METHOD *pmeth,\n int (**pctrl) (EVP_PKEY_CTX *ctx, int type, int p1,\n void *p2),\n int (**pctrl_str) (EVP_PKEY_CTX *ctx,\n const char *type,\n const char *value));\n\nvoid EVP_PKEY_meth_get_digestsign(EVP_PKEY_METHOD *pmeth,\n int (**digestsign) (EVP_MD_CTX *ctx,\n unsigned char *sig,\n size_t *siglen,\n const unsigned char *tbs,\n size_t tbslen));\n\nvoid EVP_PKEY_meth_get_digestverify(EVP_PKEY_METHOD *pmeth,\n int (**digestverify) (EVP_MD_CTX *ctx,\n const unsigned char *sig,\n size_t siglen,\n const unsigned char *tbs,\n size_t tbslen));\n\nvoid EVP_PKEY_meth_get_check(const EVP_PKEY_METHOD *pmeth,\n int (**pcheck) (EVP_PKEY *pkey));\n\nvoid EVP_PKEY_meth_get_public_check(const EVP_PKEY_METHOD *pmeth,\n int (**pcheck) (EVP_PKEY *pkey));\n\nvoid EVP_PKEY_meth_get_param_check(const EVP_PKEY_METHOD *pmeth,\n int (**pcheck) (EVP_PKEY *pkey));\n\nvoid EVP_PKEY_meth_get_digest_custom(EVP_PKEY_METHOD *pmeth,\n int (**pdigest_custom) (EVP_PKEY_CTX *ctx,\n EVP_MD_CTX *mctx));\nvoid EVP_add_alg_module(void);\n\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/evperr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2021 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_EVPERR_H\n# define HEADER_EVPERR_H\n\n# include \n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_EVP_strings(void);\n\n/*\n * EVP function codes.\n */\n# define EVP_F_AESNI_INIT_KEY 165\n# define EVP_F_AESNI_XTS_INIT_KEY 207\n# define EVP_F_AES_GCM_CTRL 196\n# define EVP_F_AES_INIT_KEY 133\n# define EVP_F_AES_OCB_CIPHER 169\n# define EVP_F_AES_T4_INIT_KEY 178\n# define EVP_F_AES_T4_XTS_INIT_KEY 208\n# define EVP_F_AES_WRAP_CIPHER 170\n# define EVP_F_AES_XTS_INIT_KEY 209\n# define EVP_F_ALG_MODULE_INIT 177\n# define EVP_F_ARIA_CCM_INIT_KEY 175\n# define EVP_F_ARIA_GCM_CTRL 197\n# define EVP_F_ARIA_GCM_INIT_KEY 176\n# define EVP_F_ARIA_INIT_KEY 185\n# define EVP_F_B64_NEW 198\n# define EVP_F_CAMELLIA_INIT_KEY 159\n# define EVP_F_CHACHA20_POLY1305_CTRL 182\n# define EVP_F_CMLL_T4_INIT_KEY 179\n# define EVP_F_DES_EDE3_WRAP_CIPHER 171\n# define EVP_F_DO_SIGVER_INIT 161\n# define EVP_F_ENC_NEW 199\n# define EVP_F_EVP_CIPHERINIT_EX 123\n# define EVP_F_EVP_CIPHER_ASN1_TO_PARAM 204\n# define EVP_F_EVP_CIPHER_CTX_COPY 163\n# define EVP_F_EVP_CIPHER_CTX_CTRL 124\n# define EVP_F_EVP_CIPHER_CTX_SET_KEY_LENGTH 122\n# define EVP_F_EVP_CIPHER_PARAM_TO_ASN1 205\n# define EVP_F_EVP_DECRYPTFINAL_EX 101\n# define EVP_F_EVP_DECRYPTUPDATE 166\n# define EVP_F_EVP_DIGESTFINALXOF 174\n# define EVP_F_EVP_DIGESTINIT_EX 128\n# define EVP_F_EVP_ENCRYPTDECRYPTUPDATE 219\n# define EVP_F_EVP_ENCRYPTFINAL_EX 127\n# define EVP_F_EVP_ENCRYPTUPDATE 167\n# define EVP_F_EVP_MD_CTX_COPY_EX 110\n# define EVP_F_EVP_MD_SIZE 162\n# define EVP_F_EVP_OPENINIT 102\n# define EVP_F_EVP_PBE_ALG_ADD 115\n# define EVP_F_EVP_PBE_ALG_ADD_TYPE 160\n# define EVP_F_EVP_PBE_CIPHERINIT 116\n# define EVP_F_EVP_PBE_SCRYPT 181\n# define EVP_F_EVP_PKCS82PKEY 111\n# define EVP_F_EVP_PKEY2PKCS8 113\n# define EVP_F_EVP_PKEY_ASN1_ADD0 188\n# define EVP_F_EVP_PKEY_CHECK 186\n# define EVP_F_EVP_PKEY_COPY_PARAMETERS 103\n# define EVP_F_EVP_PKEY_CTX_CTRL 137\n# define EVP_F_EVP_PKEY_CTX_CTRL_STR 150\n# define EVP_F_EVP_PKEY_CTX_DUP 156\n# define EVP_F_EVP_PKEY_CTX_MD 168\n# define EVP_F_EVP_PKEY_DECRYPT 104\n# define EVP_F_EVP_PKEY_DECRYPT_INIT 138\n# define EVP_F_EVP_PKEY_DECRYPT_OLD 151\n# define EVP_F_EVP_PKEY_DERIVE 153\n# define EVP_F_EVP_PKEY_DERIVE_INIT 154\n# define EVP_F_EVP_PKEY_DERIVE_SET_PEER 155\n# define EVP_F_EVP_PKEY_ENCRYPT 105\n# define EVP_F_EVP_PKEY_ENCRYPT_INIT 139\n# define EVP_F_EVP_PKEY_ENCRYPT_OLD 152\n# define EVP_F_EVP_PKEY_GET0_DH 119\n# define EVP_F_EVP_PKEY_GET0_DSA 120\n# define EVP_F_EVP_PKEY_GET0_EC_KEY 131\n# define EVP_F_EVP_PKEY_GET0_HMAC 183\n# define EVP_F_EVP_PKEY_GET0_POLY1305 184\n# define EVP_F_EVP_PKEY_GET0_RSA 121\n# define EVP_F_EVP_PKEY_GET0_SIPHASH 172\n# define EVP_F_EVP_PKEY_GET_RAW_PRIVATE_KEY 202\n# define EVP_F_EVP_PKEY_GET_RAW_PUBLIC_KEY 203\n# define EVP_F_EVP_PKEY_KEYGEN 146\n# define EVP_F_EVP_PKEY_KEYGEN_INIT 147\n# define EVP_F_EVP_PKEY_METH_ADD0 194\n# define EVP_F_EVP_PKEY_METH_NEW 195\n# define EVP_F_EVP_PKEY_NEW 106\n# define EVP_F_EVP_PKEY_NEW_CMAC_KEY 193\n# define EVP_F_EVP_PKEY_NEW_RAW_PRIVATE_KEY 191\n# define EVP_F_EVP_PKEY_NEW_RAW_PUBLIC_KEY 192\n# define EVP_F_EVP_PKEY_PARAMGEN 148\n# define EVP_F_EVP_PKEY_PARAMGEN_INIT 149\n# define EVP_F_EVP_PKEY_PARAM_CHECK 189\n# define EVP_F_EVP_PKEY_PUBLIC_CHECK 190\n# define EVP_F_EVP_PKEY_SET1_ENGINE 187\n# define EVP_F_EVP_PKEY_SET_ALIAS_TYPE 206\n# define EVP_F_EVP_PKEY_SIGN 140\n# define EVP_F_EVP_PKEY_SIGN_INIT 141\n# define EVP_F_EVP_PKEY_VERIFY 142\n# define EVP_F_EVP_PKEY_VERIFY_INIT 143\n# define EVP_F_EVP_PKEY_VERIFY_RECOVER 144\n# define EVP_F_EVP_PKEY_VERIFY_RECOVER_INIT 145\n# define EVP_F_EVP_SIGNFINAL 107\n# define EVP_F_EVP_VERIFYFINAL 108\n# define EVP_F_INT_CTX_NEW 157\n# define EVP_F_OK_NEW 200\n# define EVP_F_PKCS5_PBE_KEYIVGEN 117\n# define EVP_F_PKCS5_V2_PBE_KEYIVGEN 118\n# define EVP_F_PKCS5_V2_PBKDF2_KEYIVGEN 164\n# define EVP_F_PKCS5_V2_SCRYPT_KEYIVGEN 180\n# define EVP_F_PKEY_SET_TYPE 158\n# define EVP_F_RC2_MAGIC_TO_METH 109\n# define EVP_F_RC5_CTRL 125\n# define EVP_F_R_32_12_16_INIT_KEY 242\n# define EVP_F_S390X_AES_GCM_CTRL 201\n# define EVP_F_UPDATE 173\n\n/*\n * EVP reason codes.\n */\n# define EVP_R_AES_KEY_SETUP_FAILED 143\n# define EVP_R_ARIA_KEY_SETUP_FAILED 176\n# define EVP_R_BAD_DECRYPT 100\n# define EVP_R_BAD_KEY_LENGTH 195\n# define EVP_R_BUFFER_TOO_SMALL 155\n# define EVP_R_CAMELLIA_KEY_SETUP_FAILED 157\n# define EVP_R_CIPHER_PARAMETER_ERROR 122\n# define EVP_R_COMMAND_NOT_SUPPORTED 147\n# define EVP_R_COPY_ERROR 173\n# define EVP_R_CTRL_NOT_IMPLEMENTED 132\n# define EVP_R_CTRL_OPERATION_NOT_IMPLEMENTED 133\n# define EVP_R_DATA_NOT_MULTIPLE_OF_BLOCK_LENGTH 138\n# define EVP_R_DECODE_ERROR 114\n# define EVP_R_DIFFERENT_KEY_TYPES 101\n# define EVP_R_DIFFERENT_PARAMETERS 153\n# define EVP_R_ERROR_LOADING_SECTION 165\n# define EVP_R_ERROR_SETTING_FIPS_MODE 166\n# define EVP_R_EXPECTING_AN_HMAC_KEY 174\n# define EVP_R_EXPECTING_AN_RSA_KEY 127\n# define EVP_R_EXPECTING_A_DH_KEY 128\n# define EVP_R_EXPECTING_A_DSA_KEY 129\n# define EVP_R_EXPECTING_A_EC_KEY 142\n# define EVP_R_EXPECTING_A_POLY1305_KEY 164\n# define EVP_R_EXPECTING_A_SIPHASH_KEY 175\n# define EVP_R_FIPS_MODE_NOT_SUPPORTED 167\n# define EVP_R_GET_RAW_KEY_FAILED 182\n# define EVP_R_ILLEGAL_SCRYPT_PARAMETERS 171\n# define EVP_R_INITIALIZATION_ERROR 134\n# define EVP_R_INPUT_NOT_INITIALIZED 111\n# define EVP_R_INVALID_DIGEST 152\n# define EVP_R_INVALID_FIPS_MODE 168\n# define EVP_R_INVALID_IV_LENGTH 194\n# define EVP_R_INVALID_KEY 163\n# define EVP_R_INVALID_KEY_LENGTH 130\n# define EVP_R_INVALID_OPERATION 148\n# define EVP_R_KEYGEN_FAILURE 120\n# define EVP_R_KEY_SETUP_FAILED 180\n# define EVP_R_MEMORY_LIMIT_EXCEEDED 172\n# define EVP_R_MESSAGE_DIGEST_IS_NULL 159\n# define EVP_R_METHOD_NOT_SUPPORTED 144\n# define EVP_R_MISSING_PARAMETERS 103\n# define EVP_R_NOT_XOF_OR_INVALID_LENGTH 178\n# define EVP_R_NO_CIPHER_SET 131\n# define EVP_R_NO_DEFAULT_DIGEST 158\n# define EVP_R_NO_DIGEST_SET 139\n# define EVP_R_NO_KEY_SET 154\n# define EVP_R_NO_OPERATION_SET 149\n# define EVP_R_ONLY_ONESHOT_SUPPORTED 177\n# define EVP_R_OPERATION_NOT_SUPPORTED_FOR_THIS_KEYTYPE 150\n# define EVP_R_OPERATON_NOT_INITIALIZED 151\n# define EVP_R_OUTPUT_WOULD_OVERFLOW 184\n# define EVP_R_PARTIALLY_OVERLAPPING 162\n# define EVP_R_PBKDF2_ERROR 181\n# define EVP_R_PKEY_APPLICATION_ASN1_METHOD_ALREADY_REGISTERED 179\n# define EVP_R_PRIVATE_KEY_DECODE_ERROR 145\n# define EVP_R_PRIVATE_KEY_ENCODE_ERROR 146\n# define EVP_R_PUBLIC_KEY_NOT_RSA 106\n# define EVP_R_UNKNOWN_CIPHER 160\n# define EVP_R_UNKNOWN_DIGEST 161\n# define EVP_R_UNKNOWN_OPTION 169\n# define EVP_R_UNKNOWN_PBE_ALGORITHM 121\n# define EVP_R_UNSUPPORTED_ALGORITHM 156\n# define EVP_R_UNSUPPORTED_CIPHER 107\n# define EVP_R_UNSUPPORTED_KEYLENGTH 123\n# define EVP_R_UNSUPPORTED_KEY_DERIVATION_FUNCTION 124\n# define EVP_R_UNSUPPORTED_KEY_SIZE 108\n# define EVP_R_UNSUPPORTED_NUMBER_OF_ROUNDS 135\n# define EVP_R_UNSUPPORTED_PRF 125\n# define EVP_R_UNSUPPORTED_PRIVATE_KEY_ALGORITHM 118\n# define EVP_R_UNSUPPORTED_SALT_TYPE 126\n# define EVP_R_WRAP_MODE_NOT_ALLOWED 170\n# define EVP_R_WRONG_FINAL_BLOCK_LENGTH 109\n# define EVP_R_XTS_DUPLICATED_KEYS 183\n\n#endif\n" }, { "path": "cryptomini/include/openssl/hmac.h", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_HMAC_H\n# define HEADER_HMAC_H\n\n# include \n\n# include \n\n# if OPENSSL_API_COMPAT < 0x10200000L\n# define HMAC_MAX_MD_CBLOCK 128 /* Deprecated */\n# endif\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\nsize_t HMAC_size(const HMAC_CTX *e);\nHMAC_CTX *HMAC_CTX_new(void);\nint HMAC_CTX_reset(HMAC_CTX *ctx);\nvoid HMAC_CTX_free(HMAC_CTX *ctx);\n\nDEPRECATEDIN_1_1_0(__owur int HMAC_Init(HMAC_CTX *ctx, const void *key, int len,\n const EVP_MD *md))\n\n/*__owur*/ int HMAC_Init_ex(HMAC_CTX *ctx, const void *key, int len,\n const EVP_MD *md, ENGINE *impl);\n/*__owur*/ int HMAC_Update(HMAC_CTX *ctx, const unsigned char *data,\n size_t len);\n/*__owur*/ int HMAC_Final(HMAC_CTX *ctx, unsigned char *md,\n unsigned int *len);\nunsigned char *HMAC(const EVP_MD *evp_md, const void *key, int key_len,\n const unsigned char *d, size_t n, unsigned char *md,\n unsigned int *md_len);\n__owur int HMAC_CTX_copy(HMAC_CTX *dctx, HMAC_CTX *sctx);\n\nvoid HMAC_CTX_set_flags(HMAC_CTX *ctx, unsigned long flags);\nconst EVP_MD *HMAC_CTX_get_md(const HMAC_CTX *ctx);\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/idea.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_IDEA_H\n# define HEADER_IDEA_H\n\n# include \n\n# ifndef OPENSSL_NO_IDEA\n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\ntypedef unsigned int IDEA_INT;\n\n# define IDEA_ENCRYPT 1\n# define IDEA_DECRYPT 0\n\n# define IDEA_BLOCK 8\n# define IDEA_KEY_LENGTH 16\n\ntypedef struct idea_key_st {\n IDEA_INT data[9][6];\n} IDEA_KEY_SCHEDULE;\n\nconst char *IDEA_options(void);\nvoid IDEA_ecb_encrypt(const unsigned char *in, unsigned char *out,\n IDEA_KEY_SCHEDULE *ks);\nvoid IDEA_set_encrypt_key(const unsigned char *key, IDEA_KEY_SCHEDULE *ks);\nvoid IDEA_set_decrypt_key(IDEA_KEY_SCHEDULE *ek, IDEA_KEY_SCHEDULE *dk);\nvoid IDEA_cbc_encrypt(const unsigned char *in, unsigned char *out,\n long length, IDEA_KEY_SCHEDULE *ks, unsigned char *iv,\n int enc);\nvoid IDEA_cfb64_encrypt(const unsigned char *in, unsigned char *out,\n long length, IDEA_KEY_SCHEDULE *ks, unsigned char *iv,\n int *num, int enc);\nvoid IDEA_ofb64_encrypt(const unsigned char *in, unsigned char *out,\n long length, IDEA_KEY_SCHEDULE *ks, unsigned char *iv,\n int *num);\nvoid IDEA_encrypt(unsigned long *in, IDEA_KEY_SCHEDULE *ks);\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define idea_options IDEA_options\n# define idea_ecb_encrypt IDEA_ecb_encrypt\n# define idea_set_encrypt_key IDEA_set_encrypt_key\n# define idea_set_decrypt_key IDEA_set_decrypt_key\n# define idea_cbc_encrypt IDEA_cbc_encrypt\n# define idea_cfb64_encrypt IDEA_cfb64_encrypt\n# define idea_ofb64_encrypt IDEA_ofb64_encrypt\n# define idea_encrypt IDEA_encrypt\n# endif\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/kdf.h", "content": "/*\n * Copyright 2016-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_KDF_H\n# define HEADER_KDF_H\n\n# include \n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# define EVP_PKEY_CTRL_TLS_MD (EVP_PKEY_ALG_CTRL)\n# define EVP_PKEY_CTRL_TLS_SECRET (EVP_PKEY_ALG_CTRL + 1)\n# define EVP_PKEY_CTRL_TLS_SEED (EVP_PKEY_ALG_CTRL + 2)\n# define EVP_PKEY_CTRL_HKDF_MD (EVP_PKEY_ALG_CTRL + 3)\n# define EVP_PKEY_CTRL_HKDF_SALT (EVP_PKEY_ALG_CTRL + 4)\n# define EVP_PKEY_CTRL_HKDF_KEY (EVP_PKEY_ALG_CTRL + 5)\n# define EVP_PKEY_CTRL_HKDF_INFO (EVP_PKEY_ALG_CTRL + 6)\n# define EVP_PKEY_CTRL_HKDF_MODE (EVP_PKEY_ALG_CTRL + 7)\n# define EVP_PKEY_CTRL_PASS (EVP_PKEY_ALG_CTRL + 8)\n# define EVP_PKEY_CTRL_SCRYPT_SALT (EVP_PKEY_ALG_CTRL + 9)\n# define EVP_PKEY_CTRL_SCRYPT_N (EVP_PKEY_ALG_CTRL + 10)\n# define EVP_PKEY_CTRL_SCRYPT_R (EVP_PKEY_ALG_CTRL + 11)\n# define EVP_PKEY_CTRL_SCRYPT_P (EVP_PKEY_ALG_CTRL + 12)\n# define EVP_PKEY_CTRL_SCRYPT_MAXMEM_BYTES (EVP_PKEY_ALG_CTRL + 13)\n\n# define EVP_PKEY_HKDEF_MODE_EXTRACT_AND_EXPAND 0\n# define EVP_PKEY_HKDEF_MODE_EXTRACT_ONLY 1\n# define EVP_PKEY_HKDEF_MODE_EXPAND_ONLY 2\n\n# define EVP_PKEY_CTX_set_tls1_prf_md(pctx, md) \\\n EVP_PKEY_CTX_ctrl(pctx, -1, EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_TLS_MD, 0, (void *)(md))\n\n# define EVP_PKEY_CTX_set1_tls1_prf_secret(pctx, sec, seclen) \\\n EVP_PKEY_CTX_ctrl(pctx, -1, EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_TLS_SECRET, seclen, (void *)(sec))\n\n# define EVP_PKEY_CTX_add1_tls1_prf_seed(pctx, seed, seedlen) \\\n EVP_PKEY_CTX_ctrl(pctx, -1, EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_TLS_SEED, seedlen, (void *)(seed))\n\n# define EVP_PKEY_CTX_set_hkdf_md(pctx, md) \\\n EVP_PKEY_CTX_ctrl(pctx, -1, EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_HKDF_MD, 0, (void *)(md))\n\n# define EVP_PKEY_CTX_set1_hkdf_salt(pctx, salt, saltlen) \\\n EVP_PKEY_CTX_ctrl(pctx, -1, EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_HKDF_SALT, saltlen, (void *)(salt))\n\n# define EVP_PKEY_CTX_set1_hkdf_key(pctx, key, keylen) \\\n EVP_PKEY_CTX_ctrl(pctx, -1, EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_HKDF_KEY, keylen, (void *)(key))\n\n# define EVP_PKEY_CTX_add1_hkdf_info(pctx, info, infolen) \\\n EVP_PKEY_CTX_ctrl(pctx, -1, EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_HKDF_INFO, infolen, (void *)(info))\n\n# define EVP_PKEY_CTX_hkdf_mode(pctx, mode) \\\n EVP_PKEY_CTX_ctrl(pctx, -1, EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_HKDF_MODE, mode, NULL)\n\n# define EVP_PKEY_CTX_set1_pbe_pass(pctx, pass, passlen) \\\n EVP_PKEY_CTX_ctrl(pctx, -1, EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_PASS, passlen, (void *)(pass))\n\n# define EVP_PKEY_CTX_set1_scrypt_salt(pctx, salt, saltlen) \\\n EVP_PKEY_CTX_ctrl(pctx, -1, EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_SCRYPT_SALT, saltlen, (void *)(salt))\n\n# define EVP_PKEY_CTX_set_scrypt_N(pctx, n) \\\n EVP_PKEY_CTX_ctrl_uint64(pctx, -1, EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_SCRYPT_N, n)\n\n# define EVP_PKEY_CTX_set_scrypt_r(pctx, r) \\\n EVP_PKEY_CTX_ctrl_uint64(pctx, -1, EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_SCRYPT_R, r)\n\n# define EVP_PKEY_CTX_set_scrypt_p(pctx, p) \\\n EVP_PKEY_CTX_ctrl_uint64(pctx, -1, EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_SCRYPT_P, p)\n\n# define EVP_PKEY_CTX_set_scrypt_maxmem_bytes(pctx, maxmem_bytes) \\\n EVP_PKEY_CTX_ctrl_uint64(pctx, -1, EVP_PKEY_OP_DERIVE, \\\n EVP_PKEY_CTRL_SCRYPT_MAXMEM_BYTES, maxmem_bytes)\n\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/kdferr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_KDFERR_H\n# define HEADER_KDFERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_KDF_strings(void);\n\n/*\n * KDF function codes.\n */\n# define KDF_F_PKEY_HKDF_CTRL_STR 103\n# define KDF_F_PKEY_HKDF_DERIVE 102\n# define KDF_F_PKEY_HKDF_INIT 108\n# define KDF_F_PKEY_SCRYPT_CTRL_STR 104\n# define KDF_F_PKEY_SCRYPT_CTRL_UINT64 105\n# define KDF_F_PKEY_SCRYPT_DERIVE 109\n# define KDF_F_PKEY_SCRYPT_INIT 106\n# define KDF_F_PKEY_SCRYPT_SET_MEMBUF 107\n# define KDF_F_PKEY_TLS1_PRF_CTRL_STR 100\n# define KDF_F_PKEY_TLS1_PRF_DERIVE 101\n# define KDF_F_PKEY_TLS1_PRF_INIT 110\n# define KDF_F_TLS1_PRF_ALG 111\n\n/*\n * KDF reason codes.\n */\n# define KDF_R_INVALID_DIGEST 100\n# define KDF_R_MISSING_ITERATION_COUNT 109\n# define KDF_R_MISSING_KEY 104\n# define KDF_R_MISSING_MESSAGE_DIGEST 105\n# define KDF_R_MISSING_PARAMETER 101\n# define KDF_R_MISSING_PASS 110\n# define KDF_R_MISSING_SALT 111\n# define KDF_R_MISSING_SECRET 107\n# define KDF_R_MISSING_SEED 106\n# define KDF_R_UNKNOWN_PARAMETER_TYPE 103\n# define KDF_R_VALUE_ERROR 108\n# define KDF_R_VALUE_MISSING 102\n\n#endif\n" }, { "path": "cryptomini/include/openssl/lhash.h", "content": "/*\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * Header for dynamic hash table routines Author - Eric Young\n */\n\n#ifndef HEADER_LHASH_H\n# define HEADER_LHASH_H\n\n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\ntypedef struct lhash_node_st OPENSSL_LH_NODE;\ntypedef int (*OPENSSL_LH_COMPFUNC) (const void *, const void *);\ntypedef unsigned long (*OPENSSL_LH_HASHFUNC) (const void *);\ntypedef void (*OPENSSL_LH_DOALL_FUNC) (void *);\ntypedef void (*OPENSSL_LH_DOALL_FUNCARG) (void *, void *);\ntypedef struct lhash_st OPENSSL_LHASH;\n\n/*\n * Macros for declaring and implementing type-safe wrappers for LHASH\n * callbacks. This way, callbacks can be provided to LHASH structures without\n * function pointer casting and the macro-defined callbacks provide\n * per-variable casting before deferring to the underlying type-specific\n * callbacks. NB: It is possible to place a \"static\" in front of both the\n * DECLARE and IMPLEMENT macros if the functions are strictly internal.\n */\n\n/* First: \"hash\" functions */\n# define DECLARE_LHASH_HASH_FN(name, o_type) \\\n unsigned long name##_LHASH_HASH(const void *);\n# define IMPLEMENT_LHASH_HASH_FN(name, o_type) \\\n unsigned long name##_LHASH_HASH(const void *arg) { \\\n const o_type *a = arg; \\\n return name##_hash(a); }\n# define LHASH_HASH_FN(name) name##_LHASH_HASH\n\n/* Second: \"compare\" functions */\n# define DECLARE_LHASH_COMP_FN(name, o_type) \\\n int name##_LHASH_COMP(const void *, const void *);\n# define IMPLEMENT_LHASH_COMP_FN(name, o_type) \\\n int name##_LHASH_COMP(const void *arg1, const void *arg2) { \\\n const o_type *a = arg1; \\\n const o_type *b = arg2; \\\n return name##_cmp(a,b); }\n# define LHASH_COMP_FN(name) name##_LHASH_COMP\n\n/* Fourth: \"doall_arg\" functions */\n# define DECLARE_LHASH_DOALL_ARG_FN(name, o_type, a_type) \\\n void name##_LHASH_DOALL_ARG(void *, void *);\n# define IMPLEMENT_LHASH_DOALL_ARG_FN(name, o_type, a_type) \\\n void name##_LHASH_DOALL_ARG(void *arg1, void *arg2) { \\\n o_type *a = arg1; \\\n a_type *b = arg2; \\\n name##_doall_arg(a, b); }\n# define LHASH_DOALL_ARG_FN(name) name##_LHASH_DOALL_ARG\n\n\n# define LH_LOAD_MULT 256\n\nint OPENSSL_LH_error(OPENSSL_LHASH *lh);\nOPENSSL_LHASH *OPENSSL_LH_new(OPENSSL_LH_HASHFUNC h, OPENSSL_LH_COMPFUNC c);\nvoid OPENSSL_LH_free(OPENSSL_LHASH *lh);\nvoid *OPENSSL_LH_insert(OPENSSL_LHASH *lh, void *data);\nvoid *OPENSSL_LH_delete(OPENSSL_LHASH *lh, const void *data);\nvoid *OPENSSL_LH_retrieve(OPENSSL_LHASH *lh, const void *data);\nvoid OPENSSL_LH_doall(OPENSSL_LHASH *lh, OPENSSL_LH_DOALL_FUNC func);\nvoid OPENSSL_LH_doall_arg(OPENSSL_LHASH *lh, OPENSSL_LH_DOALL_FUNCARG func, void *arg);\nunsigned long OPENSSL_LH_strhash(const char *c);\nunsigned long OPENSSL_LH_num_items(const OPENSSL_LHASH *lh);\nunsigned long OPENSSL_LH_get_down_load(const OPENSSL_LHASH *lh);\nvoid OPENSSL_LH_set_down_load(OPENSSL_LHASH *lh, unsigned long down_load);\n\n# ifndef OPENSSL_NO_STDIO\nvoid OPENSSL_LH_stats(const OPENSSL_LHASH *lh, FILE *fp);\nvoid OPENSSL_LH_node_stats(const OPENSSL_LHASH *lh, FILE *fp);\nvoid OPENSSL_LH_node_usage_stats(const OPENSSL_LHASH *lh, FILE *fp);\n# endif\nvoid OPENSSL_LH_stats_bio(const OPENSSL_LHASH *lh, BIO *out);\nvoid OPENSSL_LH_node_stats_bio(const OPENSSL_LHASH *lh, BIO *out);\nvoid OPENSSL_LH_node_usage_stats_bio(const OPENSSL_LHASH *lh, BIO *out);\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define _LHASH OPENSSL_LHASH\n# define LHASH_NODE OPENSSL_LH_NODE\n# define lh_error OPENSSL_LH_error\n# define lh_new OPENSSL_LH_new\n# define lh_free OPENSSL_LH_free\n# define lh_insert OPENSSL_LH_insert\n# define lh_delete OPENSSL_LH_delete\n# define lh_retrieve OPENSSL_LH_retrieve\n# define lh_doall OPENSSL_LH_doall\n# define lh_doall_arg OPENSSL_LH_doall_arg\n# define lh_strhash OPENSSL_LH_strhash\n# define lh_num_items OPENSSL_LH_num_items\n# ifndef OPENSSL_NO_STDIO\n# define lh_stats OPENSSL_LH_stats\n# define lh_node_stats OPENSSL_LH_node_stats\n# define lh_node_usage_stats OPENSSL_LH_node_usage_stats\n# endif\n# define lh_stats_bio OPENSSL_LH_stats_bio\n# define lh_node_stats_bio OPENSSL_LH_node_stats_bio\n# define lh_node_usage_stats_bio OPENSSL_LH_node_usage_stats_bio\n# endif\n\n/* Type checking... */\n\n# define LHASH_OF(type) struct lhash_st_##type\n\n# define DEFINE_LHASH_OF(type) \\\n LHASH_OF(type) { union lh_##type##_dummy { void* d1; unsigned long d2; int d3; } dummy; }; \\\n static ossl_unused ossl_inline LHASH_OF(type) *lh_##type##_new(unsigned long (*hfn)(const type *), \\\n int (*cfn)(const type *, const type *)) \\\n { \\\n return (LHASH_OF(type) *) \\\n OPENSSL_LH_new((OPENSSL_LH_HASHFUNC)hfn, (OPENSSL_LH_COMPFUNC)cfn); \\\n } \\\n static ossl_unused ossl_inline void lh_##type##_free(LHASH_OF(type) *lh) \\\n { \\\n OPENSSL_LH_free((OPENSSL_LHASH *)lh); \\\n } \\\n static ossl_unused ossl_inline type *lh_##type##_insert(LHASH_OF(type) *lh, type *d) \\\n { \\\n return (type *)OPENSSL_LH_insert((OPENSSL_LHASH *)lh, d); \\\n } \\\n static ossl_unused ossl_inline type *lh_##type##_delete(LHASH_OF(type) *lh, const type *d) \\\n { \\\n return (type *)OPENSSL_LH_delete((OPENSSL_LHASH *)lh, d); \\\n } \\\n static ossl_unused ossl_inline type *lh_##type##_retrieve(LHASH_OF(type) *lh, const type *d) \\\n { \\\n return (type *)OPENSSL_LH_retrieve((OPENSSL_LHASH *)lh, d); \\\n } \\\n static ossl_unused ossl_inline int lh_##type##_error(LHASH_OF(type) *lh) \\\n { \\\n return OPENSSL_LH_error((OPENSSL_LHASH *)lh); \\\n } \\\n static ossl_unused ossl_inline unsigned long lh_##type##_num_items(LHASH_OF(type) *lh) \\\n { \\\n return OPENSSL_LH_num_items((OPENSSL_LHASH *)lh); \\\n } \\\n static ossl_unused ossl_inline void lh_##type##_node_stats_bio(const LHASH_OF(type) *lh, BIO *out) \\\n { \\\n OPENSSL_LH_node_stats_bio((const OPENSSL_LHASH *)lh, out); \\\n } \\\n static ossl_unused ossl_inline void lh_##type##_node_usage_stats_bio(const LHASH_OF(type) *lh, BIO *out) \\\n { \\\n OPENSSL_LH_node_usage_stats_bio((const OPENSSL_LHASH *)lh, out); \\\n } \\\n static ossl_unused ossl_inline void lh_##type##_stats_bio(const LHASH_OF(type) *lh, BIO *out) \\\n { \\\n OPENSSL_LH_stats_bio((const OPENSSL_LHASH *)lh, out); \\\n } \\\n static ossl_unused ossl_inline unsigned long lh_##type##_get_down_load(LHASH_OF(type) *lh) \\\n { \\\n return OPENSSL_LH_get_down_load((OPENSSL_LHASH *)lh); \\\n } \\\n static ossl_unused ossl_inline void lh_##type##_set_down_load(LHASH_OF(type) *lh, unsigned long dl) \\\n { \\\n OPENSSL_LH_set_down_load((OPENSSL_LHASH *)lh, dl); \\\n } \\\n static ossl_unused ossl_inline void lh_##type##_doall(LHASH_OF(type) *lh, \\\n void (*doall)(type *)) \\\n { \\\n OPENSSL_LH_doall((OPENSSL_LHASH *)lh, (OPENSSL_LH_DOALL_FUNC)doall); \\\n } \\\n LHASH_OF(type)\n\n#define IMPLEMENT_LHASH_DOALL_ARG_CONST(type, argtype) \\\n int_implement_lhash_doall(type, argtype, const type)\n\n#define IMPLEMENT_LHASH_DOALL_ARG(type, argtype) \\\n int_implement_lhash_doall(type, argtype, type)\n\n#define int_implement_lhash_doall(type, argtype, cbargtype) \\\n static ossl_unused ossl_inline void \\\n lh_##type##_doall_##argtype(LHASH_OF(type) *lh, \\\n void (*fn)(cbargtype *, argtype *), \\\n argtype *arg) \\\n { \\\n OPENSSL_LH_doall_arg((OPENSSL_LHASH *)lh, (OPENSSL_LH_DOALL_FUNCARG)fn, (void *)arg); \\\n } \\\n LHASH_OF(type)\n\nDEFINE_LHASH_OF(OPENSSL_STRING);\n# ifdef _MSC_VER\n/*\n * push and pop this warning:\n * warning C4090: 'function': different 'const' qualifiers\n */\n# pragma warning (push)\n# pragma warning (disable: 4090)\n# endif\n\nDEFINE_LHASH_OF(OPENSSL_CSTRING);\n\n# ifdef _MSC_VER\n# pragma warning (pop)\n# endif\n\n/*\n * If called without higher optimization (min. -xO3) the Oracle Developer\n * Studio compiler generates code for the defined (static inline) functions\n * above.\n * This would later lead to the linker complaining about missing symbols when\n * this header file is included but the resulting object is not linked against\n * the Crypto library (openssl#6912).\n */\n# ifdef __SUNPRO_C\n# pragma weak OPENSSL_LH_new\n# pragma weak OPENSSL_LH_free\n# pragma weak OPENSSL_LH_insert\n# pragma weak OPENSSL_LH_delete\n# pragma weak OPENSSL_LH_retrieve\n# pragma weak OPENSSL_LH_error\n# pragma weak OPENSSL_LH_num_items\n# pragma weak OPENSSL_LH_node_stats_bio\n# pragma weak OPENSSL_LH_node_usage_stats_bio\n# pragma weak OPENSSL_LH_stats_bio\n# pragma weak OPENSSL_LH_get_down_load\n# pragma weak OPENSSL_LH_set_down_load\n# pragma weak OPENSSL_LH_doall\n# pragma weak OPENSSL_LH_doall_arg\n# endif /* __SUNPRO_C */\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/md2.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_MD2_H\n# define HEADER_MD2_H\n\n# include \n\n# ifndef OPENSSL_NO_MD2\n# include \n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\ntypedef unsigned char MD2_INT;\n\n# define MD2_DIGEST_LENGTH 16\n# define MD2_BLOCK 16\n\ntypedef struct MD2state_st {\n unsigned int num;\n unsigned char data[MD2_BLOCK];\n MD2_INT cksm[MD2_BLOCK];\n MD2_INT state[MD2_BLOCK];\n} MD2_CTX;\n\nconst char *MD2_options(void);\nint MD2_Init(MD2_CTX *c);\nint MD2_Update(MD2_CTX *c, const unsigned char *data, size_t len);\nint MD2_Final(unsigned char *md, MD2_CTX *c);\nunsigned char *MD2(const unsigned char *d, size_t n, unsigned char *md);\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/md4.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_MD4_H\n# define HEADER_MD4_H\n\n# include \n\n# ifndef OPENSSL_NO_MD4\n# include \n# include \n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n/*-\n * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n * ! MD4_LONG has to be at least 32 bits wide. !\n * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n */\n# define MD4_LONG unsigned int\n\n# define MD4_CBLOCK 64\n# define MD4_LBLOCK (MD4_CBLOCK/4)\n# define MD4_DIGEST_LENGTH 16\n\ntypedef struct MD4state_st {\n MD4_LONG A, B, C, D;\n MD4_LONG Nl, Nh;\n MD4_LONG data[MD4_LBLOCK];\n unsigned int num;\n} MD4_CTX;\n\nint MD4_Init(MD4_CTX *c);\nint MD4_Update(MD4_CTX *c, const void *data, size_t len);\nint MD4_Final(unsigned char *md, MD4_CTX *c);\nunsigned char *MD4(const unsigned char *d, size_t n, unsigned char *md);\nvoid MD4_Transform(MD4_CTX *c, const unsigned char *b);\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/md5.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_MD5_H\n# define HEADER_MD5_H\n\n# include \n\n# ifndef OPENSSL_NO_MD5\n# include \n# include \n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n/*\n * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n * ! MD5_LONG has to be at least 32 bits wide. !\n * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n */\n# define MD5_LONG unsigned int\n\n# define MD5_CBLOCK 64\n# define MD5_LBLOCK (MD5_CBLOCK/4)\n# define MD5_DIGEST_LENGTH 16\n\ntypedef struct MD5state_st {\n MD5_LONG A, B, C, D;\n MD5_LONG Nl, Nh;\n MD5_LONG data[MD5_LBLOCK];\n unsigned int num;\n} MD5_CTX;\n\nint MD5_Init(MD5_CTX *c);\nint MD5_Update(MD5_CTX *c, const void *data, size_t len);\nint MD5_Final(unsigned char *md, MD5_CTX *c);\nunsigned char *MD5(const unsigned char *d, size_t n, unsigned char *md);\nvoid MD5_Transform(MD5_CTX *c, const unsigned char *b);\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/mdc2.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_MDC2_H\n# define HEADER_MDC2_H\n\n# include \n\n#ifndef OPENSSL_NO_MDC2\n# include \n# include \n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n# define MDC2_BLOCK 8\n# define MDC2_DIGEST_LENGTH 16\n\ntypedef struct mdc2_ctx_st {\n unsigned int num;\n unsigned char data[MDC2_BLOCK];\n DES_cblock h, hh;\n int pad_type; /* either 1 or 2, default 1 */\n} MDC2_CTX;\n\nint MDC2_Init(MDC2_CTX *c);\nint MDC2_Update(MDC2_CTX *c, const unsigned char *data, size_t len);\nint MDC2_Final(unsigned char *md, MDC2_CTX *c);\nunsigned char *MDC2(const unsigned char *d, size_t n, unsigned char *md);\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/modes.h", "content": "/*\n * Copyright 2008-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_MODES_H\n# define HEADER_MODES_H\n\n# include \n\n# ifdef __cplusplus\nextern \"C\" {\n# endif\ntypedef void (*block128_f) (const unsigned char in[16],\n unsigned char out[16], const void *key);\n\ntypedef void (*cbc128_f) (const unsigned char *in, unsigned char *out,\n size_t len, const void *key,\n unsigned char ivec[16], int enc);\n\ntypedef void (*ctr128_f) (const unsigned char *in, unsigned char *out,\n size_t blocks, const void *key,\n const unsigned char ivec[16]);\n\ntypedef void (*ccm128_f) (const unsigned char *in, unsigned char *out,\n size_t blocks, const void *key,\n const unsigned char ivec[16],\n unsigned char cmac[16]);\n\nvoid CRYPTO_cbc128_encrypt(const unsigned char *in, unsigned char *out,\n size_t len, const void *key,\n unsigned char ivec[16], block128_f block);\nvoid CRYPTO_cbc128_decrypt(const unsigned char *in, unsigned char *out,\n size_t len, const void *key,\n unsigned char ivec[16], block128_f block);\n\nvoid CRYPTO_ctr128_encrypt(const unsigned char *in, unsigned char *out,\n size_t len, const void *key,\n unsigned char ivec[16],\n unsigned char ecount_buf[16], unsigned int *num,\n block128_f block);\n\nvoid CRYPTO_ctr128_encrypt_ctr32(const unsigned char *in, unsigned char *out,\n size_t len, const void *key,\n unsigned char ivec[16],\n unsigned char ecount_buf[16],\n unsigned int *num, ctr128_f ctr);\n\nvoid CRYPTO_ofb128_encrypt(const unsigned char *in, unsigned char *out,\n size_t len, const void *key,\n unsigned char ivec[16], int *num,\n block128_f block);\n\nvoid CRYPTO_cfb128_encrypt(const unsigned char *in, unsigned char *out,\n size_t len, const void *key,\n unsigned char ivec[16], int *num,\n int enc, block128_f block);\nvoid CRYPTO_cfb128_8_encrypt(const unsigned char *in, unsigned char *out,\n size_t length, const void *key,\n unsigned char ivec[16], int *num,\n int enc, block128_f block);\nvoid CRYPTO_cfb128_1_encrypt(const unsigned char *in, unsigned char *out,\n size_t bits, const void *key,\n unsigned char ivec[16], int *num,\n int enc, block128_f block);\n\nsize_t CRYPTO_cts128_encrypt_block(const unsigned char *in,\n unsigned char *out, size_t len,\n const void *key, unsigned char ivec[16],\n block128_f block);\nsize_t CRYPTO_cts128_encrypt(const unsigned char *in, unsigned char *out,\n size_t len, const void *key,\n unsigned char ivec[16], cbc128_f cbc);\nsize_t CRYPTO_cts128_decrypt_block(const unsigned char *in,\n unsigned char *out, size_t len,\n const void *key, unsigned char ivec[16],\n block128_f block);\nsize_t CRYPTO_cts128_decrypt(const unsigned char *in, unsigned char *out,\n size_t len, const void *key,\n unsigned char ivec[16], cbc128_f cbc);\n\nsize_t CRYPTO_nistcts128_encrypt_block(const unsigned char *in,\n unsigned char *out, size_t len,\n const void *key,\n unsigned char ivec[16],\n block128_f block);\nsize_t CRYPTO_nistcts128_encrypt(const unsigned char *in, unsigned char *out,\n size_t len, const void *key,\n unsigned char ivec[16], cbc128_f cbc);\nsize_t CRYPTO_nistcts128_decrypt_block(const unsigned char *in,\n unsigned char *out, size_t len,\n const void *key,\n unsigned char ivec[16],\n block128_f block);\nsize_t CRYPTO_nistcts128_decrypt(const unsigned char *in, unsigned char *out,\n size_t len, const void *key,\n unsigned char ivec[16], cbc128_f cbc);\n\ntypedef struct gcm128_context GCM128_CONTEXT;\n\nGCM128_CONTEXT *CRYPTO_gcm128_new(void *key, block128_f block);\nvoid CRYPTO_gcm128_init(GCM128_CONTEXT *ctx, void *key, block128_f block);\nvoid CRYPTO_gcm128_setiv(GCM128_CONTEXT *ctx, const unsigned char *iv,\n size_t len);\nint CRYPTO_gcm128_aad(GCM128_CONTEXT *ctx, const unsigned char *aad,\n size_t len);\nint CRYPTO_gcm128_encrypt(GCM128_CONTEXT *ctx,\n const unsigned char *in, unsigned char *out,\n size_t len);\nint CRYPTO_gcm128_decrypt(GCM128_CONTEXT *ctx,\n const unsigned char *in, unsigned char *out,\n size_t len);\nint CRYPTO_gcm128_encrypt_ctr32(GCM128_CONTEXT *ctx,\n const unsigned char *in, unsigned char *out,\n size_t len, ctr128_f stream);\nint CRYPTO_gcm128_decrypt_ctr32(GCM128_CONTEXT *ctx,\n const unsigned char *in, unsigned char *out,\n size_t len, ctr128_f stream);\nint CRYPTO_gcm128_finish(GCM128_CONTEXT *ctx, const unsigned char *tag,\n size_t len);\nvoid CRYPTO_gcm128_tag(GCM128_CONTEXT *ctx, unsigned char *tag, size_t len);\nvoid CRYPTO_gcm128_release(GCM128_CONTEXT *ctx);\n\ntypedef struct ccm128_context CCM128_CONTEXT;\n\nvoid CRYPTO_ccm128_init(CCM128_CONTEXT *ctx,\n unsigned int M, unsigned int L, void *key,\n block128_f block);\nint CRYPTO_ccm128_setiv(CCM128_CONTEXT *ctx, const unsigned char *nonce,\n size_t nlen, size_t mlen);\nvoid CRYPTO_ccm128_aad(CCM128_CONTEXT *ctx, const unsigned char *aad,\n size_t alen);\nint CRYPTO_ccm128_encrypt(CCM128_CONTEXT *ctx, const unsigned char *inp,\n unsigned char *out, size_t len);\nint CRYPTO_ccm128_decrypt(CCM128_CONTEXT *ctx, const unsigned char *inp,\n unsigned char *out, size_t len);\nint CRYPTO_ccm128_encrypt_ccm64(CCM128_CONTEXT *ctx, const unsigned char *inp,\n unsigned char *out, size_t len,\n ccm128_f stream);\nint CRYPTO_ccm128_decrypt_ccm64(CCM128_CONTEXT *ctx, const unsigned char *inp,\n unsigned char *out, size_t len,\n ccm128_f stream);\nsize_t CRYPTO_ccm128_tag(CCM128_CONTEXT *ctx, unsigned char *tag, size_t len);\n\ntypedef struct xts128_context XTS128_CONTEXT;\n\nint CRYPTO_xts128_encrypt(const XTS128_CONTEXT *ctx,\n const unsigned char iv[16],\n const unsigned char *inp, unsigned char *out,\n size_t len, int enc);\n\nsize_t CRYPTO_128_wrap(void *key, const unsigned char *iv,\n unsigned char *out,\n const unsigned char *in, size_t inlen,\n block128_f block);\n\nsize_t CRYPTO_128_unwrap(void *key, const unsigned char *iv,\n unsigned char *out,\n const unsigned char *in, size_t inlen,\n block128_f block);\nsize_t CRYPTO_128_wrap_pad(void *key, const unsigned char *icv,\n unsigned char *out, const unsigned char *in,\n size_t inlen, block128_f block);\nsize_t CRYPTO_128_unwrap_pad(void *key, const unsigned char *icv,\n unsigned char *out, const unsigned char *in,\n size_t inlen, block128_f block);\n\n# ifndef OPENSSL_NO_OCB\ntypedef struct ocb128_context OCB128_CONTEXT;\n\ntypedef void (*ocb128_f) (const unsigned char *in, unsigned char *out,\n size_t blocks, const void *key,\n size_t start_block_num,\n unsigned char offset_i[16],\n const unsigned char L_[][16],\n unsigned char checksum[16]);\n\nOCB128_CONTEXT *CRYPTO_ocb128_new(void *keyenc, void *keydec,\n block128_f encrypt, block128_f decrypt,\n ocb128_f stream);\nint CRYPTO_ocb128_init(OCB128_CONTEXT *ctx, void *keyenc, void *keydec,\n block128_f encrypt, block128_f decrypt,\n ocb128_f stream);\nint CRYPTO_ocb128_copy_ctx(OCB128_CONTEXT *dest, OCB128_CONTEXT *src,\n void *keyenc, void *keydec);\nint CRYPTO_ocb128_setiv(OCB128_CONTEXT *ctx, const unsigned char *iv,\n size_t len, size_t taglen);\nint CRYPTO_ocb128_aad(OCB128_CONTEXT *ctx, const unsigned char *aad,\n size_t len);\nint CRYPTO_ocb128_encrypt(OCB128_CONTEXT *ctx, const unsigned char *in,\n unsigned char *out, size_t len);\nint CRYPTO_ocb128_decrypt(OCB128_CONTEXT *ctx, const unsigned char *in,\n unsigned char *out, size_t len);\nint CRYPTO_ocb128_finish(OCB128_CONTEXT *ctx, const unsigned char *tag,\n size_t len);\nint CRYPTO_ocb128_tag(OCB128_CONTEXT *ctx, unsigned char *tag, size_t len);\nvoid CRYPTO_ocb128_cleanup(OCB128_CONTEXT *ctx);\n# endif /* OPENSSL_NO_OCB */\n\n# ifdef __cplusplus\n}\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/obj_mac.h", "content": "/*\n * WARNING: do not edit!\n * Generated by crypto/objects/objects.pl\n *\n * Copyright 2000-2022 The OpenSSL Project Authors. All Rights Reserved.\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#define SN_undef \"UNDEF\"\n#define LN_undef \"undefined\"\n#define NID_undef 0\n#define OBJ_undef 0L\n\n#define SN_itu_t \"ITU-T\"\n#define LN_itu_t \"itu-t\"\n#define NID_itu_t 645\n#define OBJ_itu_t 0L\n\n#define NID_ccitt 404\n#define OBJ_ccitt OBJ_itu_t\n\n#define SN_iso \"ISO\"\n#define LN_iso \"iso\"\n#define NID_iso 181\n#define OBJ_iso 1L\n\n#define SN_joint_iso_itu_t \"JOINT-ISO-ITU-T\"\n#define LN_joint_iso_itu_t \"joint-iso-itu-t\"\n#define NID_joint_iso_itu_t 646\n#define OBJ_joint_iso_itu_t 2L\n\n#define NID_joint_iso_ccitt 393\n#define OBJ_joint_iso_ccitt OBJ_joint_iso_itu_t\n\n#define SN_member_body \"member-body\"\n#define LN_member_body \"ISO Member Body\"\n#define NID_member_body 182\n#define OBJ_member_body OBJ_iso,2L\n\n#define SN_identified_organization \"identified-organization\"\n#define NID_identified_organization 676\n#define OBJ_identified_organization OBJ_iso,3L\n\n#define SN_hmac_md5 \"HMAC-MD5\"\n#define LN_hmac_md5 \"hmac-md5\"\n#define NID_hmac_md5 780\n#define OBJ_hmac_md5 OBJ_identified_organization,6L,1L,5L,5L,8L,1L,1L\n\n#define SN_hmac_sha1 \"HMAC-SHA1\"\n#define LN_hmac_sha1 \"hmac-sha1\"\n#define NID_hmac_sha1 781\n#define OBJ_hmac_sha1 OBJ_identified_organization,6L,1L,5L,5L,8L,1L,2L\n\n#define SN_x509ExtAdmission \"x509ExtAdmission\"\n#define LN_x509ExtAdmission \"Professional Information or basis for Admission\"\n#define NID_x509ExtAdmission 1093\n#define OBJ_x509ExtAdmission OBJ_identified_organization,36L,8L,3L,3L\n\n#define SN_certicom_arc \"certicom-arc\"\n#define NID_certicom_arc 677\n#define OBJ_certicom_arc OBJ_identified_organization,132L\n\n#define SN_ieee \"ieee\"\n#define NID_ieee 1170\n#define OBJ_ieee OBJ_identified_organization,111L\n\n#define SN_ieee_siswg \"ieee-siswg\"\n#define LN_ieee_siswg \"IEEE Security in Storage Working Group\"\n#define NID_ieee_siswg 1171\n#define OBJ_ieee_siswg OBJ_ieee,2L,1619L\n\n#define SN_international_organizations \"international-organizations\"\n#define LN_international_organizations \"International Organizations\"\n#define NID_international_organizations 647\n#define OBJ_international_organizations OBJ_joint_iso_itu_t,23L\n\n#define SN_wap \"wap\"\n#define NID_wap 678\n#define OBJ_wap OBJ_international_organizations,43L\n\n#define SN_wap_wsg \"wap-wsg\"\n#define NID_wap_wsg 679\n#define OBJ_wap_wsg OBJ_wap,1L\n\n#define SN_selected_attribute_types \"selected-attribute-types\"\n#define LN_selected_attribute_types \"Selected Attribute Types\"\n#define NID_selected_attribute_types 394\n#define OBJ_selected_attribute_types OBJ_joint_iso_itu_t,5L,1L,5L\n\n#define SN_clearance \"clearance\"\n#define NID_clearance 395\n#define OBJ_clearance OBJ_selected_attribute_types,55L\n\n#define SN_ISO_US \"ISO-US\"\n#define LN_ISO_US \"ISO US Member Body\"\n#define NID_ISO_US 183\n#define OBJ_ISO_US OBJ_member_body,840L\n\n#define SN_X9_57 \"X9-57\"\n#define LN_X9_57 \"X9.57\"\n#define NID_X9_57 184\n#define OBJ_X9_57 OBJ_ISO_US,10040L\n\n#define SN_X9cm \"X9cm\"\n#define LN_X9cm \"X9.57 CM ?\"\n#define NID_X9cm 185\n#define OBJ_X9cm OBJ_X9_57,4L\n\n#define SN_ISO_CN \"ISO-CN\"\n#define LN_ISO_CN \"ISO CN Member Body\"\n#define NID_ISO_CN 1140\n#define OBJ_ISO_CN OBJ_member_body,156L\n\n#define SN_oscca \"oscca\"\n#define NID_oscca 1141\n#define OBJ_oscca OBJ_ISO_CN,10197L\n\n#define SN_sm_scheme \"sm-scheme\"\n#define NID_sm_scheme 1142\n#define OBJ_sm_scheme OBJ_oscca,1L\n\n#define SN_dsa \"DSA\"\n#define LN_dsa \"dsaEncryption\"\n#define NID_dsa 116\n#define OBJ_dsa OBJ_X9cm,1L\n\n#define SN_dsaWithSHA1 \"DSA-SHA1\"\n#define LN_dsaWithSHA1 \"dsaWithSHA1\"\n#define NID_dsaWithSHA1 113\n#define OBJ_dsaWithSHA1 OBJ_X9cm,3L\n\n#define SN_ansi_X9_62 \"ansi-X9-62\"\n#define LN_ansi_X9_62 \"ANSI X9.62\"\n#define NID_ansi_X9_62 405\n#define OBJ_ansi_X9_62 OBJ_ISO_US,10045L\n\n#define OBJ_X9_62_id_fieldType OBJ_ansi_X9_62,1L\n\n#define SN_X9_62_prime_field \"prime-field\"\n#define NID_X9_62_prime_field 406\n#define OBJ_X9_62_prime_field OBJ_X9_62_id_fieldType,1L\n\n#define SN_X9_62_characteristic_two_field \"characteristic-two-field\"\n#define NID_X9_62_characteristic_two_field 407\n#define OBJ_X9_62_characteristic_two_field OBJ_X9_62_id_fieldType,2L\n\n#define SN_X9_62_id_characteristic_two_basis \"id-characteristic-two-basis\"\n#define NID_X9_62_id_characteristic_two_basis 680\n#define OBJ_X9_62_id_characteristic_two_basis OBJ_X9_62_characteristic_two_field,3L\n\n#define SN_X9_62_onBasis \"onBasis\"\n#define NID_X9_62_onBasis 681\n#define OBJ_X9_62_onBasis OBJ_X9_62_id_characteristic_two_basis,1L\n\n#define SN_X9_62_tpBasis \"tpBasis\"\n#define NID_X9_62_tpBasis 682\n#define OBJ_X9_62_tpBasis OBJ_X9_62_id_characteristic_two_basis,2L\n\n#define SN_X9_62_ppBasis \"ppBasis\"\n#define NID_X9_62_ppBasis 683\n#define OBJ_X9_62_ppBasis OBJ_X9_62_id_characteristic_two_basis,3L\n\n#define OBJ_X9_62_id_publicKeyType OBJ_ansi_X9_62,2L\n\n#define SN_X9_62_id_ecPublicKey \"id-ecPublicKey\"\n#define NID_X9_62_id_ecPublicKey 408\n#define OBJ_X9_62_id_ecPublicKey OBJ_X9_62_id_publicKeyType,1L\n\n#define OBJ_X9_62_ellipticCurve OBJ_ansi_X9_62,3L\n\n#define OBJ_X9_62_c_TwoCurve OBJ_X9_62_ellipticCurve,0L\n\n#define SN_X9_62_c2pnb163v1 \"c2pnb163v1\"\n#define NID_X9_62_c2pnb163v1 684\n#define OBJ_X9_62_c2pnb163v1 OBJ_X9_62_c_TwoCurve,1L\n\n#define SN_X9_62_c2pnb163v2 \"c2pnb163v2\"\n#define NID_X9_62_c2pnb163v2 685\n#define OBJ_X9_62_c2pnb163v2 OBJ_X9_62_c_TwoCurve,2L\n\n#define SN_X9_62_c2pnb163v3 \"c2pnb163v3\"\n#define NID_X9_62_c2pnb163v3 686\n#define OBJ_X9_62_c2pnb163v3 OBJ_X9_62_c_TwoCurve,3L\n\n#define SN_X9_62_c2pnb176v1 \"c2pnb176v1\"\n#define NID_X9_62_c2pnb176v1 687\n#define OBJ_X9_62_c2pnb176v1 OBJ_X9_62_c_TwoCurve,4L\n\n#define SN_X9_62_c2tnb191v1 \"c2tnb191v1\"\n#define NID_X9_62_c2tnb191v1 688\n#define OBJ_X9_62_c2tnb191v1 OBJ_X9_62_c_TwoCurve,5L\n\n#define SN_X9_62_c2tnb191v2 \"c2tnb191v2\"\n#define NID_X9_62_c2tnb191v2 689\n#define OBJ_X9_62_c2tnb191v2 OBJ_X9_62_c_TwoCurve,6L\n\n#define SN_X9_62_c2tnb191v3 \"c2tnb191v3\"\n#define NID_X9_62_c2tnb191v3 690\n#define OBJ_X9_62_c2tnb191v3 OBJ_X9_62_c_TwoCurve,7L\n\n#define SN_X9_62_c2onb191v4 \"c2onb191v4\"\n#define NID_X9_62_c2onb191v4 691\n#define OBJ_X9_62_c2onb191v4 OBJ_X9_62_c_TwoCurve,8L\n\n#define SN_X9_62_c2onb191v5 \"c2onb191v5\"\n#define NID_X9_62_c2onb191v5 692\n#define OBJ_X9_62_c2onb191v5 OBJ_X9_62_c_TwoCurve,9L\n\n#define SN_X9_62_c2pnb208w1 \"c2pnb208w1\"\n#define NID_X9_62_c2pnb208w1 693\n#define OBJ_X9_62_c2pnb208w1 OBJ_X9_62_c_TwoCurve,10L\n\n#define SN_X9_62_c2tnb239v1 \"c2tnb239v1\"\n#define NID_X9_62_c2tnb239v1 694\n#define OBJ_X9_62_c2tnb239v1 OBJ_X9_62_c_TwoCurve,11L\n\n#define SN_X9_62_c2tnb239v2 \"c2tnb239v2\"\n#define NID_X9_62_c2tnb239v2 695\n#define OBJ_X9_62_c2tnb239v2 OBJ_X9_62_c_TwoCurve,12L\n\n#define SN_X9_62_c2tnb239v3 \"c2tnb239v3\"\n#define NID_X9_62_c2tnb239v3 696\n#define OBJ_X9_62_c2tnb239v3 OBJ_X9_62_c_TwoCurve,13L\n\n#define SN_X9_62_c2onb239v4 \"c2onb239v4\"\n#define NID_X9_62_c2onb239v4 697\n#define OBJ_X9_62_c2onb239v4 OBJ_X9_62_c_TwoCurve,14L\n\n#define SN_X9_62_c2onb239v5 \"c2onb239v5\"\n#define NID_X9_62_c2onb239v5 698\n#define OBJ_X9_62_c2onb239v5 OBJ_X9_62_c_TwoCurve,15L\n\n#define SN_X9_62_c2pnb272w1 \"c2pnb272w1\"\n#define NID_X9_62_c2pnb272w1 699\n#define OBJ_X9_62_c2pnb272w1 OBJ_X9_62_c_TwoCurve,16L\n\n#define SN_X9_62_c2pnb304w1 \"c2pnb304w1\"\n#define NID_X9_62_c2pnb304w1 700\n#define OBJ_X9_62_c2pnb304w1 OBJ_X9_62_c_TwoCurve,17L\n\n#define SN_X9_62_c2tnb359v1 \"c2tnb359v1\"\n#define NID_X9_62_c2tnb359v1 701\n#define OBJ_X9_62_c2tnb359v1 OBJ_X9_62_c_TwoCurve,18L\n\n#define SN_X9_62_c2pnb368w1 \"c2pnb368w1\"\n#define NID_X9_62_c2pnb368w1 702\n#define OBJ_X9_62_c2pnb368w1 OBJ_X9_62_c_TwoCurve,19L\n\n#define SN_X9_62_c2tnb431r1 \"c2tnb431r1\"\n#define NID_X9_62_c2tnb431r1 703\n#define OBJ_X9_62_c2tnb431r1 OBJ_X9_62_c_TwoCurve,20L\n\n#define OBJ_X9_62_primeCurve OBJ_X9_62_ellipticCurve,1L\n\n#define SN_X9_62_prime192v1 \"prime192v1\"\n#define NID_X9_62_prime192v1 409\n#define OBJ_X9_62_prime192v1 OBJ_X9_62_primeCurve,1L\n\n#define SN_X9_62_prime192v2 \"prime192v2\"\n#define NID_X9_62_prime192v2 410\n#define OBJ_X9_62_prime192v2 OBJ_X9_62_primeCurve,2L\n\n#define SN_X9_62_prime192v3 \"prime192v3\"\n#define NID_X9_62_prime192v3 411\n#define OBJ_X9_62_prime192v3 OBJ_X9_62_primeCurve,3L\n\n#define SN_X9_62_prime239v1 \"prime239v1\"\n#define NID_X9_62_prime239v1 412\n#define OBJ_X9_62_prime239v1 OBJ_X9_62_primeCurve,4L\n\n#define SN_X9_62_prime239v2 \"prime239v2\"\n#define NID_X9_62_prime239v2 413\n#define OBJ_X9_62_prime239v2 OBJ_X9_62_primeCurve,5L\n\n#define SN_X9_62_prime239v3 \"prime239v3\"\n#define NID_X9_62_prime239v3 414\n#define OBJ_X9_62_prime239v3 OBJ_X9_62_primeCurve,6L\n\n#define SN_X9_62_prime256v1 \"prime256v1\"\n#define NID_X9_62_prime256v1 415\n#define OBJ_X9_62_prime256v1 OBJ_X9_62_primeCurve,7L\n\n#define OBJ_X9_62_id_ecSigType OBJ_ansi_X9_62,4L\n\n#define SN_ecdsa_with_SHA1 \"ecdsa-with-SHA1\"\n#define NID_ecdsa_with_SHA1 416\n#define OBJ_ecdsa_with_SHA1 OBJ_X9_62_id_ecSigType,1L\n\n#define SN_ecdsa_with_Recommended \"ecdsa-with-Recommended\"\n#define NID_ecdsa_with_Recommended 791\n#define OBJ_ecdsa_with_Recommended OBJ_X9_62_id_ecSigType,2L\n\n#define SN_ecdsa_with_Specified \"ecdsa-with-Specified\"\n#define NID_ecdsa_with_Specified 792\n#define OBJ_ecdsa_with_Specified OBJ_X9_62_id_ecSigType,3L\n\n#define SN_ecdsa_with_SHA224 \"ecdsa-with-SHA224\"\n#define NID_ecdsa_with_SHA224 793\n#define OBJ_ecdsa_with_SHA224 OBJ_ecdsa_with_Specified,1L\n\n#define SN_ecdsa_with_SHA256 \"ecdsa-with-SHA256\"\n#define NID_ecdsa_with_SHA256 794\n#define OBJ_ecdsa_with_SHA256 OBJ_ecdsa_with_Specified,2L\n\n#define SN_ecdsa_with_SHA384 \"ecdsa-with-SHA384\"\n#define NID_ecdsa_with_SHA384 795\n#define OBJ_ecdsa_with_SHA384 OBJ_ecdsa_with_Specified,3L\n\n#define SN_ecdsa_with_SHA512 \"ecdsa-with-SHA512\"\n#define NID_ecdsa_with_SHA512 796\n#define OBJ_ecdsa_with_SHA512 OBJ_ecdsa_with_Specified,4L\n\n#define OBJ_secg_ellipticCurve OBJ_certicom_arc,0L\n\n#define SN_secp112r1 \"secp112r1\"\n#define NID_secp112r1 704\n#define OBJ_secp112r1 OBJ_secg_ellipticCurve,6L\n\n#define SN_secp112r2 \"secp112r2\"\n#define NID_secp112r2 705\n#define OBJ_secp112r2 OBJ_secg_ellipticCurve,7L\n\n#define SN_secp128r1 \"secp128r1\"\n#define NID_secp128r1 706\n#define OBJ_secp128r1 OBJ_secg_ellipticCurve,28L\n\n#define SN_secp128r2 \"secp128r2\"\n#define NID_secp128r2 707\n#define OBJ_secp128r2 OBJ_secg_ellipticCurve,29L\n\n#define SN_secp160k1 \"secp160k1\"\n#define NID_secp160k1 708\n#define OBJ_secp160k1 OBJ_secg_ellipticCurve,9L\n\n#define SN_secp160r1 \"secp160r1\"\n#define NID_secp160r1 709\n#define OBJ_secp160r1 OBJ_secg_ellipticCurve,8L\n\n#define SN_secp160r2 \"secp160r2\"\n#define NID_secp160r2 710\n#define OBJ_secp160r2 OBJ_secg_ellipticCurve,30L\n\n#define SN_secp192k1 \"secp192k1\"\n#define NID_secp192k1 711\n#define OBJ_secp192k1 OBJ_secg_ellipticCurve,31L\n\n#define SN_secp224k1 \"secp224k1\"\n#define NID_secp224k1 712\n#define OBJ_secp224k1 OBJ_secg_ellipticCurve,32L\n\n#define SN_secp224r1 \"secp224r1\"\n#define NID_secp224r1 713\n#define OBJ_secp224r1 OBJ_secg_ellipticCurve,33L\n\n#define SN_secp256k1 \"secp256k1\"\n#define NID_secp256k1 714\n#define OBJ_secp256k1 OBJ_secg_ellipticCurve,10L\n\n#define SN_secp384r1 \"secp384r1\"\n#define NID_secp384r1 715\n#define OBJ_secp384r1 OBJ_secg_ellipticCurve,34L\n\n#define SN_secp521r1 \"secp521r1\"\n#define NID_secp521r1 716\n#define OBJ_secp521r1 OBJ_secg_ellipticCurve,35L\n\n#define SN_sect113r1 \"sect113r1\"\n#define NID_sect113r1 717\n#define OBJ_sect113r1 OBJ_secg_ellipticCurve,4L\n\n#define SN_sect113r2 \"sect113r2\"\n#define NID_sect113r2 718\n#define OBJ_sect113r2 OBJ_secg_ellipticCurve,5L\n\n#define SN_sect131r1 \"sect131r1\"\n#define NID_sect131r1 719\n#define OBJ_sect131r1 OBJ_secg_ellipticCurve,22L\n\n#define SN_sect131r2 \"sect131r2\"\n#define NID_sect131r2 720\n#define OBJ_sect131r2 OBJ_secg_ellipticCurve,23L\n\n#define SN_sect163k1 \"sect163k1\"\n#define NID_sect163k1 721\n#define OBJ_sect163k1 OBJ_secg_ellipticCurve,1L\n\n#define SN_sect163r1 \"sect163r1\"\n#define NID_sect163r1 722\n#define OBJ_sect163r1 OBJ_secg_ellipticCurve,2L\n\n#define SN_sect163r2 \"sect163r2\"\n#define NID_sect163r2 723\n#define OBJ_sect163r2 OBJ_secg_ellipticCurve,15L\n\n#define SN_sect193r1 \"sect193r1\"\n#define NID_sect193r1 724\n#define OBJ_sect193r1 OBJ_secg_ellipticCurve,24L\n\n#define SN_sect193r2 \"sect193r2\"\n#define NID_sect193r2 725\n#define OBJ_sect193r2 OBJ_secg_ellipticCurve,25L\n\n#define SN_sect233k1 \"sect233k1\"\n#define NID_sect233k1 726\n#define OBJ_sect233k1 OBJ_secg_ellipticCurve,26L\n\n#define SN_sect233r1 \"sect233r1\"\n#define NID_sect233r1 727\n#define OBJ_sect233r1 OBJ_secg_ellipticCurve,27L\n\n#define SN_sect239k1 \"sect239k1\"\n#define NID_sect239k1 728\n#define OBJ_sect239k1 OBJ_secg_ellipticCurve,3L\n\n#define SN_sect283k1 \"sect283k1\"\n#define NID_sect283k1 729\n#define OBJ_sect283k1 OBJ_secg_ellipticCurve,16L\n\n#define SN_sect283r1 \"sect283r1\"\n#define NID_sect283r1 730\n#define OBJ_sect283r1 OBJ_secg_ellipticCurve,17L\n\n#define SN_sect409k1 \"sect409k1\"\n#define NID_sect409k1 731\n#define OBJ_sect409k1 OBJ_secg_ellipticCurve,36L\n\n#define SN_sect409r1 \"sect409r1\"\n#define NID_sect409r1 732\n#define OBJ_sect409r1 OBJ_secg_ellipticCurve,37L\n\n#define SN_sect571k1 \"sect571k1\"\n#define NID_sect571k1 733\n#define OBJ_sect571k1 OBJ_secg_ellipticCurve,38L\n\n#define SN_sect571r1 \"sect571r1\"\n#define NID_sect571r1 734\n#define OBJ_sect571r1 OBJ_secg_ellipticCurve,39L\n\n#define OBJ_wap_wsg_idm_ecid OBJ_wap_wsg,4L\n\n#define SN_wap_wsg_idm_ecid_wtls1 \"wap-wsg-idm-ecid-wtls1\"\n#define NID_wap_wsg_idm_ecid_wtls1 735\n#define OBJ_wap_wsg_idm_ecid_wtls1 OBJ_wap_wsg_idm_ecid,1L\n\n#define SN_wap_wsg_idm_ecid_wtls3 \"wap-wsg-idm-ecid-wtls3\"\n#define NID_wap_wsg_idm_ecid_wtls3 736\n#define OBJ_wap_wsg_idm_ecid_wtls3 OBJ_wap_wsg_idm_ecid,3L\n\n#define SN_wap_wsg_idm_ecid_wtls4 \"wap-wsg-idm-ecid-wtls4\"\n#define NID_wap_wsg_idm_ecid_wtls4 737\n#define OBJ_wap_wsg_idm_ecid_wtls4 OBJ_wap_wsg_idm_ecid,4L\n\n#define SN_wap_wsg_idm_ecid_wtls5 \"wap-wsg-idm-ecid-wtls5\"\n#define NID_wap_wsg_idm_ecid_wtls5 738\n#define OBJ_wap_wsg_idm_ecid_wtls5 OBJ_wap_wsg_idm_ecid,5L\n\n#define SN_wap_wsg_idm_ecid_wtls6 \"wap-wsg-idm-ecid-wtls6\"\n#define NID_wap_wsg_idm_ecid_wtls6 739\n#define OBJ_wap_wsg_idm_ecid_wtls6 OBJ_wap_wsg_idm_ecid,6L\n\n#define SN_wap_wsg_idm_ecid_wtls7 \"wap-wsg-idm-ecid-wtls7\"\n#define NID_wap_wsg_idm_ecid_wtls7 740\n#define OBJ_wap_wsg_idm_ecid_wtls7 OBJ_wap_wsg_idm_ecid,7L\n\n#define SN_wap_wsg_idm_ecid_wtls8 \"wap-wsg-idm-ecid-wtls8\"\n#define NID_wap_wsg_idm_ecid_wtls8 741\n#define OBJ_wap_wsg_idm_ecid_wtls8 OBJ_wap_wsg_idm_ecid,8L\n\n#define SN_wap_wsg_idm_ecid_wtls9 \"wap-wsg-idm-ecid-wtls9\"\n#define NID_wap_wsg_idm_ecid_wtls9 742\n#define OBJ_wap_wsg_idm_ecid_wtls9 OBJ_wap_wsg_idm_ecid,9L\n\n#define SN_wap_wsg_idm_ecid_wtls10 \"wap-wsg-idm-ecid-wtls10\"\n#define NID_wap_wsg_idm_ecid_wtls10 743\n#define OBJ_wap_wsg_idm_ecid_wtls10 OBJ_wap_wsg_idm_ecid,10L\n\n#define SN_wap_wsg_idm_ecid_wtls11 \"wap-wsg-idm-ecid-wtls11\"\n#define NID_wap_wsg_idm_ecid_wtls11 744\n#define OBJ_wap_wsg_idm_ecid_wtls11 OBJ_wap_wsg_idm_ecid,11L\n\n#define SN_wap_wsg_idm_ecid_wtls12 \"wap-wsg-idm-ecid-wtls12\"\n#define NID_wap_wsg_idm_ecid_wtls12 745\n#define OBJ_wap_wsg_idm_ecid_wtls12 OBJ_wap_wsg_idm_ecid,12L\n\n#define SN_cast5_cbc \"CAST5-CBC\"\n#define LN_cast5_cbc \"cast5-cbc\"\n#define NID_cast5_cbc 108\n#define OBJ_cast5_cbc OBJ_ISO_US,113533L,7L,66L,10L\n\n#define SN_cast5_ecb \"CAST5-ECB\"\n#define LN_cast5_ecb \"cast5-ecb\"\n#define NID_cast5_ecb 109\n\n#define SN_cast5_cfb64 \"CAST5-CFB\"\n#define LN_cast5_cfb64 \"cast5-cfb\"\n#define NID_cast5_cfb64 110\n\n#define SN_cast5_ofb64 \"CAST5-OFB\"\n#define LN_cast5_ofb64 \"cast5-ofb\"\n#define NID_cast5_ofb64 111\n\n#define LN_pbeWithMD5AndCast5_CBC \"pbeWithMD5AndCast5CBC\"\n#define NID_pbeWithMD5AndCast5_CBC 112\n#define OBJ_pbeWithMD5AndCast5_CBC OBJ_ISO_US,113533L,7L,66L,12L\n\n#define SN_id_PasswordBasedMAC \"id-PasswordBasedMAC\"\n#define LN_id_PasswordBasedMAC \"password based MAC\"\n#define NID_id_PasswordBasedMAC 782\n#define OBJ_id_PasswordBasedMAC OBJ_ISO_US,113533L,7L,66L,13L\n\n#define SN_id_DHBasedMac \"id-DHBasedMac\"\n#define LN_id_DHBasedMac \"Diffie-Hellman based MAC\"\n#define NID_id_DHBasedMac 783\n#define OBJ_id_DHBasedMac OBJ_ISO_US,113533L,7L,66L,30L\n\n#define SN_rsadsi \"rsadsi\"\n#define LN_rsadsi \"RSA Data Security, Inc.\"\n#define NID_rsadsi 1\n#define OBJ_rsadsi OBJ_ISO_US,113549L\n\n#define SN_pkcs \"pkcs\"\n#define LN_pkcs \"RSA Data Security, Inc. PKCS\"\n#define NID_pkcs 2\n#define OBJ_pkcs OBJ_rsadsi,1L\n\n#define SN_pkcs1 \"pkcs1\"\n#define NID_pkcs1 186\n#define OBJ_pkcs1 OBJ_pkcs,1L\n\n#define LN_rsaEncryption \"rsaEncryption\"\n#define NID_rsaEncryption 6\n#define OBJ_rsaEncryption OBJ_pkcs1,1L\n\n#define SN_md2WithRSAEncryption \"RSA-MD2\"\n#define LN_md2WithRSAEncryption \"md2WithRSAEncryption\"\n#define NID_md2WithRSAEncryption 7\n#define OBJ_md2WithRSAEncryption OBJ_pkcs1,2L\n\n#define SN_md4WithRSAEncryption \"RSA-MD4\"\n#define LN_md4WithRSAEncryption \"md4WithRSAEncryption\"\n#define NID_md4WithRSAEncryption 396\n#define OBJ_md4WithRSAEncryption OBJ_pkcs1,3L\n\n#define SN_md5WithRSAEncryption \"RSA-MD5\"\n#define LN_md5WithRSAEncryption \"md5WithRSAEncryption\"\n#define NID_md5WithRSAEncryption 8\n#define OBJ_md5WithRSAEncryption OBJ_pkcs1,4L\n\n#define SN_sha1WithRSAEncryption \"RSA-SHA1\"\n#define LN_sha1WithRSAEncryption \"sha1WithRSAEncryption\"\n#define NID_sha1WithRSAEncryption 65\n#define OBJ_sha1WithRSAEncryption OBJ_pkcs1,5L\n\n#define SN_rsaesOaep \"RSAES-OAEP\"\n#define LN_rsaesOaep \"rsaesOaep\"\n#define NID_rsaesOaep 919\n#define OBJ_rsaesOaep OBJ_pkcs1,7L\n\n#define SN_mgf1 \"MGF1\"\n#define LN_mgf1 \"mgf1\"\n#define NID_mgf1 911\n#define OBJ_mgf1 OBJ_pkcs1,8L\n\n#define SN_pSpecified \"PSPECIFIED\"\n#define LN_pSpecified \"pSpecified\"\n#define NID_pSpecified 935\n#define OBJ_pSpecified OBJ_pkcs1,9L\n\n#define SN_rsassaPss \"RSASSA-PSS\"\n#define LN_rsassaPss \"rsassaPss\"\n#define NID_rsassaPss 912\n#define OBJ_rsassaPss OBJ_pkcs1,10L\n\n#define SN_sha256WithRSAEncryption \"RSA-SHA256\"\n#define LN_sha256WithRSAEncryption \"sha256WithRSAEncryption\"\n#define NID_sha256WithRSAEncryption 668\n#define OBJ_sha256WithRSAEncryption OBJ_pkcs1,11L\n\n#define SN_sha384WithRSAEncryption \"RSA-SHA384\"\n#define LN_sha384WithRSAEncryption \"sha384WithRSAEncryption\"\n#define NID_sha384WithRSAEncryption 669\n#define OBJ_sha384WithRSAEncryption OBJ_pkcs1,12L\n\n#define SN_sha512WithRSAEncryption \"RSA-SHA512\"\n#define LN_sha512WithRSAEncryption \"sha512WithRSAEncryption\"\n#define NID_sha512WithRSAEncryption 670\n#define OBJ_sha512WithRSAEncryption OBJ_pkcs1,13L\n\n#define SN_sha224WithRSAEncryption \"RSA-SHA224\"\n#define LN_sha224WithRSAEncryption \"sha224WithRSAEncryption\"\n#define NID_sha224WithRSAEncryption 671\n#define OBJ_sha224WithRSAEncryption OBJ_pkcs1,14L\n\n#define SN_sha512_224WithRSAEncryption \"RSA-SHA512/224\"\n#define LN_sha512_224WithRSAEncryption \"sha512-224WithRSAEncryption\"\n#define NID_sha512_224WithRSAEncryption 1145\n#define OBJ_sha512_224WithRSAEncryption OBJ_pkcs1,15L\n\n#define SN_sha512_256WithRSAEncryption \"RSA-SHA512/256\"\n#define LN_sha512_256WithRSAEncryption \"sha512-256WithRSAEncryption\"\n#define NID_sha512_256WithRSAEncryption 1146\n#define OBJ_sha512_256WithRSAEncryption OBJ_pkcs1,16L\n\n#define SN_pkcs3 \"pkcs3\"\n#define NID_pkcs3 27\n#define OBJ_pkcs3 OBJ_pkcs,3L\n\n#define LN_dhKeyAgreement \"dhKeyAgreement\"\n#define NID_dhKeyAgreement 28\n#define OBJ_dhKeyAgreement OBJ_pkcs3,1L\n\n#define SN_pkcs5 \"pkcs5\"\n#define NID_pkcs5 187\n#define OBJ_pkcs5 OBJ_pkcs,5L\n\n#define SN_pbeWithMD2AndDES_CBC \"PBE-MD2-DES\"\n#define LN_pbeWithMD2AndDES_CBC \"pbeWithMD2AndDES-CBC\"\n#define NID_pbeWithMD2AndDES_CBC 9\n#define OBJ_pbeWithMD2AndDES_CBC OBJ_pkcs5,1L\n\n#define SN_pbeWithMD5AndDES_CBC \"PBE-MD5-DES\"\n#define LN_pbeWithMD5AndDES_CBC \"pbeWithMD5AndDES-CBC\"\n#define NID_pbeWithMD5AndDES_CBC 10\n#define OBJ_pbeWithMD5AndDES_CBC OBJ_pkcs5,3L\n\n#define SN_pbeWithMD2AndRC2_CBC \"PBE-MD2-RC2-64\"\n#define LN_pbeWithMD2AndRC2_CBC \"pbeWithMD2AndRC2-CBC\"\n#define NID_pbeWithMD2AndRC2_CBC 168\n#define OBJ_pbeWithMD2AndRC2_CBC OBJ_pkcs5,4L\n\n#define SN_pbeWithMD5AndRC2_CBC \"PBE-MD5-RC2-64\"\n#define LN_pbeWithMD5AndRC2_CBC \"pbeWithMD5AndRC2-CBC\"\n#define NID_pbeWithMD5AndRC2_CBC 169\n#define OBJ_pbeWithMD5AndRC2_CBC OBJ_pkcs5,6L\n\n#define SN_pbeWithSHA1AndDES_CBC \"PBE-SHA1-DES\"\n#define LN_pbeWithSHA1AndDES_CBC \"pbeWithSHA1AndDES-CBC\"\n#define NID_pbeWithSHA1AndDES_CBC 170\n#define OBJ_pbeWithSHA1AndDES_CBC OBJ_pkcs5,10L\n\n#define SN_pbeWithSHA1AndRC2_CBC \"PBE-SHA1-RC2-64\"\n#define LN_pbeWithSHA1AndRC2_CBC \"pbeWithSHA1AndRC2-CBC\"\n#define NID_pbeWithSHA1AndRC2_CBC 68\n#define OBJ_pbeWithSHA1AndRC2_CBC OBJ_pkcs5,11L\n\n#define LN_id_pbkdf2 \"PBKDF2\"\n#define NID_id_pbkdf2 69\n#define OBJ_id_pbkdf2 OBJ_pkcs5,12L\n\n#define LN_pbes2 \"PBES2\"\n#define NID_pbes2 161\n#define OBJ_pbes2 OBJ_pkcs5,13L\n\n#define LN_pbmac1 \"PBMAC1\"\n#define NID_pbmac1 162\n#define OBJ_pbmac1 OBJ_pkcs5,14L\n\n#define SN_pkcs7 \"pkcs7\"\n#define NID_pkcs7 20\n#define OBJ_pkcs7 OBJ_pkcs,7L\n\n#define LN_pkcs7_data \"pkcs7-data\"\n#define NID_pkcs7_data 21\n#define OBJ_pkcs7_data OBJ_pkcs7,1L\n\n#define LN_pkcs7_signed \"pkcs7-signedData\"\n#define NID_pkcs7_signed 22\n#define OBJ_pkcs7_signed OBJ_pkcs7,2L\n\n#define LN_pkcs7_enveloped \"pkcs7-envelopedData\"\n#define NID_pkcs7_enveloped 23\n#define OBJ_pkcs7_enveloped OBJ_pkcs7,3L\n\n#define LN_pkcs7_signedAndEnveloped \"pkcs7-signedAndEnvelopedData\"\n#define NID_pkcs7_signedAndEnveloped 24\n#define OBJ_pkcs7_signedAndEnveloped OBJ_pkcs7,4L\n\n#define LN_pkcs7_digest \"pkcs7-digestData\"\n#define NID_pkcs7_digest 25\n#define OBJ_pkcs7_digest OBJ_pkcs7,5L\n\n#define LN_pkcs7_encrypted \"pkcs7-encryptedData\"\n#define NID_pkcs7_encrypted 26\n#define OBJ_pkcs7_encrypted OBJ_pkcs7,6L\n\n#define SN_pkcs9 \"pkcs9\"\n#define NID_pkcs9 47\n#define OBJ_pkcs9 OBJ_pkcs,9L\n\n#define LN_pkcs9_emailAddress \"emailAddress\"\n#define NID_pkcs9_emailAddress 48\n#define OBJ_pkcs9_emailAddress OBJ_pkcs9,1L\n\n#define LN_pkcs9_unstructuredName \"unstructuredName\"\n#define NID_pkcs9_unstructuredName 49\n#define OBJ_pkcs9_unstructuredName OBJ_pkcs9,2L\n\n#define LN_pkcs9_contentType \"contentType\"\n#define NID_pkcs9_contentType 50\n#define OBJ_pkcs9_contentType OBJ_pkcs9,3L\n\n#define LN_pkcs9_messageDigest \"messageDigest\"\n#define NID_pkcs9_messageDigest 51\n#define OBJ_pkcs9_messageDigest OBJ_pkcs9,4L\n\n#define LN_pkcs9_signingTime \"signingTime\"\n#define NID_pkcs9_signingTime 52\n#define OBJ_pkcs9_signingTime OBJ_pkcs9,5L\n\n#define LN_pkcs9_countersignature \"countersignature\"\n#define NID_pkcs9_countersignature 53\n#define OBJ_pkcs9_countersignature OBJ_pkcs9,6L\n\n#define LN_pkcs9_challengePassword \"challengePassword\"\n#define NID_pkcs9_challengePassword 54\n#define OBJ_pkcs9_challengePassword OBJ_pkcs9,7L\n\n#define LN_pkcs9_unstructuredAddress \"unstructuredAddress\"\n#define NID_pkcs9_unstructuredAddress 55\n#define OBJ_pkcs9_unstructuredAddress OBJ_pkcs9,8L\n\n#define LN_pkcs9_extCertAttributes \"extendedCertificateAttributes\"\n#define NID_pkcs9_extCertAttributes 56\n#define OBJ_pkcs9_extCertAttributes OBJ_pkcs9,9L\n\n#define SN_ext_req \"extReq\"\n#define LN_ext_req \"Extension Request\"\n#define NID_ext_req 172\n#define OBJ_ext_req OBJ_pkcs9,14L\n\n#define SN_SMIMECapabilities \"SMIME-CAPS\"\n#define LN_SMIMECapabilities \"S/MIME Capabilities\"\n#define NID_SMIMECapabilities 167\n#define OBJ_SMIMECapabilities OBJ_pkcs9,15L\n\n#define SN_SMIME \"SMIME\"\n#define LN_SMIME \"S/MIME\"\n#define NID_SMIME 188\n#define OBJ_SMIME OBJ_pkcs9,16L\n\n#define SN_id_smime_mod \"id-smime-mod\"\n#define NID_id_smime_mod 189\n#define OBJ_id_smime_mod OBJ_SMIME,0L\n\n#define SN_id_smime_ct \"id-smime-ct\"\n#define NID_id_smime_ct 190\n#define OBJ_id_smime_ct OBJ_SMIME,1L\n\n#define SN_id_smime_aa \"id-smime-aa\"\n#define NID_id_smime_aa 191\n#define OBJ_id_smime_aa OBJ_SMIME,2L\n\n#define SN_id_smime_alg \"id-smime-alg\"\n#define NID_id_smime_alg 192\n#define OBJ_id_smime_alg OBJ_SMIME,3L\n\n#define SN_id_smime_cd \"id-smime-cd\"\n#define NID_id_smime_cd 193\n#define OBJ_id_smime_cd OBJ_SMIME,4L\n\n#define SN_id_smime_spq \"id-smime-spq\"\n#define NID_id_smime_spq 194\n#define OBJ_id_smime_spq OBJ_SMIME,5L\n\n#define SN_id_smime_cti \"id-smime-cti\"\n#define NID_id_smime_cti 195\n#define OBJ_id_smime_cti OBJ_SMIME,6L\n\n#define SN_id_smime_mod_cms \"id-smime-mod-cms\"\n#define NID_id_smime_mod_cms 196\n#define OBJ_id_smime_mod_cms OBJ_id_smime_mod,1L\n\n#define SN_id_smime_mod_ess \"id-smime-mod-ess\"\n#define NID_id_smime_mod_ess 197\n#define OBJ_id_smime_mod_ess OBJ_id_smime_mod,2L\n\n#define SN_id_smime_mod_oid \"id-smime-mod-oid\"\n#define NID_id_smime_mod_oid 198\n#define OBJ_id_smime_mod_oid OBJ_id_smime_mod,3L\n\n#define SN_id_smime_mod_msg_v3 \"id-smime-mod-msg-v3\"\n#define NID_id_smime_mod_msg_v3 199\n#define OBJ_id_smime_mod_msg_v3 OBJ_id_smime_mod,4L\n\n#define SN_id_smime_mod_ets_eSignature_88 \"id-smime-mod-ets-eSignature-88\"\n#define NID_id_smime_mod_ets_eSignature_88 200\n#define OBJ_id_smime_mod_ets_eSignature_88 OBJ_id_smime_mod,5L\n\n#define SN_id_smime_mod_ets_eSignature_97 \"id-smime-mod-ets-eSignature-97\"\n#define NID_id_smime_mod_ets_eSignature_97 201\n#define OBJ_id_smime_mod_ets_eSignature_97 OBJ_id_smime_mod,6L\n\n#define SN_id_smime_mod_ets_eSigPolicy_88 \"id-smime-mod-ets-eSigPolicy-88\"\n#define NID_id_smime_mod_ets_eSigPolicy_88 202\n#define OBJ_id_smime_mod_ets_eSigPolicy_88 OBJ_id_smime_mod,7L\n\n#define SN_id_smime_mod_ets_eSigPolicy_97 \"id-smime-mod-ets-eSigPolicy-97\"\n#define NID_id_smime_mod_ets_eSigPolicy_97 203\n#define OBJ_id_smime_mod_ets_eSigPolicy_97 OBJ_id_smime_mod,8L\n\n#define SN_id_smime_ct_receipt \"id-smime-ct-receipt\"\n#define NID_id_smime_ct_receipt 204\n#define OBJ_id_smime_ct_receipt OBJ_id_smime_ct,1L\n\n#define SN_id_smime_ct_authData \"id-smime-ct-authData\"\n#define NID_id_smime_ct_authData 205\n#define OBJ_id_smime_ct_authData OBJ_id_smime_ct,2L\n\n#define SN_id_smime_ct_publishCert \"id-smime-ct-publishCert\"\n#define NID_id_smime_ct_publishCert 206\n#define OBJ_id_smime_ct_publishCert OBJ_id_smime_ct,3L\n\n#define SN_id_smime_ct_TSTInfo \"id-smime-ct-TSTInfo\"\n#define NID_id_smime_ct_TSTInfo 207\n#define OBJ_id_smime_ct_TSTInfo OBJ_id_smime_ct,4L\n\n#define SN_id_smime_ct_TDTInfo \"id-smime-ct-TDTInfo\"\n#define NID_id_smime_ct_TDTInfo 208\n#define OBJ_id_smime_ct_TDTInfo OBJ_id_smime_ct,5L\n\n#define SN_id_smime_ct_contentInfo \"id-smime-ct-contentInfo\"\n#define NID_id_smime_ct_contentInfo 209\n#define OBJ_id_smime_ct_contentInfo OBJ_id_smime_ct,6L\n\n#define SN_id_smime_ct_DVCSRequestData \"id-smime-ct-DVCSRequestData\"\n#define NID_id_smime_ct_DVCSRequestData 210\n#define OBJ_id_smime_ct_DVCSRequestData OBJ_id_smime_ct,7L\n\n#define SN_id_smime_ct_DVCSResponseData \"id-smime-ct-DVCSResponseData\"\n#define NID_id_smime_ct_DVCSResponseData 211\n#define OBJ_id_smime_ct_DVCSResponseData OBJ_id_smime_ct,8L\n\n#define SN_id_smime_ct_compressedData \"id-smime-ct-compressedData\"\n#define NID_id_smime_ct_compressedData 786\n#define OBJ_id_smime_ct_compressedData OBJ_id_smime_ct,9L\n\n#define SN_id_smime_ct_contentCollection \"id-smime-ct-contentCollection\"\n#define NID_id_smime_ct_contentCollection 1058\n#define OBJ_id_smime_ct_contentCollection OBJ_id_smime_ct,19L\n\n#define SN_id_smime_ct_authEnvelopedData \"id-smime-ct-authEnvelopedData\"\n#define NID_id_smime_ct_authEnvelopedData 1059\n#define OBJ_id_smime_ct_authEnvelopedData OBJ_id_smime_ct,23L\n\n#define SN_id_ct_asciiTextWithCRLF \"id-ct-asciiTextWithCRLF\"\n#define NID_id_ct_asciiTextWithCRLF 787\n#define OBJ_id_ct_asciiTextWithCRLF OBJ_id_smime_ct,27L\n\n#define SN_id_ct_xml \"id-ct-xml\"\n#define NID_id_ct_xml 1060\n#define OBJ_id_ct_xml OBJ_id_smime_ct,28L\n\n#define SN_id_smime_aa_receiptRequest \"id-smime-aa-receiptRequest\"\n#define NID_id_smime_aa_receiptRequest 212\n#define OBJ_id_smime_aa_receiptRequest OBJ_id_smime_aa,1L\n\n#define SN_id_smime_aa_securityLabel \"id-smime-aa-securityLabel\"\n#define NID_id_smime_aa_securityLabel 213\n#define OBJ_id_smime_aa_securityLabel OBJ_id_smime_aa,2L\n\n#define SN_id_smime_aa_mlExpandHistory \"id-smime-aa-mlExpandHistory\"\n#define NID_id_smime_aa_mlExpandHistory 214\n#define OBJ_id_smime_aa_mlExpandHistory OBJ_id_smime_aa,3L\n\n#define SN_id_smime_aa_contentHint \"id-smime-aa-contentHint\"\n#define NID_id_smime_aa_contentHint 215\n#define OBJ_id_smime_aa_contentHint OBJ_id_smime_aa,4L\n\n#define SN_id_smime_aa_msgSigDigest \"id-smime-aa-msgSigDigest\"\n#define NID_id_smime_aa_msgSigDigest 216\n#define OBJ_id_smime_aa_msgSigDigest OBJ_id_smime_aa,5L\n\n#define SN_id_smime_aa_encapContentType \"id-smime-aa-encapContentType\"\n#define NID_id_smime_aa_encapContentType 217\n#define OBJ_id_smime_aa_encapContentType OBJ_id_smime_aa,6L\n\n#define SN_id_smime_aa_contentIdentifier \"id-smime-aa-contentIdentifier\"\n#define NID_id_smime_aa_contentIdentifier 218\n#define OBJ_id_smime_aa_contentIdentifier OBJ_id_smime_aa,7L\n\n#define SN_id_smime_aa_macValue \"id-smime-aa-macValue\"\n#define NID_id_smime_aa_macValue 219\n#define OBJ_id_smime_aa_macValue OBJ_id_smime_aa,8L\n\n#define SN_id_smime_aa_equivalentLabels \"id-smime-aa-equivalentLabels\"\n#define NID_id_smime_aa_equivalentLabels 220\n#define OBJ_id_smime_aa_equivalentLabels OBJ_id_smime_aa,9L\n\n#define SN_id_smime_aa_contentReference \"id-smime-aa-contentReference\"\n#define NID_id_smime_aa_contentReference 221\n#define OBJ_id_smime_aa_contentReference OBJ_id_smime_aa,10L\n\n#define SN_id_smime_aa_encrypKeyPref \"id-smime-aa-encrypKeyPref\"\n#define NID_id_smime_aa_encrypKeyPref 222\n#define OBJ_id_smime_aa_encrypKeyPref OBJ_id_smime_aa,11L\n\n#define SN_id_smime_aa_signingCertificate \"id-smime-aa-signingCertificate\"\n#define NID_id_smime_aa_signingCertificate 223\n#define OBJ_id_smime_aa_signingCertificate OBJ_id_smime_aa,12L\n\n#define SN_id_smime_aa_smimeEncryptCerts \"id-smime-aa-smimeEncryptCerts\"\n#define NID_id_smime_aa_smimeEncryptCerts 224\n#define OBJ_id_smime_aa_smimeEncryptCerts OBJ_id_smime_aa,13L\n\n#define SN_id_smime_aa_timeStampToken \"id-smime-aa-timeStampToken\"\n#define NID_id_smime_aa_timeStampToken 225\n#define OBJ_id_smime_aa_timeStampToken OBJ_id_smime_aa,14L\n\n#define SN_id_smime_aa_ets_sigPolicyId \"id-smime-aa-ets-sigPolicyId\"\n#define NID_id_smime_aa_ets_sigPolicyId 226\n#define OBJ_id_smime_aa_ets_sigPolicyId OBJ_id_smime_aa,15L\n\n#define SN_id_smime_aa_ets_commitmentType \"id-smime-aa-ets-commitmentType\"\n#define NID_id_smime_aa_ets_commitmentType 227\n#define OBJ_id_smime_aa_ets_commitmentType OBJ_id_smime_aa,16L\n\n#define SN_id_smime_aa_ets_signerLocation \"id-smime-aa-ets-signerLocation\"\n#define NID_id_smime_aa_ets_signerLocation 228\n#define OBJ_id_smime_aa_ets_signerLocation OBJ_id_smime_aa,17L\n\n#define SN_id_smime_aa_ets_signerAttr \"id-smime-aa-ets-signerAttr\"\n#define NID_id_smime_aa_ets_signerAttr 229\n#define OBJ_id_smime_aa_ets_signerAttr OBJ_id_smime_aa,18L\n\n#define SN_id_smime_aa_ets_otherSigCert \"id-smime-aa-ets-otherSigCert\"\n#define NID_id_smime_aa_ets_otherSigCert 230\n#define OBJ_id_smime_aa_ets_otherSigCert OBJ_id_smime_aa,19L\n\n#define SN_id_smime_aa_ets_contentTimestamp \"id-smime-aa-ets-contentTimestamp\"\n#define NID_id_smime_aa_ets_contentTimestamp 231\n#define OBJ_id_smime_aa_ets_contentTimestamp OBJ_id_smime_aa,20L\n\n#define SN_id_smime_aa_ets_CertificateRefs \"id-smime-aa-ets-CertificateRefs\"\n#define NID_id_smime_aa_ets_CertificateRefs 232\n#define OBJ_id_smime_aa_ets_CertificateRefs OBJ_id_smime_aa,21L\n\n#define SN_id_smime_aa_ets_RevocationRefs \"id-smime-aa-ets-RevocationRefs\"\n#define NID_id_smime_aa_ets_RevocationRefs 233\n#define OBJ_id_smime_aa_ets_RevocationRefs OBJ_id_smime_aa,22L\n\n#define SN_id_smime_aa_ets_certValues \"id-smime-aa-ets-certValues\"\n#define NID_id_smime_aa_ets_certValues 234\n#define OBJ_id_smime_aa_ets_certValues OBJ_id_smime_aa,23L\n\n#define SN_id_smime_aa_ets_revocationValues \"id-smime-aa-ets-revocationValues\"\n#define NID_id_smime_aa_ets_revocationValues 235\n#define OBJ_id_smime_aa_ets_revocationValues OBJ_id_smime_aa,24L\n\n#define SN_id_smime_aa_ets_escTimeStamp \"id-smime-aa-ets-escTimeStamp\"\n#define NID_id_smime_aa_ets_escTimeStamp 236\n#define OBJ_id_smime_aa_ets_escTimeStamp OBJ_id_smime_aa,25L\n\n#define SN_id_smime_aa_ets_certCRLTimestamp \"id-smime-aa-ets-certCRLTimestamp\"\n#define NID_id_smime_aa_ets_certCRLTimestamp 237\n#define OBJ_id_smime_aa_ets_certCRLTimestamp OBJ_id_smime_aa,26L\n\n#define SN_id_smime_aa_ets_archiveTimeStamp \"id-smime-aa-ets-archiveTimeStamp\"\n#define NID_id_smime_aa_ets_archiveTimeStamp 238\n#define OBJ_id_smime_aa_ets_archiveTimeStamp OBJ_id_smime_aa,27L\n\n#define SN_id_smime_aa_signatureType \"id-smime-aa-signatureType\"\n#define NID_id_smime_aa_signatureType 239\n#define OBJ_id_smime_aa_signatureType OBJ_id_smime_aa,28L\n\n#define SN_id_smime_aa_dvcs_dvc \"id-smime-aa-dvcs-dvc\"\n#define NID_id_smime_aa_dvcs_dvc 240\n#define OBJ_id_smime_aa_dvcs_dvc OBJ_id_smime_aa,29L\n\n#define SN_id_smime_aa_signingCertificateV2 \"id-smime-aa-signingCertificateV2\"\n#define NID_id_smime_aa_signingCertificateV2 1086\n#define OBJ_id_smime_aa_signingCertificateV2 OBJ_id_smime_aa,47L\n\n#define SN_id_smime_alg_ESDHwith3DES \"id-smime-alg-ESDHwith3DES\"\n#define NID_id_smime_alg_ESDHwith3DES 241\n#define OBJ_id_smime_alg_ESDHwith3DES OBJ_id_smime_alg,1L\n\n#define SN_id_smime_alg_ESDHwithRC2 \"id-smime-alg-ESDHwithRC2\"\n#define NID_id_smime_alg_ESDHwithRC2 242\n#define OBJ_id_smime_alg_ESDHwithRC2 OBJ_id_smime_alg,2L\n\n#define SN_id_smime_alg_3DESwrap \"id-smime-alg-3DESwrap\"\n#define NID_id_smime_alg_3DESwrap 243\n#define OBJ_id_smime_alg_3DESwrap OBJ_id_smime_alg,3L\n\n#define SN_id_smime_alg_RC2wrap \"id-smime-alg-RC2wrap\"\n#define NID_id_smime_alg_RC2wrap 244\n#define OBJ_id_smime_alg_RC2wrap OBJ_id_smime_alg,4L\n\n#define SN_id_smime_alg_ESDH \"id-smime-alg-ESDH\"\n#define NID_id_smime_alg_ESDH 245\n#define OBJ_id_smime_alg_ESDH OBJ_id_smime_alg,5L\n\n#define SN_id_smime_alg_CMS3DESwrap \"id-smime-alg-CMS3DESwrap\"\n#define NID_id_smime_alg_CMS3DESwrap 246\n#define OBJ_id_smime_alg_CMS3DESwrap OBJ_id_smime_alg,6L\n\n#define SN_id_smime_alg_CMSRC2wrap \"id-smime-alg-CMSRC2wrap\"\n#define NID_id_smime_alg_CMSRC2wrap 247\n#define OBJ_id_smime_alg_CMSRC2wrap OBJ_id_smime_alg,7L\n\n#define SN_id_alg_PWRI_KEK \"id-alg-PWRI-KEK\"\n#define NID_id_alg_PWRI_KEK 893\n#define OBJ_id_alg_PWRI_KEK OBJ_id_smime_alg,9L\n\n#define SN_id_smime_cd_ldap \"id-smime-cd-ldap\"\n#define NID_id_smime_cd_ldap 248\n#define OBJ_id_smime_cd_ldap OBJ_id_smime_cd,1L\n\n#define SN_id_smime_spq_ets_sqt_uri \"id-smime-spq-ets-sqt-uri\"\n#define NID_id_smime_spq_ets_sqt_uri 249\n#define OBJ_id_smime_spq_ets_sqt_uri OBJ_id_smime_spq,1L\n\n#define SN_id_smime_spq_ets_sqt_unotice \"id-smime-spq-ets-sqt-unotice\"\n#define NID_id_smime_spq_ets_sqt_unotice 250\n#define OBJ_id_smime_spq_ets_sqt_unotice OBJ_id_smime_spq,2L\n\n#define SN_id_smime_cti_ets_proofOfOrigin \"id-smime-cti-ets-proofOfOrigin\"\n#define NID_id_smime_cti_ets_proofOfOrigin 251\n#define OBJ_id_smime_cti_ets_proofOfOrigin OBJ_id_smime_cti,1L\n\n#define SN_id_smime_cti_ets_proofOfReceipt \"id-smime-cti-ets-proofOfReceipt\"\n#define NID_id_smime_cti_ets_proofOfReceipt 252\n#define OBJ_id_smime_cti_ets_proofOfReceipt OBJ_id_smime_cti,2L\n\n#define SN_id_smime_cti_ets_proofOfDelivery \"id-smime-cti-ets-proofOfDelivery\"\n#define NID_id_smime_cti_ets_proofOfDelivery 253\n#define OBJ_id_smime_cti_ets_proofOfDelivery OBJ_id_smime_cti,3L\n\n#define SN_id_smime_cti_ets_proofOfSender \"id-smime-cti-ets-proofOfSender\"\n#define NID_id_smime_cti_ets_proofOfSender 254\n#define OBJ_id_smime_cti_ets_proofOfSender OBJ_id_smime_cti,4L\n\n#define SN_id_smime_cti_ets_proofOfApproval \"id-smime-cti-ets-proofOfApproval\"\n#define NID_id_smime_cti_ets_proofOfApproval 255\n#define OBJ_id_smime_cti_ets_proofOfApproval OBJ_id_smime_cti,5L\n\n#define SN_id_smime_cti_ets_proofOfCreation \"id-smime-cti-ets-proofOfCreation\"\n#define NID_id_smime_cti_ets_proofOfCreation 256\n#define OBJ_id_smime_cti_ets_proofOfCreation OBJ_id_smime_cti,6L\n\n#define LN_friendlyName \"friendlyName\"\n#define NID_friendlyName 156\n#define OBJ_friendlyName OBJ_pkcs9,20L\n\n#define LN_localKeyID \"localKeyID\"\n#define NID_localKeyID 157\n#define OBJ_localKeyID OBJ_pkcs9,21L\n\n#define SN_ms_csp_name \"CSPName\"\n#define LN_ms_csp_name \"Microsoft CSP Name\"\n#define NID_ms_csp_name 417\n#define OBJ_ms_csp_name 1L,3L,6L,1L,4L,1L,311L,17L,1L\n\n#define SN_LocalKeySet \"LocalKeySet\"\n#define LN_LocalKeySet \"Microsoft Local Key set\"\n#define NID_LocalKeySet 856\n#define OBJ_LocalKeySet 1L,3L,6L,1L,4L,1L,311L,17L,2L\n\n#define OBJ_certTypes OBJ_pkcs9,22L\n\n#define LN_x509Certificate \"x509Certificate\"\n#define NID_x509Certificate 158\n#define OBJ_x509Certificate OBJ_certTypes,1L\n\n#define LN_sdsiCertificate \"sdsiCertificate\"\n#define NID_sdsiCertificate 159\n#define OBJ_sdsiCertificate OBJ_certTypes,2L\n\n#define OBJ_crlTypes OBJ_pkcs9,23L\n\n#define LN_x509Crl \"x509Crl\"\n#define NID_x509Crl 160\n#define OBJ_x509Crl OBJ_crlTypes,1L\n\n#define OBJ_pkcs12 OBJ_pkcs,12L\n\n#define OBJ_pkcs12_pbeids OBJ_pkcs12,1L\n\n#define SN_pbe_WithSHA1And128BitRC4 \"PBE-SHA1-RC4-128\"\n#define LN_pbe_WithSHA1And128BitRC4 \"pbeWithSHA1And128BitRC4\"\n#define NID_pbe_WithSHA1And128BitRC4 144\n#define OBJ_pbe_WithSHA1And128BitRC4 OBJ_pkcs12_pbeids,1L\n\n#define SN_pbe_WithSHA1And40BitRC4 \"PBE-SHA1-RC4-40\"\n#define LN_pbe_WithSHA1And40BitRC4 \"pbeWithSHA1And40BitRC4\"\n#define NID_pbe_WithSHA1And40BitRC4 145\n#define OBJ_pbe_WithSHA1And40BitRC4 OBJ_pkcs12_pbeids,2L\n\n#define SN_pbe_WithSHA1And3_Key_TripleDES_CBC \"PBE-SHA1-3DES\"\n#define LN_pbe_WithSHA1And3_Key_TripleDES_CBC \"pbeWithSHA1And3-KeyTripleDES-CBC\"\n#define NID_pbe_WithSHA1And3_Key_TripleDES_CBC 146\n#define OBJ_pbe_WithSHA1And3_Key_TripleDES_CBC OBJ_pkcs12_pbeids,3L\n\n#define SN_pbe_WithSHA1And2_Key_TripleDES_CBC \"PBE-SHA1-2DES\"\n#define LN_pbe_WithSHA1And2_Key_TripleDES_CBC \"pbeWithSHA1And2-KeyTripleDES-CBC\"\n#define NID_pbe_WithSHA1And2_Key_TripleDES_CBC 147\n#define OBJ_pbe_WithSHA1And2_Key_TripleDES_CBC OBJ_pkcs12_pbeids,4L\n\n#define SN_pbe_WithSHA1And128BitRC2_CBC \"PBE-SHA1-RC2-128\"\n#define LN_pbe_WithSHA1And128BitRC2_CBC \"pbeWithSHA1And128BitRC2-CBC\"\n#define NID_pbe_WithSHA1And128BitRC2_CBC 148\n#define OBJ_pbe_WithSHA1And128BitRC2_CBC OBJ_pkcs12_pbeids,5L\n\n#define SN_pbe_WithSHA1And40BitRC2_CBC \"PBE-SHA1-RC2-40\"\n#define LN_pbe_WithSHA1And40BitRC2_CBC \"pbeWithSHA1And40BitRC2-CBC\"\n#define NID_pbe_WithSHA1And40BitRC2_CBC 149\n#define OBJ_pbe_WithSHA1And40BitRC2_CBC OBJ_pkcs12_pbeids,6L\n\n#define OBJ_pkcs12_Version1 OBJ_pkcs12,10L\n\n#define OBJ_pkcs12_BagIds OBJ_pkcs12_Version1,1L\n\n#define LN_keyBag \"keyBag\"\n#define NID_keyBag 150\n#define OBJ_keyBag OBJ_pkcs12_BagIds,1L\n\n#define LN_pkcs8ShroudedKeyBag \"pkcs8ShroudedKeyBag\"\n#define NID_pkcs8ShroudedKeyBag 151\n#define OBJ_pkcs8ShroudedKeyBag OBJ_pkcs12_BagIds,2L\n\n#define LN_certBag \"certBag\"\n#define NID_certBag 152\n#define OBJ_certBag OBJ_pkcs12_BagIds,3L\n\n#define LN_crlBag \"crlBag\"\n#define NID_crlBag 153\n#define OBJ_crlBag OBJ_pkcs12_BagIds,4L\n\n#define LN_secretBag \"secretBag\"\n#define NID_secretBag 154\n#define OBJ_secretBag OBJ_pkcs12_BagIds,5L\n\n#define LN_safeContentsBag \"safeContentsBag\"\n#define NID_safeContentsBag 155\n#define OBJ_safeContentsBag OBJ_pkcs12_BagIds,6L\n\n#define SN_md2 \"MD2\"\n#define LN_md2 \"md2\"\n#define NID_md2 3\n#define OBJ_md2 OBJ_rsadsi,2L,2L\n\n#define SN_md4 \"MD4\"\n#define LN_md4 \"md4\"\n#define NID_md4 257\n#define OBJ_md4 OBJ_rsadsi,2L,4L\n\n#define SN_md5 \"MD5\"\n#define LN_md5 \"md5\"\n#define NID_md5 4\n#define OBJ_md5 OBJ_rsadsi,2L,5L\n\n#define SN_md5_sha1 \"MD5-SHA1\"\n#define LN_md5_sha1 \"md5-sha1\"\n#define NID_md5_sha1 114\n\n#define LN_hmacWithMD5 \"hmacWithMD5\"\n#define NID_hmacWithMD5 797\n#define OBJ_hmacWithMD5 OBJ_rsadsi,2L,6L\n\n#define LN_hmacWithSHA1 \"hmacWithSHA1\"\n#define NID_hmacWithSHA1 163\n#define OBJ_hmacWithSHA1 OBJ_rsadsi,2L,7L\n\n#define SN_sm2 \"SM2\"\n#define LN_sm2 \"sm2\"\n#define NID_sm2 1172\n#define OBJ_sm2 OBJ_sm_scheme,301L\n\n#define SN_sm3 \"SM3\"\n#define LN_sm3 \"sm3\"\n#define NID_sm3 1143\n#define OBJ_sm3 OBJ_sm_scheme,401L\n\n#define SN_sm3WithRSAEncryption \"RSA-SM3\"\n#define LN_sm3WithRSAEncryption \"sm3WithRSAEncryption\"\n#define NID_sm3WithRSAEncryption 1144\n#define OBJ_sm3WithRSAEncryption OBJ_sm_scheme,504L\n\n#define LN_hmacWithSHA224 \"hmacWithSHA224\"\n#define NID_hmacWithSHA224 798\n#define OBJ_hmacWithSHA224 OBJ_rsadsi,2L,8L\n\n#define LN_hmacWithSHA256 \"hmacWithSHA256\"\n#define NID_hmacWithSHA256 799\n#define OBJ_hmacWithSHA256 OBJ_rsadsi,2L,9L\n\n#define LN_hmacWithSHA384 \"hmacWithSHA384\"\n#define NID_hmacWithSHA384 800\n#define OBJ_hmacWithSHA384 OBJ_rsadsi,2L,10L\n\n#define LN_hmacWithSHA512 \"hmacWithSHA512\"\n#define NID_hmacWithSHA512 801\n#define OBJ_hmacWithSHA512 OBJ_rsadsi,2L,11L\n\n#define LN_hmacWithSHA512_224 \"hmacWithSHA512-224\"\n#define NID_hmacWithSHA512_224 1193\n#define OBJ_hmacWithSHA512_224 OBJ_rsadsi,2L,12L\n\n#define LN_hmacWithSHA512_256 \"hmacWithSHA512-256\"\n#define NID_hmacWithSHA512_256 1194\n#define OBJ_hmacWithSHA512_256 OBJ_rsadsi,2L,13L\n\n#define SN_rc2_cbc \"RC2-CBC\"\n#define LN_rc2_cbc \"rc2-cbc\"\n#define NID_rc2_cbc 37\n#define OBJ_rc2_cbc OBJ_rsadsi,3L,2L\n\n#define SN_rc2_ecb \"RC2-ECB\"\n#define LN_rc2_ecb \"rc2-ecb\"\n#define NID_rc2_ecb 38\n\n#define SN_rc2_cfb64 \"RC2-CFB\"\n#define LN_rc2_cfb64 \"rc2-cfb\"\n#define NID_rc2_cfb64 39\n\n#define SN_rc2_ofb64 \"RC2-OFB\"\n#define LN_rc2_ofb64 \"rc2-ofb\"\n#define NID_rc2_ofb64 40\n\n#define SN_rc2_40_cbc \"RC2-40-CBC\"\n#define LN_rc2_40_cbc \"rc2-40-cbc\"\n#define NID_rc2_40_cbc 98\n\n#define SN_rc2_64_cbc \"RC2-64-CBC\"\n#define LN_rc2_64_cbc \"rc2-64-cbc\"\n#define NID_rc2_64_cbc 166\n\n#define SN_rc4 \"RC4\"\n#define LN_rc4 \"rc4\"\n#define NID_rc4 5\n#define OBJ_rc4 OBJ_rsadsi,3L,4L\n\n#define SN_rc4_40 \"RC4-40\"\n#define LN_rc4_40 \"rc4-40\"\n#define NID_rc4_40 97\n\n#define SN_des_ede3_cbc \"DES-EDE3-CBC\"\n#define LN_des_ede3_cbc \"des-ede3-cbc\"\n#define NID_des_ede3_cbc 44\n#define OBJ_des_ede3_cbc OBJ_rsadsi,3L,7L\n\n#define SN_rc5_cbc \"RC5-CBC\"\n#define LN_rc5_cbc \"rc5-cbc\"\n#define NID_rc5_cbc 120\n#define OBJ_rc5_cbc OBJ_rsadsi,3L,8L\n\n#define SN_rc5_ecb \"RC5-ECB\"\n#define LN_rc5_ecb \"rc5-ecb\"\n#define NID_rc5_ecb 121\n\n#define SN_rc5_cfb64 \"RC5-CFB\"\n#define LN_rc5_cfb64 \"rc5-cfb\"\n#define NID_rc5_cfb64 122\n\n#define SN_rc5_ofb64 \"RC5-OFB\"\n#define LN_rc5_ofb64 \"rc5-ofb\"\n#define NID_rc5_ofb64 123\n\n#define SN_ms_ext_req \"msExtReq\"\n#define LN_ms_ext_req \"Microsoft Extension Request\"\n#define NID_ms_ext_req 171\n#define OBJ_ms_ext_req 1L,3L,6L,1L,4L,1L,311L,2L,1L,14L\n\n#define SN_ms_code_ind \"msCodeInd\"\n#define LN_ms_code_ind \"Microsoft Individual Code Signing\"\n#define NID_ms_code_ind 134\n#define OBJ_ms_code_ind 1L,3L,6L,1L,4L,1L,311L,2L,1L,21L\n\n#define SN_ms_code_com \"msCodeCom\"\n#define LN_ms_code_com \"Microsoft Commercial Code Signing\"\n#define NID_ms_code_com 135\n#define OBJ_ms_code_com 1L,3L,6L,1L,4L,1L,311L,2L,1L,22L\n\n#define SN_ms_ctl_sign \"msCTLSign\"\n#define LN_ms_ctl_sign \"Microsoft Trust List Signing\"\n#define NID_ms_ctl_sign 136\n#define OBJ_ms_ctl_sign 1L,3L,6L,1L,4L,1L,311L,10L,3L,1L\n\n#define SN_ms_sgc \"msSGC\"\n#define LN_ms_sgc \"Microsoft Server Gated Crypto\"\n#define NID_ms_sgc 137\n#define OBJ_ms_sgc 1L,3L,6L,1L,4L,1L,311L,10L,3L,3L\n\n#define SN_ms_efs \"msEFS\"\n#define LN_ms_efs \"Microsoft Encrypted File System\"\n#define NID_ms_efs 138\n#define OBJ_ms_efs 1L,3L,6L,1L,4L,1L,311L,10L,3L,4L\n\n#define SN_ms_smartcard_login \"msSmartcardLogin\"\n#define LN_ms_smartcard_login \"Microsoft Smartcard Login\"\n#define NID_ms_smartcard_login 648\n#define OBJ_ms_smartcard_login 1L,3L,6L,1L,4L,1L,311L,20L,2L,2L\n\n#define SN_ms_upn \"msUPN\"\n#define LN_ms_upn \"Microsoft User Principal Name\"\n#define NID_ms_upn 649\n#define OBJ_ms_upn 1L,3L,6L,1L,4L,1L,311L,20L,2L,3L\n\n#define SN_idea_cbc \"IDEA-CBC\"\n#define LN_idea_cbc \"idea-cbc\"\n#define NID_idea_cbc 34\n#define OBJ_idea_cbc 1L,3L,6L,1L,4L,1L,188L,7L,1L,1L,2L\n\n#define SN_idea_ecb \"IDEA-ECB\"\n#define LN_idea_ecb \"idea-ecb\"\n#define NID_idea_ecb 36\n\n#define SN_idea_cfb64 \"IDEA-CFB\"\n#define LN_idea_cfb64 \"idea-cfb\"\n#define NID_idea_cfb64 35\n\n#define SN_idea_ofb64 \"IDEA-OFB\"\n#define LN_idea_ofb64 \"idea-ofb\"\n#define NID_idea_ofb64 46\n\n#define SN_bf_cbc \"BF-CBC\"\n#define LN_bf_cbc \"bf-cbc\"\n#define NID_bf_cbc 91\n#define OBJ_bf_cbc 1L,3L,6L,1L,4L,1L,3029L,1L,2L\n\n#define SN_bf_ecb \"BF-ECB\"\n#define LN_bf_ecb \"bf-ecb\"\n#define NID_bf_ecb 92\n\n#define SN_bf_cfb64 \"BF-CFB\"\n#define LN_bf_cfb64 \"bf-cfb\"\n#define NID_bf_cfb64 93\n\n#define SN_bf_ofb64 \"BF-OFB\"\n#define LN_bf_ofb64 \"bf-ofb\"\n#define NID_bf_ofb64 94\n\n#define SN_id_pkix \"PKIX\"\n#define NID_id_pkix 127\n#define OBJ_id_pkix 1L,3L,6L,1L,5L,5L,7L\n\n#define SN_id_pkix_mod \"id-pkix-mod\"\n#define NID_id_pkix_mod 258\n#define OBJ_id_pkix_mod OBJ_id_pkix,0L\n\n#define SN_id_pe \"id-pe\"\n#define NID_id_pe 175\n#define OBJ_id_pe OBJ_id_pkix,1L\n\n#define SN_id_qt \"id-qt\"\n#define NID_id_qt 259\n#define OBJ_id_qt OBJ_id_pkix,2L\n\n#define SN_id_kp \"id-kp\"\n#define NID_id_kp 128\n#define OBJ_id_kp OBJ_id_pkix,3L\n\n#define SN_id_it \"id-it\"\n#define NID_id_it 260\n#define OBJ_id_it OBJ_id_pkix,4L\n\n#define SN_id_pkip \"id-pkip\"\n#define NID_id_pkip 261\n#define OBJ_id_pkip OBJ_id_pkix,5L\n\n#define SN_id_alg \"id-alg\"\n#define NID_id_alg 262\n#define OBJ_id_alg OBJ_id_pkix,6L\n\n#define SN_id_cmc \"id-cmc\"\n#define NID_id_cmc 263\n#define OBJ_id_cmc OBJ_id_pkix,7L\n\n#define SN_id_on \"id-on\"\n#define NID_id_on 264\n#define OBJ_id_on OBJ_id_pkix,8L\n\n#define SN_id_pda \"id-pda\"\n#define NID_id_pda 265\n#define OBJ_id_pda OBJ_id_pkix,9L\n\n#define SN_id_aca \"id-aca\"\n#define NID_id_aca 266\n#define OBJ_id_aca OBJ_id_pkix,10L\n\n#define SN_id_qcs \"id-qcs\"\n#define NID_id_qcs 267\n#define OBJ_id_qcs OBJ_id_pkix,11L\n\n#define SN_id_cct \"id-cct\"\n#define NID_id_cct 268\n#define OBJ_id_cct OBJ_id_pkix,12L\n\n#define SN_id_ppl \"id-ppl\"\n#define NID_id_ppl 662\n#define OBJ_id_ppl OBJ_id_pkix,21L\n\n#define SN_id_ad \"id-ad\"\n#define NID_id_ad 176\n#define OBJ_id_ad OBJ_id_pkix,48L\n\n#define SN_id_pkix1_explicit_88 \"id-pkix1-explicit-88\"\n#define NID_id_pkix1_explicit_88 269\n#define OBJ_id_pkix1_explicit_88 OBJ_id_pkix_mod,1L\n\n#define SN_id_pkix1_implicit_88 \"id-pkix1-implicit-88\"\n#define NID_id_pkix1_implicit_88 270\n#define OBJ_id_pkix1_implicit_88 OBJ_id_pkix_mod,2L\n\n#define SN_id_pkix1_explicit_93 \"id-pkix1-explicit-93\"\n#define NID_id_pkix1_explicit_93 271\n#define OBJ_id_pkix1_explicit_93 OBJ_id_pkix_mod,3L\n\n#define SN_id_pkix1_implicit_93 \"id-pkix1-implicit-93\"\n#define NID_id_pkix1_implicit_93 272\n#define OBJ_id_pkix1_implicit_93 OBJ_id_pkix_mod,4L\n\n#define SN_id_mod_crmf \"id-mod-crmf\"\n#define NID_id_mod_crmf 273\n#define OBJ_id_mod_crmf OBJ_id_pkix_mod,5L\n\n#define SN_id_mod_cmc \"id-mod-cmc\"\n#define NID_id_mod_cmc 274\n#define OBJ_id_mod_cmc OBJ_id_pkix_mod,6L\n\n#define SN_id_mod_kea_profile_88 \"id-mod-kea-profile-88\"\n#define NID_id_mod_kea_profile_88 275\n#define OBJ_id_mod_kea_profile_88 OBJ_id_pkix_mod,7L\n\n#define SN_id_mod_kea_profile_93 \"id-mod-kea-profile-93\"\n#define NID_id_mod_kea_profile_93 276\n#define OBJ_id_mod_kea_profile_93 OBJ_id_pkix_mod,8L\n\n#define SN_id_mod_cmp \"id-mod-cmp\"\n#define NID_id_mod_cmp 277\n#define OBJ_id_mod_cmp OBJ_id_pkix_mod,9L\n\n#define SN_id_mod_qualified_cert_88 \"id-mod-qualified-cert-88\"\n#define NID_id_mod_qualified_cert_88 278\n#define OBJ_id_mod_qualified_cert_88 OBJ_id_pkix_mod,10L\n\n#define SN_id_mod_qualified_cert_93 \"id-mod-qualified-cert-93\"\n#define NID_id_mod_qualified_cert_93 279\n#define OBJ_id_mod_qualified_cert_93 OBJ_id_pkix_mod,11L\n\n#define SN_id_mod_attribute_cert \"id-mod-attribute-cert\"\n#define NID_id_mod_attribute_cert 280\n#define OBJ_id_mod_attribute_cert OBJ_id_pkix_mod,12L\n\n#define SN_id_mod_timestamp_protocol \"id-mod-timestamp-protocol\"\n#define NID_id_mod_timestamp_protocol 281\n#define OBJ_id_mod_timestamp_protocol OBJ_id_pkix_mod,13L\n\n#define SN_id_mod_ocsp \"id-mod-ocsp\"\n#define NID_id_mod_ocsp 282\n#define OBJ_id_mod_ocsp OBJ_id_pkix_mod,14L\n\n#define SN_id_mod_dvcs \"id-mod-dvcs\"\n#define NID_id_mod_dvcs 283\n#define OBJ_id_mod_dvcs OBJ_id_pkix_mod,15L\n\n#define SN_id_mod_cmp2000 \"id-mod-cmp2000\"\n#define NID_id_mod_cmp2000 284\n#define OBJ_id_mod_cmp2000 OBJ_id_pkix_mod,16L\n\n#define SN_info_access \"authorityInfoAccess\"\n#define LN_info_access \"Authority Information Access\"\n#define NID_info_access 177\n#define OBJ_info_access OBJ_id_pe,1L\n\n#define SN_biometricInfo \"biometricInfo\"\n#define LN_biometricInfo \"Biometric Info\"\n#define NID_biometricInfo 285\n#define OBJ_biometricInfo OBJ_id_pe,2L\n\n#define SN_qcStatements \"qcStatements\"\n#define NID_qcStatements 286\n#define OBJ_qcStatements OBJ_id_pe,3L\n\n#define SN_ac_auditEntity \"ac-auditEntity\"\n#define NID_ac_auditEntity 287\n#define OBJ_ac_auditEntity OBJ_id_pe,4L\n\n#define SN_ac_targeting \"ac-targeting\"\n#define NID_ac_targeting 288\n#define OBJ_ac_targeting OBJ_id_pe,5L\n\n#define SN_aaControls \"aaControls\"\n#define NID_aaControls 289\n#define OBJ_aaControls OBJ_id_pe,6L\n\n#define SN_sbgp_ipAddrBlock \"sbgp-ipAddrBlock\"\n#define NID_sbgp_ipAddrBlock 290\n#define OBJ_sbgp_ipAddrBlock OBJ_id_pe,7L\n\n#define SN_sbgp_autonomousSysNum \"sbgp-autonomousSysNum\"\n#define NID_sbgp_autonomousSysNum 291\n#define OBJ_sbgp_autonomousSysNum OBJ_id_pe,8L\n\n#define SN_sbgp_routerIdentifier \"sbgp-routerIdentifier\"\n#define NID_sbgp_routerIdentifier 292\n#define OBJ_sbgp_routerIdentifier OBJ_id_pe,9L\n\n#define SN_ac_proxying \"ac-proxying\"\n#define NID_ac_proxying 397\n#define OBJ_ac_proxying OBJ_id_pe,10L\n\n#define SN_sinfo_access \"subjectInfoAccess\"\n#define LN_sinfo_access \"Subject Information Access\"\n#define NID_sinfo_access 398\n#define OBJ_sinfo_access OBJ_id_pe,11L\n\n#define SN_proxyCertInfo \"proxyCertInfo\"\n#define LN_proxyCertInfo \"Proxy Certificate Information\"\n#define NID_proxyCertInfo 663\n#define OBJ_proxyCertInfo OBJ_id_pe,14L\n\n#define SN_tlsfeature \"tlsfeature\"\n#define LN_tlsfeature \"TLS Feature\"\n#define NID_tlsfeature 1020\n#define OBJ_tlsfeature OBJ_id_pe,24L\n\n#define SN_id_qt_cps \"id-qt-cps\"\n#define LN_id_qt_cps \"Policy Qualifier CPS\"\n#define NID_id_qt_cps 164\n#define OBJ_id_qt_cps OBJ_id_qt,1L\n\n#define SN_id_qt_unotice \"id-qt-unotice\"\n#define LN_id_qt_unotice \"Policy Qualifier User Notice\"\n#define NID_id_qt_unotice 165\n#define OBJ_id_qt_unotice OBJ_id_qt,2L\n\n#define SN_textNotice \"textNotice\"\n#define NID_textNotice 293\n#define OBJ_textNotice OBJ_id_qt,3L\n\n#define SN_server_auth \"serverAuth\"\n#define LN_server_auth \"TLS Web Server Authentication\"\n#define NID_server_auth 129\n#define OBJ_server_auth OBJ_id_kp,1L\n\n#define SN_client_auth \"clientAuth\"\n#define LN_client_auth \"TLS Web Client Authentication\"\n#define NID_client_auth 130\n#define OBJ_client_auth OBJ_id_kp,2L\n\n#define SN_code_sign \"codeSigning\"\n#define LN_code_sign \"Code Signing\"\n#define NID_code_sign 131\n#define OBJ_code_sign OBJ_id_kp,3L\n\n#define SN_email_protect \"emailProtection\"\n#define LN_email_protect \"E-mail Protection\"\n#define NID_email_protect 132\n#define OBJ_email_protect OBJ_id_kp,4L\n\n#define SN_ipsecEndSystem \"ipsecEndSystem\"\n#define LN_ipsecEndSystem \"IPSec End System\"\n#define NID_ipsecEndSystem 294\n#define OBJ_ipsecEndSystem OBJ_id_kp,5L\n\n#define SN_ipsecTunnel \"ipsecTunnel\"\n#define LN_ipsecTunnel \"IPSec Tunnel\"\n#define NID_ipsecTunnel 295\n#define OBJ_ipsecTunnel OBJ_id_kp,6L\n\n#define SN_ipsecUser \"ipsecUser\"\n#define LN_ipsecUser \"IPSec User\"\n#define NID_ipsecUser 296\n#define OBJ_ipsecUser OBJ_id_kp,7L\n\n#define SN_time_stamp \"timeStamping\"\n#define LN_time_stamp \"Time Stamping\"\n#define NID_time_stamp 133\n#define OBJ_time_stamp OBJ_id_kp,8L\n\n#define SN_OCSP_sign \"OCSPSigning\"\n#define LN_OCSP_sign \"OCSP Signing\"\n#define NID_OCSP_sign 180\n#define OBJ_OCSP_sign OBJ_id_kp,9L\n\n#define SN_dvcs \"DVCS\"\n#define LN_dvcs \"dvcs\"\n#define NID_dvcs 297\n#define OBJ_dvcs OBJ_id_kp,10L\n\n#define SN_ipsec_IKE \"ipsecIKE\"\n#define LN_ipsec_IKE \"ipsec Internet Key Exchange\"\n#define NID_ipsec_IKE 1022\n#define OBJ_ipsec_IKE OBJ_id_kp,17L\n\n#define SN_capwapAC \"capwapAC\"\n#define LN_capwapAC \"Ctrl/provision WAP Access\"\n#define NID_capwapAC 1023\n#define OBJ_capwapAC OBJ_id_kp,18L\n\n#define SN_capwapWTP \"capwapWTP\"\n#define LN_capwapWTP \"Ctrl/Provision WAP Termination\"\n#define NID_capwapWTP 1024\n#define OBJ_capwapWTP OBJ_id_kp,19L\n\n#define SN_sshClient \"secureShellClient\"\n#define LN_sshClient \"SSH Client\"\n#define NID_sshClient 1025\n#define OBJ_sshClient OBJ_id_kp,21L\n\n#define SN_sshServer \"secureShellServer\"\n#define LN_sshServer \"SSH Server\"\n#define NID_sshServer 1026\n#define OBJ_sshServer OBJ_id_kp,22L\n\n#define SN_sendRouter \"sendRouter\"\n#define LN_sendRouter \"Send Router\"\n#define NID_sendRouter 1027\n#define OBJ_sendRouter OBJ_id_kp,23L\n\n#define SN_sendProxiedRouter \"sendProxiedRouter\"\n#define LN_sendProxiedRouter \"Send Proxied Router\"\n#define NID_sendProxiedRouter 1028\n#define OBJ_sendProxiedRouter OBJ_id_kp,24L\n\n#define SN_sendOwner \"sendOwner\"\n#define LN_sendOwner \"Send Owner\"\n#define NID_sendOwner 1029\n#define OBJ_sendOwner OBJ_id_kp,25L\n\n#define SN_sendProxiedOwner \"sendProxiedOwner\"\n#define LN_sendProxiedOwner \"Send Proxied Owner\"\n#define NID_sendProxiedOwner 1030\n#define OBJ_sendProxiedOwner OBJ_id_kp,26L\n\n#define SN_cmcCA \"cmcCA\"\n#define LN_cmcCA \"CMC Certificate Authority\"\n#define NID_cmcCA 1131\n#define OBJ_cmcCA OBJ_id_kp,27L\n\n#define SN_cmcRA \"cmcRA\"\n#define LN_cmcRA \"CMC Registration Authority\"\n#define NID_cmcRA 1132\n#define OBJ_cmcRA OBJ_id_kp,28L\n\n#define SN_id_it_caProtEncCert \"id-it-caProtEncCert\"\n#define NID_id_it_caProtEncCert 298\n#define OBJ_id_it_caProtEncCert OBJ_id_it,1L\n\n#define SN_id_it_signKeyPairTypes \"id-it-signKeyPairTypes\"\n#define NID_id_it_signKeyPairTypes 299\n#define OBJ_id_it_signKeyPairTypes OBJ_id_it,2L\n\n#define SN_id_it_encKeyPairTypes \"id-it-encKeyPairTypes\"\n#define NID_id_it_encKeyPairTypes 300\n#define OBJ_id_it_encKeyPairTypes OBJ_id_it,3L\n\n#define SN_id_it_preferredSymmAlg \"id-it-preferredSymmAlg\"\n#define NID_id_it_preferredSymmAlg 301\n#define OBJ_id_it_preferredSymmAlg OBJ_id_it,4L\n\n#define SN_id_it_caKeyUpdateInfo \"id-it-caKeyUpdateInfo\"\n#define NID_id_it_caKeyUpdateInfo 302\n#define OBJ_id_it_caKeyUpdateInfo OBJ_id_it,5L\n\n#define SN_id_it_currentCRL \"id-it-currentCRL\"\n#define NID_id_it_currentCRL 303\n#define OBJ_id_it_currentCRL OBJ_id_it,6L\n\n#define SN_id_it_unsupportedOIDs \"id-it-unsupportedOIDs\"\n#define NID_id_it_unsupportedOIDs 304\n#define OBJ_id_it_unsupportedOIDs OBJ_id_it,7L\n\n#define SN_id_it_subscriptionRequest \"id-it-subscriptionRequest\"\n#define NID_id_it_subscriptionRequest 305\n#define OBJ_id_it_subscriptionRequest OBJ_id_it,8L\n\n#define SN_id_it_subscriptionResponse \"id-it-subscriptionResponse\"\n#define NID_id_it_subscriptionResponse 306\n#define OBJ_id_it_subscriptionResponse OBJ_id_it,9L\n\n#define SN_id_it_keyPairParamReq \"id-it-keyPairParamReq\"\n#define NID_id_it_keyPairParamReq 307\n#define OBJ_id_it_keyPairParamReq OBJ_id_it,10L\n\n#define SN_id_it_keyPairParamRep \"id-it-keyPairParamRep\"\n#define NID_id_it_keyPairParamRep 308\n#define OBJ_id_it_keyPairParamRep OBJ_id_it,11L\n\n#define SN_id_it_revPassphrase \"id-it-revPassphrase\"\n#define NID_id_it_revPassphrase 309\n#define OBJ_id_it_revPassphrase OBJ_id_it,12L\n\n#define SN_id_it_implicitConfirm \"id-it-implicitConfirm\"\n#define NID_id_it_implicitConfirm 310\n#define OBJ_id_it_implicitConfirm OBJ_id_it,13L\n\n#define SN_id_it_confirmWaitTime \"id-it-confirmWaitTime\"\n#define NID_id_it_confirmWaitTime 311\n#define OBJ_id_it_confirmWaitTime OBJ_id_it,14L\n\n#define SN_id_it_origPKIMessage \"id-it-origPKIMessage\"\n#define NID_id_it_origPKIMessage 312\n#define OBJ_id_it_origPKIMessage OBJ_id_it,15L\n\n#define SN_id_it_suppLangTags \"id-it-suppLangTags\"\n#define NID_id_it_suppLangTags 784\n#define OBJ_id_it_suppLangTags OBJ_id_it,16L\n\n#define SN_id_regCtrl \"id-regCtrl\"\n#define NID_id_regCtrl 313\n#define OBJ_id_regCtrl OBJ_id_pkip,1L\n\n#define SN_id_regInfo \"id-regInfo\"\n#define NID_id_regInfo 314\n#define OBJ_id_regInfo OBJ_id_pkip,2L\n\n#define SN_id_regCtrl_regToken \"id-regCtrl-regToken\"\n#define NID_id_regCtrl_regToken 315\n#define OBJ_id_regCtrl_regToken OBJ_id_regCtrl,1L\n\n#define SN_id_regCtrl_authenticator \"id-regCtrl-authenticator\"\n#define NID_id_regCtrl_authenticator 316\n#define OBJ_id_regCtrl_authenticator OBJ_id_regCtrl,2L\n\n#define SN_id_regCtrl_pkiPublicationInfo \"id-regCtrl-pkiPublicationInfo\"\n#define NID_id_regCtrl_pkiPublicationInfo 317\n#define OBJ_id_regCtrl_pkiPublicationInfo OBJ_id_regCtrl,3L\n\n#define SN_id_regCtrl_pkiArchiveOptions \"id-regCtrl-pkiArchiveOptions\"\n#define NID_id_regCtrl_pkiArchiveOptions 318\n#define OBJ_id_regCtrl_pkiArchiveOptions OBJ_id_regCtrl,4L\n\n#define SN_id_regCtrl_oldCertID \"id-regCtrl-oldCertID\"\n#define NID_id_regCtrl_oldCertID 319\n#define OBJ_id_regCtrl_oldCertID OBJ_id_regCtrl,5L\n\n#define SN_id_regCtrl_protocolEncrKey \"id-regCtrl-protocolEncrKey\"\n#define NID_id_regCtrl_protocolEncrKey 320\n#define OBJ_id_regCtrl_protocolEncrKey OBJ_id_regCtrl,6L\n\n#define SN_id_regInfo_utf8Pairs \"id-regInfo-utf8Pairs\"\n#define NID_id_regInfo_utf8Pairs 321\n#define OBJ_id_regInfo_utf8Pairs OBJ_id_regInfo,1L\n\n#define SN_id_regInfo_certReq \"id-regInfo-certReq\"\n#define NID_id_regInfo_certReq 322\n#define OBJ_id_regInfo_certReq OBJ_id_regInfo,2L\n\n#define SN_id_alg_des40 \"id-alg-des40\"\n#define NID_id_alg_des40 323\n#define OBJ_id_alg_des40 OBJ_id_alg,1L\n\n#define SN_id_alg_noSignature \"id-alg-noSignature\"\n#define NID_id_alg_noSignature 324\n#define OBJ_id_alg_noSignature OBJ_id_alg,2L\n\n#define SN_id_alg_dh_sig_hmac_sha1 \"id-alg-dh-sig-hmac-sha1\"\n#define NID_id_alg_dh_sig_hmac_sha1 325\n#define OBJ_id_alg_dh_sig_hmac_sha1 OBJ_id_alg,3L\n\n#define SN_id_alg_dh_pop \"id-alg-dh-pop\"\n#define NID_id_alg_dh_pop 326\n#define OBJ_id_alg_dh_pop OBJ_id_alg,4L\n\n#define SN_id_cmc_statusInfo \"id-cmc-statusInfo\"\n#define NID_id_cmc_statusInfo 327\n#define OBJ_id_cmc_statusInfo OBJ_id_cmc,1L\n\n#define SN_id_cmc_identification \"id-cmc-identification\"\n#define NID_id_cmc_identification 328\n#define OBJ_id_cmc_identification OBJ_id_cmc,2L\n\n#define SN_id_cmc_identityProof \"id-cmc-identityProof\"\n#define NID_id_cmc_identityProof 329\n#define OBJ_id_cmc_identityProof OBJ_id_cmc,3L\n\n#define SN_id_cmc_dataReturn \"id-cmc-dataReturn\"\n#define NID_id_cmc_dataReturn 330\n#define OBJ_id_cmc_dataReturn OBJ_id_cmc,4L\n\n#define SN_id_cmc_transactionId \"id-cmc-transactionId\"\n#define NID_id_cmc_transactionId 331\n#define OBJ_id_cmc_transactionId OBJ_id_cmc,5L\n\n#define SN_id_cmc_senderNonce \"id-cmc-senderNonce\"\n#define NID_id_cmc_senderNonce 332\n#define OBJ_id_cmc_senderNonce OBJ_id_cmc,6L\n\n#define SN_id_cmc_recipientNonce \"id-cmc-recipientNonce\"\n#define NID_id_cmc_recipientNonce 333\n#define OBJ_id_cmc_recipientNonce OBJ_id_cmc,7L\n\n#define SN_id_cmc_addExtensions \"id-cmc-addExtensions\"\n#define NID_id_cmc_addExtensions 334\n#define OBJ_id_cmc_addExtensions OBJ_id_cmc,8L\n\n#define SN_id_cmc_encryptedPOP \"id-cmc-encryptedPOP\"\n#define NID_id_cmc_encryptedPOP 335\n#define OBJ_id_cmc_encryptedPOP OBJ_id_cmc,9L\n\n#define SN_id_cmc_decryptedPOP \"id-cmc-decryptedPOP\"\n#define NID_id_cmc_decryptedPOP 336\n#define OBJ_id_cmc_decryptedPOP OBJ_id_cmc,10L\n\n#define SN_id_cmc_lraPOPWitness \"id-cmc-lraPOPWitness\"\n#define NID_id_cmc_lraPOPWitness 337\n#define OBJ_id_cmc_lraPOPWitness OBJ_id_cmc,11L\n\n#define SN_id_cmc_getCert \"id-cmc-getCert\"\n#define NID_id_cmc_getCert 338\n#define OBJ_id_cmc_getCert OBJ_id_cmc,15L\n\n#define SN_id_cmc_getCRL \"id-cmc-getCRL\"\n#define NID_id_cmc_getCRL 339\n#define OBJ_id_cmc_getCRL OBJ_id_cmc,16L\n\n#define SN_id_cmc_revokeRequest \"id-cmc-revokeRequest\"\n#define NID_id_cmc_revokeRequest 340\n#define OBJ_id_cmc_revokeRequest OBJ_id_cmc,17L\n\n#define SN_id_cmc_regInfo \"id-cmc-regInfo\"\n#define NID_id_cmc_regInfo 341\n#define OBJ_id_cmc_regInfo OBJ_id_cmc,18L\n\n#define SN_id_cmc_responseInfo \"id-cmc-responseInfo\"\n#define NID_id_cmc_responseInfo 342\n#define OBJ_id_cmc_responseInfo OBJ_id_cmc,19L\n\n#define SN_id_cmc_queryPending \"id-cmc-queryPending\"\n#define NID_id_cmc_queryPending 343\n#define OBJ_id_cmc_queryPending OBJ_id_cmc,21L\n\n#define SN_id_cmc_popLinkRandom \"id-cmc-popLinkRandom\"\n#define NID_id_cmc_popLinkRandom 344\n#define OBJ_id_cmc_popLinkRandom OBJ_id_cmc,22L\n\n#define SN_id_cmc_popLinkWitness \"id-cmc-popLinkWitness\"\n#define NID_id_cmc_popLinkWitness 345\n#define OBJ_id_cmc_popLinkWitness OBJ_id_cmc,23L\n\n#define SN_id_cmc_confirmCertAcceptance \"id-cmc-confirmCertAcceptance\"\n#define NID_id_cmc_confirmCertAcceptance 346\n#define OBJ_id_cmc_confirmCertAcceptance OBJ_id_cmc,24L\n\n#define SN_id_on_personalData \"id-on-personalData\"\n#define NID_id_on_personalData 347\n#define OBJ_id_on_personalData OBJ_id_on,1L\n\n#define SN_id_on_permanentIdentifier \"id-on-permanentIdentifier\"\n#define LN_id_on_permanentIdentifier \"Permanent Identifier\"\n#define NID_id_on_permanentIdentifier 858\n#define OBJ_id_on_permanentIdentifier OBJ_id_on,3L\n\n#define SN_id_pda_dateOfBirth \"id-pda-dateOfBirth\"\n#define NID_id_pda_dateOfBirth 348\n#define OBJ_id_pda_dateOfBirth OBJ_id_pda,1L\n\n#define SN_id_pda_placeOfBirth \"id-pda-placeOfBirth\"\n#define NID_id_pda_placeOfBirth 349\n#define OBJ_id_pda_placeOfBirth OBJ_id_pda,2L\n\n#define SN_id_pda_gender \"id-pda-gender\"\n#define NID_id_pda_gender 351\n#define OBJ_id_pda_gender OBJ_id_pda,3L\n\n#define SN_id_pda_countryOfCitizenship \"id-pda-countryOfCitizenship\"\n#define NID_id_pda_countryOfCitizenship 352\n#define OBJ_id_pda_countryOfCitizenship OBJ_id_pda,4L\n\n#define SN_id_pda_countryOfResidence \"id-pda-countryOfResidence\"\n#define NID_id_pda_countryOfResidence 353\n#define OBJ_id_pda_countryOfResidence OBJ_id_pda,5L\n\n#define SN_id_aca_authenticationInfo \"id-aca-authenticationInfo\"\n#define NID_id_aca_authenticationInfo 354\n#define OBJ_id_aca_authenticationInfo OBJ_id_aca,1L\n\n#define SN_id_aca_accessIdentity \"id-aca-accessIdentity\"\n#define NID_id_aca_accessIdentity 355\n#define OBJ_id_aca_accessIdentity OBJ_id_aca,2L\n\n#define SN_id_aca_chargingIdentity \"id-aca-chargingIdentity\"\n#define NID_id_aca_chargingIdentity 356\n#define OBJ_id_aca_chargingIdentity OBJ_id_aca,3L\n\n#define SN_id_aca_group \"id-aca-group\"\n#define NID_id_aca_group 357\n#define OBJ_id_aca_group OBJ_id_aca,4L\n\n#define SN_id_aca_role \"id-aca-role\"\n#define NID_id_aca_role 358\n#define OBJ_id_aca_role OBJ_id_aca,5L\n\n#define SN_id_aca_encAttrs \"id-aca-encAttrs\"\n#define NID_id_aca_encAttrs 399\n#define OBJ_id_aca_encAttrs OBJ_id_aca,6L\n\n#define SN_id_qcs_pkixQCSyntax_v1 \"id-qcs-pkixQCSyntax-v1\"\n#define NID_id_qcs_pkixQCSyntax_v1 359\n#define OBJ_id_qcs_pkixQCSyntax_v1 OBJ_id_qcs,1L\n\n#define SN_id_cct_crs \"id-cct-crs\"\n#define NID_id_cct_crs 360\n#define OBJ_id_cct_crs OBJ_id_cct,1L\n\n#define SN_id_cct_PKIData \"id-cct-PKIData\"\n#define NID_id_cct_PKIData 361\n#define OBJ_id_cct_PKIData OBJ_id_cct,2L\n\n#define SN_id_cct_PKIResponse \"id-cct-PKIResponse\"\n#define NID_id_cct_PKIResponse 362\n#define OBJ_id_cct_PKIResponse OBJ_id_cct,3L\n\n#define SN_id_ppl_anyLanguage \"id-ppl-anyLanguage\"\n#define LN_id_ppl_anyLanguage \"Any language\"\n#define NID_id_ppl_anyLanguage 664\n#define OBJ_id_ppl_anyLanguage OBJ_id_ppl,0L\n\n#define SN_id_ppl_inheritAll \"id-ppl-inheritAll\"\n#define LN_id_ppl_inheritAll \"Inherit all\"\n#define NID_id_ppl_inheritAll 665\n#define OBJ_id_ppl_inheritAll OBJ_id_ppl,1L\n\n#define SN_Independent \"id-ppl-independent\"\n#define LN_Independent \"Independent\"\n#define NID_Independent 667\n#define OBJ_Independent OBJ_id_ppl,2L\n\n#define SN_ad_OCSP \"OCSP\"\n#define LN_ad_OCSP \"OCSP\"\n#define NID_ad_OCSP 178\n#define OBJ_ad_OCSP OBJ_id_ad,1L\n\n#define SN_ad_ca_issuers \"caIssuers\"\n#define LN_ad_ca_issuers \"CA Issuers\"\n#define NID_ad_ca_issuers 179\n#define OBJ_ad_ca_issuers OBJ_id_ad,2L\n\n#define SN_ad_timeStamping \"ad_timestamping\"\n#define LN_ad_timeStamping \"AD Time Stamping\"\n#define NID_ad_timeStamping 363\n#define OBJ_ad_timeStamping OBJ_id_ad,3L\n\n#define SN_ad_dvcs \"AD_DVCS\"\n#define LN_ad_dvcs \"ad dvcs\"\n#define NID_ad_dvcs 364\n#define OBJ_ad_dvcs OBJ_id_ad,4L\n\n#define SN_caRepository \"caRepository\"\n#define LN_caRepository \"CA Repository\"\n#define NID_caRepository 785\n#define OBJ_caRepository OBJ_id_ad,5L\n\n#define OBJ_id_pkix_OCSP OBJ_ad_OCSP\n\n#define SN_id_pkix_OCSP_basic \"basicOCSPResponse\"\n#define LN_id_pkix_OCSP_basic \"Basic OCSP Response\"\n#define NID_id_pkix_OCSP_basic 365\n#define OBJ_id_pkix_OCSP_basic OBJ_id_pkix_OCSP,1L\n\n#define SN_id_pkix_OCSP_Nonce \"Nonce\"\n#define LN_id_pkix_OCSP_Nonce \"OCSP Nonce\"\n#define NID_id_pkix_OCSP_Nonce 366\n#define OBJ_id_pkix_OCSP_Nonce OBJ_id_pkix_OCSP,2L\n\n#define SN_id_pkix_OCSP_CrlID \"CrlID\"\n#define LN_id_pkix_OCSP_CrlID \"OCSP CRL ID\"\n#define NID_id_pkix_OCSP_CrlID 367\n#define OBJ_id_pkix_OCSP_CrlID OBJ_id_pkix_OCSP,3L\n\n#define SN_id_pkix_OCSP_acceptableResponses \"acceptableResponses\"\n#define LN_id_pkix_OCSP_acceptableResponses \"Acceptable OCSP Responses\"\n#define NID_id_pkix_OCSP_acceptableResponses 368\n#define OBJ_id_pkix_OCSP_acceptableResponses OBJ_id_pkix_OCSP,4L\n\n#define SN_id_pkix_OCSP_noCheck \"noCheck\"\n#define LN_id_pkix_OCSP_noCheck \"OCSP No Check\"\n#define NID_id_pkix_OCSP_noCheck 369\n#define OBJ_id_pkix_OCSP_noCheck OBJ_id_pkix_OCSP,5L\n\n#define SN_id_pkix_OCSP_archiveCutoff \"archiveCutoff\"\n#define LN_id_pkix_OCSP_archiveCutoff \"OCSP Archive Cutoff\"\n#define NID_id_pkix_OCSP_archiveCutoff 370\n#define OBJ_id_pkix_OCSP_archiveCutoff OBJ_id_pkix_OCSP,6L\n\n#define SN_id_pkix_OCSP_serviceLocator \"serviceLocator\"\n#define LN_id_pkix_OCSP_serviceLocator \"OCSP Service Locator\"\n#define NID_id_pkix_OCSP_serviceLocator 371\n#define OBJ_id_pkix_OCSP_serviceLocator OBJ_id_pkix_OCSP,7L\n\n#define SN_id_pkix_OCSP_extendedStatus \"extendedStatus\"\n#define LN_id_pkix_OCSP_extendedStatus \"Extended OCSP Status\"\n#define NID_id_pkix_OCSP_extendedStatus 372\n#define OBJ_id_pkix_OCSP_extendedStatus OBJ_id_pkix_OCSP,8L\n\n#define SN_id_pkix_OCSP_valid \"valid\"\n#define NID_id_pkix_OCSP_valid 373\n#define OBJ_id_pkix_OCSP_valid OBJ_id_pkix_OCSP,9L\n\n#define SN_id_pkix_OCSP_path \"path\"\n#define NID_id_pkix_OCSP_path 374\n#define OBJ_id_pkix_OCSP_path OBJ_id_pkix_OCSP,10L\n\n#define SN_id_pkix_OCSP_trustRoot \"trustRoot\"\n#define LN_id_pkix_OCSP_trustRoot \"Trust Root\"\n#define NID_id_pkix_OCSP_trustRoot 375\n#define OBJ_id_pkix_OCSP_trustRoot OBJ_id_pkix_OCSP,11L\n\n#define SN_algorithm \"algorithm\"\n#define LN_algorithm \"algorithm\"\n#define NID_algorithm 376\n#define OBJ_algorithm 1L,3L,14L,3L,2L\n\n#define SN_md5WithRSA \"RSA-NP-MD5\"\n#define LN_md5WithRSA \"md5WithRSA\"\n#define NID_md5WithRSA 104\n#define OBJ_md5WithRSA OBJ_algorithm,3L\n\n#define SN_des_ecb \"DES-ECB\"\n#define LN_des_ecb \"des-ecb\"\n#define NID_des_ecb 29\n#define OBJ_des_ecb OBJ_algorithm,6L\n\n#define SN_des_cbc \"DES-CBC\"\n#define LN_des_cbc \"des-cbc\"\n#define NID_des_cbc 31\n#define OBJ_des_cbc OBJ_algorithm,7L\n\n#define SN_des_ofb64 \"DES-OFB\"\n#define LN_des_ofb64 \"des-ofb\"\n#define NID_des_ofb64 45\n#define OBJ_des_ofb64 OBJ_algorithm,8L\n\n#define SN_des_cfb64 \"DES-CFB\"\n#define LN_des_cfb64 \"des-cfb\"\n#define NID_des_cfb64 30\n#define OBJ_des_cfb64 OBJ_algorithm,9L\n\n#define SN_rsaSignature \"rsaSignature\"\n#define NID_rsaSignature 377\n#define OBJ_rsaSignature OBJ_algorithm,11L\n\n#define SN_dsa_2 \"DSA-old\"\n#define LN_dsa_2 \"dsaEncryption-old\"\n#define NID_dsa_2 67\n#define OBJ_dsa_2 OBJ_algorithm,12L\n\n#define SN_dsaWithSHA \"DSA-SHA\"\n#define LN_dsaWithSHA \"dsaWithSHA\"\n#define NID_dsaWithSHA 66\n#define OBJ_dsaWithSHA OBJ_algorithm,13L\n\n#define SN_shaWithRSAEncryption \"RSA-SHA\"\n#define LN_shaWithRSAEncryption \"shaWithRSAEncryption\"\n#define NID_shaWithRSAEncryption 42\n#define OBJ_shaWithRSAEncryption OBJ_algorithm,15L\n\n#define SN_des_ede_ecb \"DES-EDE\"\n#define LN_des_ede_ecb \"des-ede\"\n#define NID_des_ede_ecb 32\n#define OBJ_des_ede_ecb OBJ_algorithm,17L\n\n#define SN_des_ede3_ecb \"DES-EDE3\"\n#define LN_des_ede3_ecb \"des-ede3\"\n#define NID_des_ede3_ecb 33\n\n#define SN_des_ede_cbc \"DES-EDE-CBC\"\n#define LN_des_ede_cbc \"des-ede-cbc\"\n#define NID_des_ede_cbc 43\n\n#define SN_des_ede_cfb64 \"DES-EDE-CFB\"\n#define LN_des_ede_cfb64 \"des-ede-cfb\"\n#define NID_des_ede_cfb64 60\n\n#define SN_des_ede3_cfb64 \"DES-EDE3-CFB\"\n#define LN_des_ede3_cfb64 \"des-ede3-cfb\"\n#define NID_des_ede3_cfb64 61\n\n#define SN_des_ede_ofb64 \"DES-EDE-OFB\"\n#define LN_des_ede_ofb64 \"des-ede-ofb\"\n#define NID_des_ede_ofb64 62\n\n#define SN_des_ede3_ofb64 \"DES-EDE3-OFB\"\n#define LN_des_ede3_ofb64 \"des-ede3-ofb\"\n#define NID_des_ede3_ofb64 63\n\n#define SN_desx_cbc \"DESX-CBC\"\n#define LN_desx_cbc \"desx-cbc\"\n#define NID_desx_cbc 80\n\n#define SN_sha \"SHA\"\n#define LN_sha \"sha\"\n#define NID_sha 41\n#define OBJ_sha OBJ_algorithm,18L\n\n#define SN_sha1 \"SHA1\"\n#define LN_sha1 \"sha1\"\n#define NID_sha1 64\n#define OBJ_sha1 OBJ_algorithm,26L\n\n#define SN_dsaWithSHA1_2 \"DSA-SHA1-old\"\n#define LN_dsaWithSHA1_2 \"dsaWithSHA1-old\"\n#define NID_dsaWithSHA1_2 70\n#define OBJ_dsaWithSHA1_2 OBJ_algorithm,27L\n\n#define SN_sha1WithRSA \"RSA-SHA1-2\"\n#define LN_sha1WithRSA \"sha1WithRSA\"\n#define NID_sha1WithRSA 115\n#define OBJ_sha1WithRSA OBJ_algorithm,29L\n\n#define SN_ripemd160 \"RIPEMD160\"\n#define LN_ripemd160 \"ripemd160\"\n#define NID_ripemd160 117\n#define OBJ_ripemd160 1L,3L,36L,3L,2L,1L\n\n#define SN_ripemd160WithRSA \"RSA-RIPEMD160\"\n#define LN_ripemd160WithRSA \"ripemd160WithRSA\"\n#define NID_ripemd160WithRSA 119\n#define OBJ_ripemd160WithRSA 1L,3L,36L,3L,3L,1L,2L\n\n#define SN_blake2b512 \"BLAKE2b512\"\n#define LN_blake2b512 \"blake2b512\"\n#define NID_blake2b512 1056\n#define OBJ_blake2b512 1L,3L,6L,1L,4L,1L,1722L,12L,2L,1L,16L\n\n#define SN_blake2s256 \"BLAKE2s256\"\n#define LN_blake2s256 \"blake2s256\"\n#define NID_blake2s256 1057\n#define OBJ_blake2s256 1L,3L,6L,1L,4L,1L,1722L,12L,2L,2L,8L\n\n#define SN_sxnet \"SXNetID\"\n#define LN_sxnet \"Strong Extranet ID\"\n#define NID_sxnet 143\n#define OBJ_sxnet 1L,3L,101L,1L,4L,1L\n\n#define SN_X500 \"X500\"\n#define LN_X500 \"directory services (X.500)\"\n#define NID_X500 11\n#define OBJ_X500 2L,5L\n\n#define SN_X509 \"X509\"\n#define NID_X509 12\n#define OBJ_X509 OBJ_X500,4L\n\n#define SN_commonName \"CN\"\n#define LN_commonName \"commonName\"\n#define NID_commonName 13\n#define OBJ_commonName OBJ_X509,3L\n\n#define SN_surname \"SN\"\n#define LN_surname \"surname\"\n#define NID_surname 100\n#define OBJ_surname OBJ_X509,4L\n\n#define LN_serialNumber \"serialNumber\"\n#define NID_serialNumber 105\n#define OBJ_serialNumber OBJ_X509,5L\n\n#define SN_countryName \"C\"\n#define LN_countryName \"countryName\"\n#define NID_countryName 14\n#define OBJ_countryName OBJ_X509,6L\n\n#define SN_localityName \"L\"\n#define LN_localityName \"localityName\"\n#define NID_localityName 15\n#define OBJ_localityName OBJ_X509,7L\n\n#define SN_stateOrProvinceName \"ST\"\n#define LN_stateOrProvinceName \"stateOrProvinceName\"\n#define NID_stateOrProvinceName 16\n#define OBJ_stateOrProvinceName OBJ_X509,8L\n\n#define SN_streetAddress \"street\"\n#define LN_streetAddress \"streetAddress\"\n#define NID_streetAddress 660\n#define OBJ_streetAddress OBJ_X509,9L\n\n#define SN_organizationName \"O\"\n#define LN_organizationName \"organizationName\"\n#define NID_organizationName 17\n#define OBJ_organizationName OBJ_X509,10L\n\n#define SN_organizationalUnitName \"OU\"\n#define LN_organizationalUnitName \"organizationalUnitName\"\n#define NID_organizationalUnitName 18\n#define OBJ_organizationalUnitName OBJ_X509,11L\n\n#define SN_title \"title\"\n#define LN_title \"title\"\n#define NID_title 106\n#define OBJ_title OBJ_X509,12L\n\n#define LN_description \"description\"\n#define NID_description 107\n#define OBJ_description OBJ_X509,13L\n\n#define LN_searchGuide \"searchGuide\"\n#define NID_searchGuide 859\n#define OBJ_searchGuide OBJ_X509,14L\n\n#define LN_businessCategory \"businessCategory\"\n#define NID_businessCategory 860\n#define OBJ_businessCategory OBJ_X509,15L\n\n#define LN_postalAddress \"postalAddress\"\n#define NID_postalAddress 861\n#define OBJ_postalAddress OBJ_X509,16L\n\n#define LN_postalCode \"postalCode\"\n#define NID_postalCode 661\n#define OBJ_postalCode OBJ_X509,17L\n\n#define LN_postOfficeBox \"postOfficeBox\"\n#define NID_postOfficeBox 862\n#define OBJ_postOfficeBox OBJ_X509,18L\n\n#define LN_physicalDeliveryOfficeName \"physicalDeliveryOfficeName\"\n#define NID_physicalDeliveryOfficeName 863\n#define OBJ_physicalDeliveryOfficeName OBJ_X509,19L\n\n#define LN_telephoneNumber \"telephoneNumber\"\n#define NID_telephoneNumber 864\n#define OBJ_telephoneNumber OBJ_X509,20L\n\n#define LN_telexNumber \"telexNumber\"\n#define NID_telexNumber 865\n#define OBJ_telexNumber OBJ_X509,21L\n\n#define LN_teletexTerminalIdentifier \"teletexTerminalIdentifier\"\n#define NID_teletexTerminalIdentifier 866\n#define OBJ_teletexTerminalIdentifier OBJ_X509,22L\n\n#define LN_facsimileTelephoneNumber \"facsimileTelephoneNumber\"\n#define NID_facsimileTelephoneNumber 867\n#define OBJ_facsimileTelephoneNumber OBJ_X509,23L\n\n#define LN_x121Address \"x121Address\"\n#define NID_x121Address 868\n#define OBJ_x121Address OBJ_X509,24L\n\n#define LN_internationaliSDNNumber \"internationaliSDNNumber\"\n#define NID_internationaliSDNNumber 869\n#define OBJ_internationaliSDNNumber OBJ_X509,25L\n\n#define LN_registeredAddress \"registeredAddress\"\n#define NID_registeredAddress 870\n#define OBJ_registeredAddress OBJ_X509,26L\n\n#define LN_destinationIndicator \"destinationIndicator\"\n#define NID_destinationIndicator 871\n#define OBJ_destinationIndicator OBJ_X509,27L\n\n#define LN_preferredDeliveryMethod \"preferredDeliveryMethod\"\n#define NID_preferredDeliveryMethod 872\n#define OBJ_preferredDeliveryMethod OBJ_X509,28L\n\n#define LN_presentationAddress \"presentationAddress\"\n#define NID_presentationAddress 873\n#define OBJ_presentationAddress OBJ_X509,29L\n\n#define LN_supportedApplicationContext \"supportedApplicationContext\"\n#define NID_supportedApplicationContext 874\n#define OBJ_supportedApplicationContext OBJ_X509,30L\n\n#define SN_member \"member\"\n#define NID_member 875\n#define OBJ_member OBJ_X509,31L\n\n#define SN_owner \"owner\"\n#define NID_owner 876\n#define OBJ_owner OBJ_X509,32L\n\n#define LN_roleOccupant \"roleOccupant\"\n#define NID_roleOccupant 877\n#define OBJ_roleOccupant OBJ_X509,33L\n\n#define SN_seeAlso \"seeAlso\"\n#define NID_seeAlso 878\n#define OBJ_seeAlso OBJ_X509,34L\n\n#define LN_userPassword \"userPassword\"\n#define NID_userPassword 879\n#define OBJ_userPassword OBJ_X509,35L\n\n#define LN_userCertificate \"userCertificate\"\n#define NID_userCertificate 880\n#define OBJ_userCertificate OBJ_X509,36L\n\n#define LN_cACertificate \"cACertificate\"\n#define NID_cACertificate 881\n#define OBJ_cACertificate OBJ_X509,37L\n\n#define LN_authorityRevocationList \"authorityRevocationList\"\n#define NID_authorityRevocationList 882\n#define OBJ_authorityRevocationList OBJ_X509,38L\n\n#define LN_certificateRevocationList \"certificateRevocationList\"\n#define NID_certificateRevocationList 883\n#define OBJ_certificateRevocationList OBJ_X509,39L\n\n#define LN_crossCertificatePair \"crossCertificatePair\"\n#define NID_crossCertificatePair 884\n#define OBJ_crossCertificatePair OBJ_X509,40L\n\n#define SN_name \"name\"\n#define LN_name \"name\"\n#define NID_name 173\n#define OBJ_name OBJ_X509,41L\n\n#define SN_givenName \"GN\"\n#define LN_givenName \"givenName\"\n#define NID_givenName 99\n#define OBJ_givenName OBJ_X509,42L\n\n#define SN_initials \"initials\"\n#define LN_initials \"initials\"\n#define NID_initials 101\n#define OBJ_initials OBJ_X509,43L\n\n#define LN_generationQualifier \"generationQualifier\"\n#define NID_generationQualifier 509\n#define OBJ_generationQualifier OBJ_X509,44L\n\n#define LN_x500UniqueIdentifier \"x500UniqueIdentifier\"\n#define NID_x500UniqueIdentifier 503\n#define OBJ_x500UniqueIdentifier OBJ_X509,45L\n\n#define SN_dnQualifier \"dnQualifier\"\n#define LN_dnQualifier \"dnQualifier\"\n#define NID_dnQualifier 174\n#define OBJ_dnQualifier OBJ_X509,46L\n\n#define LN_enhancedSearchGuide \"enhancedSearchGuide\"\n#define NID_enhancedSearchGuide 885\n#define OBJ_enhancedSearchGuide OBJ_X509,47L\n\n#define LN_protocolInformation \"protocolInformation\"\n#define NID_protocolInformation 886\n#define OBJ_protocolInformation OBJ_X509,48L\n\n#define LN_distinguishedName \"distinguishedName\"\n#define NID_distinguishedName 887\n#define OBJ_distinguishedName OBJ_X509,49L\n\n#define LN_uniqueMember \"uniqueMember\"\n#define NID_uniqueMember 888\n#define OBJ_uniqueMember OBJ_X509,50L\n\n#define LN_houseIdentifier \"houseIdentifier\"\n#define NID_houseIdentifier 889\n#define OBJ_houseIdentifier OBJ_X509,51L\n\n#define LN_supportedAlgorithms \"supportedAlgorithms\"\n#define NID_supportedAlgorithms 890\n#define OBJ_supportedAlgorithms OBJ_X509,52L\n\n#define LN_deltaRevocationList \"deltaRevocationList\"\n#define NID_deltaRevocationList 891\n#define OBJ_deltaRevocationList OBJ_X509,53L\n\n#define SN_dmdName \"dmdName\"\n#define NID_dmdName 892\n#define OBJ_dmdName OBJ_X509,54L\n\n#define LN_pseudonym \"pseudonym\"\n#define NID_pseudonym 510\n#define OBJ_pseudonym OBJ_X509,65L\n\n#define SN_role \"role\"\n#define LN_role \"role\"\n#define NID_role 400\n#define OBJ_role OBJ_X509,72L\n\n#define LN_organizationIdentifier \"organizationIdentifier\"\n#define NID_organizationIdentifier 1089\n#define OBJ_organizationIdentifier OBJ_X509,97L\n\n#define SN_countryCode3c \"c3\"\n#define LN_countryCode3c \"countryCode3c\"\n#define NID_countryCode3c 1090\n#define OBJ_countryCode3c OBJ_X509,98L\n\n#define SN_countryCode3n \"n3\"\n#define LN_countryCode3n \"countryCode3n\"\n#define NID_countryCode3n 1091\n#define OBJ_countryCode3n OBJ_X509,99L\n\n#define LN_dnsName \"dnsName\"\n#define NID_dnsName 1092\n#define OBJ_dnsName OBJ_X509,100L\n\n#define SN_X500algorithms \"X500algorithms\"\n#define LN_X500algorithms \"directory services - algorithms\"\n#define NID_X500algorithms 378\n#define OBJ_X500algorithms OBJ_X500,8L\n\n#define SN_rsa \"RSA\"\n#define LN_rsa \"rsa\"\n#define NID_rsa 19\n#define OBJ_rsa OBJ_X500algorithms,1L,1L\n\n#define SN_mdc2WithRSA \"RSA-MDC2\"\n#define LN_mdc2WithRSA \"mdc2WithRSA\"\n#define NID_mdc2WithRSA 96\n#define OBJ_mdc2WithRSA OBJ_X500algorithms,3L,100L\n\n#define SN_mdc2 \"MDC2\"\n#define LN_mdc2 \"mdc2\"\n#define NID_mdc2 95\n#define OBJ_mdc2 OBJ_X500algorithms,3L,101L\n\n#define SN_id_ce \"id-ce\"\n#define NID_id_ce 81\n#define OBJ_id_ce OBJ_X500,29L\n\n#define SN_subject_directory_attributes \"subjectDirectoryAttributes\"\n#define LN_subject_directory_attributes \"X509v3 Subject Directory Attributes\"\n#define NID_subject_directory_attributes 769\n#define OBJ_subject_directory_attributes OBJ_id_ce,9L\n\n#define SN_subject_key_identifier \"subjectKeyIdentifier\"\n#define LN_subject_key_identifier \"X509v3 Subject Key Identifier\"\n#define NID_subject_key_identifier 82\n#define OBJ_subject_key_identifier OBJ_id_ce,14L\n\n#define SN_key_usage \"keyUsage\"\n#define LN_key_usage \"X509v3 Key Usage\"\n#define NID_key_usage 83\n#define OBJ_key_usage OBJ_id_ce,15L\n\n#define SN_private_key_usage_period \"privateKeyUsagePeriod\"\n#define LN_private_key_usage_period \"X509v3 Private Key Usage Period\"\n#define NID_private_key_usage_period 84\n#define OBJ_private_key_usage_period OBJ_id_ce,16L\n\n#define SN_subject_alt_name \"subjectAltName\"\n#define LN_subject_alt_name \"X509v3 Subject Alternative Name\"\n#define NID_subject_alt_name 85\n#define OBJ_subject_alt_name OBJ_id_ce,17L\n\n#define SN_issuer_alt_name \"issuerAltName\"\n#define LN_issuer_alt_name \"X509v3 Issuer Alternative Name\"\n#define NID_issuer_alt_name 86\n#define OBJ_issuer_alt_name OBJ_id_ce,18L\n\n#define SN_basic_constraints \"basicConstraints\"\n#define LN_basic_constraints \"X509v3 Basic Constraints\"\n#define NID_basic_constraints 87\n#define OBJ_basic_constraints OBJ_id_ce,19L\n\n#define SN_crl_number \"crlNumber\"\n#define LN_crl_number \"X509v3 CRL Number\"\n#define NID_crl_number 88\n#define OBJ_crl_number OBJ_id_ce,20L\n\n#define SN_crl_reason \"CRLReason\"\n#define LN_crl_reason \"X509v3 CRL Reason Code\"\n#define NID_crl_reason 141\n#define OBJ_crl_reason OBJ_id_ce,21L\n\n#define SN_invalidity_date \"invalidityDate\"\n#define LN_invalidity_date \"Invalidity Date\"\n#define NID_invalidity_date 142\n#define OBJ_invalidity_date OBJ_id_ce,24L\n\n#define SN_delta_crl \"deltaCRL\"\n#define LN_delta_crl \"X509v3 Delta CRL Indicator\"\n#define NID_delta_crl 140\n#define OBJ_delta_crl OBJ_id_ce,27L\n\n#define SN_issuing_distribution_point \"issuingDistributionPoint\"\n#define LN_issuing_distribution_point \"X509v3 Issuing Distribution Point\"\n#define NID_issuing_distribution_point 770\n#define OBJ_issuing_distribution_point OBJ_id_ce,28L\n\n#define SN_certificate_issuer \"certificateIssuer\"\n#define LN_certificate_issuer \"X509v3 Certificate Issuer\"\n#define NID_certificate_issuer 771\n#define OBJ_certificate_issuer OBJ_id_ce,29L\n\n#define SN_name_constraints \"nameConstraints\"\n#define LN_name_constraints \"X509v3 Name Constraints\"\n#define NID_name_constraints 666\n#define OBJ_name_constraints OBJ_id_ce,30L\n\n#define SN_crl_distribution_points \"crlDistributionPoints\"\n#define LN_crl_distribution_points \"X509v3 CRL Distribution Points\"\n#define NID_crl_distribution_points 103\n#define OBJ_crl_distribution_points OBJ_id_ce,31L\n\n#define SN_certificate_policies \"certificatePolicies\"\n#define LN_certificate_policies \"X509v3 Certificate Policies\"\n#define NID_certificate_policies 89\n#define OBJ_certificate_policies OBJ_id_ce,32L\n\n#define SN_any_policy \"anyPolicy\"\n#define LN_any_policy \"X509v3 Any Policy\"\n#define NID_any_policy 746\n#define OBJ_any_policy OBJ_certificate_policies,0L\n\n#define SN_policy_mappings \"policyMappings\"\n#define LN_policy_mappings \"X509v3 Policy Mappings\"\n#define NID_policy_mappings 747\n#define OBJ_policy_mappings OBJ_id_ce,33L\n\n#define SN_authority_key_identifier \"authorityKeyIdentifier\"\n#define LN_authority_key_identifier \"X509v3 Authority Key Identifier\"\n#define NID_authority_key_identifier 90\n#define OBJ_authority_key_identifier OBJ_id_ce,35L\n\n#define SN_policy_constraints \"policyConstraints\"\n#define LN_policy_constraints \"X509v3 Policy Constraints\"\n#define NID_policy_constraints 401\n#define OBJ_policy_constraints OBJ_id_ce,36L\n\n#define SN_ext_key_usage \"extendedKeyUsage\"\n#define LN_ext_key_usage \"X509v3 Extended Key Usage\"\n#define NID_ext_key_usage 126\n#define OBJ_ext_key_usage OBJ_id_ce,37L\n\n#define SN_freshest_crl \"freshestCRL\"\n#define LN_freshest_crl \"X509v3 Freshest CRL\"\n#define NID_freshest_crl 857\n#define OBJ_freshest_crl OBJ_id_ce,46L\n\n#define SN_inhibit_any_policy \"inhibitAnyPolicy\"\n#define LN_inhibit_any_policy \"X509v3 Inhibit Any Policy\"\n#define NID_inhibit_any_policy 748\n#define OBJ_inhibit_any_policy OBJ_id_ce,54L\n\n#define SN_target_information \"targetInformation\"\n#define LN_target_information \"X509v3 AC Targeting\"\n#define NID_target_information 402\n#define OBJ_target_information OBJ_id_ce,55L\n\n#define SN_no_rev_avail \"noRevAvail\"\n#define LN_no_rev_avail \"X509v3 No Revocation Available\"\n#define NID_no_rev_avail 403\n#define OBJ_no_rev_avail OBJ_id_ce,56L\n\n#define SN_anyExtendedKeyUsage \"anyExtendedKeyUsage\"\n#define LN_anyExtendedKeyUsage \"Any Extended Key Usage\"\n#define NID_anyExtendedKeyUsage 910\n#define OBJ_anyExtendedKeyUsage OBJ_ext_key_usage,0L\n\n#define SN_netscape \"Netscape\"\n#define LN_netscape \"Netscape Communications Corp.\"\n#define NID_netscape 57\n#define OBJ_netscape 2L,16L,840L,1L,113730L\n\n#define SN_netscape_cert_extension \"nsCertExt\"\n#define LN_netscape_cert_extension \"Netscape Certificate Extension\"\n#define NID_netscape_cert_extension 58\n#define OBJ_netscape_cert_extension OBJ_netscape,1L\n\n#define SN_netscape_data_type \"nsDataType\"\n#define LN_netscape_data_type \"Netscape Data Type\"\n#define NID_netscape_data_type 59\n#define OBJ_netscape_data_type OBJ_netscape,2L\n\n#define SN_netscape_cert_type \"nsCertType\"\n#define LN_netscape_cert_type \"Netscape Cert Type\"\n#define NID_netscape_cert_type 71\n#define OBJ_netscape_cert_type OBJ_netscape_cert_extension,1L\n\n#define SN_netscape_base_url \"nsBaseUrl\"\n#define LN_netscape_base_url \"Netscape Base Url\"\n#define NID_netscape_base_url 72\n#define OBJ_netscape_base_url OBJ_netscape_cert_extension,2L\n\n#define SN_netscape_revocation_url \"nsRevocationUrl\"\n#define LN_netscape_revocation_url \"Netscape Revocation Url\"\n#define NID_netscape_revocation_url 73\n#define OBJ_netscape_revocation_url OBJ_netscape_cert_extension,3L\n\n#define SN_netscape_ca_revocation_url \"nsCaRevocationUrl\"\n#define LN_netscape_ca_revocation_url \"Netscape CA Revocation Url\"\n#define NID_netscape_ca_revocation_url 74\n#define OBJ_netscape_ca_revocation_url OBJ_netscape_cert_extension,4L\n\n#define SN_netscape_renewal_url \"nsRenewalUrl\"\n#define LN_netscape_renewal_url \"Netscape Renewal Url\"\n#define NID_netscape_renewal_url 75\n#define OBJ_netscape_renewal_url OBJ_netscape_cert_extension,7L\n\n#define SN_netscape_ca_policy_url \"nsCaPolicyUrl\"\n#define LN_netscape_ca_policy_url \"Netscape CA Policy Url\"\n#define NID_netscape_ca_policy_url 76\n#define OBJ_netscape_ca_policy_url OBJ_netscape_cert_extension,8L\n\n#define SN_netscape_ssl_server_name \"nsSslServerName\"\n#define LN_netscape_ssl_server_name \"Netscape SSL Server Name\"\n#define NID_netscape_ssl_server_name 77\n#define OBJ_netscape_ssl_server_name OBJ_netscape_cert_extension,12L\n\n#define SN_netscape_comment \"nsComment\"\n#define LN_netscape_comment \"Netscape Comment\"\n#define NID_netscape_comment 78\n#define OBJ_netscape_comment OBJ_netscape_cert_extension,13L\n\n#define SN_netscape_cert_sequence \"nsCertSequence\"\n#define LN_netscape_cert_sequence \"Netscape Certificate Sequence\"\n#define NID_netscape_cert_sequence 79\n#define OBJ_netscape_cert_sequence OBJ_netscape_data_type,5L\n\n#define SN_ns_sgc \"nsSGC\"\n#define LN_ns_sgc \"Netscape Server Gated Crypto\"\n#define NID_ns_sgc 139\n#define OBJ_ns_sgc OBJ_netscape,4L,1L\n\n#define SN_org \"ORG\"\n#define LN_org \"org\"\n#define NID_org 379\n#define OBJ_org OBJ_iso,3L\n\n#define SN_dod \"DOD\"\n#define LN_dod \"dod\"\n#define NID_dod 380\n#define OBJ_dod OBJ_org,6L\n\n#define SN_iana \"IANA\"\n#define LN_iana \"iana\"\n#define NID_iana 381\n#define OBJ_iana OBJ_dod,1L\n\n#define OBJ_internet OBJ_iana\n\n#define SN_Directory \"directory\"\n#define LN_Directory \"Directory\"\n#define NID_Directory 382\n#define OBJ_Directory OBJ_internet,1L\n\n#define SN_Management \"mgmt\"\n#define LN_Management \"Management\"\n#define NID_Management 383\n#define OBJ_Management OBJ_internet,2L\n\n#define SN_Experimental \"experimental\"\n#define LN_Experimental \"Experimental\"\n#define NID_Experimental 384\n#define OBJ_Experimental OBJ_internet,3L\n\n#define SN_Private \"private\"\n#define LN_Private \"Private\"\n#define NID_Private 385\n#define OBJ_Private OBJ_internet,4L\n\n#define SN_Security \"security\"\n#define LN_Security \"Security\"\n#define NID_Security 386\n#define OBJ_Security OBJ_internet,5L\n\n#define SN_SNMPv2 \"snmpv2\"\n#define LN_SNMPv2 \"SNMPv2\"\n#define NID_SNMPv2 387\n#define OBJ_SNMPv2 OBJ_internet,6L\n\n#define LN_Mail \"Mail\"\n#define NID_Mail 388\n#define OBJ_Mail OBJ_internet,7L\n\n#define SN_Enterprises \"enterprises\"\n#define LN_Enterprises \"Enterprises\"\n#define NID_Enterprises 389\n#define OBJ_Enterprises OBJ_Private,1L\n\n#define SN_dcObject \"dcobject\"\n#define LN_dcObject \"dcObject\"\n#define NID_dcObject 390\n#define OBJ_dcObject OBJ_Enterprises,1466L,344L\n\n#define SN_mime_mhs \"mime-mhs\"\n#define LN_mime_mhs \"MIME MHS\"\n#define NID_mime_mhs 504\n#define OBJ_mime_mhs OBJ_Mail,1L\n\n#define SN_mime_mhs_headings \"mime-mhs-headings\"\n#define LN_mime_mhs_headings \"mime-mhs-headings\"\n#define NID_mime_mhs_headings 505\n#define OBJ_mime_mhs_headings OBJ_mime_mhs,1L\n\n#define SN_mime_mhs_bodies \"mime-mhs-bodies\"\n#define LN_mime_mhs_bodies \"mime-mhs-bodies\"\n#define NID_mime_mhs_bodies 506\n#define OBJ_mime_mhs_bodies OBJ_mime_mhs,2L\n\n#define SN_id_hex_partial_message \"id-hex-partial-message\"\n#define LN_id_hex_partial_message \"id-hex-partial-message\"\n#define NID_id_hex_partial_message 507\n#define OBJ_id_hex_partial_message OBJ_mime_mhs_headings,1L\n\n#define SN_id_hex_multipart_message \"id-hex-multipart-message\"\n#define LN_id_hex_multipart_message \"id-hex-multipart-message\"\n#define NID_id_hex_multipart_message 508\n#define OBJ_id_hex_multipart_message OBJ_mime_mhs_headings,2L\n\n#define SN_zlib_compression \"ZLIB\"\n#define LN_zlib_compression \"zlib compression\"\n#define NID_zlib_compression 125\n#define OBJ_zlib_compression OBJ_id_smime_alg,8L\n\n#define OBJ_csor 2L,16L,840L,1L,101L,3L\n\n#define OBJ_nistAlgorithms OBJ_csor,4L\n\n#define OBJ_aes OBJ_nistAlgorithms,1L\n\n#define SN_aes_128_ecb \"AES-128-ECB\"\n#define LN_aes_128_ecb \"aes-128-ecb\"\n#define NID_aes_128_ecb 418\n#define OBJ_aes_128_ecb OBJ_aes,1L\n\n#define SN_aes_128_cbc \"AES-128-CBC\"\n#define LN_aes_128_cbc \"aes-128-cbc\"\n#define NID_aes_128_cbc 419\n#define OBJ_aes_128_cbc OBJ_aes,2L\n\n#define SN_aes_128_ofb128 \"AES-128-OFB\"\n#define LN_aes_128_ofb128 \"aes-128-ofb\"\n#define NID_aes_128_ofb128 420\n#define OBJ_aes_128_ofb128 OBJ_aes,3L\n\n#define SN_aes_128_cfb128 \"AES-128-CFB\"\n#define LN_aes_128_cfb128 \"aes-128-cfb\"\n#define NID_aes_128_cfb128 421\n#define OBJ_aes_128_cfb128 OBJ_aes,4L\n\n#define SN_id_aes128_wrap \"id-aes128-wrap\"\n#define NID_id_aes128_wrap 788\n#define OBJ_id_aes128_wrap OBJ_aes,5L\n\n#define SN_aes_128_gcm \"id-aes128-GCM\"\n#define LN_aes_128_gcm \"aes-128-gcm\"\n#define NID_aes_128_gcm 895\n#define OBJ_aes_128_gcm OBJ_aes,6L\n\n#define SN_aes_128_ccm \"id-aes128-CCM\"\n#define LN_aes_128_ccm \"aes-128-ccm\"\n#define NID_aes_128_ccm 896\n#define OBJ_aes_128_ccm OBJ_aes,7L\n\n#define SN_id_aes128_wrap_pad \"id-aes128-wrap-pad\"\n#define NID_id_aes128_wrap_pad 897\n#define OBJ_id_aes128_wrap_pad OBJ_aes,8L\n\n#define SN_aes_192_ecb \"AES-192-ECB\"\n#define LN_aes_192_ecb \"aes-192-ecb\"\n#define NID_aes_192_ecb 422\n#define OBJ_aes_192_ecb OBJ_aes,21L\n\n#define SN_aes_192_cbc \"AES-192-CBC\"\n#define LN_aes_192_cbc \"aes-192-cbc\"\n#define NID_aes_192_cbc 423\n#define OBJ_aes_192_cbc OBJ_aes,22L\n\n#define SN_aes_192_ofb128 \"AES-192-OFB\"\n#define LN_aes_192_ofb128 \"aes-192-ofb\"\n#define NID_aes_192_ofb128 424\n#define OBJ_aes_192_ofb128 OBJ_aes,23L\n\n#define SN_aes_192_cfb128 \"AES-192-CFB\"\n#define LN_aes_192_cfb128 \"aes-192-cfb\"\n#define NID_aes_192_cfb128 425\n#define OBJ_aes_192_cfb128 OBJ_aes,24L\n\n#define SN_id_aes192_wrap \"id-aes192-wrap\"\n#define NID_id_aes192_wrap 789\n#define OBJ_id_aes192_wrap OBJ_aes,25L\n\n#define SN_aes_192_gcm \"id-aes192-GCM\"\n#define LN_aes_192_gcm \"aes-192-gcm\"\n#define NID_aes_192_gcm 898\n#define OBJ_aes_192_gcm OBJ_aes,26L\n\n#define SN_aes_192_ccm \"id-aes192-CCM\"\n#define LN_aes_192_ccm \"aes-192-ccm\"\n#define NID_aes_192_ccm 899\n#define OBJ_aes_192_ccm OBJ_aes,27L\n\n#define SN_id_aes192_wrap_pad \"id-aes192-wrap-pad\"\n#define NID_id_aes192_wrap_pad 900\n#define OBJ_id_aes192_wrap_pad OBJ_aes,28L\n\n#define SN_aes_256_ecb \"AES-256-ECB\"\n#define LN_aes_256_ecb \"aes-256-ecb\"\n#define NID_aes_256_ecb 426\n#define OBJ_aes_256_ecb OBJ_aes,41L\n\n#define SN_aes_256_cbc \"AES-256-CBC\"\n#define LN_aes_256_cbc \"aes-256-cbc\"\n#define NID_aes_256_cbc 427\n#define OBJ_aes_256_cbc OBJ_aes,42L\n\n#define SN_aes_256_ofb128 \"AES-256-OFB\"\n#define LN_aes_256_ofb128 \"aes-256-ofb\"\n#define NID_aes_256_ofb128 428\n#define OBJ_aes_256_ofb128 OBJ_aes,43L\n\n#define SN_aes_256_cfb128 \"AES-256-CFB\"\n#define LN_aes_256_cfb128 \"aes-256-cfb\"\n#define NID_aes_256_cfb128 429\n#define OBJ_aes_256_cfb128 OBJ_aes,44L\n\n#define SN_id_aes256_wrap \"id-aes256-wrap\"\n#define NID_id_aes256_wrap 790\n#define OBJ_id_aes256_wrap OBJ_aes,45L\n\n#define SN_aes_256_gcm \"id-aes256-GCM\"\n#define LN_aes_256_gcm \"aes-256-gcm\"\n#define NID_aes_256_gcm 901\n#define OBJ_aes_256_gcm OBJ_aes,46L\n\n#define SN_aes_256_ccm \"id-aes256-CCM\"\n#define LN_aes_256_ccm \"aes-256-ccm\"\n#define NID_aes_256_ccm 902\n#define OBJ_aes_256_ccm OBJ_aes,47L\n\n#define SN_id_aes256_wrap_pad \"id-aes256-wrap-pad\"\n#define NID_id_aes256_wrap_pad 903\n#define OBJ_id_aes256_wrap_pad OBJ_aes,48L\n\n#define SN_aes_128_xts \"AES-128-XTS\"\n#define LN_aes_128_xts \"aes-128-xts\"\n#define NID_aes_128_xts 913\n#define OBJ_aes_128_xts OBJ_ieee_siswg,0L,1L,1L\n\n#define SN_aes_256_xts \"AES-256-XTS\"\n#define LN_aes_256_xts \"aes-256-xts\"\n#define NID_aes_256_xts 914\n#define OBJ_aes_256_xts OBJ_ieee_siswg,0L,1L,2L\n\n#define SN_aes_128_cfb1 \"AES-128-CFB1\"\n#define LN_aes_128_cfb1 \"aes-128-cfb1\"\n#define NID_aes_128_cfb1 650\n\n#define SN_aes_192_cfb1 \"AES-192-CFB1\"\n#define LN_aes_192_cfb1 \"aes-192-cfb1\"\n#define NID_aes_192_cfb1 651\n\n#define SN_aes_256_cfb1 \"AES-256-CFB1\"\n#define LN_aes_256_cfb1 \"aes-256-cfb1\"\n#define NID_aes_256_cfb1 652\n\n#define SN_aes_128_cfb8 \"AES-128-CFB8\"\n#define LN_aes_128_cfb8 \"aes-128-cfb8\"\n#define NID_aes_128_cfb8 653\n\n#define SN_aes_192_cfb8 \"AES-192-CFB8\"\n#define LN_aes_192_cfb8 \"aes-192-cfb8\"\n#define NID_aes_192_cfb8 654\n\n#define SN_aes_256_cfb8 \"AES-256-CFB8\"\n#define LN_aes_256_cfb8 \"aes-256-cfb8\"\n#define NID_aes_256_cfb8 655\n\n#define SN_aes_128_ctr \"AES-128-CTR\"\n#define LN_aes_128_ctr \"aes-128-ctr\"\n#define NID_aes_128_ctr 904\n\n#define SN_aes_192_ctr \"AES-192-CTR\"\n#define LN_aes_192_ctr \"aes-192-ctr\"\n#define NID_aes_192_ctr 905\n\n#define SN_aes_256_ctr \"AES-256-CTR\"\n#define LN_aes_256_ctr \"aes-256-ctr\"\n#define NID_aes_256_ctr 906\n\n#define SN_aes_128_ocb \"AES-128-OCB\"\n#define LN_aes_128_ocb \"aes-128-ocb\"\n#define NID_aes_128_ocb 958\n\n#define SN_aes_192_ocb \"AES-192-OCB\"\n#define LN_aes_192_ocb \"aes-192-ocb\"\n#define NID_aes_192_ocb 959\n\n#define SN_aes_256_ocb \"AES-256-OCB\"\n#define LN_aes_256_ocb \"aes-256-ocb\"\n#define NID_aes_256_ocb 960\n\n#define SN_des_cfb1 \"DES-CFB1\"\n#define LN_des_cfb1 \"des-cfb1\"\n#define NID_des_cfb1 656\n\n#define SN_des_cfb8 \"DES-CFB8\"\n#define LN_des_cfb8 \"des-cfb8\"\n#define NID_des_cfb8 657\n\n#define SN_des_ede3_cfb1 \"DES-EDE3-CFB1\"\n#define LN_des_ede3_cfb1 \"des-ede3-cfb1\"\n#define NID_des_ede3_cfb1 658\n\n#define SN_des_ede3_cfb8 \"DES-EDE3-CFB8\"\n#define LN_des_ede3_cfb8 \"des-ede3-cfb8\"\n#define NID_des_ede3_cfb8 659\n\n#define OBJ_nist_hashalgs OBJ_nistAlgorithms,2L\n\n#define SN_sha256 \"SHA256\"\n#define LN_sha256 \"sha256\"\n#define NID_sha256 672\n#define OBJ_sha256 OBJ_nist_hashalgs,1L\n\n#define SN_sha384 \"SHA384\"\n#define LN_sha384 \"sha384\"\n#define NID_sha384 673\n#define OBJ_sha384 OBJ_nist_hashalgs,2L\n\n#define SN_sha512 \"SHA512\"\n#define LN_sha512 \"sha512\"\n#define NID_sha512 674\n#define OBJ_sha512 OBJ_nist_hashalgs,3L\n\n#define SN_sha224 \"SHA224\"\n#define LN_sha224 \"sha224\"\n#define NID_sha224 675\n#define OBJ_sha224 OBJ_nist_hashalgs,4L\n\n#define SN_sha512_224 \"SHA512-224\"\n#define LN_sha512_224 \"sha512-224\"\n#define NID_sha512_224 1094\n#define OBJ_sha512_224 OBJ_nist_hashalgs,5L\n\n#define SN_sha512_256 \"SHA512-256\"\n#define LN_sha512_256 \"sha512-256\"\n#define NID_sha512_256 1095\n#define OBJ_sha512_256 OBJ_nist_hashalgs,6L\n\n#define SN_sha3_224 \"SHA3-224\"\n#define LN_sha3_224 \"sha3-224\"\n#define NID_sha3_224 1096\n#define OBJ_sha3_224 OBJ_nist_hashalgs,7L\n\n#define SN_sha3_256 \"SHA3-256\"\n#define LN_sha3_256 \"sha3-256\"\n#define NID_sha3_256 1097\n#define OBJ_sha3_256 OBJ_nist_hashalgs,8L\n\n#define SN_sha3_384 \"SHA3-384\"\n#define LN_sha3_384 \"sha3-384\"\n#define NID_sha3_384 1098\n#define OBJ_sha3_384 OBJ_nist_hashalgs,9L\n\n#define SN_sha3_512 \"SHA3-512\"\n#define LN_sha3_512 \"sha3-512\"\n#define NID_sha3_512 1099\n#define OBJ_sha3_512 OBJ_nist_hashalgs,10L\n\n#define SN_shake128 \"SHAKE128\"\n#define LN_shake128 \"shake128\"\n#define NID_shake128 1100\n#define OBJ_shake128 OBJ_nist_hashalgs,11L\n\n#define SN_shake256 \"SHAKE256\"\n#define LN_shake256 \"shake256\"\n#define NID_shake256 1101\n#define OBJ_shake256 OBJ_nist_hashalgs,12L\n\n#define SN_hmac_sha3_224 \"id-hmacWithSHA3-224\"\n#define LN_hmac_sha3_224 \"hmac-sha3-224\"\n#define NID_hmac_sha3_224 1102\n#define OBJ_hmac_sha3_224 OBJ_nist_hashalgs,13L\n\n#define SN_hmac_sha3_256 \"id-hmacWithSHA3-256\"\n#define LN_hmac_sha3_256 \"hmac-sha3-256\"\n#define NID_hmac_sha3_256 1103\n#define OBJ_hmac_sha3_256 OBJ_nist_hashalgs,14L\n\n#define SN_hmac_sha3_384 \"id-hmacWithSHA3-384\"\n#define LN_hmac_sha3_384 \"hmac-sha3-384\"\n#define NID_hmac_sha3_384 1104\n#define OBJ_hmac_sha3_384 OBJ_nist_hashalgs,15L\n\n#define SN_hmac_sha3_512 \"id-hmacWithSHA3-512\"\n#define LN_hmac_sha3_512 \"hmac-sha3-512\"\n#define NID_hmac_sha3_512 1105\n#define OBJ_hmac_sha3_512 OBJ_nist_hashalgs,16L\n\n#define OBJ_dsa_with_sha2 OBJ_nistAlgorithms,3L\n\n#define SN_dsa_with_SHA224 \"dsa_with_SHA224\"\n#define NID_dsa_with_SHA224 802\n#define OBJ_dsa_with_SHA224 OBJ_dsa_with_sha2,1L\n\n#define SN_dsa_with_SHA256 \"dsa_with_SHA256\"\n#define NID_dsa_with_SHA256 803\n#define OBJ_dsa_with_SHA256 OBJ_dsa_with_sha2,2L\n\n#define OBJ_sigAlgs OBJ_nistAlgorithms,3L\n\n#define SN_dsa_with_SHA384 \"id-dsa-with-sha384\"\n#define LN_dsa_with_SHA384 \"dsa_with_SHA384\"\n#define NID_dsa_with_SHA384 1106\n#define OBJ_dsa_with_SHA384 OBJ_sigAlgs,3L\n\n#define SN_dsa_with_SHA512 \"id-dsa-with-sha512\"\n#define LN_dsa_with_SHA512 \"dsa_with_SHA512\"\n#define NID_dsa_with_SHA512 1107\n#define OBJ_dsa_with_SHA512 OBJ_sigAlgs,4L\n\n#define SN_dsa_with_SHA3_224 \"id-dsa-with-sha3-224\"\n#define LN_dsa_with_SHA3_224 \"dsa_with_SHA3-224\"\n#define NID_dsa_with_SHA3_224 1108\n#define OBJ_dsa_with_SHA3_224 OBJ_sigAlgs,5L\n\n#define SN_dsa_with_SHA3_256 \"id-dsa-with-sha3-256\"\n#define LN_dsa_with_SHA3_256 \"dsa_with_SHA3-256\"\n#define NID_dsa_with_SHA3_256 1109\n#define OBJ_dsa_with_SHA3_256 OBJ_sigAlgs,6L\n\n#define SN_dsa_with_SHA3_384 \"id-dsa-with-sha3-384\"\n#define LN_dsa_with_SHA3_384 \"dsa_with_SHA3-384\"\n#define NID_dsa_with_SHA3_384 1110\n#define OBJ_dsa_with_SHA3_384 OBJ_sigAlgs,7L\n\n#define SN_dsa_with_SHA3_512 \"id-dsa-with-sha3-512\"\n#define LN_dsa_with_SHA3_512 \"dsa_with_SHA3-512\"\n#define NID_dsa_with_SHA3_512 1111\n#define OBJ_dsa_with_SHA3_512 OBJ_sigAlgs,8L\n\n#define SN_ecdsa_with_SHA3_224 \"id-ecdsa-with-sha3-224\"\n#define LN_ecdsa_with_SHA3_224 \"ecdsa_with_SHA3-224\"\n#define NID_ecdsa_with_SHA3_224 1112\n#define OBJ_ecdsa_with_SHA3_224 OBJ_sigAlgs,9L\n\n#define SN_ecdsa_with_SHA3_256 \"id-ecdsa-with-sha3-256\"\n#define LN_ecdsa_with_SHA3_256 \"ecdsa_with_SHA3-256\"\n#define NID_ecdsa_with_SHA3_256 1113\n#define OBJ_ecdsa_with_SHA3_256 OBJ_sigAlgs,10L\n\n#define SN_ecdsa_with_SHA3_384 \"id-ecdsa-with-sha3-384\"\n#define LN_ecdsa_with_SHA3_384 \"ecdsa_with_SHA3-384\"\n#define NID_ecdsa_with_SHA3_384 1114\n#define OBJ_ecdsa_with_SHA3_384 OBJ_sigAlgs,11L\n\n#define SN_ecdsa_with_SHA3_512 \"id-ecdsa-with-sha3-512\"\n#define LN_ecdsa_with_SHA3_512 \"ecdsa_with_SHA3-512\"\n#define NID_ecdsa_with_SHA3_512 1115\n#define OBJ_ecdsa_with_SHA3_512 OBJ_sigAlgs,12L\n\n#define SN_RSA_SHA3_224 \"id-rsassa-pkcs1-v1_5-with-sha3-224\"\n#define LN_RSA_SHA3_224 \"RSA-SHA3-224\"\n#define NID_RSA_SHA3_224 1116\n#define OBJ_RSA_SHA3_224 OBJ_sigAlgs,13L\n\n#define SN_RSA_SHA3_256 \"id-rsassa-pkcs1-v1_5-with-sha3-256\"\n#define LN_RSA_SHA3_256 \"RSA-SHA3-256\"\n#define NID_RSA_SHA3_256 1117\n#define OBJ_RSA_SHA3_256 OBJ_sigAlgs,14L\n\n#define SN_RSA_SHA3_384 \"id-rsassa-pkcs1-v1_5-with-sha3-384\"\n#define LN_RSA_SHA3_384 \"RSA-SHA3-384\"\n#define NID_RSA_SHA3_384 1118\n#define OBJ_RSA_SHA3_384 OBJ_sigAlgs,15L\n\n#define SN_RSA_SHA3_512 \"id-rsassa-pkcs1-v1_5-with-sha3-512\"\n#define LN_RSA_SHA3_512 \"RSA-SHA3-512\"\n#define NID_RSA_SHA3_512 1119\n#define OBJ_RSA_SHA3_512 OBJ_sigAlgs,16L\n\n#define SN_hold_instruction_code \"holdInstructionCode\"\n#define LN_hold_instruction_code \"Hold Instruction Code\"\n#define NID_hold_instruction_code 430\n#define OBJ_hold_instruction_code OBJ_id_ce,23L\n\n#define OBJ_holdInstruction OBJ_X9_57,2L\n\n#define SN_hold_instruction_none \"holdInstructionNone\"\n#define LN_hold_instruction_none \"Hold Instruction None\"\n#define NID_hold_instruction_none 431\n#define OBJ_hold_instruction_none OBJ_holdInstruction,1L\n\n#define SN_hold_instruction_call_issuer \"holdInstructionCallIssuer\"\n#define LN_hold_instruction_call_issuer \"Hold Instruction Call Issuer\"\n#define NID_hold_instruction_call_issuer 432\n#define OBJ_hold_instruction_call_issuer OBJ_holdInstruction,2L\n\n#define SN_hold_instruction_reject \"holdInstructionReject\"\n#define LN_hold_instruction_reject \"Hold Instruction Reject\"\n#define NID_hold_instruction_reject 433\n#define OBJ_hold_instruction_reject OBJ_holdInstruction,3L\n\n#define SN_data \"data\"\n#define NID_data 434\n#define OBJ_data OBJ_itu_t,9L\n\n#define SN_pss \"pss\"\n#define NID_pss 435\n#define OBJ_pss OBJ_data,2342L\n\n#define SN_ucl \"ucl\"\n#define NID_ucl 436\n#define OBJ_ucl OBJ_pss,19200300L\n\n#define SN_pilot \"pilot\"\n#define NID_pilot 437\n#define OBJ_pilot OBJ_ucl,100L\n\n#define LN_pilotAttributeType \"pilotAttributeType\"\n#define NID_pilotAttributeType 438\n#define OBJ_pilotAttributeType OBJ_pilot,1L\n\n#define LN_pilotAttributeSyntax \"pilotAttributeSyntax\"\n#define NID_pilotAttributeSyntax 439\n#define OBJ_pilotAttributeSyntax OBJ_pilot,3L\n\n#define LN_pilotObjectClass \"pilotObjectClass\"\n#define NID_pilotObjectClass 440\n#define OBJ_pilotObjectClass OBJ_pilot,4L\n\n#define LN_pilotGroups \"pilotGroups\"\n#define NID_pilotGroups 441\n#define OBJ_pilotGroups OBJ_pilot,10L\n\n#define LN_iA5StringSyntax \"iA5StringSyntax\"\n#define NID_iA5StringSyntax 442\n#define OBJ_iA5StringSyntax OBJ_pilotAttributeSyntax,4L\n\n#define LN_caseIgnoreIA5StringSyntax \"caseIgnoreIA5StringSyntax\"\n#define NID_caseIgnoreIA5StringSyntax 443\n#define OBJ_caseIgnoreIA5StringSyntax OBJ_pilotAttributeSyntax,5L\n\n#define LN_pilotObject \"pilotObject\"\n#define NID_pilotObject 444\n#define OBJ_pilotObject OBJ_pilotObjectClass,3L\n\n#define LN_pilotPerson \"pilotPerson\"\n#define NID_pilotPerson 445\n#define OBJ_pilotPerson OBJ_pilotObjectClass,4L\n\n#define SN_account \"account\"\n#define NID_account 446\n#define OBJ_account OBJ_pilotObjectClass,5L\n\n#define SN_document \"document\"\n#define NID_document 447\n#define OBJ_document OBJ_pilotObjectClass,6L\n\n#define SN_room \"room\"\n#define NID_room 448\n#define OBJ_room OBJ_pilotObjectClass,7L\n\n#define LN_documentSeries \"documentSeries\"\n#define NID_documentSeries 449\n#define OBJ_documentSeries OBJ_pilotObjectClass,9L\n\n#define SN_Domain \"domain\"\n#define LN_Domain \"Domain\"\n#define NID_Domain 392\n#define OBJ_Domain OBJ_pilotObjectClass,13L\n\n#define LN_rFC822localPart \"rFC822localPart\"\n#define NID_rFC822localPart 450\n#define OBJ_rFC822localPart OBJ_pilotObjectClass,14L\n\n#define LN_dNSDomain \"dNSDomain\"\n#define NID_dNSDomain 451\n#define OBJ_dNSDomain OBJ_pilotObjectClass,15L\n\n#define LN_domainRelatedObject \"domainRelatedObject\"\n#define NID_domainRelatedObject 452\n#define OBJ_domainRelatedObject OBJ_pilotObjectClass,17L\n\n#define LN_friendlyCountry \"friendlyCountry\"\n#define NID_friendlyCountry 453\n#define OBJ_friendlyCountry OBJ_pilotObjectClass,18L\n\n#define LN_simpleSecurityObject \"simpleSecurityObject\"\n#define NID_simpleSecurityObject 454\n#define OBJ_simpleSecurityObject OBJ_pilotObjectClass,19L\n\n#define LN_pilotOrganization \"pilotOrganization\"\n#define NID_pilotOrganization 455\n#define OBJ_pilotOrganization OBJ_pilotObjectClass,20L\n\n#define LN_pilotDSA \"pilotDSA\"\n#define NID_pilotDSA 456\n#define OBJ_pilotDSA OBJ_pilotObjectClass,21L\n\n#define LN_qualityLabelledData \"qualityLabelledData\"\n#define NID_qualityLabelledData 457\n#define OBJ_qualityLabelledData OBJ_pilotObjectClass,22L\n\n#define SN_userId \"UID\"\n#define LN_userId \"userId\"\n#define NID_userId 458\n#define OBJ_userId OBJ_pilotAttributeType,1L\n\n#define LN_textEncodedORAddress \"textEncodedORAddress\"\n#define NID_textEncodedORAddress 459\n#define OBJ_textEncodedORAddress OBJ_pilotAttributeType,2L\n\n#define SN_rfc822Mailbox \"mail\"\n#define LN_rfc822Mailbox \"rfc822Mailbox\"\n#define NID_rfc822Mailbox 460\n#define OBJ_rfc822Mailbox OBJ_pilotAttributeType,3L\n\n#define SN_info \"info\"\n#define NID_info 461\n#define OBJ_info OBJ_pilotAttributeType,4L\n\n#define LN_favouriteDrink \"favouriteDrink\"\n#define NID_favouriteDrink 462\n#define OBJ_favouriteDrink OBJ_pilotAttributeType,5L\n\n#define LN_roomNumber \"roomNumber\"\n#define NID_roomNumber 463\n#define OBJ_roomNumber OBJ_pilotAttributeType,6L\n\n#define SN_photo \"photo\"\n#define NID_photo 464\n#define OBJ_photo OBJ_pilotAttributeType,7L\n\n#define LN_userClass \"userClass\"\n#define NID_userClass 465\n#define OBJ_userClass OBJ_pilotAttributeType,8L\n\n#define SN_host \"host\"\n#define NID_host 466\n#define OBJ_host OBJ_pilotAttributeType,9L\n\n#define SN_manager \"manager\"\n#define NID_manager 467\n#define OBJ_manager OBJ_pilotAttributeType,10L\n\n#define LN_documentIdentifier \"documentIdentifier\"\n#define NID_documentIdentifier 468\n#define OBJ_documentIdentifier OBJ_pilotAttributeType,11L\n\n#define LN_documentTitle \"documentTitle\"\n#define NID_documentTitle 469\n#define OBJ_documentTitle OBJ_pilotAttributeType,12L\n\n#define LN_documentVersion \"documentVersion\"\n#define NID_documentVersion 470\n#define OBJ_documentVersion OBJ_pilotAttributeType,13L\n\n#define LN_documentAuthor \"documentAuthor\"\n#define NID_documentAuthor 471\n#define OBJ_documentAuthor OBJ_pilotAttributeType,14L\n\n#define LN_documentLocation \"documentLocation\"\n#define NID_documentLocation 472\n#define OBJ_documentLocation OBJ_pilotAttributeType,15L\n\n#define LN_homeTelephoneNumber \"homeTelephoneNumber\"\n#define NID_homeTelephoneNumber 473\n#define OBJ_homeTelephoneNumber OBJ_pilotAttributeType,20L\n\n#define SN_secretary \"secretary\"\n#define NID_secretary 474\n#define OBJ_secretary OBJ_pilotAttributeType,21L\n\n#define LN_otherMailbox \"otherMailbox\"\n#define NID_otherMailbox 475\n#define OBJ_otherMailbox OBJ_pilotAttributeType,22L\n\n#define LN_lastModifiedTime \"lastModifiedTime\"\n#define NID_lastModifiedTime 476\n#define OBJ_lastModifiedTime OBJ_pilotAttributeType,23L\n\n#define LN_lastModifiedBy \"lastModifiedBy\"\n#define NID_lastModifiedBy 477\n#define OBJ_lastModifiedBy OBJ_pilotAttributeType,24L\n\n#define SN_domainComponent \"DC\"\n#define LN_domainComponent \"domainComponent\"\n#define NID_domainComponent 391\n#define OBJ_domainComponent OBJ_pilotAttributeType,25L\n\n#define LN_aRecord \"aRecord\"\n#define NID_aRecord 478\n#define OBJ_aRecord OBJ_pilotAttributeType,26L\n\n#define LN_pilotAttributeType27 \"pilotAttributeType27\"\n#define NID_pilotAttributeType27 479\n#define OBJ_pilotAttributeType27 OBJ_pilotAttributeType,27L\n\n#define LN_mXRecord \"mXRecord\"\n#define NID_mXRecord 480\n#define OBJ_mXRecord OBJ_pilotAttributeType,28L\n\n#define LN_nSRecord \"nSRecord\"\n#define NID_nSRecord 481\n#define OBJ_nSRecord OBJ_pilotAttributeType,29L\n\n#define LN_sOARecord \"sOARecord\"\n#define NID_sOARecord 482\n#define OBJ_sOARecord OBJ_pilotAttributeType,30L\n\n#define LN_cNAMERecord \"cNAMERecord\"\n#define NID_cNAMERecord 483\n#define OBJ_cNAMERecord OBJ_pilotAttributeType,31L\n\n#define LN_associatedDomain \"associatedDomain\"\n#define NID_associatedDomain 484\n#define OBJ_associatedDomain OBJ_pilotAttributeType,37L\n\n#define LN_associatedName \"associatedName\"\n#define NID_associatedName 485\n#define OBJ_associatedName OBJ_pilotAttributeType,38L\n\n#define LN_homePostalAddress \"homePostalAddress\"\n#define NID_homePostalAddress 486\n#define OBJ_homePostalAddress OBJ_pilotAttributeType,39L\n\n#define LN_personalTitle \"personalTitle\"\n#define NID_personalTitle 487\n#define OBJ_personalTitle OBJ_pilotAttributeType,40L\n\n#define LN_mobileTelephoneNumber \"mobileTelephoneNumber\"\n#define NID_mobileTelephoneNumber 488\n#define OBJ_mobileTelephoneNumber OBJ_pilotAttributeType,41L\n\n#define LN_pagerTelephoneNumber \"pagerTelephoneNumber\"\n#define NID_pagerTelephoneNumber 489\n#define OBJ_pagerTelephoneNumber OBJ_pilotAttributeType,42L\n\n#define LN_friendlyCountryName \"friendlyCountryName\"\n#define NID_friendlyCountryName 490\n#define OBJ_friendlyCountryName OBJ_pilotAttributeType,43L\n\n#define SN_uniqueIdentifier \"uid\"\n#define LN_uniqueIdentifier \"uniqueIdentifier\"\n#define NID_uniqueIdentifier 102\n#define OBJ_uniqueIdentifier OBJ_pilotAttributeType,44L\n\n#define LN_organizationalStatus \"organizationalStatus\"\n#define NID_organizationalStatus 491\n#define OBJ_organizationalStatus OBJ_pilotAttributeType,45L\n\n#define LN_janetMailbox \"janetMailbox\"\n#define NID_janetMailbox 492\n#define OBJ_janetMailbox OBJ_pilotAttributeType,46L\n\n#define LN_mailPreferenceOption \"mailPreferenceOption\"\n#define NID_mailPreferenceOption 493\n#define OBJ_mailPreferenceOption OBJ_pilotAttributeType,47L\n\n#define LN_buildingName \"buildingName\"\n#define NID_buildingName 494\n#define OBJ_buildingName OBJ_pilotAttributeType,48L\n\n#define LN_dSAQuality \"dSAQuality\"\n#define NID_dSAQuality 495\n#define OBJ_dSAQuality OBJ_pilotAttributeType,49L\n\n#define LN_singleLevelQuality \"singleLevelQuality\"\n#define NID_singleLevelQuality 496\n#define OBJ_singleLevelQuality OBJ_pilotAttributeType,50L\n\n#define LN_subtreeMinimumQuality \"subtreeMinimumQuality\"\n#define NID_subtreeMinimumQuality 497\n#define OBJ_subtreeMinimumQuality OBJ_pilotAttributeType,51L\n\n#define LN_subtreeMaximumQuality \"subtreeMaximumQuality\"\n#define NID_subtreeMaximumQuality 498\n#define OBJ_subtreeMaximumQuality OBJ_pilotAttributeType,52L\n\n#define LN_personalSignature \"personalSignature\"\n#define NID_personalSignature 499\n#define OBJ_personalSignature OBJ_pilotAttributeType,53L\n\n#define LN_dITRedirect \"dITRedirect\"\n#define NID_dITRedirect 500\n#define OBJ_dITRedirect OBJ_pilotAttributeType,54L\n\n#define SN_audio \"audio\"\n#define NID_audio 501\n#define OBJ_audio OBJ_pilotAttributeType,55L\n\n#define LN_documentPublisher \"documentPublisher\"\n#define NID_documentPublisher 502\n#define OBJ_documentPublisher OBJ_pilotAttributeType,56L\n\n#define SN_id_set \"id-set\"\n#define LN_id_set \"Secure Electronic Transactions\"\n#define NID_id_set 512\n#define OBJ_id_set OBJ_international_organizations,42L\n\n#define SN_set_ctype \"set-ctype\"\n#define LN_set_ctype \"content types\"\n#define NID_set_ctype 513\n#define OBJ_set_ctype OBJ_id_set,0L\n\n#define SN_set_msgExt \"set-msgExt\"\n#define LN_set_msgExt \"message extensions\"\n#define NID_set_msgExt 514\n#define OBJ_set_msgExt OBJ_id_set,1L\n\n#define SN_set_attr \"set-attr\"\n#define NID_set_attr 515\n#define OBJ_set_attr OBJ_id_set,3L\n\n#define SN_set_policy \"set-policy\"\n#define NID_set_policy 516\n#define OBJ_set_policy OBJ_id_set,5L\n\n#define SN_set_certExt \"set-certExt\"\n#define LN_set_certExt \"certificate extensions\"\n#define NID_set_certExt 517\n#define OBJ_set_certExt OBJ_id_set,7L\n\n#define SN_set_brand \"set-brand\"\n#define NID_set_brand 518\n#define OBJ_set_brand OBJ_id_set,8L\n\n#define SN_setct_PANData \"setct-PANData\"\n#define NID_setct_PANData 519\n#define OBJ_setct_PANData OBJ_set_ctype,0L\n\n#define SN_setct_PANToken \"setct-PANToken\"\n#define NID_setct_PANToken 520\n#define OBJ_setct_PANToken OBJ_set_ctype,1L\n\n#define SN_setct_PANOnly \"setct-PANOnly\"\n#define NID_setct_PANOnly 521\n#define OBJ_setct_PANOnly OBJ_set_ctype,2L\n\n#define SN_setct_OIData \"setct-OIData\"\n#define NID_setct_OIData 522\n#define OBJ_setct_OIData OBJ_set_ctype,3L\n\n#define SN_setct_PI \"setct-PI\"\n#define NID_setct_PI 523\n#define OBJ_setct_PI OBJ_set_ctype,4L\n\n#define SN_setct_PIData \"setct-PIData\"\n#define NID_setct_PIData 524\n#define OBJ_setct_PIData OBJ_set_ctype,5L\n\n#define SN_setct_PIDataUnsigned \"setct-PIDataUnsigned\"\n#define NID_setct_PIDataUnsigned 525\n#define OBJ_setct_PIDataUnsigned OBJ_set_ctype,6L\n\n#define SN_setct_HODInput \"setct-HODInput\"\n#define NID_setct_HODInput 526\n#define OBJ_setct_HODInput OBJ_set_ctype,7L\n\n#define SN_setct_AuthResBaggage \"setct-AuthResBaggage\"\n#define NID_setct_AuthResBaggage 527\n#define OBJ_setct_AuthResBaggage OBJ_set_ctype,8L\n\n#define SN_setct_AuthRevReqBaggage \"setct-AuthRevReqBaggage\"\n#define NID_setct_AuthRevReqBaggage 528\n#define OBJ_setct_AuthRevReqBaggage OBJ_set_ctype,9L\n\n#define SN_setct_AuthRevResBaggage \"setct-AuthRevResBaggage\"\n#define NID_setct_AuthRevResBaggage 529\n#define OBJ_setct_AuthRevResBaggage OBJ_set_ctype,10L\n\n#define SN_setct_CapTokenSeq \"setct-CapTokenSeq\"\n#define NID_setct_CapTokenSeq 530\n#define OBJ_setct_CapTokenSeq OBJ_set_ctype,11L\n\n#define SN_setct_PInitResData \"setct-PInitResData\"\n#define NID_setct_PInitResData 531\n#define OBJ_setct_PInitResData OBJ_set_ctype,12L\n\n#define SN_setct_PI_TBS \"setct-PI-TBS\"\n#define NID_setct_PI_TBS 532\n#define OBJ_setct_PI_TBS OBJ_set_ctype,13L\n\n#define SN_setct_PResData \"setct-PResData\"\n#define NID_setct_PResData 533\n#define OBJ_setct_PResData OBJ_set_ctype,14L\n\n#define SN_setct_AuthReqTBS \"setct-AuthReqTBS\"\n#define NID_setct_AuthReqTBS 534\n#define OBJ_setct_AuthReqTBS OBJ_set_ctype,16L\n\n#define SN_setct_AuthResTBS \"setct-AuthResTBS\"\n#define NID_setct_AuthResTBS 535\n#define OBJ_setct_AuthResTBS OBJ_set_ctype,17L\n\n#define SN_setct_AuthResTBSX \"setct-AuthResTBSX\"\n#define NID_setct_AuthResTBSX 536\n#define OBJ_setct_AuthResTBSX OBJ_set_ctype,18L\n\n#define SN_setct_AuthTokenTBS \"setct-AuthTokenTBS\"\n#define NID_setct_AuthTokenTBS 537\n#define OBJ_setct_AuthTokenTBS OBJ_set_ctype,19L\n\n#define SN_setct_CapTokenData \"setct-CapTokenData\"\n#define NID_setct_CapTokenData 538\n#define OBJ_setct_CapTokenData OBJ_set_ctype,20L\n\n#define SN_setct_CapTokenTBS \"setct-CapTokenTBS\"\n#define NID_setct_CapTokenTBS 539\n#define OBJ_setct_CapTokenTBS OBJ_set_ctype,21L\n\n#define SN_setct_AcqCardCodeMsg \"setct-AcqCardCodeMsg\"\n#define NID_setct_AcqCardCodeMsg 540\n#define OBJ_setct_AcqCardCodeMsg OBJ_set_ctype,22L\n\n#define SN_setct_AuthRevReqTBS \"setct-AuthRevReqTBS\"\n#define NID_setct_AuthRevReqTBS 541\n#define OBJ_setct_AuthRevReqTBS OBJ_set_ctype,23L\n\n#define SN_setct_AuthRevResData \"setct-AuthRevResData\"\n#define NID_setct_AuthRevResData 542\n#define OBJ_setct_AuthRevResData OBJ_set_ctype,24L\n\n#define SN_setct_AuthRevResTBS \"setct-AuthRevResTBS\"\n#define NID_setct_AuthRevResTBS 543\n#define OBJ_setct_AuthRevResTBS OBJ_set_ctype,25L\n\n#define SN_setct_CapReqTBS \"setct-CapReqTBS\"\n#define NID_setct_CapReqTBS 544\n#define OBJ_setct_CapReqTBS OBJ_set_ctype,26L\n\n#define SN_setct_CapReqTBSX \"setct-CapReqTBSX\"\n#define NID_setct_CapReqTBSX 545\n#define OBJ_setct_CapReqTBSX OBJ_set_ctype,27L\n\n#define SN_setct_CapResData \"setct-CapResData\"\n#define NID_setct_CapResData 546\n#define OBJ_setct_CapResData OBJ_set_ctype,28L\n\n#define SN_setct_CapRevReqTBS \"setct-CapRevReqTBS\"\n#define NID_setct_CapRevReqTBS 547\n#define OBJ_setct_CapRevReqTBS OBJ_set_ctype,29L\n\n#define SN_setct_CapRevReqTBSX \"setct-CapRevReqTBSX\"\n#define NID_setct_CapRevReqTBSX 548\n#define OBJ_setct_CapRevReqTBSX OBJ_set_ctype,30L\n\n#define SN_setct_CapRevResData \"setct-CapRevResData\"\n#define NID_setct_CapRevResData 549\n#define OBJ_setct_CapRevResData OBJ_set_ctype,31L\n\n#define SN_setct_CredReqTBS \"setct-CredReqTBS\"\n#define NID_setct_CredReqTBS 550\n#define OBJ_setct_CredReqTBS OBJ_set_ctype,32L\n\n#define SN_setct_CredReqTBSX \"setct-CredReqTBSX\"\n#define NID_setct_CredReqTBSX 551\n#define OBJ_setct_CredReqTBSX OBJ_set_ctype,33L\n\n#define SN_setct_CredResData \"setct-CredResData\"\n#define NID_setct_CredResData 552\n#define OBJ_setct_CredResData OBJ_set_ctype,34L\n\n#define SN_setct_CredRevReqTBS \"setct-CredRevReqTBS\"\n#define NID_setct_CredRevReqTBS 553\n#define OBJ_setct_CredRevReqTBS OBJ_set_ctype,35L\n\n#define SN_setct_CredRevReqTBSX \"setct-CredRevReqTBSX\"\n#define NID_setct_CredRevReqTBSX 554\n#define OBJ_setct_CredRevReqTBSX OBJ_set_ctype,36L\n\n#define SN_setct_CredRevResData \"setct-CredRevResData\"\n#define NID_setct_CredRevResData 555\n#define OBJ_setct_CredRevResData OBJ_set_ctype,37L\n\n#define SN_setct_PCertReqData \"setct-PCertReqData\"\n#define NID_setct_PCertReqData 556\n#define OBJ_setct_PCertReqData OBJ_set_ctype,38L\n\n#define SN_setct_PCertResTBS \"setct-PCertResTBS\"\n#define NID_setct_PCertResTBS 557\n#define OBJ_setct_PCertResTBS OBJ_set_ctype,39L\n\n#define SN_setct_BatchAdminReqData \"setct-BatchAdminReqData\"\n#define NID_setct_BatchAdminReqData 558\n#define OBJ_setct_BatchAdminReqData OBJ_set_ctype,40L\n\n#define SN_setct_BatchAdminResData \"setct-BatchAdminResData\"\n#define NID_setct_BatchAdminResData 559\n#define OBJ_setct_BatchAdminResData OBJ_set_ctype,41L\n\n#define SN_setct_CardCInitResTBS \"setct-CardCInitResTBS\"\n#define NID_setct_CardCInitResTBS 560\n#define OBJ_setct_CardCInitResTBS OBJ_set_ctype,42L\n\n#define SN_setct_MeAqCInitResTBS \"setct-MeAqCInitResTBS\"\n#define NID_setct_MeAqCInitResTBS 561\n#define OBJ_setct_MeAqCInitResTBS OBJ_set_ctype,43L\n\n#define SN_setct_RegFormResTBS \"setct-RegFormResTBS\"\n#define NID_setct_RegFormResTBS 562\n#define OBJ_setct_RegFormResTBS OBJ_set_ctype,44L\n\n#define SN_setct_CertReqData \"setct-CertReqData\"\n#define NID_setct_CertReqData 563\n#define OBJ_setct_CertReqData OBJ_set_ctype,45L\n\n#define SN_setct_CertReqTBS \"setct-CertReqTBS\"\n#define NID_setct_CertReqTBS 564\n#define OBJ_setct_CertReqTBS OBJ_set_ctype,46L\n\n#define SN_setct_CertResData \"setct-CertResData\"\n#define NID_setct_CertResData 565\n#define OBJ_setct_CertResData OBJ_set_ctype,47L\n\n#define SN_setct_CertInqReqTBS \"setct-CertInqReqTBS\"\n#define NID_setct_CertInqReqTBS 566\n#define OBJ_setct_CertInqReqTBS OBJ_set_ctype,48L\n\n#define SN_setct_ErrorTBS \"setct-ErrorTBS\"\n#define NID_setct_ErrorTBS 567\n#define OBJ_setct_ErrorTBS OBJ_set_ctype,49L\n\n#define SN_setct_PIDualSignedTBE \"setct-PIDualSignedTBE\"\n#define NID_setct_PIDualSignedTBE 568\n#define OBJ_setct_PIDualSignedTBE OBJ_set_ctype,50L\n\n#define SN_setct_PIUnsignedTBE \"setct-PIUnsignedTBE\"\n#define NID_setct_PIUnsignedTBE 569\n#define OBJ_setct_PIUnsignedTBE OBJ_set_ctype,51L\n\n#define SN_setct_AuthReqTBE \"setct-AuthReqTBE\"\n#define NID_setct_AuthReqTBE 570\n#define OBJ_setct_AuthReqTBE OBJ_set_ctype,52L\n\n#define SN_setct_AuthResTBE \"setct-AuthResTBE\"\n#define NID_setct_AuthResTBE 571\n#define OBJ_setct_AuthResTBE OBJ_set_ctype,53L\n\n#define SN_setct_AuthResTBEX \"setct-AuthResTBEX\"\n#define NID_setct_AuthResTBEX 572\n#define OBJ_setct_AuthResTBEX OBJ_set_ctype,54L\n\n#define SN_setct_AuthTokenTBE \"setct-AuthTokenTBE\"\n#define NID_setct_AuthTokenTBE 573\n#define OBJ_setct_AuthTokenTBE OBJ_set_ctype,55L\n\n#define SN_setct_CapTokenTBE \"setct-CapTokenTBE\"\n#define NID_setct_CapTokenTBE 574\n#define OBJ_setct_CapTokenTBE OBJ_set_ctype,56L\n\n#define SN_setct_CapTokenTBEX \"setct-CapTokenTBEX\"\n#define NID_setct_CapTokenTBEX 575\n#define OBJ_setct_CapTokenTBEX OBJ_set_ctype,57L\n\n#define SN_setct_AcqCardCodeMsgTBE \"setct-AcqCardCodeMsgTBE\"\n#define NID_setct_AcqCardCodeMsgTBE 576\n#define OBJ_setct_AcqCardCodeMsgTBE OBJ_set_ctype,58L\n\n#define SN_setct_AuthRevReqTBE \"setct-AuthRevReqTBE\"\n#define NID_setct_AuthRevReqTBE 577\n#define OBJ_setct_AuthRevReqTBE OBJ_set_ctype,59L\n\n#define SN_setct_AuthRevResTBE \"setct-AuthRevResTBE\"\n#define NID_setct_AuthRevResTBE 578\n#define OBJ_setct_AuthRevResTBE OBJ_set_ctype,60L\n\n#define SN_setct_AuthRevResTBEB \"setct-AuthRevResTBEB\"\n#define NID_setct_AuthRevResTBEB 579\n#define OBJ_setct_AuthRevResTBEB OBJ_set_ctype,61L\n\n#define SN_setct_CapReqTBE \"setct-CapReqTBE\"\n#define NID_setct_CapReqTBE 580\n#define OBJ_setct_CapReqTBE OBJ_set_ctype,62L\n\n#define SN_setct_CapReqTBEX \"setct-CapReqTBEX\"\n#define NID_setct_CapReqTBEX 581\n#define OBJ_setct_CapReqTBEX OBJ_set_ctype,63L\n\n#define SN_setct_CapResTBE \"setct-CapResTBE\"\n#define NID_setct_CapResTBE 582\n#define OBJ_setct_CapResTBE OBJ_set_ctype,64L\n\n#define SN_setct_CapRevReqTBE \"setct-CapRevReqTBE\"\n#define NID_setct_CapRevReqTBE 583\n#define OBJ_setct_CapRevReqTBE OBJ_set_ctype,65L\n\n#define SN_setct_CapRevReqTBEX \"setct-CapRevReqTBEX\"\n#define NID_setct_CapRevReqTBEX 584\n#define OBJ_setct_CapRevReqTBEX OBJ_set_ctype,66L\n\n#define SN_setct_CapRevResTBE \"setct-CapRevResTBE\"\n#define NID_setct_CapRevResTBE 585\n#define OBJ_setct_CapRevResTBE OBJ_set_ctype,67L\n\n#define SN_setct_CredReqTBE \"setct-CredReqTBE\"\n#define NID_setct_CredReqTBE 586\n#define OBJ_setct_CredReqTBE OBJ_set_ctype,68L\n\n#define SN_setct_CredReqTBEX \"setct-CredReqTBEX\"\n#define NID_setct_CredReqTBEX 587\n#define OBJ_setct_CredReqTBEX OBJ_set_ctype,69L\n\n#define SN_setct_CredResTBE \"setct-CredResTBE\"\n#define NID_setct_CredResTBE 588\n#define OBJ_setct_CredResTBE OBJ_set_ctype,70L\n\n#define SN_setct_CredRevReqTBE \"setct-CredRevReqTBE\"\n#define NID_setct_CredRevReqTBE 589\n#define OBJ_setct_CredRevReqTBE OBJ_set_ctype,71L\n\n#define SN_setct_CredRevReqTBEX \"setct-CredRevReqTBEX\"\n#define NID_setct_CredRevReqTBEX 590\n#define OBJ_setct_CredRevReqTBEX OBJ_set_ctype,72L\n\n#define SN_setct_CredRevResTBE \"setct-CredRevResTBE\"\n#define NID_setct_CredRevResTBE 591\n#define OBJ_setct_CredRevResTBE OBJ_set_ctype,73L\n\n#define SN_setct_BatchAdminReqTBE \"setct-BatchAdminReqTBE\"\n#define NID_setct_BatchAdminReqTBE 592\n#define OBJ_setct_BatchAdminReqTBE OBJ_set_ctype,74L\n\n#define SN_setct_BatchAdminResTBE \"setct-BatchAdminResTBE\"\n#define NID_setct_BatchAdminResTBE 593\n#define OBJ_setct_BatchAdminResTBE OBJ_set_ctype,75L\n\n#define SN_setct_RegFormReqTBE \"setct-RegFormReqTBE\"\n#define NID_setct_RegFormReqTBE 594\n#define OBJ_setct_RegFormReqTBE OBJ_set_ctype,76L\n\n#define SN_setct_CertReqTBE \"setct-CertReqTBE\"\n#define NID_setct_CertReqTBE 595\n#define OBJ_setct_CertReqTBE OBJ_set_ctype,77L\n\n#define SN_setct_CertReqTBEX \"setct-CertReqTBEX\"\n#define NID_setct_CertReqTBEX 596\n#define OBJ_setct_CertReqTBEX OBJ_set_ctype,78L\n\n#define SN_setct_CertResTBE \"setct-CertResTBE\"\n#define NID_setct_CertResTBE 597\n#define OBJ_setct_CertResTBE OBJ_set_ctype,79L\n\n#define SN_setct_CRLNotificationTBS \"setct-CRLNotificationTBS\"\n#define NID_setct_CRLNotificationTBS 598\n#define OBJ_setct_CRLNotificationTBS OBJ_set_ctype,80L\n\n#define SN_setct_CRLNotificationResTBS \"setct-CRLNotificationResTBS\"\n#define NID_setct_CRLNotificationResTBS 599\n#define OBJ_setct_CRLNotificationResTBS OBJ_set_ctype,81L\n\n#define SN_setct_BCIDistributionTBS \"setct-BCIDistributionTBS\"\n#define NID_setct_BCIDistributionTBS 600\n#define OBJ_setct_BCIDistributionTBS OBJ_set_ctype,82L\n\n#define SN_setext_genCrypt \"setext-genCrypt\"\n#define LN_setext_genCrypt \"generic cryptogram\"\n#define NID_setext_genCrypt 601\n#define OBJ_setext_genCrypt OBJ_set_msgExt,1L\n\n#define SN_setext_miAuth \"setext-miAuth\"\n#define LN_setext_miAuth \"merchant initiated auth\"\n#define NID_setext_miAuth 602\n#define OBJ_setext_miAuth OBJ_set_msgExt,3L\n\n#define SN_setext_pinSecure \"setext-pinSecure\"\n#define NID_setext_pinSecure 603\n#define OBJ_setext_pinSecure OBJ_set_msgExt,4L\n\n#define SN_setext_pinAny \"setext-pinAny\"\n#define NID_setext_pinAny 604\n#define OBJ_setext_pinAny OBJ_set_msgExt,5L\n\n#define SN_setext_track2 \"setext-track2\"\n#define NID_setext_track2 605\n#define OBJ_setext_track2 OBJ_set_msgExt,7L\n\n#define SN_setext_cv \"setext-cv\"\n#define LN_setext_cv \"additional verification\"\n#define NID_setext_cv 606\n#define OBJ_setext_cv OBJ_set_msgExt,8L\n\n#define SN_set_policy_root \"set-policy-root\"\n#define NID_set_policy_root 607\n#define OBJ_set_policy_root OBJ_set_policy,0L\n\n#define SN_setCext_hashedRoot \"setCext-hashedRoot\"\n#define NID_setCext_hashedRoot 608\n#define OBJ_setCext_hashedRoot OBJ_set_certExt,0L\n\n#define SN_setCext_certType \"setCext-certType\"\n#define NID_setCext_certType 609\n#define OBJ_setCext_certType OBJ_set_certExt,1L\n\n#define SN_setCext_merchData \"setCext-merchData\"\n#define NID_setCext_merchData 610\n#define OBJ_setCext_merchData OBJ_set_certExt,2L\n\n#define SN_setCext_cCertRequired \"setCext-cCertRequired\"\n#define NID_setCext_cCertRequired 611\n#define OBJ_setCext_cCertRequired OBJ_set_certExt,3L\n\n#define SN_setCext_tunneling \"setCext-tunneling\"\n#define NID_setCext_tunneling 612\n#define OBJ_setCext_tunneling OBJ_set_certExt,4L\n\n#define SN_setCext_setExt \"setCext-setExt\"\n#define NID_setCext_setExt 613\n#define OBJ_setCext_setExt OBJ_set_certExt,5L\n\n#define SN_setCext_setQualf \"setCext-setQualf\"\n#define NID_setCext_setQualf 614\n#define OBJ_setCext_setQualf OBJ_set_certExt,6L\n\n#define SN_setCext_PGWYcapabilities \"setCext-PGWYcapabilities\"\n#define NID_setCext_PGWYcapabilities 615\n#define OBJ_setCext_PGWYcapabilities OBJ_set_certExt,7L\n\n#define SN_setCext_TokenIdentifier \"setCext-TokenIdentifier\"\n#define NID_setCext_TokenIdentifier 616\n#define OBJ_setCext_TokenIdentifier OBJ_set_certExt,8L\n\n#define SN_setCext_Track2Data \"setCext-Track2Data\"\n#define NID_setCext_Track2Data 617\n#define OBJ_setCext_Track2Data OBJ_set_certExt,9L\n\n#define SN_setCext_TokenType \"setCext-TokenType\"\n#define NID_setCext_TokenType 618\n#define OBJ_setCext_TokenType OBJ_set_certExt,10L\n\n#define SN_setCext_IssuerCapabilities \"setCext-IssuerCapabilities\"\n#define NID_setCext_IssuerCapabilities 619\n#define OBJ_setCext_IssuerCapabilities OBJ_set_certExt,11L\n\n#define SN_setAttr_Cert \"setAttr-Cert\"\n#define NID_setAttr_Cert 620\n#define OBJ_setAttr_Cert OBJ_set_attr,0L\n\n#define SN_setAttr_PGWYcap \"setAttr-PGWYcap\"\n#define LN_setAttr_PGWYcap \"payment gateway capabilities\"\n#define NID_setAttr_PGWYcap 621\n#define OBJ_setAttr_PGWYcap OBJ_set_attr,1L\n\n#define SN_setAttr_TokenType \"setAttr-TokenType\"\n#define NID_setAttr_TokenType 622\n#define OBJ_setAttr_TokenType OBJ_set_attr,2L\n\n#define SN_setAttr_IssCap \"setAttr-IssCap\"\n#define LN_setAttr_IssCap \"issuer capabilities\"\n#define NID_setAttr_IssCap 623\n#define OBJ_setAttr_IssCap OBJ_set_attr,3L\n\n#define SN_set_rootKeyThumb \"set-rootKeyThumb\"\n#define NID_set_rootKeyThumb 624\n#define OBJ_set_rootKeyThumb OBJ_setAttr_Cert,0L\n\n#define SN_set_addPolicy \"set-addPolicy\"\n#define NID_set_addPolicy 625\n#define OBJ_set_addPolicy OBJ_setAttr_Cert,1L\n\n#define SN_setAttr_Token_EMV \"setAttr-Token-EMV\"\n#define NID_setAttr_Token_EMV 626\n#define OBJ_setAttr_Token_EMV OBJ_setAttr_TokenType,1L\n\n#define SN_setAttr_Token_B0Prime \"setAttr-Token-B0Prime\"\n#define NID_setAttr_Token_B0Prime 627\n#define OBJ_setAttr_Token_B0Prime OBJ_setAttr_TokenType,2L\n\n#define SN_setAttr_IssCap_CVM \"setAttr-IssCap-CVM\"\n#define NID_setAttr_IssCap_CVM 628\n#define OBJ_setAttr_IssCap_CVM OBJ_setAttr_IssCap,3L\n\n#define SN_setAttr_IssCap_T2 \"setAttr-IssCap-T2\"\n#define NID_setAttr_IssCap_T2 629\n#define OBJ_setAttr_IssCap_T2 OBJ_setAttr_IssCap,4L\n\n#define SN_setAttr_IssCap_Sig \"setAttr-IssCap-Sig\"\n#define NID_setAttr_IssCap_Sig 630\n#define OBJ_setAttr_IssCap_Sig OBJ_setAttr_IssCap,5L\n\n#define SN_setAttr_GenCryptgrm \"setAttr-GenCryptgrm\"\n#define LN_setAttr_GenCryptgrm \"generate cryptogram\"\n#define NID_setAttr_GenCryptgrm 631\n#define OBJ_setAttr_GenCryptgrm OBJ_setAttr_IssCap_CVM,1L\n\n#define SN_setAttr_T2Enc \"setAttr-T2Enc\"\n#define LN_setAttr_T2Enc \"encrypted track 2\"\n#define NID_setAttr_T2Enc 632\n#define OBJ_setAttr_T2Enc OBJ_setAttr_IssCap_T2,1L\n\n#define SN_setAttr_T2cleartxt \"setAttr-T2cleartxt\"\n#define LN_setAttr_T2cleartxt \"cleartext track 2\"\n#define NID_setAttr_T2cleartxt 633\n#define OBJ_setAttr_T2cleartxt OBJ_setAttr_IssCap_T2,2L\n\n#define SN_setAttr_TokICCsig \"setAttr-TokICCsig\"\n#define LN_setAttr_TokICCsig \"ICC or token signature\"\n#define NID_setAttr_TokICCsig 634\n#define OBJ_setAttr_TokICCsig OBJ_setAttr_IssCap_Sig,1L\n\n#define SN_setAttr_SecDevSig \"setAttr-SecDevSig\"\n#define LN_setAttr_SecDevSig \"secure device signature\"\n#define NID_setAttr_SecDevSig 635\n#define OBJ_setAttr_SecDevSig OBJ_setAttr_IssCap_Sig,2L\n\n#define SN_set_brand_IATA_ATA \"set-brand-IATA-ATA\"\n#define NID_set_brand_IATA_ATA 636\n#define OBJ_set_brand_IATA_ATA OBJ_set_brand,1L\n\n#define SN_set_brand_Diners \"set-brand-Diners\"\n#define NID_set_brand_Diners 637\n#define OBJ_set_brand_Diners OBJ_set_brand,30L\n\n#define SN_set_brand_AmericanExpress \"set-brand-AmericanExpress\"\n#define NID_set_brand_AmericanExpress 638\n#define OBJ_set_brand_AmericanExpress OBJ_set_brand,34L\n\n#define SN_set_brand_JCB \"set-brand-JCB\"\n#define NID_set_brand_JCB 639\n#define OBJ_set_brand_JCB OBJ_set_brand,35L\n\n#define SN_set_brand_Visa \"set-brand-Visa\"\n#define NID_set_brand_Visa 640\n#define OBJ_set_brand_Visa OBJ_set_brand,4L\n\n#define SN_set_brand_MasterCard \"set-brand-MasterCard\"\n#define NID_set_brand_MasterCard 641\n#define OBJ_set_brand_MasterCard OBJ_set_brand,5L\n\n#define SN_set_brand_Novus \"set-brand-Novus\"\n#define NID_set_brand_Novus 642\n#define OBJ_set_brand_Novus OBJ_set_brand,6011L\n\n#define SN_des_cdmf \"DES-CDMF\"\n#define LN_des_cdmf \"des-cdmf\"\n#define NID_des_cdmf 643\n#define OBJ_des_cdmf OBJ_rsadsi,3L,10L\n\n#define SN_rsaOAEPEncryptionSET \"rsaOAEPEncryptionSET\"\n#define NID_rsaOAEPEncryptionSET 644\n#define OBJ_rsaOAEPEncryptionSET OBJ_rsadsi,1L,1L,6L\n\n#define SN_ipsec3 \"Oakley-EC2N-3\"\n#define LN_ipsec3 \"ipsec3\"\n#define NID_ipsec3 749\n\n#define SN_ipsec4 \"Oakley-EC2N-4\"\n#define LN_ipsec4 \"ipsec4\"\n#define NID_ipsec4 750\n\n#define SN_whirlpool \"whirlpool\"\n#define NID_whirlpool 804\n#define OBJ_whirlpool OBJ_iso,0L,10118L,3L,0L,55L\n\n#define SN_cryptopro \"cryptopro\"\n#define NID_cryptopro 805\n#define OBJ_cryptopro OBJ_member_body,643L,2L,2L\n\n#define SN_cryptocom \"cryptocom\"\n#define NID_cryptocom 806\n#define OBJ_cryptocom OBJ_member_body,643L,2L,9L\n\n#define SN_id_tc26 \"id-tc26\"\n#define NID_id_tc26 974\n#define OBJ_id_tc26 OBJ_member_body,643L,7L,1L\n\n#define SN_id_GostR3411_94_with_GostR3410_2001 \"id-GostR3411-94-with-GostR3410-2001\"\n#define LN_id_GostR3411_94_with_GostR3410_2001 \"GOST R 34.11-94 with GOST R 34.10-2001\"\n#define NID_id_GostR3411_94_with_GostR3410_2001 807\n#define OBJ_id_GostR3411_94_with_GostR3410_2001 OBJ_cryptopro,3L\n\n#define SN_id_GostR3411_94_with_GostR3410_94 \"id-GostR3411-94-with-GostR3410-94\"\n#define LN_id_GostR3411_94_with_GostR3410_94 \"GOST R 34.11-94 with GOST R 34.10-94\"\n#define NID_id_GostR3411_94_with_GostR3410_94 808\n#define OBJ_id_GostR3411_94_with_GostR3410_94 OBJ_cryptopro,4L\n\n#define SN_id_GostR3411_94 \"md_gost94\"\n#define LN_id_GostR3411_94 \"GOST R 34.11-94\"\n#define NID_id_GostR3411_94 809\n#define OBJ_id_GostR3411_94 OBJ_cryptopro,9L\n\n#define SN_id_HMACGostR3411_94 \"id-HMACGostR3411-94\"\n#define LN_id_HMACGostR3411_94 \"HMAC GOST 34.11-94\"\n#define NID_id_HMACGostR3411_94 810\n#define OBJ_id_HMACGostR3411_94 OBJ_cryptopro,10L\n\n#define SN_id_GostR3410_2001 \"gost2001\"\n#define LN_id_GostR3410_2001 \"GOST R 34.10-2001\"\n#define NID_id_GostR3410_2001 811\n#define OBJ_id_GostR3410_2001 OBJ_cryptopro,19L\n\n#define SN_id_GostR3410_94 \"gost94\"\n#define LN_id_GostR3410_94 \"GOST R 34.10-94\"\n#define NID_id_GostR3410_94 812\n#define OBJ_id_GostR3410_94 OBJ_cryptopro,20L\n\n#define SN_id_Gost28147_89 \"gost89\"\n#define LN_id_Gost28147_89 \"GOST 28147-89\"\n#define NID_id_Gost28147_89 813\n#define OBJ_id_Gost28147_89 OBJ_cryptopro,21L\n\n#define SN_gost89_cnt \"gost89-cnt\"\n#define NID_gost89_cnt 814\n\n#define SN_gost89_cnt_12 \"gost89-cnt-12\"\n#define NID_gost89_cnt_12 975\n\n#define SN_gost89_cbc \"gost89-cbc\"\n#define NID_gost89_cbc 1009\n\n#define SN_gost89_ecb \"gost89-ecb\"\n#define NID_gost89_ecb 1010\n\n#define SN_gost89_ctr \"gost89-ctr\"\n#define NID_gost89_ctr 1011\n\n#define SN_id_Gost28147_89_MAC \"gost-mac\"\n#define LN_id_Gost28147_89_MAC \"GOST 28147-89 MAC\"\n#define NID_id_Gost28147_89_MAC 815\n#define OBJ_id_Gost28147_89_MAC OBJ_cryptopro,22L\n\n#define SN_gost_mac_12 \"gost-mac-12\"\n#define NID_gost_mac_12 976\n\n#define SN_id_GostR3411_94_prf \"prf-gostr3411-94\"\n#define LN_id_GostR3411_94_prf \"GOST R 34.11-94 PRF\"\n#define NID_id_GostR3411_94_prf 816\n#define OBJ_id_GostR3411_94_prf OBJ_cryptopro,23L\n\n#define SN_id_GostR3410_2001DH \"id-GostR3410-2001DH\"\n#define LN_id_GostR3410_2001DH \"GOST R 34.10-2001 DH\"\n#define NID_id_GostR3410_2001DH 817\n#define OBJ_id_GostR3410_2001DH OBJ_cryptopro,98L\n\n#define SN_id_GostR3410_94DH \"id-GostR3410-94DH\"\n#define LN_id_GostR3410_94DH \"GOST R 34.10-94 DH\"\n#define NID_id_GostR3410_94DH 818\n#define OBJ_id_GostR3410_94DH OBJ_cryptopro,99L\n\n#define SN_id_Gost28147_89_CryptoPro_KeyMeshing \"id-Gost28147-89-CryptoPro-KeyMeshing\"\n#define NID_id_Gost28147_89_CryptoPro_KeyMeshing 819\n#define OBJ_id_Gost28147_89_CryptoPro_KeyMeshing OBJ_cryptopro,14L,1L\n\n#define SN_id_Gost28147_89_None_KeyMeshing \"id-Gost28147-89-None-KeyMeshing\"\n#define NID_id_Gost28147_89_None_KeyMeshing 820\n#define OBJ_id_Gost28147_89_None_KeyMeshing OBJ_cryptopro,14L,0L\n\n#define SN_id_GostR3411_94_TestParamSet \"id-GostR3411-94-TestParamSet\"\n#define NID_id_GostR3411_94_TestParamSet 821\n#define OBJ_id_GostR3411_94_TestParamSet OBJ_cryptopro,30L,0L\n\n#define SN_id_GostR3411_94_CryptoProParamSet \"id-GostR3411-94-CryptoProParamSet\"\n#define NID_id_GostR3411_94_CryptoProParamSet 822\n#define OBJ_id_GostR3411_94_CryptoProParamSet OBJ_cryptopro,30L,1L\n\n#define SN_id_Gost28147_89_TestParamSet \"id-Gost28147-89-TestParamSet\"\n#define NID_id_Gost28147_89_TestParamSet 823\n#define OBJ_id_Gost28147_89_TestParamSet OBJ_cryptopro,31L,0L\n\n#define SN_id_Gost28147_89_CryptoPro_A_ParamSet \"id-Gost28147-89-CryptoPro-A-ParamSet\"\n#define NID_id_Gost28147_89_CryptoPro_A_ParamSet 824\n#define OBJ_id_Gost28147_89_CryptoPro_A_ParamSet OBJ_cryptopro,31L,1L\n\n#define SN_id_Gost28147_89_CryptoPro_B_ParamSet \"id-Gost28147-89-CryptoPro-B-ParamSet\"\n#define NID_id_Gost28147_89_CryptoPro_B_ParamSet 825\n#define OBJ_id_Gost28147_89_CryptoPro_B_ParamSet OBJ_cryptopro,31L,2L\n\n#define SN_id_Gost28147_89_CryptoPro_C_ParamSet \"id-Gost28147-89-CryptoPro-C-ParamSet\"\n#define NID_id_Gost28147_89_CryptoPro_C_ParamSet 826\n#define OBJ_id_Gost28147_89_CryptoPro_C_ParamSet OBJ_cryptopro,31L,3L\n\n#define SN_id_Gost28147_89_CryptoPro_D_ParamSet \"id-Gost28147-89-CryptoPro-D-ParamSet\"\n#define NID_id_Gost28147_89_CryptoPro_D_ParamSet 827\n#define OBJ_id_Gost28147_89_CryptoPro_D_ParamSet OBJ_cryptopro,31L,4L\n\n#define SN_id_Gost28147_89_CryptoPro_Oscar_1_1_ParamSet \"id-Gost28147-89-CryptoPro-Oscar-1-1-ParamSet\"\n#define NID_id_Gost28147_89_CryptoPro_Oscar_1_1_ParamSet 828\n#define OBJ_id_Gost28147_89_CryptoPro_Oscar_1_1_ParamSet OBJ_cryptopro,31L,5L\n\n#define SN_id_Gost28147_89_CryptoPro_Oscar_1_0_ParamSet \"id-Gost28147-89-CryptoPro-Oscar-1-0-ParamSet\"\n#define NID_id_Gost28147_89_CryptoPro_Oscar_1_0_ParamSet 829\n#define OBJ_id_Gost28147_89_CryptoPro_Oscar_1_0_ParamSet OBJ_cryptopro,31L,6L\n\n#define SN_id_Gost28147_89_CryptoPro_RIC_1_ParamSet \"id-Gost28147-89-CryptoPro-RIC-1-ParamSet\"\n#define NID_id_Gost28147_89_CryptoPro_RIC_1_ParamSet 830\n#define OBJ_id_Gost28147_89_CryptoPro_RIC_1_ParamSet OBJ_cryptopro,31L,7L\n\n#define SN_id_GostR3410_94_TestParamSet \"id-GostR3410-94-TestParamSet\"\n#define NID_id_GostR3410_94_TestParamSet 831\n#define OBJ_id_GostR3410_94_TestParamSet OBJ_cryptopro,32L,0L\n\n#define SN_id_GostR3410_94_CryptoPro_A_ParamSet \"id-GostR3410-94-CryptoPro-A-ParamSet\"\n#define NID_id_GostR3410_94_CryptoPro_A_ParamSet 832\n#define OBJ_id_GostR3410_94_CryptoPro_A_ParamSet OBJ_cryptopro,32L,2L\n\n#define SN_id_GostR3410_94_CryptoPro_B_ParamSet \"id-GostR3410-94-CryptoPro-B-ParamSet\"\n#define NID_id_GostR3410_94_CryptoPro_B_ParamSet 833\n#define OBJ_id_GostR3410_94_CryptoPro_B_ParamSet OBJ_cryptopro,32L,3L\n\n#define SN_id_GostR3410_94_CryptoPro_C_ParamSet \"id-GostR3410-94-CryptoPro-C-ParamSet\"\n#define NID_id_GostR3410_94_CryptoPro_C_ParamSet 834\n#define OBJ_id_GostR3410_94_CryptoPro_C_ParamSet OBJ_cryptopro,32L,4L\n\n#define SN_id_GostR3410_94_CryptoPro_D_ParamSet \"id-GostR3410-94-CryptoPro-D-ParamSet\"\n#define NID_id_GostR3410_94_CryptoPro_D_ParamSet 835\n#define OBJ_id_GostR3410_94_CryptoPro_D_ParamSet OBJ_cryptopro,32L,5L\n\n#define SN_id_GostR3410_94_CryptoPro_XchA_ParamSet \"id-GostR3410-94-CryptoPro-XchA-ParamSet\"\n#define NID_id_GostR3410_94_CryptoPro_XchA_ParamSet 836\n#define OBJ_id_GostR3410_94_CryptoPro_XchA_ParamSet OBJ_cryptopro,33L,1L\n\n#define SN_id_GostR3410_94_CryptoPro_XchB_ParamSet \"id-GostR3410-94-CryptoPro-XchB-ParamSet\"\n#define NID_id_GostR3410_94_CryptoPro_XchB_ParamSet 837\n#define OBJ_id_GostR3410_94_CryptoPro_XchB_ParamSet OBJ_cryptopro,33L,2L\n\n#define SN_id_GostR3410_94_CryptoPro_XchC_ParamSet \"id-GostR3410-94-CryptoPro-XchC-ParamSet\"\n#define NID_id_GostR3410_94_CryptoPro_XchC_ParamSet 838\n#define OBJ_id_GostR3410_94_CryptoPro_XchC_ParamSet OBJ_cryptopro,33L,3L\n\n#define SN_id_GostR3410_2001_TestParamSet \"id-GostR3410-2001-TestParamSet\"\n#define NID_id_GostR3410_2001_TestParamSet 839\n#define OBJ_id_GostR3410_2001_TestParamSet OBJ_cryptopro,35L,0L\n\n#define SN_id_GostR3410_2001_CryptoPro_A_ParamSet \"id-GostR3410-2001-CryptoPro-A-ParamSet\"\n#define NID_id_GostR3410_2001_CryptoPro_A_ParamSet 840\n#define OBJ_id_GostR3410_2001_CryptoPro_A_ParamSet OBJ_cryptopro,35L,1L\n\n#define SN_id_GostR3410_2001_CryptoPro_B_ParamSet \"id-GostR3410-2001-CryptoPro-B-ParamSet\"\n#define NID_id_GostR3410_2001_CryptoPro_B_ParamSet 841\n#define OBJ_id_GostR3410_2001_CryptoPro_B_ParamSet OBJ_cryptopro,35L,2L\n\n#define SN_id_GostR3410_2001_CryptoPro_C_ParamSet \"id-GostR3410-2001-CryptoPro-C-ParamSet\"\n#define NID_id_GostR3410_2001_CryptoPro_C_ParamSet 842\n#define OBJ_id_GostR3410_2001_CryptoPro_C_ParamSet OBJ_cryptopro,35L,3L\n\n#define SN_id_GostR3410_2001_CryptoPro_XchA_ParamSet \"id-GostR3410-2001-CryptoPro-XchA-ParamSet\"\n#define NID_id_GostR3410_2001_CryptoPro_XchA_ParamSet 843\n#define OBJ_id_GostR3410_2001_CryptoPro_XchA_ParamSet OBJ_cryptopro,36L,0L\n\n#define SN_id_GostR3410_2001_CryptoPro_XchB_ParamSet \"id-GostR3410-2001-CryptoPro-XchB-ParamSet\"\n#define NID_id_GostR3410_2001_CryptoPro_XchB_ParamSet 844\n#define OBJ_id_GostR3410_2001_CryptoPro_XchB_ParamSet OBJ_cryptopro,36L,1L\n\n#define SN_id_GostR3410_94_a \"id-GostR3410-94-a\"\n#define NID_id_GostR3410_94_a 845\n#define OBJ_id_GostR3410_94_a OBJ_id_GostR3410_94,1L\n\n#define SN_id_GostR3410_94_aBis \"id-GostR3410-94-aBis\"\n#define NID_id_GostR3410_94_aBis 846\n#define OBJ_id_GostR3410_94_aBis OBJ_id_GostR3410_94,2L\n\n#define SN_id_GostR3410_94_b \"id-GostR3410-94-b\"\n#define NID_id_GostR3410_94_b 847\n#define OBJ_id_GostR3410_94_b OBJ_id_GostR3410_94,3L\n\n#define SN_id_GostR3410_94_bBis \"id-GostR3410-94-bBis\"\n#define NID_id_GostR3410_94_bBis 848\n#define OBJ_id_GostR3410_94_bBis OBJ_id_GostR3410_94,4L\n\n#define SN_id_Gost28147_89_cc \"id-Gost28147-89-cc\"\n#define LN_id_Gost28147_89_cc \"GOST 28147-89 Cryptocom ParamSet\"\n#define NID_id_Gost28147_89_cc 849\n#define OBJ_id_Gost28147_89_cc OBJ_cryptocom,1L,6L,1L\n\n#define SN_id_GostR3410_94_cc \"gost94cc\"\n#define LN_id_GostR3410_94_cc \"GOST 34.10-94 Cryptocom\"\n#define NID_id_GostR3410_94_cc 850\n#define OBJ_id_GostR3410_94_cc OBJ_cryptocom,1L,5L,3L\n\n#define SN_id_GostR3410_2001_cc \"gost2001cc\"\n#define LN_id_GostR3410_2001_cc \"GOST 34.10-2001 Cryptocom\"\n#define NID_id_GostR3410_2001_cc 851\n#define OBJ_id_GostR3410_2001_cc OBJ_cryptocom,1L,5L,4L\n\n#define SN_id_GostR3411_94_with_GostR3410_94_cc \"id-GostR3411-94-with-GostR3410-94-cc\"\n#define LN_id_GostR3411_94_with_GostR3410_94_cc \"GOST R 34.11-94 with GOST R 34.10-94 Cryptocom\"\n#define NID_id_GostR3411_94_with_GostR3410_94_cc 852\n#define OBJ_id_GostR3411_94_with_GostR3410_94_cc OBJ_cryptocom,1L,3L,3L\n\n#define SN_id_GostR3411_94_with_GostR3410_2001_cc \"id-GostR3411-94-with-GostR3410-2001-cc\"\n#define LN_id_GostR3411_94_with_GostR3410_2001_cc \"GOST R 34.11-94 with GOST R 34.10-2001 Cryptocom\"\n#define NID_id_GostR3411_94_with_GostR3410_2001_cc 853\n#define OBJ_id_GostR3411_94_with_GostR3410_2001_cc OBJ_cryptocom,1L,3L,4L\n\n#define SN_id_GostR3410_2001_ParamSet_cc \"id-GostR3410-2001-ParamSet-cc\"\n#define LN_id_GostR3410_2001_ParamSet_cc \"GOST R 3410-2001 Parameter Set Cryptocom\"\n#define NID_id_GostR3410_2001_ParamSet_cc 854\n#define OBJ_id_GostR3410_2001_ParamSet_cc OBJ_cryptocom,1L,8L,1L\n\n#define SN_id_tc26_algorithms \"id-tc26-algorithms\"\n#define NID_id_tc26_algorithms 977\n#define OBJ_id_tc26_algorithms OBJ_id_tc26,1L\n\n#define SN_id_tc26_sign \"id-tc26-sign\"\n#define NID_id_tc26_sign 978\n#define OBJ_id_tc26_sign OBJ_id_tc26_algorithms,1L\n\n#define SN_id_GostR3410_2012_256 \"gost2012_256\"\n#define LN_id_GostR3410_2012_256 \"GOST R 34.10-2012 with 256 bit modulus\"\n#define NID_id_GostR3410_2012_256 979\n#define OBJ_id_GostR3410_2012_256 OBJ_id_tc26_sign,1L\n\n#define SN_id_GostR3410_2012_512 \"gost2012_512\"\n#define LN_id_GostR3410_2012_512 \"GOST R 34.10-2012 with 512 bit modulus\"\n#define NID_id_GostR3410_2012_512 980\n#define OBJ_id_GostR3410_2012_512 OBJ_id_tc26_sign,2L\n\n#define SN_id_tc26_digest \"id-tc26-digest\"\n#define NID_id_tc26_digest 981\n#define OBJ_id_tc26_digest OBJ_id_tc26_algorithms,2L\n\n#define SN_id_GostR3411_2012_256 \"md_gost12_256\"\n#define LN_id_GostR3411_2012_256 \"GOST R 34.11-2012 with 256 bit hash\"\n#define NID_id_GostR3411_2012_256 982\n#define OBJ_id_GostR3411_2012_256 OBJ_id_tc26_digest,2L\n\n#define SN_id_GostR3411_2012_512 \"md_gost12_512\"\n#define LN_id_GostR3411_2012_512 \"GOST R 34.11-2012 with 512 bit hash\"\n#define NID_id_GostR3411_2012_512 983\n#define OBJ_id_GostR3411_2012_512 OBJ_id_tc26_digest,3L\n\n#define SN_id_tc26_signwithdigest \"id-tc26-signwithdigest\"\n#define NID_id_tc26_signwithdigest 984\n#define OBJ_id_tc26_signwithdigest OBJ_id_tc26_algorithms,3L\n\n#define SN_id_tc26_signwithdigest_gost3410_2012_256 \"id-tc26-signwithdigest-gost3410-2012-256\"\n#define LN_id_tc26_signwithdigest_gost3410_2012_256 \"GOST R 34.10-2012 with GOST R 34.11-2012 (256 bit)\"\n#define NID_id_tc26_signwithdigest_gost3410_2012_256 985\n#define OBJ_id_tc26_signwithdigest_gost3410_2012_256 OBJ_id_tc26_signwithdigest,2L\n\n#define SN_id_tc26_signwithdigest_gost3410_2012_512 \"id-tc26-signwithdigest-gost3410-2012-512\"\n#define LN_id_tc26_signwithdigest_gost3410_2012_512 \"GOST R 34.10-2012 with GOST R 34.11-2012 (512 bit)\"\n#define NID_id_tc26_signwithdigest_gost3410_2012_512 986\n#define OBJ_id_tc26_signwithdigest_gost3410_2012_512 OBJ_id_tc26_signwithdigest,3L\n\n#define SN_id_tc26_mac \"id-tc26-mac\"\n#define NID_id_tc26_mac 987\n#define OBJ_id_tc26_mac OBJ_id_tc26_algorithms,4L\n\n#define SN_id_tc26_hmac_gost_3411_2012_256 \"id-tc26-hmac-gost-3411-2012-256\"\n#define LN_id_tc26_hmac_gost_3411_2012_256 \"HMAC GOST 34.11-2012 256 bit\"\n#define NID_id_tc26_hmac_gost_3411_2012_256 988\n#define OBJ_id_tc26_hmac_gost_3411_2012_256 OBJ_id_tc26_mac,1L\n\n#define SN_id_tc26_hmac_gost_3411_2012_512 \"id-tc26-hmac-gost-3411-2012-512\"\n#define LN_id_tc26_hmac_gost_3411_2012_512 \"HMAC GOST 34.11-2012 512 bit\"\n#define NID_id_tc26_hmac_gost_3411_2012_512 989\n#define OBJ_id_tc26_hmac_gost_3411_2012_512 OBJ_id_tc26_mac,2L\n\n#define SN_id_tc26_cipher \"id-tc26-cipher\"\n#define NID_id_tc26_cipher 990\n#define OBJ_id_tc26_cipher OBJ_id_tc26_algorithms,5L\n\n#define SN_id_tc26_cipher_gostr3412_2015_magma \"id-tc26-cipher-gostr3412-2015-magma\"\n#define NID_id_tc26_cipher_gostr3412_2015_magma 1173\n#define OBJ_id_tc26_cipher_gostr3412_2015_magma OBJ_id_tc26_cipher,1L\n\n#define SN_id_tc26_cipher_gostr3412_2015_magma_ctracpkm \"id-tc26-cipher-gostr3412-2015-magma-ctracpkm\"\n#define NID_id_tc26_cipher_gostr3412_2015_magma_ctracpkm 1174\n#define OBJ_id_tc26_cipher_gostr3412_2015_magma_ctracpkm OBJ_id_tc26_cipher_gostr3412_2015_magma,1L\n\n#define SN_id_tc26_cipher_gostr3412_2015_magma_ctracpkm_omac \"id-tc26-cipher-gostr3412-2015-magma-ctracpkm-omac\"\n#define NID_id_tc26_cipher_gostr3412_2015_magma_ctracpkm_omac 1175\n#define OBJ_id_tc26_cipher_gostr3412_2015_magma_ctracpkm_omac OBJ_id_tc26_cipher_gostr3412_2015_magma,2L\n\n#define SN_id_tc26_cipher_gostr3412_2015_kuznyechik \"id-tc26-cipher-gostr3412-2015-kuznyechik\"\n#define NID_id_tc26_cipher_gostr3412_2015_kuznyechik 1176\n#define OBJ_id_tc26_cipher_gostr3412_2015_kuznyechik OBJ_id_tc26_cipher,2L\n\n#define SN_id_tc26_cipher_gostr3412_2015_kuznyechik_ctracpkm \"id-tc26-cipher-gostr3412-2015-kuznyechik-ctracpkm\"\n#define NID_id_tc26_cipher_gostr3412_2015_kuznyechik_ctracpkm 1177\n#define OBJ_id_tc26_cipher_gostr3412_2015_kuznyechik_ctracpkm OBJ_id_tc26_cipher_gostr3412_2015_kuznyechik,1L\n\n#define SN_id_tc26_cipher_gostr3412_2015_kuznyechik_ctracpkm_omac \"id-tc26-cipher-gostr3412-2015-kuznyechik-ctracpkm-omac\"\n#define NID_id_tc26_cipher_gostr3412_2015_kuznyechik_ctracpkm_omac 1178\n#define OBJ_id_tc26_cipher_gostr3412_2015_kuznyechik_ctracpkm_omac OBJ_id_tc26_cipher_gostr3412_2015_kuznyechik,2L\n\n#define SN_id_tc26_agreement \"id-tc26-agreement\"\n#define NID_id_tc26_agreement 991\n#define OBJ_id_tc26_agreement OBJ_id_tc26_algorithms,6L\n\n#define SN_id_tc26_agreement_gost_3410_2012_256 \"id-tc26-agreement-gost-3410-2012-256\"\n#define NID_id_tc26_agreement_gost_3410_2012_256 992\n#define OBJ_id_tc26_agreement_gost_3410_2012_256 OBJ_id_tc26_agreement,1L\n\n#define SN_id_tc26_agreement_gost_3410_2012_512 \"id-tc26-agreement-gost-3410-2012-512\"\n#define NID_id_tc26_agreement_gost_3410_2012_512 993\n#define OBJ_id_tc26_agreement_gost_3410_2012_512 OBJ_id_tc26_agreement,2L\n\n#define SN_id_tc26_wrap \"id-tc26-wrap\"\n#define NID_id_tc26_wrap 1179\n#define OBJ_id_tc26_wrap OBJ_id_tc26_algorithms,7L\n\n#define SN_id_tc26_wrap_gostr3412_2015_magma \"id-tc26-wrap-gostr3412-2015-magma\"\n#define NID_id_tc26_wrap_gostr3412_2015_magma 1180\n#define OBJ_id_tc26_wrap_gostr3412_2015_magma OBJ_id_tc26_wrap,1L\n\n#define SN_id_tc26_wrap_gostr3412_2015_magma_kexp15 \"id-tc26-wrap-gostr3412-2015-magma-kexp15\"\n#define NID_id_tc26_wrap_gostr3412_2015_magma_kexp15 1181\n#define OBJ_id_tc26_wrap_gostr3412_2015_magma_kexp15 OBJ_id_tc26_wrap_gostr3412_2015_magma,1L\n\n#define SN_id_tc26_wrap_gostr3412_2015_kuznyechik \"id-tc26-wrap-gostr3412-2015-kuznyechik\"\n#define NID_id_tc26_wrap_gostr3412_2015_kuznyechik 1182\n#define OBJ_id_tc26_wrap_gostr3412_2015_kuznyechik OBJ_id_tc26_wrap,2L\n\n#define SN_id_tc26_wrap_gostr3412_2015_kuznyechik_kexp15 \"id-tc26-wrap-gostr3412-2015-kuznyechik-kexp15\"\n#define NID_id_tc26_wrap_gostr3412_2015_kuznyechik_kexp15 1183\n#define OBJ_id_tc26_wrap_gostr3412_2015_kuznyechik_kexp15 OBJ_id_tc26_wrap_gostr3412_2015_kuznyechik,1L\n\n#define SN_id_tc26_constants \"id-tc26-constants\"\n#define NID_id_tc26_constants 994\n#define OBJ_id_tc26_constants OBJ_id_tc26,2L\n\n#define SN_id_tc26_sign_constants \"id-tc26-sign-constants\"\n#define NID_id_tc26_sign_constants 995\n#define OBJ_id_tc26_sign_constants OBJ_id_tc26_constants,1L\n\n#define SN_id_tc26_gost_3410_2012_256_constants \"id-tc26-gost-3410-2012-256-constants\"\n#define NID_id_tc26_gost_3410_2012_256_constants 1147\n#define OBJ_id_tc26_gost_3410_2012_256_constants OBJ_id_tc26_sign_constants,1L\n\n#define SN_id_tc26_gost_3410_2012_256_paramSetA \"id-tc26-gost-3410-2012-256-paramSetA\"\n#define LN_id_tc26_gost_3410_2012_256_paramSetA \"GOST R 34.10-2012 (256 bit) ParamSet A\"\n#define NID_id_tc26_gost_3410_2012_256_paramSetA 1148\n#define OBJ_id_tc26_gost_3410_2012_256_paramSetA OBJ_id_tc26_gost_3410_2012_256_constants,1L\n\n#define SN_id_tc26_gost_3410_2012_256_paramSetB \"id-tc26-gost-3410-2012-256-paramSetB\"\n#define LN_id_tc26_gost_3410_2012_256_paramSetB \"GOST R 34.10-2012 (256 bit) ParamSet B\"\n#define NID_id_tc26_gost_3410_2012_256_paramSetB 1184\n#define OBJ_id_tc26_gost_3410_2012_256_paramSetB OBJ_id_tc26_gost_3410_2012_256_constants,2L\n\n#define SN_id_tc26_gost_3410_2012_256_paramSetC \"id-tc26-gost-3410-2012-256-paramSetC\"\n#define LN_id_tc26_gost_3410_2012_256_paramSetC \"GOST R 34.10-2012 (256 bit) ParamSet C\"\n#define NID_id_tc26_gost_3410_2012_256_paramSetC 1185\n#define OBJ_id_tc26_gost_3410_2012_256_paramSetC OBJ_id_tc26_gost_3410_2012_256_constants,3L\n\n#define SN_id_tc26_gost_3410_2012_256_paramSetD \"id-tc26-gost-3410-2012-256-paramSetD\"\n#define LN_id_tc26_gost_3410_2012_256_paramSetD \"GOST R 34.10-2012 (256 bit) ParamSet D\"\n#define NID_id_tc26_gost_3410_2012_256_paramSetD 1186\n#define OBJ_id_tc26_gost_3410_2012_256_paramSetD OBJ_id_tc26_gost_3410_2012_256_constants,4L\n\n#define SN_id_tc26_gost_3410_2012_512_constants \"id-tc26-gost-3410-2012-512-constants\"\n#define NID_id_tc26_gost_3410_2012_512_constants 996\n#define OBJ_id_tc26_gost_3410_2012_512_constants OBJ_id_tc26_sign_constants,2L\n\n#define SN_id_tc26_gost_3410_2012_512_paramSetTest \"id-tc26-gost-3410-2012-512-paramSetTest\"\n#define LN_id_tc26_gost_3410_2012_512_paramSetTest \"GOST R 34.10-2012 (512 bit) testing parameter set\"\n#define NID_id_tc26_gost_3410_2012_512_paramSetTest 997\n#define OBJ_id_tc26_gost_3410_2012_512_paramSetTest OBJ_id_tc26_gost_3410_2012_512_constants,0L\n\n#define SN_id_tc26_gost_3410_2012_512_paramSetA \"id-tc26-gost-3410-2012-512-paramSetA\"\n#define LN_id_tc26_gost_3410_2012_512_paramSetA \"GOST R 34.10-2012 (512 bit) ParamSet A\"\n#define NID_id_tc26_gost_3410_2012_512_paramSetA 998\n#define OBJ_id_tc26_gost_3410_2012_512_paramSetA OBJ_id_tc26_gost_3410_2012_512_constants,1L\n\n#define SN_id_tc26_gost_3410_2012_512_paramSetB \"id-tc26-gost-3410-2012-512-paramSetB\"\n#define LN_id_tc26_gost_3410_2012_512_paramSetB \"GOST R 34.10-2012 (512 bit) ParamSet B\"\n#define NID_id_tc26_gost_3410_2012_512_paramSetB 999\n#define OBJ_id_tc26_gost_3410_2012_512_paramSetB OBJ_id_tc26_gost_3410_2012_512_constants,2L\n\n#define SN_id_tc26_gost_3410_2012_512_paramSetC \"id-tc26-gost-3410-2012-512-paramSetC\"\n#define LN_id_tc26_gost_3410_2012_512_paramSetC \"GOST R 34.10-2012 (512 bit) ParamSet C\"\n#define NID_id_tc26_gost_3410_2012_512_paramSetC 1149\n#define OBJ_id_tc26_gost_3410_2012_512_paramSetC OBJ_id_tc26_gost_3410_2012_512_constants,3L\n\n#define SN_id_tc26_digest_constants \"id-tc26-digest-constants\"\n#define NID_id_tc26_digest_constants 1000\n#define OBJ_id_tc26_digest_constants OBJ_id_tc26_constants,2L\n\n#define SN_id_tc26_cipher_constants \"id-tc26-cipher-constants\"\n#define NID_id_tc26_cipher_constants 1001\n#define OBJ_id_tc26_cipher_constants OBJ_id_tc26_constants,5L\n\n#define SN_id_tc26_gost_28147_constants \"id-tc26-gost-28147-constants\"\n#define NID_id_tc26_gost_28147_constants 1002\n#define OBJ_id_tc26_gost_28147_constants OBJ_id_tc26_cipher_constants,1L\n\n#define SN_id_tc26_gost_28147_param_Z \"id-tc26-gost-28147-param-Z\"\n#define LN_id_tc26_gost_28147_param_Z \"GOST 28147-89 TC26 parameter set\"\n#define NID_id_tc26_gost_28147_param_Z 1003\n#define OBJ_id_tc26_gost_28147_param_Z OBJ_id_tc26_gost_28147_constants,1L\n\n#define SN_INN \"INN\"\n#define LN_INN \"INN\"\n#define NID_INN 1004\n#define OBJ_INN OBJ_member_body,643L,3L,131L,1L,1L\n\n#define SN_OGRN \"OGRN\"\n#define LN_OGRN \"OGRN\"\n#define NID_OGRN 1005\n#define OBJ_OGRN OBJ_member_body,643L,100L,1L\n\n#define SN_SNILS \"SNILS\"\n#define LN_SNILS \"SNILS\"\n#define NID_SNILS 1006\n#define OBJ_SNILS OBJ_member_body,643L,100L,3L\n\n#define SN_subjectSignTool \"subjectSignTool\"\n#define LN_subjectSignTool \"Signing Tool of Subject\"\n#define NID_subjectSignTool 1007\n#define OBJ_subjectSignTool OBJ_member_body,643L,100L,111L\n\n#define SN_issuerSignTool \"issuerSignTool\"\n#define LN_issuerSignTool \"Signing Tool of Issuer\"\n#define NID_issuerSignTool 1008\n#define OBJ_issuerSignTool OBJ_member_body,643L,100L,112L\n\n#define SN_grasshopper_ecb \"grasshopper-ecb\"\n#define NID_grasshopper_ecb 1012\n\n#define SN_grasshopper_ctr \"grasshopper-ctr\"\n#define NID_grasshopper_ctr 1013\n\n#define SN_grasshopper_ofb \"grasshopper-ofb\"\n#define NID_grasshopper_ofb 1014\n\n#define SN_grasshopper_cbc \"grasshopper-cbc\"\n#define NID_grasshopper_cbc 1015\n\n#define SN_grasshopper_cfb \"grasshopper-cfb\"\n#define NID_grasshopper_cfb 1016\n\n#define SN_grasshopper_mac \"grasshopper-mac\"\n#define NID_grasshopper_mac 1017\n\n#define SN_magma_ecb \"magma-ecb\"\n#define NID_magma_ecb 1187\n\n#define SN_magma_ctr \"magma-ctr\"\n#define NID_magma_ctr 1188\n\n#define SN_magma_ofb \"magma-ofb\"\n#define NID_magma_ofb 1189\n\n#define SN_magma_cbc \"magma-cbc\"\n#define NID_magma_cbc 1190\n\n#define SN_magma_cfb \"magma-cfb\"\n#define NID_magma_cfb 1191\n\n#define SN_magma_mac \"magma-mac\"\n#define NID_magma_mac 1192\n\n#define SN_camellia_128_cbc \"CAMELLIA-128-CBC\"\n#define LN_camellia_128_cbc \"camellia-128-cbc\"\n#define NID_camellia_128_cbc 751\n#define OBJ_camellia_128_cbc 1L,2L,392L,200011L,61L,1L,1L,1L,2L\n\n#define SN_camellia_192_cbc \"CAMELLIA-192-CBC\"\n#define LN_camellia_192_cbc \"camellia-192-cbc\"\n#define NID_camellia_192_cbc 752\n#define OBJ_camellia_192_cbc 1L,2L,392L,200011L,61L,1L,1L,1L,3L\n\n#define SN_camellia_256_cbc \"CAMELLIA-256-CBC\"\n#define LN_camellia_256_cbc \"camellia-256-cbc\"\n#define NID_camellia_256_cbc 753\n#define OBJ_camellia_256_cbc 1L,2L,392L,200011L,61L,1L,1L,1L,4L\n\n#define SN_id_camellia128_wrap \"id-camellia128-wrap\"\n#define NID_id_camellia128_wrap 907\n#define OBJ_id_camellia128_wrap 1L,2L,392L,200011L,61L,1L,1L,3L,2L\n\n#define SN_id_camellia192_wrap \"id-camellia192-wrap\"\n#define NID_id_camellia192_wrap 908\n#define OBJ_id_camellia192_wrap 1L,2L,392L,200011L,61L,1L,1L,3L,3L\n\n#define SN_id_camellia256_wrap \"id-camellia256-wrap\"\n#define NID_id_camellia256_wrap 909\n#define OBJ_id_camellia256_wrap 1L,2L,392L,200011L,61L,1L,1L,3L,4L\n\n#define OBJ_ntt_ds 0L,3L,4401L,5L\n\n#define OBJ_camellia OBJ_ntt_ds,3L,1L,9L\n\n#define SN_camellia_128_ecb \"CAMELLIA-128-ECB\"\n#define LN_camellia_128_ecb \"camellia-128-ecb\"\n#define NID_camellia_128_ecb 754\n#define OBJ_camellia_128_ecb OBJ_camellia,1L\n\n#define SN_camellia_128_ofb128 \"CAMELLIA-128-OFB\"\n#define LN_camellia_128_ofb128 \"camellia-128-ofb\"\n#define NID_camellia_128_ofb128 766\n#define OBJ_camellia_128_ofb128 OBJ_camellia,3L\n\n#define SN_camellia_128_cfb128 \"CAMELLIA-128-CFB\"\n#define LN_camellia_128_cfb128 \"camellia-128-cfb\"\n#define NID_camellia_128_cfb128 757\n#define OBJ_camellia_128_cfb128 OBJ_camellia,4L\n\n#define SN_camellia_128_gcm \"CAMELLIA-128-GCM\"\n#define LN_camellia_128_gcm \"camellia-128-gcm\"\n#define NID_camellia_128_gcm 961\n#define OBJ_camellia_128_gcm OBJ_camellia,6L\n\n#define SN_camellia_128_ccm \"CAMELLIA-128-CCM\"\n#define LN_camellia_128_ccm \"camellia-128-ccm\"\n#define NID_camellia_128_ccm 962\n#define OBJ_camellia_128_ccm OBJ_camellia,7L\n\n#define SN_camellia_128_ctr \"CAMELLIA-128-CTR\"\n#define LN_camellia_128_ctr \"camellia-128-ctr\"\n#define NID_camellia_128_ctr 963\n#define OBJ_camellia_128_ctr OBJ_camellia,9L\n\n#define SN_camellia_128_cmac \"CAMELLIA-128-CMAC\"\n#define LN_camellia_128_cmac \"camellia-128-cmac\"\n#define NID_camellia_128_cmac 964\n#define OBJ_camellia_128_cmac OBJ_camellia,10L\n\n#define SN_camellia_192_ecb \"CAMELLIA-192-ECB\"\n#define LN_camellia_192_ecb \"camellia-192-ecb\"\n#define NID_camellia_192_ecb 755\n#define OBJ_camellia_192_ecb OBJ_camellia,21L\n\n#define SN_camellia_192_ofb128 \"CAMELLIA-192-OFB\"\n#define LN_camellia_192_ofb128 \"camellia-192-ofb\"\n#define NID_camellia_192_ofb128 767\n#define OBJ_camellia_192_ofb128 OBJ_camellia,23L\n\n#define SN_camellia_192_cfb128 \"CAMELLIA-192-CFB\"\n#define LN_camellia_192_cfb128 \"camellia-192-cfb\"\n#define NID_camellia_192_cfb128 758\n#define OBJ_camellia_192_cfb128 OBJ_camellia,24L\n\n#define SN_camellia_192_gcm \"CAMELLIA-192-GCM\"\n#define LN_camellia_192_gcm \"camellia-192-gcm\"\n#define NID_camellia_192_gcm 965\n#define OBJ_camellia_192_gcm OBJ_camellia,26L\n\n#define SN_camellia_192_ccm \"CAMELLIA-192-CCM\"\n#define LN_camellia_192_ccm \"camellia-192-ccm\"\n#define NID_camellia_192_ccm 966\n#define OBJ_camellia_192_ccm OBJ_camellia,27L\n\n#define SN_camellia_192_ctr \"CAMELLIA-192-CTR\"\n#define LN_camellia_192_ctr \"camellia-192-ctr\"\n#define NID_camellia_192_ctr 967\n#define OBJ_camellia_192_ctr OBJ_camellia,29L\n\n#define SN_camellia_192_cmac \"CAMELLIA-192-CMAC\"\n#define LN_camellia_192_cmac \"camellia-192-cmac\"\n#define NID_camellia_192_cmac 968\n#define OBJ_camellia_192_cmac OBJ_camellia,30L\n\n#define SN_camellia_256_ecb \"CAMELLIA-256-ECB\"\n#define LN_camellia_256_ecb \"camellia-256-ecb\"\n#define NID_camellia_256_ecb 756\n#define OBJ_camellia_256_ecb OBJ_camellia,41L\n\n#define SN_camellia_256_ofb128 \"CAMELLIA-256-OFB\"\n#define LN_camellia_256_ofb128 \"camellia-256-ofb\"\n#define NID_camellia_256_ofb128 768\n#define OBJ_camellia_256_ofb128 OBJ_camellia,43L\n\n#define SN_camellia_256_cfb128 \"CAMELLIA-256-CFB\"\n#define LN_camellia_256_cfb128 \"camellia-256-cfb\"\n#define NID_camellia_256_cfb128 759\n#define OBJ_camellia_256_cfb128 OBJ_camellia,44L\n\n#define SN_camellia_256_gcm \"CAMELLIA-256-GCM\"\n#define LN_camellia_256_gcm \"camellia-256-gcm\"\n#define NID_camellia_256_gcm 969\n#define OBJ_camellia_256_gcm OBJ_camellia,46L\n\n#define SN_camellia_256_ccm \"CAMELLIA-256-CCM\"\n#define LN_camellia_256_ccm \"camellia-256-ccm\"\n#define NID_camellia_256_ccm 970\n#define OBJ_camellia_256_ccm OBJ_camellia,47L\n\n#define SN_camellia_256_ctr \"CAMELLIA-256-CTR\"\n#define LN_camellia_256_ctr \"camellia-256-ctr\"\n#define NID_camellia_256_ctr 971\n#define OBJ_camellia_256_ctr OBJ_camellia,49L\n\n#define SN_camellia_256_cmac \"CAMELLIA-256-CMAC\"\n#define LN_camellia_256_cmac \"camellia-256-cmac\"\n#define NID_camellia_256_cmac 972\n#define OBJ_camellia_256_cmac OBJ_camellia,50L\n\n#define SN_camellia_128_cfb1 \"CAMELLIA-128-CFB1\"\n#define LN_camellia_128_cfb1 \"camellia-128-cfb1\"\n#define NID_camellia_128_cfb1 760\n\n#define SN_camellia_192_cfb1 \"CAMELLIA-192-CFB1\"\n#define LN_camellia_192_cfb1 \"camellia-192-cfb1\"\n#define NID_camellia_192_cfb1 761\n\n#define SN_camellia_256_cfb1 \"CAMELLIA-256-CFB1\"\n#define LN_camellia_256_cfb1 \"camellia-256-cfb1\"\n#define NID_camellia_256_cfb1 762\n\n#define SN_camellia_128_cfb8 \"CAMELLIA-128-CFB8\"\n#define LN_camellia_128_cfb8 \"camellia-128-cfb8\"\n#define NID_camellia_128_cfb8 763\n\n#define SN_camellia_192_cfb8 \"CAMELLIA-192-CFB8\"\n#define LN_camellia_192_cfb8 \"camellia-192-cfb8\"\n#define NID_camellia_192_cfb8 764\n\n#define SN_camellia_256_cfb8 \"CAMELLIA-256-CFB8\"\n#define LN_camellia_256_cfb8 \"camellia-256-cfb8\"\n#define NID_camellia_256_cfb8 765\n\n#define OBJ_aria 1L,2L,410L,200046L,1L,1L\n\n#define SN_aria_128_ecb \"ARIA-128-ECB\"\n#define LN_aria_128_ecb \"aria-128-ecb\"\n#define NID_aria_128_ecb 1065\n#define OBJ_aria_128_ecb OBJ_aria,1L\n\n#define SN_aria_128_cbc \"ARIA-128-CBC\"\n#define LN_aria_128_cbc \"aria-128-cbc\"\n#define NID_aria_128_cbc 1066\n#define OBJ_aria_128_cbc OBJ_aria,2L\n\n#define SN_aria_128_cfb128 \"ARIA-128-CFB\"\n#define LN_aria_128_cfb128 \"aria-128-cfb\"\n#define NID_aria_128_cfb128 1067\n#define OBJ_aria_128_cfb128 OBJ_aria,3L\n\n#define SN_aria_128_ofb128 \"ARIA-128-OFB\"\n#define LN_aria_128_ofb128 \"aria-128-ofb\"\n#define NID_aria_128_ofb128 1068\n#define OBJ_aria_128_ofb128 OBJ_aria,4L\n\n#define SN_aria_128_ctr \"ARIA-128-CTR\"\n#define LN_aria_128_ctr \"aria-128-ctr\"\n#define NID_aria_128_ctr 1069\n#define OBJ_aria_128_ctr OBJ_aria,5L\n\n#define SN_aria_192_ecb \"ARIA-192-ECB\"\n#define LN_aria_192_ecb \"aria-192-ecb\"\n#define NID_aria_192_ecb 1070\n#define OBJ_aria_192_ecb OBJ_aria,6L\n\n#define SN_aria_192_cbc \"ARIA-192-CBC\"\n#define LN_aria_192_cbc \"aria-192-cbc\"\n#define NID_aria_192_cbc 1071\n#define OBJ_aria_192_cbc OBJ_aria,7L\n\n#define SN_aria_192_cfb128 \"ARIA-192-CFB\"\n#define LN_aria_192_cfb128 \"aria-192-cfb\"\n#define NID_aria_192_cfb128 1072\n#define OBJ_aria_192_cfb128 OBJ_aria,8L\n\n#define SN_aria_192_ofb128 \"ARIA-192-OFB\"\n#define LN_aria_192_ofb128 \"aria-192-ofb\"\n#define NID_aria_192_ofb128 1073\n#define OBJ_aria_192_ofb128 OBJ_aria,9L\n\n#define SN_aria_192_ctr \"ARIA-192-CTR\"\n#define LN_aria_192_ctr \"aria-192-ctr\"\n#define NID_aria_192_ctr 1074\n#define OBJ_aria_192_ctr OBJ_aria,10L\n\n#define SN_aria_256_ecb \"ARIA-256-ECB\"\n#define LN_aria_256_ecb \"aria-256-ecb\"\n#define NID_aria_256_ecb 1075\n#define OBJ_aria_256_ecb OBJ_aria,11L\n\n#define SN_aria_256_cbc \"ARIA-256-CBC\"\n#define LN_aria_256_cbc \"aria-256-cbc\"\n#define NID_aria_256_cbc 1076\n#define OBJ_aria_256_cbc OBJ_aria,12L\n\n#define SN_aria_256_cfb128 \"ARIA-256-CFB\"\n#define LN_aria_256_cfb128 \"aria-256-cfb\"\n#define NID_aria_256_cfb128 1077\n#define OBJ_aria_256_cfb128 OBJ_aria,13L\n\n#define SN_aria_256_ofb128 \"ARIA-256-OFB\"\n#define LN_aria_256_ofb128 \"aria-256-ofb\"\n#define NID_aria_256_ofb128 1078\n#define OBJ_aria_256_ofb128 OBJ_aria,14L\n\n#define SN_aria_256_ctr \"ARIA-256-CTR\"\n#define LN_aria_256_ctr \"aria-256-ctr\"\n#define NID_aria_256_ctr 1079\n#define OBJ_aria_256_ctr OBJ_aria,15L\n\n#define SN_aria_128_cfb1 \"ARIA-128-CFB1\"\n#define LN_aria_128_cfb1 \"aria-128-cfb1\"\n#define NID_aria_128_cfb1 1080\n\n#define SN_aria_192_cfb1 \"ARIA-192-CFB1\"\n#define LN_aria_192_cfb1 \"aria-192-cfb1\"\n#define NID_aria_192_cfb1 1081\n\n#define SN_aria_256_cfb1 \"ARIA-256-CFB1\"\n#define LN_aria_256_cfb1 \"aria-256-cfb1\"\n#define NID_aria_256_cfb1 1082\n\n#define SN_aria_128_cfb8 \"ARIA-128-CFB8\"\n#define LN_aria_128_cfb8 \"aria-128-cfb8\"\n#define NID_aria_128_cfb8 1083\n\n#define SN_aria_192_cfb8 \"ARIA-192-CFB8\"\n#define LN_aria_192_cfb8 \"aria-192-cfb8\"\n#define NID_aria_192_cfb8 1084\n\n#define SN_aria_256_cfb8 \"ARIA-256-CFB8\"\n#define LN_aria_256_cfb8 \"aria-256-cfb8\"\n#define NID_aria_256_cfb8 1085\n\n#define SN_aria_128_ccm \"ARIA-128-CCM\"\n#define LN_aria_128_ccm \"aria-128-ccm\"\n#define NID_aria_128_ccm 1120\n#define OBJ_aria_128_ccm OBJ_aria,37L\n\n#define SN_aria_192_ccm \"ARIA-192-CCM\"\n#define LN_aria_192_ccm \"aria-192-ccm\"\n#define NID_aria_192_ccm 1121\n#define OBJ_aria_192_ccm OBJ_aria,38L\n\n#define SN_aria_256_ccm \"ARIA-256-CCM\"\n#define LN_aria_256_ccm \"aria-256-ccm\"\n#define NID_aria_256_ccm 1122\n#define OBJ_aria_256_ccm OBJ_aria,39L\n\n#define SN_aria_128_gcm \"ARIA-128-GCM\"\n#define LN_aria_128_gcm \"aria-128-gcm\"\n#define NID_aria_128_gcm 1123\n#define OBJ_aria_128_gcm OBJ_aria,34L\n\n#define SN_aria_192_gcm \"ARIA-192-GCM\"\n#define LN_aria_192_gcm \"aria-192-gcm\"\n#define NID_aria_192_gcm 1124\n#define OBJ_aria_192_gcm OBJ_aria,35L\n\n#define SN_aria_256_gcm \"ARIA-256-GCM\"\n#define LN_aria_256_gcm \"aria-256-gcm\"\n#define NID_aria_256_gcm 1125\n#define OBJ_aria_256_gcm OBJ_aria,36L\n\n#define SN_kisa \"KISA\"\n#define LN_kisa \"kisa\"\n#define NID_kisa 773\n#define OBJ_kisa OBJ_member_body,410L,200004L\n\n#define SN_seed_ecb \"SEED-ECB\"\n#define LN_seed_ecb \"seed-ecb\"\n#define NID_seed_ecb 776\n#define OBJ_seed_ecb OBJ_kisa,1L,3L\n\n#define SN_seed_cbc \"SEED-CBC\"\n#define LN_seed_cbc \"seed-cbc\"\n#define NID_seed_cbc 777\n#define OBJ_seed_cbc OBJ_kisa,1L,4L\n\n#define SN_seed_cfb128 \"SEED-CFB\"\n#define LN_seed_cfb128 \"seed-cfb\"\n#define NID_seed_cfb128 779\n#define OBJ_seed_cfb128 OBJ_kisa,1L,5L\n\n#define SN_seed_ofb128 \"SEED-OFB\"\n#define LN_seed_ofb128 \"seed-ofb\"\n#define NID_seed_ofb128 778\n#define OBJ_seed_ofb128 OBJ_kisa,1L,6L\n\n#define SN_sm4_ecb \"SM4-ECB\"\n#define LN_sm4_ecb \"sm4-ecb\"\n#define NID_sm4_ecb 1133\n#define OBJ_sm4_ecb OBJ_sm_scheme,104L,1L\n\n#define SN_sm4_cbc \"SM4-CBC\"\n#define LN_sm4_cbc \"sm4-cbc\"\n#define NID_sm4_cbc 1134\n#define OBJ_sm4_cbc OBJ_sm_scheme,104L,2L\n\n#define SN_sm4_ofb128 \"SM4-OFB\"\n#define LN_sm4_ofb128 \"sm4-ofb\"\n#define NID_sm4_ofb128 1135\n#define OBJ_sm4_ofb128 OBJ_sm_scheme,104L,3L\n\n#define SN_sm4_cfb128 \"SM4-CFB\"\n#define LN_sm4_cfb128 \"sm4-cfb\"\n#define NID_sm4_cfb128 1137\n#define OBJ_sm4_cfb128 OBJ_sm_scheme,104L,4L\n\n#define SN_sm4_cfb1 \"SM4-CFB1\"\n#define LN_sm4_cfb1 \"sm4-cfb1\"\n#define NID_sm4_cfb1 1136\n#define OBJ_sm4_cfb1 OBJ_sm_scheme,104L,5L\n\n#define SN_sm4_cfb8 \"SM4-CFB8\"\n#define LN_sm4_cfb8 \"sm4-cfb8\"\n#define NID_sm4_cfb8 1138\n#define OBJ_sm4_cfb8 OBJ_sm_scheme,104L,6L\n\n#define SN_sm4_ctr \"SM4-CTR\"\n#define LN_sm4_ctr \"sm4-ctr\"\n#define NID_sm4_ctr 1139\n#define OBJ_sm4_ctr OBJ_sm_scheme,104L,7L\n\n#define SN_hmac \"HMAC\"\n#define LN_hmac \"hmac\"\n#define NID_hmac 855\n\n#define SN_cmac \"CMAC\"\n#define LN_cmac \"cmac\"\n#define NID_cmac 894\n\n#define SN_rc4_hmac_md5 \"RC4-HMAC-MD5\"\n#define LN_rc4_hmac_md5 \"rc4-hmac-md5\"\n#define NID_rc4_hmac_md5 915\n\n#define SN_aes_128_cbc_hmac_sha1 \"AES-128-CBC-HMAC-SHA1\"\n#define LN_aes_128_cbc_hmac_sha1 \"aes-128-cbc-hmac-sha1\"\n#define NID_aes_128_cbc_hmac_sha1 916\n\n#define SN_aes_192_cbc_hmac_sha1 \"AES-192-CBC-HMAC-SHA1\"\n#define LN_aes_192_cbc_hmac_sha1 \"aes-192-cbc-hmac-sha1\"\n#define NID_aes_192_cbc_hmac_sha1 917\n\n#define SN_aes_256_cbc_hmac_sha1 \"AES-256-CBC-HMAC-SHA1\"\n#define LN_aes_256_cbc_hmac_sha1 \"aes-256-cbc-hmac-sha1\"\n#define NID_aes_256_cbc_hmac_sha1 918\n\n#define SN_aes_128_cbc_hmac_sha256 \"AES-128-CBC-HMAC-SHA256\"\n#define LN_aes_128_cbc_hmac_sha256 \"aes-128-cbc-hmac-sha256\"\n#define NID_aes_128_cbc_hmac_sha256 948\n\n#define SN_aes_192_cbc_hmac_sha256 \"AES-192-CBC-HMAC-SHA256\"\n#define LN_aes_192_cbc_hmac_sha256 \"aes-192-cbc-hmac-sha256\"\n#define NID_aes_192_cbc_hmac_sha256 949\n\n#define SN_aes_256_cbc_hmac_sha256 \"AES-256-CBC-HMAC-SHA256\"\n#define LN_aes_256_cbc_hmac_sha256 \"aes-256-cbc-hmac-sha256\"\n#define NID_aes_256_cbc_hmac_sha256 950\n\n#define SN_chacha20_poly1305 \"ChaCha20-Poly1305\"\n#define LN_chacha20_poly1305 \"chacha20-poly1305\"\n#define NID_chacha20_poly1305 1018\n\n#define SN_chacha20 \"ChaCha20\"\n#define LN_chacha20 \"chacha20\"\n#define NID_chacha20 1019\n\n#define SN_dhpublicnumber \"dhpublicnumber\"\n#define LN_dhpublicnumber \"X9.42 DH\"\n#define NID_dhpublicnumber 920\n#define OBJ_dhpublicnumber OBJ_ISO_US,10046L,2L,1L\n\n#define SN_brainpoolP160r1 \"brainpoolP160r1\"\n#define NID_brainpoolP160r1 921\n#define OBJ_brainpoolP160r1 1L,3L,36L,3L,3L,2L,8L,1L,1L,1L\n\n#define SN_brainpoolP160t1 \"brainpoolP160t1\"\n#define NID_brainpoolP160t1 922\n#define OBJ_brainpoolP160t1 1L,3L,36L,3L,3L,2L,8L,1L,1L,2L\n\n#define SN_brainpoolP192r1 \"brainpoolP192r1\"\n#define NID_brainpoolP192r1 923\n#define OBJ_brainpoolP192r1 1L,3L,36L,3L,3L,2L,8L,1L,1L,3L\n\n#define SN_brainpoolP192t1 \"brainpoolP192t1\"\n#define NID_brainpoolP192t1 924\n#define OBJ_brainpoolP192t1 1L,3L,36L,3L,3L,2L,8L,1L,1L,4L\n\n#define SN_brainpoolP224r1 \"brainpoolP224r1\"\n#define NID_brainpoolP224r1 925\n#define OBJ_brainpoolP224r1 1L,3L,36L,3L,3L,2L,8L,1L,1L,5L\n\n#define SN_brainpoolP224t1 \"brainpoolP224t1\"\n#define NID_brainpoolP224t1 926\n#define OBJ_brainpoolP224t1 1L,3L,36L,3L,3L,2L,8L,1L,1L,6L\n\n#define SN_brainpoolP256r1 \"brainpoolP256r1\"\n#define NID_brainpoolP256r1 927\n#define OBJ_brainpoolP256r1 1L,3L,36L,3L,3L,2L,8L,1L,1L,7L\n\n#define SN_brainpoolP256t1 \"brainpoolP256t1\"\n#define NID_brainpoolP256t1 928\n#define OBJ_brainpoolP256t1 1L,3L,36L,3L,3L,2L,8L,1L,1L,8L\n\n#define SN_brainpoolP320r1 \"brainpoolP320r1\"\n#define NID_brainpoolP320r1 929\n#define OBJ_brainpoolP320r1 1L,3L,36L,3L,3L,2L,8L,1L,1L,9L\n\n#define SN_brainpoolP320t1 \"brainpoolP320t1\"\n#define NID_brainpoolP320t1 930\n#define OBJ_brainpoolP320t1 1L,3L,36L,3L,3L,2L,8L,1L,1L,10L\n\n#define SN_brainpoolP384r1 \"brainpoolP384r1\"\n#define NID_brainpoolP384r1 931\n#define OBJ_brainpoolP384r1 1L,3L,36L,3L,3L,2L,8L,1L,1L,11L\n\n#define SN_brainpoolP384t1 \"brainpoolP384t1\"\n#define NID_brainpoolP384t1 932\n#define OBJ_brainpoolP384t1 1L,3L,36L,3L,3L,2L,8L,1L,1L,12L\n\n#define SN_brainpoolP512r1 \"brainpoolP512r1\"\n#define NID_brainpoolP512r1 933\n#define OBJ_brainpoolP512r1 1L,3L,36L,3L,3L,2L,8L,1L,1L,13L\n\n#define SN_brainpoolP512t1 \"brainpoolP512t1\"\n#define NID_brainpoolP512t1 934\n#define OBJ_brainpoolP512t1 1L,3L,36L,3L,3L,2L,8L,1L,1L,14L\n\n#define OBJ_x9_63_scheme 1L,3L,133L,16L,840L,63L,0L\n\n#define OBJ_secg_scheme OBJ_certicom_arc,1L\n\n#define SN_dhSinglePass_stdDH_sha1kdf_scheme \"dhSinglePass-stdDH-sha1kdf-scheme\"\n#define NID_dhSinglePass_stdDH_sha1kdf_scheme 936\n#define OBJ_dhSinglePass_stdDH_sha1kdf_scheme OBJ_x9_63_scheme,2L\n\n#define SN_dhSinglePass_stdDH_sha224kdf_scheme \"dhSinglePass-stdDH-sha224kdf-scheme\"\n#define NID_dhSinglePass_stdDH_sha224kdf_scheme 937\n#define OBJ_dhSinglePass_stdDH_sha224kdf_scheme OBJ_secg_scheme,11L,0L\n\n#define SN_dhSinglePass_stdDH_sha256kdf_scheme \"dhSinglePass-stdDH-sha256kdf-scheme\"\n#define NID_dhSinglePass_stdDH_sha256kdf_scheme 938\n#define OBJ_dhSinglePass_stdDH_sha256kdf_scheme OBJ_secg_scheme,11L,1L\n\n#define SN_dhSinglePass_stdDH_sha384kdf_scheme \"dhSinglePass-stdDH-sha384kdf-scheme\"\n#define NID_dhSinglePass_stdDH_sha384kdf_scheme 939\n#define OBJ_dhSinglePass_stdDH_sha384kdf_scheme OBJ_secg_scheme,11L,2L\n\n#define SN_dhSinglePass_stdDH_sha512kdf_scheme \"dhSinglePass-stdDH-sha512kdf-scheme\"\n#define NID_dhSinglePass_stdDH_sha512kdf_scheme 940\n#define OBJ_dhSinglePass_stdDH_sha512kdf_scheme OBJ_secg_scheme,11L,3L\n\n#define SN_dhSinglePass_cofactorDH_sha1kdf_scheme \"dhSinglePass-cofactorDH-sha1kdf-scheme\"\n#define NID_dhSinglePass_cofactorDH_sha1kdf_scheme 941\n#define OBJ_dhSinglePass_cofactorDH_sha1kdf_scheme OBJ_x9_63_scheme,3L\n\n#define SN_dhSinglePass_cofactorDH_sha224kdf_scheme \"dhSinglePass-cofactorDH-sha224kdf-scheme\"\n#define NID_dhSinglePass_cofactorDH_sha224kdf_scheme 942\n#define OBJ_dhSinglePass_cofactorDH_sha224kdf_scheme OBJ_secg_scheme,14L,0L\n\n#define SN_dhSinglePass_cofactorDH_sha256kdf_scheme \"dhSinglePass-cofactorDH-sha256kdf-scheme\"\n#define NID_dhSinglePass_cofactorDH_sha256kdf_scheme 943\n#define OBJ_dhSinglePass_cofactorDH_sha256kdf_scheme OBJ_secg_scheme,14L,1L\n\n#define SN_dhSinglePass_cofactorDH_sha384kdf_scheme \"dhSinglePass-cofactorDH-sha384kdf-scheme\"\n#define NID_dhSinglePass_cofactorDH_sha384kdf_scheme 944\n#define OBJ_dhSinglePass_cofactorDH_sha384kdf_scheme OBJ_secg_scheme,14L,2L\n\n#define SN_dhSinglePass_cofactorDH_sha512kdf_scheme \"dhSinglePass-cofactorDH-sha512kdf-scheme\"\n#define NID_dhSinglePass_cofactorDH_sha512kdf_scheme 945\n#define OBJ_dhSinglePass_cofactorDH_sha512kdf_scheme OBJ_secg_scheme,14L,3L\n\n#define SN_dh_std_kdf \"dh-std-kdf\"\n#define NID_dh_std_kdf 946\n\n#define SN_dh_cofactor_kdf \"dh-cofactor-kdf\"\n#define NID_dh_cofactor_kdf 947\n\n#define SN_ct_precert_scts \"ct_precert_scts\"\n#define LN_ct_precert_scts \"CT Precertificate SCTs\"\n#define NID_ct_precert_scts 951\n#define OBJ_ct_precert_scts 1L,3L,6L,1L,4L,1L,11129L,2L,4L,2L\n\n#define SN_ct_precert_poison \"ct_precert_poison\"\n#define LN_ct_precert_poison \"CT Precertificate Poison\"\n#define NID_ct_precert_poison 952\n#define OBJ_ct_precert_poison 1L,3L,6L,1L,4L,1L,11129L,2L,4L,3L\n\n#define SN_ct_precert_signer \"ct_precert_signer\"\n#define LN_ct_precert_signer \"CT Precertificate Signer\"\n#define NID_ct_precert_signer 953\n#define OBJ_ct_precert_signer 1L,3L,6L,1L,4L,1L,11129L,2L,4L,4L\n\n#define SN_ct_cert_scts \"ct_cert_scts\"\n#define LN_ct_cert_scts \"CT Certificate SCTs\"\n#define NID_ct_cert_scts 954\n#define OBJ_ct_cert_scts 1L,3L,6L,1L,4L,1L,11129L,2L,4L,5L\n\n#define SN_jurisdictionLocalityName \"jurisdictionL\"\n#define LN_jurisdictionLocalityName \"jurisdictionLocalityName\"\n#define NID_jurisdictionLocalityName 955\n#define OBJ_jurisdictionLocalityName 1L,3L,6L,1L,4L,1L,311L,60L,2L,1L,1L\n\n#define SN_jurisdictionStateOrProvinceName \"jurisdictionST\"\n#define LN_jurisdictionStateOrProvinceName \"jurisdictionStateOrProvinceName\"\n#define NID_jurisdictionStateOrProvinceName 956\n#define OBJ_jurisdictionStateOrProvinceName 1L,3L,6L,1L,4L,1L,311L,60L,2L,1L,2L\n\n#define SN_jurisdictionCountryName \"jurisdictionC\"\n#define LN_jurisdictionCountryName \"jurisdictionCountryName\"\n#define NID_jurisdictionCountryName 957\n#define OBJ_jurisdictionCountryName 1L,3L,6L,1L,4L,1L,311L,60L,2L,1L,3L\n\n#define SN_id_scrypt \"id-scrypt\"\n#define LN_id_scrypt \"scrypt\"\n#define NID_id_scrypt 973\n#define OBJ_id_scrypt 1L,3L,6L,1L,4L,1L,11591L,4L,11L\n\n#define SN_tls1_prf \"TLS1-PRF\"\n#define LN_tls1_prf \"tls1-prf\"\n#define NID_tls1_prf 1021\n\n#define SN_hkdf \"HKDF\"\n#define LN_hkdf \"hkdf\"\n#define NID_hkdf 1036\n\n#define SN_id_pkinit \"id-pkinit\"\n#define NID_id_pkinit 1031\n#define OBJ_id_pkinit 1L,3L,6L,1L,5L,2L,3L\n\n#define SN_pkInitClientAuth \"pkInitClientAuth\"\n#define LN_pkInitClientAuth \"PKINIT Client Auth\"\n#define NID_pkInitClientAuth 1032\n#define OBJ_pkInitClientAuth OBJ_id_pkinit,4L\n\n#define SN_pkInitKDC \"pkInitKDC\"\n#define LN_pkInitKDC \"Signing KDC Response\"\n#define NID_pkInitKDC 1033\n#define OBJ_pkInitKDC OBJ_id_pkinit,5L\n\n#define SN_X25519 \"X25519\"\n#define NID_X25519 1034\n#define OBJ_X25519 1L,3L,101L,110L\n\n#define SN_X448 \"X448\"\n#define NID_X448 1035\n#define OBJ_X448 1L,3L,101L,111L\n\n#define SN_ED25519 \"ED25519\"\n#define NID_ED25519 1087\n#define OBJ_ED25519 1L,3L,101L,112L\n\n#define SN_ED448 \"ED448\"\n#define NID_ED448 1088\n#define OBJ_ED448 1L,3L,101L,113L\n\n#define SN_kx_rsa \"KxRSA\"\n#define LN_kx_rsa \"kx-rsa\"\n#define NID_kx_rsa 1037\n\n#define SN_kx_ecdhe \"KxECDHE\"\n#define LN_kx_ecdhe \"kx-ecdhe\"\n#define NID_kx_ecdhe 1038\n\n#define SN_kx_dhe \"KxDHE\"\n#define LN_kx_dhe \"kx-dhe\"\n#define NID_kx_dhe 1039\n\n#define SN_kx_ecdhe_psk \"KxECDHE-PSK\"\n#define LN_kx_ecdhe_psk \"kx-ecdhe-psk\"\n#define NID_kx_ecdhe_psk 1040\n\n#define SN_kx_dhe_psk \"KxDHE-PSK\"\n#define LN_kx_dhe_psk \"kx-dhe-psk\"\n#define NID_kx_dhe_psk 1041\n\n#define SN_kx_rsa_psk \"KxRSA_PSK\"\n#define LN_kx_rsa_psk \"kx-rsa-psk\"\n#define NID_kx_rsa_psk 1042\n\n#define SN_kx_psk \"KxPSK\"\n#define LN_kx_psk \"kx-psk\"\n#define NID_kx_psk 1043\n\n#define SN_kx_srp \"KxSRP\"\n#define LN_kx_srp \"kx-srp\"\n#define NID_kx_srp 1044\n\n#define SN_kx_gost \"KxGOST\"\n#define LN_kx_gost \"kx-gost\"\n#define NID_kx_gost 1045\n\n#define SN_kx_any \"KxANY\"\n#define LN_kx_any \"kx-any\"\n#define NID_kx_any 1063\n\n#define SN_auth_rsa \"AuthRSA\"\n#define LN_auth_rsa \"auth-rsa\"\n#define NID_auth_rsa 1046\n\n#define SN_auth_ecdsa \"AuthECDSA\"\n#define LN_auth_ecdsa \"auth-ecdsa\"\n#define NID_auth_ecdsa 1047\n\n#define SN_auth_psk \"AuthPSK\"\n#define LN_auth_psk \"auth-psk\"\n#define NID_auth_psk 1048\n\n#define SN_auth_dss \"AuthDSS\"\n#define LN_auth_dss \"auth-dss\"\n#define NID_auth_dss 1049\n\n#define SN_auth_gost01 \"AuthGOST01\"\n#define LN_auth_gost01 \"auth-gost01\"\n#define NID_auth_gost01 1050\n\n#define SN_auth_gost12 \"AuthGOST12\"\n#define LN_auth_gost12 \"auth-gost12\"\n#define NID_auth_gost12 1051\n\n#define SN_auth_srp \"AuthSRP\"\n#define LN_auth_srp \"auth-srp\"\n#define NID_auth_srp 1052\n\n#define SN_auth_null \"AuthNULL\"\n#define LN_auth_null \"auth-null\"\n#define NID_auth_null 1053\n\n#define SN_auth_any \"AuthANY\"\n#define LN_auth_any \"auth-any\"\n#define NID_auth_any 1064\n\n#define SN_poly1305 \"Poly1305\"\n#define LN_poly1305 \"poly1305\"\n#define NID_poly1305 1061\n\n#define SN_siphash \"SipHash\"\n#define LN_siphash \"siphash\"\n#define NID_siphash 1062\n\n#define SN_ffdhe2048 \"ffdhe2048\"\n#define NID_ffdhe2048 1126\n\n#define SN_ffdhe3072 \"ffdhe3072\"\n#define NID_ffdhe3072 1127\n\n#define SN_ffdhe4096 \"ffdhe4096\"\n#define NID_ffdhe4096 1128\n\n#define SN_ffdhe6144 \"ffdhe6144\"\n#define NID_ffdhe6144 1129\n\n#define SN_ffdhe8192 \"ffdhe8192\"\n#define NID_ffdhe8192 1130\n\n#define SN_ISO_UA \"ISO-UA\"\n#define NID_ISO_UA 1150\n#define OBJ_ISO_UA OBJ_member_body,804L\n\n#define SN_ua_pki \"ua-pki\"\n#define NID_ua_pki 1151\n#define OBJ_ua_pki OBJ_ISO_UA,2L,1L,1L,1L\n\n#define SN_dstu28147 \"dstu28147\"\n#define LN_dstu28147 \"DSTU Gost 28147-2009\"\n#define NID_dstu28147 1152\n#define OBJ_dstu28147 OBJ_ua_pki,1L,1L,1L\n\n#define SN_dstu28147_ofb \"dstu28147-ofb\"\n#define LN_dstu28147_ofb \"DSTU Gost 28147-2009 OFB mode\"\n#define NID_dstu28147_ofb 1153\n#define OBJ_dstu28147_ofb OBJ_dstu28147,2L\n\n#define SN_dstu28147_cfb \"dstu28147-cfb\"\n#define LN_dstu28147_cfb \"DSTU Gost 28147-2009 CFB mode\"\n#define NID_dstu28147_cfb 1154\n#define OBJ_dstu28147_cfb OBJ_dstu28147,3L\n\n#define SN_dstu28147_wrap \"dstu28147-wrap\"\n#define LN_dstu28147_wrap \"DSTU Gost 28147-2009 key wrap\"\n#define NID_dstu28147_wrap 1155\n#define OBJ_dstu28147_wrap OBJ_dstu28147,5L\n\n#define SN_hmacWithDstu34311 \"hmacWithDstu34311\"\n#define LN_hmacWithDstu34311 \"HMAC DSTU Gost 34311-95\"\n#define NID_hmacWithDstu34311 1156\n#define OBJ_hmacWithDstu34311 OBJ_ua_pki,1L,1L,2L\n\n#define SN_dstu34311 \"dstu34311\"\n#define LN_dstu34311 \"DSTU Gost 34311-95\"\n#define NID_dstu34311 1157\n#define OBJ_dstu34311 OBJ_ua_pki,1L,2L,1L\n\n#define SN_dstu4145le \"dstu4145le\"\n#define LN_dstu4145le \"DSTU 4145-2002 little endian\"\n#define NID_dstu4145le 1158\n#define OBJ_dstu4145le OBJ_ua_pki,1L,3L,1L,1L\n\n#define SN_dstu4145be \"dstu4145be\"\n#define LN_dstu4145be \"DSTU 4145-2002 big endian\"\n#define NID_dstu4145be 1159\n#define OBJ_dstu4145be OBJ_dstu4145le,1L,1L\n\n#define SN_uacurve0 \"uacurve0\"\n#define LN_uacurve0 \"DSTU curve 0\"\n#define NID_uacurve0 1160\n#define OBJ_uacurve0 OBJ_dstu4145le,2L,0L\n\n#define SN_uacurve1 \"uacurve1\"\n#define LN_uacurve1 \"DSTU curve 1\"\n#define NID_uacurve1 1161\n#define OBJ_uacurve1 OBJ_dstu4145le,2L,1L\n\n#define SN_uacurve2 \"uacurve2\"\n#define LN_uacurve2 \"DSTU curve 2\"\n#define NID_uacurve2 1162\n#define OBJ_uacurve2 OBJ_dstu4145le,2L,2L\n\n#define SN_uacurve3 \"uacurve3\"\n#define LN_uacurve3 \"DSTU curve 3\"\n#define NID_uacurve3 1163\n#define OBJ_uacurve3 OBJ_dstu4145le,2L,3L\n\n#define SN_uacurve4 \"uacurve4\"\n#define LN_uacurve4 \"DSTU curve 4\"\n#define NID_uacurve4 1164\n#define OBJ_uacurve4 OBJ_dstu4145le,2L,4L\n\n#define SN_uacurve5 \"uacurve5\"\n#define LN_uacurve5 \"DSTU curve 5\"\n#define NID_uacurve5 1165\n#define OBJ_uacurve5 OBJ_dstu4145le,2L,5L\n\n#define SN_uacurve6 \"uacurve6\"\n#define LN_uacurve6 \"DSTU curve 6\"\n#define NID_uacurve6 1166\n#define OBJ_uacurve6 OBJ_dstu4145le,2L,6L\n\n#define SN_uacurve7 \"uacurve7\"\n#define LN_uacurve7 \"DSTU curve 7\"\n#define NID_uacurve7 1167\n#define OBJ_uacurve7 OBJ_dstu4145le,2L,7L\n\n#define SN_uacurve8 \"uacurve8\"\n#define LN_uacurve8 \"DSTU curve 8\"\n#define NID_uacurve8 1168\n#define OBJ_uacurve8 OBJ_dstu4145le,2L,8L\n\n#define SN_uacurve9 \"uacurve9\"\n#define LN_uacurve9 \"DSTU curve 9\"\n#define NID_uacurve9 1169\n#define OBJ_uacurve9 OBJ_dstu4145le,2L,9L\n" }, { "path": "cryptomini/include/openssl/objects.h", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_OBJECTS_H\n# define HEADER_OBJECTS_H\n\n# include \n# include \n# include \n# include \n\n# define OBJ_NAME_TYPE_UNDEF 0x00\n# define OBJ_NAME_TYPE_MD_METH 0x01\n# define OBJ_NAME_TYPE_CIPHER_METH 0x02\n# define OBJ_NAME_TYPE_PKEY_METH 0x03\n# define OBJ_NAME_TYPE_COMP_METH 0x04\n# define OBJ_NAME_TYPE_NUM 0x05\n\n# define OBJ_NAME_ALIAS 0x8000\n\n# define OBJ_BSEARCH_VALUE_ON_NOMATCH 0x01\n# define OBJ_BSEARCH_FIRST_VALUE_ON_MATCH 0x02\n\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\ntypedef struct obj_name_st {\n int type;\n int alias;\n const char *name;\n const char *data;\n} OBJ_NAME;\n\n# define OBJ_create_and_add_object(a,b,c) OBJ_create(a,b,c)\n\nint OBJ_NAME_init(void);\nint OBJ_NAME_new_index(unsigned long (*hash_func) (const char *),\n int (*cmp_func) (const char *, const char *),\n void (*free_func) (const char *, int, const char *));\nconst char *OBJ_NAME_get(const char *name, int type);\nint OBJ_NAME_add(const char *name, int type, const char *data);\nint OBJ_NAME_remove(const char *name, int type);\nvoid OBJ_NAME_cleanup(int type); /* -1 for everything */\nvoid OBJ_NAME_do_all(int type, void (*fn) (const OBJ_NAME *, void *arg),\n void *arg);\nvoid OBJ_NAME_do_all_sorted(int type,\n void (*fn) (const OBJ_NAME *, void *arg),\n void *arg);\n\nASN1_OBJECT *OBJ_dup(const ASN1_OBJECT *o);\nASN1_OBJECT *OBJ_nid2obj(int n);\nconst char *OBJ_nid2ln(int n);\nconst char *OBJ_nid2sn(int n);\nint OBJ_obj2nid(const ASN1_OBJECT *o);\nASN1_OBJECT *OBJ_txt2obj(const char *s, int no_name);\nint OBJ_obj2txt(char *buf, int buf_len, const ASN1_OBJECT *a, int no_name);\nint OBJ_txt2nid(const char *s);\nint OBJ_ln2nid(const char *s);\nint OBJ_sn2nid(const char *s);\nint OBJ_cmp(const ASN1_OBJECT *a, const ASN1_OBJECT *b);\nconst void *OBJ_bsearch_(const void *key, const void *base, int num, int size,\n int (*cmp) (const void *, const void *));\nconst void *OBJ_bsearch_ex_(const void *key, const void *base, int num,\n int size,\n int (*cmp) (const void *, const void *),\n int flags);\n\n# define _DECLARE_OBJ_BSEARCH_CMP_FN(scope, type1, type2, nm) \\\n static int nm##_cmp_BSEARCH_CMP_FN(const void *, const void *); \\\n static int nm##_cmp(type1 const *, type2 const *); \\\n scope type2 * OBJ_bsearch_##nm(type1 *key, type2 const *base, int num)\n\n# define DECLARE_OBJ_BSEARCH_CMP_FN(type1, type2, cmp) \\\n _DECLARE_OBJ_BSEARCH_CMP_FN(static, type1, type2, cmp)\n# define DECLARE_OBJ_BSEARCH_GLOBAL_CMP_FN(type1, type2, nm) \\\n type2 * OBJ_bsearch_##nm(type1 *key, type2 const *base, int num)\n\n/*-\n * Unsolved problem: if a type is actually a pointer type, like\n * nid_triple is, then its impossible to get a const where you need\n * it. Consider:\n *\n * typedef int nid_triple[3];\n * const void *a_;\n * const nid_triple const *a = a_;\n *\n * The assignment discards a const because what you really want is:\n *\n * const int const * const *a = a_;\n *\n * But if you do that, you lose the fact that a is an array of 3 ints,\n * which breaks comparison functions.\n *\n * Thus we end up having to cast, sadly, or unpack the\n * declarations. Or, as I finally did in this case, declare nid_triple\n * to be a struct, which it should have been in the first place.\n *\n * Ben, August 2008.\n *\n * Also, strictly speaking not all types need be const, but handling\n * the non-constness means a lot of complication, and in practice\n * comparison routines do always not touch their arguments.\n */\n\n# define IMPLEMENT_OBJ_BSEARCH_CMP_FN(type1, type2, nm) \\\n static int nm##_cmp_BSEARCH_CMP_FN(const void *a_, const void *b_) \\\n { \\\n type1 const *a = a_; \\\n type2 const *b = b_; \\\n return nm##_cmp(a,b); \\\n } \\\n static type2 *OBJ_bsearch_##nm(type1 *key, type2 const *base, int num) \\\n { \\\n return (type2 *)OBJ_bsearch_(key, base, num, sizeof(type2), \\\n nm##_cmp_BSEARCH_CMP_FN); \\\n } \\\n extern void dummy_prototype(void)\n\n# define IMPLEMENT_OBJ_BSEARCH_GLOBAL_CMP_FN(type1, type2, nm) \\\n static int nm##_cmp_BSEARCH_CMP_FN(const void *a_, const void *b_) \\\n { \\\n type1 const *a = a_; \\\n type2 const *b = b_; \\\n return nm##_cmp(a,b); \\\n } \\\n type2 *OBJ_bsearch_##nm(type1 *key, type2 const *base, int num) \\\n { \\\n return (type2 *)OBJ_bsearch_(key, base, num, sizeof(type2), \\\n nm##_cmp_BSEARCH_CMP_FN); \\\n } \\\n extern void dummy_prototype(void)\n\n# define OBJ_bsearch(type1,key,type2,base,num,cmp) \\\n ((type2 *)OBJ_bsearch_(CHECKED_PTR_OF(type1,key),CHECKED_PTR_OF(type2,base), \\\n num,sizeof(type2), \\\n ((void)CHECKED_PTR_OF(type1,cmp##_type_1), \\\n (void)CHECKED_PTR_OF(type2,cmp##_type_2), \\\n cmp##_BSEARCH_CMP_FN)))\n\n# define OBJ_bsearch_ex(type1,key,type2,base,num,cmp,flags) \\\n ((type2 *)OBJ_bsearch_ex_(CHECKED_PTR_OF(type1,key),CHECKED_PTR_OF(type2,base), \\\n num,sizeof(type2), \\\n ((void)CHECKED_PTR_OF(type1,cmp##_type_1), \\\n (void)type_2=CHECKED_PTR_OF(type2,cmp##_type_2), \\\n cmp##_BSEARCH_CMP_FN)),flags)\n\nint OBJ_new_nid(int num);\nint OBJ_add_object(const ASN1_OBJECT *obj);\nint OBJ_create(const char *oid, const char *sn, const char *ln);\n#if OPENSSL_API_COMPAT < 0x10100000L\n# define OBJ_cleanup() while(0) continue\n#endif\nint OBJ_create_objects(BIO *in);\n\nsize_t OBJ_length(const ASN1_OBJECT *obj);\nconst unsigned char *OBJ_get0_data(const ASN1_OBJECT *obj);\n\nint OBJ_find_sigid_algs(int signid, int *pdig_nid, int *ppkey_nid);\nint OBJ_find_sigid_by_algs(int *psignid, int dig_nid, int pkey_nid);\nint OBJ_add_sigid(int signid, int dig_id, int pkey_id);\nvoid OBJ_sigid_free(void);\n\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/objectserr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_OBJERR_H\n# define HEADER_OBJERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_OBJ_strings(void);\n\n/*\n * OBJ function codes.\n */\n# define OBJ_F_OBJ_ADD_OBJECT 105\n# define OBJ_F_OBJ_ADD_SIGID 107\n# define OBJ_F_OBJ_CREATE 100\n# define OBJ_F_OBJ_DUP 101\n# define OBJ_F_OBJ_NAME_NEW_INDEX 106\n# define OBJ_F_OBJ_NID2LN 102\n# define OBJ_F_OBJ_NID2OBJ 103\n# define OBJ_F_OBJ_NID2SN 104\n# define OBJ_F_OBJ_TXT2OBJ 108\n\n/*\n * OBJ reason codes.\n */\n# define OBJ_R_OID_EXISTS 102\n# define OBJ_R_UNKNOWN_NID 101\n\n#endif\n" }, { "path": "cryptomini/include/openssl/ocsp.h", "content": "/*\n * Copyright 2000-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_OCSP_H\n# define HEADER_OCSP_H\n\n#include \n\n/*\n * These definitions are outside the OPENSSL_NO_OCSP guard because although for\n * historical reasons they have OCSP_* names, they can actually be used\n * independently of OCSP. E.g. see RFC5280\n */\n/*-\n * CRLReason ::= ENUMERATED {\n * unspecified (0),\n * keyCompromise (1),\n * cACompromise (2),\n * affiliationChanged (3),\n * superseded (4),\n * cessationOfOperation (5),\n * certificateHold (6),\n * removeFromCRL (8) }\n */\n# define OCSP_REVOKED_STATUS_NOSTATUS -1\n# define OCSP_REVOKED_STATUS_UNSPECIFIED 0\n# define OCSP_REVOKED_STATUS_KEYCOMPROMISE 1\n# define OCSP_REVOKED_STATUS_CACOMPROMISE 2\n# define OCSP_REVOKED_STATUS_AFFILIATIONCHANGED 3\n# define OCSP_REVOKED_STATUS_SUPERSEDED 4\n# define OCSP_REVOKED_STATUS_CESSATIONOFOPERATION 5\n# define OCSP_REVOKED_STATUS_CERTIFICATEHOLD 6\n# define OCSP_REVOKED_STATUS_REMOVEFROMCRL 8\n\n\n# ifndef OPENSSL_NO_OCSP\n\n# include \n# include \n# include \n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/* Various flags and values */\n\n# define OCSP_DEFAULT_NONCE_LENGTH 16\n\n# define OCSP_NOCERTS 0x1\n# define OCSP_NOINTERN 0x2\n# define OCSP_NOSIGS 0x4\n# define OCSP_NOCHAIN 0x8\n# define OCSP_NOVERIFY 0x10\n# define OCSP_NOEXPLICIT 0x20\n# define OCSP_NOCASIGN 0x40\n# define OCSP_NODELEGATED 0x80\n# define OCSP_NOCHECKS 0x100\n# define OCSP_TRUSTOTHER 0x200\n# define OCSP_RESPID_KEY 0x400\n# define OCSP_NOTIME 0x800\n\ntypedef struct ocsp_cert_id_st OCSP_CERTID;\n\nDEFINE_STACK_OF(OCSP_CERTID)\n\ntypedef struct ocsp_one_request_st OCSP_ONEREQ;\n\nDEFINE_STACK_OF(OCSP_ONEREQ)\n\ntypedef struct ocsp_req_info_st OCSP_REQINFO;\ntypedef struct ocsp_signature_st OCSP_SIGNATURE;\ntypedef struct ocsp_request_st OCSP_REQUEST;\n\n# define OCSP_RESPONSE_STATUS_SUCCESSFUL 0\n# define OCSP_RESPONSE_STATUS_MALFORMEDREQUEST 1\n# define OCSP_RESPONSE_STATUS_INTERNALERROR 2\n# define OCSP_RESPONSE_STATUS_TRYLATER 3\n# define OCSP_RESPONSE_STATUS_SIGREQUIRED 5\n# define OCSP_RESPONSE_STATUS_UNAUTHORIZED 6\n\ntypedef struct ocsp_resp_bytes_st OCSP_RESPBYTES;\n\n# define V_OCSP_RESPID_NAME 0\n# define V_OCSP_RESPID_KEY 1\n\nDEFINE_STACK_OF(OCSP_RESPID)\n\ntypedef struct ocsp_revoked_info_st OCSP_REVOKEDINFO;\n\n# define V_OCSP_CERTSTATUS_GOOD 0\n# define V_OCSP_CERTSTATUS_REVOKED 1\n# define V_OCSP_CERTSTATUS_UNKNOWN 2\n\ntypedef struct ocsp_cert_status_st OCSP_CERTSTATUS;\ntypedef struct ocsp_single_response_st OCSP_SINGLERESP;\n\nDEFINE_STACK_OF(OCSP_SINGLERESP)\n\ntypedef struct ocsp_response_data_st OCSP_RESPDATA;\n\ntypedef struct ocsp_basic_response_st OCSP_BASICRESP;\n\ntypedef struct ocsp_crl_id_st OCSP_CRLID;\ntypedef struct ocsp_service_locator_st OCSP_SERVICELOC;\n\n# define PEM_STRING_OCSP_REQUEST \"OCSP REQUEST\"\n# define PEM_STRING_OCSP_RESPONSE \"OCSP RESPONSE\"\n\n# define d2i_OCSP_REQUEST_bio(bp,p) ASN1_d2i_bio_of(OCSP_REQUEST,OCSP_REQUEST_new,d2i_OCSP_REQUEST,bp,p)\n\n# define d2i_OCSP_RESPONSE_bio(bp,p) ASN1_d2i_bio_of(OCSP_RESPONSE,OCSP_RESPONSE_new,d2i_OCSP_RESPONSE,bp,p)\n\n# define PEM_read_bio_OCSP_REQUEST(bp,x,cb) (OCSP_REQUEST *)PEM_ASN1_read_bio( \\\n (char *(*)())d2i_OCSP_REQUEST,PEM_STRING_OCSP_REQUEST, \\\n bp,(char **)(x),cb,NULL)\n\n# define PEM_read_bio_OCSP_RESPONSE(bp,x,cb) (OCSP_RESPONSE *)PEM_ASN1_read_bio(\\\n (char *(*)())d2i_OCSP_RESPONSE,PEM_STRING_OCSP_RESPONSE, \\\n bp,(char **)(x),cb,NULL)\n\n# define PEM_write_bio_OCSP_REQUEST(bp,o) \\\n PEM_ASN1_write_bio((int (*)())i2d_OCSP_REQUEST,PEM_STRING_OCSP_REQUEST,\\\n bp,(char *)(o), NULL,NULL,0,NULL,NULL)\n\n# define PEM_write_bio_OCSP_RESPONSE(bp,o) \\\n PEM_ASN1_write_bio((int (*)())i2d_OCSP_RESPONSE,PEM_STRING_OCSP_RESPONSE,\\\n bp,(char *)(o), NULL,NULL,0,NULL,NULL)\n\n# define i2d_OCSP_RESPONSE_bio(bp,o) ASN1_i2d_bio_of(OCSP_RESPONSE,i2d_OCSP_RESPONSE,bp,o)\n\n# define i2d_OCSP_REQUEST_bio(bp,o) ASN1_i2d_bio_of(OCSP_REQUEST,i2d_OCSP_REQUEST,bp,o)\n\n# define ASN1_BIT_STRING_digest(data,type,md,len) \\\n ASN1_item_digest(ASN1_ITEM_rptr(ASN1_BIT_STRING),type,data,md,len)\n\n# define OCSP_CERTSTATUS_dup(cs)\\\n (OCSP_CERTSTATUS*)ASN1_dup((int(*)())i2d_OCSP_CERTSTATUS,\\\n (char *(*)())d2i_OCSP_CERTSTATUS,(char *)(cs))\n\nOCSP_CERTID *OCSP_CERTID_dup(OCSP_CERTID *id);\n\nOCSP_RESPONSE *OCSP_sendreq_bio(BIO *b, const char *path, OCSP_REQUEST *req);\nOCSP_REQ_CTX *OCSP_sendreq_new(BIO *io, const char *path, OCSP_REQUEST *req,\n int maxline);\nint OCSP_REQ_CTX_nbio(OCSP_REQ_CTX *rctx);\nint OCSP_sendreq_nbio(OCSP_RESPONSE **presp, OCSP_REQ_CTX *rctx);\nOCSP_REQ_CTX *OCSP_REQ_CTX_new(BIO *io, int maxline);\nvoid OCSP_REQ_CTX_free(OCSP_REQ_CTX *rctx);\nvoid OCSP_set_max_response_length(OCSP_REQ_CTX *rctx, unsigned long len);\nint OCSP_REQ_CTX_i2d(OCSP_REQ_CTX *rctx, const ASN1_ITEM *it,\n ASN1_VALUE *val);\nint OCSP_REQ_CTX_nbio_d2i(OCSP_REQ_CTX *rctx, ASN1_VALUE **pval,\n const ASN1_ITEM *it);\nBIO *OCSP_REQ_CTX_get0_mem_bio(OCSP_REQ_CTX *rctx);\nint OCSP_REQ_CTX_http(OCSP_REQ_CTX *rctx, const char *op, const char *path);\nint OCSP_REQ_CTX_set1_req(OCSP_REQ_CTX *rctx, OCSP_REQUEST *req);\nint OCSP_REQ_CTX_add1_header(OCSP_REQ_CTX *rctx,\n const char *name, const char *value);\n\nOCSP_CERTID *OCSP_cert_to_id(const EVP_MD *dgst, const X509 *subject,\n const X509 *issuer);\n\nOCSP_CERTID *OCSP_cert_id_new(const EVP_MD *dgst,\n const X509_NAME *issuerName,\n const ASN1_BIT_STRING *issuerKey,\n const ASN1_INTEGER *serialNumber);\n\nOCSP_ONEREQ *OCSP_request_add0_id(OCSP_REQUEST *req, OCSP_CERTID *cid);\n\nint OCSP_request_add1_nonce(OCSP_REQUEST *req, unsigned char *val, int len);\nint OCSP_basic_add1_nonce(OCSP_BASICRESP *resp, unsigned char *val, int len);\nint OCSP_check_nonce(OCSP_REQUEST *req, OCSP_BASICRESP *bs);\nint OCSP_copy_nonce(OCSP_BASICRESP *resp, OCSP_REQUEST *req);\n\nint OCSP_request_set1_name(OCSP_REQUEST *req, X509_NAME *nm);\nint OCSP_request_add1_cert(OCSP_REQUEST *req, X509 *cert);\n\nint OCSP_request_sign(OCSP_REQUEST *req,\n X509 *signer,\n EVP_PKEY *key,\n const EVP_MD *dgst,\n STACK_OF(X509) *certs, unsigned long flags);\n\nint OCSP_response_status(OCSP_RESPONSE *resp);\nOCSP_BASICRESP *OCSP_response_get1_basic(OCSP_RESPONSE *resp);\n\nconst ASN1_OCTET_STRING *OCSP_resp_get0_signature(const OCSP_BASICRESP *bs);\nconst X509_ALGOR *OCSP_resp_get0_tbs_sigalg(const OCSP_BASICRESP *bs);\nconst OCSP_RESPDATA *OCSP_resp_get0_respdata(const OCSP_BASICRESP *bs);\nint OCSP_resp_get0_signer(OCSP_BASICRESP *bs, X509 **signer,\n STACK_OF(X509) *extra_certs);\n\nint OCSP_resp_count(OCSP_BASICRESP *bs);\nOCSP_SINGLERESP *OCSP_resp_get0(OCSP_BASICRESP *bs, int idx);\nconst ASN1_GENERALIZEDTIME *OCSP_resp_get0_produced_at(const OCSP_BASICRESP* bs);\nconst STACK_OF(X509) *OCSP_resp_get0_certs(const OCSP_BASICRESP *bs);\nint OCSP_resp_get0_id(const OCSP_BASICRESP *bs,\n const ASN1_OCTET_STRING **pid,\n const X509_NAME **pname);\nint OCSP_resp_get1_id(const OCSP_BASICRESP *bs,\n ASN1_OCTET_STRING **pid,\n X509_NAME **pname);\n\nint OCSP_resp_find(OCSP_BASICRESP *bs, OCSP_CERTID *id, int last);\nint OCSP_single_get0_status(OCSP_SINGLERESP *single, int *reason,\n ASN1_GENERALIZEDTIME **revtime,\n ASN1_GENERALIZEDTIME **thisupd,\n ASN1_GENERALIZEDTIME **nextupd);\nint OCSP_resp_find_status(OCSP_BASICRESP *bs, OCSP_CERTID *id, int *status,\n int *reason,\n ASN1_GENERALIZEDTIME **revtime,\n ASN1_GENERALIZEDTIME **thisupd,\n ASN1_GENERALIZEDTIME **nextupd);\nint OCSP_check_validity(ASN1_GENERALIZEDTIME *thisupd,\n ASN1_GENERALIZEDTIME *nextupd, long sec, long maxsec);\n\nint OCSP_request_verify(OCSP_REQUEST *req, STACK_OF(X509) *certs,\n X509_STORE *store, unsigned long flags);\n\nint OCSP_parse_url(const char *url, char **phost, char **pport, char **ppath,\n int *pssl);\n\nint OCSP_id_issuer_cmp(const OCSP_CERTID *a, const OCSP_CERTID *b);\nint OCSP_id_cmp(const OCSP_CERTID *a, const OCSP_CERTID *b);\n\nint OCSP_request_onereq_count(OCSP_REQUEST *req);\nOCSP_ONEREQ *OCSP_request_onereq_get0(OCSP_REQUEST *req, int i);\nOCSP_CERTID *OCSP_onereq_get0_id(OCSP_ONEREQ *one);\nint OCSP_id_get0_info(ASN1_OCTET_STRING **piNameHash, ASN1_OBJECT **pmd,\n ASN1_OCTET_STRING **pikeyHash,\n ASN1_INTEGER **pserial, OCSP_CERTID *cid);\nint OCSP_request_is_signed(OCSP_REQUEST *req);\nOCSP_RESPONSE *OCSP_response_create(int status, OCSP_BASICRESP *bs);\nOCSP_SINGLERESP *OCSP_basic_add1_status(OCSP_BASICRESP *rsp,\n OCSP_CERTID *cid,\n int status, int reason,\n ASN1_TIME *revtime,\n ASN1_TIME *thisupd,\n ASN1_TIME *nextupd);\nint OCSP_basic_add1_cert(OCSP_BASICRESP *resp, X509 *cert);\nint OCSP_basic_sign(OCSP_BASICRESP *brsp,\n X509 *signer, EVP_PKEY *key, const EVP_MD *dgst,\n STACK_OF(X509) *certs, unsigned long flags);\nint OCSP_basic_sign_ctx(OCSP_BASICRESP *brsp,\n X509 *signer, EVP_MD_CTX *ctx,\n STACK_OF(X509) *certs, unsigned long flags);\nint OCSP_RESPID_set_by_name(OCSP_RESPID *respid, X509 *cert);\nint OCSP_RESPID_set_by_key(OCSP_RESPID *respid, X509 *cert);\nint OCSP_RESPID_match(OCSP_RESPID *respid, X509 *cert);\n\nX509_EXTENSION *OCSP_crlID_new(const char *url, long *n, char *tim);\n\nX509_EXTENSION *OCSP_accept_responses_new(char **oids);\n\nX509_EXTENSION *OCSP_archive_cutoff_new(char *tim);\n\nX509_EXTENSION *OCSP_url_svcloc_new(X509_NAME *issuer, const char **urls);\n\nint OCSP_REQUEST_get_ext_count(OCSP_REQUEST *x);\nint OCSP_REQUEST_get_ext_by_NID(OCSP_REQUEST *x, int nid, int lastpos);\nint OCSP_REQUEST_get_ext_by_OBJ(OCSP_REQUEST *x, const ASN1_OBJECT *obj,\n int lastpos);\nint OCSP_REQUEST_get_ext_by_critical(OCSP_REQUEST *x, int crit, int lastpos);\nX509_EXTENSION *OCSP_REQUEST_get_ext(OCSP_REQUEST *x, int loc);\nX509_EXTENSION *OCSP_REQUEST_delete_ext(OCSP_REQUEST *x, int loc);\nvoid *OCSP_REQUEST_get1_ext_d2i(OCSP_REQUEST *x, int nid, int *crit,\n int *idx);\nint OCSP_REQUEST_add1_ext_i2d(OCSP_REQUEST *x, int nid, void *value, int crit,\n unsigned long flags);\nint OCSP_REQUEST_add_ext(OCSP_REQUEST *x, X509_EXTENSION *ex, int loc);\n\nint OCSP_ONEREQ_get_ext_count(OCSP_ONEREQ *x);\nint OCSP_ONEREQ_get_ext_by_NID(OCSP_ONEREQ *x, int nid, int lastpos);\nint OCSP_ONEREQ_get_ext_by_OBJ(OCSP_ONEREQ *x, const ASN1_OBJECT *obj, int lastpos);\nint OCSP_ONEREQ_get_ext_by_critical(OCSP_ONEREQ *x, int crit, int lastpos);\nX509_EXTENSION *OCSP_ONEREQ_get_ext(OCSP_ONEREQ *x, int loc);\nX509_EXTENSION *OCSP_ONEREQ_delete_ext(OCSP_ONEREQ *x, int loc);\nvoid *OCSP_ONEREQ_get1_ext_d2i(OCSP_ONEREQ *x, int nid, int *crit, int *idx);\nint OCSP_ONEREQ_add1_ext_i2d(OCSP_ONEREQ *x, int nid, void *value, int crit,\n unsigned long flags);\nint OCSP_ONEREQ_add_ext(OCSP_ONEREQ *x, X509_EXTENSION *ex, int loc);\n\nint OCSP_BASICRESP_get_ext_count(OCSP_BASICRESP *x);\nint OCSP_BASICRESP_get_ext_by_NID(OCSP_BASICRESP *x, int nid, int lastpos);\nint OCSP_BASICRESP_get_ext_by_OBJ(OCSP_BASICRESP *x, const ASN1_OBJECT *obj,\n int lastpos);\nint OCSP_BASICRESP_get_ext_by_critical(OCSP_BASICRESP *x, int crit,\n int lastpos);\nX509_EXTENSION *OCSP_BASICRESP_get_ext(OCSP_BASICRESP *x, int loc);\nX509_EXTENSION *OCSP_BASICRESP_delete_ext(OCSP_BASICRESP *x, int loc);\nvoid *OCSP_BASICRESP_get1_ext_d2i(OCSP_BASICRESP *x, int nid, int *crit,\n int *idx);\nint OCSP_BASICRESP_add1_ext_i2d(OCSP_BASICRESP *x, int nid, void *value,\n int crit, unsigned long flags);\nint OCSP_BASICRESP_add_ext(OCSP_BASICRESP *x, X509_EXTENSION *ex, int loc);\n\nint OCSP_SINGLERESP_get_ext_count(OCSP_SINGLERESP *x);\nint OCSP_SINGLERESP_get_ext_by_NID(OCSP_SINGLERESP *x, int nid, int lastpos);\nint OCSP_SINGLERESP_get_ext_by_OBJ(OCSP_SINGLERESP *x, const ASN1_OBJECT *obj,\n int lastpos);\nint OCSP_SINGLERESP_get_ext_by_critical(OCSP_SINGLERESP *x, int crit,\n int lastpos);\nX509_EXTENSION *OCSP_SINGLERESP_get_ext(OCSP_SINGLERESP *x, int loc);\nX509_EXTENSION *OCSP_SINGLERESP_delete_ext(OCSP_SINGLERESP *x, int loc);\nvoid *OCSP_SINGLERESP_get1_ext_d2i(OCSP_SINGLERESP *x, int nid, int *crit,\n int *idx);\nint OCSP_SINGLERESP_add1_ext_i2d(OCSP_SINGLERESP *x, int nid, void *value,\n int crit, unsigned long flags);\nint OCSP_SINGLERESP_add_ext(OCSP_SINGLERESP *x, X509_EXTENSION *ex, int loc);\nconst OCSP_CERTID *OCSP_SINGLERESP_get0_id(const OCSP_SINGLERESP *x);\n\nDECLARE_ASN1_FUNCTIONS(OCSP_SINGLERESP)\nDECLARE_ASN1_FUNCTIONS(OCSP_CERTSTATUS)\nDECLARE_ASN1_FUNCTIONS(OCSP_REVOKEDINFO)\nDECLARE_ASN1_FUNCTIONS(OCSP_BASICRESP)\nDECLARE_ASN1_FUNCTIONS(OCSP_RESPDATA)\nDECLARE_ASN1_FUNCTIONS(OCSP_RESPID)\nDECLARE_ASN1_FUNCTIONS(OCSP_RESPONSE)\nDECLARE_ASN1_FUNCTIONS(OCSP_RESPBYTES)\nDECLARE_ASN1_FUNCTIONS(OCSP_ONEREQ)\nDECLARE_ASN1_FUNCTIONS(OCSP_CERTID)\nDECLARE_ASN1_FUNCTIONS(OCSP_REQUEST)\nDECLARE_ASN1_FUNCTIONS(OCSP_SIGNATURE)\nDECLARE_ASN1_FUNCTIONS(OCSP_REQINFO)\nDECLARE_ASN1_FUNCTIONS(OCSP_CRLID)\nDECLARE_ASN1_FUNCTIONS(OCSP_SERVICELOC)\n\nconst char *OCSP_response_status_str(long s);\nconst char *OCSP_cert_status_str(long s);\nconst char *OCSP_crl_reason_str(long s);\n\nint OCSP_REQUEST_print(BIO *bp, OCSP_REQUEST *a, unsigned long flags);\nint OCSP_RESPONSE_print(BIO *bp, OCSP_RESPONSE *o, unsigned long flags);\n\nint OCSP_basic_verify(OCSP_BASICRESP *bs, STACK_OF(X509) *certs,\n X509_STORE *st, unsigned long flags);\n\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/ocsperr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_OCSPERR_H\n# define HEADER_OCSPERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# include \n\n# ifndef OPENSSL_NO_OCSP\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_OCSP_strings(void);\n\n/*\n * OCSP function codes.\n */\n# define OCSP_F_D2I_OCSP_NONCE 102\n# define OCSP_F_OCSP_BASIC_ADD1_STATUS 103\n# define OCSP_F_OCSP_BASIC_SIGN 104\n# define OCSP_F_OCSP_BASIC_SIGN_CTX 119\n# define OCSP_F_OCSP_BASIC_VERIFY 105\n# define OCSP_F_OCSP_CERT_ID_NEW 101\n# define OCSP_F_OCSP_CHECK_DELEGATED 106\n# define OCSP_F_OCSP_CHECK_IDS 107\n# define OCSP_F_OCSP_CHECK_ISSUER 108\n# define OCSP_F_OCSP_CHECK_VALIDITY 115\n# define OCSP_F_OCSP_MATCH_ISSUERID 109\n# define OCSP_F_OCSP_PARSE_URL 114\n# define OCSP_F_OCSP_REQUEST_SIGN 110\n# define OCSP_F_OCSP_REQUEST_VERIFY 116\n# define OCSP_F_OCSP_RESPONSE_GET1_BASIC 111\n# define OCSP_F_PARSE_HTTP_LINE1 118\n\n/*\n * OCSP reason codes.\n */\n# define OCSP_R_CERTIFICATE_VERIFY_ERROR 101\n# define OCSP_R_DIGEST_ERR 102\n# define OCSP_R_ERROR_IN_NEXTUPDATE_FIELD 122\n# define OCSP_R_ERROR_IN_THISUPDATE_FIELD 123\n# define OCSP_R_ERROR_PARSING_URL 121\n# define OCSP_R_MISSING_OCSPSIGNING_USAGE 103\n# define OCSP_R_NEXTUPDATE_BEFORE_THISUPDATE 124\n# define OCSP_R_NOT_BASIC_RESPONSE 104\n# define OCSP_R_NO_CERTIFICATES_IN_CHAIN 105\n# define OCSP_R_NO_RESPONSE_DATA 108\n# define OCSP_R_NO_REVOKED_TIME 109\n# define OCSP_R_NO_SIGNER_KEY 130\n# define OCSP_R_PRIVATE_KEY_DOES_NOT_MATCH_CERTIFICATE 110\n# define OCSP_R_REQUEST_NOT_SIGNED 128\n# define OCSP_R_RESPONSE_CONTAINS_NO_REVOCATION_DATA 111\n# define OCSP_R_ROOT_CA_NOT_TRUSTED 112\n# define OCSP_R_SERVER_RESPONSE_ERROR 114\n# define OCSP_R_SERVER_RESPONSE_PARSE_ERROR 115\n# define OCSP_R_SIGNATURE_FAILURE 117\n# define OCSP_R_SIGNER_CERTIFICATE_NOT_FOUND 118\n# define OCSP_R_STATUS_EXPIRED 125\n# define OCSP_R_STATUS_NOT_YET_VALID 126\n# define OCSP_R_STATUS_TOO_OLD 127\n# define OCSP_R_UNKNOWN_MESSAGE_DIGEST 119\n# define OCSP_R_UNKNOWN_NID 120\n# define OCSP_R_UNSUPPORTED_REQUESTORNAME_TYPE 129\n\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/opensslconf.h", "content": "/*\n * WARNING: do not edit!\n * Generated by Makefile from include/openssl/opensslconf.h.in\n *\n * Copyright 2016-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n#ifdef OPENSSL_ALGORITHM_DEFINES\n# error OPENSSL_ALGORITHM_DEFINES no longer supported\n#endif\n\n/*\n * OpenSSL was configured with the following options:\n */\n\n#ifndef OPENSSL_NO_COMP\n# define OPENSSL_NO_COMP\n#endif\n#ifndef OPENSSL_NO_IDEA\n# define OPENSSL_NO_IDEA\n#endif\n#ifndef OPENSSL_NO_MD2\n# define OPENSSL_NO_MD2\n#endif\n#ifndef OPENSSL_NO_RC5\n# define OPENSSL_NO_RC5\n#endif\n#ifndef OPENSSL_NO_SRP\n# define OPENSSL_NO_SRP\n#endif\n#ifndef OPENSSL_RAND_SEED_OS\n# define OPENSSL_RAND_SEED_OS\n#endif\n#ifndef OPENSSL_NO_AFALGENG\n# define OPENSSL_NO_AFALGENG\n#endif\n#ifndef OPENSSL_NO_ASAN\n# define OPENSSL_NO_ASAN\n#endif\n#ifndef OPENSSL_NO_ASM\n# define OPENSSL_NO_ASM\n#endif\n#ifndef OPENSSL_NO_CRYPTO_MDEBUG\n# define OPENSSL_NO_CRYPTO_MDEBUG\n#endif\n#ifndef OPENSSL_NO_CRYPTO_MDEBUG_BACKTRACE\n# define OPENSSL_NO_CRYPTO_MDEBUG_BACKTRACE\n#endif\n#ifndef OPENSSL_NO_DEVCRYPTOENG\n# define OPENSSL_NO_DEVCRYPTOENG\n#endif\n#ifndef OPENSSL_NO_DSO\n# define OPENSSL_NO_DSO\n#endif\n#ifndef OPENSSL_NO_DTLS\n# define OPENSSL_NO_DTLS\n#endif\n#ifndef OPENSSL_NO_DTLS1\n# define OPENSSL_NO_DTLS1\n#endif\n#ifndef OPENSSL_NO_DTLS1_2\n# define OPENSSL_NO_DTLS1_2\n#endif\n#ifndef OPENSSL_NO_EC2M\n# define OPENSSL_NO_EC2M\n#endif\n#ifndef OPENSSL_NO_EC_NISTP_64_GCC_128\n# define OPENSSL_NO_EC_NISTP_64_GCC_128\n#endif\n#ifndef OPENSSL_NO_EGD\n# define OPENSSL_NO_EGD\n#endif\n#ifndef OPENSSL_NO_ENGINE\n# define OPENSSL_NO_ENGINE\n#endif\n#ifndef OPENSSL_NO_ERR\n# define OPENSSL_NO_ERR\n#endif\n#ifndef OPENSSL_NO_EXTERNAL_TESTS\n# define OPENSSL_NO_EXTERNAL_TESTS\n#endif\n#ifndef OPENSSL_NO_FUZZ_AFL\n# define OPENSSL_NO_FUZZ_AFL\n#endif\n#ifndef OPENSSL_NO_FUZZ_LIBFUZZER\n# define OPENSSL_NO_FUZZ_LIBFUZZER\n#endif\n#ifndef OPENSSL_NO_HEARTBEATS\n# define OPENSSL_NO_HEARTBEATS\n#endif\n#ifndef OPENSSL_NO_HW\n# define OPENSSL_NO_HW\n#endif\n#ifndef OPENSSL_NO_MSAN\n# define OPENSSL_NO_MSAN\n#endif\n#ifndef OPENSSL_NO_NEXTPROTONEG\n# define OPENSSL_NO_NEXTPROTONEG\n#endif\n#ifndef OPENSSL_NO_PSK\n# define OPENSSL_NO_PSK\n#endif\n#ifndef OPENSSL_NO_SCTP\n# define OPENSSL_NO_SCTP\n#endif\n#ifndef OPENSSL_NO_SSL_TRACE\n# define OPENSSL_NO_SSL_TRACE\n#endif\n#ifndef OPENSSL_NO_SSL3\n# define OPENSSL_NO_SSL3\n#endif\n#ifndef OPENSSL_NO_SSL3_METHOD\n# define OPENSSL_NO_SSL3_METHOD\n#endif\n#ifndef OPENSSL_NO_UBSAN\n# define OPENSSL_NO_UBSAN\n#endif\n#ifndef OPENSSL_NO_UNIT_TEST\n# define OPENSSL_NO_UNIT_TEST\n#endif\n#ifndef OPENSSL_NO_WEAK_SSL_CIPHERS\n# define OPENSSL_NO_WEAK_SSL_CIPHERS\n#endif\n#ifndef OPENSSL_NO_DYNAMIC_ENGINE\n# define OPENSSL_NO_DYNAMIC_ENGINE\n#endif\n\n\n/*\n * Sometimes OPENSSSL_NO_xxx ends up with an empty file and some compilers\n * don't like that. This will hopefully silence them.\n */\n#define NON_EMPTY_TRANSLATION_UNIT static void *dummy = &dummy;\n\n/*\n * Applications should use -DOPENSSL_API_COMPAT= to suppress the\n * declarations of functions deprecated in or before . Otherwise, they\n * still won't see them if the library has been built to disable deprecated\n * functions.\n */\n#ifndef DECLARE_DEPRECATED\n# define DECLARE_DEPRECATED(f) f;\n# ifdef __GNUC__\n# if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ > 0)\n# undef DECLARE_DEPRECATED\n# define DECLARE_DEPRECATED(f) f __attribute__ ((deprecated));\n# endif\n# elif defined(__SUNPRO_C)\n# if (__SUNPRO_C >= 0x5130)\n# undef DECLARE_DEPRECATED\n# define DECLARE_DEPRECATED(f) f __attribute__ ((deprecated));\n# endif\n# endif\n#endif\n\n#ifndef OPENSSL_FILE\n# ifdef OPENSSL_NO_FILENAMES\n# define OPENSSL_FILE \"\"\n# define OPENSSL_LINE 0\n# else\n# define OPENSSL_FILE __FILE__\n# define OPENSSL_LINE __LINE__\n# endif\n#endif\n\n#ifndef OPENSSL_MIN_API\n# define OPENSSL_MIN_API 0\n#endif\n\n#if !defined(OPENSSL_API_COMPAT) || OPENSSL_API_COMPAT < OPENSSL_MIN_API\n# undef OPENSSL_API_COMPAT\n# define OPENSSL_API_COMPAT OPENSSL_MIN_API\n#endif\n\n/*\n * Do not deprecate things to be deprecated in version 1.2.0 before the\n * OpenSSL version number matches.\n */\n#if OPENSSL_VERSION_NUMBER < 0x10200000L\n# define DEPRECATEDIN_1_2_0(f) f;\n#elif OPENSSL_API_COMPAT < 0x10200000L\n# define DEPRECATEDIN_1_2_0(f) DECLARE_DEPRECATED(f)\n#else\n# define DEPRECATEDIN_1_2_0(f)\n#endif\n\n#if OPENSSL_API_COMPAT < 0x10100000L\n# define DEPRECATEDIN_1_1_0(f) DECLARE_DEPRECATED(f)\n#else\n# define DEPRECATEDIN_1_1_0(f)\n#endif\n\n#if OPENSSL_API_COMPAT < 0x10000000L\n# define DEPRECATEDIN_1_0_0(f) DECLARE_DEPRECATED(f)\n#else\n# define DEPRECATEDIN_1_0_0(f)\n#endif\n\n#if OPENSSL_API_COMPAT < 0x00908000L\n# define DEPRECATEDIN_0_9_8(f) DECLARE_DEPRECATED(f)\n#else\n# define DEPRECATEDIN_0_9_8(f)\n#endif\n\n/* Generate 80386 code? */\n#undef I386_ONLY\n\n#undef OPENSSL_UNISTD\n#define OPENSSL_UNISTD \n\n#undef OPENSSL_EXPORT_VAR_AS_FUNCTION\n\n/*\n * The following are cipher-specific, but are part of the public API.\n */\n#if !defined(OPENSSL_SYS_UEFI)\n# undef BN_LLONG\n/* Only one for the following should be defined */\n# define SIXTY_FOUR_BIT_LONG\n# undef SIXTY_FOUR_BIT\n# undef THIRTY_TWO_BIT\n#endif\n\n#define RC4_INT unsigned int\n\n#ifdef __cplusplus\n}\n#endif\n" }, { "path": "cryptomini/include/openssl/opensslconf.h.in", "content": "/*\n * {- join(\"\\n * \", @autowarntext) -}\n *\n * Copyright 2016-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n#ifdef OPENSSL_ALGORITHM_DEFINES\n# error OPENSSL_ALGORITHM_DEFINES no longer supported\n#endif\n\n/*\n * OpenSSL was configured with the following options:\n */\n\n{- if (@{$config{openssl_sys_defines}}) {\n foreach (@{$config{openssl_sys_defines}}) {\n\t$OUT .= \"#ifndef $_\\n\";\n\t$OUT .= \"# define $_ 1\\n\";\n\t$OUT .= \"#endif\\n\";\n }\n }\n foreach (@{$config{openssl_api_defines}}) {\n (my $macro, my $value) = $_ =~ /^(.*?)=(.*?)$/;\n $OUT .= \"#define $macro $value\\n\";\n }\n if (@{$config{openssl_algorithm_defines}}) {\n foreach (@{$config{openssl_algorithm_defines}}) {\n\t$OUT .= \"#ifndef $_\\n\";\n\t$OUT .= \"# define $_\\n\";\n\t$OUT .= \"#endif\\n\";\n }\n }\n if (@{$config{openssl_thread_defines}}) {\n foreach (@{$config{openssl_thread_defines}}) {\n\t$OUT .= \"#ifndef $_\\n\";\n\t$OUT .= \"# define $_\\n\";\n\t$OUT .= \"#endif\\n\";\n }\n }\n if (@{$config{openssl_other_defines}}) {\n foreach (@{$config{openssl_other_defines}}) {\n\t$OUT .= \"#ifndef $_\\n\";\n\t$OUT .= \"# define $_\\n\";\n\t$OUT .= \"#endif\\n\";\n }\n }\n \"\";\n-}\n\n/*\n * Sometimes OPENSSSL_NO_xxx ends up with an empty file and some compilers\n * don't like that. This will hopefully silence them.\n */\n#define NON_EMPTY_TRANSLATION_UNIT static void *dummy = &dummy;\n\n/*\n * Applications should use -DOPENSSL_API_COMPAT= to suppress the\n * declarations of functions deprecated in or before . Otherwise, they\n * still won't see them if the library has been built to disable deprecated\n * functions.\n */\n#ifndef DECLARE_DEPRECATED\n# define DECLARE_DEPRECATED(f) f;\n# ifdef __GNUC__\n# if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ > 0)\n# undef DECLARE_DEPRECATED\n# define DECLARE_DEPRECATED(f) f __attribute__ ((deprecated));\n# endif\n# elif defined(__SUNPRO_C)\n# if (__SUNPRO_C >= 0x5130)\n# undef DECLARE_DEPRECATED\n# define DECLARE_DEPRECATED(f) f __attribute__ ((deprecated));\n# endif\n# endif\n#endif\n\n#ifndef OPENSSL_FILE\n# ifdef OPENSSL_NO_FILENAMES\n# define OPENSSL_FILE \"\"\n# define OPENSSL_LINE 0\n# else\n# define OPENSSL_FILE __FILE__\n# define OPENSSL_LINE __LINE__\n# endif\n#endif\n\n#ifndef OPENSSL_MIN_API\n# define OPENSSL_MIN_API 0\n#endif\n\n#if !defined(OPENSSL_API_COMPAT) || OPENSSL_API_COMPAT < OPENSSL_MIN_API\n# undef OPENSSL_API_COMPAT\n# define OPENSSL_API_COMPAT OPENSSL_MIN_API\n#endif\n\n/*\n * Do not deprecate things to be deprecated in version 1.2.0 before the\n * OpenSSL version number matches.\n */\n#if OPENSSL_VERSION_NUMBER < 0x10200000L\n# define DEPRECATEDIN_1_2_0(f) f;\n#elif OPENSSL_API_COMPAT < 0x10200000L\n# define DEPRECATEDIN_1_2_0(f) DECLARE_DEPRECATED(f)\n#else\n# define DEPRECATEDIN_1_2_0(f)\n#endif\n\n#if OPENSSL_API_COMPAT < 0x10100000L\n# define DEPRECATEDIN_1_1_0(f) DECLARE_DEPRECATED(f)\n#else\n# define DEPRECATEDIN_1_1_0(f)\n#endif\n\n#if OPENSSL_API_COMPAT < 0x10000000L\n# define DEPRECATEDIN_1_0_0(f) DECLARE_DEPRECATED(f)\n#else\n# define DEPRECATEDIN_1_0_0(f)\n#endif\n\n#if OPENSSL_API_COMPAT < 0x00908000L\n# define DEPRECATEDIN_0_9_8(f) DECLARE_DEPRECATED(f)\n#else\n# define DEPRECATEDIN_0_9_8(f)\n#endif\n\n/* Generate 80386 code? */\n{- $config{processor} eq \"386\" ? \"#define\" : \"#undef\" -} I386_ONLY\n\n#undef OPENSSL_UNISTD\n#define OPENSSL_UNISTD {- $target{unistd} -}\n\n{- $config{export_var_as_fn} ? \"#define\" : \"#undef\" -} OPENSSL_EXPORT_VAR_AS_FUNCTION\n\n/*\n * The following are cipher-specific, but are part of the public API.\n */\n#if !defined(OPENSSL_SYS_UEFI)\n{- $config{bn_ll} ? \"# define\" : \"# undef\" -} BN_LLONG\n/* Only one for the following should be defined */\n{- $config{b64l} ? \"# define\" : \"# undef\" -} SIXTY_FOUR_BIT_LONG\n{- $config{b64} ? \"# define\" : \"# undef\" -} SIXTY_FOUR_BIT\n{- $config{b32} ? \"# define\" : \"# undef\" -} THIRTY_TWO_BIT\n#endif\n\n#define RC4_INT {- $config{rc4_int} -}\n\n#ifdef __cplusplus\n}\n#endif\n" }, { "path": "cryptomini/include/openssl/opensslv.h", "content": "/*\n * Copyright 1999-2022 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_OPENSSLV_H\n# define HEADER_OPENSSLV_H\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/*-\n * Numeric release version identifier:\n * MNNFFPPS: major minor fix patch status\n * The status nibble has one of the values 0 for development, 1 to e for betas\n * 1 to 14, and f for release. The patch level is exactly that.\n * For example:\n * 0.9.3-dev 0x00903000\n * 0.9.3-beta1 0x00903001\n * 0.9.3-beta2-dev 0x00903002\n * 0.9.3-beta2 0x00903002 (same as ...beta2-dev)\n * 0.9.3 0x0090300f\n * 0.9.3a 0x0090301f\n * 0.9.4 0x0090400f\n * 1.2.3z 0x102031af\n *\n * For continuity reasons (because 0.9.5 is already out, and is coded\n * 0x00905100), between 0.9.5 and 0.9.6 the coding of the patch level\n * part is slightly different, by setting the highest bit. This means\n * that 0.9.5a looks like this: 0x0090581f. At 0.9.6, we can start\n * with 0x0090600S...\n *\n * (Prior to 0.9.3-dev a different scheme was used: 0.9.2b is 0x0922.)\n * (Prior to 0.9.5a beta1, a different scheme was used: MMNNFFRBB for\n * major minor fix final patch/beta)\n */\n# define OPENSSL_VERSION_NUMBER 0x101010ffL\n# define OPENSSL_VERSION_TEXT \"OpenSSL 1.1.1o 3 May 2022\"\n\n/*-\n * The macros below are to be used for shared library (.so, .dll, ...)\n * versioning. That kind of versioning works a bit differently between\n * operating systems. The most usual scheme is to set a major and a minor\n * number, and have the runtime loader check that the major number is equal\n * to what it was at application link time, while the minor number has to\n * be greater or equal to what it was at application link time. With this\n * scheme, the version number is usually part of the file name, like this:\n *\n * libcrypto.so.0.9\n *\n * Some unixen also make a softlink with the major version number only:\n *\n * libcrypto.so.0\n *\n * On Tru64 and IRIX 6.x it works a little bit differently. There, the\n * shared library version is stored in the file, and is actually a series\n * of versions, separated by colons. The rightmost version present in the\n * library when linking an application is stored in the application to be\n * matched at run time. When the application is run, a check is done to\n * see if the library version stored in the application matches any of the\n * versions in the version string of the library itself.\n * This version string can be constructed in any way, depending on what\n * kind of matching is desired. However, to implement the same scheme as\n * the one used in the other unixen, all compatible versions, from lowest\n * to highest, should be part of the string. Consecutive builds would\n * give the following versions strings:\n *\n * 3.0\n * 3.0:3.1\n * 3.0:3.1:3.2\n * 4.0\n * 4.0:4.1\n *\n * Notice how version 4 is completely incompatible with version, and\n * therefore give the breach you can see.\n *\n * There may be other schemes as well that I haven't yet discovered.\n *\n * So, here's the way it works here: first of all, the library version\n * number doesn't need at all to match the overall OpenSSL version.\n * However, it's nice and more understandable if it actually does.\n * The current library version is stored in the macro SHLIB_VERSION_NUMBER,\n * which is just a piece of text in the format \"M.m.e\" (Major, minor, edit).\n * For the sake of Tru64, IRIX, and any other OS that behaves in similar ways,\n * we need to keep a history of version numbers, which is done in the\n * macro SHLIB_VERSION_HISTORY. The numbers are separated by colons and\n * should only keep the versions that are binary compatible with the current.\n */\n# define SHLIB_VERSION_HISTORY \"\"\n# define SHLIB_VERSION_NUMBER \"1.1\"\n\n\n#ifdef __cplusplus\n}\n#endif\n#endif /* HEADER_OPENSSLV_H */\n" }, { "path": "cryptomini/include/openssl/ossl_typ.h", "content": "/*\n * Copyright 2001-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_OPENSSL_TYPES_H\n# define HEADER_OPENSSL_TYPES_H\n\n#include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# include \n\n# ifdef NO_ASN1_TYPEDEFS\n# define ASN1_INTEGER ASN1_STRING\n# define ASN1_ENUMERATED ASN1_STRING\n# define ASN1_BIT_STRING ASN1_STRING\n# define ASN1_OCTET_STRING ASN1_STRING\n# define ASN1_PRINTABLESTRING ASN1_STRING\n# define ASN1_T61STRING ASN1_STRING\n# define ASN1_IA5STRING ASN1_STRING\n# define ASN1_UTCTIME ASN1_STRING\n# define ASN1_GENERALIZEDTIME ASN1_STRING\n# define ASN1_TIME ASN1_STRING\n# define ASN1_GENERALSTRING ASN1_STRING\n# define ASN1_UNIVERSALSTRING ASN1_STRING\n# define ASN1_BMPSTRING ASN1_STRING\n# define ASN1_VISIBLESTRING ASN1_STRING\n# define ASN1_UTF8STRING ASN1_STRING\n# define ASN1_BOOLEAN int\n# define ASN1_NULL int\n# else\ntypedef struct asn1_string_st ASN1_INTEGER;\ntypedef struct asn1_string_st ASN1_ENUMERATED;\ntypedef struct asn1_string_st ASN1_BIT_STRING;\ntypedef struct asn1_string_st ASN1_OCTET_STRING;\ntypedef struct asn1_string_st ASN1_PRINTABLESTRING;\ntypedef struct asn1_string_st ASN1_T61STRING;\ntypedef struct asn1_string_st ASN1_IA5STRING;\ntypedef struct asn1_string_st ASN1_GENERALSTRING;\ntypedef struct asn1_string_st ASN1_UNIVERSALSTRING;\ntypedef struct asn1_string_st ASN1_BMPSTRING;\ntypedef struct asn1_string_st ASN1_UTCTIME;\ntypedef struct asn1_string_st ASN1_TIME;\ntypedef struct asn1_string_st ASN1_GENERALIZEDTIME;\ntypedef struct asn1_string_st ASN1_VISIBLESTRING;\ntypedef struct asn1_string_st ASN1_UTF8STRING;\ntypedef struct asn1_string_st ASN1_STRING;\ntypedef int ASN1_BOOLEAN;\ntypedef int ASN1_NULL;\n# endif\n\ntypedef struct asn1_object_st ASN1_OBJECT;\n\ntypedef struct ASN1_ITEM_st ASN1_ITEM;\ntypedef struct asn1_pctx_st ASN1_PCTX;\ntypedef struct asn1_sctx_st ASN1_SCTX;\n\n# ifdef _WIN32\n# undef X509_NAME\n# undef X509_EXTENSIONS\n# undef PKCS7_ISSUER_AND_SERIAL\n# undef PKCS7_SIGNER_INFO\n# undef OCSP_REQUEST\n# undef OCSP_RESPONSE\n# endif\n\n# ifdef BIGNUM\n# undef BIGNUM\n# endif\nstruct dane_st;\ntypedef struct bio_st BIO;\ntypedef struct bignum_st BIGNUM;\ntypedef struct bignum_ctx BN_CTX;\ntypedef struct bn_blinding_st BN_BLINDING;\ntypedef struct bn_mont_ctx_st BN_MONT_CTX;\ntypedef struct bn_recp_ctx_st BN_RECP_CTX;\ntypedef struct bn_gencb_st BN_GENCB;\n\ntypedef struct buf_mem_st BUF_MEM;\n\ntypedef struct evp_cipher_st EVP_CIPHER;\ntypedef struct evp_cipher_ctx_st EVP_CIPHER_CTX;\ntypedef struct evp_md_st EVP_MD;\ntypedef struct evp_md_ctx_st EVP_MD_CTX;\ntypedef struct evp_pkey_st EVP_PKEY;\n\ntypedef struct evp_pkey_asn1_method_st EVP_PKEY_ASN1_METHOD;\n\ntypedef struct evp_pkey_method_st EVP_PKEY_METHOD;\ntypedef struct evp_pkey_ctx_st EVP_PKEY_CTX;\n\ntypedef struct evp_Encode_Ctx_st EVP_ENCODE_CTX;\n\ntypedef struct hmac_ctx_st HMAC_CTX;\n\ntypedef struct dh_st DH;\ntypedef struct dh_method DH_METHOD;\n\ntypedef struct dsa_st DSA;\ntypedef struct dsa_method DSA_METHOD;\n\ntypedef struct rsa_st RSA;\ntypedef struct rsa_meth_st RSA_METHOD;\ntypedef struct rsa_pss_params_st RSA_PSS_PARAMS;\n\ntypedef struct ec_key_st EC_KEY;\ntypedef struct ec_key_method_st EC_KEY_METHOD;\n\ntypedef struct rand_meth_st RAND_METHOD;\ntypedef struct rand_drbg_st RAND_DRBG;\n\ntypedef struct ssl_dane_st SSL_DANE;\ntypedef struct x509_st X509;\ntypedef struct X509_algor_st X509_ALGOR;\ntypedef struct X509_crl_st X509_CRL;\ntypedef struct x509_crl_method_st X509_CRL_METHOD;\ntypedef struct x509_revoked_st X509_REVOKED;\ntypedef struct X509_name_st X509_NAME;\ntypedef struct X509_pubkey_st X509_PUBKEY;\ntypedef struct x509_store_st X509_STORE;\ntypedef struct x509_store_ctx_st X509_STORE_CTX;\n\ntypedef struct x509_object_st X509_OBJECT;\ntypedef struct x509_lookup_st X509_LOOKUP;\ntypedef struct x509_lookup_method_st X509_LOOKUP_METHOD;\ntypedef struct X509_VERIFY_PARAM_st X509_VERIFY_PARAM;\n\ntypedef struct x509_sig_info_st X509_SIG_INFO;\n\ntypedef struct pkcs8_priv_key_info_st PKCS8_PRIV_KEY_INFO;\n\ntypedef struct v3_ext_ctx X509V3_CTX;\ntypedef struct conf_st CONF;\ntypedef struct ossl_init_settings_st OPENSSL_INIT_SETTINGS;\n\ntypedef struct ui_st UI;\ntypedef struct ui_method_st UI_METHOD;\n\ntypedef struct engine_st ENGINE;\ntypedef struct ssl_st SSL;\ntypedef struct ssl_ctx_st SSL_CTX;\n\ntypedef struct comp_ctx_st COMP_CTX;\ntypedef struct comp_method_st COMP_METHOD;\n\ntypedef struct X509_POLICY_NODE_st X509_POLICY_NODE;\ntypedef struct X509_POLICY_LEVEL_st X509_POLICY_LEVEL;\ntypedef struct X509_POLICY_TREE_st X509_POLICY_TREE;\ntypedef struct X509_POLICY_CACHE_st X509_POLICY_CACHE;\n\ntypedef struct AUTHORITY_KEYID_st AUTHORITY_KEYID;\ntypedef struct DIST_POINT_st DIST_POINT;\ntypedef struct ISSUING_DIST_POINT_st ISSUING_DIST_POINT;\ntypedef struct NAME_CONSTRAINTS_st NAME_CONSTRAINTS;\n\ntypedef struct crypto_ex_data_st CRYPTO_EX_DATA;\n\ntypedef struct ocsp_req_ctx_st OCSP_REQ_CTX;\ntypedef struct ocsp_response_st OCSP_RESPONSE;\ntypedef struct ocsp_responder_id_st OCSP_RESPID;\n\ntypedef struct sct_st SCT;\ntypedef struct sct_ctx_st SCT_CTX;\ntypedef struct ctlog_st CTLOG;\ntypedef struct ctlog_store_st CTLOG_STORE;\ntypedef struct ct_policy_eval_ctx_st CT_POLICY_EVAL_CTX;\n\ntypedef struct ossl_store_info_st OSSL_STORE_INFO;\ntypedef struct ossl_store_search_st OSSL_STORE_SEARCH;\n\n#if defined(__STDC_VERSION__) && __STDC_VERSION__ >= 199901L && \\\n defined(INTMAX_MAX) && defined(UINTMAX_MAX)\ntypedef intmax_t ossl_intmax_t;\ntypedef uintmax_t ossl_uintmax_t;\n#else\n/*\n * Not long long, because the C-library can only be expected to provide\n * strtoll(), strtoull() at the same time as intmax_t and strtoimax(),\n * strtoumax(). Since we use these for parsing arguments, we need the\n * conversion functions, not just the sizes.\n */\ntypedef long ossl_intmax_t;\ntypedef unsigned long ossl_uintmax_t;\n#endif\n\n#ifdef __cplusplus\n}\n#endif\n#endif /* def HEADER_OPENSSL_TYPES_H */\n" }, { "path": "cryptomini/include/openssl/pem.h", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_PEM_H\n# define HEADER_PEM_H\n\n# include \n# include \n# include \n# include \n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# define PEM_BUFSIZE 1024\n\n# define PEM_STRING_X509_OLD \"X509 CERTIFICATE\"\n# define PEM_STRING_X509 \"CERTIFICATE\"\n# define PEM_STRING_X509_TRUSTED \"TRUSTED CERTIFICATE\"\n# define PEM_STRING_X509_REQ_OLD \"NEW CERTIFICATE REQUEST\"\n# define PEM_STRING_X509_REQ \"CERTIFICATE REQUEST\"\n# define PEM_STRING_X509_CRL \"X509 CRL\"\n# define PEM_STRING_EVP_PKEY \"ANY PRIVATE KEY\"\n# define PEM_STRING_PUBLIC \"PUBLIC KEY\"\n# define PEM_STRING_RSA \"RSA PRIVATE KEY\"\n# define PEM_STRING_RSA_PUBLIC \"RSA PUBLIC KEY\"\n# define PEM_STRING_DSA \"DSA PRIVATE KEY\"\n# define PEM_STRING_DSA_PUBLIC \"DSA PUBLIC KEY\"\n# define PEM_STRING_PKCS7 \"PKCS7\"\n# define PEM_STRING_PKCS7_SIGNED \"PKCS #7 SIGNED DATA\"\n# define PEM_STRING_PKCS8 \"ENCRYPTED PRIVATE KEY\"\n# define PEM_STRING_PKCS8INF \"PRIVATE KEY\"\n# define PEM_STRING_DHPARAMS \"DH PARAMETERS\"\n# define PEM_STRING_DHXPARAMS \"X9.42 DH PARAMETERS\"\n# define PEM_STRING_SSL_SESSION \"SSL SESSION PARAMETERS\"\n# define PEM_STRING_DSAPARAMS \"DSA PARAMETERS\"\n# define PEM_STRING_ECDSA_PUBLIC \"ECDSA PUBLIC KEY\"\n# define PEM_STRING_ECPARAMETERS \"EC PARAMETERS\"\n# define PEM_STRING_ECPRIVATEKEY \"EC PRIVATE KEY\"\n# define PEM_STRING_PARAMETERS \"PARAMETERS\"\n# define PEM_STRING_CMS \"CMS\"\n\n# define PEM_TYPE_ENCRYPTED 10\n# define PEM_TYPE_MIC_ONLY 20\n# define PEM_TYPE_MIC_CLEAR 30\n# define PEM_TYPE_CLEAR 40\n\n/*\n * These macros make the PEM_read/PEM_write functions easier to maintain and\n * write. Now they are all implemented with either: IMPLEMENT_PEM_rw(...) or\n * IMPLEMENT_PEM_rw_cb(...)\n */\n\n# ifdef OPENSSL_NO_STDIO\n\n# define IMPLEMENT_PEM_read_fp(name, type, str, asn1) /**/\n# define IMPLEMENT_PEM_write_fp(name, type, str, asn1) /**/\n# define IMPLEMENT_PEM_write_fp_const(name, type, str, asn1) /**/\n# define IMPLEMENT_PEM_write_cb_fp(name, type, str, asn1) /**/\n# define IMPLEMENT_PEM_write_cb_fp_const(name, type, str, asn1) /**/\n# else\n\n# define IMPLEMENT_PEM_read_fp(name, type, str, asn1) \\\ntype *PEM_read_##name(FILE *fp, type **x, pem_password_cb *cb, void *u)\\\n{ \\\nreturn PEM_ASN1_read((d2i_of_void *)d2i_##asn1, str,fp,(void **)x,cb,u); \\\n}\n\n# define IMPLEMENT_PEM_write_fp(name, type, str, asn1) \\\nint PEM_write_##name(FILE *fp, type *x) \\\n{ \\\nreturn PEM_ASN1_write((i2d_of_void *)i2d_##asn1,str,fp,x,NULL,NULL,0,NULL,NULL); \\\n}\n\n# define IMPLEMENT_PEM_write_fp_const(name, type, str, asn1) \\\nint PEM_write_##name(FILE *fp, const type *x) \\\n{ \\\nreturn PEM_ASN1_write((i2d_of_void *)i2d_##asn1,str,fp,(void *)x,NULL,NULL,0,NULL,NULL); \\\n}\n\n# define IMPLEMENT_PEM_write_cb_fp(name, type, str, asn1) \\\nint PEM_write_##name(FILE *fp, type *x, const EVP_CIPHER *enc, \\\n unsigned char *kstr, int klen, pem_password_cb *cb, \\\n void *u) \\\n { \\\n return PEM_ASN1_write((i2d_of_void *)i2d_##asn1,str,fp,x,enc,kstr,klen,cb,u); \\\n }\n\n# define IMPLEMENT_PEM_write_cb_fp_const(name, type, str, asn1) \\\nint PEM_write_##name(FILE *fp, type *x, const EVP_CIPHER *enc, \\\n unsigned char *kstr, int klen, pem_password_cb *cb, \\\n void *u) \\\n { \\\n return PEM_ASN1_write((i2d_of_void *)i2d_##asn1,str,fp,x,enc,kstr,klen,cb,u); \\\n }\n\n# endif\n\n# define IMPLEMENT_PEM_read_bio(name, type, str, asn1) \\\ntype *PEM_read_bio_##name(BIO *bp, type **x, pem_password_cb *cb, void *u)\\\n{ \\\nreturn PEM_ASN1_read_bio((d2i_of_void *)d2i_##asn1, str,bp,(void **)x,cb,u); \\\n}\n\n# define IMPLEMENT_PEM_write_bio(name, type, str, asn1) \\\nint PEM_write_bio_##name(BIO *bp, type *x) \\\n{ \\\nreturn PEM_ASN1_write_bio((i2d_of_void *)i2d_##asn1,str,bp,x,NULL,NULL,0,NULL,NULL); \\\n}\n\n# define IMPLEMENT_PEM_write_bio_const(name, type, str, asn1) \\\nint PEM_write_bio_##name(BIO *bp, const type *x) \\\n{ \\\nreturn PEM_ASN1_write_bio((i2d_of_void *)i2d_##asn1,str,bp,(void *)x,NULL,NULL,0,NULL,NULL); \\\n}\n\n# define IMPLEMENT_PEM_write_cb_bio(name, type, str, asn1) \\\nint PEM_write_bio_##name(BIO *bp, type *x, const EVP_CIPHER *enc, \\\n unsigned char *kstr, int klen, pem_password_cb *cb, void *u) \\\n { \\\n return PEM_ASN1_write_bio((i2d_of_void *)i2d_##asn1,str,bp,x,enc,kstr,klen,cb,u); \\\n }\n\n# define IMPLEMENT_PEM_write_cb_bio_const(name, type, str, asn1) \\\nint PEM_write_bio_##name(BIO *bp, type *x, const EVP_CIPHER *enc, \\\n unsigned char *kstr, int klen, pem_password_cb *cb, void *u) \\\n { \\\n return PEM_ASN1_write_bio((i2d_of_void *)i2d_##asn1,str,bp,(void *)x,enc,kstr,klen,cb,u); \\\n }\n\n# define IMPLEMENT_PEM_write(name, type, str, asn1) \\\n IMPLEMENT_PEM_write_bio(name, type, str, asn1) \\\n IMPLEMENT_PEM_write_fp(name, type, str, asn1)\n\n# define IMPLEMENT_PEM_write_const(name, type, str, asn1) \\\n IMPLEMENT_PEM_write_bio_const(name, type, str, asn1) \\\n IMPLEMENT_PEM_write_fp_const(name, type, str, asn1)\n\n# define IMPLEMENT_PEM_write_cb(name, type, str, asn1) \\\n IMPLEMENT_PEM_write_cb_bio(name, type, str, asn1) \\\n IMPLEMENT_PEM_write_cb_fp(name, type, str, asn1)\n\n# define IMPLEMENT_PEM_write_cb_const(name, type, str, asn1) \\\n IMPLEMENT_PEM_write_cb_bio_const(name, type, str, asn1) \\\n IMPLEMENT_PEM_write_cb_fp_const(name, type, str, asn1)\n\n# define IMPLEMENT_PEM_read(name, type, str, asn1) \\\n IMPLEMENT_PEM_read_bio(name, type, str, asn1) \\\n IMPLEMENT_PEM_read_fp(name, type, str, asn1)\n\n# define IMPLEMENT_PEM_rw(name, type, str, asn1) \\\n IMPLEMENT_PEM_read(name, type, str, asn1) \\\n IMPLEMENT_PEM_write(name, type, str, asn1)\n\n# define IMPLEMENT_PEM_rw_const(name, type, str, asn1) \\\n IMPLEMENT_PEM_read(name, type, str, asn1) \\\n IMPLEMENT_PEM_write_const(name, type, str, asn1)\n\n# define IMPLEMENT_PEM_rw_cb(name, type, str, asn1) \\\n IMPLEMENT_PEM_read(name, type, str, asn1) \\\n IMPLEMENT_PEM_write_cb(name, type, str, asn1)\n\n/* These are the same except they are for the declarations */\n\n# if defined(OPENSSL_NO_STDIO)\n\n# define DECLARE_PEM_read_fp(name, type) /**/\n# define DECLARE_PEM_write_fp(name, type) /**/\n# define DECLARE_PEM_write_fp_const(name, type) /**/\n# define DECLARE_PEM_write_cb_fp(name, type) /**/\n# else\n\n# define DECLARE_PEM_read_fp(name, type) \\\n type *PEM_read_##name(FILE *fp, type **x, pem_password_cb *cb, void *u);\n\n# define DECLARE_PEM_write_fp(name, type) \\\n int PEM_write_##name(FILE *fp, type *x);\n\n# define DECLARE_PEM_write_fp_const(name, type) \\\n int PEM_write_##name(FILE *fp, const type *x);\n\n# define DECLARE_PEM_write_cb_fp(name, type) \\\n int PEM_write_##name(FILE *fp, type *x, const EVP_CIPHER *enc, \\\n unsigned char *kstr, int klen, pem_password_cb *cb, void *u);\n\n# endif\n\n# define DECLARE_PEM_read_bio(name, type) \\\n type *PEM_read_bio_##name(BIO *bp, type **x, pem_password_cb *cb, void *u);\n\n# define DECLARE_PEM_write_bio(name, type) \\\n int PEM_write_bio_##name(BIO *bp, type *x);\n\n# define DECLARE_PEM_write_bio_const(name, type) \\\n int PEM_write_bio_##name(BIO *bp, const type *x);\n\n# define DECLARE_PEM_write_cb_bio(name, type) \\\n int PEM_write_bio_##name(BIO *bp, type *x, const EVP_CIPHER *enc, \\\n unsigned char *kstr, int klen, pem_password_cb *cb, void *u);\n\n# define DECLARE_PEM_write(name, type) \\\n DECLARE_PEM_write_bio(name, type) \\\n DECLARE_PEM_write_fp(name, type)\n# define DECLARE_PEM_write_const(name, type) \\\n DECLARE_PEM_write_bio_const(name, type) \\\n DECLARE_PEM_write_fp_const(name, type)\n# define DECLARE_PEM_write_cb(name, type) \\\n DECLARE_PEM_write_cb_bio(name, type) \\\n DECLARE_PEM_write_cb_fp(name, type)\n# define DECLARE_PEM_read(name, type) \\\n DECLARE_PEM_read_bio(name, type) \\\n DECLARE_PEM_read_fp(name, type)\n# define DECLARE_PEM_rw(name, type) \\\n DECLARE_PEM_read(name, type) \\\n DECLARE_PEM_write(name, type)\n# define DECLARE_PEM_rw_const(name, type) \\\n DECLARE_PEM_read(name, type) \\\n DECLARE_PEM_write_const(name, type)\n# define DECLARE_PEM_rw_cb(name, type) \\\n DECLARE_PEM_read(name, type) \\\n DECLARE_PEM_write_cb(name, type)\ntypedef int pem_password_cb (char *buf, int size, int rwflag, void *userdata);\n\nint PEM_get_EVP_CIPHER_INFO(char *header, EVP_CIPHER_INFO *cipher);\nint PEM_do_header(EVP_CIPHER_INFO *cipher, unsigned char *data, long *len,\n pem_password_cb *callback, void *u);\n\nint PEM_read_bio(BIO *bp, char **name, char **header,\n unsigned char **data, long *len);\n# define PEM_FLAG_SECURE 0x1\n# define PEM_FLAG_EAY_COMPATIBLE 0x2\n# define PEM_FLAG_ONLY_B64 0x4\nint PEM_read_bio_ex(BIO *bp, char **name, char **header,\n unsigned char **data, long *len, unsigned int flags);\nint PEM_bytes_read_bio_secmem(unsigned char **pdata, long *plen, char **pnm,\n const char *name, BIO *bp, pem_password_cb *cb,\n void *u);\nint PEM_write_bio(BIO *bp, const char *name, const char *hdr,\n const unsigned char *data, long len);\nint PEM_bytes_read_bio(unsigned char **pdata, long *plen, char **pnm,\n const char *name, BIO *bp, pem_password_cb *cb,\n void *u);\nvoid *PEM_ASN1_read_bio(d2i_of_void *d2i, const char *name, BIO *bp, void **x,\n pem_password_cb *cb, void *u);\nint PEM_ASN1_write_bio(i2d_of_void *i2d, const char *name, BIO *bp, void *x,\n const EVP_CIPHER *enc, unsigned char *kstr, int klen,\n pem_password_cb *cb, void *u);\n\nSTACK_OF(X509_INFO) *PEM_X509_INFO_read_bio(BIO *bp, STACK_OF(X509_INFO) *sk,\n pem_password_cb *cb, void *u);\nint PEM_X509_INFO_write_bio(BIO *bp, X509_INFO *xi, EVP_CIPHER *enc,\n unsigned char *kstr, int klen,\n pem_password_cb *cd, void *u);\n\n#ifndef OPENSSL_NO_STDIO\nint PEM_read(FILE *fp, char **name, char **header,\n unsigned char **data, long *len);\nint PEM_write(FILE *fp, const char *name, const char *hdr,\n const unsigned char *data, long len);\nvoid *PEM_ASN1_read(d2i_of_void *d2i, const char *name, FILE *fp, void **x,\n pem_password_cb *cb, void *u);\nint PEM_ASN1_write(i2d_of_void *i2d, const char *name, FILE *fp,\n void *x, const EVP_CIPHER *enc, unsigned char *kstr,\n int klen, pem_password_cb *callback, void *u);\nSTACK_OF(X509_INFO) *PEM_X509_INFO_read(FILE *fp, STACK_OF(X509_INFO) *sk,\n pem_password_cb *cb, void *u);\n#endif\n\nint PEM_SignInit(EVP_MD_CTX *ctx, EVP_MD *type);\nint PEM_SignUpdate(EVP_MD_CTX *ctx, unsigned char *d, unsigned int cnt);\nint PEM_SignFinal(EVP_MD_CTX *ctx, unsigned char *sigret,\n unsigned int *siglen, EVP_PKEY *pkey);\n\n/* The default pem_password_cb that's used internally */\nint PEM_def_callback(char *buf, int num, int rwflag, void *userdata);\nvoid PEM_proc_type(char *buf, int type);\nvoid PEM_dek_info(char *buf, const char *type, int len, char *str);\n\n# include \n\nDECLARE_PEM_rw(X509, X509)\nDECLARE_PEM_rw(X509_AUX, X509)\nDECLARE_PEM_rw(X509_REQ, X509_REQ)\nDECLARE_PEM_write(X509_REQ_NEW, X509_REQ)\nDECLARE_PEM_rw(X509_CRL, X509_CRL)\nDECLARE_PEM_rw(PKCS7, PKCS7)\nDECLARE_PEM_rw(NETSCAPE_CERT_SEQUENCE, NETSCAPE_CERT_SEQUENCE)\nDECLARE_PEM_rw(PKCS8, X509_SIG)\nDECLARE_PEM_rw(PKCS8_PRIV_KEY_INFO, PKCS8_PRIV_KEY_INFO)\n# ifndef OPENSSL_NO_RSA\nDECLARE_PEM_rw_cb(RSAPrivateKey, RSA)\nDECLARE_PEM_rw_const(RSAPublicKey, RSA)\nDECLARE_PEM_rw(RSA_PUBKEY, RSA)\n# endif\n# ifndef OPENSSL_NO_DSA\nDECLARE_PEM_rw_cb(DSAPrivateKey, DSA)\nDECLARE_PEM_rw(DSA_PUBKEY, DSA)\nDECLARE_PEM_rw_const(DSAparams, DSA)\n# endif\n# ifndef OPENSSL_NO_EC\nDECLARE_PEM_rw_const(ECPKParameters, EC_GROUP)\nDECLARE_PEM_rw_cb(ECPrivateKey, EC_KEY)\nDECLARE_PEM_rw(EC_PUBKEY, EC_KEY)\n# endif\n# ifndef OPENSSL_NO_DH\nDECLARE_PEM_rw_const(DHparams, DH)\nDECLARE_PEM_write_const(DHxparams, DH)\n# endif\nDECLARE_PEM_rw_cb(PrivateKey, EVP_PKEY)\nDECLARE_PEM_rw(PUBKEY, EVP_PKEY)\n\nint PEM_write_bio_PrivateKey_traditional(BIO *bp, EVP_PKEY *x,\n const EVP_CIPHER *enc,\n unsigned char *kstr, int klen,\n pem_password_cb *cb, void *u);\n\nint PEM_write_bio_PKCS8PrivateKey_nid(BIO *bp, EVP_PKEY *x, int nid,\n char *kstr, int klen,\n pem_password_cb *cb, void *u);\nint PEM_write_bio_PKCS8PrivateKey(BIO *, EVP_PKEY *, const EVP_CIPHER *,\n char *, int, pem_password_cb *, void *);\nint i2d_PKCS8PrivateKey_bio(BIO *bp, EVP_PKEY *x, const EVP_CIPHER *enc,\n char *kstr, int klen,\n pem_password_cb *cb, void *u);\nint i2d_PKCS8PrivateKey_nid_bio(BIO *bp, EVP_PKEY *x, int nid,\n char *kstr, int klen,\n pem_password_cb *cb, void *u);\nEVP_PKEY *d2i_PKCS8PrivateKey_bio(BIO *bp, EVP_PKEY **x, pem_password_cb *cb,\n void *u);\n\n# ifndef OPENSSL_NO_STDIO\nint i2d_PKCS8PrivateKey_fp(FILE *fp, EVP_PKEY *x, const EVP_CIPHER *enc,\n char *kstr, int klen,\n pem_password_cb *cb, void *u);\nint i2d_PKCS8PrivateKey_nid_fp(FILE *fp, EVP_PKEY *x, int nid,\n char *kstr, int klen,\n pem_password_cb *cb, void *u);\nint PEM_write_PKCS8PrivateKey_nid(FILE *fp, EVP_PKEY *x, int nid,\n char *kstr, int klen,\n pem_password_cb *cb, void *u);\n\nEVP_PKEY *d2i_PKCS8PrivateKey_fp(FILE *fp, EVP_PKEY **x, pem_password_cb *cb,\n void *u);\n\nint PEM_write_PKCS8PrivateKey(FILE *fp, EVP_PKEY *x, const EVP_CIPHER *enc,\n char *kstr, int klen, pem_password_cb *cd,\n void *u);\n# endif\nEVP_PKEY *PEM_read_bio_Parameters(BIO *bp, EVP_PKEY **x);\nint PEM_write_bio_Parameters(BIO *bp, EVP_PKEY *x);\n\n# ifndef OPENSSL_NO_DSA\nEVP_PKEY *b2i_PrivateKey(const unsigned char **in, long length);\nEVP_PKEY *b2i_PublicKey(const unsigned char **in, long length);\nEVP_PKEY *b2i_PrivateKey_bio(BIO *in);\nEVP_PKEY *b2i_PublicKey_bio(BIO *in);\nint i2b_PrivateKey_bio(BIO *out, EVP_PKEY *pk);\nint i2b_PublicKey_bio(BIO *out, EVP_PKEY *pk);\n# ifndef OPENSSL_NO_RC4\nEVP_PKEY *b2i_PVK_bio(BIO *in, pem_password_cb *cb, void *u);\nint i2b_PVK_bio(BIO *out, EVP_PKEY *pk, int enclevel,\n pem_password_cb *cb, void *u);\n# endif\n# endif\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/pem2.h", "content": "/*\n * Copyright 1999-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_PEM2_H\n# define HEADER_PEM2_H\n# include \n#endif\n" }, { "path": "cryptomini/include/openssl/pemerr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_PEMERR_H\n# define HEADER_PEMERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_PEM_strings(void);\n\n/*\n * PEM function codes.\n */\n# define PEM_F_B2I_DSS 127\n# define PEM_F_B2I_PVK_BIO 128\n# define PEM_F_B2I_RSA 129\n# define PEM_F_CHECK_BITLEN_DSA 130\n# define PEM_F_CHECK_BITLEN_RSA 131\n# define PEM_F_D2I_PKCS8PRIVATEKEY_BIO 120\n# define PEM_F_D2I_PKCS8PRIVATEKEY_FP 121\n# define PEM_F_DO_B2I 132\n# define PEM_F_DO_B2I_BIO 133\n# define PEM_F_DO_BLOB_HEADER 134\n# define PEM_F_DO_I2B 146\n# define PEM_F_DO_PK8PKEY 126\n# define PEM_F_DO_PK8PKEY_FP 125\n# define PEM_F_DO_PVK_BODY 135\n# define PEM_F_DO_PVK_HEADER 136\n# define PEM_F_GET_HEADER_AND_DATA 143\n# define PEM_F_GET_NAME 144\n# define PEM_F_I2B_PVK 137\n# define PEM_F_I2B_PVK_BIO 138\n# define PEM_F_LOAD_IV 101\n# define PEM_F_PEM_ASN1_READ 102\n# define PEM_F_PEM_ASN1_READ_BIO 103\n# define PEM_F_PEM_ASN1_WRITE 104\n# define PEM_F_PEM_ASN1_WRITE_BIO 105\n# define PEM_F_PEM_DEF_CALLBACK 100\n# define PEM_F_PEM_DO_HEADER 106\n# define PEM_F_PEM_GET_EVP_CIPHER_INFO 107\n# define PEM_F_PEM_READ 108\n# define PEM_F_PEM_READ_BIO 109\n# define PEM_F_PEM_READ_BIO_DHPARAMS 141\n# define PEM_F_PEM_READ_BIO_EX 145\n# define PEM_F_PEM_READ_BIO_PARAMETERS 140\n# define PEM_F_PEM_READ_BIO_PRIVATEKEY 123\n# define PEM_F_PEM_READ_DHPARAMS 142\n# define PEM_F_PEM_READ_PRIVATEKEY 124\n# define PEM_F_PEM_SIGNFINAL 112\n# define PEM_F_PEM_WRITE 113\n# define PEM_F_PEM_WRITE_BIO 114\n# define PEM_F_PEM_WRITE_BIO_PRIVATEKEY_TRADITIONAL 147\n# define PEM_F_PEM_WRITE_PRIVATEKEY 139\n# define PEM_F_PEM_X509_INFO_READ 115\n# define PEM_F_PEM_X509_INFO_READ_BIO 116\n# define PEM_F_PEM_X509_INFO_WRITE_BIO 117\n\n/*\n * PEM reason codes.\n */\n# define PEM_R_BAD_BASE64_DECODE 100\n# define PEM_R_BAD_DECRYPT 101\n# define PEM_R_BAD_END_LINE 102\n# define PEM_R_BAD_IV_CHARS 103\n# define PEM_R_BAD_MAGIC_NUMBER 116\n# define PEM_R_BAD_PASSWORD_READ 104\n# define PEM_R_BAD_VERSION_NUMBER 117\n# define PEM_R_BIO_WRITE_FAILURE 118\n# define PEM_R_CIPHER_IS_NULL 127\n# define PEM_R_ERROR_CONVERTING_PRIVATE_KEY 115\n# define PEM_R_EXPECTING_PRIVATE_KEY_BLOB 119\n# define PEM_R_EXPECTING_PUBLIC_KEY_BLOB 120\n# define PEM_R_HEADER_TOO_LONG 128\n# define PEM_R_INCONSISTENT_HEADER 121\n# define PEM_R_KEYBLOB_HEADER_PARSE_ERROR 122\n# define PEM_R_KEYBLOB_TOO_SHORT 123\n# define PEM_R_MISSING_DEK_IV 129\n# define PEM_R_NOT_DEK_INFO 105\n# define PEM_R_NOT_ENCRYPTED 106\n# define PEM_R_NOT_PROC_TYPE 107\n# define PEM_R_NO_START_LINE 108\n# define PEM_R_PROBLEMS_GETTING_PASSWORD 109\n# define PEM_R_PVK_DATA_TOO_SHORT 124\n# define PEM_R_PVK_TOO_SHORT 125\n# define PEM_R_READ_KEY 111\n# define PEM_R_SHORT_HEADER 112\n# define PEM_R_UNEXPECTED_DEK_IV 130\n# define PEM_R_UNSUPPORTED_CIPHER 113\n# define PEM_R_UNSUPPORTED_ENCRYPTION 114\n# define PEM_R_UNSUPPORTED_KEY_COMPONENTS 126\n# define PEM_R_UNSUPPORTED_PUBLIC_KEY_TYPE 110\n\n#endif\n" }, { "path": "cryptomini/include/openssl/pkcs12.h", "content": "/*\n * Copyright 1999-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_PKCS12_H\n# define HEADER_PKCS12_H\n\n# include \n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# define PKCS12_KEY_ID 1\n# define PKCS12_IV_ID 2\n# define PKCS12_MAC_ID 3\n\n/* Default iteration count */\n# ifndef PKCS12_DEFAULT_ITER\n# define PKCS12_DEFAULT_ITER PKCS5_DEFAULT_ITER\n# endif\n\n# define PKCS12_MAC_KEY_LENGTH 20\n\n# define PKCS12_SALT_LEN 8\n\n/* It's not clear if these are actually needed... */\n# define PKCS12_key_gen PKCS12_key_gen_utf8\n# define PKCS12_add_friendlyname PKCS12_add_friendlyname_utf8\n\n/* MS key usage constants */\n\n# define KEY_EX 0x10\n# define KEY_SIG 0x80\n\ntypedef struct PKCS12_MAC_DATA_st PKCS12_MAC_DATA;\n\ntypedef struct PKCS12_st PKCS12;\n\ntypedef struct PKCS12_SAFEBAG_st PKCS12_SAFEBAG;\n\nDEFINE_STACK_OF(PKCS12_SAFEBAG)\n\ntypedef struct pkcs12_bag_st PKCS12_BAGS;\n\n# define PKCS12_ERROR 0\n# define PKCS12_OK 1\n\n/* Compatibility macros */\n\n#if OPENSSL_API_COMPAT < 0x10100000L\n\n# define M_PKCS12_bag_type PKCS12_bag_type\n# define M_PKCS12_cert_bag_type PKCS12_cert_bag_type\n# define M_PKCS12_crl_bag_type PKCS12_cert_bag_type\n\n# define PKCS12_certbag2x509 PKCS12_SAFEBAG_get1_cert\n# define PKCS12_certbag2scrl PKCS12_SAFEBAG_get1_crl\n# define PKCS12_bag_type PKCS12_SAFEBAG_get_nid\n# define PKCS12_cert_bag_type PKCS12_SAFEBAG_get_bag_nid\n# define PKCS12_x5092certbag PKCS12_SAFEBAG_create_cert\n# define PKCS12_x509crl2certbag PKCS12_SAFEBAG_create_crl\n# define PKCS12_MAKE_KEYBAG PKCS12_SAFEBAG_create0_p8inf\n# define PKCS12_MAKE_SHKEYBAG PKCS12_SAFEBAG_create_pkcs8_encrypt\n\n#endif\n\nDEPRECATEDIN_1_1_0(ASN1_TYPE *PKCS12_get_attr(const PKCS12_SAFEBAG *bag, int attr_nid))\n\nASN1_TYPE *PKCS8_get_attr(PKCS8_PRIV_KEY_INFO *p8, int attr_nid);\nint PKCS12_mac_present(const PKCS12 *p12);\nvoid PKCS12_get0_mac(const ASN1_OCTET_STRING **pmac,\n const X509_ALGOR **pmacalg,\n const ASN1_OCTET_STRING **psalt,\n const ASN1_INTEGER **piter,\n const PKCS12 *p12);\n\nconst ASN1_TYPE *PKCS12_SAFEBAG_get0_attr(const PKCS12_SAFEBAG *bag,\n int attr_nid);\nconst ASN1_OBJECT *PKCS12_SAFEBAG_get0_type(const PKCS12_SAFEBAG *bag);\nint PKCS12_SAFEBAG_get_nid(const PKCS12_SAFEBAG *bag);\nint PKCS12_SAFEBAG_get_bag_nid(const PKCS12_SAFEBAG *bag);\n\nX509 *PKCS12_SAFEBAG_get1_cert(const PKCS12_SAFEBAG *bag);\nX509_CRL *PKCS12_SAFEBAG_get1_crl(const PKCS12_SAFEBAG *bag);\nconst STACK_OF(PKCS12_SAFEBAG) *\nPKCS12_SAFEBAG_get0_safes(const PKCS12_SAFEBAG *bag);\nconst PKCS8_PRIV_KEY_INFO *PKCS12_SAFEBAG_get0_p8inf(const PKCS12_SAFEBAG *bag);\nconst X509_SIG *PKCS12_SAFEBAG_get0_pkcs8(const PKCS12_SAFEBAG *bag);\n\nPKCS12_SAFEBAG *PKCS12_SAFEBAG_create_cert(X509 *x509);\nPKCS12_SAFEBAG *PKCS12_SAFEBAG_create_crl(X509_CRL *crl);\nPKCS12_SAFEBAG *PKCS12_SAFEBAG_create0_p8inf(PKCS8_PRIV_KEY_INFO *p8);\nPKCS12_SAFEBAG *PKCS12_SAFEBAG_create0_pkcs8(X509_SIG *p8);\nPKCS12_SAFEBAG *PKCS12_SAFEBAG_create_pkcs8_encrypt(int pbe_nid,\n const char *pass,\n int passlen,\n unsigned char *salt,\n int saltlen, int iter,\n PKCS8_PRIV_KEY_INFO *p8inf);\n\nPKCS12_SAFEBAG *PKCS12_item_pack_safebag(void *obj, const ASN1_ITEM *it,\n int nid1, int nid2);\nPKCS8_PRIV_KEY_INFO *PKCS8_decrypt(const X509_SIG *p8, const char *pass,\n int passlen);\nPKCS8_PRIV_KEY_INFO *PKCS12_decrypt_skey(const PKCS12_SAFEBAG *bag,\n const char *pass, int passlen);\nX509_SIG *PKCS8_encrypt(int pbe_nid, const EVP_CIPHER *cipher,\n const char *pass, int passlen, unsigned char *salt,\n int saltlen, int iter, PKCS8_PRIV_KEY_INFO *p8);\nX509_SIG *PKCS8_set0_pbe(const char *pass, int passlen,\n PKCS8_PRIV_KEY_INFO *p8inf, X509_ALGOR *pbe);\nPKCS7 *PKCS12_pack_p7data(STACK_OF(PKCS12_SAFEBAG) *sk);\nSTACK_OF(PKCS12_SAFEBAG) *PKCS12_unpack_p7data(PKCS7 *p7);\nPKCS7 *PKCS12_pack_p7encdata(int pbe_nid, const char *pass, int passlen,\n unsigned char *salt, int saltlen, int iter,\n STACK_OF(PKCS12_SAFEBAG) *bags);\nSTACK_OF(PKCS12_SAFEBAG) *PKCS12_unpack_p7encdata(PKCS7 *p7, const char *pass,\n int passlen);\n\nint PKCS12_pack_authsafes(PKCS12 *p12, STACK_OF(PKCS7) *safes);\nSTACK_OF(PKCS7) *PKCS12_unpack_authsafes(const PKCS12 *p12);\n\nint PKCS12_add_localkeyid(PKCS12_SAFEBAG *bag, unsigned char *name,\n int namelen);\nint PKCS12_add_friendlyname_asc(PKCS12_SAFEBAG *bag, const char *name,\n int namelen);\nint PKCS12_add_friendlyname_utf8(PKCS12_SAFEBAG *bag, const char *name,\n int namelen);\nint PKCS12_add_CSPName_asc(PKCS12_SAFEBAG *bag, const char *name,\n int namelen);\nint PKCS12_add_friendlyname_uni(PKCS12_SAFEBAG *bag,\n const unsigned char *name, int namelen);\nint PKCS8_add_keyusage(PKCS8_PRIV_KEY_INFO *p8, int usage);\nASN1_TYPE *PKCS12_get_attr_gen(const STACK_OF(X509_ATTRIBUTE) *attrs,\n int attr_nid);\nchar *PKCS12_get_friendlyname(PKCS12_SAFEBAG *bag);\nconst STACK_OF(X509_ATTRIBUTE) *\nPKCS12_SAFEBAG_get0_attrs(const PKCS12_SAFEBAG *bag);\nunsigned char *PKCS12_pbe_crypt(const X509_ALGOR *algor,\n const char *pass, int passlen,\n const unsigned char *in, int inlen,\n unsigned char **data, int *datalen,\n int en_de);\nvoid *PKCS12_item_decrypt_d2i(const X509_ALGOR *algor, const ASN1_ITEM *it,\n const char *pass, int passlen,\n const ASN1_OCTET_STRING *oct, int zbuf);\nASN1_OCTET_STRING *PKCS12_item_i2d_encrypt(X509_ALGOR *algor,\n const ASN1_ITEM *it,\n const char *pass, int passlen,\n void *obj, int zbuf);\nPKCS12 *PKCS12_init(int mode);\nint PKCS12_key_gen_asc(const char *pass, int passlen, unsigned char *salt,\n int saltlen, int id, int iter, int n,\n unsigned char *out, const EVP_MD *md_type);\nint PKCS12_key_gen_uni(unsigned char *pass, int passlen, unsigned char *salt,\n int saltlen, int id, int iter, int n,\n unsigned char *out, const EVP_MD *md_type);\nint PKCS12_key_gen_utf8(const char *pass, int passlen, unsigned char *salt,\n int saltlen, int id, int iter, int n,\n unsigned char *out, const EVP_MD *md_type);\nint PKCS12_PBE_keyivgen(EVP_CIPHER_CTX *ctx, const char *pass, int passlen,\n ASN1_TYPE *param, const EVP_CIPHER *cipher,\n const EVP_MD *md_type, int en_de);\nint PKCS12_gen_mac(PKCS12 *p12, const char *pass, int passlen,\n unsigned char *mac, unsigned int *maclen);\nint PKCS12_verify_mac(PKCS12 *p12, const char *pass, int passlen);\nint PKCS12_set_mac(PKCS12 *p12, const char *pass, int passlen,\n unsigned char *salt, int saltlen, int iter,\n const EVP_MD *md_type);\nint PKCS12_setup_mac(PKCS12 *p12, int iter, unsigned char *salt,\n int saltlen, const EVP_MD *md_type);\nunsigned char *OPENSSL_asc2uni(const char *asc, int asclen,\n unsigned char **uni, int *unilen);\nchar *OPENSSL_uni2asc(const unsigned char *uni, int unilen);\nunsigned char *OPENSSL_utf82uni(const char *asc, int asclen,\n unsigned char **uni, int *unilen);\nchar *OPENSSL_uni2utf8(const unsigned char *uni, int unilen);\n\nDECLARE_ASN1_FUNCTIONS(PKCS12)\nDECLARE_ASN1_FUNCTIONS(PKCS12_MAC_DATA)\nDECLARE_ASN1_FUNCTIONS(PKCS12_SAFEBAG)\nDECLARE_ASN1_FUNCTIONS(PKCS12_BAGS)\n\nDECLARE_ASN1_ITEM(PKCS12_SAFEBAGS)\nDECLARE_ASN1_ITEM(PKCS12_AUTHSAFES)\n\nvoid PKCS12_PBE_add(void);\nint PKCS12_parse(PKCS12 *p12, const char *pass, EVP_PKEY **pkey, X509 **cert,\n STACK_OF(X509) **ca);\nPKCS12 *PKCS12_create(const char *pass, const char *name, EVP_PKEY *pkey,\n X509 *cert, STACK_OF(X509) *ca, int nid_key, int nid_cert,\n int iter, int mac_iter, int keytype);\n\nPKCS12_SAFEBAG *PKCS12_add_cert(STACK_OF(PKCS12_SAFEBAG) **pbags, X509 *cert);\nPKCS12_SAFEBAG *PKCS12_add_key(STACK_OF(PKCS12_SAFEBAG) **pbags,\n EVP_PKEY *key, int key_usage, int iter,\n int key_nid, const char *pass);\nint PKCS12_add_safe(STACK_OF(PKCS7) **psafes, STACK_OF(PKCS12_SAFEBAG) *bags,\n int safe_nid, int iter, const char *pass);\nPKCS12 *PKCS12_add_safes(STACK_OF(PKCS7) *safes, int p7_nid);\n\nint i2d_PKCS12_bio(BIO *bp, PKCS12 *p12);\n# ifndef OPENSSL_NO_STDIO\nint i2d_PKCS12_fp(FILE *fp, PKCS12 *p12);\n# endif\nPKCS12 *d2i_PKCS12_bio(BIO *bp, PKCS12 **p12);\n# ifndef OPENSSL_NO_STDIO\nPKCS12 *d2i_PKCS12_fp(FILE *fp, PKCS12 **p12);\n# endif\nint PKCS12_newpass(PKCS12 *p12, const char *oldpass, const char *newpass);\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/pkcs12err.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_PKCS12ERR_H\n# define HEADER_PKCS12ERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_PKCS12_strings(void);\n\n/*\n * PKCS12 function codes.\n */\n# define PKCS12_F_OPENSSL_ASC2UNI 121\n# define PKCS12_F_OPENSSL_UNI2ASC 124\n# define PKCS12_F_OPENSSL_UNI2UTF8 127\n# define PKCS12_F_OPENSSL_UTF82UNI 129\n# define PKCS12_F_PKCS12_CREATE 105\n# define PKCS12_F_PKCS12_GEN_MAC 107\n# define PKCS12_F_PKCS12_INIT 109\n# define PKCS12_F_PKCS12_ITEM_DECRYPT_D2I 106\n# define PKCS12_F_PKCS12_ITEM_I2D_ENCRYPT 108\n# define PKCS12_F_PKCS12_ITEM_PACK_SAFEBAG 117\n# define PKCS12_F_PKCS12_KEY_GEN_ASC 110\n# define PKCS12_F_PKCS12_KEY_GEN_UNI 111\n# define PKCS12_F_PKCS12_KEY_GEN_UTF8 116\n# define PKCS12_F_PKCS12_NEWPASS 128\n# define PKCS12_F_PKCS12_PACK_P7DATA 114\n# define PKCS12_F_PKCS12_PACK_P7ENCDATA 115\n# define PKCS12_F_PKCS12_PARSE 118\n# define PKCS12_F_PKCS12_PBE_CRYPT 119\n# define PKCS12_F_PKCS12_PBE_KEYIVGEN 120\n# define PKCS12_F_PKCS12_SAFEBAG_CREATE0_P8INF 112\n# define PKCS12_F_PKCS12_SAFEBAG_CREATE0_PKCS8 113\n# define PKCS12_F_PKCS12_SAFEBAG_CREATE_PKCS8_ENCRYPT 133\n# define PKCS12_F_PKCS12_SETUP_MAC 122\n# define PKCS12_F_PKCS12_SET_MAC 123\n# define PKCS12_F_PKCS12_UNPACK_AUTHSAFES 130\n# define PKCS12_F_PKCS12_UNPACK_P7DATA 131\n# define PKCS12_F_PKCS12_VERIFY_MAC 126\n# define PKCS12_F_PKCS8_ENCRYPT 125\n# define PKCS12_F_PKCS8_SET0_PBE 132\n\n/*\n * PKCS12 reason codes.\n */\n# define PKCS12_R_CANT_PACK_STRUCTURE 100\n# define PKCS12_R_CONTENT_TYPE_NOT_DATA 121\n# define PKCS12_R_DECODE_ERROR 101\n# define PKCS12_R_ENCODE_ERROR 102\n# define PKCS12_R_ENCRYPT_ERROR 103\n# define PKCS12_R_ERROR_SETTING_ENCRYPTED_DATA_TYPE 120\n# define PKCS12_R_INVALID_NULL_ARGUMENT 104\n# define PKCS12_R_INVALID_NULL_PKCS12_POINTER 105\n# define PKCS12_R_IV_GEN_ERROR 106\n# define PKCS12_R_KEY_GEN_ERROR 107\n# define PKCS12_R_MAC_ABSENT 108\n# define PKCS12_R_MAC_GENERATION_ERROR 109\n# define PKCS12_R_MAC_SETUP_ERROR 110\n# define PKCS12_R_MAC_STRING_SET_ERROR 111\n# define PKCS12_R_MAC_VERIFY_FAILURE 113\n# define PKCS12_R_PARSE_ERROR 114\n# define PKCS12_R_PKCS12_ALGOR_CIPHERINIT_ERROR 115\n# define PKCS12_R_PKCS12_CIPHERFINAL_ERROR 116\n# define PKCS12_R_PKCS12_PBE_CRYPT_ERROR 117\n# define PKCS12_R_UNKNOWN_DIGEST_ALGORITHM 118\n# define PKCS12_R_UNSUPPORTED_PKCS12_MODE 119\n\n#endif\n" }, { "path": "cryptomini/include/openssl/pkcs7.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_PKCS7_H\n# define HEADER_PKCS7_H\n\n# include \n# include \n# include \n\n# include \n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/*-\nEncryption_ID DES-CBC\nDigest_ID MD5\nDigest_Encryption_ID rsaEncryption\nKey_Encryption_ID rsaEncryption\n*/\n\ntypedef struct pkcs7_issuer_and_serial_st {\n X509_NAME *issuer;\n ASN1_INTEGER *serial;\n} PKCS7_ISSUER_AND_SERIAL;\n\ntypedef struct pkcs7_signer_info_st {\n ASN1_INTEGER *version; /* version 1 */\n PKCS7_ISSUER_AND_SERIAL *issuer_and_serial;\n X509_ALGOR *digest_alg;\n STACK_OF(X509_ATTRIBUTE) *auth_attr; /* [ 0 ] */\n X509_ALGOR *digest_enc_alg;\n ASN1_OCTET_STRING *enc_digest;\n STACK_OF(X509_ATTRIBUTE) *unauth_attr; /* [ 1 ] */\n /* The private key to sign with */\n EVP_PKEY *pkey;\n} PKCS7_SIGNER_INFO;\n\nDEFINE_STACK_OF(PKCS7_SIGNER_INFO)\n\ntypedef struct pkcs7_recip_info_st {\n ASN1_INTEGER *version; /* version 0 */\n PKCS7_ISSUER_AND_SERIAL *issuer_and_serial;\n X509_ALGOR *key_enc_algor;\n ASN1_OCTET_STRING *enc_key;\n X509 *cert; /* get the pub-key from this */\n} PKCS7_RECIP_INFO;\n\nDEFINE_STACK_OF(PKCS7_RECIP_INFO)\n\ntypedef struct pkcs7_signed_st {\n ASN1_INTEGER *version; /* version 1 */\n STACK_OF(X509_ALGOR) *md_algs; /* md used */\n STACK_OF(X509) *cert; /* [ 0 ] */\n STACK_OF(X509_CRL) *crl; /* [ 1 ] */\n STACK_OF(PKCS7_SIGNER_INFO) *signer_info;\n struct pkcs7_st *contents;\n} PKCS7_SIGNED;\n/*\n * The above structure is very very similar to PKCS7_SIGN_ENVELOPE. How about\n * merging the two\n */\n\ntypedef struct pkcs7_enc_content_st {\n ASN1_OBJECT *content_type;\n X509_ALGOR *algorithm;\n ASN1_OCTET_STRING *enc_data; /* [ 0 ] */\n const EVP_CIPHER *cipher;\n} PKCS7_ENC_CONTENT;\n\ntypedef struct pkcs7_enveloped_st {\n ASN1_INTEGER *version; /* version 0 */\n STACK_OF(PKCS7_RECIP_INFO) *recipientinfo;\n PKCS7_ENC_CONTENT *enc_data;\n} PKCS7_ENVELOPE;\n\ntypedef struct pkcs7_signedandenveloped_st {\n ASN1_INTEGER *version; /* version 1 */\n STACK_OF(X509_ALGOR) *md_algs; /* md used */\n STACK_OF(X509) *cert; /* [ 0 ] */\n STACK_OF(X509_CRL) *crl; /* [ 1 ] */\n STACK_OF(PKCS7_SIGNER_INFO) *signer_info;\n PKCS7_ENC_CONTENT *enc_data;\n STACK_OF(PKCS7_RECIP_INFO) *recipientinfo;\n} PKCS7_SIGN_ENVELOPE;\n\ntypedef struct pkcs7_digest_st {\n ASN1_INTEGER *version; /* version 0 */\n X509_ALGOR *md; /* md used */\n struct pkcs7_st *contents;\n ASN1_OCTET_STRING *digest;\n} PKCS7_DIGEST;\n\ntypedef struct pkcs7_encrypted_st {\n ASN1_INTEGER *version; /* version 0 */\n PKCS7_ENC_CONTENT *enc_data;\n} PKCS7_ENCRYPT;\n\ntypedef struct pkcs7_st {\n /*\n * The following is non NULL if it contains ASN1 encoding of this\n * structure\n */\n unsigned char *asn1;\n long length;\n# define PKCS7_S_HEADER 0\n# define PKCS7_S_BODY 1\n# define PKCS7_S_TAIL 2\n int state; /* used during processing */\n int detached;\n ASN1_OBJECT *type;\n /* content as defined by the type */\n /*\n * all encryption/message digests are applied to the 'contents', leaving\n * out the 'type' field.\n */\n union {\n char *ptr;\n /* NID_pkcs7_data */\n ASN1_OCTET_STRING *data;\n /* NID_pkcs7_signed */\n PKCS7_SIGNED *sign;\n /* NID_pkcs7_enveloped */\n PKCS7_ENVELOPE *enveloped;\n /* NID_pkcs7_signedAndEnveloped */\n PKCS7_SIGN_ENVELOPE *signed_and_enveloped;\n /* NID_pkcs7_digest */\n PKCS7_DIGEST *digest;\n /* NID_pkcs7_encrypted */\n PKCS7_ENCRYPT *encrypted;\n /* Anything else */\n ASN1_TYPE *other;\n } d;\n} PKCS7;\n\nDEFINE_STACK_OF(PKCS7)\n\n# define PKCS7_OP_SET_DETACHED_SIGNATURE 1\n# define PKCS7_OP_GET_DETACHED_SIGNATURE 2\n\n# define PKCS7_get_signed_attributes(si) ((si)->auth_attr)\n# define PKCS7_get_attributes(si) ((si)->unauth_attr)\n\n# define PKCS7_type_is_signed(a) (OBJ_obj2nid((a)->type) == NID_pkcs7_signed)\n# define PKCS7_type_is_encrypted(a) (OBJ_obj2nid((a)->type) == NID_pkcs7_encrypted)\n# define PKCS7_type_is_enveloped(a) (OBJ_obj2nid((a)->type) == NID_pkcs7_enveloped)\n# define PKCS7_type_is_signedAndEnveloped(a) \\\n (OBJ_obj2nid((a)->type) == NID_pkcs7_signedAndEnveloped)\n# define PKCS7_type_is_data(a) (OBJ_obj2nid((a)->type) == NID_pkcs7_data)\n# define PKCS7_type_is_digest(a) (OBJ_obj2nid((a)->type) == NID_pkcs7_digest)\n\n# define PKCS7_set_detached(p,v) \\\n PKCS7_ctrl(p,PKCS7_OP_SET_DETACHED_SIGNATURE,v,NULL)\n# define PKCS7_get_detached(p) \\\n PKCS7_ctrl(p,PKCS7_OP_GET_DETACHED_SIGNATURE,0,NULL)\n\n# define PKCS7_is_detached(p7) (PKCS7_type_is_signed(p7) && PKCS7_get_detached(p7))\n\n/* S/MIME related flags */\n\n# define PKCS7_TEXT 0x1\n# define PKCS7_NOCERTS 0x2\n# define PKCS7_NOSIGS 0x4\n# define PKCS7_NOCHAIN 0x8\n# define PKCS7_NOINTERN 0x10\n# define PKCS7_NOVERIFY 0x20\n# define PKCS7_DETACHED 0x40\n# define PKCS7_BINARY 0x80\n# define PKCS7_NOATTR 0x100\n# define PKCS7_NOSMIMECAP 0x200\n# define PKCS7_NOOLDMIMETYPE 0x400\n# define PKCS7_CRLFEOL 0x800\n# define PKCS7_STREAM 0x1000\n# define PKCS7_NOCRL 0x2000\n# define PKCS7_PARTIAL 0x4000\n# define PKCS7_REUSE_DIGEST 0x8000\n# define PKCS7_NO_DUAL_CONTENT 0x10000\n\n/* Flags: for compatibility with older code */\n\n# define SMIME_TEXT PKCS7_TEXT\n# define SMIME_NOCERTS PKCS7_NOCERTS\n# define SMIME_NOSIGS PKCS7_NOSIGS\n# define SMIME_NOCHAIN PKCS7_NOCHAIN\n# define SMIME_NOINTERN PKCS7_NOINTERN\n# define SMIME_NOVERIFY PKCS7_NOVERIFY\n# define SMIME_DETACHED PKCS7_DETACHED\n# define SMIME_BINARY PKCS7_BINARY\n# define SMIME_NOATTR PKCS7_NOATTR\n\n/* CRLF ASCII canonicalisation */\n# define SMIME_ASCIICRLF 0x80000\n\nDECLARE_ASN1_FUNCTIONS(PKCS7_ISSUER_AND_SERIAL)\n\nint PKCS7_ISSUER_AND_SERIAL_digest(PKCS7_ISSUER_AND_SERIAL *data,\n const EVP_MD *type, unsigned char *md,\n unsigned int *len);\n# ifndef OPENSSL_NO_STDIO\nPKCS7 *d2i_PKCS7_fp(FILE *fp, PKCS7 **p7);\nint i2d_PKCS7_fp(FILE *fp, PKCS7 *p7);\n# endif\nPKCS7 *PKCS7_dup(PKCS7 *p7);\nPKCS7 *d2i_PKCS7_bio(BIO *bp, PKCS7 **p7);\nint i2d_PKCS7_bio(BIO *bp, PKCS7 *p7);\nint i2d_PKCS7_bio_stream(BIO *out, PKCS7 *p7, BIO *in, int flags);\nint PEM_write_bio_PKCS7_stream(BIO *out, PKCS7 *p7, BIO *in, int flags);\n\nDECLARE_ASN1_FUNCTIONS(PKCS7_SIGNER_INFO)\nDECLARE_ASN1_FUNCTIONS(PKCS7_RECIP_INFO)\nDECLARE_ASN1_FUNCTIONS(PKCS7_SIGNED)\nDECLARE_ASN1_FUNCTIONS(PKCS7_ENC_CONTENT)\nDECLARE_ASN1_FUNCTIONS(PKCS7_ENVELOPE)\nDECLARE_ASN1_FUNCTIONS(PKCS7_SIGN_ENVELOPE)\nDECLARE_ASN1_FUNCTIONS(PKCS7_DIGEST)\nDECLARE_ASN1_FUNCTIONS(PKCS7_ENCRYPT)\nDECLARE_ASN1_FUNCTIONS(PKCS7)\n\nDECLARE_ASN1_ITEM(PKCS7_ATTR_SIGN)\nDECLARE_ASN1_ITEM(PKCS7_ATTR_VERIFY)\n\nDECLARE_ASN1_NDEF_FUNCTION(PKCS7)\nDECLARE_ASN1_PRINT_FUNCTION(PKCS7)\n\nlong PKCS7_ctrl(PKCS7 *p7, int cmd, long larg, char *parg);\n\nint PKCS7_set_type(PKCS7 *p7, int type);\nint PKCS7_set0_type_other(PKCS7 *p7, int type, ASN1_TYPE *other);\nint PKCS7_set_content(PKCS7 *p7, PKCS7 *p7_data);\nint PKCS7_SIGNER_INFO_set(PKCS7_SIGNER_INFO *p7i, X509 *x509, EVP_PKEY *pkey,\n const EVP_MD *dgst);\nint PKCS7_SIGNER_INFO_sign(PKCS7_SIGNER_INFO *si);\nint PKCS7_add_signer(PKCS7 *p7, PKCS7_SIGNER_INFO *p7i);\nint PKCS7_add_certificate(PKCS7 *p7, X509 *x509);\nint PKCS7_add_crl(PKCS7 *p7, X509_CRL *x509);\nint PKCS7_content_new(PKCS7 *p7, int nid);\nint PKCS7_dataVerify(X509_STORE *cert_store, X509_STORE_CTX *ctx,\n BIO *bio, PKCS7 *p7, PKCS7_SIGNER_INFO *si);\nint PKCS7_signatureVerify(BIO *bio, PKCS7 *p7, PKCS7_SIGNER_INFO *si,\n X509 *x509);\n\nBIO *PKCS7_dataInit(PKCS7 *p7, BIO *bio);\nint PKCS7_dataFinal(PKCS7 *p7, BIO *bio);\nBIO *PKCS7_dataDecode(PKCS7 *p7, EVP_PKEY *pkey, BIO *in_bio, X509 *pcert);\n\nPKCS7_SIGNER_INFO *PKCS7_add_signature(PKCS7 *p7, X509 *x509,\n EVP_PKEY *pkey, const EVP_MD *dgst);\nX509 *PKCS7_cert_from_signer_info(PKCS7 *p7, PKCS7_SIGNER_INFO *si);\nint PKCS7_set_digest(PKCS7 *p7, const EVP_MD *md);\nSTACK_OF(PKCS7_SIGNER_INFO) *PKCS7_get_signer_info(PKCS7 *p7);\n\nPKCS7_RECIP_INFO *PKCS7_add_recipient(PKCS7 *p7, X509 *x509);\nvoid PKCS7_SIGNER_INFO_get0_algs(PKCS7_SIGNER_INFO *si, EVP_PKEY **pk,\n X509_ALGOR **pdig, X509_ALGOR **psig);\nvoid PKCS7_RECIP_INFO_get0_alg(PKCS7_RECIP_INFO *ri, X509_ALGOR **penc);\nint PKCS7_add_recipient_info(PKCS7 *p7, PKCS7_RECIP_INFO *ri);\nint PKCS7_RECIP_INFO_set(PKCS7_RECIP_INFO *p7i, X509 *x509);\nint PKCS7_set_cipher(PKCS7 *p7, const EVP_CIPHER *cipher);\nint PKCS7_stream(unsigned char ***boundary, PKCS7 *p7);\n\nPKCS7_ISSUER_AND_SERIAL *PKCS7_get_issuer_and_serial(PKCS7 *p7, int idx);\nASN1_OCTET_STRING *PKCS7_digest_from_attributes(STACK_OF(X509_ATTRIBUTE) *sk);\nint PKCS7_add_signed_attribute(PKCS7_SIGNER_INFO *p7si, int nid, int type,\n void *data);\nint PKCS7_add_attribute(PKCS7_SIGNER_INFO *p7si, int nid, int atrtype,\n void *value);\nASN1_TYPE *PKCS7_get_attribute(PKCS7_SIGNER_INFO *si, int nid);\nASN1_TYPE *PKCS7_get_signed_attribute(PKCS7_SIGNER_INFO *si, int nid);\nint PKCS7_set_signed_attributes(PKCS7_SIGNER_INFO *p7si,\n STACK_OF(X509_ATTRIBUTE) *sk);\nint PKCS7_set_attributes(PKCS7_SIGNER_INFO *p7si,\n STACK_OF(X509_ATTRIBUTE) *sk);\n\nPKCS7 *PKCS7_sign(X509 *signcert, EVP_PKEY *pkey, STACK_OF(X509) *certs,\n BIO *data, int flags);\n\nPKCS7_SIGNER_INFO *PKCS7_sign_add_signer(PKCS7 *p7,\n X509 *signcert, EVP_PKEY *pkey,\n const EVP_MD *md, int flags);\n\nint PKCS7_final(PKCS7 *p7, BIO *data, int flags);\nint PKCS7_verify(PKCS7 *p7, STACK_OF(X509) *certs, X509_STORE *store,\n BIO *indata, BIO *out, int flags);\nSTACK_OF(X509) *PKCS7_get0_signers(PKCS7 *p7, STACK_OF(X509) *certs,\n int flags);\nPKCS7 *PKCS7_encrypt(STACK_OF(X509) *certs, BIO *in, const EVP_CIPHER *cipher,\n int flags);\nint PKCS7_decrypt(PKCS7 *p7, EVP_PKEY *pkey, X509 *cert, BIO *data,\n int flags);\n\nint PKCS7_add_attrib_smimecap(PKCS7_SIGNER_INFO *si,\n STACK_OF(X509_ALGOR) *cap);\nSTACK_OF(X509_ALGOR) *PKCS7_get_smimecap(PKCS7_SIGNER_INFO *si);\nint PKCS7_simple_smimecap(STACK_OF(X509_ALGOR) *sk, int nid, int arg);\n\nint PKCS7_add_attrib_content_type(PKCS7_SIGNER_INFO *si, ASN1_OBJECT *coid);\nint PKCS7_add0_attrib_signing_time(PKCS7_SIGNER_INFO *si, ASN1_TIME *t);\nint PKCS7_add1_attrib_digest(PKCS7_SIGNER_INFO *si,\n const unsigned char *md, int mdlen);\n\nint SMIME_write_PKCS7(BIO *bio, PKCS7 *p7, BIO *data, int flags);\nPKCS7 *SMIME_read_PKCS7(BIO *bio, BIO **bcont);\n\nBIO *BIO_new_PKCS7(BIO *out, PKCS7 *p7);\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/pkcs7err.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_PKCS7ERR_H\n# define HEADER_PKCS7ERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_PKCS7_strings(void);\n\n/*\n * PKCS7 function codes.\n */\n# define PKCS7_F_DO_PKCS7_SIGNED_ATTRIB 136\n# define PKCS7_F_PKCS7_ADD0_ATTRIB_SIGNING_TIME 135\n# define PKCS7_F_PKCS7_ADD_ATTRIB_SMIMECAP 118\n# define PKCS7_F_PKCS7_ADD_CERTIFICATE 100\n# define PKCS7_F_PKCS7_ADD_CRL 101\n# define PKCS7_F_PKCS7_ADD_RECIPIENT_INFO 102\n# define PKCS7_F_PKCS7_ADD_SIGNATURE 131\n# define PKCS7_F_PKCS7_ADD_SIGNER 103\n# define PKCS7_F_PKCS7_BIO_ADD_DIGEST 125\n# define PKCS7_F_PKCS7_COPY_EXISTING_DIGEST 138\n# define PKCS7_F_PKCS7_CTRL 104\n# define PKCS7_F_PKCS7_DATADECODE 112\n# define PKCS7_F_PKCS7_DATAFINAL 128\n# define PKCS7_F_PKCS7_DATAINIT 105\n# define PKCS7_F_PKCS7_DATAVERIFY 107\n# define PKCS7_F_PKCS7_DECRYPT 114\n# define PKCS7_F_PKCS7_DECRYPT_RINFO 133\n# define PKCS7_F_PKCS7_ENCODE_RINFO 132\n# define PKCS7_F_PKCS7_ENCRYPT 115\n# define PKCS7_F_PKCS7_FINAL 134\n# define PKCS7_F_PKCS7_FIND_DIGEST 127\n# define PKCS7_F_PKCS7_GET0_SIGNERS 124\n# define PKCS7_F_PKCS7_RECIP_INFO_SET 130\n# define PKCS7_F_PKCS7_SET_CIPHER 108\n# define PKCS7_F_PKCS7_SET_CONTENT 109\n# define PKCS7_F_PKCS7_SET_DIGEST 126\n# define PKCS7_F_PKCS7_SET_TYPE 110\n# define PKCS7_F_PKCS7_SIGN 116\n# define PKCS7_F_PKCS7_SIGNATUREVERIFY 113\n# define PKCS7_F_PKCS7_SIGNER_INFO_SET 129\n# define PKCS7_F_PKCS7_SIGNER_INFO_SIGN 139\n# define PKCS7_F_PKCS7_SIGN_ADD_SIGNER 137\n# define PKCS7_F_PKCS7_SIMPLE_SMIMECAP 119\n# define PKCS7_F_PKCS7_VERIFY 117\n\n/*\n * PKCS7 reason codes.\n */\n# define PKCS7_R_CERTIFICATE_VERIFY_ERROR 117\n# define PKCS7_R_CIPHER_HAS_NO_OBJECT_IDENTIFIER 144\n# define PKCS7_R_CIPHER_NOT_INITIALIZED 116\n# define PKCS7_R_CONTENT_AND_DATA_PRESENT 118\n# define PKCS7_R_CTRL_ERROR 152\n# define PKCS7_R_DECRYPT_ERROR 119\n# define PKCS7_R_DIGEST_FAILURE 101\n# define PKCS7_R_ENCRYPTION_CTRL_FAILURE 149\n# define PKCS7_R_ENCRYPTION_NOT_SUPPORTED_FOR_THIS_KEY_TYPE 150\n# define PKCS7_R_ERROR_ADDING_RECIPIENT 120\n# define PKCS7_R_ERROR_SETTING_CIPHER 121\n# define PKCS7_R_INVALID_NULL_POINTER 143\n# define PKCS7_R_INVALID_SIGNED_DATA_TYPE 155\n# define PKCS7_R_NO_CONTENT 122\n# define PKCS7_R_NO_DEFAULT_DIGEST 151\n# define PKCS7_R_NO_MATCHING_DIGEST_TYPE_FOUND 154\n# define PKCS7_R_NO_RECIPIENT_MATCHES_CERTIFICATE 115\n# define PKCS7_R_NO_SIGNATURES_ON_DATA 123\n# define PKCS7_R_NO_SIGNERS 142\n# define PKCS7_R_OPERATION_NOT_SUPPORTED_ON_THIS_TYPE 104\n# define PKCS7_R_PKCS7_ADD_SIGNATURE_ERROR 124\n# define PKCS7_R_PKCS7_ADD_SIGNER_ERROR 153\n# define PKCS7_R_PKCS7_DATASIGN 145\n# define PKCS7_R_PRIVATE_KEY_DOES_NOT_MATCH_CERTIFICATE 127\n# define PKCS7_R_SIGNATURE_FAILURE 105\n# define PKCS7_R_SIGNER_CERTIFICATE_NOT_FOUND 128\n# define PKCS7_R_SIGNING_CTRL_FAILURE 147\n# define PKCS7_R_SIGNING_NOT_SUPPORTED_FOR_THIS_KEY_TYPE 148\n# define PKCS7_R_SMIME_TEXT_ERROR 129\n# define PKCS7_R_UNABLE_TO_FIND_CERTIFICATE 106\n# define PKCS7_R_UNABLE_TO_FIND_MEM_BIO 107\n# define PKCS7_R_UNABLE_TO_FIND_MESSAGE_DIGEST 108\n# define PKCS7_R_UNKNOWN_DIGEST_TYPE 109\n# define PKCS7_R_UNKNOWN_OPERATION 110\n# define PKCS7_R_UNSUPPORTED_CIPHER_TYPE 111\n# define PKCS7_R_UNSUPPORTED_CONTENT_TYPE 112\n# define PKCS7_R_WRONG_CONTENT_TYPE 113\n# define PKCS7_R_WRONG_PKCS7_TYPE 114\n\n#endif\n" }, { "path": "cryptomini/include/openssl/rand.h", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_RAND_H\n# define HEADER_RAND_H\n\n# include \n# include \n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\nstruct rand_meth_st {\n int (*seed) (const void *buf, int num);\n int (*bytes) (unsigned char *buf, int num);\n void (*cleanup) (void);\n int (*add) (const void *buf, int num, double randomness);\n int (*pseudorand) (unsigned char *buf, int num);\n int (*status) (void);\n};\n\nint RAND_set_rand_method(const RAND_METHOD *meth);\nconst RAND_METHOD *RAND_get_rand_method(void);\n# ifndef OPENSSL_NO_ENGINE\nint RAND_set_rand_engine(ENGINE *engine);\n# endif\n\nRAND_METHOD *RAND_OpenSSL(void);\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define RAND_cleanup() while(0) continue\n# endif\nint RAND_bytes(unsigned char *buf, int num);\nint RAND_priv_bytes(unsigned char *buf, int num);\nDEPRECATEDIN_1_1_0(int RAND_pseudo_bytes(unsigned char *buf, int num))\n\nvoid RAND_seed(const void *buf, int num);\nvoid RAND_keep_random_devices_open(int keep);\n\n# if defined(__ANDROID__) && defined(__NDK_FPABI__)\n__NDK_FPABI__\t/* __attribute__((pcs(\"aapcs\"))) on ARM */\n# endif\nvoid RAND_add(const void *buf, int num, double randomness);\nint RAND_load_file(const char *file, long max_bytes);\nint RAND_write_file(const char *file);\nconst char *RAND_file_name(char *file, size_t num);\nint RAND_status(void);\n\n# ifndef OPENSSL_NO_EGD\nint RAND_query_egd_bytes(const char *path, unsigned char *buf, int bytes);\nint RAND_egd(const char *path);\nint RAND_egd_bytes(const char *path, int bytes);\n# endif\n\nint RAND_poll(void);\n\n# if defined(_WIN32) && (defined(BASETYPES) || defined(_WINDEF_H))\n/* application has to include in order to use these */\nDEPRECATEDIN_1_1_0(void RAND_screen(void))\nDEPRECATEDIN_1_1_0(int RAND_event(UINT, WPARAM, LPARAM))\n# endif\n\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/rand_drbg.h", "content": "/*\n * Copyright 2017-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_DRBG_RAND_H\n# define HEADER_DRBG_RAND_H\n\n# include \n# include \n# include \n\n/*\n * RAND_DRBG flags\n *\n * Note: if new flags are added, the constant `rand_drbg_used_flags`\n * in drbg_lib.c needs to be updated accordingly.\n */\n\n/* In CTR mode, disable derivation function ctr_df */\n# define RAND_DRBG_FLAG_CTR_NO_DF 0x1\n\n\n# if OPENSSL_API_COMPAT < 0x10200000L\n/* This #define was replaced by an internal constant and should not be used. */\n# define RAND_DRBG_USED_FLAGS (RAND_DRBG_FLAG_CTR_NO_DF)\n# endif\n\n/*\n * Default security strength (in the sense of [NIST SP 800-90Ar1])\n *\n * NIST SP 800-90Ar1 supports the strength of the DRBG being smaller than that\n * of the cipher by collecting less entropy. The current DRBG implementation\n * does not take RAND_DRBG_STRENGTH into account and sets the strength of the\n * DRBG to that of the cipher.\n *\n * RAND_DRBG_STRENGTH is currently only used for the legacy RAND\n * implementation.\n *\n * Currently supported ciphers are: NID_aes_128_ctr, NID_aes_192_ctr and\n * NID_aes_256_ctr\n */\n# define RAND_DRBG_STRENGTH 256\n/* Default drbg type */\n# define RAND_DRBG_TYPE NID_aes_256_ctr\n/* Default drbg flags */\n# define RAND_DRBG_FLAGS 0\n\n\n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n/*\n * Object lifetime functions.\n */\nRAND_DRBG *RAND_DRBG_new(int type, unsigned int flags, RAND_DRBG *parent);\nRAND_DRBG *RAND_DRBG_secure_new(int type, unsigned int flags, RAND_DRBG *parent);\nint RAND_DRBG_set(RAND_DRBG *drbg, int type, unsigned int flags);\nint RAND_DRBG_set_defaults(int type, unsigned int flags);\nint RAND_DRBG_instantiate(RAND_DRBG *drbg,\n const unsigned char *pers, size_t perslen);\nint RAND_DRBG_uninstantiate(RAND_DRBG *drbg);\nvoid RAND_DRBG_free(RAND_DRBG *drbg);\n\n/*\n * Object \"use\" functions.\n */\nint RAND_DRBG_reseed(RAND_DRBG *drbg,\n const unsigned char *adin, size_t adinlen,\n int prediction_resistance);\nint RAND_DRBG_generate(RAND_DRBG *drbg, unsigned char *out, size_t outlen,\n int prediction_resistance,\n const unsigned char *adin, size_t adinlen);\nint RAND_DRBG_bytes(RAND_DRBG *drbg, unsigned char *out, size_t outlen);\n\nint RAND_DRBG_set_reseed_interval(RAND_DRBG *drbg, unsigned int interval);\nint RAND_DRBG_set_reseed_time_interval(RAND_DRBG *drbg, time_t interval);\n\nint RAND_DRBG_set_reseed_defaults(\n unsigned int master_reseed_interval,\n unsigned int slave_reseed_interval,\n time_t master_reseed_time_interval,\n time_t slave_reseed_time_interval\n );\n\nRAND_DRBG *RAND_DRBG_get0_master(void);\nRAND_DRBG *RAND_DRBG_get0_public(void);\nRAND_DRBG *RAND_DRBG_get0_private(void);\n\n/*\n * EXDATA\n */\n# define RAND_DRBG_get_ex_new_index(l, p, newf, dupf, freef) \\\n CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_DRBG, l, p, newf, dupf, freef)\nint RAND_DRBG_set_ex_data(RAND_DRBG *drbg, int idx, void *arg);\nvoid *RAND_DRBG_get_ex_data(const RAND_DRBG *drbg, int idx);\n\n/*\n * Callback function typedefs\n */\ntypedef size_t (*RAND_DRBG_get_entropy_fn)(RAND_DRBG *drbg,\n unsigned char **pout,\n int entropy, size_t min_len,\n size_t max_len,\n int prediction_resistance);\ntypedef void (*RAND_DRBG_cleanup_entropy_fn)(RAND_DRBG *ctx,\n unsigned char *out, size_t outlen);\ntypedef size_t (*RAND_DRBG_get_nonce_fn)(RAND_DRBG *drbg, unsigned char **pout,\n int entropy, size_t min_len,\n size_t max_len);\ntypedef void (*RAND_DRBG_cleanup_nonce_fn)(RAND_DRBG *drbg,\n unsigned char *out, size_t outlen);\n\nint RAND_DRBG_set_callbacks(RAND_DRBG *drbg,\n RAND_DRBG_get_entropy_fn get_entropy,\n RAND_DRBG_cleanup_entropy_fn cleanup_entropy,\n RAND_DRBG_get_nonce_fn get_nonce,\n RAND_DRBG_cleanup_nonce_fn cleanup_nonce);\n\n\n# ifdef __cplusplus\n}\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/randerr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_RANDERR_H\n# define HEADER_RANDERR_H\n\n# include \n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_RAND_strings(void);\n\n/*\n * RAND function codes.\n */\n# define RAND_F_DATA_COLLECT_METHOD 127\n# define RAND_F_DRBG_BYTES 101\n# define RAND_F_DRBG_GET_ENTROPY 105\n# define RAND_F_DRBG_SETUP 117\n# define RAND_F_GET_ENTROPY 106\n# define RAND_F_RAND_BYTES 100\n# define RAND_F_RAND_DRBG_ENABLE_LOCKING 119\n# define RAND_F_RAND_DRBG_GENERATE 107\n# define RAND_F_RAND_DRBG_GET_ENTROPY 120\n# define RAND_F_RAND_DRBG_GET_NONCE 123\n# define RAND_F_RAND_DRBG_INSTANTIATE 108\n# define RAND_F_RAND_DRBG_NEW 109\n# define RAND_F_RAND_DRBG_RESEED 110\n# define RAND_F_RAND_DRBG_RESTART 102\n# define RAND_F_RAND_DRBG_SET 104\n# define RAND_F_RAND_DRBG_SET_DEFAULTS 121\n# define RAND_F_RAND_DRBG_UNINSTANTIATE 118\n# define RAND_F_RAND_LOAD_FILE 111\n# define RAND_F_RAND_POOL_ACQUIRE_ENTROPY 122\n# define RAND_F_RAND_POOL_ADD 103\n# define RAND_F_RAND_POOL_ADD_BEGIN 113\n# define RAND_F_RAND_POOL_ADD_END 114\n# define RAND_F_RAND_POOL_ATTACH 124\n# define RAND_F_RAND_POOL_BYTES_NEEDED 115\n# define RAND_F_RAND_POOL_GROW 125\n# define RAND_F_RAND_POOL_NEW 116\n# define RAND_F_RAND_PSEUDO_BYTES 126\n# define RAND_F_RAND_WRITE_FILE 112\n\n/*\n * RAND reason codes.\n */\n# define RAND_R_ADDITIONAL_INPUT_TOO_LONG 102\n# define RAND_R_ALREADY_INSTANTIATED 103\n# define RAND_R_ARGUMENT_OUT_OF_RANGE 105\n# define RAND_R_CANNOT_OPEN_FILE 121\n# define RAND_R_DRBG_ALREADY_INITIALIZED 129\n# define RAND_R_DRBG_NOT_INITIALISED 104\n# define RAND_R_ENTROPY_INPUT_TOO_LONG 106\n# define RAND_R_ENTROPY_OUT_OF_RANGE 124\n# define RAND_R_ERROR_ENTROPY_POOL_WAS_IGNORED 127\n# define RAND_R_ERROR_INITIALISING_DRBG 107\n# define RAND_R_ERROR_INSTANTIATING_DRBG 108\n# define RAND_R_ERROR_RETRIEVING_ADDITIONAL_INPUT 109\n# define RAND_R_ERROR_RETRIEVING_ENTROPY 110\n# define RAND_R_ERROR_RETRIEVING_NONCE 111\n# define RAND_R_FAILED_TO_CREATE_LOCK 126\n# define RAND_R_FUNC_NOT_IMPLEMENTED 101\n# define RAND_R_FWRITE_ERROR 123\n# define RAND_R_GENERATE_ERROR 112\n# define RAND_R_INTERNAL_ERROR 113\n# define RAND_R_IN_ERROR_STATE 114\n# define RAND_R_NOT_A_REGULAR_FILE 122\n# define RAND_R_NOT_INSTANTIATED 115\n# define RAND_R_NO_DRBG_IMPLEMENTATION_SELECTED 128\n# define RAND_R_PARENT_LOCKING_NOT_ENABLED 130\n# define RAND_R_PARENT_STRENGTH_TOO_WEAK 131\n# define RAND_R_PERSONALISATION_STRING_TOO_LONG 116\n# define RAND_R_PREDICTION_RESISTANCE_NOT_SUPPORTED 133\n# define RAND_R_PRNG_NOT_SEEDED 100\n# define RAND_R_RANDOM_POOL_OVERFLOW 125\n# define RAND_R_RANDOM_POOL_UNDERFLOW 134\n# define RAND_R_REQUEST_TOO_LARGE_FOR_DRBG 117\n# define RAND_R_RESEED_ERROR 118\n# define RAND_R_SELFTEST_FAILURE 119\n# define RAND_R_TOO_LITTLE_NONCE_REQUESTED 135\n# define RAND_R_TOO_MUCH_NONCE_REQUESTED 136\n# define RAND_R_UNSUPPORTED_DRBG_FLAGS 132\n# define RAND_R_UNSUPPORTED_DRBG_TYPE 120\n\n#endif\n" }, { "path": "cryptomini/include/openssl/rc2.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_RC2_H\n# define HEADER_RC2_H\n\n# include \n\n# ifndef OPENSSL_NO_RC2\n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\ntypedef unsigned int RC2_INT;\n\n# define RC2_ENCRYPT 1\n# define RC2_DECRYPT 0\n\n# define RC2_BLOCK 8\n# define RC2_KEY_LENGTH 16\n\ntypedef struct rc2_key_st {\n RC2_INT data[64];\n} RC2_KEY;\n\nvoid RC2_set_key(RC2_KEY *key, int len, const unsigned char *data, int bits);\nvoid RC2_ecb_encrypt(const unsigned char *in, unsigned char *out,\n RC2_KEY *key, int enc);\nvoid RC2_encrypt(unsigned long *data, RC2_KEY *key);\nvoid RC2_decrypt(unsigned long *data, RC2_KEY *key);\nvoid RC2_cbc_encrypt(const unsigned char *in, unsigned char *out, long length,\n RC2_KEY *ks, unsigned char *iv, int enc);\nvoid RC2_cfb64_encrypt(const unsigned char *in, unsigned char *out,\n long length, RC2_KEY *schedule, unsigned char *ivec,\n int *num, int enc);\nvoid RC2_ofb64_encrypt(const unsigned char *in, unsigned char *out,\n long length, RC2_KEY *schedule, unsigned char *ivec,\n int *num);\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/rc4.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_RC4_H\n# define HEADER_RC4_H\n\n# include \n\n# ifndef OPENSSL_NO_RC4\n# include \n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\ntypedef struct rc4_key_st {\n RC4_INT x, y;\n RC4_INT data[256];\n} RC4_KEY;\n\nconst char *RC4_options(void);\nvoid RC4_set_key(RC4_KEY *key, int len, const unsigned char *data);\nvoid RC4(RC4_KEY *key, size_t len, const unsigned char *indata,\n unsigned char *outdata);\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/rc5.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_RC5_H\n# define HEADER_RC5_H\n\n# include \n\n# ifndef OPENSSL_NO_RC5\n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n# define RC5_ENCRYPT 1\n# define RC5_DECRYPT 0\n\n# define RC5_32_INT unsigned int\n\n# define RC5_32_BLOCK 8\n# define RC5_32_KEY_LENGTH 16/* This is a default, max is 255 */\n\n/*\n * This are the only values supported. Tweak the code if you want more The\n * most supported modes will be RC5-32/12/16 RC5-32/16/8\n */\n# define RC5_8_ROUNDS 8\n# define RC5_12_ROUNDS 12\n# define RC5_16_ROUNDS 16\n\ntypedef struct rc5_key_st {\n /* Number of rounds */\n int rounds;\n RC5_32_INT data[2 * (RC5_16_ROUNDS + 1)];\n} RC5_32_KEY;\n\nvoid RC5_32_set_key(RC5_32_KEY *key, int len, const unsigned char *data,\n int rounds);\nvoid RC5_32_ecb_encrypt(const unsigned char *in, unsigned char *out,\n RC5_32_KEY *key, int enc);\nvoid RC5_32_encrypt(unsigned long *data, RC5_32_KEY *key);\nvoid RC5_32_decrypt(unsigned long *data, RC5_32_KEY *key);\nvoid RC5_32_cbc_encrypt(const unsigned char *in, unsigned char *out,\n long length, RC5_32_KEY *ks, unsigned char *iv,\n int enc);\nvoid RC5_32_cfb64_encrypt(const unsigned char *in, unsigned char *out,\n long length, RC5_32_KEY *schedule,\n unsigned char *ivec, int *num, int enc);\nvoid RC5_32_ofb64_encrypt(const unsigned char *in, unsigned char *out,\n long length, RC5_32_KEY *schedule,\n unsigned char *ivec, int *num);\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/ripemd.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_RIPEMD_H\n# define HEADER_RIPEMD_H\n\n# include \n\n#ifndef OPENSSL_NO_RMD160\n# include \n# include \n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n# define RIPEMD160_LONG unsigned int\n\n# define RIPEMD160_CBLOCK 64\n# define RIPEMD160_LBLOCK (RIPEMD160_CBLOCK/4)\n# define RIPEMD160_DIGEST_LENGTH 20\n\ntypedef struct RIPEMD160state_st {\n RIPEMD160_LONG A, B, C, D, E;\n RIPEMD160_LONG Nl, Nh;\n RIPEMD160_LONG data[RIPEMD160_LBLOCK];\n unsigned int num;\n} RIPEMD160_CTX;\n\nint RIPEMD160_Init(RIPEMD160_CTX *c);\nint RIPEMD160_Update(RIPEMD160_CTX *c, const void *data, size_t len);\nint RIPEMD160_Final(unsigned char *md, RIPEMD160_CTX *c);\nunsigned char *RIPEMD160(const unsigned char *d, size_t n, unsigned char *md);\nvoid RIPEMD160_Transform(RIPEMD160_CTX *c, const unsigned char *b);\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n\n#endif\n" }, { "path": "cryptomini/include/openssl/rsa.h", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_RSA_H\n# define HEADER_RSA_H\n\n# include \n\n# ifndef OPENSSL_NO_RSA\n# include \n# include \n# include \n# include \n# if OPENSSL_API_COMPAT < 0x10100000L\n# include \n# endif\n# include \n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n/* The types RSA and RSA_METHOD are defined in ossl_typ.h */\n\n# ifndef OPENSSL_RSA_MAX_MODULUS_BITS\n# define OPENSSL_RSA_MAX_MODULUS_BITS 16384\n# endif\n\n# define OPENSSL_RSA_FIPS_MIN_MODULUS_BITS 1024\n\n# ifndef OPENSSL_RSA_SMALL_MODULUS_BITS\n# define OPENSSL_RSA_SMALL_MODULUS_BITS 3072\n# endif\n# ifndef OPENSSL_RSA_MAX_PUBEXP_BITS\n\n/* exponent limit enforced for \"large\" modulus only */\n# define OPENSSL_RSA_MAX_PUBEXP_BITS 64\n# endif\n\n# define RSA_3 0x3L\n# define RSA_F4 0x10001L\n\n/* based on RFC 8017 appendix A.1.2 */\n# define RSA_ASN1_VERSION_DEFAULT 0\n# define RSA_ASN1_VERSION_MULTI 1\n\n# define RSA_DEFAULT_PRIME_NUM 2\n\n# define RSA_METHOD_FLAG_NO_CHECK 0x0001/* don't check pub/private\n * match */\n\n# define RSA_FLAG_CACHE_PUBLIC 0x0002\n# define RSA_FLAG_CACHE_PRIVATE 0x0004\n# define RSA_FLAG_BLINDING 0x0008\n# define RSA_FLAG_THREAD_SAFE 0x0010\n/*\n * This flag means the private key operations will be handled by rsa_mod_exp\n * and that they do not depend on the private key components being present:\n * for example a key stored in external hardware. Without this flag\n * bn_mod_exp gets called when private key components are absent.\n */\n# define RSA_FLAG_EXT_PKEY 0x0020\n\n/*\n * new with 0.9.6j and 0.9.7b; the built-in\n * RSA implementation now uses blinding by\n * default (ignoring RSA_FLAG_BLINDING),\n * but other engines might not need it\n */\n# define RSA_FLAG_NO_BLINDING 0x0080\n# if OPENSSL_API_COMPAT < 0x10100000L\n/*\n * Does nothing. Previously this switched off constant time behaviour.\n */\n# define RSA_FLAG_NO_CONSTTIME 0x0000\n# endif\n# if OPENSSL_API_COMPAT < 0x00908000L\n/* deprecated name for the flag*/\n/*\n * new with 0.9.7h; the built-in RSA\n * implementation now uses constant time\n * modular exponentiation for secret exponents\n * by default. This flag causes the\n * faster variable sliding window method to\n * be used for all exponents.\n */\n# define RSA_FLAG_NO_EXP_CONSTTIME RSA_FLAG_NO_CONSTTIME\n# endif\n\n# define EVP_PKEY_CTX_set_rsa_padding(ctx, pad) \\\n RSA_pkey_ctx_ctrl(ctx, -1, EVP_PKEY_CTRL_RSA_PADDING, pad, NULL)\n\n# define EVP_PKEY_CTX_get_rsa_padding(ctx, ppad) \\\n RSA_pkey_ctx_ctrl(ctx, -1, EVP_PKEY_CTRL_GET_RSA_PADDING, 0, ppad)\n\n# define EVP_PKEY_CTX_set_rsa_pss_saltlen(ctx, len) \\\n RSA_pkey_ctx_ctrl(ctx, (EVP_PKEY_OP_SIGN|EVP_PKEY_OP_VERIFY), \\\n EVP_PKEY_CTRL_RSA_PSS_SALTLEN, len, NULL)\n/* Salt length matches digest */\n# define RSA_PSS_SALTLEN_DIGEST -1\n/* Verify only: auto detect salt length */\n# define RSA_PSS_SALTLEN_AUTO -2\n/* Set salt length to maximum possible */\n# define RSA_PSS_SALTLEN_MAX -3\n/* Old compatible max salt length for sign only */\n# define RSA_PSS_SALTLEN_MAX_SIGN -2\n\n# define EVP_PKEY_CTX_set_rsa_pss_keygen_saltlen(ctx, len) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_RSA_PSS, EVP_PKEY_OP_KEYGEN, \\\n EVP_PKEY_CTRL_RSA_PSS_SALTLEN, len, NULL)\n\n# define EVP_PKEY_CTX_get_rsa_pss_saltlen(ctx, plen) \\\n RSA_pkey_ctx_ctrl(ctx, (EVP_PKEY_OP_SIGN|EVP_PKEY_OP_VERIFY), \\\n EVP_PKEY_CTRL_GET_RSA_PSS_SALTLEN, 0, plen)\n\n# define EVP_PKEY_CTX_set_rsa_keygen_bits(ctx, bits) \\\n RSA_pkey_ctx_ctrl(ctx, EVP_PKEY_OP_KEYGEN, \\\n EVP_PKEY_CTRL_RSA_KEYGEN_BITS, bits, NULL)\n\n# define EVP_PKEY_CTX_set_rsa_keygen_pubexp(ctx, pubexp) \\\n RSA_pkey_ctx_ctrl(ctx, EVP_PKEY_OP_KEYGEN, \\\n EVP_PKEY_CTRL_RSA_KEYGEN_PUBEXP, 0, pubexp)\n\n# define EVP_PKEY_CTX_set_rsa_keygen_primes(ctx, primes) \\\n RSA_pkey_ctx_ctrl(ctx, EVP_PKEY_OP_KEYGEN, \\\n EVP_PKEY_CTRL_RSA_KEYGEN_PRIMES, primes, NULL)\n\n# define EVP_PKEY_CTX_set_rsa_mgf1_md(ctx, md) \\\n RSA_pkey_ctx_ctrl(ctx, EVP_PKEY_OP_TYPE_SIG | EVP_PKEY_OP_TYPE_CRYPT, \\\n EVP_PKEY_CTRL_RSA_MGF1_MD, 0, (void *)(md))\n\n# define EVP_PKEY_CTX_set_rsa_pss_keygen_mgf1_md(ctx, md) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_RSA_PSS, EVP_PKEY_OP_KEYGEN, \\\n EVP_PKEY_CTRL_RSA_MGF1_MD, 0, (void *)(md))\n\n# define EVP_PKEY_CTX_set_rsa_oaep_md(ctx, md) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_RSA, EVP_PKEY_OP_TYPE_CRYPT, \\\n EVP_PKEY_CTRL_RSA_OAEP_MD, 0, (void *)(md))\n\n# define EVP_PKEY_CTX_get_rsa_mgf1_md(ctx, pmd) \\\n RSA_pkey_ctx_ctrl(ctx, EVP_PKEY_OP_TYPE_SIG | EVP_PKEY_OP_TYPE_CRYPT, \\\n EVP_PKEY_CTRL_GET_RSA_MGF1_MD, 0, (void *)(pmd))\n\n# define EVP_PKEY_CTX_get_rsa_oaep_md(ctx, pmd) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_RSA, EVP_PKEY_OP_TYPE_CRYPT, \\\n EVP_PKEY_CTRL_GET_RSA_OAEP_MD, 0, (void *)(pmd))\n\n# define EVP_PKEY_CTX_set0_rsa_oaep_label(ctx, l, llen) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_RSA, EVP_PKEY_OP_TYPE_CRYPT, \\\n EVP_PKEY_CTRL_RSA_OAEP_LABEL, llen, (void *)(l))\n\n# define EVP_PKEY_CTX_get0_rsa_oaep_label(ctx, l) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_RSA, EVP_PKEY_OP_TYPE_CRYPT, \\\n EVP_PKEY_CTRL_GET_RSA_OAEP_LABEL, 0, (void *)(l))\n\n# define EVP_PKEY_CTX_set_rsa_pss_keygen_md(ctx, md) \\\n EVP_PKEY_CTX_ctrl(ctx, EVP_PKEY_RSA_PSS, \\\n EVP_PKEY_OP_KEYGEN, EVP_PKEY_CTRL_MD, \\\n 0, (void *)(md))\n\n# define EVP_PKEY_CTRL_RSA_PADDING (EVP_PKEY_ALG_CTRL + 1)\n# define EVP_PKEY_CTRL_RSA_PSS_SALTLEN (EVP_PKEY_ALG_CTRL + 2)\n\n# define EVP_PKEY_CTRL_RSA_KEYGEN_BITS (EVP_PKEY_ALG_CTRL + 3)\n# define EVP_PKEY_CTRL_RSA_KEYGEN_PUBEXP (EVP_PKEY_ALG_CTRL + 4)\n# define EVP_PKEY_CTRL_RSA_MGF1_MD (EVP_PKEY_ALG_CTRL + 5)\n\n# define EVP_PKEY_CTRL_GET_RSA_PADDING (EVP_PKEY_ALG_CTRL + 6)\n# define EVP_PKEY_CTRL_GET_RSA_PSS_SALTLEN (EVP_PKEY_ALG_CTRL + 7)\n# define EVP_PKEY_CTRL_GET_RSA_MGF1_MD (EVP_PKEY_ALG_CTRL + 8)\n\n# define EVP_PKEY_CTRL_RSA_OAEP_MD (EVP_PKEY_ALG_CTRL + 9)\n# define EVP_PKEY_CTRL_RSA_OAEP_LABEL (EVP_PKEY_ALG_CTRL + 10)\n\n# define EVP_PKEY_CTRL_GET_RSA_OAEP_MD (EVP_PKEY_ALG_CTRL + 11)\n# define EVP_PKEY_CTRL_GET_RSA_OAEP_LABEL (EVP_PKEY_ALG_CTRL + 12)\n\n# define EVP_PKEY_CTRL_RSA_KEYGEN_PRIMES (EVP_PKEY_ALG_CTRL + 13)\n\n# define RSA_PKCS1_PADDING 1\n# define RSA_SSLV23_PADDING 2\n# define RSA_NO_PADDING 3\n# define RSA_PKCS1_OAEP_PADDING 4\n# define RSA_X931_PADDING 5\n/* EVP_PKEY_ only */\n# define RSA_PKCS1_PSS_PADDING 6\n\n# define RSA_PKCS1_PADDING_SIZE 11\n\n# define RSA_set_app_data(s,arg) RSA_set_ex_data(s,0,arg)\n# define RSA_get_app_data(s) RSA_get_ex_data(s,0)\n\nRSA *RSA_new(void);\nRSA *RSA_new_method(ENGINE *engine);\nint RSA_bits(const RSA *rsa);\nint RSA_size(const RSA *rsa);\nint RSA_security_bits(const RSA *rsa);\n\nint RSA_set0_key(RSA *r, BIGNUM *n, BIGNUM *e, BIGNUM *d);\nint RSA_set0_factors(RSA *r, BIGNUM *p, BIGNUM *q);\nint RSA_set0_crt_params(RSA *r,BIGNUM *dmp1, BIGNUM *dmq1, BIGNUM *iqmp);\nint RSA_set0_multi_prime_params(RSA *r, BIGNUM *primes[], BIGNUM *exps[],\n BIGNUM *coeffs[], int pnum);\nvoid RSA_get0_key(const RSA *r,\n const BIGNUM **n, const BIGNUM **e, const BIGNUM **d);\nvoid RSA_get0_factors(const RSA *r, const BIGNUM **p, const BIGNUM **q);\nint RSA_get_multi_prime_extra_count(const RSA *r);\nint RSA_get0_multi_prime_factors(const RSA *r, const BIGNUM *primes[]);\nvoid RSA_get0_crt_params(const RSA *r,\n const BIGNUM **dmp1, const BIGNUM **dmq1,\n const BIGNUM **iqmp);\nint RSA_get0_multi_prime_crt_params(const RSA *r, const BIGNUM *exps[],\n const BIGNUM *coeffs[]);\nconst BIGNUM *RSA_get0_n(const RSA *d);\nconst BIGNUM *RSA_get0_e(const RSA *d);\nconst BIGNUM *RSA_get0_d(const RSA *d);\nconst BIGNUM *RSA_get0_p(const RSA *d);\nconst BIGNUM *RSA_get0_q(const RSA *d);\nconst BIGNUM *RSA_get0_dmp1(const RSA *r);\nconst BIGNUM *RSA_get0_dmq1(const RSA *r);\nconst BIGNUM *RSA_get0_iqmp(const RSA *r);\nconst RSA_PSS_PARAMS *RSA_get0_pss_params(const RSA *r);\nvoid RSA_clear_flags(RSA *r, int flags);\nint RSA_test_flags(const RSA *r, int flags);\nvoid RSA_set_flags(RSA *r, int flags);\nint RSA_get_version(RSA *r);\nENGINE *RSA_get0_engine(const RSA *r);\n\n/* Deprecated version */\nDEPRECATEDIN_0_9_8(RSA *RSA_generate_key(int bits, unsigned long e, void\n (*callback) (int, int, void *),\n void *cb_arg))\n\n/* New version */\nint RSA_generate_key_ex(RSA *rsa, int bits, BIGNUM *e, BN_GENCB *cb);\n/* Multi-prime version */\nint RSA_generate_multi_prime_key(RSA *rsa, int bits, int primes,\n BIGNUM *e, BN_GENCB *cb);\n\nint RSA_X931_derive_ex(RSA *rsa, BIGNUM *p1, BIGNUM *p2, BIGNUM *q1,\n BIGNUM *q2, const BIGNUM *Xp1, const BIGNUM *Xp2,\n const BIGNUM *Xp, const BIGNUM *Xq1, const BIGNUM *Xq2,\n const BIGNUM *Xq, const BIGNUM *e, BN_GENCB *cb);\nint RSA_X931_generate_key_ex(RSA *rsa, int bits, const BIGNUM *e,\n BN_GENCB *cb);\n\nint RSA_check_key(const RSA *);\nint RSA_check_key_ex(const RSA *, BN_GENCB *cb);\n /* next 4 return -1 on error */\nint RSA_public_encrypt(int flen, const unsigned char *from,\n unsigned char *to, RSA *rsa, int padding);\nint RSA_private_encrypt(int flen, const unsigned char *from,\n unsigned char *to, RSA *rsa, int padding);\nint RSA_public_decrypt(int flen, const unsigned char *from,\n unsigned char *to, RSA *rsa, int padding);\nint RSA_private_decrypt(int flen, const unsigned char *from,\n unsigned char *to, RSA *rsa, int padding);\nvoid RSA_free(RSA *r);\n/* \"up\" the RSA object's reference count */\nint RSA_up_ref(RSA *r);\n\nint RSA_flags(const RSA *r);\n\nvoid RSA_set_default_method(const RSA_METHOD *meth);\nconst RSA_METHOD *RSA_get_default_method(void);\nconst RSA_METHOD *RSA_null_method(void);\nconst RSA_METHOD *RSA_get_method(const RSA *rsa);\nint RSA_set_method(RSA *rsa, const RSA_METHOD *meth);\n\n/* these are the actual RSA functions */\nconst RSA_METHOD *RSA_PKCS1_OpenSSL(void);\n\nint RSA_pkey_ctx_ctrl(EVP_PKEY_CTX *ctx, int optype, int cmd, int p1, void *p2);\n\nDECLARE_ASN1_ENCODE_FUNCTIONS_const(RSA, RSAPublicKey)\nDECLARE_ASN1_ENCODE_FUNCTIONS_const(RSA, RSAPrivateKey)\n\nstruct rsa_pss_params_st {\n X509_ALGOR *hashAlgorithm;\n X509_ALGOR *maskGenAlgorithm;\n ASN1_INTEGER *saltLength;\n ASN1_INTEGER *trailerField;\n /* Decoded hash algorithm from maskGenAlgorithm */\n X509_ALGOR *maskHash;\n};\n\nDECLARE_ASN1_FUNCTIONS(RSA_PSS_PARAMS)\n\ntypedef struct rsa_oaep_params_st {\n X509_ALGOR *hashFunc;\n X509_ALGOR *maskGenFunc;\n X509_ALGOR *pSourceFunc;\n /* Decoded hash algorithm from maskGenFunc */\n X509_ALGOR *maskHash;\n} RSA_OAEP_PARAMS;\n\nDECLARE_ASN1_FUNCTIONS(RSA_OAEP_PARAMS)\n\n# ifndef OPENSSL_NO_STDIO\nint RSA_print_fp(FILE *fp, const RSA *r, int offset);\n# endif\n\nint RSA_print(BIO *bp, const RSA *r, int offset);\n\n/*\n * The following 2 functions sign and verify a X509_SIG ASN1 object inside\n * PKCS#1 padded RSA encryption\n */\nint RSA_sign(int type, const unsigned char *m, unsigned int m_length,\n unsigned char *sigret, unsigned int *siglen, RSA *rsa);\nint RSA_verify(int type, const unsigned char *m, unsigned int m_length,\n const unsigned char *sigbuf, unsigned int siglen, RSA *rsa);\n\n/*\n * The following 2 function sign and verify a ASN1_OCTET_STRING object inside\n * PKCS#1 padded RSA encryption\n */\nint RSA_sign_ASN1_OCTET_STRING(int type,\n const unsigned char *m, unsigned int m_length,\n unsigned char *sigret, unsigned int *siglen,\n RSA *rsa);\nint RSA_verify_ASN1_OCTET_STRING(int type, const unsigned char *m,\n unsigned int m_length, unsigned char *sigbuf,\n unsigned int siglen, RSA *rsa);\n\nint RSA_blinding_on(RSA *rsa, BN_CTX *ctx);\nvoid RSA_blinding_off(RSA *rsa);\nBN_BLINDING *RSA_setup_blinding(RSA *rsa, BN_CTX *ctx);\n\nint RSA_padding_add_PKCS1_type_1(unsigned char *to, int tlen,\n const unsigned char *f, int fl);\nint RSA_padding_check_PKCS1_type_1(unsigned char *to, int tlen,\n const unsigned char *f, int fl,\n int rsa_len);\nint RSA_padding_add_PKCS1_type_2(unsigned char *to, int tlen,\n const unsigned char *f, int fl);\nint RSA_padding_check_PKCS1_type_2(unsigned char *to, int tlen,\n const unsigned char *f, int fl,\n int rsa_len);\nint PKCS1_MGF1(unsigned char *mask, long len, const unsigned char *seed,\n long seedlen, const EVP_MD *dgst);\nint RSA_padding_add_PKCS1_OAEP(unsigned char *to, int tlen,\n const unsigned char *f, int fl,\n const unsigned char *p, int pl);\nint RSA_padding_check_PKCS1_OAEP(unsigned char *to, int tlen,\n const unsigned char *f, int fl, int rsa_len,\n const unsigned char *p, int pl);\nint RSA_padding_add_PKCS1_OAEP_mgf1(unsigned char *to, int tlen,\n const unsigned char *from, int flen,\n const unsigned char *param, int plen,\n const EVP_MD *md, const EVP_MD *mgf1md);\nint RSA_padding_check_PKCS1_OAEP_mgf1(unsigned char *to, int tlen,\n const unsigned char *from, int flen,\n int num, const unsigned char *param,\n int plen, const EVP_MD *md,\n const EVP_MD *mgf1md);\nint RSA_padding_add_SSLv23(unsigned char *to, int tlen,\n const unsigned char *f, int fl);\nint RSA_padding_check_SSLv23(unsigned char *to, int tlen,\n const unsigned char *f, int fl, int rsa_len);\nint RSA_padding_add_none(unsigned char *to, int tlen, const unsigned char *f,\n int fl);\nint RSA_padding_check_none(unsigned char *to, int tlen,\n const unsigned char *f, int fl, int rsa_len);\nint RSA_padding_add_X931(unsigned char *to, int tlen, const unsigned char *f,\n int fl);\nint RSA_padding_check_X931(unsigned char *to, int tlen,\n const unsigned char *f, int fl, int rsa_len);\nint RSA_X931_hash_id(int nid);\n\nint RSA_verify_PKCS1_PSS(RSA *rsa, const unsigned char *mHash,\n const EVP_MD *Hash, const unsigned char *EM,\n int sLen);\nint RSA_padding_add_PKCS1_PSS(RSA *rsa, unsigned char *EM,\n const unsigned char *mHash, const EVP_MD *Hash,\n int sLen);\n\nint RSA_verify_PKCS1_PSS_mgf1(RSA *rsa, const unsigned char *mHash,\n const EVP_MD *Hash, const EVP_MD *mgf1Hash,\n const unsigned char *EM, int sLen);\n\nint RSA_padding_add_PKCS1_PSS_mgf1(RSA *rsa, unsigned char *EM,\n const unsigned char *mHash,\n const EVP_MD *Hash, const EVP_MD *mgf1Hash,\n int sLen);\n\n#define RSA_get_ex_new_index(l, p, newf, dupf, freef) \\\n CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_RSA, l, p, newf, dupf, freef)\nint RSA_set_ex_data(RSA *r, int idx, void *arg);\nvoid *RSA_get_ex_data(const RSA *r, int idx);\n\nRSA *RSAPublicKey_dup(RSA *rsa);\nRSA *RSAPrivateKey_dup(RSA *rsa);\n\n/*\n * If this flag is set the RSA method is FIPS compliant and can be used in\n * FIPS mode. This is set in the validated module method. If an application\n * sets this flag in its own methods it is its responsibility to ensure the\n * result is compliant.\n */\n\n# define RSA_FLAG_FIPS_METHOD 0x0400\n\n/*\n * If this flag is set the operations normally disabled in FIPS mode are\n * permitted it is then the applications responsibility to ensure that the\n * usage is compliant.\n */\n\n# define RSA_FLAG_NON_FIPS_ALLOW 0x0400\n/*\n * Application has decided PRNG is good enough to generate a key: don't\n * check.\n */\n# define RSA_FLAG_CHECKED 0x0800\n\nRSA_METHOD *RSA_meth_new(const char *name, int flags);\nvoid RSA_meth_free(RSA_METHOD *meth);\nRSA_METHOD *RSA_meth_dup(const RSA_METHOD *meth);\nconst char *RSA_meth_get0_name(const RSA_METHOD *meth);\nint RSA_meth_set1_name(RSA_METHOD *meth, const char *name);\nint RSA_meth_get_flags(const RSA_METHOD *meth);\nint RSA_meth_set_flags(RSA_METHOD *meth, int flags);\nvoid *RSA_meth_get0_app_data(const RSA_METHOD *meth);\nint RSA_meth_set0_app_data(RSA_METHOD *meth, void *app_data);\nint (*RSA_meth_get_pub_enc(const RSA_METHOD *meth))\n (int flen, const unsigned char *from,\n unsigned char *to, RSA *rsa, int padding);\nint RSA_meth_set_pub_enc(RSA_METHOD *rsa,\n int (*pub_enc) (int flen, const unsigned char *from,\n unsigned char *to, RSA *rsa,\n int padding));\nint (*RSA_meth_get_pub_dec(const RSA_METHOD *meth))\n (int flen, const unsigned char *from,\n unsigned char *to, RSA *rsa, int padding);\nint RSA_meth_set_pub_dec(RSA_METHOD *rsa,\n int (*pub_dec) (int flen, const unsigned char *from,\n unsigned char *to, RSA *rsa,\n int padding));\nint (*RSA_meth_get_priv_enc(const RSA_METHOD *meth))\n (int flen, const unsigned char *from,\n unsigned char *to, RSA *rsa, int padding);\nint RSA_meth_set_priv_enc(RSA_METHOD *rsa,\n int (*priv_enc) (int flen, const unsigned char *from,\n unsigned char *to, RSA *rsa,\n int padding));\nint (*RSA_meth_get_priv_dec(const RSA_METHOD *meth))\n (int flen, const unsigned char *from,\n unsigned char *to, RSA *rsa, int padding);\nint RSA_meth_set_priv_dec(RSA_METHOD *rsa,\n int (*priv_dec) (int flen, const unsigned char *from,\n unsigned char *to, RSA *rsa,\n int padding));\nint (*RSA_meth_get_mod_exp(const RSA_METHOD *meth))\n (BIGNUM *r0, const BIGNUM *i, RSA *rsa, BN_CTX *ctx);\nint RSA_meth_set_mod_exp(RSA_METHOD *rsa,\n int (*mod_exp) (BIGNUM *r0, const BIGNUM *i, RSA *rsa,\n BN_CTX *ctx));\nint (*RSA_meth_get_bn_mod_exp(const RSA_METHOD *meth))\n (BIGNUM *r, const BIGNUM *a, const BIGNUM *p,\n const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);\nint RSA_meth_set_bn_mod_exp(RSA_METHOD *rsa,\n int (*bn_mod_exp) (BIGNUM *r,\n const BIGNUM *a,\n const BIGNUM *p,\n const BIGNUM *m,\n BN_CTX *ctx,\n BN_MONT_CTX *m_ctx));\nint (*RSA_meth_get_init(const RSA_METHOD *meth)) (RSA *rsa);\nint RSA_meth_set_init(RSA_METHOD *rsa, int (*init) (RSA *rsa));\nint (*RSA_meth_get_finish(const RSA_METHOD *meth)) (RSA *rsa);\nint RSA_meth_set_finish(RSA_METHOD *rsa, int (*finish) (RSA *rsa));\nint (*RSA_meth_get_sign(const RSA_METHOD *meth))\n (int type,\n const unsigned char *m, unsigned int m_length,\n unsigned char *sigret, unsigned int *siglen,\n const RSA *rsa);\nint RSA_meth_set_sign(RSA_METHOD *rsa,\n int (*sign) (int type, const unsigned char *m,\n unsigned int m_length,\n unsigned char *sigret, unsigned int *siglen,\n const RSA *rsa));\nint (*RSA_meth_get_verify(const RSA_METHOD *meth))\n (int dtype, const unsigned char *m,\n unsigned int m_length, const unsigned char *sigbuf,\n unsigned int siglen, const RSA *rsa);\nint RSA_meth_set_verify(RSA_METHOD *rsa,\n int (*verify) (int dtype, const unsigned char *m,\n unsigned int m_length,\n const unsigned char *sigbuf,\n unsigned int siglen, const RSA *rsa));\nint (*RSA_meth_get_keygen(const RSA_METHOD *meth))\n (RSA *rsa, int bits, BIGNUM *e, BN_GENCB *cb);\nint RSA_meth_set_keygen(RSA_METHOD *rsa,\n int (*keygen) (RSA *rsa, int bits, BIGNUM *e,\n BN_GENCB *cb));\nint (*RSA_meth_get_multi_prime_keygen(const RSA_METHOD *meth))\n (RSA *rsa, int bits, int primes, BIGNUM *e, BN_GENCB *cb);\nint RSA_meth_set_multi_prime_keygen(RSA_METHOD *meth,\n int (*keygen) (RSA *rsa, int bits,\n int primes, BIGNUM *e,\n BN_GENCB *cb));\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/rsaerr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_RSAERR_H\n# define HEADER_RSAERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_RSA_strings(void);\n\n/*\n * RSA function codes.\n */\n# define RSA_F_CHECK_PADDING_MD 140\n# define RSA_F_ENCODE_PKCS1 146\n# define RSA_F_INT_RSA_VERIFY 145\n# define RSA_F_OLD_RSA_PRIV_DECODE 147\n# define RSA_F_PKEY_PSS_INIT 165\n# define RSA_F_PKEY_RSA_CTRL 143\n# define RSA_F_PKEY_RSA_CTRL_STR 144\n# define RSA_F_PKEY_RSA_SIGN 142\n# define RSA_F_PKEY_RSA_VERIFY 149\n# define RSA_F_PKEY_RSA_VERIFYRECOVER 141\n# define RSA_F_RSA_ALGOR_TO_MD 156\n# define RSA_F_RSA_BUILTIN_KEYGEN 129\n# define RSA_F_RSA_CHECK_KEY 123\n# define RSA_F_RSA_CHECK_KEY_EX 160\n# define RSA_F_RSA_CMS_DECRYPT 159\n# define RSA_F_RSA_CMS_VERIFY 158\n# define RSA_F_RSA_ITEM_VERIFY 148\n# define RSA_F_RSA_METH_DUP 161\n# define RSA_F_RSA_METH_NEW 162\n# define RSA_F_RSA_METH_SET1_NAME 163\n# define RSA_F_RSA_MGF1_TO_MD 157\n# define RSA_F_RSA_MULTIP_INFO_NEW 166\n# define RSA_F_RSA_NEW_METHOD 106\n# define RSA_F_RSA_NULL 124\n# define RSA_F_RSA_NULL_PRIVATE_DECRYPT 132\n# define RSA_F_RSA_NULL_PRIVATE_ENCRYPT 133\n# define RSA_F_RSA_NULL_PUBLIC_DECRYPT 134\n# define RSA_F_RSA_NULL_PUBLIC_ENCRYPT 135\n# define RSA_F_RSA_OSSL_PRIVATE_DECRYPT 101\n# define RSA_F_RSA_OSSL_PRIVATE_ENCRYPT 102\n# define RSA_F_RSA_OSSL_PUBLIC_DECRYPT 103\n# define RSA_F_RSA_OSSL_PUBLIC_ENCRYPT 104\n# define RSA_F_RSA_PADDING_ADD_NONE 107\n# define RSA_F_RSA_PADDING_ADD_PKCS1_OAEP 121\n# define RSA_F_RSA_PADDING_ADD_PKCS1_OAEP_MGF1 154\n# define RSA_F_RSA_PADDING_ADD_PKCS1_PSS 125\n# define RSA_F_RSA_PADDING_ADD_PKCS1_PSS_MGF1 152\n# define RSA_F_RSA_PADDING_ADD_PKCS1_TYPE_1 108\n# define RSA_F_RSA_PADDING_ADD_PKCS1_TYPE_2 109\n# define RSA_F_RSA_PADDING_ADD_SSLV23 110\n# define RSA_F_RSA_PADDING_ADD_X931 127\n# define RSA_F_RSA_PADDING_CHECK_NONE 111\n# define RSA_F_RSA_PADDING_CHECK_PKCS1_OAEP 122\n# define RSA_F_RSA_PADDING_CHECK_PKCS1_OAEP_MGF1 153\n# define RSA_F_RSA_PADDING_CHECK_PKCS1_TYPE_1 112\n# define RSA_F_RSA_PADDING_CHECK_PKCS1_TYPE_2 113\n# define RSA_F_RSA_PADDING_CHECK_SSLV23 114\n# define RSA_F_RSA_PADDING_CHECK_X931 128\n# define RSA_F_RSA_PARAM_DECODE 164\n# define RSA_F_RSA_PRINT 115\n# define RSA_F_RSA_PRINT_FP 116\n# define RSA_F_RSA_PRIV_DECODE 150\n# define RSA_F_RSA_PRIV_ENCODE 138\n# define RSA_F_RSA_PSS_GET_PARAM 151\n# define RSA_F_RSA_PSS_TO_CTX 155\n# define RSA_F_RSA_PUB_DECODE 139\n# define RSA_F_RSA_SETUP_BLINDING 136\n# define RSA_F_RSA_SIGN 117\n# define RSA_F_RSA_SIGN_ASN1_OCTET_STRING 118\n# define RSA_F_RSA_VERIFY 119\n# define RSA_F_RSA_VERIFY_ASN1_OCTET_STRING 120\n# define RSA_F_RSA_VERIFY_PKCS1_PSS_MGF1 126\n# define RSA_F_SETUP_TBUF 167\n\n/*\n * RSA reason codes.\n */\n# define RSA_R_ALGORITHM_MISMATCH 100\n# define RSA_R_BAD_E_VALUE 101\n# define RSA_R_BAD_FIXED_HEADER_DECRYPT 102\n# define RSA_R_BAD_PAD_BYTE_COUNT 103\n# define RSA_R_BAD_SIGNATURE 104\n# define RSA_R_BLOCK_TYPE_IS_NOT_01 106\n# define RSA_R_BLOCK_TYPE_IS_NOT_02 107\n# define RSA_R_DATA_GREATER_THAN_MOD_LEN 108\n# define RSA_R_DATA_TOO_LARGE 109\n# define RSA_R_DATA_TOO_LARGE_FOR_KEY_SIZE 110\n# define RSA_R_DATA_TOO_LARGE_FOR_MODULUS 132\n# define RSA_R_DATA_TOO_SMALL 111\n# define RSA_R_DATA_TOO_SMALL_FOR_KEY_SIZE 122\n# define RSA_R_DIGEST_DOES_NOT_MATCH 158\n# define RSA_R_DIGEST_NOT_ALLOWED 145\n# define RSA_R_DIGEST_TOO_BIG_FOR_RSA_KEY 112\n# define RSA_R_DMP1_NOT_CONGRUENT_TO_D 124\n# define RSA_R_DMQ1_NOT_CONGRUENT_TO_D 125\n# define RSA_R_D_E_NOT_CONGRUENT_TO_1 123\n# define RSA_R_FIRST_OCTET_INVALID 133\n# define RSA_R_ILLEGAL_OR_UNSUPPORTED_PADDING_MODE 144\n# define RSA_R_INVALID_DIGEST 157\n# define RSA_R_INVALID_DIGEST_LENGTH 143\n# define RSA_R_INVALID_HEADER 137\n# define RSA_R_INVALID_LABEL 160\n# define RSA_R_INVALID_MESSAGE_LENGTH 131\n# define RSA_R_INVALID_MGF1_MD 156\n# define RSA_R_INVALID_MULTI_PRIME_KEY 167\n# define RSA_R_INVALID_OAEP_PARAMETERS 161\n# define RSA_R_INVALID_PADDING 138\n# define RSA_R_INVALID_PADDING_MODE 141\n# define RSA_R_INVALID_PSS_PARAMETERS 149\n# define RSA_R_INVALID_PSS_SALTLEN 146\n# define RSA_R_INVALID_SALT_LENGTH 150\n# define RSA_R_INVALID_TRAILER 139\n# define RSA_R_INVALID_X931_DIGEST 142\n# define RSA_R_IQMP_NOT_INVERSE_OF_Q 126\n# define RSA_R_KEY_PRIME_NUM_INVALID 165\n# define RSA_R_KEY_SIZE_TOO_SMALL 120\n# define RSA_R_LAST_OCTET_INVALID 134\n# define RSA_R_MISSING_PRIVATE_KEY 179\n# define RSA_R_MGF1_DIGEST_NOT_ALLOWED 152\n# define RSA_R_MODULUS_TOO_LARGE 105\n# define RSA_R_MP_COEFFICIENT_NOT_INVERSE_OF_R 168\n# define RSA_R_MP_EXPONENT_NOT_CONGRUENT_TO_D 169\n# define RSA_R_MP_R_NOT_PRIME 170\n# define RSA_R_NO_PUBLIC_EXPONENT 140\n# define RSA_R_NULL_BEFORE_BLOCK_MISSING 113\n# define RSA_R_N_DOES_NOT_EQUAL_PRODUCT_OF_PRIMES 172\n# define RSA_R_N_DOES_NOT_EQUAL_P_Q 127\n# define RSA_R_OAEP_DECODING_ERROR 121\n# define RSA_R_OPERATION_NOT_SUPPORTED_FOR_THIS_KEYTYPE 148\n# define RSA_R_PADDING_CHECK_FAILED 114\n# define RSA_R_PKCS_DECODING_ERROR 159\n# define RSA_R_PSS_SALTLEN_TOO_SMALL 164\n# define RSA_R_P_NOT_PRIME 128\n# define RSA_R_Q_NOT_PRIME 129\n# define RSA_R_RSA_OPERATIONS_NOT_SUPPORTED 130\n# define RSA_R_SLEN_CHECK_FAILED 136\n# define RSA_R_SLEN_RECOVERY_FAILED 135\n# define RSA_R_SSLV3_ROLLBACK_ATTACK 115\n# define RSA_R_THE_ASN1_OBJECT_IDENTIFIER_IS_NOT_KNOWN_FOR_THIS_MD 116\n# define RSA_R_UNKNOWN_ALGORITHM_TYPE 117\n# define RSA_R_UNKNOWN_DIGEST 166\n# define RSA_R_UNKNOWN_MASK_DIGEST 151\n# define RSA_R_UNKNOWN_PADDING_TYPE 118\n# define RSA_R_UNSUPPORTED_ENCRYPTION_TYPE 162\n# define RSA_R_UNSUPPORTED_LABEL_SOURCE 163\n# define RSA_R_UNSUPPORTED_MASK_ALGORITHM 153\n# define RSA_R_UNSUPPORTED_MASK_PARAMETER 154\n# define RSA_R_UNSUPPORTED_SIGNATURE_TYPE 155\n# define RSA_R_VALUE_MISSING 147\n# define RSA_R_WRONG_SIGNATURE_LENGTH 119\n\n#endif\n" }, { "path": "cryptomini/include/openssl/safestack.h", "content": "/*\n * Copyright 1999-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_SAFESTACK_H\n# define HEADER_SAFESTACK_H\n\n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# define STACK_OF(type) struct stack_st_##type\n\n# define SKM_DEFINE_STACK_OF(t1, t2, t3) \\\n STACK_OF(t1); \\\n typedef int (*sk_##t1##_compfunc)(const t3 * const *a, const t3 *const *b); \\\n typedef void (*sk_##t1##_freefunc)(t3 *a); \\\n typedef t3 * (*sk_##t1##_copyfunc)(const t3 *a); \\\n static ossl_unused ossl_inline int sk_##t1##_num(const STACK_OF(t1) *sk) \\\n { \\\n return OPENSSL_sk_num((const OPENSSL_STACK *)sk); \\\n } \\\n static ossl_unused ossl_inline t2 *sk_##t1##_value(const STACK_OF(t1) *sk, int idx) \\\n { \\\n return (t2 *)OPENSSL_sk_value((const OPENSSL_STACK *)sk, idx); \\\n } \\\n static ossl_unused ossl_inline STACK_OF(t1) *sk_##t1##_new(sk_##t1##_compfunc compare) \\\n { \\\n return (STACK_OF(t1) *)OPENSSL_sk_new((OPENSSL_sk_compfunc)compare); \\\n } \\\n static ossl_unused ossl_inline STACK_OF(t1) *sk_##t1##_new_null(void) \\\n { \\\n return (STACK_OF(t1) *)OPENSSL_sk_new_null(); \\\n } \\\n static ossl_unused ossl_inline STACK_OF(t1) *sk_##t1##_new_reserve(sk_##t1##_compfunc compare, int n) \\\n { \\\n return (STACK_OF(t1) *)OPENSSL_sk_new_reserve((OPENSSL_sk_compfunc)compare, n); \\\n } \\\n static ossl_unused ossl_inline int sk_##t1##_reserve(STACK_OF(t1) *sk, int n) \\\n { \\\n return OPENSSL_sk_reserve((OPENSSL_STACK *)sk, n); \\\n } \\\n static ossl_unused ossl_inline void sk_##t1##_free(STACK_OF(t1) *sk) \\\n { \\\n OPENSSL_sk_free((OPENSSL_STACK *)sk); \\\n } \\\n static ossl_unused ossl_inline void sk_##t1##_zero(STACK_OF(t1) *sk) \\\n { \\\n OPENSSL_sk_zero((OPENSSL_STACK *)sk); \\\n } \\\n static ossl_unused ossl_inline t2 *sk_##t1##_delete(STACK_OF(t1) *sk, int i) \\\n { \\\n return (t2 *)OPENSSL_sk_delete((OPENSSL_STACK *)sk, i); \\\n } \\\n static ossl_unused ossl_inline t2 *sk_##t1##_delete_ptr(STACK_OF(t1) *sk, t2 *ptr) \\\n { \\\n return (t2 *)OPENSSL_sk_delete_ptr((OPENSSL_STACK *)sk, \\\n (const void *)ptr); \\\n } \\\n static ossl_unused ossl_inline int sk_##t1##_push(STACK_OF(t1) *sk, t2 *ptr) \\\n { \\\n return OPENSSL_sk_push((OPENSSL_STACK *)sk, (const void *)ptr); \\\n } \\\n static ossl_unused ossl_inline int sk_##t1##_unshift(STACK_OF(t1) *sk, t2 *ptr) \\\n { \\\n return OPENSSL_sk_unshift((OPENSSL_STACK *)sk, (const void *)ptr); \\\n } \\\n static ossl_unused ossl_inline t2 *sk_##t1##_pop(STACK_OF(t1) *sk) \\\n { \\\n return (t2 *)OPENSSL_sk_pop((OPENSSL_STACK *)sk); \\\n } \\\n static ossl_unused ossl_inline t2 *sk_##t1##_shift(STACK_OF(t1) *sk) \\\n { \\\n return (t2 *)OPENSSL_sk_shift((OPENSSL_STACK *)sk); \\\n } \\\n static ossl_unused ossl_inline void sk_##t1##_pop_free(STACK_OF(t1) *sk, sk_##t1##_freefunc freefunc) \\\n { \\\n OPENSSL_sk_pop_free((OPENSSL_STACK *)sk, (OPENSSL_sk_freefunc)freefunc); \\\n } \\\n static ossl_unused ossl_inline int sk_##t1##_insert(STACK_OF(t1) *sk, t2 *ptr, int idx) \\\n { \\\n return OPENSSL_sk_insert((OPENSSL_STACK *)sk, (const void *)ptr, idx); \\\n } \\\n static ossl_unused ossl_inline t2 *sk_##t1##_set(STACK_OF(t1) *sk, int idx, t2 *ptr) \\\n { \\\n return (t2 *)OPENSSL_sk_set((OPENSSL_STACK *)sk, idx, (const void *)ptr); \\\n } \\\n static ossl_unused ossl_inline int sk_##t1##_find(STACK_OF(t1) *sk, t2 *ptr) \\\n { \\\n return OPENSSL_sk_find((OPENSSL_STACK *)sk, (const void *)ptr); \\\n } \\\n static ossl_unused ossl_inline int sk_##t1##_find_ex(STACK_OF(t1) *sk, t2 *ptr) \\\n { \\\n return OPENSSL_sk_find_ex((OPENSSL_STACK *)sk, (const void *)ptr); \\\n } \\\n static ossl_unused ossl_inline void sk_##t1##_sort(STACK_OF(t1) *sk) \\\n { \\\n OPENSSL_sk_sort((OPENSSL_STACK *)sk); \\\n } \\\n static ossl_unused ossl_inline int sk_##t1##_is_sorted(const STACK_OF(t1) *sk) \\\n { \\\n return OPENSSL_sk_is_sorted((const OPENSSL_STACK *)sk); \\\n } \\\n static ossl_unused ossl_inline STACK_OF(t1) * sk_##t1##_dup(const STACK_OF(t1) *sk) \\\n { \\\n return (STACK_OF(t1) *)OPENSSL_sk_dup((const OPENSSL_STACK *)sk); \\\n } \\\n static ossl_unused ossl_inline STACK_OF(t1) *sk_##t1##_deep_copy(const STACK_OF(t1) *sk, \\\n sk_##t1##_copyfunc copyfunc, \\\n sk_##t1##_freefunc freefunc) \\\n { \\\n return (STACK_OF(t1) *)OPENSSL_sk_deep_copy((const OPENSSL_STACK *)sk, \\\n (OPENSSL_sk_copyfunc)copyfunc, \\\n (OPENSSL_sk_freefunc)freefunc); \\\n } \\\n static ossl_unused ossl_inline sk_##t1##_compfunc sk_##t1##_set_cmp_func(STACK_OF(t1) *sk, sk_##t1##_compfunc compare) \\\n { \\\n return (sk_##t1##_compfunc)OPENSSL_sk_set_cmp_func((OPENSSL_STACK *)sk, (OPENSSL_sk_compfunc)compare); \\\n }\n\n# define DEFINE_SPECIAL_STACK_OF(t1, t2) SKM_DEFINE_STACK_OF(t1, t2, t2)\n# define DEFINE_STACK_OF(t) SKM_DEFINE_STACK_OF(t, t, t)\n# define DEFINE_SPECIAL_STACK_OF_CONST(t1, t2) \\\n SKM_DEFINE_STACK_OF(t1, const t2, t2)\n# define DEFINE_STACK_OF_CONST(t) SKM_DEFINE_STACK_OF(t, const t, t)\n\n/*-\n * Strings are special: normally an lhash entry will point to a single\n * (somewhat) mutable object. In the case of strings:\n *\n * a) Instead of a single char, there is an array of chars, NUL-terminated.\n * b) The string may have be immutable.\n *\n * So, they need their own declarations. Especially important for\n * type-checking tools, such as Deputy.\n *\n * In practice, however, it appears to be hard to have a const\n * string. For now, I'm settling for dealing with the fact it is a\n * string at all.\n */\ntypedef char *OPENSSL_STRING;\ntypedef const char *OPENSSL_CSTRING;\n\n/*-\n * Confusingly, LHASH_OF(STRING) deals with char ** throughout, but\n * STACK_OF(STRING) is really more like STACK_OF(char), only, as mentioned\n * above, instead of a single char each entry is a NUL-terminated array of\n * chars. So, we have to implement STRING specially for STACK_OF. This is\n * dealt with in the autogenerated macros below.\n */\nDEFINE_SPECIAL_STACK_OF(OPENSSL_STRING, char)\nDEFINE_SPECIAL_STACK_OF_CONST(OPENSSL_CSTRING, char)\n\n/*\n * Similarly, we sometimes use a block of characters, NOT nul-terminated.\n * These should also be distinguished from \"normal\" stacks.\n */\ntypedef void *OPENSSL_BLOCK;\nDEFINE_SPECIAL_STACK_OF(OPENSSL_BLOCK, void)\n\n/*\n * If called without higher optimization (min. -xO3) the Oracle Developer\n * Studio compiler generates code for the defined (static inline) functions\n * above.\n * This would later lead to the linker complaining about missing symbols when\n * this header file is included but the resulting object is not linked against\n * the Crypto library (openssl#6912).\n */\n# ifdef __SUNPRO_C\n# pragma weak OPENSSL_sk_num\n# pragma weak OPENSSL_sk_value\n# pragma weak OPENSSL_sk_new\n# pragma weak OPENSSL_sk_new_null\n# pragma weak OPENSSL_sk_new_reserve\n# pragma weak OPENSSL_sk_reserve\n# pragma weak OPENSSL_sk_free\n# pragma weak OPENSSL_sk_zero\n# pragma weak OPENSSL_sk_delete\n# pragma weak OPENSSL_sk_delete_ptr\n# pragma weak OPENSSL_sk_push\n# pragma weak OPENSSL_sk_unshift\n# pragma weak OPENSSL_sk_pop\n# pragma weak OPENSSL_sk_shift\n# pragma weak OPENSSL_sk_pop_free\n# pragma weak OPENSSL_sk_insert\n# pragma weak OPENSSL_sk_set\n# pragma weak OPENSSL_sk_find\n# pragma weak OPENSSL_sk_find_ex\n# pragma weak OPENSSL_sk_sort\n# pragma weak OPENSSL_sk_is_sorted\n# pragma weak OPENSSL_sk_dup\n# pragma weak OPENSSL_sk_deep_copy\n# pragma weak OPENSSL_sk_set_cmp_func\n# endif /* __SUNPRO_C */\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/seed.h", "content": "/*\n * Copyright 2007-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * Copyright (c) 2007 KISA(Korea Information Security Agency). All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Neither the name of author nor the names of its contributors may\n * be used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\n * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n */\n\n#ifndef HEADER_SEED_H\n# define HEADER_SEED_H\n\n# include \n\n# ifndef OPENSSL_NO_SEED\n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/* look whether we need 'long' to get 32 bits */\n# ifdef AES_LONG\n# ifndef SEED_LONG\n# define SEED_LONG 1\n# endif\n# endif\n\n# include \n\n# define SEED_BLOCK_SIZE 16\n# define SEED_KEY_LENGTH 16\n\ntypedef struct seed_key_st {\n# ifdef SEED_LONG\n unsigned long data[32];\n# else\n unsigned int data[32];\n# endif\n} SEED_KEY_SCHEDULE;\n\nvoid SEED_set_key(const unsigned char rawkey[SEED_KEY_LENGTH],\n SEED_KEY_SCHEDULE *ks);\n\nvoid SEED_encrypt(const unsigned char s[SEED_BLOCK_SIZE],\n unsigned char d[SEED_BLOCK_SIZE],\n const SEED_KEY_SCHEDULE *ks);\nvoid SEED_decrypt(const unsigned char s[SEED_BLOCK_SIZE],\n unsigned char d[SEED_BLOCK_SIZE],\n const SEED_KEY_SCHEDULE *ks);\n\nvoid SEED_ecb_encrypt(const unsigned char *in, unsigned char *out,\n const SEED_KEY_SCHEDULE *ks, int enc);\nvoid SEED_cbc_encrypt(const unsigned char *in, unsigned char *out, size_t len,\n const SEED_KEY_SCHEDULE *ks,\n unsigned char ivec[SEED_BLOCK_SIZE], int enc);\nvoid SEED_cfb128_encrypt(const unsigned char *in, unsigned char *out,\n size_t len, const SEED_KEY_SCHEDULE *ks,\n unsigned char ivec[SEED_BLOCK_SIZE], int *num,\n int enc);\nvoid SEED_ofb128_encrypt(const unsigned char *in, unsigned char *out,\n size_t len, const SEED_KEY_SCHEDULE *ks,\n unsigned char ivec[SEED_BLOCK_SIZE], int *num);\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/sha.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_SHA_H\n# define HEADER_SHA_H\n\n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/*-\n * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n * ! SHA_LONG has to be at least 32 bits wide. !\n * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n */\n# define SHA_LONG unsigned int\n\n# define SHA_LBLOCK 16\n# define SHA_CBLOCK (SHA_LBLOCK*4)/* SHA treats input data as a\n * contiguous array of 32 bit wide\n * big-endian values. */\n# define SHA_LAST_BLOCK (SHA_CBLOCK-8)\n# define SHA_DIGEST_LENGTH 20\n\ntypedef struct SHAstate_st {\n SHA_LONG h0, h1, h2, h3, h4;\n SHA_LONG Nl, Nh;\n SHA_LONG data[SHA_LBLOCK];\n unsigned int num;\n} SHA_CTX;\n\nint SHA1_Init(SHA_CTX *c);\nint SHA1_Update(SHA_CTX *c, const void *data, size_t len);\nint SHA1_Final(unsigned char *md, SHA_CTX *c);\nunsigned char *SHA1(const unsigned char *d, size_t n, unsigned char *md);\nvoid SHA1_Transform(SHA_CTX *c, const unsigned char *data);\n\n# define SHA256_CBLOCK (SHA_LBLOCK*4)/* SHA-256 treats input data as a\n * contiguous array of 32 bit wide\n * big-endian values. */\n\ntypedef struct SHA256state_st {\n SHA_LONG h[8];\n SHA_LONG Nl, Nh;\n SHA_LONG data[SHA_LBLOCK];\n unsigned int num, md_len;\n} SHA256_CTX;\n\nint SHA224_Init(SHA256_CTX *c);\nint SHA224_Update(SHA256_CTX *c, const void *data, size_t len);\nint SHA224_Final(unsigned char *md, SHA256_CTX *c);\nunsigned char *SHA224(const unsigned char *d, size_t n, unsigned char *md);\nint SHA256_Init(SHA256_CTX *c);\nint SHA256_Update(SHA256_CTX *c, const void *data, size_t len);\nint SHA256_Final(unsigned char *md, SHA256_CTX *c);\nunsigned char *SHA256(const unsigned char *d, size_t n, unsigned char *md);\nvoid SHA256_Transform(SHA256_CTX *c, const unsigned char *data);\n\n# define SHA224_DIGEST_LENGTH 28\n# define SHA256_DIGEST_LENGTH 32\n# define SHA384_DIGEST_LENGTH 48\n# define SHA512_DIGEST_LENGTH 64\n\n/*\n * Unlike 32-bit digest algorithms, SHA-512 *relies* on SHA_LONG64\n * being exactly 64-bit wide. See Implementation Notes in sha512.c\n * for further details.\n */\n/*\n * SHA-512 treats input data as a\n * contiguous array of 64 bit\n * wide big-endian values.\n */\n# define SHA512_CBLOCK (SHA_LBLOCK*8)\n# if (defined(_WIN32) || defined(_WIN64)) && !defined(__MINGW32__)\n# define SHA_LONG64 unsigned __int64\n# define U64(C) C##UI64\n# elif defined(__arch64__)\n# define SHA_LONG64 unsigned long\n# define U64(C) C##UL\n# else\n# define SHA_LONG64 unsigned long long\n# define U64(C) C##ULL\n# endif\n\ntypedef struct SHA512state_st {\n SHA_LONG64 h[8];\n SHA_LONG64 Nl, Nh;\n union {\n SHA_LONG64 d[SHA_LBLOCK];\n unsigned char p[SHA512_CBLOCK];\n } u;\n unsigned int num, md_len;\n} SHA512_CTX;\n\nint SHA384_Init(SHA512_CTX *c);\nint SHA384_Update(SHA512_CTX *c, const void *data, size_t len);\nint SHA384_Final(unsigned char *md, SHA512_CTX *c);\nunsigned char *SHA384(const unsigned char *d, size_t n, unsigned char *md);\nint SHA512_Init(SHA512_CTX *c);\nint SHA512_Update(SHA512_CTX *c, const void *data, size_t len);\nint SHA512_Final(unsigned char *md, SHA512_CTX *c);\nunsigned char *SHA512(const unsigned char *d, size_t n, unsigned char *md);\nvoid SHA512_Transform(SHA512_CTX *c, const unsigned char *data);\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/srp.h", "content": "/*\n * Copyright 2004-2018 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2004, EdelKey Project. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n *\n * Originally written by Christophe Renou and Peter Sylvester,\n * for the EdelKey project.\n */\n\n#ifndef HEADER_SRP_H\n# define HEADER_SRP_H\n\n#include \n\n#ifndef OPENSSL_NO_SRP\n# include \n# include \n# include \n# include \n# include \n\n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\ntypedef struct SRP_gN_cache_st {\n char *b64_bn;\n BIGNUM *bn;\n} SRP_gN_cache;\n\n\nDEFINE_STACK_OF(SRP_gN_cache)\n\ntypedef struct SRP_user_pwd_st {\n /* Owned by us. */\n char *id;\n BIGNUM *s;\n BIGNUM *v;\n /* Not owned by us. */\n const BIGNUM *g;\n const BIGNUM *N;\n /* Owned by us. */\n char *info;\n} SRP_user_pwd;\n\nvoid SRP_user_pwd_free(SRP_user_pwd *user_pwd);\n\nDEFINE_STACK_OF(SRP_user_pwd)\n\ntypedef struct SRP_VBASE_st {\n STACK_OF(SRP_user_pwd) *users_pwd;\n STACK_OF(SRP_gN_cache) *gN_cache;\n/* to simulate a user */\n char *seed_key;\n const BIGNUM *default_g;\n const BIGNUM *default_N;\n} SRP_VBASE;\n\n/*\n * Internal structure storing N and g pair\n */\ntypedef struct SRP_gN_st {\n char *id;\n const BIGNUM *g;\n const BIGNUM *N;\n} SRP_gN;\n\nDEFINE_STACK_OF(SRP_gN)\n\nSRP_VBASE *SRP_VBASE_new(char *seed_key);\nvoid SRP_VBASE_free(SRP_VBASE *vb);\nint SRP_VBASE_init(SRP_VBASE *vb, char *verifier_file);\n\n/* This method ignores the configured seed and fails for an unknown user. */\nDEPRECATEDIN_1_1_0(SRP_user_pwd *SRP_VBASE_get_by_user(SRP_VBASE *vb, char *username))\n/* NOTE: unlike in SRP_VBASE_get_by_user, caller owns the returned pointer.*/\nSRP_user_pwd *SRP_VBASE_get1_by_user(SRP_VBASE *vb, char *username);\n\nchar *SRP_create_verifier(const char *user, const char *pass, char **salt,\n char **verifier, const char *N, const char *g);\nint SRP_create_verifier_BN(const char *user, const char *pass, BIGNUM **salt,\n BIGNUM **verifier, const BIGNUM *N,\n const BIGNUM *g);\n\n# define SRP_NO_ERROR 0\n# define SRP_ERR_VBASE_INCOMPLETE_FILE 1\n# define SRP_ERR_VBASE_BN_LIB 2\n# define SRP_ERR_OPEN_FILE 3\n# define SRP_ERR_MEMORY 4\n\n# define DB_srptype 0\n# define DB_srpverifier 1\n# define DB_srpsalt 2\n# define DB_srpid 3\n# define DB_srpgN 4\n# define DB_srpinfo 5\n# undef DB_NUMBER\n# define DB_NUMBER 6\n\n# define DB_SRP_INDEX 'I'\n# define DB_SRP_VALID 'V'\n# define DB_SRP_REVOKED 'R'\n# define DB_SRP_MODIF 'v'\n\n/* see srp.c */\nchar *SRP_check_known_gN_param(const BIGNUM *g, const BIGNUM *N);\nSRP_gN *SRP_get_default_gN(const char *id);\n\n/* server side .... */\nBIGNUM *SRP_Calc_server_key(const BIGNUM *A, const BIGNUM *v, const BIGNUM *u,\n const BIGNUM *b, const BIGNUM *N);\nBIGNUM *SRP_Calc_B(const BIGNUM *b, const BIGNUM *N, const BIGNUM *g,\n const BIGNUM *v);\nint SRP_Verify_A_mod_N(const BIGNUM *A, const BIGNUM *N);\nBIGNUM *SRP_Calc_u(const BIGNUM *A, const BIGNUM *B, const BIGNUM *N);\n\n/* client side .... */\nBIGNUM *SRP_Calc_x(const BIGNUM *s, const char *user, const char *pass);\nBIGNUM *SRP_Calc_A(const BIGNUM *a, const BIGNUM *N, const BIGNUM *g);\nBIGNUM *SRP_Calc_client_key(const BIGNUM *N, const BIGNUM *B, const BIGNUM *g,\n const BIGNUM *x, const BIGNUM *a, const BIGNUM *u);\nint SRP_Verify_B_mod_N(const BIGNUM *B, const BIGNUM *N);\n\n# define SRP_MINIMAL_N 1024\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/srtp.h", "content": "/*\n * Copyright 2011-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * DTLS code by Eric Rescorla \n *\n * Copyright (C) 2006, Network Resonance, Inc. Copyright (C) 2011, RTFM, Inc.\n */\n\n#ifndef HEADER_D1_SRTP_H\n# define HEADER_D1_SRTP_H\n\n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# define SRTP_AES128_CM_SHA1_80 0x0001\n# define SRTP_AES128_CM_SHA1_32 0x0002\n# define SRTP_AES128_F8_SHA1_80 0x0003\n# define SRTP_AES128_F8_SHA1_32 0x0004\n# define SRTP_NULL_SHA1_80 0x0005\n# define SRTP_NULL_SHA1_32 0x0006\n\n/* AEAD SRTP protection profiles from RFC 7714 */\n# define SRTP_AEAD_AES_128_GCM 0x0007\n# define SRTP_AEAD_AES_256_GCM 0x0008\n\n# ifndef OPENSSL_NO_SRTP\n\n__owur int SSL_CTX_set_tlsext_use_srtp(SSL_CTX *ctx, const char *profiles);\n__owur int SSL_set_tlsext_use_srtp(SSL *ssl, const char *profiles);\n\n__owur STACK_OF(SRTP_PROTECTION_PROFILE) *SSL_get_srtp_profiles(SSL *ssl);\n__owur SRTP_PROTECTION_PROFILE *SSL_get_selected_srtp_profile(SSL *s);\n\n# endif\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/ssl.h", "content": "/*\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n * Copyright 2005 Nokia. All rights reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_SSL_H\n# define HEADER_SSL_H\n\n# include \n# include \n# include \n# include \n# if OPENSSL_API_COMPAT < 0x10100000L\n# include \n# include \n# include \n# endif\n# include \n# include \n# include \n# include \n\n# include \n# include \n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/* OpenSSL version number for ASN.1 encoding of the session information */\n/*-\n * Version 0 - initial version\n * Version 1 - added the optional peer certificate\n */\n# define SSL_SESSION_ASN1_VERSION 0x0001\n\n# define SSL_MAX_SSL_SESSION_ID_LENGTH 32\n# define SSL_MAX_SID_CTX_LENGTH 32\n\n# define SSL_MIN_RSA_MODULUS_LENGTH_IN_BYTES (512/8)\n# define SSL_MAX_KEY_ARG_LENGTH 8\n# define SSL_MAX_MASTER_KEY_LENGTH 48\n\n/* The maximum number of encrypt/decrypt pipelines we can support */\n# define SSL_MAX_PIPELINES 32\n\n/* text strings for the ciphers */\n\n/* These are used to specify which ciphers to use and not to use */\n\n# define SSL_TXT_LOW \"LOW\"\n# define SSL_TXT_MEDIUM \"MEDIUM\"\n# define SSL_TXT_HIGH \"HIGH\"\n# define SSL_TXT_FIPS \"FIPS\"\n\n# define SSL_TXT_aNULL \"aNULL\"\n# define SSL_TXT_eNULL \"eNULL\"\n# define SSL_TXT_NULL \"NULL\"\n\n# define SSL_TXT_kRSA \"kRSA\"\n# define SSL_TXT_kDHr \"kDHr\"/* this cipher class has been removed */\n# define SSL_TXT_kDHd \"kDHd\"/* this cipher class has been removed */\n# define SSL_TXT_kDH \"kDH\"/* this cipher class has been removed */\n# define SSL_TXT_kEDH \"kEDH\"/* alias for kDHE */\n# define SSL_TXT_kDHE \"kDHE\"\n# define SSL_TXT_kECDHr \"kECDHr\"/* this cipher class has been removed */\n# define SSL_TXT_kECDHe \"kECDHe\"/* this cipher class has been removed */\n# define SSL_TXT_kECDH \"kECDH\"/* this cipher class has been removed */\n# define SSL_TXT_kEECDH \"kEECDH\"/* alias for kECDHE */\n# define SSL_TXT_kECDHE \"kECDHE\"\n# define SSL_TXT_kPSK \"kPSK\"\n# define SSL_TXT_kRSAPSK \"kRSAPSK\"\n# define SSL_TXT_kECDHEPSK \"kECDHEPSK\"\n# define SSL_TXT_kDHEPSK \"kDHEPSK\"\n# define SSL_TXT_kGOST \"kGOST\"\n# define SSL_TXT_kSRP \"kSRP\"\n\n# define SSL_TXT_aRSA \"aRSA\"\n# define SSL_TXT_aDSS \"aDSS\"\n# define SSL_TXT_aDH \"aDH\"/* this cipher class has been removed */\n# define SSL_TXT_aECDH \"aECDH\"/* this cipher class has been removed */\n# define SSL_TXT_aECDSA \"aECDSA\"\n# define SSL_TXT_aPSK \"aPSK\"\n# define SSL_TXT_aGOST94 \"aGOST94\"\n# define SSL_TXT_aGOST01 \"aGOST01\"\n# define SSL_TXT_aGOST12 \"aGOST12\"\n# define SSL_TXT_aGOST \"aGOST\"\n# define SSL_TXT_aSRP \"aSRP\"\n\n# define SSL_TXT_DSS \"DSS\"\n# define SSL_TXT_DH \"DH\"\n# define SSL_TXT_DHE \"DHE\"/* same as \"kDHE:-ADH\" */\n# define SSL_TXT_EDH \"EDH\"/* alias for DHE */\n# define SSL_TXT_ADH \"ADH\"\n# define SSL_TXT_RSA \"RSA\"\n# define SSL_TXT_ECDH \"ECDH\"\n# define SSL_TXT_EECDH \"EECDH\"/* alias for ECDHE\" */\n# define SSL_TXT_ECDHE \"ECDHE\"/* same as \"kECDHE:-AECDH\" */\n# define SSL_TXT_AECDH \"AECDH\"\n# define SSL_TXT_ECDSA \"ECDSA\"\n# define SSL_TXT_PSK \"PSK\"\n# define SSL_TXT_SRP \"SRP\"\n\n# define SSL_TXT_DES \"DES\"\n# define SSL_TXT_3DES \"3DES\"\n# define SSL_TXT_RC4 \"RC4\"\n# define SSL_TXT_RC2 \"RC2\"\n# define SSL_TXT_IDEA \"IDEA\"\n# define SSL_TXT_SEED \"SEED\"\n# define SSL_TXT_AES128 \"AES128\"\n# define SSL_TXT_AES256 \"AES256\"\n# define SSL_TXT_AES \"AES\"\n# define SSL_TXT_AES_GCM \"AESGCM\"\n# define SSL_TXT_AES_CCM \"AESCCM\"\n# define SSL_TXT_AES_CCM_8 \"AESCCM8\"\n# define SSL_TXT_CAMELLIA128 \"CAMELLIA128\"\n# define SSL_TXT_CAMELLIA256 \"CAMELLIA256\"\n# define SSL_TXT_CAMELLIA \"CAMELLIA\"\n# define SSL_TXT_CHACHA20 \"CHACHA20\"\n# define SSL_TXT_GOST \"GOST89\"\n# define SSL_TXT_ARIA \"ARIA\"\n# define SSL_TXT_ARIA_GCM \"ARIAGCM\"\n# define SSL_TXT_ARIA128 \"ARIA128\"\n# define SSL_TXT_ARIA256 \"ARIA256\"\n\n# define SSL_TXT_MD5 \"MD5\"\n# define SSL_TXT_SHA1 \"SHA1\"\n# define SSL_TXT_SHA \"SHA\"/* same as \"SHA1\" */\n# define SSL_TXT_GOST94 \"GOST94\"\n# define SSL_TXT_GOST89MAC \"GOST89MAC\"\n# define SSL_TXT_GOST12 \"GOST12\"\n# define SSL_TXT_GOST89MAC12 \"GOST89MAC12\"\n# define SSL_TXT_SHA256 \"SHA256\"\n# define SSL_TXT_SHA384 \"SHA384\"\n\n# define SSL_TXT_SSLV3 \"SSLv3\"\n# define SSL_TXT_TLSV1 \"TLSv1\"\n# define SSL_TXT_TLSV1_1 \"TLSv1.1\"\n# define SSL_TXT_TLSV1_2 \"TLSv1.2\"\n\n# define SSL_TXT_ALL \"ALL\"\n\n/*-\n * COMPLEMENTOF* definitions. These identifiers are used to (de-select)\n * ciphers normally not being used.\n * Example: \"RC4\" will activate all ciphers using RC4 including ciphers\n * without authentication, which would normally disabled by DEFAULT (due\n * the \"!ADH\" being part of default). Therefore \"RC4:!COMPLEMENTOFDEFAULT\"\n * will make sure that it is also disabled in the specific selection.\n * COMPLEMENTOF* identifiers are portable between version, as adjustments\n * to the default cipher setup will also be included here.\n *\n * COMPLEMENTOFDEFAULT does not experience the same special treatment that\n * DEFAULT gets, as only selection is being done and no sorting as needed\n * for DEFAULT.\n */\n# define SSL_TXT_CMPALL \"COMPLEMENTOFALL\"\n# define SSL_TXT_CMPDEF \"COMPLEMENTOFDEFAULT\"\n\n/*\n * The following cipher list is used by default. It also is substituted when\n * an application-defined cipher list string starts with 'DEFAULT'.\n * This applies to ciphersuites for TLSv1.2 and below.\n */\n# define SSL_DEFAULT_CIPHER_LIST \"ALL:!COMPLEMENTOFDEFAULT:!eNULL\"\n/* This is the default set of TLSv1.3 ciphersuites */\n# if !defined(OPENSSL_NO_CHACHA) && !defined(OPENSSL_NO_POLY1305)\n# define TLS_DEFAULT_CIPHERSUITES \"TLS_AES_256_GCM_SHA384:\" \\\n \"TLS_CHACHA20_POLY1305_SHA256:\" \\\n \"TLS_AES_128_GCM_SHA256\"\n# else\n# define TLS_DEFAULT_CIPHERSUITES \"TLS_AES_256_GCM_SHA384:\" \\\n \"TLS_AES_128_GCM_SHA256\"\n#endif\n/*\n * As of OpenSSL 1.0.0, ssl_create_cipher_list() in ssl/ssl_ciph.c always\n * starts with a reasonable order, and all we have to do for DEFAULT is\n * throwing out anonymous and unencrypted ciphersuites! (The latter are not\n * actually enabled by ALL, but \"ALL:RSA\" would enable some of them.)\n */\n\n/* Used in SSL_set_shutdown()/SSL_get_shutdown(); */\n# define SSL_SENT_SHUTDOWN 1\n# define SSL_RECEIVED_SHUTDOWN 2\n\n#ifdef __cplusplus\n}\n#endif\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# define SSL_FILETYPE_ASN1 X509_FILETYPE_ASN1\n# define SSL_FILETYPE_PEM X509_FILETYPE_PEM\n\n/*\n * This is needed to stop compilers complaining about the 'struct ssl_st *'\n * function parameters used to prototype callbacks in SSL_CTX.\n */\ntypedef struct ssl_st *ssl_crock_st;\ntypedef struct tls_session_ticket_ext_st TLS_SESSION_TICKET_EXT;\ntypedef struct ssl_method_st SSL_METHOD;\ntypedef struct ssl_cipher_st SSL_CIPHER;\ntypedef struct ssl_session_st SSL_SESSION;\ntypedef struct tls_sigalgs_st TLS_SIGALGS;\ntypedef struct ssl_conf_ctx_st SSL_CONF_CTX;\ntypedef struct ssl_comp_st SSL_COMP;\n\nSTACK_OF(SSL_CIPHER);\nSTACK_OF(SSL_COMP);\n\n/* SRTP protection profiles for use with the use_srtp extension (RFC 5764)*/\ntypedef struct srtp_protection_profile_st {\n const char *name;\n unsigned long id;\n} SRTP_PROTECTION_PROFILE;\n\nDEFINE_STACK_OF(SRTP_PROTECTION_PROFILE)\n\ntypedef int (*tls_session_ticket_ext_cb_fn)(SSL *s, const unsigned char *data,\n int len, void *arg);\ntypedef int (*tls_session_secret_cb_fn)(SSL *s, void *secret, int *secret_len,\n STACK_OF(SSL_CIPHER) *peer_ciphers,\n const SSL_CIPHER **cipher, void *arg);\n\n/* Extension context codes */\n/* This extension is only allowed in TLS */\n#define SSL_EXT_TLS_ONLY 0x0001\n/* This extension is only allowed in DTLS */\n#define SSL_EXT_DTLS_ONLY 0x0002\n/* Some extensions may be allowed in DTLS but we don't implement them for it */\n#define SSL_EXT_TLS_IMPLEMENTATION_ONLY 0x0004\n/* Most extensions are not defined for SSLv3 but EXT_TYPE_renegotiate is */\n#define SSL_EXT_SSL3_ALLOWED 0x0008\n/* Extension is only defined for TLS1.2 and below */\n#define SSL_EXT_TLS1_2_AND_BELOW_ONLY 0x0010\n/* Extension is only defined for TLS1.3 and above */\n#define SSL_EXT_TLS1_3_ONLY 0x0020\n/* Ignore this extension during parsing if we are resuming */\n#define SSL_EXT_IGNORE_ON_RESUMPTION 0x0040\n#define SSL_EXT_CLIENT_HELLO 0x0080\n/* Really means TLS1.2 or below */\n#define SSL_EXT_TLS1_2_SERVER_HELLO 0x0100\n#define SSL_EXT_TLS1_3_SERVER_HELLO 0x0200\n#define SSL_EXT_TLS1_3_ENCRYPTED_EXTENSIONS 0x0400\n#define SSL_EXT_TLS1_3_HELLO_RETRY_REQUEST 0x0800\n#define SSL_EXT_TLS1_3_CERTIFICATE 0x1000\n#define SSL_EXT_TLS1_3_NEW_SESSION_TICKET 0x2000\n#define SSL_EXT_TLS1_3_CERTIFICATE_REQUEST 0x4000\n\n/* Typedefs for handling custom extensions */\n\ntypedef int (*custom_ext_add_cb)(SSL *s, unsigned int ext_type,\n const unsigned char **out, size_t *outlen,\n int *al, void *add_arg);\n\ntypedef void (*custom_ext_free_cb)(SSL *s, unsigned int ext_type,\n const unsigned char *out, void *add_arg);\n\ntypedef int (*custom_ext_parse_cb)(SSL *s, unsigned int ext_type,\n const unsigned char *in, size_t inlen,\n int *al, void *parse_arg);\n\n\ntypedef int (*SSL_custom_ext_add_cb_ex)(SSL *s, unsigned int ext_type,\n unsigned int context,\n const unsigned char **out,\n size_t *outlen, X509 *x,\n size_t chainidx,\n int *al, void *add_arg);\n\ntypedef void (*SSL_custom_ext_free_cb_ex)(SSL *s, unsigned int ext_type,\n unsigned int context,\n const unsigned char *out,\n void *add_arg);\n\ntypedef int (*SSL_custom_ext_parse_cb_ex)(SSL *s, unsigned int ext_type,\n unsigned int context,\n const unsigned char *in,\n size_t inlen, X509 *x,\n size_t chainidx,\n int *al, void *parse_arg);\n\n/* Typedef for verification callback */\ntypedef int (*SSL_verify_cb)(int preverify_ok, X509_STORE_CTX *x509_ctx);\n\n/*\n * Some values are reserved until OpenSSL 1.2.0 because they were previously\n * included in SSL_OP_ALL in a 1.1.x release.\n *\n * Reserved value (until OpenSSL 1.2.0) 0x00000001U\n * Reserved value (until OpenSSL 1.2.0) 0x00000002U\n */\n/* Allow initial connection to servers that don't support RI */\n# define SSL_OP_LEGACY_SERVER_CONNECT 0x00000004U\n\n/* Reserved value (until OpenSSL 1.2.0) 0x00000008U */\n# define SSL_OP_TLSEXT_PADDING 0x00000010U\n/* Reserved value (until OpenSSL 1.2.0) 0x00000020U */\n# define SSL_OP_SAFARI_ECDHE_ECDSA_BUG 0x00000040U\n/*\n * Reserved value (until OpenSSL 1.2.0) 0x00000080U\n * Reserved value (until OpenSSL 1.2.0) 0x00000100U\n * Reserved value (until OpenSSL 1.2.0) 0x00000200U\n */\n\n/* In TLSv1.3 allow a non-(ec)dhe based kex_mode */\n# define SSL_OP_ALLOW_NO_DHE_KEX 0x00000400U\n\n/*\n * Disable SSL 3.0/TLS 1.0 CBC vulnerability workaround that was added in\n * OpenSSL 0.9.6d. Usually (depending on the application protocol) the\n * workaround is not needed. Unfortunately some broken SSL/TLS\n * implementations cannot handle it at all, which is why we include it in\n * SSL_OP_ALL. Added in 0.9.6e\n */\n# define SSL_OP_DONT_INSERT_EMPTY_FRAGMENTS 0x00000800U\n\n/* DTLS options */\n# define SSL_OP_NO_QUERY_MTU 0x00001000U\n/* Turn on Cookie Exchange (on relevant for servers) */\n# define SSL_OP_COOKIE_EXCHANGE 0x00002000U\n/* Don't use RFC4507 ticket extension */\n# define SSL_OP_NO_TICKET 0x00004000U\n# ifndef OPENSSL_NO_DTLS1_METHOD\n/* Use Cisco's \"speshul\" version of DTLS_BAD_VER\n * (only with deprecated DTLSv1_client_method()) */\n# define SSL_OP_CISCO_ANYCONNECT 0x00008000U\n# endif\n\n/* As server, disallow session resumption on renegotiation */\n# define SSL_OP_NO_SESSION_RESUMPTION_ON_RENEGOTIATION 0x00010000U\n/* Don't use compression even if supported */\n# define SSL_OP_NO_COMPRESSION 0x00020000U\n/* Permit unsafe legacy renegotiation */\n# define SSL_OP_ALLOW_UNSAFE_LEGACY_RENEGOTIATION 0x00040000U\n/* Disable encrypt-then-mac */\n# define SSL_OP_NO_ENCRYPT_THEN_MAC 0x00080000U\n\n/*\n * Enable TLSv1.3 Compatibility mode. This is on by default. A future version\n * of OpenSSL may have this disabled by default.\n */\n# define SSL_OP_ENABLE_MIDDLEBOX_COMPAT 0x00100000U\n\n/* Prioritize Chacha20Poly1305 when client does.\n * Modifies SSL_OP_CIPHER_SERVER_PREFERENCE */\n# define SSL_OP_PRIORITIZE_CHACHA 0x00200000U\n\n/*\n * Set on servers to choose the cipher according to the server's preferences\n */\n# define SSL_OP_CIPHER_SERVER_PREFERENCE 0x00400000U\n/*\n * If set, a server will allow a client to issue a SSLv3.0 version number as\n * latest version supported in the premaster secret, even when TLSv1.0\n * (version 3.1) was announced in the client hello. Normally this is\n * forbidden to prevent version rollback attacks.\n */\n# define SSL_OP_TLS_ROLLBACK_BUG 0x00800000U\n\n/*\n * Switches off automatic TLSv1.3 anti-replay protection for early data. This\n * is a server-side option only (no effect on the client).\n */\n# define SSL_OP_NO_ANTI_REPLAY 0x01000000U\n\n# define SSL_OP_NO_SSLv3 0x02000000U\n# define SSL_OP_NO_TLSv1 0x04000000U\n# define SSL_OP_NO_TLSv1_2 0x08000000U\n# define SSL_OP_NO_TLSv1_1 0x10000000U\n# define SSL_OP_NO_TLSv1_3 0x20000000U\n\n# define SSL_OP_NO_DTLSv1 0x04000000U\n# define SSL_OP_NO_DTLSv1_2 0x08000000U\n\n# define SSL_OP_NO_SSL_MASK (SSL_OP_NO_SSLv3|\\\n SSL_OP_NO_TLSv1|SSL_OP_NO_TLSv1_1|SSL_OP_NO_TLSv1_2|SSL_OP_NO_TLSv1_3)\n# define SSL_OP_NO_DTLS_MASK (SSL_OP_NO_DTLSv1|SSL_OP_NO_DTLSv1_2)\n\n/* Disallow all renegotiation */\n# define SSL_OP_NO_RENEGOTIATION 0x40000000U\n\n/*\n * Make server add server-hello extension from early version of cryptopro\n * draft, when GOST ciphersuite is negotiated. Required for interoperability\n * with CryptoPro CSP 3.x\n */\n# define SSL_OP_CRYPTOPRO_TLSEXT_BUG 0x80000000U\n\n/*\n * SSL_OP_ALL: various bug workarounds that should be rather harmless.\n * This used to be 0x000FFFFFL before 0.9.7.\n * This used to be 0x80000BFFU before 1.1.1.\n */\n# define SSL_OP_ALL (SSL_OP_CRYPTOPRO_TLSEXT_BUG|\\\n SSL_OP_DONT_INSERT_EMPTY_FRAGMENTS|\\\n SSL_OP_LEGACY_SERVER_CONNECT|\\\n SSL_OP_TLSEXT_PADDING|\\\n SSL_OP_SAFARI_ECDHE_ECDSA_BUG)\n\n/* OBSOLETE OPTIONS: retained for compatibility */\n\n/* Removed from OpenSSL 1.1.0. Was 0x00000001L */\n/* Related to removed SSLv2. */\n# define SSL_OP_MICROSOFT_SESS_ID_BUG 0x0\n/* Removed from OpenSSL 1.1.0. Was 0x00000002L */\n/* Related to removed SSLv2. */\n# define SSL_OP_NETSCAPE_CHALLENGE_BUG 0x0\n/* Removed from OpenSSL 0.9.8q and 1.0.0c. Was 0x00000008L */\n/* Dead forever, see CVE-2010-4180 */\n# define SSL_OP_NETSCAPE_REUSE_CIPHER_CHANGE_BUG 0x0\n/* Removed from OpenSSL 1.0.1h and 1.0.2. Was 0x00000010L */\n/* Refers to ancient SSLREF and SSLv2. */\n# define SSL_OP_SSLREF2_REUSE_CERT_TYPE_BUG 0x0\n/* Removed from OpenSSL 1.1.0. Was 0x00000020 */\n# define SSL_OP_MICROSOFT_BIG_SSLV3_BUFFER 0x0\n/* Removed from OpenSSL 0.9.7h and 0.9.8b. Was 0x00000040L */\n# define SSL_OP_MSIE_SSLV2_RSA_PADDING 0x0\n/* Removed from OpenSSL 1.1.0. Was 0x00000080 */\n/* Ancient SSLeay version. */\n# define SSL_OP_SSLEAY_080_CLIENT_DH_BUG 0x0\n/* Removed from OpenSSL 1.1.0. Was 0x00000100L */\n# define SSL_OP_TLS_D5_BUG 0x0\n/* Removed from OpenSSL 1.1.0. Was 0x00000200L */\n# define SSL_OP_TLS_BLOCK_PADDING_BUG 0x0\n/* Removed from OpenSSL 1.1.0. Was 0x00080000L */\n# define SSL_OP_SINGLE_ECDH_USE 0x0\n/* Removed from OpenSSL 1.1.0. Was 0x00100000L */\n# define SSL_OP_SINGLE_DH_USE 0x0\n/* Removed from OpenSSL 1.0.1k and 1.0.2. Was 0x00200000L */\n# define SSL_OP_EPHEMERAL_RSA 0x0\n/* Removed from OpenSSL 1.1.0. Was 0x01000000L */\n# define SSL_OP_NO_SSLv2 0x0\n/* Removed from OpenSSL 1.0.1. Was 0x08000000L */\n# define SSL_OP_PKCS1_CHECK_1 0x0\n/* Removed from OpenSSL 1.0.1. Was 0x10000000L */\n# define SSL_OP_PKCS1_CHECK_2 0x0\n/* Removed from OpenSSL 1.1.0. Was 0x20000000L */\n# define SSL_OP_NETSCAPE_CA_DN_BUG 0x0\n/* Removed from OpenSSL 1.1.0. Was 0x40000000L */\n# define SSL_OP_NETSCAPE_DEMO_CIPHER_CHANGE_BUG 0x0\n\n/*\n * Allow SSL_write(..., n) to return r with 0 < r < n (i.e. report success\n * when just a single record has been written):\n */\n# define SSL_MODE_ENABLE_PARTIAL_WRITE 0x00000001U\n/*\n * Make it possible to retry SSL_write() with changed buffer location (buffer\n * contents must stay the same!); this is not the default to avoid the\n * misconception that non-blocking SSL_write() behaves like non-blocking\n * write():\n */\n# define SSL_MODE_ACCEPT_MOVING_WRITE_BUFFER 0x00000002U\n/*\n * Never bother the application with retries if the transport is blocking:\n */\n# define SSL_MODE_AUTO_RETRY 0x00000004U\n/* Don't attempt to automatically build certificate chain */\n# define SSL_MODE_NO_AUTO_CHAIN 0x00000008U\n/*\n * Save RAM by releasing read and write buffers when they're empty. (SSL3 and\n * TLS only.) Released buffers are freed.\n */\n# define SSL_MODE_RELEASE_BUFFERS 0x00000010U\n/*\n * Send the current time in the Random fields of the ClientHello and\n * ServerHello records for compatibility with hypothetical implementations\n * that require it.\n */\n# define SSL_MODE_SEND_CLIENTHELLO_TIME 0x00000020U\n# define SSL_MODE_SEND_SERVERHELLO_TIME 0x00000040U\n/*\n * Send TLS_FALLBACK_SCSV in the ClientHello. To be set only by applications\n * that reconnect with a downgraded protocol version; see\n * draft-ietf-tls-downgrade-scsv-00 for details. DO NOT ENABLE THIS if your\n * application attempts a normal handshake. Only use this in explicit\n * fallback retries, following the guidance in\n * draft-ietf-tls-downgrade-scsv-00.\n */\n# define SSL_MODE_SEND_FALLBACK_SCSV 0x00000080U\n/*\n * Support Asynchronous operation\n */\n# define SSL_MODE_ASYNC 0x00000100U\n\n/*\n * When using DTLS/SCTP, include the terminating zero in the label\n * used for computing the endpoint-pair shared secret. Required for\n * interoperability with implementations having this bug like these\n * older version of OpenSSL:\n * - OpenSSL 1.0.0 series\n * - OpenSSL 1.0.1 series\n * - OpenSSL 1.0.2 series\n * - OpenSSL 1.1.0 series\n * - OpenSSL 1.1.1 and 1.1.1a\n */\n# define SSL_MODE_DTLS_SCTP_LABEL_LENGTH_BUG 0x00000400U\n\n/* Cert related flags */\n/*\n * Many implementations ignore some aspects of the TLS standards such as\n * enforcing certificate chain algorithms. When this is set we enforce them.\n */\n# define SSL_CERT_FLAG_TLS_STRICT 0x00000001U\n\n/* Suite B modes, takes same values as certificate verify flags */\n# define SSL_CERT_FLAG_SUITEB_128_LOS_ONLY 0x10000\n/* Suite B 192 bit only mode */\n# define SSL_CERT_FLAG_SUITEB_192_LOS 0x20000\n/* Suite B 128 bit mode allowing 192 bit algorithms */\n# define SSL_CERT_FLAG_SUITEB_128_LOS 0x30000\n\n/* Perform all sorts of protocol violations for testing purposes */\n# define SSL_CERT_FLAG_BROKEN_PROTOCOL 0x10000000\n\n/* Flags for building certificate chains */\n/* Treat any existing certificates as untrusted CAs */\n# define SSL_BUILD_CHAIN_FLAG_UNTRUSTED 0x1\n/* Don't include root CA in chain */\n# define SSL_BUILD_CHAIN_FLAG_NO_ROOT 0x2\n/* Just check certificates already there */\n# define SSL_BUILD_CHAIN_FLAG_CHECK 0x4\n/* Ignore verification errors */\n# define SSL_BUILD_CHAIN_FLAG_IGNORE_ERROR 0x8\n/* Clear verification errors from queue */\n# define SSL_BUILD_CHAIN_FLAG_CLEAR_ERROR 0x10\n\n/* Flags returned by SSL_check_chain */\n/* Certificate can be used with this session */\n# define CERT_PKEY_VALID 0x1\n/* Certificate can also be used for signing */\n# define CERT_PKEY_SIGN 0x2\n/* EE certificate signing algorithm OK */\n# define CERT_PKEY_EE_SIGNATURE 0x10\n/* CA signature algorithms OK */\n# define CERT_PKEY_CA_SIGNATURE 0x20\n/* EE certificate parameters OK */\n# define CERT_PKEY_EE_PARAM 0x40\n/* CA certificate parameters OK */\n# define CERT_PKEY_CA_PARAM 0x80\n/* Signing explicitly allowed as opposed to SHA1 fallback */\n# define CERT_PKEY_EXPLICIT_SIGN 0x100\n/* Client CA issuer names match (always set for server cert) */\n# define CERT_PKEY_ISSUER_NAME 0x200\n/* Cert type matches client types (always set for server cert) */\n# define CERT_PKEY_CERT_TYPE 0x400\n/* Cert chain suitable to Suite B */\n# define CERT_PKEY_SUITEB 0x800\n\n# define SSL_CONF_FLAG_CMDLINE 0x1\n# define SSL_CONF_FLAG_FILE 0x2\n# define SSL_CONF_FLAG_CLIENT 0x4\n# define SSL_CONF_FLAG_SERVER 0x8\n# define SSL_CONF_FLAG_SHOW_ERRORS 0x10\n# define SSL_CONF_FLAG_CERTIFICATE 0x20\n# define SSL_CONF_FLAG_REQUIRE_PRIVATE 0x40\n/* Configuration value types */\n# define SSL_CONF_TYPE_UNKNOWN 0x0\n# define SSL_CONF_TYPE_STRING 0x1\n# define SSL_CONF_TYPE_FILE 0x2\n# define SSL_CONF_TYPE_DIR 0x3\n# define SSL_CONF_TYPE_NONE 0x4\n\n/* Maximum length of the application-controlled segment of a a TLSv1.3 cookie */\n# define SSL_COOKIE_LENGTH 4096\n\n/*\n * Note: SSL[_CTX]_set_{options,mode} use |= op on the previous value, they\n * cannot be used to clear bits.\n */\n\nunsigned long SSL_CTX_get_options(const SSL_CTX *ctx);\nunsigned long SSL_get_options(const SSL *s);\nunsigned long SSL_CTX_clear_options(SSL_CTX *ctx, unsigned long op);\nunsigned long SSL_clear_options(SSL *s, unsigned long op);\nunsigned long SSL_CTX_set_options(SSL_CTX *ctx, unsigned long op);\nunsigned long SSL_set_options(SSL *s, unsigned long op);\n\n# define SSL_CTX_set_mode(ctx,op) \\\n SSL_CTX_ctrl((ctx),SSL_CTRL_MODE,(op),NULL)\n# define SSL_CTX_clear_mode(ctx,op) \\\n SSL_CTX_ctrl((ctx),SSL_CTRL_CLEAR_MODE,(op),NULL)\n# define SSL_CTX_get_mode(ctx) \\\n SSL_CTX_ctrl((ctx),SSL_CTRL_MODE,0,NULL)\n# define SSL_clear_mode(ssl,op) \\\n SSL_ctrl((ssl),SSL_CTRL_CLEAR_MODE,(op),NULL)\n# define SSL_set_mode(ssl,op) \\\n SSL_ctrl((ssl),SSL_CTRL_MODE,(op),NULL)\n# define SSL_get_mode(ssl) \\\n SSL_ctrl((ssl),SSL_CTRL_MODE,0,NULL)\n# define SSL_set_mtu(ssl, mtu) \\\n SSL_ctrl((ssl),SSL_CTRL_SET_MTU,(mtu),NULL)\n# define DTLS_set_link_mtu(ssl, mtu) \\\n SSL_ctrl((ssl),DTLS_CTRL_SET_LINK_MTU,(mtu),NULL)\n# define DTLS_get_link_min_mtu(ssl) \\\n SSL_ctrl((ssl),DTLS_CTRL_GET_LINK_MIN_MTU,0,NULL)\n\n# define SSL_get_secure_renegotiation_support(ssl) \\\n SSL_ctrl((ssl), SSL_CTRL_GET_RI_SUPPORT, 0, NULL)\n\n# ifndef OPENSSL_NO_HEARTBEATS\n# define SSL_heartbeat(ssl) \\\n SSL_ctrl((ssl),SSL_CTRL_DTLS_EXT_SEND_HEARTBEAT,0,NULL)\n# endif\n\n# define SSL_CTX_set_cert_flags(ctx,op) \\\n SSL_CTX_ctrl((ctx),SSL_CTRL_CERT_FLAGS,(op),NULL)\n# define SSL_set_cert_flags(s,op) \\\n SSL_ctrl((s),SSL_CTRL_CERT_FLAGS,(op),NULL)\n# define SSL_CTX_clear_cert_flags(ctx,op) \\\n SSL_CTX_ctrl((ctx),SSL_CTRL_CLEAR_CERT_FLAGS,(op),NULL)\n# define SSL_clear_cert_flags(s,op) \\\n SSL_ctrl((s),SSL_CTRL_CLEAR_CERT_FLAGS,(op),NULL)\n\nvoid SSL_CTX_set_msg_callback(SSL_CTX *ctx,\n void (*cb) (int write_p, int version,\n int content_type, const void *buf,\n size_t len, SSL *ssl, void *arg));\nvoid SSL_set_msg_callback(SSL *ssl,\n void (*cb) (int write_p, int version,\n int content_type, const void *buf,\n size_t len, SSL *ssl, void *arg));\n# define SSL_CTX_set_msg_callback_arg(ctx, arg) SSL_CTX_ctrl((ctx), SSL_CTRL_SET_MSG_CALLBACK_ARG, 0, (arg))\n# define SSL_set_msg_callback_arg(ssl, arg) SSL_ctrl((ssl), SSL_CTRL_SET_MSG_CALLBACK_ARG, 0, (arg))\n\n# define SSL_get_extms_support(s) \\\n SSL_ctrl((s),SSL_CTRL_GET_EXTMS_SUPPORT,0,NULL)\n\n# ifndef OPENSSL_NO_SRP\n\n/* see tls_srp.c */\n__owur int SSL_SRP_CTX_init(SSL *s);\n__owur int SSL_CTX_SRP_CTX_init(SSL_CTX *ctx);\nint SSL_SRP_CTX_free(SSL *ctx);\nint SSL_CTX_SRP_CTX_free(SSL_CTX *ctx);\n__owur int SSL_srp_server_param_with_username(SSL *s, int *ad);\n__owur int SRP_Calc_A_param(SSL *s);\n\n# endif\n\n/* 100k max cert list */\n# define SSL_MAX_CERT_LIST_DEFAULT 1024*100\n\n# define SSL_SESSION_CACHE_MAX_SIZE_DEFAULT (1024*20)\n\n/*\n * This callback type is used inside SSL_CTX, SSL, and in the functions that\n * set them. It is used to override the generation of SSL/TLS session IDs in\n * a server. Return value should be zero on an error, non-zero to proceed.\n * Also, callbacks should themselves check if the id they generate is unique\n * otherwise the SSL handshake will fail with an error - callbacks can do\n * this using the 'ssl' value they're passed by;\n * SSL_has_matching_session_id(ssl, id, *id_len) The length value passed in\n * is set at the maximum size the session ID can be. In SSLv3/TLSv1 it is 32\n * bytes. The callback can alter this length to be less if desired. It is\n * also an error for the callback to set the size to zero.\n */\ntypedef int (*GEN_SESSION_CB) (SSL *ssl, unsigned char *id,\n unsigned int *id_len);\n\n# define SSL_SESS_CACHE_OFF 0x0000\n# define SSL_SESS_CACHE_CLIENT 0x0001\n# define SSL_SESS_CACHE_SERVER 0x0002\n# define SSL_SESS_CACHE_BOTH (SSL_SESS_CACHE_CLIENT|SSL_SESS_CACHE_SERVER)\n# define SSL_SESS_CACHE_NO_AUTO_CLEAR 0x0080\n/* enough comments already ... see SSL_CTX_set_session_cache_mode(3) */\n# define SSL_SESS_CACHE_NO_INTERNAL_LOOKUP 0x0100\n# define SSL_SESS_CACHE_NO_INTERNAL_STORE 0x0200\n# define SSL_SESS_CACHE_NO_INTERNAL \\\n (SSL_SESS_CACHE_NO_INTERNAL_LOOKUP|SSL_SESS_CACHE_NO_INTERNAL_STORE)\n\nLHASH_OF(SSL_SESSION) *SSL_CTX_sessions(SSL_CTX *ctx);\n# define SSL_CTX_sess_number(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SESS_NUMBER,0,NULL)\n# define SSL_CTX_sess_connect(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SESS_CONNECT,0,NULL)\n# define SSL_CTX_sess_connect_good(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SESS_CONNECT_GOOD,0,NULL)\n# define SSL_CTX_sess_connect_renegotiate(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SESS_CONNECT_RENEGOTIATE,0,NULL)\n# define SSL_CTX_sess_accept(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SESS_ACCEPT,0,NULL)\n# define SSL_CTX_sess_accept_renegotiate(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SESS_ACCEPT_RENEGOTIATE,0,NULL)\n# define SSL_CTX_sess_accept_good(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SESS_ACCEPT_GOOD,0,NULL)\n# define SSL_CTX_sess_hits(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SESS_HIT,0,NULL)\n# define SSL_CTX_sess_cb_hits(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SESS_CB_HIT,0,NULL)\n# define SSL_CTX_sess_misses(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SESS_MISSES,0,NULL)\n# define SSL_CTX_sess_timeouts(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SESS_TIMEOUTS,0,NULL)\n# define SSL_CTX_sess_cache_full(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SESS_CACHE_FULL,0,NULL)\n\nvoid SSL_CTX_sess_set_new_cb(SSL_CTX *ctx,\n int (*new_session_cb) (struct ssl_st *ssl,\n SSL_SESSION *sess));\nint (*SSL_CTX_sess_get_new_cb(SSL_CTX *ctx)) (struct ssl_st *ssl,\n SSL_SESSION *sess);\nvoid SSL_CTX_sess_set_remove_cb(SSL_CTX *ctx,\n void (*remove_session_cb) (struct ssl_ctx_st\n *ctx,\n SSL_SESSION *sess));\nvoid (*SSL_CTX_sess_get_remove_cb(SSL_CTX *ctx)) (struct ssl_ctx_st *ctx,\n SSL_SESSION *sess);\nvoid SSL_CTX_sess_set_get_cb(SSL_CTX *ctx,\n SSL_SESSION *(*get_session_cb) (struct ssl_st\n *ssl,\n const unsigned char\n *data, int len,\n int *copy));\nSSL_SESSION *(*SSL_CTX_sess_get_get_cb(SSL_CTX *ctx)) (struct ssl_st *ssl,\n const unsigned char *data,\n int len, int *copy);\nvoid SSL_CTX_set_info_callback(SSL_CTX *ctx,\n void (*cb) (const SSL *ssl, int type, int val));\nvoid (*SSL_CTX_get_info_callback(SSL_CTX *ctx)) (const SSL *ssl, int type,\n int val);\nvoid SSL_CTX_set_client_cert_cb(SSL_CTX *ctx,\n int (*client_cert_cb) (SSL *ssl, X509 **x509,\n EVP_PKEY **pkey));\nint (*SSL_CTX_get_client_cert_cb(SSL_CTX *ctx)) (SSL *ssl, X509 **x509,\n EVP_PKEY **pkey);\n# ifndef OPENSSL_NO_ENGINE\n__owur int SSL_CTX_set_client_cert_engine(SSL_CTX *ctx, ENGINE *e);\n# endif\nvoid SSL_CTX_set_cookie_generate_cb(SSL_CTX *ctx,\n int (*app_gen_cookie_cb) (SSL *ssl,\n unsigned char\n *cookie,\n unsigned int\n *cookie_len));\nvoid SSL_CTX_set_cookie_verify_cb(SSL_CTX *ctx,\n int (*app_verify_cookie_cb) (SSL *ssl,\n const unsigned\n char *cookie,\n unsigned int\n cookie_len));\n\nvoid SSL_CTX_set_stateless_cookie_generate_cb(\n SSL_CTX *ctx,\n int (*gen_stateless_cookie_cb) (SSL *ssl,\n unsigned char *cookie,\n size_t *cookie_len));\nvoid SSL_CTX_set_stateless_cookie_verify_cb(\n SSL_CTX *ctx,\n int (*verify_stateless_cookie_cb) (SSL *ssl,\n const unsigned char *cookie,\n size_t cookie_len));\n# ifndef OPENSSL_NO_NEXTPROTONEG\n\ntypedef int (*SSL_CTX_npn_advertised_cb_func)(SSL *ssl,\n const unsigned char **out,\n unsigned int *outlen,\n void *arg);\nvoid SSL_CTX_set_next_protos_advertised_cb(SSL_CTX *s,\n SSL_CTX_npn_advertised_cb_func cb,\n void *arg);\n# define SSL_CTX_set_npn_advertised_cb SSL_CTX_set_next_protos_advertised_cb\n\ntypedef int (*SSL_CTX_npn_select_cb_func)(SSL *s,\n unsigned char **out,\n unsigned char *outlen,\n const unsigned char *in,\n unsigned int inlen,\n void *arg);\nvoid SSL_CTX_set_next_proto_select_cb(SSL_CTX *s,\n SSL_CTX_npn_select_cb_func cb,\n void *arg);\n# define SSL_CTX_set_npn_select_cb SSL_CTX_set_next_proto_select_cb\n\nvoid SSL_get0_next_proto_negotiated(const SSL *s, const unsigned char **data,\n unsigned *len);\n# define SSL_get0_npn_negotiated SSL_get0_next_proto_negotiated\n# endif\n\n__owur int SSL_select_next_proto(unsigned char **out, unsigned char *outlen,\n const unsigned char *in, unsigned int inlen,\n const unsigned char *client,\n unsigned int client_len);\n\n# define OPENSSL_NPN_UNSUPPORTED 0\n# define OPENSSL_NPN_NEGOTIATED 1\n# define OPENSSL_NPN_NO_OVERLAP 2\n\n__owur int SSL_CTX_set_alpn_protos(SSL_CTX *ctx, const unsigned char *protos,\n unsigned int protos_len);\n__owur int SSL_set_alpn_protos(SSL *ssl, const unsigned char *protos,\n unsigned int protos_len);\ntypedef int (*SSL_CTX_alpn_select_cb_func)(SSL *ssl,\n const unsigned char **out,\n unsigned char *outlen,\n const unsigned char *in,\n unsigned int inlen,\n void *arg);\nvoid SSL_CTX_set_alpn_select_cb(SSL_CTX *ctx,\n SSL_CTX_alpn_select_cb_func cb,\n void *arg);\nvoid SSL_get0_alpn_selected(const SSL *ssl, const unsigned char **data,\n unsigned int *len);\n\n# ifndef OPENSSL_NO_PSK\n/*\n * the maximum length of the buffer given to callbacks containing the\n * resulting identity/psk\n */\n# define PSK_MAX_IDENTITY_LEN 128\n# define PSK_MAX_PSK_LEN 256\ntypedef unsigned int (*SSL_psk_client_cb_func)(SSL *ssl,\n const char *hint,\n char *identity,\n unsigned int max_identity_len,\n unsigned char *psk,\n unsigned int max_psk_len);\nvoid SSL_CTX_set_psk_client_callback(SSL_CTX *ctx, SSL_psk_client_cb_func cb);\nvoid SSL_set_psk_client_callback(SSL *ssl, SSL_psk_client_cb_func cb);\n\ntypedef unsigned int (*SSL_psk_server_cb_func)(SSL *ssl,\n const char *identity,\n unsigned char *psk,\n unsigned int max_psk_len);\nvoid SSL_CTX_set_psk_server_callback(SSL_CTX *ctx, SSL_psk_server_cb_func cb);\nvoid SSL_set_psk_server_callback(SSL *ssl, SSL_psk_server_cb_func cb);\n\n__owur int SSL_CTX_use_psk_identity_hint(SSL_CTX *ctx, const char *identity_hint);\n__owur int SSL_use_psk_identity_hint(SSL *s, const char *identity_hint);\nconst char *SSL_get_psk_identity_hint(const SSL *s);\nconst char *SSL_get_psk_identity(const SSL *s);\n# endif\n\ntypedef int (*SSL_psk_find_session_cb_func)(SSL *ssl,\n const unsigned char *identity,\n size_t identity_len,\n SSL_SESSION **sess);\ntypedef int (*SSL_psk_use_session_cb_func)(SSL *ssl, const EVP_MD *md,\n const unsigned char **id,\n size_t *idlen,\n SSL_SESSION **sess);\n\nvoid SSL_set_psk_find_session_callback(SSL *s, SSL_psk_find_session_cb_func cb);\nvoid SSL_CTX_set_psk_find_session_callback(SSL_CTX *ctx,\n SSL_psk_find_session_cb_func cb);\nvoid SSL_set_psk_use_session_callback(SSL *s, SSL_psk_use_session_cb_func cb);\nvoid SSL_CTX_set_psk_use_session_callback(SSL_CTX *ctx,\n SSL_psk_use_session_cb_func cb);\n\n/* Register callbacks to handle custom TLS Extensions for client or server. */\n\n__owur int SSL_CTX_has_client_custom_ext(const SSL_CTX *ctx,\n unsigned int ext_type);\n\n__owur int SSL_CTX_add_client_custom_ext(SSL_CTX *ctx,\n unsigned int ext_type,\n custom_ext_add_cb add_cb,\n custom_ext_free_cb free_cb,\n void *add_arg,\n custom_ext_parse_cb parse_cb,\n void *parse_arg);\n\n__owur int SSL_CTX_add_server_custom_ext(SSL_CTX *ctx,\n unsigned int ext_type,\n custom_ext_add_cb add_cb,\n custom_ext_free_cb free_cb,\n void *add_arg,\n custom_ext_parse_cb parse_cb,\n void *parse_arg);\n\n__owur int SSL_CTX_add_custom_ext(SSL_CTX *ctx, unsigned int ext_type,\n unsigned int context,\n SSL_custom_ext_add_cb_ex add_cb,\n SSL_custom_ext_free_cb_ex free_cb,\n void *add_arg,\n SSL_custom_ext_parse_cb_ex parse_cb,\n void *parse_arg);\n\n__owur int SSL_extension_supported(unsigned int ext_type);\n\n# define SSL_NOTHING 1\n# define SSL_WRITING 2\n# define SSL_READING 3\n# define SSL_X509_LOOKUP 4\n# define SSL_ASYNC_PAUSED 5\n# define SSL_ASYNC_NO_JOBS 6\n# define SSL_CLIENT_HELLO_CB 7\n\n/* These will only be used when doing non-blocking IO */\n# define SSL_want_nothing(s) (SSL_want(s) == SSL_NOTHING)\n# define SSL_want_read(s) (SSL_want(s) == SSL_READING)\n# define SSL_want_write(s) (SSL_want(s) == SSL_WRITING)\n# define SSL_want_x509_lookup(s) (SSL_want(s) == SSL_X509_LOOKUP)\n# define SSL_want_async(s) (SSL_want(s) == SSL_ASYNC_PAUSED)\n# define SSL_want_async_job(s) (SSL_want(s) == SSL_ASYNC_NO_JOBS)\n# define SSL_want_client_hello_cb(s) (SSL_want(s) == SSL_CLIENT_HELLO_CB)\n\n# define SSL_MAC_FLAG_READ_MAC_STREAM 1\n# define SSL_MAC_FLAG_WRITE_MAC_STREAM 2\n\n/*\n * A callback for logging out TLS key material. This callback should log out\n * |line| followed by a newline.\n */\ntypedef void (*SSL_CTX_keylog_cb_func)(const SSL *ssl, const char *line);\n\n/*\n * SSL_CTX_set_keylog_callback configures a callback to log key material. This\n * is intended for debugging use with tools like Wireshark. The cb function\n * should log line followed by a newline.\n */\nvoid SSL_CTX_set_keylog_callback(SSL_CTX *ctx, SSL_CTX_keylog_cb_func cb);\n\n/*\n * SSL_CTX_get_keylog_callback returns the callback configured by\n * SSL_CTX_set_keylog_callback.\n */\nSSL_CTX_keylog_cb_func SSL_CTX_get_keylog_callback(const SSL_CTX *ctx);\n\nint SSL_CTX_set_max_early_data(SSL_CTX *ctx, uint32_t max_early_data);\nuint32_t SSL_CTX_get_max_early_data(const SSL_CTX *ctx);\nint SSL_set_max_early_data(SSL *s, uint32_t max_early_data);\nuint32_t SSL_get_max_early_data(const SSL *s);\nint SSL_CTX_set_recv_max_early_data(SSL_CTX *ctx, uint32_t recv_max_early_data);\nuint32_t SSL_CTX_get_recv_max_early_data(const SSL_CTX *ctx);\nint SSL_set_recv_max_early_data(SSL *s, uint32_t recv_max_early_data);\nuint32_t SSL_get_recv_max_early_data(const SSL *s);\n\n#ifdef __cplusplus\n}\n#endif\n\n# include \n# include \n# include /* This is mostly sslv3 with a few tweaks */\n# include /* Datagram TLS */\n# include /* Support for the use_srtp extension */\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/*\n * These need to be after the above set of includes due to a compiler bug\n * in VisualStudio 2015\n */\nDEFINE_STACK_OF_CONST(SSL_CIPHER)\nDEFINE_STACK_OF(SSL_COMP)\n\n/* compatibility */\n# define SSL_set_app_data(s,arg) (SSL_set_ex_data(s,0,(char *)(arg)))\n# define SSL_get_app_data(s) (SSL_get_ex_data(s,0))\n# define SSL_SESSION_set_app_data(s,a) (SSL_SESSION_set_ex_data(s,0, \\\n (char *)(a)))\n# define SSL_SESSION_get_app_data(s) (SSL_SESSION_get_ex_data(s,0))\n# define SSL_CTX_get_app_data(ctx) (SSL_CTX_get_ex_data(ctx,0))\n# define SSL_CTX_set_app_data(ctx,arg) (SSL_CTX_set_ex_data(ctx,0, \\\n (char *)(arg)))\nDEPRECATEDIN_1_1_0(void SSL_set_debug(SSL *s, int debug))\n\n/* TLSv1.3 KeyUpdate message types */\n/* -1 used so that this is an invalid value for the on-the-wire protocol */\n#define SSL_KEY_UPDATE_NONE -1\n/* Values as defined for the on-the-wire protocol */\n#define SSL_KEY_UPDATE_NOT_REQUESTED 0\n#define SSL_KEY_UPDATE_REQUESTED 1\n\n/*\n * The valid handshake states (one for each type message sent and one for each\n * type of message received). There are also two \"special\" states:\n * TLS = TLS or DTLS state\n * DTLS = DTLS specific state\n * CR/SR = Client Read/Server Read\n * CW/SW = Client Write/Server Write\n *\n * The \"special\" states are:\n * TLS_ST_BEFORE = No handshake has been initiated yet\n * TLS_ST_OK = A handshake has been successfully completed\n */\ntypedef enum {\n TLS_ST_BEFORE,\n TLS_ST_OK,\n DTLS_ST_CR_HELLO_VERIFY_REQUEST,\n TLS_ST_CR_SRVR_HELLO,\n TLS_ST_CR_CERT,\n TLS_ST_CR_CERT_STATUS,\n TLS_ST_CR_KEY_EXCH,\n TLS_ST_CR_CERT_REQ,\n TLS_ST_CR_SRVR_DONE,\n TLS_ST_CR_SESSION_TICKET,\n TLS_ST_CR_CHANGE,\n TLS_ST_CR_FINISHED,\n TLS_ST_CW_CLNT_HELLO,\n TLS_ST_CW_CERT,\n TLS_ST_CW_KEY_EXCH,\n TLS_ST_CW_CERT_VRFY,\n TLS_ST_CW_CHANGE,\n TLS_ST_CW_NEXT_PROTO,\n TLS_ST_CW_FINISHED,\n TLS_ST_SW_HELLO_REQ,\n TLS_ST_SR_CLNT_HELLO,\n DTLS_ST_SW_HELLO_VERIFY_REQUEST,\n TLS_ST_SW_SRVR_HELLO,\n TLS_ST_SW_CERT,\n TLS_ST_SW_KEY_EXCH,\n TLS_ST_SW_CERT_REQ,\n TLS_ST_SW_SRVR_DONE,\n TLS_ST_SR_CERT,\n TLS_ST_SR_KEY_EXCH,\n TLS_ST_SR_CERT_VRFY,\n TLS_ST_SR_NEXT_PROTO,\n TLS_ST_SR_CHANGE,\n TLS_ST_SR_FINISHED,\n TLS_ST_SW_SESSION_TICKET,\n TLS_ST_SW_CERT_STATUS,\n TLS_ST_SW_CHANGE,\n TLS_ST_SW_FINISHED,\n TLS_ST_SW_ENCRYPTED_EXTENSIONS,\n TLS_ST_CR_ENCRYPTED_EXTENSIONS,\n TLS_ST_CR_CERT_VRFY,\n TLS_ST_SW_CERT_VRFY,\n TLS_ST_CR_HELLO_REQ,\n TLS_ST_SW_KEY_UPDATE,\n TLS_ST_CW_KEY_UPDATE,\n TLS_ST_SR_KEY_UPDATE,\n TLS_ST_CR_KEY_UPDATE,\n TLS_ST_EARLY_DATA,\n TLS_ST_PENDING_EARLY_DATA_END,\n TLS_ST_CW_END_OF_EARLY_DATA,\n TLS_ST_SR_END_OF_EARLY_DATA\n} OSSL_HANDSHAKE_STATE;\n\n/*\n * Most of the following state values are no longer used and are defined to be\n * the closest equivalent value in the current state machine code. Not all\n * defines have an equivalent and are set to a dummy value (-1). SSL_ST_CONNECT\n * and SSL_ST_ACCEPT are still in use in the definition of SSL_CB_ACCEPT_LOOP,\n * SSL_CB_ACCEPT_EXIT, SSL_CB_CONNECT_LOOP and SSL_CB_CONNECT_EXIT.\n */\n\n# define SSL_ST_CONNECT 0x1000\n# define SSL_ST_ACCEPT 0x2000\n\n# define SSL_ST_MASK 0x0FFF\n\n# define SSL_CB_LOOP 0x01\n# define SSL_CB_EXIT 0x02\n# define SSL_CB_READ 0x04\n# define SSL_CB_WRITE 0x08\n# define SSL_CB_ALERT 0x4000/* used in callback */\n# define SSL_CB_READ_ALERT (SSL_CB_ALERT|SSL_CB_READ)\n# define SSL_CB_WRITE_ALERT (SSL_CB_ALERT|SSL_CB_WRITE)\n# define SSL_CB_ACCEPT_LOOP (SSL_ST_ACCEPT|SSL_CB_LOOP)\n# define SSL_CB_ACCEPT_EXIT (SSL_ST_ACCEPT|SSL_CB_EXIT)\n# define SSL_CB_CONNECT_LOOP (SSL_ST_CONNECT|SSL_CB_LOOP)\n# define SSL_CB_CONNECT_EXIT (SSL_ST_CONNECT|SSL_CB_EXIT)\n# define SSL_CB_HANDSHAKE_START 0x10\n# define SSL_CB_HANDSHAKE_DONE 0x20\n\n/* Is the SSL_connection established? */\n# define SSL_in_connect_init(a) (SSL_in_init(a) && !SSL_is_server(a))\n# define SSL_in_accept_init(a) (SSL_in_init(a) && SSL_is_server(a))\nint SSL_in_init(const SSL *s);\nint SSL_in_before(const SSL *s);\nint SSL_is_init_finished(const SSL *s);\n\n/*\n * The following 3 states are kept in ssl->rlayer.rstate when reads fail, you\n * should not need these\n */\n# define SSL_ST_READ_HEADER 0xF0\n# define SSL_ST_READ_BODY 0xF1\n# define SSL_ST_READ_DONE 0xF2\n\n/*-\n * Obtain latest Finished message\n * -- that we sent (SSL_get_finished)\n * -- that we expected from peer (SSL_get_peer_finished).\n * Returns length (0 == no Finished so far), copies up to 'count' bytes.\n */\nsize_t SSL_get_finished(const SSL *s, void *buf, size_t count);\nsize_t SSL_get_peer_finished(const SSL *s, void *buf, size_t count);\n\n/*\n * use either SSL_VERIFY_NONE or SSL_VERIFY_PEER, the last 3 options are\n * 'ored' with SSL_VERIFY_PEER if they are desired\n */\n# define SSL_VERIFY_NONE 0x00\n# define SSL_VERIFY_PEER 0x01\n# define SSL_VERIFY_FAIL_IF_NO_PEER_CERT 0x02\n# define SSL_VERIFY_CLIENT_ONCE 0x04\n# define SSL_VERIFY_POST_HANDSHAKE 0x08\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define OpenSSL_add_ssl_algorithms() SSL_library_init()\n# define SSLeay_add_ssl_algorithms() SSL_library_init()\n# endif\n\n/* More backward compatibility */\n# define SSL_get_cipher(s) \\\n SSL_CIPHER_get_name(SSL_get_current_cipher(s))\n# define SSL_get_cipher_bits(s,np) \\\n SSL_CIPHER_get_bits(SSL_get_current_cipher(s),np)\n# define SSL_get_cipher_version(s) \\\n SSL_CIPHER_get_version(SSL_get_current_cipher(s))\n# define SSL_get_cipher_name(s) \\\n SSL_CIPHER_get_name(SSL_get_current_cipher(s))\n# define SSL_get_time(a) SSL_SESSION_get_time(a)\n# define SSL_set_time(a,b) SSL_SESSION_set_time((a),(b))\n# define SSL_get_timeout(a) SSL_SESSION_get_timeout(a)\n# define SSL_set_timeout(a,b) SSL_SESSION_set_timeout((a),(b))\n\n# define d2i_SSL_SESSION_bio(bp,s_id) ASN1_d2i_bio_of(SSL_SESSION,SSL_SESSION_new,d2i_SSL_SESSION,bp,s_id)\n# define i2d_SSL_SESSION_bio(bp,s_id) ASN1_i2d_bio_of(SSL_SESSION,i2d_SSL_SESSION,bp,s_id)\n\nDECLARE_PEM_rw(SSL_SESSION, SSL_SESSION)\n# define SSL_AD_REASON_OFFSET 1000/* offset to get SSL_R_... value\n * from SSL_AD_... */\n/* These alert types are for SSLv3 and TLSv1 */\n# define SSL_AD_CLOSE_NOTIFY SSL3_AD_CLOSE_NOTIFY\n/* fatal */\n# define SSL_AD_UNEXPECTED_MESSAGE SSL3_AD_UNEXPECTED_MESSAGE\n/* fatal */\n# define SSL_AD_BAD_RECORD_MAC SSL3_AD_BAD_RECORD_MAC\n# define SSL_AD_DECRYPTION_FAILED TLS1_AD_DECRYPTION_FAILED\n# define SSL_AD_RECORD_OVERFLOW TLS1_AD_RECORD_OVERFLOW\n/* fatal */\n# define SSL_AD_DECOMPRESSION_FAILURE SSL3_AD_DECOMPRESSION_FAILURE\n/* fatal */\n# define SSL_AD_HANDSHAKE_FAILURE SSL3_AD_HANDSHAKE_FAILURE\n/* Not for TLS */\n# define SSL_AD_NO_CERTIFICATE SSL3_AD_NO_CERTIFICATE\n# define SSL_AD_BAD_CERTIFICATE SSL3_AD_BAD_CERTIFICATE\n# define SSL_AD_UNSUPPORTED_CERTIFICATE SSL3_AD_UNSUPPORTED_CERTIFICATE\n# define SSL_AD_CERTIFICATE_REVOKED SSL3_AD_CERTIFICATE_REVOKED\n# define SSL_AD_CERTIFICATE_EXPIRED SSL3_AD_CERTIFICATE_EXPIRED\n# define SSL_AD_CERTIFICATE_UNKNOWN SSL3_AD_CERTIFICATE_UNKNOWN\n/* fatal */\n# define SSL_AD_ILLEGAL_PARAMETER SSL3_AD_ILLEGAL_PARAMETER\n/* fatal */\n# define SSL_AD_UNKNOWN_CA TLS1_AD_UNKNOWN_CA\n/* fatal */\n# define SSL_AD_ACCESS_DENIED TLS1_AD_ACCESS_DENIED\n/* fatal */\n# define SSL_AD_DECODE_ERROR TLS1_AD_DECODE_ERROR\n# define SSL_AD_DECRYPT_ERROR TLS1_AD_DECRYPT_ERROR\n/* fatal */\n# define SSL_AD_EXPORT_RESTRICTION TLS1_AD_EXPORT_RESTRICTION\n/* fatal */\n# define SSL_AD_PROTOCOL_VERSION TLS1_AD_PROTOCOL_VERSION\n/* fatal */\n# define SSL_AD_INSUFFICIENT_SECURITY TLS1_AD_INSUFFICIENT_SECURITY\n/* fatal */\n# define SSL_AD_INTERNAL_ERROR TLS1_AD_INTERNAL_ERROR\n# define SSL_AD_USER_CANCELLED TLS1_AD_USER_CANCELLED\n# define SSL_AD_NO_RENEGOTIATION TLS1_AD_NO_RENEGOTIATION\n# define SSL_AD_MISSING_EXTENSION TLS13_AD_MISSING_EXTENSION\n# define SSL_AD_CERTIFICATE_REQUIRED TLS13_AD_CERTIFICATE_REQUIRED\n# define SSL_AD_UNSUPPORTED_EXTENSION TLS1_AD_UNSUPPORTED_EXTENSION\n# define SSL_AD_CERTIFICATE_UNOBTAINABLE TLS1_AD_CERTIFICATE_UNOBTAINABLE\n# define SSL_AD_UNRECOGNIZED_NAME TLS1_AD_UNRECOGNIZED_NAME\n# define SSL_AD_BAD_CERTIFICATE_STATUS_RESPONSE TLS1_AD_BAD_CERTIFICATE_STATUS_RESPONSE\n# define SSL_AD_BAD_CERTIFICATE_HASH_VALUE TLS1_AD_BAD_CERTIFICATE_HASH_VALUE\n/* fatal */\n# define SSL_AD_UNKNOWN_PSK_IDENTITY TLS1_AD_UNKNOWN_PSK_IDENTITY\n/* fatal */\n# define SSL_AD_INAPPROPRIATE_FALLBACK TLS1_AD_INAPPROPRIATE_FALLBACK\n# define SSL_AD_NO_APPLICATION_PROTOCOL TLS1_AD_NO_APPLICATION_PROTOCOL\n# define SSL_ERROR_NONE 0\n# define SSL_ERROR_SSL 1\n# define SSL_ERROR_WANT_READ 2\n# define SSL_ERROR_WANT_WRITE 3\n# define SSL_ERROR_WANT_X509_LOOKUP 4\n# define SSL_ERROR_SYSCALL 5/* look at error stack/return\n * value/errno */\n# define SSL_ERROR_ZERO_RETURN 6\n# define SSL_ERROR_WANT_CONNECT 7\n# define SSL_ERROR_WANT_ACCEPT 8\n# define SSL_ERROR_WANT_ASYNC 9\n# define SSL_ERROR_WANT_ASYNC_JOB 10\n# define SSL_ERROR_WANT_CLIENT_HELLO_CB 11\n# define SSL_CTRL_SET_TMP_DH 3\n# define SSL_CTRL_SET_TMP_ECDH 4\n# define SSL_CTRL_SET_TMP_DH_CB 6\n# define SSL_CTRL_GET_CLIENT_CERT_REQUEST 9\n# define SSL_CTRL_GET_NUM_RENEGOTIATIONS 10\n# define SSL_CTRL_CLEAR_NUM_RENEGOTIATIONS 11\n# define SSL_CTRL_GET_TOTAL_RENEGOTIATIONS 12\n# define SSL_CTRL_GET_FLAGS 13\n# define SSL_CTRL_EXTRA_CHAIN_CERT 14\n# define SSL_CTRL_SET_MSG_CALLBACK 15\n# define SSL_CTRL_SET_MSG_CALLBACK_ARG 16\n/* only applies to datagram connections */\n# define SSL_CTRL_SET_MTU 17\n/* Stats */\n# define SSL_CTRL_SESS_NUMBER 20\n# define SSL_CTRL_SESS_CONNECT 21\n# define SSL_CTRL_SESS_CONNECT_GOOD 22\n# define SSL_CTRL_SESS_CONNECT_RENEGOTIATE 23\n# define SSL_CTRL_SESS_ACCEPT 24\n# define SSL_CTRL_SESS_ACCEPT_GOOD 25\n# define SSL_CTRL_SESS_ACCEPT_RENEGOTIATE 26\n# define SSL_CTRL_SESS_HIT 27\n# define SSL_CTRL_SESS_CB_HIT 28\n# define SSL_CTRL_SESS_MISSES 29\n# define SSL_CTRL_SESS_TIMEOUTS 30\n# define SSL_CTRL_SESS_CACHE_FULL 31\n# define SSL_CTRL_MODE 33\n# define SSL_CTRL_GET_READ_AHEAD 40\n# define SSL_CTRL_SET_READ_AHEAD 41\n# define SSL_CTRL_SET_SESS_CACHE_SIZE 42\n# define SSL_CTRL_GET_SESS_CACHE_SIZE 43\n# define SSL_CTRL_SET_SESS_CACHE_MODE 44\n# define SSL_CTRL_GET_SESS_CACHE_MODE 45\n# define SSL_CTRL_GET_MAX_CERT_LIST 50\n# define SSL_CTRL_SET_MAX_CERT_LIST 51\n# define SSL_CTRL_SET_MAX_SEND_FRAGMENT 52\n/* see tls1.h for macros based on these */\n# define SSL_CTRL_SET_TLSEXT_SERVERNAME_CB 53\n# define SSL_CTRL_SET_TLSEXT_SERVERNAME_ARG 54\n# define SSL_CTRL_SET_TLSEXT_HOSTNAME 55\n# define SSL_CTRL_SET_TLSEXT_DEBUG_CB 56\n# define SSL_CTRL_SET_TLSEXT_DEBUG_ARG 57\n# define SSL_CTRL_GET_TLSEXT_TICKET_KEYS 58\n# define SSL_CTRL_SET_TLSEXT_TICKET_KEYS 59\n/*# define SSL_CTRL_SET_TLSEXT_OPAQUE_PRF_INPUT 60 */\n/*# define SSL_CTRL_SET_TLSEXT_OPAQUE_PRF_INPUT_CB 61 */\n/*# define SSL_CTRL_SET_TLSEXT_OPAQUE_PRF_INPUT_CB_ARG 62 */\n# define SSL_CTRL_SET_TLSEXT_STATUS_REQ_CB 63\n# define SSL_CTRL_SET_TLSEXT_STATUS_REQ_CB_ARG 64\n# define SSL_CTRL_SET_TLSEXT_STATUS_REQ_TYPE 65\n# define SSL_CTRL_GET_TLSEXT_STATUS_REQ_EXTS 66\n# define SSL_CTRL_SET_TLSEXT_STATUS_REQ_EXTS 67\n# define SSL_CTRL_GET_TLSEXT_STATUS_REQ_IDS 68\n# define SSL_CTRL_SET_TLSEXT_STATUS_REQ_IDS 69\n# define SSL_CTRL_GET_TLSEXT_STATUS_REQ_OCSP_RESP 70\n# define SSL_CTRL_SET_TLSEXT_STATUS_REQ_OCSP_RESP 71\n# define SSL_CTRL_SET_TLSEXT_TICKET_KEY_CB 72\n# define SSL_CTRL_SET_TLS_EXT_SRP_USERNAME_CB 75\n# define SSL_CTRL_SET_SRP_VERIFY_PARAM_CB 76\n# define SSL_CTRL_SET_SRP_GIVE_CLIENT_PWD_CB 77\n# define SSL_CTRL_SET_SRP_ARG 78\n# define SSL_CTRL_SET_TLS_EXT_SRP_USERNAME 79\n# define SSL_CTRL_SET_TLS_EXT_SRP_STRENGTH 80\n# define SSL_CTRL_SET_TLS_EXT_SRP_PASSWORD 81\n# ifndef OPENSSL_NO_HEARTBEATS\n# define SSL_CTRL_DTLS_EXT_SEND_HEARTBEAT 85\n# define SSL_CTRL_GET_DTLS_EXT_HEARTBEAT_PENDING 86\n# define SSL_CTRL_SET_DTLS_EXT_HEARTBEAT_NO_REQUESTS 87\n# endif\n# define DTLS_CTRL_GET_TIMEOUT 73\n# define DTLS_CTRL_HANDLE_TIMEOUT 74\n# define SSL_CTRL_GET_RI_SUPPORT 76\n# define SSL_CTRL_CLEAR_MODE 78\n# define SSL_CTRL_SET_NOT_RESUMABLE_SESS_CB 79\n# define SSL_CTRL_GET_EXTRA_CHAIN_CERTS 82\n# define SSL_CTRL_CLEAR_EXTRA_CHAIN_CERTS 83\n# define SSL_CTRL_CHAIN 88\n# define SSL_CTRL_CHAIN_CERT 89\n# define SSL_CTRL_GET_GROUPS 90\n# define SSL_CTRL_SET_GROUPS 91\n# define SSL_CTRL_SET_GROUPS_LIST 92\n# define SSL_CTRL_GET_SHARED_GROUP 93\n# define SSL_CTRL_SET_SIGALGS 97\n# define SSL_CTRL_SET_SIGALGS_LIST 98\n# define SSL_CTRL_CERT_FLAGS 99\n# define SSL_CTRL_CLEAR_CERT_FLAGS 100\n# define SSL_CTRL_SET_CLIENT_SIGALGS 101\n# define SSL_CTRL_SET_CLIENT_SIGALGS_LIST 102\n# define SSL_CTRL_GET_CLIENT_CERT_TYPES 103\n# define SSL_CTRL_SET_CLIENT_CERT_TYPES 104\n# define SSL_CTRL_BUILD_CERT_CHAIN 105\n# define SSL_CTRL_SET_VERIFY_CERT_STORE 106\n# define SSL_CTRL_SET_CHAIN_CERT_STORE 107\n# define SSL_CTRL_GET_PEER_SIGNATURE_NID 108\n# define SSL_CTRL_GET_PEER_TMP_KEY 109\n# define SSL_CTRL_GET_RAW_CIPHERLIST 110\n# define SSL_CTRL_GET_EC_POINT_FORMATS 111\n# define SSL_CTRL_GET_CHAIN_CERTS 115\n# define SSL_CTRL_SELECT_CURRENT_CERT 116\n# define SSL_CTRL_SET_CURRENT_CERT 117\n# define SSL_CTRL_SET_DH_AUTO 118\n# define DTLS_CTRL_SET_LINK_MTU 120\n# define DTLS_CTRL_GET_LINK_MIN_MTU 121\n# define SSL_CTRL_GET_EXTMS_SUPPORT 122\n# define SSL_CTRL_SET_MIN_PROTO_VERSION 123\n# define SSL_CTRL_SET_MAX_PROTO_VERSION 124\n# define SSL_CTRL_SET_SPLIT_SEND_FRAGMENT 125\n# define SSL_CTRL_SET_MAX_PIPELINES 126\n# define SSL_CTRL_GET_TLSEXT_STATUS_REQ_TYPE 127\n# define SSL_CTRL_GET_TLSEXT_STATUS_REQ_CB 128\n# define SSL_CTRL_GET_TLSEXT_STATUS_REQ_CB_ARG 129\n# define SSL_CTRL_GET_MIN_PROTO_VERSION 130\n# define SSL_CTRL_GET_MAX_PROTO_VERSION 131\n# define SSL_CTRL_GET_SIGNATURE_NID 132\n# define SSL_CTRL_GET_TMP_KEY 133\n# define SSL_CERT_SET_FIRST 1\n# define SSL_CERT_SET_NEXT 2\n# define SSL_CERT_SET_SERVER 3\n# define DTLSv1_get_timeout(ssl, arg) \\\n SSL_ctrl(ssl,DTLS_CTRL_GET_TIMEOUT,0, (void *)(arg))\n# define DTLSv1_handle_timeout(ssl) \\\n SSL_ctrl(ssl,DTLS_CTRL_HANDLE_TIMEOUT,0, NULL)\n# define SSL_num_renegotiations(ssl) \\\n SSL_ctrl((ssl),SSL_CTRL_GET_NUM_RENEGOTIATIONS,0,NULL)\n# define SSL_clear_num_renegotiations(ssl) \\\n SSL_ctrl((ssl),SSL_CTRL_CLEAR_NUM_RENEGOTIATIONS,0,NULL)\n# define SSL_total_renegotiations(ssl) \\\n SSL_ctrl((ssl),SSL_CTRL_GET_TOTAL_RENEGOTIATIONS,0,NULL)\n# define SSL_CTX_set_tmp_dh(ctx,dh) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_TMP_DH,0,(char *)(dh))\n# define SSL_CTX_set_tmp_ecdh(ctx,ecdh) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_TMP_ECDH,0,(char *)(ecdh))\n# define SSL_CTX_set_dh_auto(ctx, onoff) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_DH_AUTO,onoff,NULL)\n# define SSL_set_dh_auto(s, onoff) \\\n SSL_ctrl(s,SSL_CTRL_SET_DH_AUTO,onoff,NULL)\n# define SSL_set_tmp_dh(ssl,dh) \\\n SSL_ctrl(ssl,SSL_CTRL_SET_TMP_DH,0,(char *)(dh))\n# define SSL_set_tmp_ecdh(ssl,ecdh) \\\n SSL_ctrl(ssl,SSL_CTRL_SET_TMP_ECDH,0,(char *)(ecdh))\n# define SSL_CTX_add_extra_chain_cert(ctx,x509) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_EXTRA_CHAIN_CERT,0,(char *)(x509))\n# define SSL_CTX_get_extra_chain_certs(ctx,px509) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_GET_EXTRA_CHAIN_CERTS,0,px509)\n# define SSL_CTX_get_extra_chain_certs_only(ctx,px509) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_GET_EXTRA_CHAIN_CERTS,1,px509)\n# define SSL_CTX_clear_extra_chain_certs(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_CLEAR_EXTRA_CHAIN_CERTS,0,NULL)\n# define SSL_CTX_set0_chain(ctx,sk) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_CHAIN,0,(char *)(sk))\n# define SSL_CTX_set1_chain(ctx,sk) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_CHAIN,1,(char *)(sk))\n# define SSL_CTX_add0_chain_cert(ctx,x509) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_CHAIN_CERT,0,(char *)(x509))\n# define SSL_CTX_add1_chain_cert(ctx,x509) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_CHAIN_CERT,1,(char *)(x509))\n# define SSL_CTX_get0_chain_certs(ctx,px509) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_GET_CHAIN_CERTS,0,px509)\n# define SSL_CTX_clear_chain_certs(ctx) \\\n SSL_CTX_set0_chain(ctx,NULL)\n# define SSL_CTX_build_cert_chain(ctx, flags) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_BUILD_CERT_CHAIN, flags, NULL)\n# define SSL_CTX_select_current_cert(ctx,x509) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SELECT_CURRENT_CERT,0,(char *)(x509))\n# define SSL_CTX_set_current_cert(ctx, op) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_CURRENT_CERT, op, NULL)\n# define SSL_CTX_set0_verify_cert_store(ctx,st) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_VERIFY_CERT_STORE,0,(char *)(st))\n# define SSL_CTX_set1_verify_cert_store(ctx,st) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_VERIFY_CERT_STORE,1,(char *)(st))\n# define SSL_CTX_set0_chain_cert_store(ctx,st) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_CHAIN_CERT_STORE,0,(char *)(st))\n# define SSL_CTX_set1_chain_cert_store(ctx,st) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_CHAIN_CERT_STORE,1,(char *)(st))\n# define SSL_set0_chain(s,sk) \\\n SSL_ctrl(s,SSL_CTRL_CHAIN,0,(char *)(sk))\n# define SSL_set1_chain(s,sk) \\\n SSL_ctrl(s,SSL_CTRL_CHAIN,1,(char *)(sk))\n# define SSL_add0_chain_cert(s,x509) \\\n SSL_ctrl(s,SSL_CTRL_CHAIN_CERT,0,(char *)(x509))\n# define SSL_add1_chain_cert(s,x509) \\\n SSL_ctrl(s,SSL_CTRL_CHAIN_CERT,1,(char *)(x509))\n# define SSL_get0_chain_certs(s,px509) \\\n SSL_ctrl(s,SSL_CTRL_GET_CHAIN_CERTS,0,px509)\n# define SSL_clear_chain_certs(s) \\\n SSL_set0_chain(s,NULL)\n# define SSL_build_cert_chain(s, flags) \\\n SSL_ctrl(s,SSL_CTRL_BUILD_CERT_CHAIN, flags, NULL)\n# define SSL_select_current_cert(s,x509) \\\n SSL_ctrl(s,SSL_CTRL_SELECT_CURRENT_CERT,0,(char *)(x509))\n# define SSL_set_current_cert(s,op) \\\n SSL_ctrl(s,SSL_CTRL_SET_CURRENT_CERT, op, NULL)\n# define SSL_set0_verify_cert_store(s,st) \\\n SSL_ctrl(s,SSL_CTRL_SET_VERIFY_CERT_STORE,0,(char *)(st))\n# define SSL_set1_verify_cert_store(s,st) \\\n SSL_ctrl(s,SSL_CTRL_SET_VERIFY_CERT_STORE,1,(char *)(st))\n# define SSL_set0_chain_cert_store(s,st) \\\n SSL_ctrl(s,SSL_CTRL_SET_CHAIN_CERT_STORE,0,(char *)(st))\n# define SSL_set1_chain_cert_store(s,st) \\\n SSL_ctrl(s,SSL_CTRL_SET_CHAIN_CERT_STORE,1,(char *)(st))\n# define SSL_get1_groups(s, glist) \\\n SSL_ctrl(s,SSL_CTRL_GET_GROUPS,0,(int*)(glist))\n# define SSL_CTX_set1_groups(ctx, glist, glistlen) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_GROUPS,glistlen,(int *)(glist))\n# define SSL_CTX_set1_groups_list(ctx, s) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_GROUPS_LIST,0,(char *)(s))\n# define SSL_set1_groups(s, glist, glistlen) \\\n SSL_ctrl(s,SSL_CTRL_SET_GROUPS,glistlen,(char *)(glist))\n# define SSL_set1_groups_list(s, str) \\\n SSL_ctrl(s,SSL_CTRL_SET_GROUPS_LIST,0,(char *)(str))\n# define SSL_get_shared_group(s, n) \\\n SSL_ctrl(s,SSL_CTRL_GET_SHARED_GROUP,n,NULL)\n# define SSL_CTX_set1_sigalgs(ctx, slist, slistlen) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_SIGALGS,slistlen,(int *)(slist))\n# define SSL_CTX_set1_sigalgs_list(ctx, s) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_SIGALGS_LIST,0,(char *)(s))\n# define SSL_set1_sigalgs(s, slist, slistlen) \\\n SSL_ctrl(s,SSL_CTRL_SET_SIGALGS,slistlen,(int *)(slist))\n# define SSL_set1_sigalgs_list(s, str) \\\n SSL_ctrl(s,SSL_CTRL_SET_SIGALGS_LIST,0,(char *)(str))\n# define SSL_CTX_set1_client_sigalgs(ctx, slist, slistlen) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_CLIENT_SIGALGS,slistlen,(int *)(slist))\n# define SSL_CTX_set1_client_sigalgs_list(ctx, s) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_CLIENT_SIGALGS_LIST,0,(char *)(s))\n# define SSL_set1_client_sigalgs(s, slist, slistlen) \\\n SSL_ctrl(s,SSL_CTRL_SET_CLIENT_SIGALGS,slistlen,(int *)(slist))\n# define SSL_set1_client_sigalgs_list(s, str) \\\n SSL_ctrl(s,SSL_CTRL_SET_CLIENT_SIGALGS_LIST,0,(char *)(str))\n# define SSL_get0_certificate_types(s, clist) \\\n SSL_ctrl(s, SSL_CTRL_GET_CLIENT_CERT_TYPES, 0, (char *)(clist))\n# define SSL_CTX_set1_client_certificate_types(ctx, clist, clistlen) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_CLIENT_CERT_TYPES,clistlen, \\\n (char *)(clist))\n# define SSL_set1_client_certificate_types(s, clist, clistlen) \\\n SSL_ctrl(s,SSL_CTRL_SET_CLIENT_CERT_TYPES,clistlen,(char *)(clist))\n# define SSL_get_signature_nid(s, pn) \\\n SSL_ctrl(s,SSL_CTRL_GET_SIGNATURE_NID,0,pn)\n# define SSL_get_peer_signature_nid(s, pn) \\\n SSL_ctrl(s,SSL_CTRL_GET_PEER_SIGNATURE_NID,0,pn)\n# define SSL_get_peer_tmp_key(s, pk) \\\n SSL_ctrl(s,SSL_CTRL_GET_PEER_TMP_KEY,0,pk)\n# define SSL_get_tmp_key(s, pk) \\\n SSL_ctrl(s,SSL_CTRL_GET_TMP_KEY,0,pk)\n# define SSL_get0_raw_cipherlist(s, plst) \\\n SSL_ctrl(s,SSL_CTRL_GET_RAW_CIPHERLIST,0,plst)\n# define SSL_get0_ec_point_formats(s, plst) \\\n SSL_ctrl(s,SSL_CTRL_GET_EC_POINT_FORMATS,0,plst)\n# define SSL_CTX_set_min_proto_version(ctx, version) \\\n SSL_CTX_ctrl(ctx, SSL_CTRL_SET_MIN_PROTO_VERSION, version, NULL)\n# define SSL_CTX_set_max_proto_version(ctx, version) \\\n SSL_CTX_ctrl(ctx, SSL_CTRL_SET_MAX_PROTO_VERSION, version, NULL)\n# define SSL_CTX_get_min_proto_version(ctx) \\\n SSL_CTX_ctrl(ctx, SSL_CTRL_GET_MIN_PROTO_VERSION, 0, NULL)\n# define SSL_CTX_get_max_proto_version(ctx) \\\n SSL_CTX_ctrl(ctx, SSL_CTRL_GET_MAX_PROTO_VERSION, 0, NULL)\n# define SSL_set_min_proto_version(s, version) \\\n SSL_ctrl(s, SSL_CTRL_SET_MIN_PROTO_VERSION, version, NULL)\n# define SSL_set_max_proto_version(s, version) \\\n SSL_ctrl(s, SSL_CTRL_SET_MAX_PROTO_VERSION, version, NULL)\n# define SSL_get_min_proto_version(s) \\\n SSL_ctrl(s, SSL_CTRL_GET_MIN_PROTO_VERSION, 0, NULL)\n# define SSL_get_max_proto_version(s) \\\n SSL_ctrl(s, SSL_CTRL_GET_MAX_PROTO_VERSION, 0, NULL)\n\n/* Backwards compatibility, original 1.1.0 names */\n# define SSL_CTRL_GET_SERVER_TMP_KEY \\\n SSL_CTRL_GET_PEER_TMP_KEY\n# define SSL_get_server_tmp_key(s, pk) \\\n SSL_get_peer_tmp_key(s, pk)\n\n/*\n * The following symbol names are old and obsolete. They are kept\n * for compatibility reasons only and should not be used anymore.\n */\n# define SSL_CTRL_GET_CURVES SSL_CTRL_GET_GROUPS\n# define SSL_CTRL_SET_CURVES SSL_CTRL_SET_GROUPS\n# define SSL_CTRL_SET_CURVES_LIST SSL_CTRL_SET_GROUPS_LIST\n# define SSL_CTRL_GET_SHARED_CURVE SSL_CTRL_GET_SHARED_GROUP\n\n# define SSL_get1_curves SSL_get1_groups\n# define SSL_CTX_set1_curves SSL_CTX_set1_groups\n# define SSL_CTX_set1_curves_list SSL_CTX_set1_groups_list\n# define SSL_set1_curves SSL_set1_groups\n# define SSL_set1_curves_list SSL_set1_groups_list\n# define SSL_get_shared_curve SSL_get_shared_group\n\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n/* Provide some compatibility macros for removed functionality. */\n# define SSL_CTX_need_tmp_RSA(ctx) 0\n# define SSL_CTX_set_tmp_rsa(ctx,rsa) 1\n# define SSL_need_tmp_RSA(ssl) 0\n# define SSL_set_tmp_rsa(ssl,rsa) 1\n# define SSL_CTX_set_ecdh_auto(dummy, onoff) ((onoff) != 0)\n# define SSL_set_ecdh_auto(dummy, onoff) ((onoff) != 0)\n/*\n * We \"pretend\" to call the callback to avoid warnings about unused static\n * functions.\n */\n# define SSL_CTX_set_tmp_rsa_callback(ctx, cb) while(0) (cb)(NULL, 0, 0)\n# define SSL_set_tmp_rsa_callback(ssl, cb) while(0) (cb)(NULL, 0, 0)\n# endif\n__owur const BIO_METHOD *BIO_f_ssl(void);\n__owur BIO *BIO_new_ssl(SSL_CTX *ctx, int client);\n__owur BIO *BIO_new_ssl_connect(SSL_CTX *ctx);\n__owur BIO *BIO_new_buffer_ssl_connect(SSL_CTX *ctx);\n__owur int BIO_ssl_copy_session_id(BIO *to, BIO *from);\nvoid BIO_ssl_shutdown(BIO *ssl_bio);\n\n__owur int SSL_CTX_set_cipher_list(SSL_CTX *, const char *str);\n__owur SSL_CTX *SSL_CTX_new(const SSL_METHOD *meth);\nint SSL_CTX_up_ref(SSL_CTX *ctx);\nvoid SSL_CTX_free(SSL_CTX *);\n__owur long SSL_CTX_set_timeout(SSL_CTX *ctx, long t);\n__owur long SSL_CTX_get_timeout(const SSL_CTX *ctx);\n__owur X509_STORE *SSL_CTX_get_cert_store(const SSL_CTX *);\nvoid SSL_CTX_set_cert_store(SSL_CTX *, X509_STORE *);\nvoid SSL_CTX_set1_cert_store(SSL_CTX *, X509_STORE *);\n__owur int SSL_want(const SSL *s);\n__owur int SSL_clear(SSL *s);\n\nvoid SSL_CTX_flush_sessions(SSL_CTX *ctx, long tm);\n\n__owur const SSL_CIPHER *SSL_get_current_cipher(const SSL *s);\n__owur const SSL_CIPHER *SSL_get_pending_cipher(const SSL *s);\n__owur int SSL_CIPHER_get_bits(const SSL_CIPHER *c, int *alg_bits);\n__owur const char *SSL_CIPHER_get_version(const SSL_CIPHER *c);\n__owur const char *SSL_CIPHER_get_name(const SSL_CIPHER *c);\n__owur const char *SSL_CIPHER_standard_name(const SSL_CIPHER *c);\n__owur const char *OPENSSL_cipher_name(const char *rfc_name);\n__owur uint32_t SSL_CIPHER_get_id(const SSL_CIPHER *c);\n__owur uint16_t SSL_CIPHER_get_protocol_id(const SSL_CIPHER *c);\n__owur int SSL_CIPHER_get_kx_nid(const SSL_CIPHER *c);\n__owur int SSL_CIPHER_get_auth_nid(const SSL_CIPHER *c);\n__owur const EVP_MD *SSL_CIPHER_get_handshake_digest(const SSL_CIPHER *c);\n__owur int SSL_CIPHER_is_aead(const SSL_CIPHER *c);\n\n__owur int SSL_get_fd(const SSL *s);\n__owur int SSL_get_rfd(const SSL *s);\n__owur int SSL_get_wfd(const SSL *s);\n__owur const char *SSL_get_cipher_list(const SSL *s, int n);\n__owur char *SSL_get_shared_ciphers(const SSL *s, char *buf, int size);\n__owur int SSL_get_read_ahead(const SSL *s);\n__owur int SSL_pending(const SSL *s);\n__owur int SSL_has_pending(const SSL *s);\n# ifndef OPENSSL_NO_SOCK\n__owur int SSL_set_fd(SSL *s, int fd);\n__owur int SSL_set_rfd(SSL *s, int fd);\n__owur int SSL_set_wfd(SSL *s, int fd);\n# endif\nvoid SSL_set0_rbio(SSL *s, BIO *rbio);\nvoid SSL_set0_wbio(SSL *s, BIO *wbio);\nvoid SSL_set_bio(SSL *s, BIO *rbio, BIO *wbio);\n__owur BIO *SSL_get_rbio(const SSL *s);\n__owur BIO *SSL_get_wbio(const SSL *s);\n__owur int SSL_set_cipher_list(SSL *s, const char *str);\n__owur int SSL_CTX_set_ciphersuites(SSL_CTX *ctx, const char *str);\n__owur int SSL_set_ciphersuites(SSL *s, const char *str);\nvoid SSL_set_read_ahead(SSL *s, int yes);\n__owur int SSL_get_verify_mode(const SSL *s);\n__owur int SSL_get_verify_depth(const SSL *s);\n__owur SSL_verify_cb SSL_get_verify_callback(const SSL *s);\nvoid SSL_set_verify(SSL *s, int mode, SSL_verify_cb callback);\nvoid SSL_set_verify_depth(SSL *s, int depth);\nvoid SSL_set_cert_cb(SSL *s, int (*cb) (SSL *ssl, void *arg), void *arg);\n# ifndef OPENSSL_NO_RSA\n__owur int SSL_use_RSAPrivateKey(SSL *ssl, RSA *rsa);\n__owur int SSL_use_RSAPrivateKey_ASN1(SSL *ssl, const unsigned char *d,\n long len);\n# endif\n__owur int SSL_use_PrivateKey(SSL *ssl, EVP_PKEY *pkey);\n__owur int SSL_use_PrivateKey_ASN1(int pk, SSL *ssl, const unsigned char *d,\n long len);\n__owur int SSL_use_certificate(SSL *ssl, X509 *x);\n__owur int SSL_use_certificate_ASN1(SSL *ssl, const unsigned char *d, int len);\n__owur int SSL_use_cert_and_key(SSL *ssl, X509 *x509, EVP_PKEY *privatekey,\n STACK_OF(X509) *chain, int override);\n\n\n/* serverinfo file format versions */\n# define SSL_SERVERINFOV1 1\n# define SSL_SERVERINFOV2 2\n\n/* Set serverinfo data for the current active cert. */\n__owur int SSL_CTX_use_serverinfo(SSL_CTX *ctx, const unsigned char *serverinfo,\n size_t serverinfo_length);\n__owur int SSL_CTX_use_serverinfo_ex(SSL_CTX *ctx, unsigned int version,\n const unsigned char *serverinfo,\n size_t serverinfo_length);\n__owur int SSL_CTX_use_serverinfo_file(SSL_CTX *ctx, const char *file);\n\n#ifndef OPENSSL_NO_RSA\n__owur int SSL_use_RSAPrivateKey_file(SSL *ssl, const char *file, int type);\n#endif\n\n__owur int SSL_use_PrivateKey_file(SSL *ssl, const char *file, int type);\n__owur int SSL_use_certificate_file(SSL *ssl, const char *file, int type);\n\n#ifndef OPENSSL_NO_RSA\n__owur int SSL_CTX_use_RSAPrivateKey_file(SSL_CTX *ctx, const char *file,\n int type);\n#endif\n__owur int SSL_CTX_use_PrivateKey_file(SSL_CTX *ctx, const char *file,\n int type);\n__owur int SSL_CTX_use_certificate_file(SSL_CTX *ctx, const char *file,\n int type);\n/* PEM type */\n__owur int SSL_CTX_use_certificate_chain_file(SSL_CTX *ctx, const char *file);\n__owur int SSL_use_certificate_chain_file(SSL *ssl, const char *file);\n__owur STACK_OF(X509_NAME) *SSL_load_client_CA_file(const char *file);\n__owur int SSL_add_file_cert_subjects_to_stack(STACK_OF(X509_NAME) *stackCAs,\n const char *file);\nint SSL_add_dir_cert_subjects_to_stack(STACK_OF(X509_NAME) *stackCAs,\n const char *dir);\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define SSL_load_error_strings() \\\n OPENSSL_init_ssl(OPENSSL_INIT_LOAD_SSL_STRINGS \\\n | OPENSSL_INIT_LOAD_CRYPTO_STRINGS, NULL)\n# endif\n\n__owur const char *SSL_state_string(const SSL *s);\n__owur const char *SSL_rstate_string(const SSL *s);\n__owur const char *SSL_state_string_long(const SSL *s);\n__owur const char *SSL_rstate_string_long(const SSL *s);\n__owur long SSL_SESSION_get_time(const SSL_SESSION *s);\n__owur long SSL_SESSION_set_time(SSL_SESSION *s, long t);\n__owur long SSL_SESSION_get_timeout(const SSL_SESSION *s);\n__owur long SSL_SESSION_set_timeout(SSL_SESSION *s, long t);\n__owur int SSL_SESSION_get_protocol_version(const SSL_SESSION *s);\n__owur int SSL_SESSION_set_protocol_version(SSL_SESSION *s, int version);\n\n__owur const char *SSL_SESSION_get0_hostname(const SSL_SESSION *s);\n__owur int SSL_SESSION_set1_hostname(SSL_SESSION *s, const char *hostname);\nvoid SSL_SESSION_get0_alpn_selected(const SSL_SESSION *s,\n const unsigned char **alpn,\n size_t *len);\n__owur int SSL_SESSION_set1_alpn_selected(SSL_SESSION *s,\n const unsigned char *alpn,\n size_t len);\n__owur const SSL_CIPHER *SSL_SESSION_get0_cipher(const SSL_SESSION *s);\n__owur int SSL_SESSION_set_cipher(SSL_SESSION *s, const SSL_CIPHER *cipher);\n__owur int SSL_SESSION_has_ticket(const SSL_SESSION *s);\n__owur unsigned long SSL_SESSION_get_ticket_lifetime_hint(const SSL_SESSION *s);\nvoid SSL_SESSION_get0_ticket(const SSL_SESSION *s, const unsigned char **tick,\n size_t *len);\n__owur uint32_t SSL_SESSION_get_max_early_data(const SSL_SESSION *s);\n__owur int SSL_SESSION_set_max_early_data(SSL_SESSION *s,\n uint32_t max_early_data);\n__owur int SSL_copy_session_id(SSL *to, const SSL *from);\n__owur X509 *SSL_SESSION_get0_peer(SSL_SESSION *s);\n__owur int SSL_SESSION_set1_id_context(SSL_SESSION *s,\n const unsigned char *sid_ctx,\n unsigned int sid_ctx_len);\n__owur int SSL_SESSION_set1_id(SSL_SESSION *s, const unsigned char *sid,\n unsigned int sid_len);\n__owur int SSL_SESSION_is_resumable(const SSL_SESSION *s);\n\n__owur SSL_SESSION *SSL_SESSION_new(void);\n__owur SSL_SESSION *SSL_SESSION_dup(SSL_SESSION *src);\nconst unsigned char *SSL_SESSION_get_id(const SSL_SESSION *s,\n unsigned int *len);\nconst unsigned char *SSL_SESSION_get0_id_context(const SSL_SESSION *s,\n unsigned int *len);\n__owur unsigned int SSL_SESSION_get_compress_id(const SSL_SESSION *s);\n# ifndef OPENSSL_NO_STDIO\nint SSL_SESSION_print_fp(FILE *fp, const SSL_SESSION *ses);\n# endif\nint SSL_SESSION_print(BIO *fp, const SSL_SESSION *ses);\nint SSL_SESSION_print_keylog(BIO *bp, const SSL_SESSION *x);\nint SSL_SESSION_up_ref(SSL_SESSION *ses);\nvoid SSL_SESSION_free(SSL_SESSION *ses);\n__owur int i2d_SSL_SESSION(SSL_SESSION *in, unsigned char **pp);\n__owur int SSL_set_session(SSL *to, SSL_SESSION *session);\nint SSL_CTX_add_session(SSL_CTX *ctx, SSL_SESSION *session);\nint SSL_CTX_remove_session(SSL_CTX *ctx, SSL_SESSION *session);\n__owur int SSL_CTX_set_generate_session_id(SSL_CTX *ctx, GEN_SESSION_CB cb);\n__owur int SSL_set_generate_session_id(SSL *s, GEN_SESSION_CB cb);\n__owur int SSL_has_matching_session_id(const SSL *s,\n const unsigned char *id,\n unsigned int id_len);\nSSL_SESSION *d2i_SSL_SESSION(SSL_SESSION **a, const unsigned char **pp,\n long length);\n\n# ifdef HEADER_X509_H\n__owur X509 *SSL_get_peer_certificate(const SSL *s);\n# endif\n\n__owur STACK_OF(X509) *SSL_get_peer_cert_chain(const SSL *s);\n\n__owur int SSL_CTX_get_verify_mode(const SSL_CTX *ctx);\n__owur int SSL_CTX_get_verify_depth(const SSL_CTX *ctx);\n__owur SSL_verify_cb SSL_CTX_get_verify_callback(const SSL_CTX *ctx);\nvoid SSL_CTX_set_verify(SSL_CTX *ctx, int mode, SSL_verify_cb callback);\nvoid SSL_CTX_set_verify_depth(SSL_CTX *ctx, int depth);\nvoid SSL_CTX_set_cert_verify_callback(SSL_CTX *ctx,\n int (*cb) (X509_STORE_CTX *, void *),\n void *arg);\nvoid SSL_CTX_set_cert_cb(SSL_CTX *c, int (*cb) (SSL *ssl, void *arg),\n void *arg);\n# ifndef OPENSSL_NO_RSA\n__owur int SSL_CTX_use_RSAPrivateKey(SSL_CTX *ctx, RSA *rsa);\n__owur int SSL_CTX_use_RSAPrivateKey_ASN1(SSL_CTX *ctx, const unsigned char *d,\n long len);\n# endif\n__owur int SSL_CTX_use_PrivateKey(SSL_CTX *ctx, EVP_PKEY *pkey);\n__owur int SSL_CTX_use_PrivateKey_ASN1(int pk, SSL_CTX *ctx,\n const unsigned char *d, long len);\n__owur int SSL_CTX_use_certificate(SSL_CTX *ctx, X509 *x);\n__owur int SSL_CTX_use_certificate_ASN1(SSL_CTX *ctx, int len,\n const unsigned char *d);\n__owur int SSL_CTX_use_cert_and_key(SSL_CTX *ctx, X509 *x509, EVP_PKEY *privatekey,\n STACK_OF(X509) *chain, int override);\n\nvoid SSL_CTX_set_default_passwd_cb(SSL_CTX *ctx, pem_password_cb *cb);\nvoid SSL_CTX_set_default_passwd_cb_userdata(SSL_CTX *ctx, void *u);\npem_password_cb *SSL_CTX_get_default_passwd_cb(SSL_CTX *ctx);\nvoid *SSL_CTX_get_default_passwd_cb_userdata(SSL_CTX *ctx);\nvoid SSL_set_default_passwd_cb(SSL *s, pem_password_cb *cb);\nvoid SSL_set_default_passwd_cb_userdata(SSL *s, void *u);\npem_password_cb *SSL_get_default_passwd_cb(SSL *s);\nvoid *SSL_get_default_passwd_cb_userdata(SSL *s);\n\n__owur int SSL_CTX_check_private_key(const SSL_CTX *ctx);\n__owur int SSL_check_private_key(const SSL *ctx);\n\n__owur int SSL_CTX_set_session_id_context(SSL_CTX *ctx,\n const unsigned char *sid_ctx,\n unsigned int sid_ctx_len);\n\nSSL *SSL_new(SSL_CTX *ctx);\nint SSL_up_ref(SSL *s);\nint SSL_is_dtls(const SSL *s);\n__owur int SSL_set_session_id_context(SSL *ssl, const unsigned char *sid_ctx,\n unsigned int sid_ctx_len);\n\n__owur int SSL_CTX_set_purpose(SSL_CTX *ctx, int purpose);\n__owur int SSL_set_purpose(SSL *ssl, int purpose);\n__owur int SSL_CTX_set_trust(SSL_CTX *ctx, int trust);\n__owur int SSL_set_trust(SSL *ssl, int trust);\n\n__owur int SSL_set1_host(SSL *s, const char *hostname);\n__owur int SSL_add1_host(SSL *s, const char *hostname);\n__owur const char *SSL_get0_peername(SSL *s);\nvoid SSL_set_hostflags(SSL *s, unsigned int flags);\n\n__owur int SSL_CTX_dane_enable(SSL_CTX *ctx);\n__owur int SSL_CTX_dane_mtype_set(SSL_CTX *ctx, const EVP_MD *md,\n uint8_t mtype, uint8_t ord);\n__owur int SSL_dane_enable(SSL *s, const char *basedomain);\n__owur int SSL_dane_tlsa_add(SSL *s, uint8_t usage, uint8_t selector,\n uint8_t mtype, unsigned const char *data, size_t dlen);\n__owur int SSL_get0_dane_authority(SSL *s, X509 **mcert, EVP_PKEY **mspki);\n__owur int SSL_get0_dane_tlsa(SSL *s, uint8_t *usage, uint8_t *selector,\n uint8_t *mtype, unsigned const char **data,\n size_t *dlen);\n/*\n * Bridge opacity barrier between libcrypt and libssl, also needed to support\n * offline testing in test/danetest.c\n */\nSSL_DANE *SSL_get0_dane(SSL *ssl);\n/*\n * DANE flags\n */\nunsigned long SSL_CTX_dane_set_flags(SSL_CTX *ctx, unsigned long flags);\nunsigned long SSL_CTX_dane_clear_flags(SSL_CTX *ctx, unsigned long flags);\nunsigned long SSL_dane_set_flags(SSL *ssl, unsigned long flags);\nunsigned long SSL_dane_clear_flags(SSL *ssl, unsigned long flags);\n\n__owur int SSL_CTX_set1_param(SSL_CTX *ctx, X509_VERIFY_PARAM *vpm);\n__owur int SSL_set1_param(SSL *ssl, X509_VERIFY_PARAM *vpm);\n\n__owur X509_VERIFY_PARAM *SSL_CTX_get0_param(SSL_CTX *ctx);\n__owur X509_VERIFY_PARAM *SSL_get0_param(SSL *ssl);\n\n# ifndef OPENSSL_NO_SRP\nint SSL_CTX_set_srp_username(SSL_CTX *ctx, char *name);\nint SSL_CTX_set_srp_password(SSL_CTX *ctx, char *password);\nint SSL_CTX_set_srp_strength(SSL_CTX *ctx, int strength);\nint SSL_CTX_set_srp_client_pwd_callback(SSL_CTX *ctx,\n char *(*cb) (SSL *, void *));\nint SSL_CTX_set_srp_verify_param_callback(SSL_CTX *ctx,\n int (*cb) (SSL *, void *));\nint SSL_CTX_set_srp_username_callback(SSL_CTX *ctx,\n int (*cb) (SSL *, int *, void *));\nint SSL_CTX_set_srp_cb_arg(SSL_CTX *ctx, void *arg);\n\nint SSL_set_srp_server_param(SSL *s, const BIGNUM *N, const BIGNUM *g,\n BIGNUM *sa, BIGNUM *v, char *info);\nint SSL_set_srp_server_param_pw(SSL *s, const char *user, const char *pass,\n const char *grp);\n\n__owur BIGNUM *SSL_get_srp_g(SSL *s);\n__owur BIGNUM *SSL_get_srp_N(SSL *s);\n\n__owur char *SSL_get_srp_username(SSL *s);\n__owur char *SSL_get_srp_userinfo(SSL *s);\n# endif\n\n/*\n * ClientHello callback and helpers.\n */\n\n# define SSL_CLIENT_HELLO_SUCCESS 1\n# define SSL_CLIENT_HELLO_ERROR 0\n# define SSL_CLIENT_HELLO_RETRY (-1)\n\ntypedef int (*SSL_client_hello_cb_fn) (SSL *s, int *al, void *arg);\nvoid SSL_CTX_set_client_hello_cb(SSL_CTX *c, SSL_client_hello_cb_fn cb,\n void *arg);\nint SSL_client_hello_isv2(SSL *s);\nunsigned int SSL_client_hello_get0_legacy_version(SSL *s);\nsize_t SSL_client_hello_get0_random(SSL *s, const unsigned char **out);\nsize_t SSL_client_hello_get0_session_id(SSL *s, const unsigned char **out);\nsize_t SSL_client_hello_get0_ciphers(SSL *s, const unsigned char **out);\nsize_t SSL_client_hello_get0_compression_methods(SSL *s,\n const unsigned char **out);\nint SSL_client_hello_get1_extensions_present(SSL *s, int **out, size_t *outlen);\nint SSL_client_hello_get0_ext(SSL *s, unsigned int type,\n const unsigned char **out, size_t *outlen);\n\nvoid SSL_certs_clear(SSL *s);\nvoid SSL_free(SSL *ssl);\n# ifdef OSSL_ASYNC_FD\n/*\n * Windows application developer has to include windows.h to use these.\n */\n__owur int SSL_waiting_for_async(SSL *s);\n__owur int SSL_get_all_async_fds(SSL *s, OSSL_ASYNC_FD *fds, size_t *numfds);\n__owur int SSL_get_changed_async_fds(SSL *s, OSSL_ASYNC_FD *addfd,\n size_t *numaddfds, OSSL_ASYNC_FD *delfd,\n size_t *numdelfds);\n# endif\n__owur int SSL_accept(SSL *ssl);\n__owur int SSL_stateless(SSL *s);\n__owur int SSL_connect(SSL *ssl);\n__owur int SSL_read(SSL *ssl, void *buf, int num);\n__owur int SSL_read_ex(SSL *ssl, void *buf, size_t num, size_t *readbytes);\n\n# define SSL_READ_EARLY_DATA_ERROR 0\n# define SSL_READ_EARLY_DATA_SUCCESS 1\n# define SSL_READ_EARLY_DATA_FINISH 2\n\n__owur int SSL_read_early_data(SSL *s, void *buf, size_t num,\n size_t *readbytes);\n__owur int SSL_peek(SSL *ssl, void *buf, int num);\n__owur int SSL_peek_ex(SSL *ssl, void *buf, size_t num, size_t *readbytes);\n__owur int SSL_write(SSL *ssl, const void *buf, int num);\n__owur int SSL_write_ex(SSL *s, const void *buf, size_t num, size_t *written);\n__owur int SSL_write_early_data(SSL *s, const void *buf, size_t num,\n size_t *written);\nlong SSL_ctrl(SSL *ssl, int cmd, long larg, void *parg);\nlong SSL_callback_ctrl(SSL *, int, void (*)(void));\nlong SSL_CTX_ctrl(SSL_CTX *ctx, int cmd, long larg, void *parg);\nlong SSL_CTX_callback_ctrl(SSL_CTX *, int, void (*)(void));\n\n# define SSL_EARLY_DATA_NOT_SENT 0\n# define SSL_EARLY_DATA_REJECTED 1\n# define SSL_EARLY_DATA_ACCEPTED 2\n\n__owur int SSL_get_early_data_status(const SSL *s);\n\n__owur int SSL_get_error(const SSL *s, int ret_code);\n__owur const char *SSL_get_version(const SSL *s);\n\n/* This sets the 'default' SSL version that SSL_new() will create */\n__owur int SSL_CTX_set_ssl_version(SSL_CTX *ctx, const SSL_METHOD *meth);\n\n# ifndef OPENSSL_NO_SSL3_METHOD\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *SSLv3_method(void)) /* SSLv3 */\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *SSLv3_server_method(void))\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *SSLv3_client_method(void))\n# endif\n\n#define SSLv23_method TLS_method\n#define SSLv23_server_method TLS_server_method\n#define SSLv23_client_method TLS_client_method\n\n/* Negotiate highest available SSL/TLS version */\n__owur const SSL_METHOD *TLS_method(void);\n__owur const SSL_METHOD *TLS_server_method(void);\n__owur const SSL_METHOD *TLS_client_method(void);\n\n# ifndef OPENSSL_NO_TLS1_METHOD\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *TLSv1_method(void)) /* TLSv1.0 */\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *TLSv1_server_method(void))\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *TLSv1_client_method(void))\n# endif\n\n# ifndef OPENSSL_NO_TLS1_1_METHOD\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *TLSv1_1_method(void)) /* TLSv1.1 */\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *TLSv1_1_server_method(void))\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *TLSv1_1_client_method(void))\n# endif\n\n# ifndef OPENSSL_NO_TLS1_2_METHOD\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *TLSv1_2_method(void)) /* TLSv1.2 */\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *TLSv1_2_server_method(void))\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *TLSv1_2_client_method(void))\n# endif\n\n# ifndef OPENSSL_NO_DTLS1_METHOD\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *DTLSv1_method(void)) /* DTLSv1.0 */\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *DTLSv1_server_method(void))\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *DTLSv1_client_method(void))\n# endif\n\n# ifndef OPENSSL_NO_DTLS1_2_METHOD\n/* DTLSv1.2 */\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *DTLSv1_2_method(void))\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *DTLSv1_2_server_method(void))\nDEPRECATEDIN_1_1_0(__owur const SSL_METHOD *DTLSv1_2_client_method(void))\n# endif\n\n__owur const SSL_METHOD *DTLS_method(void); /* DTLS 1.0 and 1.2 */\n__owur const SSL_METHOD *DTLS_server_method(void); /* DTLS 1.0 and 1.2 */\n__owur const SSL_METHOD *DTLS_client_method(void); /* DTLS 1.0 and 1.2 */\n\n__owur size_t DTLS_get_data_mtu(const SSL *s);\n\n__owur STACK_OF(SSL_CIPHER) *SSL_get_ciphers(const SSL *s);\n__owur STACK_OF(SSL_CIPHER) *SSL_CTX_get_ciphers(const SSL_CTX *ctx);\n__owur STACK_OF(SSL_CIPHER) *SSL_get_client_ciphers(const SSL *s);\n__owur STACK_OF(SSL_CIPHER) *SSL_get1_supported_ciphers(SSL *s);\n\n__owur int SSL_do_handshake(SSL *s);\nint SSL_key_update(SSL *s, int updatetype);\nint SSL_get_key_update_type(const SSL *s);\nint SSL_renegotiate(SSL *s);\nint SSL_renegotiate_abbreviated(SSL *s);\n__owur int SSL_renegotiate_pending(const SSL *s);\nint SSL_shutdown(SSL *s);\n__owur int SSL_verify_client_post_handshake(SSL *s);\nvoid SSL_CTX_set_post_handshake_auth(SSL_CTX *ctx, int val);\nvoid SSL_set_post_handshake_auth(SSL *s, int val);\n\n__owur const SSL_METHOD *SSL_CTX_get_ssl_method(const SSL_CTX *ctx);\n__owur const SSL_METHOD *SSL_get_ssl_method(const SSL *s);\n__owur int SSL_set_ssl_method(SSL *s, const SSL_METHOD *method);\n__owur const char *SSL_alert_type_string_long(int value);\n__owur const char *SSL_alert_type_string(int value);\n__owur const char *SSL_alert_desc_string_long(int value);\n__owur const char *SSL_alert_desc_string(int value);\n\nvoid SSL_set0_CA_list(SSL *s, STACK_OF(X509_NAME) *name_list);\nvoid SSL_CTX_set0_CA_list(SSL_CTX *ctx, STACK_OF(X509_NAME) *name_list);\n__owur const STACK_OF(X509_NAME) *SSL_get0_CA_list(const SSL *s);\n__owur const STACK_OF(X509_NAME) *SSL_CTX_get0_CA_list(const SSL_CTX *ctx);\n__owur int SSL_add1_to_CA_list(SSL *ssl, const X509 *x);\n__owur int SSL_CTX_add1_to_CA_list(SSL_CTX *ctx, const X509 *x);\n__owur const STACK_OF(X509_NAME) *SSL_get0_peer_CA_list(const SSL *s);\n\nvoid SSL_set_client_CA_list(SSL *s, STACK_OF(X509_NAME) *name_list);\nvoid SSL_CTX_set_client_CA_list(SSL_CTX *ctx, STACK_OF(X509_NAME) *name_list);\n__owur STACK_OF(X509_NAME) *SSL_get_client_CA_list(const SSL *s);\n__owur STACK_OF(X509_NAME) *SSL_CTX_get_client_CA_list(const SSL_CTX *s);\n__owur int SSL_add_client_CA(SSL *ssl, X509 *x);\n__owur int SSL_CTX_add_client_CA(SSL_CTX *ctx, X509 *x);\n\nvoid SSL_set_connect_state(SSL *s);\nvoid SSL_set_accept_state(SSL *s);\n\n__owur long SSL_get_default_timeout(const SSL *s);\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define SSL_library_init() OPENSSL_init_ssl(0, NULL)\n# endif\n\n__owur char *SSL_CIPHER_description(const SSL_CIPHER *, char *buf, int size);\n__owur STACK_OF(X509_NAME) *SSL_dup_CA_list(const STACK_OF(X509_NAME) *sk);\n\n__owur SSL *SSL_dup(SSL *ssl);\n\n__owur X509 *SSL_get_certificate(const SSL *ssl);\n/*\n * EVP_PKEY\n */\nstruct evp_pkey_st *SSL_get_privatekey(const SSL *ssl);\n\n__owur X509 *SSL_CTX_get0_certificate(const SSL_CTX *ctx);\n__owur EVP_PKEY *SSL_CTX_get0_privatekey(const SSL_CTX *ctx);\n\nvoid SSL_CTX_set_quiet_shutdown(SSL_CTX *ctx, int mode);\n__owur int SSL_CTX_get_quiet_shutdown(const SSL_CTX *ctx);\nvoid SSL_set_quiet_shutdown(SSL *ssl, int mode);\n__owur int SSL_get_quiet_shutdown(const SSL *ssl);\nvoid SSL_set_shutdown(SSL *ssl, int mode);\n__owur int SSL_get_shutdown(const SSL *ssl);\n__owur int SSL_version(const SSL *ssl);\n__owur int SSL_client_version(const SSL *s);\n__owur int SSL_CTX_set_default_verify_paths(SSL_CTX *ctx);\n__owur int SSL_CTX_set_default_verify_dir(SSL_CTX *ctx);\n__owur int SSL_CTX_set_default_verify_file(SSL_CTX *ctx);\n__owur int SSL_CTX_load_verify_locations(SSL_CTX *ctx, const char *CAfile,\n const char *CApath);\n# define SSL_get0_session SSL_get_session/* just peek at pointer */\n__owur SSL_SESSION *SSL_get_session(const SSL *ssl);\n__owur SSL_SESSION *SSL_get1_session(SSL *ssl); /* obtain a reference count */\n__owur SSL_CTX *SSL_get_SSL_CTX(const SSL *ssl);\nSSL_CTX *SSL_set_SSL_CTX(SSL *ssl, SSL_CTX *ctx);\nvoid SSL_set_info_callback(SSL *ssl,\n void (*cb) (const SSL *ssl, int type, int val));\nvoid (*SSL_get_info_callback(const SSL *ssl)) (const SSL *ssl, int type,\n int val);\n__owur OSSL_HANDSHAKE_STATE SSL_get_state(const SSL *ssl);\n\nvoid SSL_set_verify_result(SSL *ssl, long v);\n__owur long SSL_get_verify_result(const SSL *ssl);\n__owur STACK_OF(X509) *SSL_get0_verified_chain(const SSL *s);\n\n__owur size_t SSL_get_client_random(const SSL *ssl, unsigned char *out,\n size_t outlen);\n__owur size_t SSL_get_server_random(const SSL *ssl, unsigned char *out,\n size_t outlen);\n__owur size_t SSL_SESSION_get_master_key(const SSL_SESSION *sess,\n unsigned char *out, size_t outlen);\n__owur int SSL_SESSION_set1_master_key(SSL_SESSION *sess,\n const unsigned char *in, size_t len);\nuint8_t SSL_SESSION_get_max_fragment_length(const SSL_SESSION *sess);\n\n#define SSL_get_ex_new_index(l, p, newf, dupf, freef) \\\n CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_SSL, l, p, newf, dupf, freef)\n__owur int SSL_set_ex_data(SSL *ssl, int idx, void *data);\nvoid *SSL_get_ex_data(const SSL *ssl, int idx);\n#define SSL_SESSION_get_ex_new_index(l, p, newf, dupf, freef) \\\n CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_SSL_SESSION, l, p, newf, dupf, freef)\n__owur int SSL_SESSION_set_ex_data(SSL_SESSION *ss, int idx, void *data);\nvoid *SSL_SESSION_get_ex_data(const SSL_SESSION *ss, int idx);\n#define SSL_CTX_get_ex_new_index(l, p, newf, dupf, freef) \\\n CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_SSL_CTX, l, p, newf, dupf, freef)\n__owur int SSL_CTX_set_ex_data(SSL_CTX *ssl, int idx, void *data);\nvoid *SSL_CTX_get_ex_data(const SSL_CTX *ssl, int idx);\n\n__owur int SSL_get_ex_data_X509_STORE_CTX_idx(void);\n\n# define SSL_CTX_sess_set_cache_size(ctx,t) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_SESS_CACHE_SIZE,t,NULL)\n# define SSL_CTX_sess_get_cache_size(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_GET_SESS_CACHE_SIZE,0,NULL)\n# define SSL_CTX_set_session_cache_mode(ctx,m) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_SESS_CACHE_MODE,m,NULL)\n# define SSL_CTX_get_session_cache_mode(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_GET_SESS_CACHE_MODE,0,NULL)\n\n# define SSL_CTX_get_default_read_ahead(ctx) SSL_CTX_get_read_ahead(ctx)\n# define SSL_CTX_set_default_read_ahead(ctx,m) SSL_CTX_set_read_ahead(ctx,m)\n# define SSL_CTX_get_read_ahead(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_GET_READ_AHEAD,0,NULL)\n# define SSL_CTX_set_read_ahead(ctx,m) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_READ_AHEAD,m,NULL)\n# define SSL_CTX_get_max_cert_list(ctx) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_GET_MAX_CERT_LIST,0,NULL)\n# define SSL_CTX_set_max_cert_list(ctx,m) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_MAX_CERT_LIST,m,NULL)\n# define SSL_get_max_cert_list(ssl) \\\n SSL_ctrl(ssl,SSL_CTRL_GET_MAX_CERT_LIST,0,NULL)\n# define SSL_set_max_cert_list(ssl,m) \\\n SSL_ctrl(ssl,SSL_CTRL_SET_MAX_CERT_LIST,m,NULL)\n\n# define SSL_CTX_set_max_send_fragment(ctx,m) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_MAX_SEND_FRAGMENT,m,NULL)\n# define SSL_set_max_send_fragment(ssl,m) \\\n SSL_ctrl(ssl,SSL_CTRL_SET_MAX_SEND_FRAGMENT,m,NULL)\n# define SSL_CTX_set_split_send_fragment(ctx,m) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_SPLIT_SEND_FRAGMENT,m,NULL)\n# define SSL_set_split_send_fragment(ssl,m) \\\n SSL_ctrl(ssl,SSL_CTRL_SET_SPLIT_SEND_FRAGMENT,m,NULL)\n# define SSL_CTX_set_max_pipelines(ctx,m) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_MAX_PIPELINES,m,NULL)\n# define SSL_set_max_pipelines(ssl,m) \\\n SSL_ctrl(ssl,SSL_CTRL_SET_MAX_PIPELINES,m,NULL)\n\nvoid SSL_CTX_set_default_read_buffer_len(SSL_CTX *ctx, size_t len);\nvoid SSL_set_default_read_buffer_len(SSL *s, size_t len);\n\n# ifndef OPENSSL_NO_DH\n/* NB: the |keylength| is only applicable when is_export is true */\nvoid SSL_CTX_set_tmp_dh_callback(SSL_CTX *ctx,\n DH *(*dh) (SSL *ssl, int is_export,\n int keylength));\nvoid SSL_set_tmp_dh_callback(SSL *ssl,\n DH *(*dh) (SSL *ssl, int is_export,\n int keylength));\n# endif\n\n__owur const COMP_METHOD *SSL_get_current_compression(const SSL *s);\n__owur const COMP_METHOD *SSL_get_current_expansion(const SSL *s);\n__owur const char *SSL_COMP_get_name(const COMP_METHOD *comp);\n__owur const char *SSL_COMP_get0_name(const SSL_COMP *comp);\n__owur int SSL_COMP_get_id(const SSL_COMP *comp);\nSTACK_OF(SSL_COMP) *SSL_COMP_get_compression_methods(void);\n__owur STACK_OF(SSL_COMP) *SSL_COMP_set0_compression_methods(STACK_OF(SSL_COMP)\n *meths);\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define SSL_COMP_free_compression_methods() while(0) continue\n# endif\n__owur int SSL_COMP_add_compression_method(int id, COMP_METHOD *cm);\n\nconst SSL_CIPHER *SSL_CIPHER_find(SSL *ssl, const unsigned char *ptr);\nint SSL_CIPHER_get_cipher_nid(const SSL_CIPHER *c);\nint SSL_CIPHER_get_digest_nid(const SSL_CIPHER *c);\nint SSL_bytes_to_cipher_list(SSL *s, const unsigned char *bytes, size_t len,\n int isv2format, STACK_OF(SSL_CIPHER) **sk,\n STACK_OF(SSL_CIPHER) **scsvs);\n\n/* TLS extensions functions */\n__owur int SSL_set_session_ticket_ext(SSL *s, void *ext_data, int ext_len);\n\n__owur int SSL_set_session_ticket_ext_cb(SSL *s,\n tls_session_ticket_ext_cb_fn cb,\n void *arg);\n\n/* Pre-shared secret session resumption functions */\n__owur int SSL_set_session_secret_cb(SSL *s,\n tls_session_secret_cb_fn session_secret_cb,\n void *arg);\n\nvoid SSL_CTX_set_not_resumable_session_callback(SSL_CTX *ctx,\n int (*cb) (SSL *ssl,\n int\n is_forward_secure));\n\nvoid SSL_set_not_resumable_session_callback(SSL *ssl,\n int (*cb) (SSL *ssl,\n int is_forward_secure));\n\nvoid SSL_CTX_set_record_padding_callback(SSL_CTX *ctx,\n size_t (*cb) (SSL *ssl, int type,\n size_t len, void *arg));\nvoid SSL_CTX_set_record_padding_callback_arg(SSL_CTX *ctx, void *arg);\nvoid *SSL_CTX_get_record_padding_callback_arg(const SSL_CTX *ctx);\nint SSL_CTX_set_block_padding(SSL_CTX *ctx, size_t block_size);\n\nvoid SSL_set_record_padding_callback(SSL *ssl,\n size_t (*cb) (SSL *ssl, int type,\n size_t len, void *arg));\nvoid SSL_set_record_padding_callback_arg(SSL *ssl, void *arg);\nvoid *SSL_get_record_padding_callback_arg(const SSL *ssl);\nint SSL_set_block_padding(SSL *ssl, size_t block_size);\n\nint SSL_set_num_tickets(SSL *s, size_t num_tickets);\nsize_t SSL_get_num_tickets(const SSL *s);\nint SSL_CTX_set_num_tickets(SSL_CTX *ctx, size_t num_tickets);\nsize_t SSL_CTX_get_num_tickets(const SSL_CTX *ctx);\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define SSL_cache_hit(s) SSL_session_reused(s)\n# endif\n\n__owur int SSL_session_reused(const SSL *s);\n__owur int SSL_is_server(const SSL *s);\n\n__owur __owur SSL_CONF_CTX *SSL_CONF_CTX_new(void);\nint SSL_CONF_CTX_finish(SSL_CONF_CTX *cctx);\nvoid SSL_CONF_CTX_free(SSL_CONF_CTX *cctx);\nunsigned int SSL_CONF_CTX_set_flags(SSL_CONF_CTX *cctx, unsigned int flags);\n__owur unsigned int SSL_CONF_CTX_clear_flags(SSL_CONF_CTX *cctx,\n unsigned int flags);\n__owur int SSL_CONF_CTX_set1_prefix(SSL_CONF_CTX *cctx, const char *pre);\n\nvoid SSL_CONF_CTX_set_ssl(SSL_CONF_CTX *cctx, SSL *ssl);\nvoid SSL_CONF_CTX_set_ssl_ctx(SSL_CONF_CTX *cctx, SSL_CTX *ctx);\n\n__owur int SSL_CONF_cmd(SSL_CONF_CTX *cctx, const char *cmd, const char *value);\n__owur int SSL_CONF_cmd_argv(SSL_CONF_CTX *cctx, int *pargc, char ***pargv);\n__owur int SSL_CONF_cmd_value_type(SSL_CONF_CTX *cctx, const char *cmd);\n\nvoid SSL_add_ssl_module(void);\nint SSL_config(SSL *s, const char *name);\nint SSL_CTX_config(SSL_CTX *ctx, const char *name);\n\n# ifndef OPENSSL_NO_SSL_TRACE\nvoid SSL_trace(int write_p, int version, int content_type,\n const void *buf, size_t len, SSL *ssl, void *arg);\n# endif\n\n# ifndef OPENSSL_NO_SOCK\nint DTLSv1_listen(SSL *s, BIO_ADDR *client);\n# endif\n\n# ifndef OPENSSL_NO_CT\n\n/*\n * A callback for verifying that the received SCTs are sufficient.\n * Expected to return 1 if they are sufficient, otherwise 0.\n * May return a negative integer if an error occurs.\n * A connection should be aborted if the SCTs are deemed insufficient.\n */\ntypedef int (*ssl_ct_validation_cb)(const CT_POLICY_EVAL_CTX *ctx,\n const STACK_OF(SCT) *scts, void *arg);\n\n/*\n * Sets a |callback| that is invoked upon receipt of ServerHelloDone to validate\n * the received SCTs.\n * If the callback returns a non-positive result, the connection is terminated.\n * Call this function before beginning a handshake.\n * If a NULL |callback| is provided, SCT validation is disabled.\n * |arg| is arbitrary userdata that will be passed to the callback whenever it\n * is invoked. Ownership of |arg| remains with the caller.\n *\n * NOTE: A side-effect of setting a CT callback is that an OCSP stapled response\n * will be requested.\n */\nint SSL_set_ct_validation_callback(SSL *s, ssl_ct_validation_cb callback,\n void *arg);\nint SSL_CTX_set_ct_validation_callback(SSL_CTX *ctx,\n ssl_ct_validation_cb callback,\n void *arg);\n#define SSL_disable_ct(s) \\\n ((void) SSL_set_validation_callback((s), NULL, NULL))\n#define SSL_CTX_disable_ct(ctx) \\\n ((void) SSL_CTX_set_validation_callback((ctx), NULL, NULL))\n\n/*\n * The validation type enumerates the available behaviours of the built-in SSL\n * CT validation callback selected via SSL_enable_ct() and SSL_CTX_enable_ct().\n * The underlying callback is a static function in libssl.\n */\nenum {\n SSL_CT_VALIDATION_PERMISSIVE = 0,\n SSL_CT_VALIDATION_STRICT\n};\n\n/*\n * Enable CT by setting up a callback that implements one of the built-in\n * validation variants. The SSL_CT_VALIDATION_PERMISSIVE variant always\n * continues the handshake, the application can make appropriate decisions at\n * handshake completion. The SSL_CT_VALIDATION_STRICT variant requires at\n * least one valid SCT, or else handshake termination will be requested. The\n * handshake may continue anyway if SSL_VERIFY_NONE is in effect.\n */\nint SSL_enable_ct(SSL *s, int validation_mode);\nint SSL_CTX_enable_ct(SSL_CTX *ctx, int validation_mode);\n\n/*\n * Report whether a non-NULL callback is enabled.\n */\nint SSL_ct_is_enabled(const SSL *s);\nint SSL_CTX_ct_is_enabled(const SSL_CTX *ctx);\n\n/* Gets the SCTs received from a connection */\nconst STACK_OF(SCT) *SSL_get0_peer_scts(SSL *s);\n\n/*\n * Loads the CT log list from the default location.\n * If a CTLOG_STORE has previously been set using SSL_CTX_set_ctlog_store,\n * the log information loaded from this file will be appended to the\n * CTLOG_STORE.\n * Returns 1 on success, 0 otherwise.\n */\nint SSL_CTX_set_default_ctlog_list_file(SSL_CTX *ctx);\n\n/*\n * Loads the CT log list from the specified file path.\n * If a CTLOG_STORE has previously been set using SSL_CTX_set_ctlog_store,\n * the log information loaded from this file will be appended to the\n * CTLOG_STORE.\n * Returns 1 on success, 0 otherwise.\n */\nint SSL_CTX_set_ctlog_list_file(SSL_CTX *ctx, const char *path);\n\n/*\n * Sets the CT log list used by all SSL connections created from this SSL_CTX.\n * Ownership of the CTLOG_STORE is transferred to the SSL_CTX.\n */\nvoid SSL_CTX_set0_ctlog_store(SSL_CTX *ctx, CTLOG_STORE *logs);\n\n/*\n * Gets the CT log list used by all SSL connections created from this SSL_CTX.\n * This will be NULL unless one of the following functions has been called:\n * - SSL_CTX_set_default_ctlog_list_file\n * - SSL_CTX_set_ctlog_list_file\n * - SSL_CTX_set_ctlog_store\n */\nconst CTLOG_STORE *SSL_CTX_get0_ctlog_store(const SSL_CTX *ctx);\n\n# endif /* OPENSSL_NO_CT */\n\n/* What the \"other\" parameter contains in security callback */\n/* Mask for type */\n# define SSL_SECOP_OTHER_TYPE 0xffff0000\n# define SSL_SECOP_OTHER_NONE 0\n# define SSL_SECOP_OTHER_CIPHER (1 << 16)\n# define SSL_SECOP_OTHER_CURVE (2 << 16)\n# define SSL_SECOP_OTHER_DH (3 << 16)\n# define SSL_SECOP_OTHER_PKEY (4 << 16)\n# define SSL_SECOP_OTHER_SIGALG (5 << 16)\n# define SSL_SECOP_OTHER_CERT (6 << 16)\n\n/* Indicated operation refers to peer key or certificate */\n# define SSL_SECOP_PEER 0x1000\n\n/* Values for \"op\" parameter in security callback */\n\n/* Called to filter ciphers */\n/* Ciphers client supports */\n# define SSL_SECOP_CIPHER_SUPPORTED (1 | SSL_SECOP_OTHER_CIPHER)\n/* Cipher shared by client/server */\n# define SSL_SECOP_CIPHER_SHARED (2 | SSL_SECOP_OTHER_CIPHER)\n/* Sanity check of cipher server selects */\n# define SSL_SECOP_CIPHER_CHECK (3 | SSL_SECOP_OTHER_CIPHER)\n/* Curves supported by client */\n# define SSL_SECOP_CURVE_SUPPORTED (4 | SSL_SECOP_OTHER_CURVE)\n/* Curves shared by client/server */\n# define SSL_SECOP_CURVE_SHARED (5 | SSL_SECOP_OTHER_CURVE)\n/* Sanity check of curve server selects */\n# define SSL_SECOP_CURVE_CHECK (6 | SSL_SECOP_OTHER_CURVE)\n/* Temporary DH key */\n# define SSL_SECOP_TMP_DH (7 | SSL_SECOP_OTHER_PKEY)\n/* SSL/TLS version */\n# define SSL_SECOP_VERSION (9 | SSL_SECOP_OTHER_NONE)\n/* Session tickets */\n# define SSL_SECOP_TICKET (10 | SSL_SECOP_OTHER_NONE)\n/* Supported signature algorithms sent to peer */\n# define SSL_SECOP_SIGALG_SUPPORTED (11 | SSL_SECOP_OTHER_SIGALG)\n/* Shared signature algorithm */\n# define SSL_SECOP_SIGALG_SHARED (12 | SSL_SECOP_OTHER_SIGALG)\n/* Sanity check signature algorithm allowed */\n# define SSL_SECOP_SIGALG_CHECK (13 | SSL_SECOP_OTHER_SIGALG)\n/* Used to get mask of supported public key signature algorithms */\n# define SSL_SECOP_SIGALG_MASK (14 | SSL_SECOP_OTHER_SIGALG)\n/* Use to see if compression is allowed */\n# define SSL_SECOP_COMPRESSION (15 | SSL_SECOP_OTHER_NONE)\n/* EE key in certificate */\n# define SSL_SECOP_EE_KEY (16 | SSL_SECOP_OTHER_CERT)\n/* CA key in certificate */\n# define SSL_SECOP_CA_KEY (17 | SSL_SECOP_OTHER_CERT)\n/* CA digest algorithm in certificate */\n# define SSL_SECOP_CA_MD (18 | SSL_SECOP_OTHER_CERT)\n/* Peer EE key in certificate */\n# define SSL_SECOP_PEER_EE_KEY (SSL_SECOP_EE_KEY | SSL_SECOP_PEER)\n/* Peer CA key in certificate */\n# define SSL_SECOP_PEER_CA_KEY (SSL_SECOP_CA_KEY | SSL_SECOP_PEER)\n/* Peer CA digest algorithm in certificate */\n# define SSL_SECOP_PEER_CA_MD (SSL_SECOP_CA_MD | SSL_SECOP_PEER)\n\nvoid SSL_set_security_level(SSL *s, int level);\n__owur int SSL_get_security_level(const SSL *s);\nvoid SSL_set_security_callback(SSL *s,\n int (*cb) (const SSL *s, const SSL_CTX *ctx,\n int op, int bits, int nid,\n void *other, void *ex));\nint (*SSL_get_security_callback(const SSL *s)) (const SSL *s,\n const SSL_CTX *ctx, int op,\n int bits, int nid, void *other,\n void *ex);\nvoid SSL_set0_security_ex_data(SSL *s, void *ex);\n__owur void *SSL_get0_security_ex_data(const SSL *s);\n\nvoid SSL_CTX_set_security_level(SSL_CTX *ctx, int level);\n__owur int SSL_CTX_get_security_level(const SSL_CTX *ctx);\nvoid SSL_CTX_set_security_callback(SSL_CTX *ctx,\n int (*cb) (const SSL *s, const SSL_CTX *ctx,\n int op, int bits, int nid,\n void *other, void *ex));\nint (*SSL_CTX_get_security_callback(const SSL_CTX *ctx)) (const SSL *s,\n const SSL_CTX *ctx,\n int op, int bits,\n int nid,\n void *other,\n void *ex);\nvoid SSL_CTX_set0_security_ex_data(SSL_CTX *ctx, void *ex);\n__owur void *SSL_CTX_get0_security_ex_data(const SSL_CTX *ctx);\n\n/* OPENSSL_INIT flag 0x010000 reserved for internal use */\n# define OPENSSL_INIT_NO_LOAD_SSL_STRINGS 0x00100000L\n# define OPENSSL_INIT_LOAD_SSL_STRINGS 0x00200000L\n\n# define OPENSSL_INIT_SSL_DEFAULT \\\n (OPENSSL_INIT_LOAD_SSL_STRINGS | OPENSSL_INIT_LOAD_CRYPTO_STRINGS)\n\nint OPENSSL_init_ssl(uint64_t opts, const OPENSSL_INIT_SETTINGS *settings);\n\n# ifndef OPENSSL_NO_UNIT_TEST\n__owur const struct openssl_ssl_test_functions *SSL_test_functions(void);\n# endif\n\n__owur int SSL_free_buffers(SSL *ssl);\n__owur int SSL_alloc_buffers(SSL *ssl);\n\n/* Status codes passed to the decrypt session ticket callback. Some of these\n * are for internal use only and are never passed to the callback. */\ntypedef int SSL_TICKET_STATUS;\n\n/* Support for ticket appdata */\n/* fatal error, malloc failure */\n# define SSL_TICKET_FATAL_ERR_MALLOC 0\n/* fatal error, either from parsing or decrypting the ticket */\n# define SSL_TICKET_FATAL_ERR_OTHER 1\n/* No ticket present */\n# define SSL_TICKET_NONE 2\n/* Empty ticket present */\n# define SSL_TICKET_EMPTY 3\n/* the ticket couldn't be decrypted */\n# define SSL_TICKET_NO_DECRYPT 4\n/* a ticket was successfully decrypted */\n# define SSL_TICKET_SUCCESS 5\n/* same as above but the ticket needs to be renewed */\n# define SSL_TICKET_SUCCESS_RENEW 6\n\n/* Return codes for the decrypt session ticket callback */\ntypedef int SSL_TICKET_RETURN;\n\n/* An error occurred */\n#define SSL_TICKET_RETURN_ABORT 0\n/* Do not use the ticket, do not send a renewed ticket to the client */\n#define SSL_TICKET_RETURN_IGNORE 1\n/* Do not use the ticket, send a renewed ticket to the client */\n#define SSL_TICKET_RETURN_IGNORE_RENEW 2\n/* Use the ticket, do not send a renewed ticket to the client */\n#define SSL_TICKET_RETURN_USE 3\n/* Use the ticket, send a renewed ticket to the client */\n#define SSL_TICKET_RETURN_USE_RENEW 4\n\ntypedef int (*SSL_CTX_generate_session_ticket_fn)(SSL *s, void *arg);\ntypedef SSL_TICKET_RETURN (*SSL_CTX_decrypt_session_ticket_fn)(SSL *s, SSL_SESSION *ss,\n const unsigned char *keyname,\n size_t keyname_length,\n SSL_TICKET_STATUS status,\n void *arg);\nint SSL_CTX_set_session_ticket_cb(SSL_CTX *ctx,\n SSL_CTX_generate_session_ticket_fn gen_cb,\n SSL_CTX_decrypt_session_ticket_fn dec_cb,\n void *arg);\nint SSL_SESSION_set1_ticket_appdata(SSL_SESSION *ss, const void *data, size_t len);\nint SSL_SESSION_get0_ticket_appdata(SSL_SESSION *ss, void **data, size_t *len);\n\nextern const char SSL_version_str[];\n\ntypedef unsigned int (*DTLS_timer_cb)(SSL *s, unsigned int timer_us);\n\nvoid DTLS_set_timer_cb(SSL *s, DTLS_timer_cb cb);\n\n\ntypedef int (*SSL_allow_early_data_cb_fn)(SSL *s, void *arg);\nvoid SSL_CTX_set_allow_early_data_cb(SSL_CTX *ctx,\n SSL_allow_early_data_cb_fn cb,\n void *arg);\nvoid SSL_set_allow_early_data_cb(SSL *s,\n SSL_allow_early_data_cb_fn cb,\n void *arg);\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/ssl2.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_SSL2_H\n# define HEADER_SSL2_H\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# define SSL2_VERSION 0x0002\n\n# define SSL2_MT_CLIENT_HELLO 1\n\n#ifdef __cplusplus\n}\n#endif\n#endif\n" }, { "path": "cryptomini/include/openssl/ssl3.h", "content": "/*\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_SSL3_H\n# define HEADER_SSL3_H\n\n# include \n# include \n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/*\n * Signalling cipher suite value from RFC 5746\n * (TLS_EMPTY_RENEGOTIATION_INFO_SCSV)\n */\n# define SSL3_CK_SCSV 0x030000FF\n\n/*\n * Signalling cipher suite value from draft-ietf-tls-downgrade-scsv-00\n * (TLS_FALLBACK_SCSV)\n */\n# define SSL3_CK_FALLBACK_SCSV 0x03005600\n\n# define SSL3_CK_RSA_NULL_MD5 0x03000001\n# define SSL3_CK_RSA_NULL_SHA 0x03000002\n# define SSL3_CK_RSA_RC4_40_MD5 0x03000003\n# define SSL3_CK_RSA_RC4_128_MD5 0x03000004\n# define SSL3_CK_RSA_RC4_128_SHA 0x03000005\n# define SSL3_CK_RSA_RC2_40_MD5 0x03000006\n# define SSL3_CK_RSA_IDEA_128_SHA 0x03000007\n# define SSL3_CK_RSA_DES_40_CBC_SHA 0x03000008\n# define SSL3_CK_RSA_DES_64_CBC_SHA 0x03000009\n# define SSL3_CK_RSA_DES_192_CBC3_SHA 0x0300000A\n\n# define SSL3_CK_DH_DSS_DES_40_CBC_SHA 0x0300000B\n# define SSL3_CK_DH_DSS_DES_64_CBC_SHA 0x0300000C\n# define SSL3_CK_DH_DSS_DES_192_CBC3_SHA 0x0300000D\n# define SSL3_CK_DH_RSA_DES_40_CBC_SHA 0x0300000E\n# define SSL3_CK_DH_RSA_DES_64_CBC_SHA 0x0300000F\n# define SSL3_CK_DH_RSA_DES_192_CBC3_SHA 0x03000010\n\n# define SSL3_CK_DHE_DSS_DES_40_CBC_SHA 0x03000011\n# define SSL3_CK_EDH_DSS_DES_40_CBC_SHA SSL3_CK_DHE_DSS_DES_40_CBC_SHA\n# define SSL3_CK_DHE_DSS_DES_64_CBC_SHA 0x03000012\n# define SSL3_CK_EDH_DSS_DES_64_CBC_SHA SSL3_CK_DHE_DSS_DES_64_CBC_SHA\n# define SSL3_CK_DHE_DSS_DES_192_CBC3_SHA 0x03000013\n# define SSL3_CK_EDH_DSS_DES_192_CBC3_SHA SSL3_CK_DHE_DSS_DES_192_CBC3_SHA\n# define SSL3_CK_DHE_RSA_DES_40_CBC_SHA 0x03000014\n# define SSL3_CK_EDH_RSA_DES_40_CBC_SHA SSL3_CK_DHE_RSA_DES_40_CBC_SHA\n# define SSL3_CK_DHE_RSA_DES_64_CBC_SHA 0x03000015\n# define SSL3_CK_EDH_RSA_DES_64_CBC_SHA SSL3_CK_DHE_RSA_DES_64_CBC_SHA\n# define SSL3_CK_DHE_RSA_DES_192_CBC3_SHA 0x03000016\n# define SSL3_CK_EDH_RSA_DES_192_CBC3_SHA SSL3_CK_DHE_RSA_DES_192_CBC3_SHA\n\n# define SSL3_CK_ADH_RC4_40_MD5 0x03000017\n# define SSL3_CK_ADH_RC4_128_MD5 0x03000018\n# define SSL3_CK_ADH_DES_40_CBC_SHA 0x03000019\n# define SSL3_CK_ADH_DES_64_CBC_SHA 0x0300001A\n# define SSL3_CK_ADH_DES_192_CBC_SHA 0x0300001B\n\n/* a bundle of RFC standard cipher names, generated from ssl3_ciphers[] */\n# define SSL3_RFC_RSA_NULL_MD5 \"TLS_RSA_WITH_NULL_MD5\"\n# define SSL3_RFC_RSA_NULL_SHA \"TLS_RSA_WITH_NULL_SHA\"\n# define SSL3_RFC_RSA_DES_192_CBC3_SHA \"TLS_RSA_WITH_3DES_EDE_CBC_SHA\"\n# define SSL3_RFC_DHE_DSS_DES_192_CBC3_SHA \"TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA\"\n# define SSL3_RFC_DHE_RSA_DES_192_CBC3_SHA \"TLS_DHE_RSA_WITH_3DES_EDE_CBC_SHA\"\n# define SSL3_RFC_ADH_DES_192_CBC_SHA \"TLS_DH_anon_WITH_3DES_EDE_CBC_SHA\"\n# define SSL3_RFC_RSA_IDEA_128_SHA \"TLS_RSA_WITH_IDEA_CBC_SHA\"\n# define SSL3_RFC_RSA_RC4_128_MD5 \"TLS_RSA_WITH_RC4_128_MD5\"\n# define SSL3_RFC_RSA_RC4_128_SHA \"TLS_RSA_WITH_RC4_128_SHA\"\n# define SSL3_RFC_ADH_RC4_128_MD5 \"TLS_DH_anon_WITH_RC4_128_MD5\"\n\n# define SSL3_TXT_RSA_NULL_MD5 \"NULL-MD5\"\n# define SSL3_TXT_RSA_NULL_SHA \"NULL-SHA\"\n# define SSL3_TXT_RSA_RC4_40_MD5 \"EXP-RC4-MD5\"\n# define SSL3_TXT_RSA_RC4_128_MD5 \"RC4-MD5\"\n# define SSL3_TXT_RSA_RC4_128_SHA \"RC4-SHA\"\n# define SSL3_TXT_RSA_RC2_40_MD5 \"EXP-RC2-CBC-MD5\"\n# define SSL3_TXT_RSA_IDEA_128_SHA \"IDEA-CBC-SHA\"\n# define SSL3_TXT_RSA_DES_40_CBC_SHA \"EXP-DES-CBC-SHA\"\n# define SSL3_TXT_RSA_DES_64_CBC_SHA \"DES-CBC-SHA\"\n# define SSL3_TXT_RSA_DES_192_CBC3_SHA \"DES-CBC3-SHA\"\n\n# define SSL3_TXT_DH_DSS_DES_40_CBC_SHA \"EXP-DH-DSS-DES-CBC-SHA\"\n# define SSL3_TXT_DH_DSS_DES_64_CBC_SHA \"DH-DSS-DES-CBC-SHA\"\n# define SSL3_TXT_DH_DSS_DES_192_CBC3_SHA \"DH-DSS-DES-CBC3-SHA\"\n# define SSL3_TXT_DH_RSA_DES_40_CBC_SHA \"EXP-DH-RSA-DES-CBC-SHA\"\n# define SSL3_TXT_DH_RSA_DES_64_CBC_SHA \"DH-RSA-DES-CBC-SHA\"\n# define SSL3_TXT_DH_RSA_DES_192_CBC3_SHA \"DH-RSA-DES-CBC3-SHA\"\n\n# define SSL3_TXT_DHE_DSS_DES_40_CBC_SHA \"EXP-DHE-DSS-DES-CBC-SHA\"\n# define SSL3_TXT_DHE_DSS_DES_64_CBC_SHA \"DHE-DSS-DES-CBC-SHA\"\n# define SSL3_TXT_DHE_DSS_DES_192_CBC3_SHA \"DHE-DSS-DES-CBC3-SHA\"\n# define SSL3_TXT_DHE_RSA_DES_40_CBC_SHA \"EXP-DHE-RSA-DES-CBC-SHA\"\n# define SSL3_TXT_DHE_RSA_DES_64_CBC_SHA \"DHE-RSA-DES-CBC-SHA\"\n# define SSL3_TXT_DHE_RSA_DES_192_CBC3_SHA \"DHE-RSA-DES-CBC3-SHA\"\n\n/*\n * This next block of six \"EDH\" labels is for backward compatibility with\n * older versions of OpenSSL. New code should use the six \"DHE\" labels above\n * instead:\n */\n# define SSL3_TXT_EDH_DSS_DES_40_CBC_SHA \"EXP-EDH-DSS-DES-CBC-SHA\"\n# define SSL3_TXT_EDH_DSS_DES_64_CBC_SHA \"EDH-DSS-DES-CBC-SHA\"\n# define SSL3_TXT_EDH_DSS_DES_192_CBC3_SHA \"EDH-DSS-DES-CBC3-SHA\"\n# define SSL3_TXT_EDH_RSA_DES_40_CBC_SHA \"EXP-EDH-RSA-DES-CBC-SHA\"\n# define SSL3_TXT_EDH_RSA_DES_64_CBC_SHA \"EDH-RSA-DES-CBC-SHA\"\n# define SSL3_TXT_EDH_RSA_DES_192_CBC3_SHA \"EDH-RSA-DES-CBC3-SHA\"\n\n# define SSL3_TXT_ADH_RC4_40_MD5 \"EXP-ADH-RC4-MD5\"\n# define SSL3_TXT_ADH_RC4_128_MD5 \"ADH-RC4-MD5\"\n# define SSL3_TXT_ADH_DES_40_CBC_SHA \"EXP-ADH-DES-CBC-SHA\"\n# define SSL3_TXT_ADH_DES_64_CBC_SHA \"ADH-DES-CBC-SHA\"\n# define SSL3_TXT_ADH_DES_192_CBC_SHA \"ADH-DES-CBC3-SHA\"\n\n# define SSL3_SSL_SESSION_ID_LENGTH 32\n# define SSL3_MAX_SSL_SESSION_ID_LENGTH 32\n\n# define SSL3_MASTER_SECRET_SIZE 48\n# define SSL3_RANDOM_SIZE 32\n# define SSL3_SESSION_ID_SIZE 32\n# define SSL3_RT_HEADER_LENGTH 5\n\n# define SSL3_HM_HEADER_LENGTH 4\n\n# ifndef SSL3_ALIGN_PAYLOAD\n /*\n * Some will argue that this increases memory footprint, but it's not\n * actually true. Point is that malloc has to return at least 64-bit aligned\n * pointers, meaning that allocating 5 bytes wastes 3 bytes in either case.\n * Suggested pre-gaping simply moves these wasted bytes from the end of\n * allocated region to its front, but makes data payload aligned, which\n * improves performance:-)\n */\n# define SSL3_ALIGN_PAYLOAD 8\n# else\n# if (SSL3_ALIGN_PAYLOAD&(SSL3_ALIGN_PAYLOAD-1))!=0\n# error \"insane SSL3_ALIGN_PAYLOAD\"\n# undef SSL3_ALIGN_PAYLOAD\n# endif\n# endif\n\n/*\n * This is the maximum MAC (digest) size used by the SSL library. Currently\n * maximum of 20 is used by SHA1, but we reserve for future extension for\n * 512-bit hashes.\n */\n\n# define SSL3_RT_MAX_MD_SIZE 64\n\n/*\n * Maximum block size used in all ciphersuites. Currently 16 for AES.\n */\n\n# define SSL_RT_MAX_CIPHER_BLOCK_SIZE 16\n\n# define SSL3_RT_MAX_EXTRA (16384)\n\n/* Maximum plaintext length: defined by SSL/TLS standards */\n# define SSL3_RT_MAX_PLAIN_LENGTH 16384\n/* Maximum compression overhead: defined by SSL/TLS standards */\n# define SSL3_RT_MAX_COMPRESSED_OVERHEAD 1024\n\n/*\n * The standards give a maximum encryption overhead of 1024 bytes. In\n * practice the value is lower than this. The overhead is the maximum number\n * of padding bytes (256) plus the mac size.\n */\n# define SSL3_RT_MAX_ENCRYPTED_OVERHEAD (256 + SSL3_RT_MAX_MD_SIZE)\n# define SSL3_RT_MAX_TLS13_ENCRYPTED_OVERHEAD 256\n\n/*\n * OpenSSL currently only uses a padding length of at most one block so the\n * send overhead is smaller.\n */\n\n# define SSL3_RT_SEND_MAX_ENCRYPTED_OVERHEAD \\\n (SSL_RT_MAX_CIPHER_BLOCK_SIZE + SSL3_RT_MAX_MD_SIZE)\n\n/* If compression isn't used don't include the compression overhead */\n\n# ifdef OPENSSL_NO_COMP\n# define SSL3_RT_MAX_COMPRESSED_LENGTH SSL3_RT_MAX_PLAIN_LENGTH\n# else\n# define SSL3_RT_MAX_COMPRESSED_LENGTH \\\n (SSL3_RT_MAX_PLAIN_LENGTH+SSL3_RT_MAX_COMPRESSED_OVERHEAD)\n# endif\n# define SSL3_RT_MAX_ENCRYPTED_LENGTH \\\n (SSL3_RT_MAX_ENCRYPTED_OVERHEAD+SSL3_RT_MAX_COMPRESSED_LENGTH)\n# define SSL3_RT_MAX_TLS13_ENCRYPTED_LENGTH \\\n (SSL3_RT_MAX_PLAIN_LENGTH + SSL3_RT_MAX_TLS13_ENCRYPTED_OVERHEAD)\n# define SSL3_RT_MAX_PACKET_SIZE \\\n (SSL3_RT_MAX_ENCRYPTED_LENGTH+SSL3_RT_HEADER_LENGTH)\n\n# define SSL3_MD_CLIENT_FINISHED_CONST \"\\x43\\x4C\\x4E\\x54\"\n# define SSL3_MD_SERVER_FINISHED_CONST \"\\x53\\x52\\x56\\x52\"\n\n# define SSL3_VERSION 0x0300\n# define SSL3_VERSION_MAJOR 0x03\n# define SSL3_VERSION_MINOR 0x00\n\n# define SSL3_RT_CHANGE_CIPHER_SPEC 20\n# define SSL3_RT_ALERT 21\n# define SSL3_RT_HANDSHAKE 22\n# define SSL3_RT_APPLICATION_DATA 23\n# define DTLS1_RT_HEARTBEAT 24\n\n/* Pseudo content types to indicate additional parameters */\n# define TLS1_RT_CRYPTO 0x1000\n# define TLS1_RT_CRYPTO_PREMASTER (TLS1_RT_CRYPTO | 0x1)\n# define TLS1_RT_CRYPTO_CLIENT_RANDOM (TLS1_RT_CRYPTO | 0x2)\n# define TLS1_RT_CRYPTO_SERVER_RANDOM (TLS1_RT_CRYPTO | 0x3)\n# define TLS1_RT_CRYPTO_MASTER (TLS1_RT_CRYPTO | 0x4)\n\n# define TLS1_RT_CRYPTO_READ 0x0000\n# define TLS1_RT_CRYPTO_WRITE 0x0100\n# define TLS1_RT_CRYPTO_MAC (TLS1_RT_CRYPTO | 0x5)\n# define TLS1_RT_CRYPTO_KEY (TLS1_RT_CRYPTO | 0x6)\n# define TLS1_RT_CRYPTO_IV (TLS1_RT_CRYPTO | 0x7)\n# define TLS1_RT_CRYPTO_FIXED_IV (TLS1_RT_CRYPTO | 0x8)\n\n/* Pseudo content types for SSL/TLS header info */\n# define SSL3_RT_HEADER 0x100\n# define SSL3_RT_INNER_CONTENT_TYPE 0x101\n\n# define SSL3_AL_WARNING 1\n# define SSL3_AL_FATAL 2\n\n# define SSL3_AD_CLOSE_NOTIFY 0\n# define SSL3_AD_UNEXPECTED_MESSAGE 10/* fatal */\n# define SSL3_AD_BAD_RECORD_MAC 20/* fatal */\n# define SSL3_AD_DECOMPRESSION_FAILURE 30/* fatal */\n# define SSL3_AD_HANDSHAKE_FAILURE 40/* fatal */\n# define SSL3_AD_NO_CERTIFICATE 41\n# define SSL3_AD_BAD_CERTIFICATE 42\n# define SSL3_AD_UNSUPPORTED_CERTIFICATE 43\n# define SSL3_AD_CERTIFICATE_REVOKED 44\n# define SSL3_AD_CERTIFICATE_EXPIRED 45\n# define SSL3_AD_CERTIFICATE_UNKNOWN 46\n# define SSL3_AD_ILLEGAL_PARAMETER 47/* fatal */\n\n# define TLS1_HB_REQUEST 1\n# define TLS1_HB_RESPONSE 2\n\n\n# define SSL3_CT_RSA_SIGN 1\n# define SSL3_CT_DSS_SIGN 2\n# define SSL3_CT_RSA_FIXED_DH 3\n# define SSL3_CT_DSS_FIXED_DH 4\n# define SSL3_CT_RSA_EPHEMERAL_DH 5\n# define SSL3_CT_DSS_EPHEMERAL_DH 6\n# define SSL3_CT_FORTEZZA_DMS 20\n/*\n * SSL3_CT_NUMBER is used to size arrays and it must be large enough to\n * contain all of the cert types defined for *either* SSLv3 and TLSv1.\n */\n# define SSL3_CT_NUMBER 10\n\n# if defined(TLS_CT_NUMBER)\n# if TLS_CT_NUMBER != SSL3_CT_NUMBER\n# error \"SSL/TLS CT_NUMBER values do not match\"\n# endif\n# endif\n\n/* No longer used as of OpenSSL 1.1.1 */\n# define SSL3_FLAGS_NO_RENEGOTIATE_CIPHERS 0x0001\n\n/* Removed from OpenSSL 1.1.0 */\n# define TLS1_FLAGS_TLS_PADDING_BUG 0x0\n\n# define TLS1_FLAGS_SKIP_CERT_VERIFY 0x0010\n\n/* Set if we encrypt then mac instead of usual mac then encrypt */\n# define TLS1_FLAGS_ENCRYPT_THEN_MAC_READ 0x0100\n# define TLS1_FLAGS_ENCRYPT_THEN_MAC TLS1_FLAGS_ENCRYPT_THEN_MAC_READ\n\n/* Set if extended master secret extension received from peer */\n# define TLS1_FLAGS_RECEIVED_EXTMS 0x0200\n\n# define TLS1_FLAGS_ENCRYPT_THEN_MAC_WRITE 0x0400\n\n# define TLS1_FLAGS_STATELESS 0x0800\n\n/* Set if extended master secret extension required on renegotiation */\n# define TLS1_FLAGS_REQUIRED_EXTMS 0x1000\n\n# define SSL3_MT_HELLO_REQUEST 0\n# define SSL3_MT_CLIENT_HELLO 1\n# define SSL3_MT_SERVER_HELLO 2\n# define SSL3_MT_NEWSESSION_TICKET 4\n# define SSL3_MT_END_OF_EARLY_DATA 5\n# define SSL3_MT_ENCRYPTED_EXTENSIONS 8\n# define SSL3_MT_CERTIFICATE 11\n# define SSL3_MT_SERVER_KEY_EXCHANGE 12\n# define SSL3_MT_CERTIFICATE_REQUEST 13\n# define SSL3_MT_SERVER_DONE 14\n# define SSL3_MT_CERTIFICATE_VERIFY 15\n# define SSL3_MT_CLIENT_KEY_EXCHANGE 16\n# define SSL3_MT_FINISHED 20\n# define SSL3_MT_CERTIFICATE_URL 21\n# define SSL3_MT_CERTIFICATE_STATUS 22\n# define SSL3_MT_SUPPLEMENTAL_DATA 23\n# define SSL3_MT_KEY_UPDATE 24\n# ifndef OPENSSL_NO_NEXTPROTONEG\n# define SSL3_MT_NEXT_PROTO 67\n# endif\n# define SSL3_MT_MESSAGE_HASH 254\n# define DTLS1_MT_HELLO_VERIFY_REQUEST 3\n\n/* Dummy message type for handling CCS like a normal handshake message */\n# define SSL3_MT_CHANGE_CIPHER_SPEC 0x0101\n\n# define SSL3_MT_CCS 1\n\n/* These are used when changing over to a new cipher */\n# define SSL3_CC_READ 0x001\n# define SSL3_CC_WRITE 0x002\n# define SSL3_CC_CLIENT 0x010\n# define SSL3_CC_SERVER 0x020\n# define SSL3_CC_EARLY 0x040\n# define SSL3_CC_HANDSHAKE 0x080\n# define SSL3_CC_APPLICATION 0x100\n# define SSL3_CHANGE_CIPHER_CLIENT_WRITE (SSL3_CC_CLIENT|SSL3_CC_WRITE)\n# define SSL3_CHANGE_CIPHER_SERVER_READ (SSL3_CC_SERVER|SSL3_CC_READ)\n# define SSL3_CHANGE_CIPHER_CLIENT_READ (SSL3_CC_CLIENT|SSL3_CC_READ)\n# define SSL3_CHANGE_CIPHER_SERVER_WRITE (SSL3_CC_SERVER|SSL3_CC_WRITE)\n\n#ifdef __cplusplus\n}\n#endif\n#endif\n" }, { "path": "cryptomini/include/openssl/sslerr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2021 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_SSLERR_H\n# define HEADER_SSLERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_SSL_strings(void);\n\n/*\n * SSL function codes.\n */\n# define SSL_F_ADD_CLIENT_KEY_SHARE_EXT 438\n# define SSL_F_ADD_KEY_SHARE 512\n# define SSL_F_BYTES_TO_CIPHER_LIST 519\n# define SSL_F_CHECK_SUITEB_CIPHER_LIST 331\n# define SSL_F_CIPHERSUITE_CB 622\n# define SSL_F_CONSTRUCT_CA_NAMES 552\n# define SSL_F_CONSTRUCT_KEY_EXCHANGE_TBS 553\n# define SSL_F_CONSTRUCT_STATEFUL_TICKET 636\n# define SSL_F_CONSTRUCT_STATELESS_TICKET 637\n# define SSL_F_CREATE_SYNTHETIC_MESSAGE_HASH 539\n# define SSL_F_CREATE_TICKET_PREQUEL 638\n# define SSL_F_CT_MOVE_SCTS 345\n# define SSL_F_CT_STRICT 349\n# define SSL_F_CUSTOM_EXT_ADD 554\n# define SSL_F_CUSTOM_EXT_PARSE 555\n# define SSL_F_D2I_SSL_SESSION 103\n# define SSL_F_DANE_CTX_ENABLE 347\n# define SSL_F_DANE_MTYPE_SET 393\n# define SSL_F_DANE_TLSA_ADD 394\n# define SSL_F_DERIVE_SECRET_KEY_AND_IV 514\n# define SSL_F_DO_DTLS1_WRITE 245\n# define SSL_F_DO_SSL3_WRITE 104\n# define SSL_F_DTLS1_BUFFER_RECORD 247\n# define SSL_F_DTLS1_CHECK_TIMEOUT_NUM 318\n# define SSL_F_DTLS1_HEARTBEAT 305\n# define SSL_F_DTLS1_HM_FRAGMENT_NEW 623\n# define SSL_F_DTLS1_PREPROCESS_FRAGMENT 288\n# define SSL_F_DTLS1_PROCESS_BUFFERED_RECORDS 424\n# define SSL_F_DTLS1_PROCESS_RECORD 257\n# define SSL_F_DTLS1_READ_BYTES 258\n# define SSL_F_DTLS1_READ_FAILED 339\n# define SSL_F_DTLS1_RETRANSMIT_MESSAGE 390\n# define SSL_F_DTLS1_WRITE_APP_DATA_BYTES 268\n# define SSL_F_DTLS1_WRITE_BYTES 545\n# define SSL_F_DTLSV1_LISTEN 350\n# define SSL_F_DTLS_CONSTRUCT_CHANGE_CIPHER_SPEC 371\n# define SSL_F_DTLS_CONSTRUCT_HELLO_VERIFY_REQUEST 385\n# define SSL_F_DTLS_GET_REASSEMBLED_MESSAGE 370\n# define SSL_F_DTLS_PROCESS_HELLO_VERIFY 386\n# define SSL_F_DTLS_RECORD_LAYER_NEW 635\n# define SSL_F_DTLS_WAIT_FOR_DRY 592\n# define SSL_F_EARLY_DATA_COUNT_OK 532\n# define SSL_F_FINAL_EARLY_DATA 556\n# define SSL_F_FINAL_EC_PT_FORMATS 485\n# define SSL_F_FINAL_EMS 486\n# define SSL_F_FINAL_KEY_SHARE 503\n# define SSL_F_FINAL_MAXFRAGMENTLEN 557\n# define SSL_F_FINAL_PSK 639\n# define SSL_F_FINAL_RENEGOTIATE 483\n# define SSL_F_FINAL_SERVER_NAME 558\n# define SSL_F_FINAL_SIG_ALGS 497\n# define SSL_F_GET_CERT_VERIFY_TBS_DATA 588\n# define SSL_F_NSS_KEYLOG_INT 500\n# define SSL_F_OPENSSL_INIT_SSL 342\n# define SSL_F_OSSL_STATEM_CLIENT13_READ_TRANSITION 436\n# define SSL_F_OSSL_STATEM_CLIENT13_WRITE_TRANSITION 598\n# define SSL_F_OSSL_STATEM_CLIENT_CONSTRUCT_MESSAGE 430\n# define SSL_F_OSSL_STATEM_CLIENT_POST_PROCESS_MESSAGE 593\n# define SSL_F_OSSL_STATEM_CLIENT_PROCESS_MESSAGE 594\n# define SSL_F_OSSL_STATEM_CLIENT_READ_TRANSITION 417\n# define SSL_F_OSSL_STATEM_CLIENT_WRITE_TRANSITION 599\n# define SSL_F_OSSL_STATEM_SERVER13_READ_TRANSITION 437\n# define SSL_F_OSSL_STATEM_SERVER13_WRITE_TRANSITION 600\n# define SSL_F_OSSL_STATEM_SERVER_CONSTRUCT_MESSAGE 431\n# define SSL_F_OSSL_STATEM_SERVER_POST_PROCESS_MESSAGE 601\n# define SSL_F_OSSL_STATEM_SERVER_POST_WORK 602\n# define SSL_F_OSSL_STATEM_SERVER_PRE_WORK 640\n# define SSL_F_OSSL_STATEM_SERVER_PROCESS_MESSAGE 603\n# define SSL_F_OSSL_STATEM_SERVER_READ_TRANSITION 418\n# define SSL_F_OSSL_STATEM_SERVER_WRITE_TRANSITION 604\n# define SSL_F_PARSE_CA_NAMES 541\n# define SSL_F_PITEM_NEW 624\n# define SSL_F_PQUEUE_NEW 625\n# define SSL_F_PROCESS_KEY_SHARE_EXT 439\n# define SSL_F_READ_STATE_MACHINE 352\n# define SSL_F_SET_CLIENT_CIPHERSUITE 540\n# define SSL_F_SRP_GENERATE_CLIENT_MASTER_SECRET 595\n# define SSL_F_SRP_GENERATE_SERVER_MASTER_SECRET 589\n# define SSL_F_SRP_VERIFY_SERVER_PARAM 596\n# define SSL_F_SSL3_CHANGE_CIPHER_STATE 129\n# define SSL_F_SSL3_CHECK_CERT_AND_ALGORITHM 130\n# define SSL_F_SSL3_CTRL 213\n# define SSL_F_SSL3_CTX_CTRL 133\n# define SSL_F_SSL3_DIGEST_CACHED_RECORDS 293\n# define SSL_F_SSL3_DO_CHANGE_CIPHER_SPEC 292\n# define SSL_F_SSL3_ENC 608\n# define SSL_F_SSL3_FINAL_FINISH_MAC 285\n# define SSL_F_SSL3_FINISH_MAC 587\n# define SSL_F_SSL3_GENERATE_KEY_BLOCK 238\n# define SSL_F_SSL3_GENERATE_MASTER_SECRET 388\n# define SSL_F_SSL3_GET_RECORD 143\n# define SSL_F_SSL3_INIT_FINISHED_MAC 397\n# define SSL_F_SSL3_OUTPUT_CERT_CHAIN 147\n# define SSL_F_SSL3_READ_BYTES 148\n# define SSL_F_SSL3_READ_N 149\n# define SSL_F_SSL3_SETUP_KEY_BLOCK 157\n# define SSL_F_SSL3_SETUP_READ_BUFFER 156\n# define SSL_F_SSL3_SETUP_WRITE_BUFFER 291\n# define SSL_F_SSL3_WRITE_BYTES 158\n# define SSL_F_SSL3_WRITE_PENDING 159\n# define SSL_F_SSL_ADD_CERT_CHAIN 316\n# define SSL_F_SSL_ADD_CERT_TO_BUF 319\n# define SSL_F_SSL_ADD_CERT_TO_WPACKET 493\n# define SSL_F_SSL_ADD_CLIENTHELLO_RENEGOTIATE_EXT 298\n# define SSL_F_SSL_ADD_CLIENTHELLO_TLSEXT 277\n# define SSL_F_SSL_ADD_CLIENTHELLO_USE_SRTP_EXT 307\n# define SSL_F_SSL_ADD_DIR_CERT_SUBJECTS_TO_STACK 215\n# define SSL_F_SSL_ADD_FILE_CERT_SUBJECTS_TO_STACK 216\n# define SSL_F_SSL_ADD_SERVERHELLO_RENEGOTIATE_EXT 299\n# define SSL_F_SSL_ADD_SERVERHELLO_TLSEXT 278\n# define SSL_F_SSL_ADD_SERVERHELLO_USE_SRTP_EXT 308\n# define SSL_F_SSL_BAD_METHOD 160\n# define SSL_F_SSL_BUILD_CERT_CHAIN 332\n# define SSL_F_SSL_BYTES_TO_CIPHER_LIST 161\n# define SSL_F_SSL_CACHE_CIPHERLIST 520\n# define SSL_F_SSL_CERT_ADD0_CHAIN_CERT 346\n# define SSL_F_SSL_CERT_DUP 221\n# define SSL_F_SSL_CERT_NEW 162\n# define SSL_F_SSL_CERT_SET0_CHAIN 340\n# define SSL_F_SSL_CHECK_PRIVATE_KEY 163\n# define SSL_F_SSL_CHECK_SERVERHELLO_TLSEXT 280\n# define SSL_F_SSL_CHECK_SRP_EXT_CLIENTHELLO 606\n# define SSL_F_SSL_CHECK_SRVR_ECC_CERT_AND_ALG 279\n# define SSL_F_SSL_CHOOSE_CLIENT_VERSION 607\n# define SSL_F_SSL_CIPHER_DESCRIPTION 626\n# define SSL_F_SSL_CIPHER_LIST_TO_BYTES 425\n# define SSL_F_SSL_CIPHER_PROCESS_RULESTR 230\n# define SSL_F_SSL_CIPHER_STRENGTH_SORT 231\n# define SSL_F_SSL_CLEAR 164\n# define SSL_F_SSL_CLIENT_HELLO_GET1_EXTENSIONS_PRESENT 627\n# define SSL_F_SSL_COMP_ADD_COMPRESSION_METHOD 165\n# define SSL_F_SSL_CONF_CMD 334\n# define SSL_F_SSL_CREATE_CIPHER_LIST 166\n# define SSL_F_SSL_CTRL 232\n# define SSL_F_SSL_CTX_CHECK_PRIVATE_KEY 168\n# define SSL_F_SSL_CTX_ENABLE_CT 398\n# define SSL_F_SSL_CTX_MAKE_PROFILES 309\n# define SSL_F_SSL_CTX_NEW 169\n# define SSL_F_SSL_CTX_SET_ALPN_PROTOS 343\n# define SSL_F_SSL_CTX_SET_CIPHER_LIST 269\n# define SSL_F_SSL_CTX_SET_CLIENT_CERT_ENGINE 290\n# define SSL_F_SSL_CTX_SET_CT_VALIDATION_CALLBACK 396\n# define SSL_F_SSL_CTX_SET_SESSION_ID_CONTEXT 219\n# define SSL_F_SSL_CTX_SET_SSL_VERSION 170\n# define SSL_F_SSL_CTX_SET_TLSEXT_MAX_FRAGMENT_LENGTH 551\n# define SSL_F_SSL_CTX_USE_CERTIFICATE 171\n# define SSL_F_SSL_CTX_USE_CERTIFICATE_ASN1 172\n# define SSL_F_SSL_CTX_USE_CERTIFICATE_FILE 173\n# define SSL_F_SSL_CTX_USE_PRIVATEKEY 174\n# define SSL_F_SSL_CTX_USE_PRIVATEKEY_ASN1 175\n# define SSL_F_SSL_CTX_USE_PRIVATEKEY_FILE 176\n# define SSL_F_SSL_CTX_USE_PSK_IDENTITY_HINT 272\n# define SSL_F_SSL_CTX_USE_RSAPRIVATEKEY 177\n# define SSL_F_SSL_CTX_USE_RSAPRIVATEKEY_ASN1 178\n# define SSL_F_SSL_CTX_USE_RSAPRIVATEKEY_FILE 179\n# define SSL_F_SSL_CTX_USE_SERVERINFO 336\n# define SSL_F_SSL_CTX_USE_SERVERINFO_EX 543\n# define SSL_F_SSL_CTX_USE_SERVERINFO_FILE 337\n# define SSL_F_SSL_DANE_DUP 403\n# define SSL_F_SSL_DANE_ENABLE 395\n# define SSL_F_SSL_DERIVE 590\n# define SSL_F_SSL_DO_CONFIG 391\n# define SSL_F_SSL_DO_HANDSHAKE 180\n# define SSL_F_SSL_DUP_CA_LIST 408\n# define SSL_F_SSL_ENABLE_CT 402\n# define SSL_F_SSL_GENERATE_PKEY_GROUP 559\n# define SSL_F_SSL_GENERATE_SESSION_ID 547\n# define SSL_F_SSL_GET_NEW_SESSION 181\n# define SSL_F_SSL_GET_PREV_SESSION 217\n# define SSL_F_SSL_GET_SERVER_CERT_INDEX 322\n# define SSL_F_SSL_GET_SIGN_PKEY 183\n# define SSL_F_SSL_HANDSHAKE_HASH 560\n# define SSL_F_SSL_INIT_WBIO_BUFFER 184\n# define SSL_F_SSL_KEY_UPDATE 515\n# define SSL_F_SSL_LOAD_CLIENT_CA_FILE 185\n# define SSL_F_SSL_LOG_MASTER_SECRET 498\n# define SSL_F_SSL_LOG_RSA_CLIENT_KEY_EXCHANGE 499\n# define SSL_F_SSL_MODULE_INIT 392\n# define SSL_F_SSL_NEW 186\n# define SSL_F_SSL_NEXT_PROTO_VALIDATE 565\n# define SSL_F_SSL_PARSE_CLIENTHELLO_RENEGOTIATE_EXT 300\n# define SSL_F_SSL_PARSE_CLIENTHELLO_TLSEXT 302\n# define SSL_F_SSL_PARSE_CLIENTHELLO_USE_SRTP_EXT 310\n# define SSL_F_SSL_PARSE_SERVERHELLO_RENEGOTIATE_EXT 301\n# define SSL_F_SSL_PARSE_SERVERHELLO_TLSEXT 303\n# define SSL_F_SSL_PARSE_SERVERHELLO_USE_SRTP_EXT 311\n# define SSL_F_SSL_PEEK 270\n# define SSL_F_SSL_PEEK_EX 432\n# define SSL_F_SSL_PEEK_INTERNAL 522\n# define SSL_F_SSL_READ 223\n# define SSL_F_SSL_READ_EARLY_DATA 529\n# define SSL_F_SSL_READ_EX 434\n# define SSL_F_SSL_READ_INTERNAL 523\n# define SSL_F_SSL_RENEGOTIATE 516\n# define SSL_F_SSL_RENEGOTIATE_ABBREVIATED 546\n# define SSL_F_SSL_SCAN_CLIENTHELLO_TLSEXT 320\n# define SSL_F_SSL_SCAN_SERVERHELLO_TLSEXT 321\n# define SSL_F_SSL_SESSION_DUP 348\n# define SSL_F_SSL_SESSION_NEW 189\n# define SSL_F_SSL_SESSION_PRINT_FP 190\n# define SSL_F_SSL_SESSION_SET1_ID 423\n# define SSL_F_SSL_SESSION_SET1_ID_CONTEXT 312\n# define SSL_F_SSL_SET_ALPN_PROTOS 344\n# define SSL_F_SSL_SET_CERT 191\n# define SSL_F_SSL_SET_CERT_AND_KEY 621\n# define SSL_F_SSL_SET_CIPHER_LIST 271\n# define SSL_F_SSL_SET_CT_VALIDATION_CALLBACK 399\n# define SSL_F_SSL_SET_FD 192\n# define SSL_F_SSL_SET_PKEY 193\n# define SSL_F_SSL_SET_RFD 194\n# define SSL_F_SSL_SET_SESSION 195\n# define SSL_F_SSL_SET_SESSION_ID_CONTEXT 218\n# define SSL_F_SSL_SET_SESSION_TICKET_EXT 294\n# define SSL_F_SSL_SET_TLSEXT_MAX_FRAGMENT_LENGTH 550\n# define SSL_F_SSL_SET_WFD 196\n# define SSL_F_SSL_SHUTDOWN 224\n# define SSL_F_SSL_SRP_CTX_INIT 313\n# define SSL_F_SSL_START_ASYNC_JOB 389\n# define SSL_F_SSL_UNDEFINED_FUNCTION 197\n# define SSL_F_SSL_UNDEFINED_VOID_FUNCTION 244\n# define SSL_F_SSL_USE_CERTIFICATE 198\n# define SSL_F_SSL_USE_CERTIFICATE_ASN1 199\n# define SSL_F_SSL_USE_CERTIFICATE_FILE 200\n# define SSL_F_SSL_USE_PRIVATEKEY 201\n# define SSL_F_SSL_USE_PRIVATEKEY_ASN1 202\n# define SSL_F_SSL_USE_PRIVATEKEY_FILE 203\n# define SSL_F_SSL_USE_PSK_IDENTITY_HINT 273\n# define SSL_F_SSL_USE_RSAPRIVATEKEY 204\n# define SSL_F_SSL_USE_RSAPRIVATEKEY_ASN1 205\n# define SSL_F_SSL_USE_RSAPRIVATEKEY_FILE 206\n# define SSL_F_SSL_VALIDATE_CT 400\n# define SSL_F_SSL_VERIFY_CERT_CHAIN 207\n# define SSL_F_SSL_VERIFY_CLIENT_POST_HANDSHAKE 616\n# define SSL_F_SSL_WRITE 208\n# define SSL_F_SSL_WRITE_EARLY_DATA 526\n# define SSL_F_SSL_WRITE_EARLY_FINISH 527\n# define SSL_F_SSL_WRITE_EX 433\n# define SSL_F_SSL_WRITE_INTERNAL 524\n# define SSL_F_STATE_MACHINE 353\n# define SSL_F_TLS12_CHECK_PEER_SIGALG 333\n# define SSL_F_TLS12_COPY_SIGALGS 533\n# define SSL_F_TLS13_CHANGE_CIPHER_STATE 440\n# define SSL_F_TLS13_ENC 609\n# define SSL_F_TLS13_FINAL_FINISH_MAC 605\n# define SSL_F_TLS13_GENERATE_SECRET 591\n# define SSL_F_TLS13_HKDF_EXPAND 561\n# define SSL_F_TLS13_RESTORE_HANDSHAKE_DIGEST_FOR_PHA 617\n# define SSL_F_TLS13_SAVE_HANDSHAKE_DIGEST_FOR_PHA 618\n# define SSL_F_TLS13_SETUP_KEY_BLOCK 441\n# define SSL_F_TLS1_CHANGE_CIPHER_STATE 209\n# define SSL_F_TLS1_CHECK_DUPLICATE_EXTENSIONS 341\n# define SSL_F_TLS1_ENC 401\n# define SSL_F_TLS1_EXPORT_KEYING_MATERIAL 314\n# define SSL_F_TLS1_GET_CURVELIST 338\n# define SSL_F_TLS1_PRF 284\n# define SSL_F_TLS1_SAVE_U16 628\n# define SSL_F_TLS1_SETUP_KEY_BLOCK 211\n# define SSL_F_TLS1_SET_GROUPS 629\n# define SSL_F_TLS1_SET_RAW_SIGALGS 630\n# define SSL_F_TLS1_SET_SERVER_SIGALGS 335\n# define SSL_F_TLS1_SET_SHARED_SIGALGS 631\n# define SSL_F_TLS1_SET_SIGALGS 632\n# define SSL_F_TLS_CHOOSE_SIGALG 513\n# define SSL_F_TLS_CLIENT_KEY_EXCHANGE_POST_WORK 354\n# define SSL_F_TLS_COLLECT_EXTENSIONS 435\n# define SSL_F_TLS_CONSTRUCT_CERTIFICATE_AUTHORITIES 542\n# define SSL_F_TLS_CONSTRUCT_CERTIFICATE_REQUEST 372\n# define SSL_F_TLS_CONSTRUCT_CERT_STATUS 429\n# define SSL_F_TLS_CONSTRUCT_CERT_STATUS_BODY 494\n# define SSL_F_TLS_CONSTRUCT_CERT_VERIFY 496\n# define SSL_F_TLS_CONSTRUCT_CHANGE_CIPHER_SPEC 427\n# define SSL_F_TLS_CONSTRUCT_CKE_DHE 404\n# define SSL_F_TLS_CONSTRUCT_CKE_ECDHE 405\n# define SSL_F_TLS_CONSTRUCT_CKE_GOST 406\n# define SSL_F_TLS_CONSTRUCT_CKE_PSK_PREAMBLE 407\n# define SSL_F_TLS_CONSTRUCT_CKE_RSA 409\n# define SSL_F_TLS_CONSTRUCT_CKE_SRP 410\n# define SSL_F_TLS_CONSTRUCT_CLIENT_CERTIFICATE 484\n# define SSL_F_TLS_CONSTRUCT_CLIENT_HELLO 487\n# define SSL_F_TLS_CONSTRUCT_CLIENT_KEY_EXCHANGE 488\n# define SSL_F_TLS_CONSTRUCT_CLIENT_VERIFY 489\n# define SSL_F_TLS_CONSTRUCT_CTOS_ALPN 466\n# define SSL_F_TLS_CONSTRUCT_CTOS_CERTIFICATE 355\n# define SSL_F_TLS_CONSTRUCT_CTOS_COOKIE 535\n# define SSL_F_TLS_CONSTRUCT_CTOS_EARLY_DATA 530\n# define SSL_F_TLS_CONSTRUCT_CTOS_EC_PT_FORMATS 467\n# define SSL_F_TLS_CONSTRUCT_CTOS_EMS 468\n# define SSL_F_TLS_CONSTRUCT_CTOS_ETM 469\n# define SSL_F_TLS_CONSTRUCT_CTOS_HELLO 356\n# define SSL_F_TLS_CONSTRUCT_CTOS_KEY_EXCHANGE 357\n# define SSL_F_TLS_CONSTRUCT_CTOS_KEY_SHARE 470\n# define SSL_F_TLS_CONSTRUCT_CTOS_MAXFRAGMENTLEN 549\n# define SSL_F_TLS_CONSTRUCT_CTOS_NPN 471\n# define SSL_F_TLS_CONSTRUCT_CTOS_PADDING 472\n# define SSL_F_TLS_CONSTRUCT_CTOS_POST_HANDSHAKE_AUTH 619\n# define SSL_F_TLS_CONSTRUCT_CTOS_PSK 501\n# define SSL_F_TLS_CONSTRUCT_CTOS_PSK_KEX_MODES 509\n# define SSL_F_TLS_CONSTRUCT_CTOS_RENEGOTIATE 473\n# define SSL_F_TLS_CONSTRUCT_CTOS_SCT 474\n# define SSL_F_TLS_CONSTRUCT_CTOS_SERVER_NAME 475\n# define SSL_F_TLS_CONSTRUCT_CTOS_SESSION_TICKET 476\n# define SSL_F_TLS_CONSTRUCT_CTOS_SIG_ALGS 477\n# define SSL_F_TLS_CONSTRUCT_CTOS_SRP 478\n# define SSL_F_TLS_CONSTRUCT_CTOS_STATUS_REQUEST 479\n# define SSL_F_TLS_CONSTRUCT_CTOS_SUPPORTED_GROUPS 480\n# define SSL_F_TLS_CONSTRUCT_CTOS_SUPPORTED_VERSIONS 481\n# define SSL_F_TLS_CONSTRUCT_CTOS_USE_SRTP 482\n# define SSL_F_TLS_CONSTRUCT_CTOS_VERIFY 358\n# define SSL_F_TLS_CONSTRUCT_ENCRYPTED_EXTENSIONS 443\n# define SSL_F_TLS_CONSTRUCT_END_OF_EARLY_DATA 536\n# define SSL_F_TLS_CONSTRUCT_EXTENSIONS 447\n# define SSL_F_TLS_CONSTRUCT_FINISHED 359\n# define SSL_F_TLS_CONSTRUCT_HELLO_REQUEST 373\n# define SSL_F_TLS_CONSTRUCT_HELLO_RETRY_REQUEST 510\n# define SSL_F_TLS_CONSTRUCT_KEY_UPDATE 517\n# define SSL_F_TLS_CONSTRUCT_NEW_SESSION_TICKET 428\n# define SSL_F_TLS_CONSTRUCT_NEXT_PROTO 426\n# define SSL_F_TLS_CONSTRUCT_SERVER_CERTIFICATE 490\n# define SSL_F_TLS_CONSTRUCT_SERVER_HELLO 491\n# define SSL_F_TLS_CONSTRUCT_SERVER_KEY_EXCHANGE 492\n# define SSL_F_TLS_CONSTRUCT_STOC_ALPN 451\n# define SSL_F_TLS_CONSTRUCT_STOC_CERTIFICATE 374\n# define SSL_F_TLS_CONSTRUCT_STOC_COOKIE 613\n# define SSL_F_TLS_CONSTRUCT_STOC_CRYPTOPRO_BUG 452\n# define SSL_F_TLS_CONSTRUCT_STOC_DONE 375\n# define SSL_F_TLS_CONSTRUCT_STOC_EARLY_DATA 531\n# define SSL_F_TLS_CONSTRUCT_STOC_EARLY_DATA_INFO 525\n# define SSL_F_TLS_CONSTRUCT_STOC_EC_PT_FORMATS 453\n# define SSL_F_TLS_CONSTRUCT_STOC_EMS 454\n# define SSL_F_TLS_CONSTRUCT_STOC_ETM 455\n# define SSL_F_TLS_CONSTRUCT_STOC_HELLO 376\n# define SSL_F_TLS_CONSTRUCT_STOC_KEY_EXCHANGE 377\n# define SSL_F_TLS_CONSTRUCT_STOC_KEY_SHARE 456\n# define SSL_F_TLS_CONSTRUCT_STOC_MAXFRAGMENTLEN 548\n# define SSL_F_TLS_CONSTRUCT_STOC_NEXT_PROTO_NEG 457\n# define SSL_F_TLS_CONSTRUCT_STOC_PSK 504\n# define SSL_F_TLS_CONSTRUCT_STOC_RENEGOTIATE 458\n# define SSL_F_TLS_CONSTRUCT_STOC_SERVER_NAME 459\n# define SSL_F_TLS_CONSTRUCT_STOC_SESSION_TICKET 460\n# define SSL_F_TLS_CONSTRUCT_STOC_STATUS_REQUEST 461\n# define SSL_F_TLS_CONSTRUCT_STOC_SUPPORTED_GROUPS 544\n# define SSL_F_TLS_CONSTRUCT_STOC_SUPPORTED_VERSIONS 611\n# define SSL_F_TLS_CONSTRUCT_STOC_USE_SRTP 462\n# define SSL_F_TLS_EARLY_POST_PROCESS_CLIENT_HELLO 521\n# define SSL_F_TLS_FINISH_HANDSHAKE 597\n# define SSL_F_TLS_GET_MESSAGE_BODY 351\n# define SSL_F_TLS_GET_MESSAGE_HEADER 387\n# define SSL_F_TLS_HANDLE_ALPN 562\n# define SSL_F_TLS_HANDLE_STATUS_REQUEST 563\n# define SSL_F_TLS_PARSE_CERTIFICATE_AUTHORITIES 566\n# define SSL_F_TLS_PARSE_CLIENTHELLO_TLSEXT 449\n# define SSL_F_TLS_PARSE_CTOS_ALPN 567\n# define SSL_F_TLS_PARSE_CTOS_COOKIE 614\n# define SSL_F_TLS_PARSE_CTOS_EARLY_DATA 568\n# define SSL_F_TLS_PARSE_CTOS_EC_PT_FORMATS 569\n# define SSL_F_TLS_PARSE_CTOS_EMS 570\n# define SSL_F_TLS_PARSE_CTOS_KEY_SHARE 463\n# define SSL_F_TLS_PARSE_CTOS_MAXFRAGMENTLEN 571\n# define SSL_F_TLS_PARSE_CTOS_POST_HANDSHAKE_AUTH 620\n# define SSL_F_TLS_PARSE_CTOS_PSK 505\n# define SSL_F_TLS_PARSE_CTOS_PSK_KEX_MODES 572\n# define SSL_F_TLS_PARSE_CTOS_RENEGOTIATE 464\n# define SSL_F_TLS_PARSE_CTOS_SERVER_NAME 573\n# define SSL_F_TLS_PARSE_CTOS_SESSION_TICKET 574\n# define SSL_F_TLS_PARSE_CTOS_SIG_ALGS 575\n# define SSL_F_TLS_PARSE_CTOS_SIG_ALGS_CERT 615\n# define SSL_F_TLS_PARSE_CTOS_SRP 576\n# define SSL_F_TLS_PARSE_CTOS_STATUS_REQUEST 577\n# define SSL_F_TLS_PARSE_CTOS_SUPPORTED_GROUPS 578\n# define SSL_F_TLS_PARSE_CTOS_USE_SRTP 465\n# define SSL_F_TLS_PARSE_STOC_ALPN 579\n# define SSL_F_TLS_PARSE_STOC_COOKIE 534\n# define SSL_F_TLS_PARSE_STOC_EARLY_DATA 538\n# define SSL_F_TLS_PARSE_STOC_EARLY_DATA_INFO 528\n# define SSL_F_TLS_PARSE_STOC_EC_PT_FORMATS 580\n# define SSL_F_TLS_PARSE_STOC_KEY_SHARE 445\n# define SSL_F_TLS_PARSE_STOC_MAXFRAGMENTLEN 581\n# define SSL_F_TLS_PARSE_STOC_NPN 582\n# define SSL_F_TLS_PARSE_STOC_PSK 502\n# define SSL_F_TLS_PARSE_STOC_RENEGOTIATE 448\n# define SSL_F_TLS_PARSE_STOC_SCT 564\n# define SSL_F_TLS_PARSE_STOC_SERVER_NAME 583\n# define SSL_F_TLS_PARSE_STOC_SESSION_TICKET 584\n# define SSL_F_TLS_PARSE_STOC_STATUS_REQUEST 585\n# define SSL_F_TLS_PARSE_STOC_SUPPORTED_VERSIONS 612\n# define SSL_F_TLS_PARSE_STOC_USE_SRTP 446\n# define SSL_F_TLS_POST_PROCESS_CLIENT_HELLO 378\n# define SSL_F_TLS_POST_PROCESS_CLIENT_KEY_EXCHANGE 384\n# define SSL_F_TLS_PREPARE_CLIENT_CERTIFICATE 360\n# define SSL_F_TLS_PROCESS_AS_HELLO_RETRY_REQUEST 610\n# define SSL_F_TLS_PROCESS_CERTIFICATE_REQUEST 361\n# define SSL_F_TLS_PROCESS_CERT_STATUS 362\n# define SSL_F_TLS_PROCESS_CERT_STATUS_BODY 495\n# define SSL_F_TLS_PROCESS_CERT_VERIFY 379\n# define SSL_F_TLS_PROCESS_CHANGE_CIPHER_SPEC 363\n# define SSL_F_TLS_PROCESS_CKE_DHE 411\n# define SSL_F_TLS_PROCESS_CKE_ECDHE 412\n# define SSL_F_TLS_PROCESS_CKE_GOST 413\n# define SSL_F_TLS_PROCESS_CKE_PSK_PREAMBLE 414\n# define SSL_F_TLS_PROCESS_CKE_RSA 415\n# define SSL_F_TLS_PROCESS_CKE_SRP 416\n# define SSL_F_TLS_PROCESS_CLIENT_CERTIFICATE 380\n# define SSL_F_TLS_PROCESS_CLIENT_HELLO 381\n# define SSL_F_TLS_PROCESS_CLIENT_KEY_EXCHANGE 382\n# define SSL_F_TLS_PROCESS_ENCRYPTED_EXTENSIONS 444\n# define SSL_F_TLS_PROCESS_END_OF_EARLY_DATA 537\n# define SSL_F_TLS_PROCESS_FINISHED 364\n# define SSL_F_TLS_PROCESS_HELLO_REQ 507\n# define SSL_F_TLS_PROCESS_HELLO_RETRY_REQUEST 511\n# define SSL_F_TLS_PROCESS_INITIAL_SERVER_FLIGHT 442\n# define SSL_F_TLS_PROCESS_KEY_EXCHANGE 365\n# define SSL_F_TLS_PROCESS_KEY_UPDATE 518\n# define SSL_F_TLS_PROCESS_NEW_SESSION_TICKET 366\n# define SSL_F_TLS_PROCESS_NEXT_PROTO 383\n# define SSL_F_TLS_PROCESS_SERVER_CERTIFICATE 367\n# define SSL_F_TLS_PROCESS_SERVER_DONE 368\n# define SSL_F_TLS_PROCESS_SERVER_HELLO 369\n# define SSL_F_TLS_PROCESS_SKE_DHE 419\n# define SSL_F_TLS_PROCESS_SKE_ECDHE 420\n# define SSL_F_TLS_PROCESS_SKE_PSK_PREAMBLE 421\n# define SSL_F_TLS_PROCESS_SKE_SRP 422\n# define SSL_F_TLS_PSK_DO_BINDER 506\n# define SSL_F_TLS_SCAN_CLIENTHELLO_TLSEXT 450\n# define SSL_F_TLS_SETUP_HANDSHAKE 508\n# define SSL_F_USE_CERTIFICATE_CHAIN_FILE 220\n# define SSL_F_WPACKET_INTERN_INIT_LEN 633\n# define SSL_F_WPACKET_START_SUB_PACKET_LEN__ 634\n# define SSL_F_WRITE_STATE_MACHINE 586\n\n/*\n * SSL reason codes.\n */\n# define SSL_R_APPLICATION_DATA_AFTER_CLOSE_NOTIFY 291\n# define SSL_R_APP_DATA_IN_HANDSHAKE 100\n# define SSL_R_ATTEMPT_TO_REUSE_SESSION_IN_DIFFERENT_CONTEXT 272\n# define SSL_R_AT_LEAST_TLS_1_0_NEEDED_IN_FIPS_MODE 143\n# define SSL_R_AT_LEAST_TLS_1_2_NEEDED_IN_SUITEB_MODE 158\n# define SSL_R_BAD_CHANGE_CIPHER_SPEC 103\n# define SSL_R_BAD_CIPHER 186\n# define SSL_R_BAD_DATA 390\n# define SSL_R_BAD_DATA_RETURNED_BY_CALLBACK 106\n# define SSL_R_BAD_DECOMPRESSION 107\n# define SSL_R_BAD_DH_VALUE 102\n# define SSL_R_BAD_DIGEST_LENGTH 111\n# define SSL_R_BAD_EARLY_DATA 233\n# define SSL_R_BAD_ECC_CERT 304\n# define SSL_R_BAD_ECPOINT 306\n# define SSL_R_BAD_EXTENSION 110\n# define SSL_R_BAD_HANDSHAKE_LENGTH 332\n# define SSL_R_BAD_HANDSHAKE_STATE 236\n# define SSL_R_BAD_HELLO_REQUEST 105\n# define SSL_R_BAD_HRR_VERSION 263\n# define SSL_R_BAD_KEY_SHARE 108\n# define SSL_R_BAD_KEY_UPDATE 122\n# define SSL_R_BAD_LEGACY_VERSION 292\n# define SSL_R_BAD_LENGTH 271\n# define SSL_R_BAD_PACKET 240\n# define SSL_R_BAD_PACKET_LENGTH 115\n# define SSL_R_BAD_PROTOCOL_VERSION_NUMBER 116\n# define SSL_R_BAD_PSK 219\n# define SSL_R_BAD_PSK_IDENTITY 114\n# define SSL_R_BAD_RECORD_TYPE 443\n# define SSL_R_BAD_RSA_ENCRYPT 119\n# define SSL_R_BAD_SIGNATURE 123\n# define SSL_R_BAD_SRP_A_LENGTH 347\n# define SSL_R_BAD_SRP_PARAMETERS 371\n# define SSL_R_BAD_SRTP_MKI_VALUE 352\n# define SSL_R_BAD_SRTP_PROTECTION_PROFILE_LIST 353\n# define SSL_R_BAD_SSL_FILETYPE 124\n# define SSL_R_BAD_VALUE 384\n# define SSL_R_BAD_WRITE_RETRY 127\n# define SSL_R_BINDER_DOES_NOT_VERIFY 253\n# define SSL_R_BIO_NOT_SET 128\n# define SSL_R_BLOCK_CIPHER_PAD_IS_WRONG 129\n# define SSL_R_BN_LIB 130\n# define SSL_R_CALLBACK_FAILED 234\n# define SSL_R_CANNOT_CHANGE_CIPHER 109\n# define SSL_R_CA_DN_LENGTH_MISMATCH 131\n# define SSL_R_CA_KEY_TOO_SMALL 397\n# define SSL_R_CA_MD_TOO_WEAK 398\n# define SSL_R_CCS_RECEIVED_EARLY 133\n# define SSL_R_CERTIFICATE_VERIFY_FAILED 134\n# define SSL_R_CERT_CB_ERROR 377\n# define SSL_R_CERT_LENGTH_MISMATCH 135\n# define SSL_R_CIPHERSUITE_DIGEST_HAS_CHANGED 218\n# define SSL_R_CIPHER_CODE_WRONG_LENGTH 137\n# define SSL_R_CIPHER_OR_HASH_UNAVAILABLE 138\n# define SSL_R_CLIENTHELLO_TLSEXT 226\n# define SSL_R_COMPRESSED_LENGTH_TOO_LONG 140\n# define SSL_R_COMPRESSION_DISABLED 343\n# define SSL_R_COMPRESSION_FAILURE 141\n# define SSL_R_COMPRESSION_ID_NOT_WITHIN_PRIVATE_RANGE 307\n# define SSL_R_COMPRESSION_LIBRARY_ERROR 142\n# define SSL_R_CONNECTION_TYPE_NOT_SET 144\n# define SSL_R_CONTEXT_NOT_DANE_ENABLED 167\n# define SSL_R_COOKIE_GEN_CALLBACK_FAILURE 400\n# define SSL_R_COOKIE_MISMATCH 308\n# define SSL_R_CUSTOM_EXT_HANDLER_ALREADY_INSTALLED 206\n# define SSL_R_DANE_ALREADY_ENABLED 172\n# define SSL_R_DANE_CANNOT_OVERRIDE_MTYPE_FULL 173\n# define SSL_R_DANE_NOT_ENABLED 175\n# define SSL_R_DANE_TLSA_BAD_CERTIFICATE 180\n# define SSL_R_DANE_TLSA_BAD_CERTIFICATE_USAGE 184\n# define SSL_R_DANE_TLSA_BAD_DATA_LENGTH 189\n# define SSL_R_DANE_TLSA_BAD_DIGEST_LENGTH 192\n# define SSL_R_DANE_TLSA_BAD_MATCHING_TYPE 200\n# define SSL_R_DANE_TLSA_BAD_PUBLIC_KEY 201\n# define SSL_R_DANE_TLSA_BAD_SELECTOR 202\n# define SSL_R_DANE_TLSA_NULL_DATA 203\n# define SSL_R_DATA_BETWEEN_CCS_AND_FINISHED 145\n# define SSL_R_DATA_LENGTH_TOO_LONG 146\n# define SSL_R_DECRYPTION_FAILED 147\n# define SSL_R_DECRYPTION_FAILED_OR_BAD_RECORD_MAC 281\n# define SSL_R_DH_KEY_TOO_SMALL 394\n# define SSL_R_DH_PUBLIC_VALUE_LENGTH_IS_WRONG 148\n# define SSL_R_DIGEST_CHECK_FAILED 149\n# define SSL_R_DTLS_MESSAGE_TOO_BIG 334\n# define SSL_R_DUPLICATE_COMPRESSION_ID 309\n# define SSL_R_ECC_CERT_NOT_FOR_SIGNING 318\n# define SSL_R_ECDH_REQUIRED_FOR_SUITEB_MODE 374\n# define SSL_R_EE_KEY_TOO_SMALL 399\n# define SSL_R_EMPTY_SRTP_PROTECTION_PROFILE_LIST 354\n# define SSL_R_ENCRYPTED_LENGTH_TOO_LONG 150\n# define SSL_R_ERROR_IN_RECEIVED_CIPHER_LIST 151\n# define SSL_R_ERROR_SETTING_TLSA_BASE_DOMAIN 204\n# define SSL_R_EXCEEDS_MAX_FRAGMENT_SIZE 194\n# define SSL_R_EXCESSIVE_MESSAGE_SIZE 152\n# define SSL_R_EXTENSION_NOT_RECEIVED 279\n# define SSL_R_EXTRA_DATA_IN_MESSAGE 153\n# define SSL_R_EXT_LENGTH_MISMATCH 163\n# define SSL_R_FAILED_TO_INIT_ASYNC 405\n# define SSL_R_FRAGMENTED_CLIENT_HELLO 401\n# define SSL_R_GOT_A_FIN_BEFORE_A_CCS 154\n# define SSL_R_HTTPS_PROXY_REQUEST 155\n# define SSL_R_HTTP_REQUEST 156\n# define SSL_R_ILLEGAL_POINT_COMPRESSION 162\n# define SSL_R_ILLEGAL_SUITEB_DIGEST 380\n# define SSL_R_INAPPROPRIATE_FALLBACK 373\n# define SSL_R_INCONSISTENT_COMPRESSION 340\n# define SSL_R_INCONSISTENT_EARLY_DATA_ALPN 222\n# define SSL_R_INCONSISTENT_EARLY_DATA_SNI 231\n# define SSL_R_INCONSISTENT_EXTMS 104\n# define SSL_R_INSUFFICIENT_SECURITY 241\n# define SSL_R_INVALID_ALERT 205\n# define SSL_R_INVALID_CCS_MESSAGE 260\n# define SSL_R_INVALID_CERTIFICATE_OR_ALG 238\n# define SSL_R_INVALID_COMMAND 280\n# define SSL_R_INVALID_COMPRESSION_ALGORITHM 341\n# define SSL_R_INVALID_CONFIG 283\n# define SSL_R_INVALID_CONFIGURATION_NAME 113\n# define SSL_R_INVALID_CONTEXT 282\n# define SSL_R_INVALID_CT_VALIDATION_TYPE 212\n# define SSL_R_INVALID_KEY_UPDATE_TYPE 120\n# define SSL_R_INVALID_MAX_EARLY_DATA 174\n# define SSL_R_INVALID_NULL_CMD_NAME 385\n# define SSL_R_INVALID_SEQUENCE_NUMBER 402\n# define SSL_R_INVALID_SERVERINFO_DATA 388\n# define SSL_R_INVALID_SESSION_ID 999\n# define SSL_R_INVALID_SRP_USERNAME 357\n# define SSL_R_INVALID_STATUS_RESPONSE 328\n# define SSL_R_INVALID_TICKET_KEYS_LENGTH 325\n# define SSL_R_LENGTH_MISMATCH 159\n# define SSL_R_LENGTH_TOO_LONG 404\n# define SSL_R_LENGTH_TOO_SHORT 160\n# define SSL_R_LIBRARY_BUG 274\n# define SSL_R_LIBRARY_HAS_NO_CIPHERS 161\n# define SSL_R_MISSING_DSA_SIGNING_CERT 165\n# define SSL_R_MISSING_ECDSA_SIGNING_CERT 381\n# define SSL_R_MISSING_FATAL 256\n# define SSL_R_MISSING_PARAMETERS 290\n# define SSL_R_MISSING_PSK_KEX_MODES_EXTENSION 310\n# define SSL_R_MISSING_RSA_CERTIFICATE 168\n# define SSL_R_MISSING_RSA_ENCRYPTING_CERT 169\n# define SSL_R_MISSING_RSA_SIGNING_CERT 170\n# define SSL_R_MISSING_SIGALGS_EXTENSION 112\n# define SSL_R_MISSING_SIGNING_CERT 221\n# define SSL_R_MISSING_SRP_PARAM 358\n# define SSL_R_MISSING_SUPPORTED_GROUPS_EXTENSION 209\n# define SSL_R_MISSING_TMP_DH_KEY 171\n# define SSL_R_MISSING_TMP_ECDH_KEY 311\n# define SSL_R_MIXED_HANDSHAKE_AND_NON_HANDSHAKE_DATA 293\n# define SSL_R_NOT_ON_RECORD_BOUNDARY 182\n# define SSL_R_NOT_REPLACING_CERTIFICATE 289\n# define SSL_R_NOT_SERVER 284\n# define SSL_R_NO_APPLICATION_PROTOCOL 235\n# define SSL_R_NO_CERTIFICATES_RETURNED 176\n# define SSL_R_NO_CERTIFICATE_ASSIGNED 177\n# define SSL_R_NO_CERTIFICATE_SET 179\n# define SSL_R_NO_CHANGE_FOLLOWING_HRR 214\n# define SSL_R_NO_CIPHERS_AVAILABLE 181\n# define SSL_R_NO_CIPHERS_SPECIFIED 183\n# define SSL_R_NO_CIPHER_MATCH 185\n# define SSL_R_NO_CLIENT_CERT_METHOD 331\n# define SSL_R_NO_COMPRESSION_SPECIFIED 187\n# define SSL_R_NO_COOKIE_CALLBACK_SET 287\n# define SSL_R_NO_GOST_CERTIFICATE_SENT_BY_PEER 330\n# define SSL_R_NO_METHOD_SPECIFIED 188\n# define SSL_R_NO_PEM_EXTENSIONS 389\n# define SSL_R_NO_PRIVATE_KEY_ASSIGNED 190\n# define SSL_R_NO_PROTOCOLS_AVAILABLE 191\n# define SSL_R_NO_RENEGOTIATION 339\n# define SSL_R_NO_REQUIRED_DIGEST 324\n# define SSL_R_NO_SHARED_CIPHER 193\n# define SSL_R_NO_SHARED_GROUPS 410\n# define SSL_R_NO_SHARED_SIGNATURE_ALGORITHMS 376\n# define SSL_R_NO_SRTP_PROFILES 359\n# define SSL_R_NO_SUITABLE_KEY_SHARE 101\n# define SSL_R_NO_SUITABLE_SIGNATURE_ALGORITHM 118\n# define SSL_R_NO_VALID_SCTS 216\n# define SSL_R_NO_VERIFY_COOKIE_CALLBACK 403\n# define SSL_R_NULL_SSL_CTX 195\n# define SSL_R_NULL_SSL_METHOD_PASSED 196\n# define SSL_R_OCSP_CALLBACK_FAILURE 294\n# define SSL_R_OLD_SESSION_CIPHER_NOT_RETURNED 197\n# define SSL_R_OLD_SESSION_COMPRESSION_ALGORITHM_NOT_RETURNED 344\n# define SSL_R_OVERFLOW_ERROR 237\n# define SSL_R_PACKET_LENGTH_TOO_LONG 198\n# define SSL_R_PARSE_TLSEXT 227\n# define SSL_R_PATH_TOO_LONG 270\n# define SSL_R_PEER_DID_NOT_RETURN_A_CERTIFICATE 199\n# define SSL_R_PEM_NAME_BAD_PREFIX 391\n# define SSL_R_PEM_NAME_TOO_SHORT 392\n# define SSL_R_PIPELINE_FAILURE 406\n# define SSL_R_POST_HANDSHAKE_AUTH_ENCODING_ERR 278\n# define SSL_R_PRIVATE_KEY_MISMATCH 288\n# define SSL_R_PROTOCOL_IS_SHUTDOWN 207\n# define SSL_R_PSK_IDENTITY_NOT_FOUND 223\n# define SSL_R_PSK_NO_CLIENT_CB 224\n# define SSL_R_PSK_NO_SERVER_CB 225\n# define SSL_R_READ_BIO_NOT_SET 211\n# define SSL_R_READ_TIMEOUT_EXPIRED 312\n# define SSL_R_RECORD_LENGTH_MISMATCH 213\n# define SSL_R_RECORD_TOO_SMALL 298\n# define SSL_R_RENEGOTIATE_EXT_TOO_LONG 335\n# define SSL_R_RENEGOTIATION_ENCODING_ERR 336\n# define SSL_R_RENEGOTIATION_MISMATCH 337\n# define SSL_R_REQUEST_PENDING 285\n# define SSL_R_REQUEST_SENT 286\n# define SSL_R_REQUIRED_CIPHER_MISSING 215\n# define SSL_R_REQUIRED_COMPRESSION_ALGORITHM_MISSING 342\n# define SSL_R_SCSV_RECEIVED_WHEN_RENEGOTIATING 345\n# define SSL_R_SCT_VERIFICATION_FAILED 208\n# define SSL_R_SERVERHELLO_TLSEXT 275\n# define SSL_R_SESSION_ID_CONTEXT_UNINITIALIZED 277\n# define SSL_R_SHUTDOWN_WHILE_IN_INIT 407\n# define SSL_R_SIGNATURE_ALGORITHMS_ERROR 360\n# define SSL_R_SIGNATURE_FOR_NON_SIGNING_CERTIFICATE 220\n# define SSL_R_SRP_A_CALC 361\n# define SSL_R_SRTP_COULD_NOT_ALLOCATE_PROFILES 362\n# define SSL_R_SRTP_PROTECTION_PROFILE_LIST_TOO_LONG 363\n# define SSL_R_SRTP_UNKNOWN_PROTECTION_PROFILE 364\n# define SSL_R_SSL3_EXT_INVALID_MAX_FRAGMENT_LENGTH 232\n# define SSL_R_SSL3_EXT_INVALID_SERVERNAME 319\n# define SSL_R_SSL3_EXT_INVALID_SERVERNAME_TYPE 320\n# define SSL_R_SSL3_SESSION_ID_TOO_LONG 300\n# define SSL_R_SSLV3_ALERT_BAD_CERTIFICATE 1042\n# define SSL_R_SSLV3_ALERT_BAD_RECORD_MAC 1020\n# define SSL_R_SSLV3_ALERT_CERTIFICATE_EXPIRED 1045\n# define SSL_R_SSLV3_ALERT_CERTIFICATE_REVOKED 1044\n# define SSL_R_SSLV3_ALERT_CERTIFICATE_UNKNOWN 1046\n# define SSL_R_SSLV3_ALERT_DECOMPRESSION_FAILURE 1030\n# define SSL_R_SSLV3_ALERT_HANDSHAKE_FAILURE 1040\n# define SSL_R_SSLV3_ALERT_ILLEGAL_PARAMETER 1047\n# define SSL_R_SSLV3_ALERT_NO_CERTIFICATE 1041\n# define SSL_R_SSLV3_ALERT_UNEXPECTED_MESSAGE 1010\n# define SSL_R_SSLV3_ALERT_UNSUPPORTED_CERTIFICATE 1043\n# define SSL_R_SSL_COMMAND_SECTION_EMPTY 117\n# define SSL_R_SSL_COMMAND_SECTION_NOT_FOUND 125\n# define SSL_R_SSL_CTX_HAS_NO_DEFAULT_SSL_VERSION 228\n# define SSL_R_SSL_HANDSHAKE_FAILURE 229\n# define SSL_R_SSL_LIBRARY_HAS_NO_CIPHERS 230\n# define SSL_R_SSL_NEGATIVE_LENGTH 372\n# define SSL_R_SSL_SECTION_EMPTY 126\n# define SSL_R_SSL_SECTION_NOT_FOUND 136\n# define SSL_R_SSL_SESSION_ID_CALLBACK_FAILED 301\n# define SSL_R_SSL_SESSION_ID_CONFLICT 302\n# define SSL_R_SSL_SESSION_ID_CONTEXT_TOO_LONG 273\n# define SSL_R_SSL_SESSION_ID_HAS_BAD_LENGTH 303\n# define SSL_R_SSL_SESSION_ID_TOO_LONG 408\n# define SSL_R_SSL_SESSION_VERSION_MISMATCH 210\n# define SSL_R_STILL_IN_INIT 121\n# define SSL_R_TLSV13_ALERT_CERTIFICATE_REQUIRED 1116\n# define SSL_R_TLSV13_ALERT_MISSING_EXTENSION 1109\n# define SSL_R_TLSV1_ALERT_ACCESS_DENIED 1049\n# define SSL_R_TLSV1_ALERT_DECODE_ERROR 1050\n# define SSL_R_TLSV1_ALERT_DECRYPTION_FAILED 1021\n# define SSL_R_TLSV1_ALERT_DECRYPT_ERROR 1051\n# define SSL_R_TLSV1_ALERT_EXPORT_RESTRICTION 1060\n# define SSL_R_TLSV1_ALERT_INAPPROPRIATE_FALLBACK 1086\n# define SSL_R_TLSV1_ALERT_INSUFFICIENT_SECURITY 1071\n# define SSL_R_TLSV1_ALERT_INTERNAL_ERROR 1080\n# define SSL_R_TLSV1_ALERT_NO_RENEGOTIATION 1100\n# define SSL_R_TLSV1_ALERT_PROTOCOL_VERSION 1070\n# define SSL_R_TLSV1_ALERT_RECORD_OVERFLOW 1022\n# define SSL_R_TLSV1_ALERT_UNKNOWN_CA 1048\n# define SSL_R_TLSV1_ALERT_USER_CANCELLED 1090\n# define SSL_R_TLSV1_BAD_CERTIFICATE_HASH_VALUE 1114\n# define SSL_R_TLSV1_BAD_CERTIFICATE_STATUS_RESPONSE 1113\n# define SSL_R_TLSV1_CERTIFICATE_UNOBTAINABLE 1111\n# define SSL_R_TLSV1_UNRECOGNIZED_NAME 1112\n# define SSL_R_TLSV1_UNSUPPORTED_EXTENSION 1110\n# define SSL_R_TLS_HEARTBEAT_PEER_DOESNT_ACCEPT 365\n# define SSL_R_TLS_HEARTBEAT_PENDING 366\n# define SSL_R_TLS_ILLEGAL_EXPORTER_LABEL 367\n# define SSL_R_TLS_INVALID_ECPOINTFORMAT_LIST 157\n# define SSL_R_TOO_MANY_KEY_UPDATES 132\n# define SSL_R_TOO_MANY_WARN_ALERTS 409\n# define SSL_R_TOO_MUCH_EARLY_DATA 164\n# define SSL_R_UNABLE_TO_FIND_ECDH_PARAMETERS 314\n# define SSL_R_UNABLE_TO_FIND_PUBLIC_KEY_PARAMETERS 239\n# define SSL_R_UNABLE_TO_LOAD_SSL3_MD5_ROUTINES 242\n# define SSL_R_UNABLE_TO_LOAD_SSL3_SHA1_ROUTINES 243\n# define SSL_R_UNEXPECTED_CCS_MESSAGE 262\n# define SSL_R_UNEXPECTED_END_OF_EARLY_DATA 178\n# define SSL_R_UNEXPECTED_MESSAGE 244\n# define SSL_R_UNEXPECTED_RECORD 245\n# define SSL_R_UNINITIALIZED 276\n# define SSL_R_UNKNOWN_ALERT_TYPE 246\n# define SSL_R_UNKNOWN_CERTIFICATE_TYPE 247\n# define SSL_R_UNKNOWN_CIPHER_RETURNED 248\n# define SSL_R_UNKNOWN_CIPHER_TYPE 249\n# define SSL_R_UNKNOWN_CMD_NAME 386\n# define SSL_R_UNKNOWN_COMMAND 139\n# define SSL_R_UNKNOWN_DIGEST 368\n# define SSL_R_UNKNOWN_KEY_EXCHANGE_TYPE 250\n# define SSL_R_UNKNOWN_PKEY_TYPE 251\n# define SSL_R_UNKNOWN_PROTOCOL 252\n# define SSL_R_UNKNOWN_SSL_VERSION 254\n# define SSL_R_UNKNOWN_STATE 255\n# define SSL_R_UNSAFE_LEGACY_RENEGOTIATION_DISABLED 338\n# define SSL_R_UNSOLICITED_EXTENSION 217\n# define SSL_R_UNSUPPORTED_COMPRESSION_ALGORITHM 257\n# define SSL_R_UNSUPPORTED_ELLIPTIC_CURVE 315\n# define SSL_R_UNSUPPORTED_PROTOCOL 258\n# define SSL_R_UNSUPPORTED_SSL_VERSION 259\n# define SSL_R_UNSUPPORTED_STATUS_TYPE 329\n# define SSL_R_USE_SRTP_NOT_NEGOTIATED 369\n# define SSL_R_VERSION_TOO_HIGH 166\n# define SSL_R_VERSION_TOO_LOW 396\n# define SSL_R_WRONG_CERTIFICATE_TYPE 383\n# define SSL_R_WRONG_CIPHER_RETURNED 261\n# define SSL_R_WRONG_CURVE 378\n# define SSL_R_WRONG_SIGNATURE_LENGTH 264\n# define SSL_R_WRONG_SIGNATURE_SIZE 265\n# define SSL_R_WRONG_SIGNATURE_TYPE 370\n# define SSL_R_WRONG_SSL_VERSION 266\n# define SSL_R_WRONG_VERSION_NUMBER 267\n# define SSL_R_X509_LIB 268\n# define SSL_R_X509_VERIFICATION_SETUP_PROBLEMS 269\n\n#endif\n" }, { "path": "cryptomini/include/openssl/stack.h", "content": "/*\n * Copyright 1995-2017 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_STACK_H\n# define HEADER_STACK_H\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\ntypedef struct stack_st OPENSSL_STACK; /* Use STACK_OF(...) instead */\n\ntypedef int (*OPENSSL_sk_compfunc)(const void *, const void *);\ntypedef void (*OPENSSL_sk_freefunc)(void *);\ntypedef void *(*OPENSSL_sk_copyfunc)(const void *);\n\nint OPENSSL_sk_num(const OPENSSL_STACK *);\nvoid *OPENSSL_sk_value(const OPENSSL_STACK *, int);\n\nvoid *OPENSSL_sk_set(OPENSSL_STACK *st, int i, const void *data);\n\nOPENSSL_STACK *OPENSSL_sk_new(OPENSSL_sk_compfunc cmp);\nOPENSSL_STACK *OPENSSL_sk_new_null(void);\nOPENSSL_STACK *OPENSSL_sk_new_reserve(OPENSSL_sk_compfunc c, int n);\nint OPENSSL_sk_reserve(OPENSSL_STACK *st, int n);\nvoid OPENSSL_sk_free(OPENSSL_STACK *);\nvoid OPENSSL_sk_pop_free(OPENSSL_STACK *st, void (*func) (void *));\nOPENSSL_STACK *OPENSSL_sk_deep_copy(const OPENSSL_STACK *,\n OPENSSL_sk_copyfunc c,\n OPENSSL_sk_freefunc f);\nint OPENSSL_sk_insert(OPENSSL_STACK *sk, const void *data, int where);\nvoid *OPENSSL_sk_delete(OPENSSL_STACK *st, int loc);\nvoid *OPENSSL_sk_delete_ptr(OPENSSL_STACK *st, const void *p);\nint OPENSSL_sk_find(OPENSSL_STACK *st, const void *data);\nint OPENSSL_sk_find_ex(OPENSSL_STACK *st, const void *data);\nint OPENSSL_sk_push(OPENSSL_STACK *st, const void *data);\nint OPENSSL_sk_unshift(OPENSSL_STACK *st, const void *data);\nvoid *OPENSSL_sk_shift(OPENSSL_STACK *st);\nvoid *OPENSSL_sk_pop(OPENSSL_STACK *st);\nvoid OPENSSL_sk_zero(OPENSSL_STACK *st);\nOPENSSL_sk_compfunc OPENSSL_sk_set_cmp_func(OPENSSL_STACK *sk,\n OPENSSL_sk_compfunc cmp);\nOPENSSL_STACK *OPENSSL_sk_dup(const OPENSSL_STACK *st);\nvoid OPENSSL_sk_sort(OPENSSL_STACK *st);\nint OPENSSL_sk_is_sorted(const OPENSSL_STACK *st);\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define _STACK OPENSSL_STACK\n# define sk_num OPENSSL_sk_num\n# define sk_value OPENSSL_sk_value\n# define sk_set OPENSSL_sk_set\n# define sk_new OPENSSL_sk_new\n# define sk_new_null OPENSSL_sk_new_null\n# define sk_free OPENSSL_sk_free\n# define sk_pop_free OPENSSL_sk_pop_free\n# define sk_deep_copy OPENSSL_sk_deep_copy\n# define sk_insert OPENSSL_sk_insert\n# define sk_delete OPENSSL_sk_delete\n# define sk_delete_ptr OPENSSL_sk_delete_ptr\n# define sk_find OPENSSL_sk_find\n# define sk_find_ex OPENSSL_sk_find_ex\n# define sk_push OPENSSL_sk_push\n# define sk_unshift OPENSSL_sk_unshift\n# define sk_shift OPENSSL_sk_shift\n# define sk_pop OPENSSL_sk_pop\n# define sk_zero OPENSSL_sk_zero\n# define sk_set_cmp_func OPENSSL_sk_set_cmp_func\n# define sk_dup OPENSSL_sk_dup\n# define sk_sort OPENSSL_sk_sort\n# define sk_is_sorted OPENSSL_sk_is_sorted\n# endif\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/store.h", "content": "/*\n * Copyright 2016-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_OSSL_STORE_H\n# define HEADER_OSSL_STORE_H\n\n# include \n# include \n# include \n# include \n\n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n/*-\n * The main OSSL_STORE functions.\n * ------------------------------\n *\n * These allow applications to open a channel to a resource with supported\n * data (keys, certs, crls, ...), read the data a piece at a time and decide\n * what to do with it, and finally close.\n */\n\ntypedef struct ossl_store_ctx_st OSSL_STORE_CTX;\n\n/*\n * Typedef for the OSSL_STORE_INFO post processing callback. This can be used\n * to massage the given OSSL_STORE_INFO, or to drop it entirely (by returning\n * NULL).\n */\ntypedef OSSL_STORE_INFO *(*OSSL_STORE_post_process_info_fn)(OSSL_STORE_INFO *,\n void *);\n\n/*\n * Open a channel given a URI. The given UI method will be used any time the\n * loader needs extra input, for example when a password or pin is needed, and\n * will be passed the same user data every time it's needed in this context.\n *\n * Returns a context reference which represents the channel to communicate\n * through.\n */\nOSSL_STORE_CTX *OSSL_STORE_open(const char *uri, const UI_METHOD *ui_method,\n void *ui_data,\n OSSL_STORE_post_process_info_fn post_process,\n void *post_process_data);\n\n/*\n * Control / fine tune the OSSL_STORE channel. |cmd| determines what is to be\n * done, and depends on the underlying loader (use OSSL_STORE_get0_scheme to\n * determine which loader is used), except for common commands (see below).\n * Each command takes different arguments.\n */\nint OSSL_STORE_ctrl(OSSL_STORE_CTX *ctx, int cmd, ... /* args */);\nint OSSL_STORE_vctrl(OSSL_STORE_CTX *ctx, int cmd, va_list args);\n\n/*\n * Common ctrl commands that different loaders may choose to support.\n */\n/* int on = 0 or 1; STORE_ctrl(ctx, STORE_C_USE_SECMEM, &on); */\n# define OSSL_STORE_C_USE_SECMEM 1\n/* Where custom commands start */\n# define OSSL_STORE_C_CUSTOM_START 100\n\n/*\n * Read one data item (a key, a cert, a CRL) that is supported by the OSSL_STORE\n * functionality, given a context.\n * Returns a OSSL_STORE_INFO pointer, from which OpenSSL typed data can be\n * extracted with OSSL_STORE_INFO_get0_PKEY(), OSSL_STORE_INFO_get0_CERT(), ...\n * NULL is returned on error, which may include that the data found at the URI\n * can't be figured out for certain or is ambiguous.\n */\nOSSL_STORE_INFO *OSSL_STORE_load(OSSL_STORE_CTX *ctx);\n\n/*\n * Check if end of data (end of file) is reached\n * Returns 1 on end, 0 otherwise.\n */\nint OSSL_STORE_eof(OSSL_STORE_CTX *ctx);\n\n/*\n * Check if an error occurred\n * Returns 1 if it did, 0 otherwise.\n */\nint OSSL_STORE_error(OSSL_STORE_CTX *ctx);\n\n/*\n * Close the channel\n * Returns 1 on success, 0 on error.\n */\nint OSSL_STORE_close(OSSL_STORE_CTX *ctx);\n\n\n/*-\n * Extracting OpenSSL types from and creating new OSSL_STORE_INFOs\n * ---------------------------------------------------------------\n */\n\n/*\n * Types of data that can be ossl_stored in a OSSL_STORE_INFO.\n * OSSL_STORE_INFO_NAME is typically found when getting a listing of\n * available \"files\" / \"tokens\" / what have you.\n */\n# define OSSL_STORE_INFO_NAME 1 /* char * */\n# define OSSL_STORE_INFO_PARAMS 2 /* EVP_PKEY * */\n# define OSSL_STORE_INFO_PKEY 3 /* EVP_PKEY * */\n# define OSSL_STORE_INFO_CERT 4 /* X509 * */\n# define OSSL_STORE_INFO_CRL 5 /* X509_CRL * */\n\n/*\n * Functions to generate OSSL_STORE_INFOs, one function for each type we\n * support having in them, as well as a generic constructor.\n *\n * In all cases, ownership of the object is transferred to the OSSL_STORE_INFO\n * and will therefore be freed when the OSSL_STORE_INFO is freed.\n */\nOSSL_STORE_INFO *OSSL_STORE_INFO_new_NAME(char *name);\nint OSSL_STORE_INFO_set0_NAME_description(OSSL_STORE_INFO *info, char *desc);\nOSSL_STORE_INFO *OSSL_STORE_INFO_new_PARAMS(EVP_PKEY *params);\nOSSL_STORE_INFO *OSSL_STORE_INFO_new_PKEY(EVP_PKEY *pkey);\nOSSL_STORE_INFO *OSSL_STORE_INFO_new_CERT(X509 *x509);\nOSSL_STORE_INFO *OSSL_STORE_INFO_new_CRL(X509_CRL *crl);\n\n/*\n * Functions to try to extract data from a OSSL_STORE_INFO.\n */\nint OSSL_STORE_INFO_get_type(const OSSL_STORE_INFO *info);\nconst char *OSSL_STORE_INFO_get0_NAME(const OSSL_STORE_INFO *info);\nchar *OSSL_STORE_INFO_get1_NAME(const OSSL_STORE_INFO *info);\nconst char *OSSL_STORE_INFO_get0_NAME_description(const OSSL_STORE_INFO *info);\nchar *OSSL_STORE_INFO_get1_NAME_description(const OSSL_STORE_INFO *info);\nEVP_PKEY *OSSL_STORE_INFO_get0_PARAMS(const OSSL_STORE_INFO *info);\nEVP_PKEY *OSSL_STORE_INFO_get1_PARAMS(const OSSL_STORE_INFO *info);\nEVP_PKEY *OSSL_STORE_INFO_get0_PKEY(const OSSL_STORE_INFO *info);\nEVP_PKEY *OSSL_STORE_INFO_get1_PKEY(const OSSL_STORE_INFO *info);\nX509 *OSSL_STORE_INFO_get0_CERT(const OSSL_STORE_INFO *info);\nX509 *OSSL_STORE_INFO_get1_CERT(const OSSL_STORE_INFO *info);\nX509_CRL *OSSL_STORE_INFO_get0_CRL(const OSSL_STORE_INFO *info);\nX509_CRL *OSSL_STORE_INFO_get1_CRL(const OSSL_STORE_INFO *info);\n\nconst char *OSSL_STORE_INFO_type_string(int type);\n\n/*\n * Free the OSSL_STORE_INFO\n */\nvoid OSSL_STORE_INFO_free(OSSL_STORE_INFO *info);\n\n\n/*-\n * Functions to construct a search URI from a base URI and search criteria\n * -----------------------------------------------------------------------\n */\n\n/* OSSL_STORE search types */\n# define OSSL_STORE_SEARCH_BY_NAME 1 /* subject in certs, issuer in CRLs */\n# define OSSL_STORE_SEARCH_BY_ISSUER_SERIAL 2\n# define OSSL_STORE_SEARCH_BY_KEY_FINGERPRINT 3\n# define OSSL_STORE_SEARCH_BY_ALIAS 4\n\n/* To check what search types the scheme handler supports */\nint OSSL_STORE_supports_search(OSSL_STORE_CTX *ctx, int search_type);\n\n/* Search term constructors */\n/*\n * The input is considered to be owned by the caller, and must therefore\n * remain present throughout the lifetime of the returned OSSL_STORE_SEARCH\n */\nOSSL_STORE_SEARCH *OSSL_STORE_SEARCH_by_name(X509_NAME *name);\nOSSL_STORE_SEARCH *OSSL_STORE_SEARCH_by_issuer_serial(X509_NAME *name,\n const ASN1_INTEGER\n *serial);\nOSSL_STORE_SEARCH *OSSL_STORE_SEARCH_by_key_fingerprint(const EVP_MD *digest,\n const unsigned char\n *bytes, size_t len);\nOSSL_STORE_SEARCH *OSSL_STORE_SEARCH_by_alias(const char *alias);\n\n/* Search term destructor */\nvoid OSSL_STORE_SEARCH_free(OSSL_STORE_SEARCH *search);\n\n/* Search term accessors */\nint OSSL_STORE_SEARCH_get_type(const OSSL_STORE_SEARCH *criterion);\nX509_NAME *OSSL_STORE_SEARCH_get0_name(OSSL_STORE_SEARCH *criterion);\nconst ASN1_INTEGER *OSSL_STORE_SEARCH_get0_serial(const OSSL_STORE_SEARCH\n *criterion);\nconst unsigned char *OSSL_STORE_SEARCH_get0_bytes(const OSSL_STORE_SEARCH\n *criterion, size_t *length);\nconst char *OSSL_STORE_SEARCH_get0_string(const OSSL_STORE_SEARCH *criterion);\nconst EVP_MD *OSSL_STORE_SEARCH_get0_digest(const OSSL_STORE_SEARCH *criterion);\n\n/*\n * Add search criterion and expected return type (which can be unspecified)\n * to the loading channel. This MUST happen before the first OSSL_STORE_load().\n */\nint OSSL_STORE_expect(OSSL_STORE_CTX *ctx, int expected_type);\nint OSSL_STORE_find(OSSL_STORE_CTX *ctx, OSSL_STORE_SEARCH *search);\n\n\n/*-\n * Function to register a loader for the given URI scheme.\n * -------------------------------------------------------\n *\n * The loader receives all the main components of an URI except for the\n * scheme.\n */\n\ntypedef struct ossl_store_loader_st OSSL_STORE_LOADER;\nOSSL_STORE_LOADER *OSSL_STORE_LOADER_new(ENGINE *e, const char *scheme);\nconst ENGINE *OSSL_STORE_LOADER_get0_engine(const OSSL_STORE_LOADER *loader);\nconst char *OSSL_STORE_LOADER_get0_scheme(const OSSL_STORE_LOADER *loader);\n/* struct ossl_store_loader_ctx_st is defined differently by each loader */\ntypedef struct ossl_store_loader_ctx_st OSSL_STORE_LOADER_CTX;\ntypedef OSSL_STORE_LOADER_CTX *(*OSSL_STORE_open_fn)(const OSSL_STORE_LOADER\n *loader,\n const char *uri,\n const UI_METHOD *ui_method,\n void *ui_data);\nint OSSL_STORE_LOADER_set_open(OSSL_STORE_LOADER *loader,\n OSSL_STORE_open_fn open_function);\ntypedef int (*OSSL_STORE_ctrl_fn)(OSSL_STORE_LOADER_CTX *ctx, int cmd,\n va_list args);\nint OSSL_STORE_LOADER_set_ctrl(OSSL_STORE_LOADER *loader,\n OSSL_STORE_ctrl_fn ctrl_function);\ntypedef int (*OSSL_STORE_expect_fn)(OSSL_STORE_LOADER_CTX *ctx, int expected);\nint OSSL_STORE_LOADER_set_expect(OSSL_STORE_LOADER *loader,\n OSSL_STORE_expect_fn expect_function);\ntypedef int (*OSSL_STORE_find_fn)(OSSL_STORE_LOADER_CTX *ctx,\n OSSL_STORE_SEARCH *criteria);\nint OSSL_STORE_LOADER_set_find(OSSL_STORE_LOADER *loader,\n OSSL_STORE_find_fn find_function);\ntypedef OSSL_STORE_INFO *(*OSSL_STORE_load_fn)(OSSL_STORE_LOADER_CTX *ctx,\n const UI_METHOD *ui_method,\n void *ui_data);\nint OSSL_STORE_LOADER_set_load(OSSL_STORE_LOADER *loader,\n OSSL_STORE_load_fn load_function);\ntypedef int (*OSSL_STORE_eof_fn)(OSSL_STORE_LOADER_CTX *ctx);\nint OSSL_STORE_LOADER_set_eof(OSSL_STORE_LOADER *loader,\n OSSL_STORE_eof_fn eof_function);\ntypedef int (*OSSL_STORE_error_fn)(OSSL_STORE_LOADER_CTX *ctx);\nint OSSL_STORE_LOADER_set_error(OSSL_STORE_LOADER *loader,\n OSSL_STORE_error_fn error_function);\ntypedef int (*OSSL_STORE_close_fn)(OSSL_STORE_LOADER_CTX *ctx);\nint OSSL_STORE_LOADER_set_close(OSSL_STORE_LOADER *loader,\n OSSL_STORE_close_fn close_function);\nvoid OSSL_STORE_LOADER_free(OSSL_STORE_LOADER *loader);\n\nint OSSL_STORE_register_loader(OSSL_STORE_LOADER *loader);\nOSSL_STORE_LOADER *OSSL_STORE_unregister_loader(const char *scheme);\n\n/*-\n * Functions to list STORE loaders\n * -------------------------------\n */\nint OSSL_STORE_do_all_loaders(void (*do_function) (const OSSL_STORE_LOADER\n *loader, void *do_arg),\n void *do_arg);\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/storeerr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_OSSL_STOREERR_H\n# define HEADER_OSSL_STOREERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_OSSL_STORE_strings(void);\n\n/*\n * OSSL_STORE function codes.\n */\n# define OSSL_STORE_F_FILE_CTRL 129\n# define OSSL_STORE_F_FILE_FIND 138\n# define OSSL_STORE_F_FILE_GET_PASS 118\n# define OSSL_STORE_F_FILE_LOAD 119\n# define OSSL_STORE_F_FILE_LOAD_TRY_DECODE 124\n# define OSSL_STORE_F_FILE_NAME_TO_URI 126\n# define OSSL_STORE_F_FILE_OPEN 120\n# define OSSL_STORE_F_OSSL_STORE_ATTACH_PEM_BIO 127\n# define OSSL_STORE_F_OSSL_STORE_EXPECT 130\n# define OSSL_STORE_F_OSSL_STORE_FILE_ATTACH_PEM_BIO_INT 128\n# define OSSL_STORE_F_OSSL_STORE_FIND 131\n# define OSSL_STORE_F_OSSL_STORE_GET0_LOADER_INT 100\n# define OSSL_STORE_F_OSSL_STORE_INFO_GET1_CERT 101\n# define OSSL_STORE_F_OSSL_STORE_INFO_GET1_CRL 102\n# define OSSL_STORE_F_OSSL_STORE_INFO_GET1_NAME 103\n# define OSSL_STORE_F_OSSL_STORE_INFO_GET1_NAME_DESCRIPTION 135\n# define OSSL_STORE_F_OSSL_STORE_INFO_GET1_PARAMS 104\n# define OSSL_STORE_F_OSSL_STORE_INFO_GET1_PKEY 105\n# define OSSL_STORE_F_OSSL_STORE_INFO_NEW_CERT 106\n# define OSSL_STORE_F_OSSL_STORE_INFO_NEW_CRL 107\n# define OSSL_STORE_F_OSSL_STORE_INFO_NEW_EMBEDDED 123\n# define OSSL_STORE_F_OSSL_STORE_INFO_NEW_NAME 109\n# define OSSL_STORE_F_OSSL_STORE_INFO_NEW_PARAMS 110\n# define OSSL_STORE_F_OSSL_STORE_INFO_NEW_PKEY 111\n# define OSSL_STORE_F_OSSL_STORE_INFO_SET0_NAME_DESCRIPTION 134\n# define OSSL_STORE_F_OSSL_STORE_INIT_ONCE 112\n# define OSSL_STORE_F_OSSL_STORE_LOADER_NEW 113\n# define OSSL_STORE_F_OSSL_STORE_OPEN 114\n# define OSSL_STORE_F_OSSL_STORE_OPEN_INT 115\n# define OSSL_STORE_F_OSSL_STORE_REGISTER_LOADER_INT 117\n# define OSSL_STORE_F_OSSL_STORE_SEARCH_BY_ALIAS 132\n# define OSSL_STORE_F_OSSL_STORE_SEARCH_BY_ISSUER_SERIAL 133\n# define OSSL_STORE_F_OSSL_STORE_SEARCH_BY_KEY_FINGERPRINT 136\n# define OSSL_STORE_F_OSSL_STORE_SEARCH_BY_NAME 137\n# define OSSL_STORE_F_OSSL_STORE_UNREGISTER_LOADER_INT 116\n# define OSSL_STORE_F_TRY_DECODE_PARAMS 121\n# define OSSL_STORE_F_TRY_DECODE_PKCS12 122\n# define OSSL_STORE_F_TRY_DECODE_PKCS8ENCRYPTED 125\n\n/*\n * OSSL_STORE reason codes.\n */\n# define OSSL_STORE_R_AMBIGUOUS_CONTENT_TYPE 107\n# define OSSL_STORE_R_BAD_PASSWORD_READ 115\n# define OSSL_STORE_R_ERROR_VERIFYING_PKCS12_MAC 113\n# define OSSL_STORE_R_FINGERPRINT_SIZE_DOES_NOT_MATCH_DIGEST 121\n# define OSSL_STORE_R_INVALID_SCHEME 106\n# define OSSL_STORE_R_IS_NOT_A 112\n# define OSSL_STORE_R_LOADER_INCOMPLETE 116\n# define OSSL_STORE_R_LOADING_STARTED 117\n# define OSSL_STORE_R_NOT_A_CERTIFICATE 100\n# define OSSL_STORE_R_NOT_A_CRL 101\n# define OSSL_STORE_R_NOT_A_KEY 102\n# define OSSL_STORE_R_NOT_A_NAME 103\n# define OSSL_STORE_R_NOT_PARAMETERS 104\n# define OSSL_STORE_R_PASSPHRASE_CALLBACK_ERROR 114\n# define OSSL_STORE_R_PATH_MUST_BE_ABSOLUTE 108\n# define OSSL_STORE_R_SEARCH_ONLY_SUPPORTED_FOR_DIRECTORIES 119\n# define OSSL_STORE_R_UI_PROCESS_INTERRUPTED_OR_CANCELLED 109\n# define OSSL_STORE_R_UNREGISTERED_SCHEME 105\n# define OSSL_STORE_R_UNSUPPORTED_CONTENT_TYPE 110\n# define OSSL_STORE_R_UNSUPPORTED_OPERATION 118\n# define OSSL_STORE_R_UNSUPPORTED_SEARCH_TYPE 120\n# define OSSL_STORE_R_URI_AUTHORITY_UNSUPPORTED 111\n\n#endif\n" }, { "path": "cryptomini/include/openssl/symhacks.h", "content": "/*\n * Copyright 1999-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_SYMHACKS_H\n# define HEADER_SYMHACKS_H\n\n# include \n\n/* Case insensitive linking causes problems.... */\n# if defined(OPENSSL_SYS_VMS)\n# undef ERR_load_CRYPTO_strings\n# define ERR_load_CRYPTO_strings ERR_load_CRYPTOlib_strings\n# undef OCSP_crlID_new\n# define OCSP_crlID_new OCSP_crlID2_new\n\n# undef d2i_ECPARAMETERS\n# define d2i_ECPARAMETERS d2i_UC_ECPARAMETERS\n# undef i2d_ECPARAMETERS\n# define i2d_ECPARAMETERS i2d_UC_ECPARAMETERS\n# undef d2i_ECPKPARAMETERS\n# define d2i_ECPKPARAMETERS d2i_UC_ECPKPARAMETERS\n# undef i2d_ECPKPARAMETERS\n# define i2d_ECPKPARAMETERS i2d_UC_ECPKPARAMETERS\n\n/* This one clashes with CMS_data_create */\n# undef cms_Data_create\n# define cms_Data_create priv_cms_Data_create\n\n# endif\n\n#endif /* ! defined HEADER_VMS_IDHACKS_H */\n" }, { "path": "cryptomini/include/openssl/tls1.h", "content": "/*\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n * Copyright 2005 Nokia. All rights reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_TLS1_H\n# define HEADER_TLS1_H\n\n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/* Default security level if not overridden at config time */\n# ifndef OPENSSL_TLS_SECURITY_LEVEL\n# define OPENSSL_TLS_SECURITY_LEVEL 1\n# endif\n\n# define TLS1_VERSION 0x0301\n# define TLS1_1_VERSION 0x0302\n# define TLS1_2_VERSION 0x0303\n# define TLS1_3_VERSION 0x0304\n# define TLS_MAX_VERSION TLS1_3_VERSION\n\n/* Special value for method supporting multiple versions */\n# define TLS_ANY_VERSION 0x10000\n\n# define TLS1_VERSION_MAJOR 0x03\n# define TLS1_VERSION_MINOR 0x01\n\n# define TLS1_1_VERSION_MAJOR 0x03\n# define TLS1_1_VERSION_MINOR 0x02\n\n# define TLS1_2_VERSION_MAJOR 0x03\n# define TLS1_2_VERSION_MINOR 0x03\n\n# define TLS1_get_version(s) \\\n ((SSL_version(s) >> 8) == TLS1_VERSION_MAJOR ? SSL_version(s) : 0)\n\n# define TLS1_get_client_version(s) \\\n ((SSL_client_version(s) >> 8) == TLS1_VERSION_MAJOR ? SSL_client_version(s) : 0)\n\n# define TLS1_AD_DECRYPTION_FAILED 21\n# define TLS1_AD_RECORD_OVERFLOW 22\n# define TLS1_AD_UNKNOWN_CA 48/* fatal */\n# define TLS1_AD_ACCESS_DENIED 49/* fatal */\n# define TLS1_AD_DECODE_ERROR 50/* fatal */\n# define TLS1_AD_DECRYPT_ERROR 51\n# define TLS1_AD_EXPORT_RESTRICTION 60/* fatal */\n# define TLS1_AD_PROTOCOL_VERSION 70/* fatal */\n# define TLS1_AD_INSUFFICIENT_SECURITY 71/* fatal */\n# define TLS1_AD_INTERNAL_ERROR 80/* fatal */\n# define TLS1_AD_INAPPROPRIATE_FALLBACK 86/* fatal */\n# define TLS1_AD_USER_CANCELLED 90\n# define TLS1_AD_NO_RENEGOTIATION 100\n/* TLSv1.3 alerts */\n# define TLS13_AD_MISSING_EXTENSION 109 /* fatal */\n# define TLS13_AD_CERTIFICATE_REQUIRED 116 /* fatal */\n/* codes 110-114 are from RFC3546 */\n# define TLS1_AD_UNSUPPORTED_EXTENSION 110\n# define TLS1_AD_CERTIFICATE_UNOBTAINABLE 111\n# define TLS1_AD_UNRECOGNIZED_NAME 112\n# define TLS1_AD_BAD_CERTIFICATE_STATUS_RESPONSE 113\n# define TLS1_AD_BAD_CERTIFICATE_HASH_VALUE 114\n# define TLS1_AD_UNKNOWN_PSK_IDENTITY 115/* fatal */\n# define TLS1_AD_NO_APPLICATION_PROTOCOL 120 /* fatal */\n\n/* ExtensionType values from RFC3546 / RFC4366 / RFC6066 */\n# define TLSEXT_TYPE_server_name 0\n# define TLSEXT_TYPE_max_fragment_length 1\n# define TLSEXT_TYPE_client_certificate_url 2\n# define TLSEXT_TYPE_trusted_ca_keys 3\n# define TLSEXT_TYPE_truncated_hmac 4\n# define TLSEXT_TYPE_status_request 5\n/* ExtensionType values from RFC4681 */\n# define TLSEXT_TYPE_user_mapping 6\n/* ExtensionType values from RFC5878 */\n# define TLSEXT_TYPE_client_authz 7\n# define TLSEXT_TYPE_server_authz 8\n/* ExtensionType values from RFC6091 */\n# define TLSEXT_TYPE_cert_type 9\n\n/* ExtensionType values from RFC4492 */\n/*\n * Prior to TLSv1.3 the supported_groups extension was known as\n * elliptic_curves\n */\n# define TLSEXT_TYPE_supported_groups 10\n# define TLSEXT_TYPE_elliptic_curves TLSEXT_TYPE_supported_groups\n# define TLSEXT_TYPE_ec_point_formats 11\n\n\n/* ExtensionType value from RFC5054 */\n# define TLSEXT_TYPE_srp 12\n\n/* ExtensionType values from RFC5246 */\n# define TLSEXT_TYPE_signature_algorithms 13\n\n/* ExtensionType value from RFC5764 */\n# define TLSEXT_TYPE_use_srtp 14\n\n/* ExtensionType value from RFC5620 */\n# define TLSEXT_TYPE_heartbeat 15\n\n/* ExtensionType value from RFC7301 */\n# define TLSEXT_TYPE_application_layer_protocol_negotiation 16\n\n/*\n * Extension type for Certificate Transparency\n * https://tools.ietf.org/html/rfc6962#section-3.3.1\n */\n# define TLSEXT_TYPE_signed_certificate_timestamp 18\n\n/*\n * ExtensionType value for TLS padding extension.\n * http://tools.ietf.org/html/draft-agl-tls-padding\n */\n# define TLSEXT_TYPE_padding 21\n\n/* ExtensionType value from RFC7366 */\n# define TLSEXT_TYPE_encrypt_then_mac 22\n\n/* ExtensionType value from RFC7627 */\n# define TLSEXT_TYPE_extended_master_secret 23\n\n/* ExtensionType value from RFC4507 */\n# define TLSEXT_TYPE_session_ticket 35\n\n/* As defined for TLS1.3 */\n# define TLSEXT_TYPE_psk 41\n# define TLSEXT_TYPE_early_data 42\n# define TLSEXT_TYPE_supported_versions 43\n# define TLSEXT_TYPE_cookie 44\n# define TLSEXT_TYPE_psk_kex_modes 45\n# define TLSEXT_TYPE_certificate_authorities 47\n# define TLSEXT_TYPE_post_handshake_auth 49\n# define TLSEXT_TYPE_signature_algorithms_cert 50\n# define TLSEXT_TYPE_key_share 51\n\n/* Temporary extension type */\n# define TLSEXT_TYPE_renegotiate 0xff01\n\n# ifndef OPENSSL_NO_NEXTPROTONEG\n/* This is not an IANA defined extension number */\n# define TLSEXT_TYPE_next_proto_neg 13172\n# endif\n\n/* NameType value from RFC3546 */\n# define TLSEXT_NAMETYPE_host_name 0\n/* status request value from RFC3546 */\n# define TLSEXT_STATUSTYPE_ocsp 1\n\n/* ECPointFormat values from RFC4492 */\n# define TLSEXT_ECPOINTFORMAT_first 0\n# define TLSEXT_ECPOINTFORMAT_uncompressed 0\n# define TLSEXT_ECPOINTFORMAT_ansiX962_compressed_prime 1\n# define TLSEXT_ECPOINTFORMAT_ansiX962_compressed_char2 2\n# define TLSEXT_ECPOINTFORMAT_last 2\n\n/* Signature and hash algorithms from RFC5246 */\n# define TLSEXT_signature_anonymous 0\n# define TLSEXT_signature_rsa 1\n# define TLSEXT_signature_dsa 2\n# define TLSEXT_signature_ecdsa 3\n# define TLSEXT_signature_gostr34102001 237\n# define TLSEXT_signature_gostr34102012_256 238\n# define TLSEXT_signature_gostr34102012_512 239\n\n/* Total number of different signature algorithms */\n# define TLSEXT_signature_num 7\n\n# define TLSEXT_hash_none 0\n# define TLSEXT_hash_md5 1\n# define TLSEXT_hash_sha1 2\n# define TLSEXT_hash_sha224 3\n# define TLSEXT_hash_sha256 4\n# define TLSEXT_hash_sha384 5\n# define TLSEXT_hash_sha512 6\n# define TLSEXT_hash_gostr3411 237\n# define TLSEXT_hash_gostr34112012_256 238\n# define TLSEXT_hash_gostr34112012_512 239\n\n/* Total number of different digest algorithms */\n\n# define TLSEXT_hash_num 10\n\n/* Flag set for unrecognised algorithms */\n# define TLSEXT_nid_unknown 0x1000000\n\n/* ECC curves */\n\n# define TLSEXT_curve_P_256 23\n# define TLSEXT_curve_P_384 24\n\n/* OpenSSL value to disable maximum fragment length extension */\n# define TLSEXT_max_fragment_length_DISABLED 0\n/* Allowed values for max fragment length extension */\n# define TLSEXT_max_fragment_length_512 1\n# define TLSEXT_max_fragment_length_1024 2\n# define TLSEXT_max_fragment_length_2048 3\n# define TLSEXT_max_fragment_length_4096 4\n\nint SSL_CTX_set_tlsext_max_fragment_length(SSL_CTX *ctx, uint8_t mode);\nint SSL_set_tlsext_max_fragment_length(SSL *ssl, uint8_t mode);\n\n# define TLSEXT_MAXLEN_host_name 255\n\n__owur const char *SSL_get_servername(const SSL *s, const int type);\n__owur int SSL_get_servername_type(const SSL *s);\n/*\n * SSL_export_keying_material exports a value derived from the master secret,\n * as specified in RFC 5705. It writes |olen| bytes to |out| given a label and\n * optional context. (Since a zero length context is allowed, the |use_context|\n * flag controls whether a context is included.) It returns 1 on success and\n * 0 or -1 otherwise.\n */\n__owur int SSL_export_keying_material(SSL *s, unsigned char *out, size_t olen,\n const char *label, size_t llen,\n const unsigned char *context,\n size_t contextlen, int use_context);\n\n/*\n * SSL_export_keying_material_early exports a value derived from the\n * early exporter master secret, as specified in\n * https://tools.ietf.org/html/draft-ietf-tls-tls13-23. It writes\n * |olen| bytes to |out| given a label and optional context. It\n * returns 1 on success and 0 otherwise.\n */\n__owur int SSL_export_keying_material_early(SSL *s, unsigned char *out,\n size_t olen, const char *label,\n size_t llen,\n const unsigned char *context,\n size_t contextlen);\n\nint SSL_get_peer_signature_type_nid(const SSL *s, int *pnid);\nint SSL_get_signature_type_nid(const SSL *s, int *pnid);\n\nint SSL_get_sigalgs(SSL *s, int idx,\n int *psign, int *phash, int *psignandhash,\n unsigned char *rsig, unsigned char *rhash);\n\nint SSL_get_shared_sigalgs(SSL *s, int idx,\n int *psign, int *phash, int *psignandhash,\n unsigned char *rsig, unsigned char *rhash);\n\n__owur int SSL_check_chain(SSL *s, X509 *x, EVP_PKEY *pk, STACK_OF(X509) *chain);\n\n# define SSL_set_tlsext_host_name(s,name) \\\n SSL_ctrl(s,SSL_CTRL_SET_TLSEXT_HOSTNAME,TLSEXT_NAMETYPE_host_name,\\\n (void *)name)\n\n# define SSL_set_tlsext_debug_callback(ssl, cb) \\\n SSL_callback_ctrl(ssl,SSL_CTRL_SET_TLSEXT_DEBUG_CB,\\\n (void (*)(void))cb)\n\n# define SSL_set_tlsext_debug_arg(ssl, arg) \\\n SSL_ctrl(ssl,SSL_CTRL_SET_TLSEXT_DEBUG_ARG,0,arg)\n\n# define SSL_get_tlsext_status_type(ssl) \\\n SSL_ctrl(ssl,SSL_CTRL_GET_TLSEXT_STATUS_REQ_TYPE,0,NULL)\n\n# define SSL_set_tlsext_status_type(ssl, type) \\\n SSL_ctrl(ssl,SSL_CTRL_SET_TLSEXT_STATUS_REQ_TYPE,type,NULL)\n\n# define SSL_get_tlsext_status_exts(ssl, arg) \\\n SSL_ctrl(ssl,SSL_CTRL_GET_TLSEXT_STATUS_REQ_EXTS,0,arg)\n\n# define SSL_set_tlsext_status_exts(ssl, arg) \\\n SSL_ctrl(ssl,SSL_CTRL_SET_TLSEXT_STATUS_REQ_EXTS,0,arg)\n\n# define SSL_get_tlsext_status_ids(ssl, arg) \\\n SSL_ctrl(ssl,SSL_CTRL_GET_TLSEXT_STATUS_REQ_IDS,0,arg)\n\n# define SSL_set_tlsext_status_ids(ssl, arg) \\\n SSL_ctrl(ssl,SSL_CTRL_SET_TLSEXT_STATUS_REQ_IDS,0,arg)\n\n# define SSL_get_tlsext_status_ocsp_resp(ssl, arg) \\\n SSL_ctrl(ssl,SSL_CTRL_GET_TLSEXT_STATUS_REQ_OCSP_RESP,0,arg)\n\n# define SSL_set_tlsext_status_ocsp_resp(ssl, arg, arglen) \\\n SSL_ctrl(ssl,SSL_CTRL_SET_TLSEXT_STATUS_REQ_OCSP_RESP,arglen,arg)\n\n# define SSL_CTX_set_tlsext_servername_callback(ctx, cb) \\\n SSL_CTX_callback_ctrl(ctx,SSL_CTRL_SET_TLSEXT_SERVERNAME_CB,\\\n (void (*)(void))cb)\n\n# define SSL_TLSEXT_ERR_OK 0\n# define SSL_TLSEXT_ERR_ALERT_WARNING 1\n# define SSL_TLSEXT_ERR_ALERT_FATAL 2\n# define SSL_TLSEXT_ERR_NOACK 3\n\n# define SSL_CTX_set_tlsext_servername_arg(ctx, arg) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_TLSEXT_SERVERNAME_ARG,0,arg)\n\n# define SSL_CTX_get_tlsext_ticket_keys(ctx, keys, keylen) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_GET_TLSEXT_TICKET_KEYS,keylen,keys)\n# define SSL_CTX_set_tlsext_ticket_keys(ctx, keys, keylen) \\\n SSL_CTX_ctrl(ctx,SSL_CTRL_SET_TLSEXT_TICKET_KEYS,keylen,keys)\n\n# define SSL_CTX_get_tlsext_status_cb(ssl, cb) \\\n SSL_CTX_ctrl(ssl,SSL_CTRL_GET_TLSEXT_STATUS_REQ_CB,0,(void *)cb)\n# define SSL_CTX_set_tlsext_status_cb(ssl, cb) \\\n SSL_CTX_callback_ctrl(ssl,SSL_CTRL_SET_TLSEXT_STATUS_REQ_CB,\\\n (void (*)(void))cb)\n\n# define SSL_CTX_get_tlsext_status_arg(ssl, arg) \\\n SSL_CTX_ctrl(ssl,SSL_CTRL_GET_TLSEXT_STATUS_REQ_CB_ARG,0,arg)\n# define SSL_CTX_set_tlsext_status_arg(ssl, arg) \\\n SSL_CTX_ctrl(ssl,SSL_CTRL_SET_TLSEXT_STATUS_REQ_CB_ARG,0,arg)\n\n# define SSL_CTX_set_tlsext_status_type(ssl, type) \\\n SSL_CTX_ctrl(ssl,SSL_CTRL_SET_TLSEXT_STATUS_REQ_TYPE,type,NULL)\n\n# define SSL_CTX_get_tlsext_status_type(ssl) \\\n SSL_CTX_ctrl(ssl,SSL_CTRL_GET_TLSEXT_STATUS_REQ_TYPE,0,NULL)\n\n# define SSL_CTX_set_tlsext_ticket_key_cb(ssl, cb) \\\n SSL_CTX_callback_ctrl(ssl,SSL_CTRL_SET_TLSEXT_TICKET_KEY_CB,\\\n (void (*)(void))cb)\n\n# ifndef OPENSSL_NO_HEARTBEATS\n# define SSL_DTLSEXT_HB_ENABLED 0x01\n# define SSL_DTLSEXT_HB_DONT_SEND_REQUESTS 0x02\n# define SSL_DTLSEXT_HB_DONT_RECV_REQUESTS 0x04\n# define SSL_get_dtlsext_heartbeat_pending(ssl) \\\n SSL_ctrl(ssl,SSL_CTRL_GET_DTLS_EXT_HEARTBEAT_PENDING,0,NULL)\n# define SSL_set_dtlsext_heartbeat_no_requests(ssl, arg) \\\n SSL_ctrl(ssl,SSL_CTRL_SET_DTLS_EXT_HEARTBEAT_NO_REQUESTS,arg,NULL)\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define SSL_CTRL_TLS_EXT_SEND_HEARTBEAT \\\n SSL_CTRL_DTLS_EXT_SEND_HEARTBEAT\n# define SSL_CTRL_GET_TLS_EXT_HEARTBEAT_PENDING \\\n SSL_CTRL_GET_DTLS_EXT_HEARTBEAT_PENDING\n# define SSL_CTRL_SET_TLS_EXT_HEARTBEAT_NO_REQUESTS \\\n SSL_CTRL_SET_DTLS_EXT_HEARTBEAT_NO_REQUESTS\n# define SSL_TLSEXT_HB_ENABLED \\\n SSL_DTLSEXT_HB_ENABLED\n# define SSL_TLSEXT_HB_DONT_SEND_REQUESTS \\\n SSL_DTLSEXT_HB_DONT_SEND_REQUESTS\n# define SSL_TLSEXT_HB_DONT_RECV_REQUESTS \\\n SSL_DTLSEXT_HB_DONT_RECV_REQUESTS\n# define SSL_get_tlsext_heartbeat_pending(ssl) \\\n SSL_get_dtlsext_heartbeat_pending(ssl)\n# define SSL_set_tlsext_heartbeat_no_requests(ssl, arg) \\\n SSL_set_dtlsext_heartbeat_no_requests(ssl,arg)\n# endif\n# endif\n\n/* PSK ciphersuites from 4279 */\n# define TLS1_CK_PSK_WITH_RC4_128_SHA 0x0300008A\n# define TLS1_CK_PSK_WITH_3DES_EDE_CBC_SHA 0x0300008B\n# define TLS1_CK_PSK_WITH_AES_128_CBC_SHA 0x0300008C\n# define TLS1_CK_PSK_WITH_AES_256_CBC_SHA 0x0300008D\n# define TLS1_CK_DHE_PSK_WITH_RC4_128_SHA 0x0300008E\n# define TLS1_CK_DHE_PSK_WITH_3DES_EDE_CBC_SHA 0x0300008F\n# define TLS1_CK_DHE_PSK_WITH_AES_128_CBC_SHA 0x03000090\n# define TLS1_CK_DHE_PSK_WITH_AES_256_CBC_SHA 0x03000091\n# define TLS1_CK_RSA_PSK_WITH_RC4_128_SHA 0x03000092\n# define TLS1_CK_RSA_PSK_WITH_3DES_EDE_CBC_SHA 0x03000093\n# define TLS1_CK_RSA_PSK_WITH_AES_128_CBC_SHA 0x03000094\n# define TLS1_CK_RSA_PSK_WITH_AES_256_CBC_SHA 0x03000095\n\n/* PSK ciphersuites from 5487 */\n# define TLS1_CK_PSK_WITH_AES_128_GCM_SHA256 0x030000A8\n# define TLS1_CK_PSK_WITH_AES_256_GCM_SHA384 0x030000A9\n# define TLS1_CK_DHE_PSK_WITH_AES_128_GCM_SHA256 0x030000AA\n# define TLS1_CK_DHE_PSK_WITH_AES_256_GCM_SHA384 0x030000AB\n# define TLS1_CK_RSA_PSK_WITH_AES_128_GCM_SHA256 0x030000AC\n# define TLS1_CK_RSA_PSK_WITH_AES_256_GCM_SHA384 0x030000AD\n# define TLS1_CK_PSK_WITH_AES_128_CBC_SHA256 0x030000AE\n# define TLS1_CK_PSK_WITH_AES_256_CBC_SHA384 0x030000AF\n# define TLS1_CK_PSK_WITH_NULL_SHA256 0x030000B0\n# define TLS1_CK_PSK_WITH_NULL_SHA384 0x030000B1\n# define TLS1_CK_DHE_PSK_WITH_AES_128_CBC_SHA256 0x030000B2\n# define TLS1_CK_DHE_PSK_WITH_AES_256_CBC_SHA384 0x030000B3\n# define TLS1_CK_DHE_PSK_WITH_NULL_SHA256 0x030000B4\n# define TLS1_CK_DHE_PSK_WITH_NULL_SHA384 0x030000B5\n# define TLS1_CK_RSA_PSK_WITH_AES_128_CBC_SHA256 0x030000B6\n# define TLS1_CK_RSA_PSK_WITH_AES_256_CBC_SHA384 0x030000B7\n# define TLS1_CK_RSA_PSK_WITH_NULL_SHA256 0x030000B8\n# define TLS1_CK_RSA_PSK_WITH_NULL_SHA384 0x030000B9\n\n/* NULL PSK ciphersuites from RFC4785 */\n# define TLS1_CK_PSK_WITH_NULL_SHA 0x0300002C\n# define TLS1_CK_DHE_PSK_WITH_NULL_SHA 0x0300002D\n# define TLS1_CK_RSA_PSK_WITH_NULL_SHA 0x0300002E\n\n/* AES ciphersuites from RFC3268 */\n# define TLS1_CK_RSA_WITH_AES_128_SHA 0x0300002F\n# define TLS1_CK_DH_DSS_WITH_AES_128_SHA 0x03000030\n# define TLS1_CK_DH_RSA_WITH_AES_128_SHA 0x03000031\n# define TLS1_CK_DHE_DSS_WITH_AES_128_SHA 0x03000032\n# define TLS1_CK_DHE_RSA_WITH_AES_128_SHA 0x03000033\n# define TLS1_CK_ADH_WITH_AES_128_SHA 0x03000034\n# define TLS1_CK_RSA_WITH_AES_256_SHA 0x03000035\n# define TLS1_CK_DH_DSS_WITH_AES_256_SHA 0x03000036\n# define TLS1_CK_DH_RSA_WITH_AES_256_SHA 0x03000037\n# define TLS1_CK_DHE_DSS_WITH_AES_256_SHA 0x03000038\n# define TLS1_CK_DHE_RSA_WITH_AES_256_SHA 0x03000039\n# define TLS1_CK_ADH_WITH_AES_256_SHA 0x0300003A\n\n/* TLS v1.2 ciphersuites */\n# define TLS1_CK_RSA_WITH_NULL_SHA256 0x0300003B\n# define TLS1_CK_RSA_WITH_AES_128_SHA256 0x0300003C\n# define TLS1_CK_RSA_WITH_AES_256_SHA256 0x0300003D\n# define TLS1_CK_DH_DSS_WITH_AES_128_SHA256 0x0300003E\n# define TLS1_CK_DH_RSA_WITH_AES_128_SHA256 0x0300003F\n# define TLS1_CK_DHE_DSS_WITH_AES_128_SHA256 0x03000040\n\n/* Camellia ciphersuites from RFC4132 */\n# define TLS1_CK_RSA_WITH_CAMELLIA_128_CBC_SHA 0x03000041\n# define TLS1_CK_DH_DSS_WITH_CAMELLIA_128_CBC_SHA 0x03000042\n# define TLS1_CK_DH_RSA_WITH_CAMELLIA_128_CBC_SHA 0x03000043\n# define TLS1_CK_DHE_DSS_WITH_CAMELLIA_128_CBC_SHA 0x03000044\n# define TLS1_CK_DHE_RSA_WITH_CAMELLIA_128_CBC_SHA 0x03000045\n# define TLS1_CK_ADH_WITH_CAMELLIA_128_CBC_SHA 0x03000046\n\n/* TLS v1.2 ciphersuites */\n# define TLS1_CK_DHE_RSA_WITH_AES_128_SHA256 0x03000067\n# define TLS1_CK_DH_DSS_WITH_AES_256_SHA256 0x03000068\n# define TLS1_CK_DH_RSA_WITH_AES_256_SHA256 0x03000069\n# define TLS1_CK_DHE_DSS_WITH_AES_256_SHA256 0x0300006A\n# define TLS1_CK_DHE_RSA_WITH_AES_256_SHA256 0x0300006B\n# define TLS1_CK_ADH_WITH_AES_128_SHA256 0x0300006C\n# define TLS1_CK_ADH_WITH_AES_256_SHA256 0x0300006D\n\n/* Camellia ciphersuites from RFC4132 */\n# define TLS1_CK_RSA_WITH_CAMELLIA_256_CBC_SHA 0x03000084\n# define TLS1_CK_DH_DSS_WITH_CAMELLIA_256_CBC_SHA 0x03000085\n# define TLS1_CK_DH_RSA_WITH_CAMELLIA_256_CBC_SHA 0x03000086\n# define TLS1_CK_DHE_DSS_WITH_CAMELLIA_256_CBC_SHA 0x03000087\n# define TLS1_CK_DHE_RSA_WITH_CAMELLIA_256_CBC_SHA 0x03000088\n# define TLS1_CK_ADH_WITH_CAMELLIA_256_CBC_SHA 0x03000089\n\n/* SEED ciphersuites from RFC4162 */\n# define TLS1_CK_RSA_WITH_SEED_SHA 0x03000096\n# define TLS1_CK_DH_DSS_WITH_SEED_SHA 0x03000097\n# define TLS1_CK_DH_RSA_WITH_SEED_SHA 0x03000098\n# define TLS1_CK_DHE_DSS_WITH_SEED_SHA 0x03000099\n# define TLS1_CK_DHE_RSA_WITH_SEED_SHA 0x0300009A\n# define TLS1_CK_ADH_WITH_SEED_SHA 0x0300009B\n\n/* TLS v1.2 GCM ciphersuites from RFC5288 */\n# define TLS1_CK_RSA_WITH_AES_128_GCM_SHA256 0x0300009C\n# define TLS1_CK_RSA_WITH_AES_256_GCM_SHA384 0x0300009D\n# define TLS1_CK_DHE_RSA_WITH_AES_128_GCM_SHA256 0x0300009E\n# define TLS1_CK_DHE_RSA_WITH_AES_256_GCM_SHA384 0x0300009F\n# define TLS1_CK_DH_RSA_WITH_AES_128_GCM_SHA256 0x030000A0\n# define TLS1_CK_DH_RSA_WITH_AES_256_GCM_SHA384 0x030000A1\n# define TLS1_CK_DHE_DSS_WITH_AES_128_GCM_SHA256 0x030000A2\n# define TLS1_CK_DHE_DSS_WITH_AES_256_GCM_SHA384 0x030000A3\n# define TLS1_CK_DH_DSS_WITH_AES_128_GCM_SHA256 0x030000A4\n# define TLS1_CK_DH_DSS_WITH_AES_256_GCM_SHA384 0x030000A5\n# define TLS1_CK_ADH_WITH_AES_128_GCM_SHA256 0x030000A6\n# define TLS1_CK_ADH_WITH_AES_256_GCM_SHA384 0x030000A7\n\n/* CCM ciphersuites from RFC6655 */\n# define TLS1_CK_RSA_WITH_AES_128_CCM 0x0300C09C\n# define TLS1_CK_RSA_WITH_AES_256_CCM 0x0300C09D\n# define TLS1_CK_DHE_RSA_WITH_AES_128_CCM 0x0300C09E\n# define TLS1_CK_DHE_RSA_WITH_AES_256_CCM 0x0300C09F\n# define TLS1_CK_RSA_WITH_AES_128_CCM_8 0x0300C0A0\n# define TLS1_CK_RSA_WITH_AES_256_CCM_8 0x0300C0A1\n# define TLS1_CK_DHE_RSA_WITH_AES_128_CCM_8 0x0300C0A2\n# define TLS1_CK_DHE_RSA_WITH_AES_256_CCM_8 0x0300C0A3\n# define TLS1_CK_PSK_WITH_AES_128_CCM 0x0300C0A4\n# define TLS1_CK_PSK_WITH_AES_256_CCM 0x0300C0A5\n# define TLS1_CK_DHE_PSK_WITH_AES_128_CCM 0x0300C0A6\n# define TLS1_CK_DHE_PSK_WITH_AES_256_CCM 0x0300C0A7\n# define TLS1_CK_PSK_WITH_AES_128_CCM_8 0x0300C0A8\n# define TLS1_CK_PSK_WITH_AES_256_CCM_8 0x0300C0A9\n# define TLS1_CK_DHE_PSK_WITH_AES_128_CCM_8 0x0300C0AA\n# define TLS1_CK_DHE_PSK_WITH_AES_256_CCM_8 0x0300C0AB\n\n/* CCM ciphersuites from RFC7251 */\n# define TLS1_CK_ECDHE_ECDSA_WITH_AES_128_CCM 0x0300C0AC\n# define TLS1_CK_ECDHE_ECDSA_WITH_AES_256_CCM 0x0300C0AD\n# define TLS1_CK_ECDHE_ECDSA_WITH_AES_128_CCM_8 0x0300C0AE\n# define TLS1_CK_ECDHE_ECDSA_WITH_AES_256_CCM_8 0x0300C0AF\n\n/* TLS 1.2 Camellia SHA-256 ciphersuites from RFC5932 */\n# define TLS1_CK_RSA_WITH_CAMELLIA_128_CBC_SHA256 0x030000BA\n# define TLS1_CK_DH_DSS_WITH_CAMELLIA_128_CBC_SHA256 0x030000BB\n# define TLS1_CK_DH_RSA_WITH_CAMELLIA_128_CBC_SHA256 0x030000BC\n# define TLS1_CK_DHE_DSS_WITH_CAMELLIA_128_CBC_SHA256 0x030000BD\n# define TLS1_CK_DHE_RSA_WITH_CAMELLIA_128_CBC_SHA256 0x030000BE\n# define TLS1_CK_ADH_WITH_CAMELLIA_128_CBC_SHA256 0x030000BF\n\n# define TLS1_CK_RSA_WITH_CAMELLIA_256_CBC_SHA256 0x030000C0\n# define TLS1_CK_DH_DSS_WITH_CAMELLIA_256_CBC_SHA256 0x030000C1\n# define TLS1_CK_DH_RSA_WITH_CAMELLIA_256_CBC_SHA256 0x030000C2\n# define TLS1_CK_DHE_DSS_WITH_CAMELLIA_256_CBC_SHA256 0x030000C3\n# define TLS1_CK_DHE_RSA_WITH_CAMELLIA_256_CBC_SHA256 0x030000C4\n# define TLS1_CK_ADH_WITH_CAMELLIA_256_CBC_SHA256 0x030000C5\n\n/* ECC ciphersuites from RFC4492 */\n# define TLS1_CK_ECDH_ECDSA_WITH_NULL_SHA 0x0300C001\n# define TLS1_CK_ECDH_ECDSA_WITH_RC4_128_SHA 0x0300C002\n# define TLS1_CK_ECDH_ECDSA_WITH_DES_192_CBC3_SHA 0x0300C003\n# define TLS1_CK_ECDH_ECDSA_WITH_AES_128_CBC_SHA 0x0300C004\n# define TLS1_CK_ECDH_ECDSA_WITH_AES_256_CBC_SHA 0x0300C005\n\n# define TLS1_CK_ECDHE_ECDSA_WITH_NULL_SHA 0x0300C006\n# define TLS1_CK_ECDHE_ECDSA_WITH_RC4_128_SHA 0x0300C007\n# define TLS1_CK_ECDHE_ECDSA_WITH_DES_192_CBC3_SHA 0x0300C008\n# define TLS1_CK_ECDHE_ECDSA_WITH_AES_128_CBC_SHA 0x0300C009\n# define TLS1_CK_ECDHE_ECDSA_WITH_AES_256_CBC_SHA 0x0300C00A\n\n# define TLS1_CK_ECDH_RSA_WITH_NULL_SHA 0x0300C00B\n# define TLS1_CK_ECDH_RSA_WITH_RC4_128_SHA 0x0300C00C\n# define TLS1_CK_ECDH_RSA_WITH_DES_192_CBC3_SHA 0x0300C00D\n# define TLS1_CK_ECDH_RSA_WITH_AES_128_CBC_SHA 0x0300C00E\n# define TLS1_CK_ECDH_RSA_WITH_AES_256_CBC_SHA 0x0300C00F\n\n# define TLS1_CK_ECDHE_RSA_WITH_NULL_SHA 0x0300C010\n# define TLS1_CK_ECDHE_RSA_WITH_RC4_128_SHA 0x0300C011\n# define TLS1_CK_ECDHE_RSA_WITH_DES_192_CBC3_SHA 0x0300C012\n# define TLS1_CK_ECDHE_RSA_WITH_AES_128_CBC_SHA 0x0300C013\n# define TLS1_CK_ECDHE_RSA_WITH_AES_256_CBC_SHA 0x0300C014\n\n# define TLS1_CK_ECDH_anon_WITH_NULL_SHA 0x0300C015\n# define TLS1_CK_ECDH_anon_WITH_RC4_128_SHA 0x0300C016\n# define TLS1_CK_ECDH_anon_WITH_DES_192_CBC3_SHA 0x0300C017\n# define TLS1_CK_ECDH_anon_WITH_AES_128_CBC_SHA 0x0300C018\n# define TLS1_CK_ECDH_anon_WITH_AES_256_CBC_SHA 0x0300C019\n\n/* SRP ciphersuites from RFC 5054 */\n# define TLS1_CK_SRP_SHA_WITH_3DES_EDE_CBC_SHA 0x0300C01A\n# define TLS1_CK_SRP_SHA_RSA_WITH_3DES_EDE_CBC_SHA 0x0300C01B\n# define TLS1_CK_SRP_SHA_DSS_WITH_3DES_EDE_CBC_SHA 0x0300C01C\n# define TLS1_CK_SRP_SHA_WITH_AES_128_CBC_SHA 0x0300C01D\n# define TLS1_CK_SRP_SHA_RSA_WITH_AES_128_CBC_SHA 0x0300C01E\n# define TLS1_CK_SRP_SHA_DSS_WITH_AES_128_CBC_SHA 0x0300C01F\n# define TLS1_CK_SRP_SHA_WITH_AES_256_CBC_SHA 0x0300C020\n# define TLS1_CK_SRP_SHA_RSA_WITH_AES_256_CBC_SHA 0x0300C021\n# define TLS1_CK_SRP_SHA_DSS_WITH_AES_256_CBC_SHA 0x0300C022\n\n/* ECDH HMAC based ciphersuites from RFC5289 */\n# define TLS1_CK_ECDHE_ECDSA_WITH_AES_128_SHA256 0x0300C023\n# define TLS1_CK_ECDHE_ECDSA_WITH_AES_256_SHA384 0x0300C024\n# define TLS1_CK_ECDH_ECDSA_WITH_AES_128_SHA256 0x0300C025\n# define TLS1_CK_ECDH_ECDSA_WITH_AES_256_SHA384 0x0300C026\n# define TLS1_CK_ECDHE_RSA_WITH_AES_128_SHA256 0x0300C027\n# define TLS1_CK_ECDHE_RSA_WITH_AES_256_SHA384 0x0300C028\n# define TLS1_CK_ECDH_RSA_WITH_AES_128_SHA256 0x0300C029\n# define TLS1_CK_ECDH_RSA_WITH_AES_256_SHA384 0x0300C02A\n\n/* ECDH GCM based ciphersuites from RFC5289 */\n# define TLS1_CK_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256 0x0300C02B\n# define TLS1_CK_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384 0x0300C02C\n# define TLS1_CK_ECDH_ECDSA_WITH_AES_128_GCM_SHA256 0x0300C02D\n# define TLS1_CK_ECDH_ECDSA_WITH_AES_256_GCM_SHA384 0x0300C02E\n# define TLS1_CK_ECDHE_RSA_WITH_AES_128_GCM_SHA256 0x0300C02F\n# define TLS1_CK_ECDHE_RSA_WITH_AES_256_GCM_SHA384 0x0300C030\n# define TLS1_CK_ECDH_RSA_WITH_AES_128_GCM_SHA256 0x0300C031\n# define TLS1_CK_ECDH_RSA_WITH_AES_256_GCM_SHA384 0x0300C032\n\n/* ECDHE PSK ciphersuites from RFC5489 */\n# define TLS1_CK_ECDHE_PSK_WITH_RC4_128_SHA 0x0300C033\n# define TLS1_CK_ECDHE_PSK_WITH_3DES_EDE_CBC_SHA 0x0300C034\n# define TLS1_CK_ECDHE_PSK_WITH_AES_128_CBC_SHA 0x0300C035\n# define TLS1_CK_ECDHE_PSK_WITH_AES_256_CBC_SHA 0x0300C036\n\n# define TLS1_CK_ECDHE_PSK_WITH_AES_128_CBC_SHA256 0x0300C037\n# define TLS1_CK_ECDHE_PSK_WITH_AES_256_CBC_SHA384 0x0300C038\n\n/* NULL PSK ciphersuites from RFC4785 */\n# define TLS1_CK_ECDHE_PSK_WITH_NULL_SHA 0x0300C039\n# define TLS1_CK_ECDHE_PSK_WITH_NULL_SHA256 0x0300C03A\n# define TLS1_CK_ECDHE_PSK_WITH_NULL_SHA384 0x0300C03B\n\n/* Camellia-CBC ciphersuites from RFC6367 */\n# define TLS1_CK_ECDHE_ECDSA_WITH_CAMELLIA_128_CBC_SHA256 0x0300C072\n# define TLS1_CK_ECDHE_ECDSA_WITH_CAMELLIA_256_CBC_SHA384 0x0300C073\n# define TLS1_CK_ECDH_ECDSA_WITH_CAMELLIA_128_CBC_SHA256 0x0300C074\n# define TLS1_CK_ECDH_ECDSA_WITH_CAMELLIA_256_CBC_SHA384 0x0300C075\n# define TLS1_CK_ECDHE_RSA_WITH_CAMELLIA_128_CBC_SHA256 0x0300C076\n# define TLS1_CK_ECDHE_RSA_WITH_CAMELLIA_256_CBC_SHA384 0x0300C077\n# define TLS1_CK_ECDH_RSA_WITH_CAMELLIA_128_CBC_SHA256 0x0300C078\n# define TLS1_CK_ECDH_RSA_WITH_CAMELLIA_256_CBC_SHA384 0x0300C079\n\n# define TLS1_CK_PSK_WITH_CAMELLIA_128_CBC_SHA256 0x0300C094\n# define TLS1_CK_PSK_WITH_CAMELLIA_256_CBC_SHA384 0x0300C095\n# define TLS1_CK_DHE_PSK_WITH_CAMELLIA_128_CBC_SHA256 0x0300C096\n# define TLS1_CK_DHE_PSK_WITH_CAMELLIA_256_CBC_SHA384 0x0300C097\n# define TLS1_CK_RSA_PSK_WITH_CAMELLIA_128_CBC_SHA256 0x0300C098\n# define TLS1_CK_RSA_PSK_WITH_CAMELLIA_256_CBC_SHA384 0x0300C099\n# define TLS1_CK_ECDHE_PSK_WITH_CAMELLIA_128_CBC_SHA256 0x0300C09A\n# define TLS1_CK_ECDHE_PSK_WITH_CAMELLIA_256_CBC_SHA384 0x0300C09B\n\n/* draft-ietf-tls-chacha20-poly1305-03 */\n# define TLS1_CK_ECDHE_RSA_WITH_CHACHA20_POLY1305 0x0300CCA8\n# define TLS1_CK_ECDHE_ECDSA_WITH_CHACHA20_POLY1305 0x0300CCA9\n# define TLS1_CK_DHE_RSA_WITH_CHACHA20_POLY1305 0x0300CCAA\n# define TLS1_CK_PSK_WITH_CHACHA20_POLY1305 0x0300CCAB\n# define TLS1_CK_ECDHE_PSK_WITH_CHACHA20_POLY1305 0x0300CCAC\n# define TLS1_CK_DHE_PSK_WITH_CHACHA20_POLY1305 0x0300CCAD\n# define TLS1_CK_RSA_PSK_WITH_CHACHA20_POLY1305 0x0300CCAE\n\n/* TLS v1.3 ciphersuites */\n# define TLS1_3_CK_AES_128_GCM_SHA256 0x03001301\n# define TLS1_3_CK_AES_256_GCM_SHA384 0x03001302\n# define TLS1_3_CK_CHACHA20_POLY1305_SHA256 0x03001303\n# define TLS1_3_CK_AES_128_CCM_SHA256 0x03001304\n# define TLS1_3_CK_AES_128_CCM_8_SHA256 0x03001305\n\n/* Aria ciphersuites from RFC6209 */\n# define TLS1_CK_RSA_WITH_ARIA_128_GCM_SHA256 0x0300C050\n# define TLS1_CK_RSA_WITH_ARIA_256_GCM_SHA384 0x0300C051\n# define TLS1_CK_DHE_RSA_WITH_ARIA_128_GCM_SHA256 0x0300C052\n# define TLS1_CK_DHE_RSA_WITH_ARIA_256_GCM_SHA384 0x0300C053\n# define TLS1_CK_DH_RSA_WITH_ARIA_128_GCM_SHA256 0x0300C054\n# define TLS1_CK_DH_RSA_WITH_ARIA_256_GCM_SHA384 0x0300C055\n# define TLS1_CK_DHE_DSS_WITH_ARIA_128_GCM_SHA256 0x0300C056\n# define TLS1_CK_DHE_DSS_WITH_ARIA_256_GCM_SHA384 0x0300C057\n# define TLS1_CK_DH_DSS_WITH_ARIA_128_GCM_SHA256 0x0300C058\n# define TLS1_CK_DH_DSS_WITH_ARIA_256_GCM_SHA384 0x0300C059\n# define TLS1_CK_DH_anon_WITH_ARIA_128_GCM_SHA256 0x0300C05A\n# define TLS1_CK_DH_anon_WITH_ARIA_256_GCM_SHA384 0x0300C05B\n# define TLS1_CK_ECDHE_ECDSA_WITH_ARIA_128_GCM_SHA256 0x0300C05C\n# define TLS1_CK_ECDHE_ECDSA_WITH_ARIA_256_GCM_SHA384 0x0300C05D\n# define TLS1_CK_ECDH_ECDSA_WITH_ARIA_128_GCM_SHA256 0x0300C05E\n# define TLS1_CK_ECDH_ECDSA_WITH_ARIA_256_GCM_SHA384 0x0300C05F\n# define TLS1_CK_ECDHE_RSA_WITH_ARIA_128_GCM_SHA256 0x0300C060\n# define TLS1_CK_ECDHE_RSA_WITH_ARIA_256_GCM_SHA384 0x0300C061\n# define TLS1_CK_ECDH_RSA_WITH_ARIA_128_GCM_SHA256 0x0300C062\n# define TLS1_CK_ECDH_RSA_WITH_ARIA_256_GCM_SHA384 0x0300C063\n# define TLS1_CK_PSK_WITH_ARIA_128_GCM_SHA256 0x0300C06A\n# define TLS1_CK_PSK_WITH_ARIA_256_GCM_SHA384 0x0300C06B\n# define TLS1_CK_DHE_PSK_WITH_ARIA_128_GCM_SHA256 0x0300C06C\n# define TLS1_CK_DHE_PSK_WITH_ARIA_256_GCM_SHA384 0x0300C06D\n# define TLS1_CK_RSA_PSK_WITH_ARIA_128_GCM_SHA256 0x0300C06E\n# define TLS1_CK_RSA_PSK_WITH_ARIA_256_GCM_SHA384 0x0300C06F\n\n/* a bundle of RFC standard cipher names, generated from ssl3_ciphers[] */\n# define TLS1_RFC_RSA_WITH_AES_128_SHA \"TLS_RSA_WITH_AES_128_CBC_SHA\"\n# define TLS1_RFC_DHE_DSS_WITH_AES_128_SHA \"TLS_DHE_DSS_WITH_AES_128_CBC_SHA\"\n# define TLS1_RFC_DHE_RSA_WITH_AES_128_SHA \"TLS_DHE_RSA_WITH_AES_128_CBC_SHA\"\n# define TLS1_RFC_ADH_WITH_AES_128_SHA \"TLS_DH_anon_WITH_AES_128_CBC_SHA\"\n# define TLS1_RFC_RSA_WITH_AES_256_SHA \"TLS_RSA_WITH_AES_256_CBC_SHA\"\n# define TLS1_RFC_DHE_DSS_WITH_AES_256_SHA \"TLS_DHE_DSS_WITH_AES_256_CBC_SHA\"\n# define TLS1_RFC_DHE_RSA_WITH_AES_256_SHA \"TLS_DHE_RSA_WITH_AES_256_CBC_SHA\"\n# define TLS1_RFC_ADH_WITH_AES_256_SHA \"TLS_DH_anon_WITH_AES_256_CBC_SHA\"\n# define TLS1_RFC_RSA_WITH_NULL_SHA256 \"TLS_RSA_WITH_NULL_SHA256\"\n# define TLS1_RFC_RSA_WITH_AES_128_SHA256 \"TLS_RSA_WITH_AES_128_CBC_SHA256\"\n# define TLS1_RFC_RSA_WITH_AES_256_SHA256 \"TLS_RSA_WITH_AES_256_CBC_SHA256\"\n# define TLS1_RFC_DHE_DSS_WITH_AES_128_SHA256 \"TLS_DHE_DSS_WITH_AES_128_CBC_SHA256\"\n# define TLS1_RFC_DHE_RSA_WITH_AES_128_SHA256 \"TLS_DHE_RSA_WITH_AES_128_CBC_SHA256\"\n# define TLS1_RFC_DHE_DSS_WITH_AES_256_SHA256 \"TLS_DHE_DSS_WITH_AES_256_CBC_SHA256\"\n# define TLS1_RFC_DHE_RSA_WITH_AES_256_SHA256 \"TLS_DHE_RSA_WITH_AES_256_CBC_SHA256\"\n# define TLS1_RFC_ADH_WITH_AES_128_SHA256 \"TLS_DH_anon_WITH_AES_128_CBC_SHA256\"\n# define TLS1_RFC_ADH_WITH_AES_256_SHA256 \"TLS_DH_anon_WITH_AES_256_CBC_SHA256\"\n# define TLS1_RFC_RSA_WITH_AES_128_GCM_SHA256 \"TLS_RSA_WITH_AES_128_GCM_SHA256\"\n# define TLS1_RFC_RSA_WITH_AES_256_GCM_SHA384 \"TLS_RSA_WITH_AES_256_GCM_SHA384\"\n# define TLS1_RFC_DHE_RSA_WITH_AES_128_GCM_SHA256 \"TLS_DHE_RSA_WITH_AES_128_GCM_SHA256\"\n# define TLS1_RFC_DHE_RSA_WITH_AES_256_GCM_SHA384 \"TLS_DHE_RSA_WITH_AES_256_GCM_SHA384\"\n# define TLS1_RFC_DHE_DSS_WITH_AES_128_GCM_SHA256 \"TLS_DHE_DSS_WITH_AES_128_GCM_SHA256\"\n# define TLS1_RFC_DHE_DSS_WITH_AES_256_GCM_SHA384 \"TLS_DHE_DSS_WITH_AES_256_GCM_SHA384\"\n# define TLS1_RFC_ADH_WITH_AES_128_GCM_SHA256 \"TLS_DH_anon_WITH_AES_128_GCM_SHA256\"\n# define TLS1_RFC_ADH_WITH_AES_256_GCM_SHA384 \"TLS_DH_anon_WITH_AES_256_GCM_SHA384\"\n# define TLS1_RFC_RSA_WITH_AES_128_CCM \"TLS_RSA_WITH_AES_128_CCM\"\n# define TLS1_RFC_RSA_WITH_AES_256_CCM \"TLS_RSA_WITH_AES_256_CCM\"\n# define TLS1_RFC_DHE_RSA_WITH_AES_128_CCM \"TLS_DHE_RSA_WITH_AES_128_CCM\"\n# define TLS1_RFC_DHE_RSA_WITH_AES_256_CCM \"TLS_DHE_RSA_WITH_AES_256_CCM\"\n# define TLS1_RFC_RSA_WITH_AES_128_CCM_8 \"TLS_RSA_WITH_AES_128_CCM_8\"\n# define TLS1_RFC_RSA_WITH_AES_256_CCM_8 \"TLS_RSA_WITH_AES_256_CCM_8\"\n# define TLS1_RFC_DHE_RSA_WITH_AES_128_CCM_8 \"TLS_DHE_RSA_WITH_AES_128_CCM_8\"\n# define TLS1_RFC_DHE_RSA_WITH_AES_256_CCM_8 \"TLS_DHE_RSA_WITH_AES_256_CCM_8\"\n# define TLS1_RFC_PSK_WITH_AES_128_CCM \"TLS_PSK_WITH_AES_128_CCM\"\n# define TLS1_RFC_PSK_WITH_AES_256_CCM \"TLS_PSK_WITH_AES_256_CCM\"\n# define TLS1_RFC_DHE_PSK_WITH_AES_128_CCM \"TLS_DHE_PSK_WITH_AES_128_CCM\"\n# define TLS1_RFC_DHE_PSK_WITH_AES_256_CCM \"TLS_DHE_PSK_WITH_AES_256_CCM\"\n# define TLS1_RFC_PSK_WITH_AES_128_CCM_8 \"TLS_PSK_WITH_AES_128_CCM_8\"\n# define TLS1_RFC_PSK_WITH_AES_256_CCM_8 \"TLS_PSK_WITH_AES_256_CCM_8\"\n# define TLS1_RFC_DHE_PSK_WITH_AES_128_CCM_8 \"TLS_PSK_DHE_WITH_AES_128_CCM_8\"\n# define TLS1_RFC_DHE_PSK_WITH_AES_256_CCM_8 \"TLS_PSK_DHE_WITH_AES_256_CCM_8\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_AES_128_CCM \"TLS_ECDHE_ECDSA_WITH_AES_128_CCM\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_AES_256_CCM \"TLS_ECDHE_ECDSA_WITH_AES_256_CCM\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_AES_128_CCM_8 \"TLS_ECDHE_ECDSA_WITH_AES_128_CCM_8\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_AES_256_CCM_8 \"TLS_ECDHE_ECDSA_WITH_AES_256_CCM_8\"\n# define TLS1_3_RFC_AES_128_GCM_SHA256 \"TLS_AES_128_GCM_SHA256\"\n# define TLS1_3_RFC_AES_256_GCM_SHA384 \"TLS_AES_256_GCM_SHA384\"\n# define TLS1_3_RFC_CHACHA20_POLY1305_SHA256 \"TLS_CHACHA20_POLY1305_SHA256\"\n# define TLS1_3_RFC_AES_128_CCM_SHA256 \"TLS_AES_128_CCM_SHA256\"\n# define TLS1_3_RFC_AES_128_CCM_8_SHA256 \"TLS_AES_128_CCM_8_SHA256\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_NULL_SHA \"TLS_ECDHE_ECDSA_WITH_NULL_SHA\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_DES_192_CBC3_SHA \"TLS_ECDHE_ECDSA_WITH_3DES_EDE_CBC_SHA\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_AES_128_CBC_SHA \"TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHA\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_AES_256_CBC_SHA \"TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHA\"\n# define TLS1_RFC_ECDHE_RSA_WITH_NULL_SHA \"TLS_ECDHE_RSA_WITH_NULL_SHA\"\n# define TLS1_RFC_ECDHE_RSA_WITH_DES_192_CBC3_SHA \"TLS_ECDHE_RSA_WITH_3DES_EDE_CBC_SHA\"\n# define TLS1_RFC_ECDHE_RSA_WITH_AES_128_CBC_SHA \"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA\"\n# define TLS1_RFC_ECDHE_RSA_WITH_AES_256_CBC_SHA \"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA\"\n# define TLS1_RFC_ECDH_anon_WITH_NULL_SHA \"TLS_ECDH_anon_WITH_NULL_SHA\"\n# define TLS1_RFC_ECDH_anon_WITH_DES_192_CBC3_SHA \"TLS_ECDH_anon_WITH_3DES_EDE_CBC_SHA\"\n# define TLS1_RFC_ECDH_anon_WITH_AES_128_CBC_SHA \"TLS_ECDH_anon_WITH_AES_128_CBC_SHA\"\n# define TLS1_RFC_ECDH_anon_WITH_AES_256_CBC_SHA \"TLS_ECDH_anon_WITH_AES_256_CBC_SHA\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_AES_128_SHA256 \"TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHA256\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_AES_256_SHA384 \"TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHA384\"\n# define TLS1_RFC_ECDHE_RSA_WITH_AES_128_SHA256 \"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256\"\n# define TLS1_RFC_ECDHE_RSA_WITH_AES_256_SHA384 \"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256 \"TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384 \"TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384\"\n# define TLS1_RFC_ECDHE_RSA_WITH_AES_128_GCM_SHA256 \"TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256\"\n# define TLS1_RFC_ECDHE_RSA_WITH_AES_256_GCM_SHA384 \"TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384\"\n# define TLS1_RFC_PSK_WITH_NULL_SHA \"TLS_PSK_WITH_NULL_SHA\"\n# define TLS1_RFC_DHE_PSK_WITH_NULL_SHA \"TLS_DHE_PSK_WITH_NULL_SHA\"\n# define TLS1_RFC_RSA_PSK_WITH_NULL_SHA \"TLS_RSA_PSK_WITH_NULL_SHA\"\n# define TLS1_RFC_PSK_WITH_3DES_EDE_CBC_SHA \"TLS_PSK_WITH_3DES_EDE_CBC_SHA\"\n# define TLS1_RFC_PSK_WITH_AES_128_CBC_SHA \"TLS_PSK_WITH_AES_128_CBC_SHA\"\n# define TLS1_RFC_PSK_WITH_AES_256_CBC_SHA \"TLS_PSK_WITH_AES_256_CBC_SHA\"\n# define TLS1_RFC_DHE_PSK_WITH_3DES_EDE_CBC_SHA \"TLS_DHE_PSK_WITH_3DES_EDE_CBC_SHA\"\n# define TLS1_RFC_DHE_PSK_WITH_AES_128_CBC_SHA \"TLS_DHE_PSK_WITH_AES_128_CBC_SHA\"\n# define TLS1_RFC_DHE_PSK_WITH_AES_256_CBC_SHA \"TLS_DHE_PSK_WITH_AES_256_CBC_SHA\"\n# define TLS1_RFC_RSA_PSK_WITH_3DES_EDE_CBC_SHA \"TLS_RSA_PSK_WITH_3DES_EDE_CBC_SHA\"\n# define TLS1_RFC_RSA_PSK_WITH_AES_128_CBC_SHA \"TLS_RSA_PSK_WITH_AES_128_CBC_SHA\"\n# define TLS1_RFC_RSA_PSK_WITH_AES_256_CBC_SHA \"TLS_RSA_PSK_WITH_AES_256_CBC_SHA\"\n# define TLS1_RFC_PSK_WITH_AES_128_GCM_SHA256 \"TLS_PSK_WITH_AES_128_GCM_SHA256\"\n# define TLS1_RFC_PSK_WITH_AES_256_GCM_SHA384 \"TLS_PSK_WITH_AES_256_GCM_SHA384\"\n# define TLS1_RFC_DHE_PSK_WITH_AES_128_GCM_SHA256 \"TLS_DHE_PSK_WITH_AES_128_GCM_SHA256\"\n# define TLS1_RFC_DHE_PSK_WITH_AES_256_GCM_SHA384 \"TLS_DHE_PSK_WITH_AES_256_GCM_SHA384\"\n# define TLS1_RFC_RSA_PSK_WITH_AES_128_GCM_SHA256 \"TLS_RSA_PSK_WITH_AES_128_GCM_SHA256\"\n# define TLS1_RFC_RSA_PSK_WITH_AES_256_GCM_SHA384 \"TLS_RSA_PSK_WITH_AES_256_GCM_SHA384\"\n# define TLS1_RFC_PSK_WITH_AES_128_CBC_SHA256 \"TLS_PSK_WITH_AES_128_CBC_SHA256\"\n# define TLS1_RFC_PSK_WITH_AES_256_CBC_SHA384 \"TLS_PSK_WITH_AES_256_CBC_SHA384\"\n# define TLS1_RFC_PSK_WITH_NULL_SHA256 \"TLS_PSK_WITH_NULL_SHA256\"\n# define TLS1_RFC_PSK_WITH_NULL_SHA384 \"TLS_PSK_WITH_NULL_SHA384\"\n# define TLS1_RFC_DHE_PSK_WITH_AES_128_CBC_SHA256 \"TLS_DHE_PSK_WITH_AES_128_CBC_SHA256\"\n# define TLS1_RFC_DHE_PSK_WITH_AES_256_CBC_SHA384 \"TLS_DHE_PSK_WITH_AES_256_CBC_SHA384\"\n# define TLS1_RFC_DHE_PSK_WITH_NULL_SHA256 \"TLS_DHE_PSK_WITH_NULL_SHA256\"\n# define TLS1_RFC_DHE_PSK_WITH_NULL_SHA384 \"TLS_DHE_PSK_WITH_NULL_SHA384\"\n# define TLS1_RFC_RSA_PSK_WITH_AES_128_CBC_SHA256 \"TLS_RSA_PSK_WITH_AES_128_CBC_SHA256\"\n# define TLS1_RFC_RSA_PSK_WITH_AES_256_CBC_SHA384 \"TLS_RSA_PSK_WITH_AES_256_CBC_SHA384\"\n# define TLS1_RFC_RSA_PSK_WITH_NULL_SHA256 \"TLS_RSA_PSK_WITH_NULL_SHA256\"\n# define TLS1_RFC_RSA_PSK_WITH_NULL_SHA384 \"TLS_RSA_PSK_WITH_NULL_SHA384\"\n# define TLS1_RFC_ECDHE_PSK_WITH_3DES_EDE_CBC_SHA \"TLS_ECDHE_PSK_WITH_3DES_EDE_CBC_SHA\"\n# define TLS1_RFC_ECDHE_PSK_WITH_AES_128_CBC_SHA \"TLS_ECDHE_PSK_WITH_AES_128_CBC_SHA\"\n# define TLS1_RFC_ECDHE_PSK_WITH_AES_256_CBC_SHA \"TLS_ECDHE_PSK_WITH_AES_256_CBC_SHA\"\n# define TLS1_RFC_ECDHE_PSK_WITH_AES_128_CBC_SHA256 \"TLS_ECDHE_PSK_WITH_AES_128_CBC_SHA256\"\n# define TLS1_RFC_ECDHE_PSK_WITH_AES_256_CBC_SHA384 \"TLS_ECDHE_PSK_WITH_AES_256_CBC_SHA384\"\n# define TLS1_RFC_ECDHE_PSK_WITH_NULL_SHA \"TLS_ECDHE_PSK_WITH_NULL_SHA\"\n# define TLS1_RFC_ECDHE_PSK_WITH_NULL_SHA256 \"TLS_ECDHE_PSK_WITH_NULL_SHA256\"\n# define TLS1_RFC_ECDHE_PSK_WITH_NULL_SHA384 \"TLS_ECDHE_PSK_WITH_NULL_SHA384\"\n# define TLS1_RFC_SRP_SHA_WITH_3DES_EDE_CBC_SHA \"TLS_SRP_SHA_WITH_3DES_EDE_CBC_SHA\"\n# define TLS1_RFC_SRP_SHA_RSA_WITH_3DES_EDE_CBC_SHA \"TLS_SRP_SHA_RSA_WITH_3DES_EDE_CBC_SHA\"\n# define TLS1_RFC_SRP_SHA_DSS_WITH_3DES_EDE_CBC_SHA \"TLS_SRP_SHA_DSS_WITH_3DES_EDE_CBC_SHA\"\n# define TLS1_RFC_SRP_SHA_WITH_AES_128_CBC_SHA \"TLS_SRP_SHA_WITH_AES_128_CBC_SHA\"\n# define TLS1_RFC_SRP_SHA_RSA_WITH_AES_128_CBC_SHA \"TLS_SRP_SHA_RSA_WITH_AES_128_CBC_SHA\"\n# define TLS1_RFC_SRP_SHA_DSS_WITH_AES_128_CBC_SHA \"TLS_SRP_SHA_DSS_WITH_AES_128_CBC_SHA\"\n# define TLS1_RFC_SRP_SHA_WITH_AES_256_CBC_SHA \"TLS_SRP_SHA_WITH_AES_256_CBC_SHA\"\n# define TLS1_RFC_SRP_SHA_RSA_WITH_AES_256_CBC_SHA \"TLS_SRP_SHA_RSA_WITH_AES_256_CBC_SHA\"\n# define TLS1_RFC_SRP_SHA_DSS_WITH_AES_256_CBC_SHA \"TLS_SRP_SHA_DSS_WITH_AES_256_CBC_SHA\"\n# define TLS1_RFC_DHE_RSA_WITH_CHACHA20_POLY1305 \"TLS_DHE_RSA_WITH_CHACHA20_POLY1305_SHA256\"\n# define TLS1_RFC_ECDHE_RSA_WITH_CHACHA20_POLY1305 \"TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_CHACHA20_POLY1305 \"TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256\"\n# define TLS1_RFC_PSK_WITH_CHACHA20_POLY1305 \"TLS_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n# define TLS1_RFC_ECDHE_PSK_WITH_CHACHA20_POLY1305 \"TLS_ECDHE_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n# define TLS1_RFC_DHE_PSK_WITH_CHACHA20_POLY1305 \"TLS_DHE_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n# define TLS1_RFC_RSA_PSK_WITH_CHACHA20_POLY1305 \"TLS_RSA_PSK_WITH_CHACHA20_POLY1305_SHA256\"\n# define TLS1_RFC_RSA_WITH_CAMELLIA_128_CBC_SHA256 \"TLS_RSA_WITH_CAMELLIA_128_CBC_SHA256\"\n# define TLS1_RFC_DHE_DSS_WITH_CAMELLIA_128_CBC_SHA256 \"TLS_DHE_DSS_WITH_CAMELLIA_128_CBC_SHA256\"\n# define TLS1_RFC_DHE_RSA_WITH_CAMELLIA_128_CBC_SHA256 \"TLS_DHE_RSA_WITH_CAMELLIA_128_CBC_SHA256\"\n# define TLS1_RFC_ADH_WITH_CAMELLIA_128_CBC_SHA256 \"TLS_DH_anon_WITH_CAMELLIA_128_CBC_SHA256\"\n# define TLS1_RFC_RSA_WITH_CAMELLIA_256_CBC_SHA256 \"TLS_RSA_WITH_CAMELLIA_256_CBC_SHA256\"\n# define TLS1_RFC_DHE_DSS_WITH_CAMELLIA_256_CBC_SHA256 \"TLS_DHE_DSS_WITH_CAMELLIA_256_CBC_SHA256\"\n# define TLS1_RFC_DHE_RSA_WITH_CAMELLIA_256_CBC_SHA256 \"TLS_DHE_RSA_WITH_CAMELLIA_256_CBC_SHA256\"\n# define TLS1_RFC_ADH_WITH_CAMELLIA_256_CBC_SHA256 \"TLS_DH_anon_WITH_CAMELLIA_256_CBC_SHA256\"\n# define TLS1_RFC_RSA_WITH_CAMELLIA_256_CBC_SHA \"TLS_RSA_WITH_CAMELLIA_256_CBC_SHA\"\n# define TLS1_RFC_DHE_DSS_WITH_CAMELLIA_256_CBC_SHA \"TLS_DHE_DSS_WITH_CAMELLIA_256_CBC_SHA\"\n# define TLS1_RFC_DHE_RSA_WITH_CAMELLIA_256_CBC_SHA \"TLS_DHE_RSA_WITH_CAMELLIA_256_CBC_SHA\"\n# define TLS1_RFC_ADH_WITH_CAMELLIA_256_CBC_SHA \"TLS_DH_anon_WITH_CAMELLIA_256_CBC_SHA\"\n# define TLS1_RFC_RSA_WITH_CAMELLIA_128_CBC_SHA \"TLS_RSA_WITH_CAMELLIA_128_CBC_SHA\"\n# define TLS1_RFC_DHE_DSS_WITH_CAMELLIA_128_CBC_SHA \"TLS_DHE_DSS_WITH_CAMELLIA_128_CBC_SHA\"\n# define TLS1_RFC_DHE_RSA_WITH_CAMELLIA_128_CBC_SHA \"TLS_DHE_RSA_WITH_CAMELLIA_128_CBC_SHA\"\n# define TLS1_RFC_ADH_WITH_CAMELLIA_128_CBC_SHA \"TLS_DH_anon_WITH_CAMELLIA_128_CBC_SHA\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_CAMELLIA_128_CBC_SHA256 \"TLS_ECDHE_ECDSA_WITH_CAMELLIA_128_CBC_SHA256\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_CAMELLIA_256_CBC_SHA384 \"TLS_ECDHE_ECDSA_WITH_CAMELLIA_256_CBC_SHA384\"\n# define TLS1_RFC_ECDHE_RSA_WITH_CAMELLIA_128_CBC_SHA256 \"TLS_ECDHE_RSA_WITH_CAMELLIA_128_CBC_SHA256\"\n# define TLS1_RFC_ECDHE_RSA_WITH_CAMELLIA_256_CBC_SHA384 \"TLS_ECDHE_RSA_WITH_CAMELLIA_256_CBC_SHA384\"\n# define TLS1_RFC_PSK_WITH_CAMELLIA_128_CBC_SHA256 \"TLS_PSK_WITH_CAMELLIA_128_CBC_SHA256\"\n# define TLS1_RFC_PSK_WITH_CAMELLIA_256_CBC_SHA384 \"TLS_PSK_WITH_CAMELLIA_256_CBC_SHA384\"\n# define TLS1_RFC_DHE_PSK_WITH_CAMELLIA_128_CBC_SHA256 \"TLS_DHE_PSK_WITH_CAMELLIA_128_CBC_SHA256\"\n# define TLS1_RFC_DHE_PSK_WITH_CAMELLIA_256_CBC_SHA384 \"TLS_DHE_PSK_WITH_CAMELLIA_256_CBC_SHA384\"\n# define TLS1_RFC_RSA_PSK_WITH_CAMELLIA_128_CBC_SHA256 \"TLS_RSA_PSK_WITH_CAMELLIA_128_CBC_SHA256\"\n# define TLS1_RFC_RSA_PSK_WITH_CAMELLIA_256_CBC_SHA384 \"TLS_RSA_PSK_WITH_CAMELLIA_256_CBC_SHA384\"\n# define TLS1_RFC_ECDHE_PSK_WITH_CAMELLIA_128_CBC_SHA256 \"TLS_ECDHE_PSK_WITH_CAMELLIA_128_CBC_SHA256\"\n# define TLS1_RFC_ECDHE_PSK_WITH_CAMELLIA_256_CBC_SHA384 \"TLS_ECDHE_PSK_WITH_CAMELLIA_256_CBC_SHA384\"\n# define TLS1_RFC_RSA_WITH_SEED_SHA \"TLS_RSA_WITH_SEED_CBC_SHA\"\n# define TLS1_RFC_DHE_DSS_WITH_SEED_SHA \"TLS_DHE_DSS_WITH_SEED_CBC_SHA\"\n# define TLS1_RFC_DHE_RSA_WITH_SEED_SHA \"TLS_DHE_RSA_WITH_SEED_CBC_SHA\"\n# define TLS1_RFC_ADH_WITH_SEED_SHA \"TLS_DH_anon_WITH_SEED_CBC_SHA\"\n# define TLS1_RFC_ECDHE_PSK_WITH_RC4_128_SHA \"TLS_ECDHE_PSK_WITH_RC4_128_SHA\"\n# define TLS1_RFC_ECDH_anon_WITH_RC4_128_SHA \"TLS_ECDH_anon_WITH_RC4_128_SHA\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_RC4_128_SHA \"TLS_ECDHE_ECDSA_WITH_RC4_128_SHA\"\n# define TLS1_RFC_ECDHE_RSA_WITH_RC4_128_SHA \"TLS_ECDHE_RSA_WITH_RC4_128_SHA\"\n# define TLS1_RFC_PSK_WITH_RC4_128_SHA \"TLS_PSK_WITH_RC4_128_SHA\"\n# define TLS1_RFC_RSA_PSK_WITH_RC4_128_SHA \"TLS_RSA_PSK_WITH_RC4_128_SHA\"\n# define TLS1_RFC_DHE_PSK_WITH_RC4_128_SHA \"TLS_DHE_PSK_WITH_RC4_128_SHA\"\n# define TLS1_RFC_RSA_WITH_ARIA_128_GCM_SHA256 \"TLS_RSA_WITH_ARIA_128_GCM_SHA256\"\n# define TLS1_RFC_RSA_WITH_ARIA_256_GCM_SHA384 \"TLS_RSA_WITH_ARIA_256_GCM_SHA384\"\n# define TLS1_RFC_DHE_RSA_WITH_ARIA_128_GCM_SHA256 \"TLS_DHE_RSA_WITH_ARIA_128_GCM_SHA256\"\n# define TLS1_RFC_DHE_RSA_WITH_ARIA_256_GCM_SHA384 \"TLS_DHE_RSA_WITH_ARIA_256_GCM_SHA384\"\n# define TLS1_RFC_DH_RSA_WITH_ARIA_128_GCM_SHA256 \"TLS_DH_RSA_WITH_ARIA_128_GCM_SHA256\"\n# define TLS1_RFC_DH_RSA_WITH_ARIA_256_GCM_SHA384 \"TLS_DH_RSA_WITH_ARIA_256_GCM_SHA384\"\n# define TLS1_RFC_DHE_DSS_WITH_ARIA_128_GCM_SHA256 \"TLS_DHE_DSS_WITH_ARIA_128_GCM_SHA256\"\n# define TLS1_RFC_DHE_DSS_WITH_ARIA_256_GCM_SHA384 \"TLS_DHE_DSS_WITH_ARIA_256_GCM_SHA384\"\n# define TLS1_RFC_DH_DSS_WITH_ARIA_128_GCM_SHA256 \"TLS_DH_DSS_WITH_ARIA_128_GCM_SHA256\"\n# define TLS1_RFC_DH_DSS_WITH_ARIA_256_GCM_SHA384 \"TLS_DH_DSS_WITH_ARIA_256_GCM_SHA384\"\n# define TLS1_RFC_DH_anon_WITH_ARIA_128_GCM_SHA256 \"TLS_DH_anon_WITH_ARIA_128_GCM_SHA256\"\n# define TLS1_RFC_DH_anon_WITH_ARIA_256_GCM_SHA384 \"TLS_DH_anon_WITH_ARIA_256_GCM_SHA384\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_ARIA_128_GCM_SHA256 \"TLS_ECDHE_ECDSA_WITH_ARIA_128_GCM_SHA256\"\n# define TLS1_RFC_ECDHE_ECDSA_WITH_ARIA_256_GCM_SHA384 \"TLS_ECDHE_ECDSA_WITH_ARIA_256_GCM_SHA384\"\n# define TLS1_RFC_ECDH_ECDSA_WITH_ARIA_128_GCM_SHA256 \"TLS_ECDH_ECDSA_WITH_ARIA_128_GCM_SHA256\"\n# define TLS1_RFC_ECDH_ECDSA_WITH_ARIA_256_GCM_SHA384 \"TLS_ECDH_ECDSA_WITH_ARIA_256_GCM_SHA384\"\n# define TLS1_RFC_ECDHE_RSA_WITH_ARIA_128_GCM_SHA256 \"TLS_ECDHE_RSA_WITH_ARIA_128_GCM_SHA256\"\n# define TLS1_RFC_ECDHE_RSA_WITH_ARIA_256_GCM_SHA384 \"TLS_ECDHE_RSA_WITH_ARIA_256_GCM_SHA384\"\n# define TLS1_RFC_ECDH_RSA_WITH_ARIA_128_GCM_SHA256 \"TLS_ECDH_RSA_WITH_ARIA_128_GCM_SHA256\"\n# define TLS1_RFC_ECDH_RSA_WITH_ARIA_256_GCM_SHA384 \"TLS_ECDH_RSA_WITH_ARIA_256_GCM_SHA384\"\n# define TLS1_RFC_PSK_WITH_ARIA_128_GCM_SHA256 \"TLS_PSK_WITH_ARIA_128_GCM_SHA256\"\n# define TLS1_RFC_PSK_WITH_ARIA_256_GCM_SHA384 \"TLS_PSK_WITH_ARIA_256_GCM_SHA384\"\n# define TLS1_RFC_DHE_PSK_WITH_ARIA_128_GCM_SHA256 \"TLS_DHE_PSK_WITH_ARIA_128_GCM_SHA256\"\n# define TLS1_RFC_DHE_PSK_WITH_ARIA_256_GCM_SHA384 \"TLS_DHE_PSK_WITH_ARIA_256_GCM_SHA384\"\n# define TLS1_RFC_RSA_PSK_WITH_ARIA_128_GCM_SHA256 \"TLS_RSA_PSK_WITH_ARIA_128_GCM_SHA256\"\n# define TLS1_RFC_RSA_PSK_WITH_ARIA_256_GCM_SHA384 \"TLS_RSA_PSK_WITH_ARIA_256_GCM_SHA384\"\n\n\n/*\n * XXX Backward compatibility alert: Older versions of OpenSSL gave some DHE\n * ciphers names with \"EDH\" instead of \"DHE\". Going forward, we should be\n * using DHE everywhere, though we may indefinitely maintain aliases for\n * users or configurations that used \"EDH\"\n */\n# define TLS1_TXT_DHE_DSS_WITH_RC4_128_SHA \"DHE-DSS-RC4-SHA\"\n\n# define TLS1_TXT_PSK_WITH_NULL_SHA \"PSK-NULL-SHA\"\n# define TLS1_TXT_DHE_PSK_WITH_NULL_SHA \"DHE-PSK-NULL-SHA\"\n# define TLS1_TXT_RSA_PSK_WITH_NULL_SHA \"RSA-PSK-NULL-SHA\"\n\n/* AES ciphersuites from RFC3268 */\n# define TLS1_TXT_RSA_WITH_AES_128_SHA \"AES128-SHA\"\n# define TLS1_TXT_DH_DSS_WITH_AES_128_SHA \"DH-DSS-AES128-SHA\"\n# define TLS1_TXT_DH_RSA_WITH_AES_128_SHA \"DH-RSA-AES128-SHA\"\n# define TLS1_TXT_DHE_DSS_WITH_AES_128_SHA \"DHE-DSS-AES128-SHA\"\n# define TLS1_TXT_DHE_RSA_WITH_AES_128_SHA \"DHE-RSA-AES128-SHA\"\n# define TLS1_TXT_ADH_WITH_AES_128_SHA \"ADH-AES128-SHA\"\n\n# define TLS1_TXT_RSA_WITH_AES_256_SHA \"AES256-SHA\"\n# define TLS1_TXT_DH_DSS_WITH_AES_256_SHA \"DH-DSS-AES256-SHA\"\n# define TLS1_TXT_DH_RSA_WITH_AES_256_SHA \"DH-RSA-AES256-SHA\"\n# define TLS1_TXT_DHE_DSS_WITH_AES_256_SHA \"DHE-DSS-AES256-SHA\"\n# define TLS1_TXT_DHE_RSA_WITH_AES_256_SHA \"DHE-RSA-AES256-SHA\"\n# define TLS1_TXT_ADH_WITH_AES_256_SHA \"ADH-AES256-SHA\"\n\n/* ECC ciphersuites from RFC4492 */\n# define TLS1_TXT_ECDH_ECDSA_WITH_NULL_SHA \"ECDH-ECDSA-NULL-SHA\"\n# define TLS1_TXT_ECDH_ECDSA_WITH_RC4_128_SHA \"ECDH-ECDSA-RC4-SHA\"\n# define TLS1_TXT_ECDH_ECDSA_WITH_DES_192_CBC3_SHA \"ECDH-ECDSA-DES-CBC3-SHA\"\n# define TLS1_TXT_ECDH_ECDSA_WITH_AES_128_CBC_SHA \"ECDH-ECDSA-AES128-SHA\"\n# define TLS1_TXT_ECDH_ECDSA_WITH_AES_256_CBC_SHA \"ECDH-ECDSA-AES256-SHA\"\n\n# define TLS1_TXT_ECDHE_ECDSA_WITH_NULL_SHA \"ECDHE-ECDSA-NULL-SHA\"\n# define TLS1_TXT_ECDHE_ECDSA_WITH_RC4_128_SHA \"ECDHE-ECDSA-RC4-SHA\"\n# define TLS1_TXT_ECDHE_ECDSA_WITH_DES_192_CBC3_SHA \"ECDHE-ECDSA-DES-CBC3-SHA\"\n# define TLS1_TXT_ECDHE_ECDSA_WITH_AES_128_CBC_SHA \"ECDHE-ECDSA-AES128-SHA\"\n# define TLS1_TXT_ECDHE_ECDSA_WITH_AES_256_CBC_SHA \"ECDHE-ECDSA-AES256-SHA\"\n\n# define TLS1_TXT_ECDH_RSA_WITH_NULL_SHA \"ECDH-RSA-NULL-SHA\"\n# define TLS1_TXT_ECDH_RSA_WITH_RC4_128_SHA \"ECDH-RSA-RC4-SHA\"\n# define TLS1_TXT_ECDH_RSA_WITH_DES_192_CBC3_SHA \"ECDH-RSA-DES-CBC3-SHA\"\n# define TLS1_TXT_ECDH_RSA_WITH_AES_128_CBC_SHA \"ECDH-RSA-AES128-SHA\"\n# define TLS1_TXT_ECDH_RSA_WITH_AES_256_CBC_SHA \"ECDH-RSA-AES256-SHA\"\n\n# define TLS1_TXT_ECDHE_RSA_WITH_NULL_SHA \"ECDHE-RSA-NULL-SHA\"\n# define TLS1_TXT_ECDHE_RSA_WITH_RC4_128_SHA \"ECDHE-RSA-RC4-SHA\"\n# define TLS1_TXT_ECDHE_RSA_WITH_DES_192_CBC3_SHA \"ECDHE-RSA-DES-CBC3-SHA\"\n# define TLS1_TXT_ECDHE_RSA_WITH_AES_128_CBC_SHA \"ECDHE-RSA-AES128-SHA\"\n# define TLS1_TXT_ECDHE_RSA_WITH_AES_256_CBC_SHA \"ECDHE-RSA-AES256-SHA\"\n\n# define TLS1_TXT_ECDH_anon_WITH_NULL_SHA \"AECDH-NULL-SHA\"\n# define TLS1_TXT_ECDH_anon_WITH_RC4_128_SHA \"AECDH-RC4-SHA\"\n# define TLS1_TXT_ECDH_anon_WITH_DES_192_CBC3_SHA \"AECDH-DES-CBC3-SHA\"\n# define TLS1_TXT_ECDH_anon_WITH_AES_128_CBC_SHA \"AECDH-AES128-SHA\"\n# define TLS1_TXT_ECDH_anon_WITH_AES_256_CBC_SHA \"AECDH-AES256-SHA\"\n\n/* PSK ciphersuites from RFC 4279 */\n# define TLS1_TXT_PSK_WITH_RC4_128_SHA \"PSK-RC4-SHA\"\n# define TLS1_TXT_PSK_WITH_3DES_EDE_CBC_SHA \"PSK-3DES-EDE-CBC-SHA\"\n# define TLS1_TXT_PSK_WITH_AES_128_CBC_SHA \"PSK-AES128-CBC-SHA\"\n# define TLS1_TXT_PSK_WITH_AES_256_CBC_SHA \"PSK-AES256-CBC-SHA\"\n\n# define TLS1_TXT_DHE_PSK_WITH_RC4_128_SHA \"DHE-PSK-RC4-SHA\"\n# define TLS1_TXT_DHE_PSK_WITH_3DES_EDE_CBC_SHA \"DHE-PSK-3DES-EDE-CBC-SHA\"\n# define TLS1_TXT_DHE_PSK_WITH_AES_128_CBC_SHA \"DHE-PSK-AES128-CBC-SHA\"\n# define TLS1_TXT_DHE_PSK_WITH_AES_256_CBC_SHA \"DHE-PSK-AES256-CBC-SHA\"\n# define TLS1_TXT_RSA_PSK_WITH_RC4_128_SHA \"RSA-PSK-RC4-SHA\"\n# define TLS1_TXT_RSA_PSK_WITH_3DES_EDE_CBC_SHA \"RSA-PSK-3DES-EDE-CBC-SHA\"\n# define TLS1_TXT_RSA_PSK_WITH_AES_128_CBC_SHA \"RSA-PSK-AES128-CBC-SHA\"\n# define TLS1_TXT_RSA_PSK_WITH_AES_256_CBC_SHA \"RSA-PSK-AES256-CBC-SHA\"\n\n/* PSK ciphersuites from RFC 5487 */\n# define TLS1_TXT_PSK_WITH_AES_128_GCM_SHA256 \"PSK-AES128-GCM-SHA256\"\n# define TLS1_TXT_PSK_WITH_AES_256_GCM_SHA384 \"PSK-AES256-GCM-SHA384\"\n# define TLS1_TXT_DHE_PSK_WITH_AES_128_GCM_SHA256 \"DHE-PSK-AES128-GCM-SHA256\"\n# define TLS1_TXT_DHE_PSK_WITH_AES_256_GCM_SHA384 \"DHE-PSK-AES256-GCM-SHA384\"\n# define TLS1_TXT_RSA_PSK_WITH_AES_128_GCM_SHA256 \"RSA-PSK-AES128-GCM-SHA256\"\n# define TLS1_TXT_RSA_PSK_WITH_AES_256_GCM_SHA384 \"RSA-PSK-AES256-GCM-SHA384\"\n\n# define TLS1_TXT_PSK_WITH_AES_128_CBC_SHA256 \"PSK-AES128-CBC-SHA256\"\n# define TLS1_TXT_PSK_WITH_AES_256_CBC_SHA384 \"PSK-AES256-CBC-SHA384\"\n# define TLS1_TXT_PSK_WITH_NULL_SHA256 \"PSK-NULL-SHA256\"\n# define TLS1_TXT_PSK_WITH_NULL_SHA384 \"PSK-NULL-SHA384\"\n\n# define TLS1_TXT_DHE_PSK_WITH_AES_128_CBC_SHA256 \"DHE-PSK-AES128-CBC-SHA256\"\n# define TLS1_TXT_DHE_PSK_WITH_AES_256_CBC_SHA384 \"DHE-PSK-AES256-CBC-SHA384\"\n# define TLS1_TXT_DHE_PSK_WITH_NULL_SHA256 \"DHE-PSK-NULL-SHA256\"\n# define TLS1_TXT_DHE_PSK_WITH_NULL_SHA384 \"DHE-PSK-NULL-SHA384\"\n\n# define TLS1_TXT_RSA_PSK_WITH_AES_128_CBC_SHA256 \"RSA-PSK-AES128-CBC-SHA256\"\n# define TLS1_TXT_RSA_PSK_WITH_AES_256_CBC_SHA384 \"RSA-PSK-AES256-CBC-SHA384\"\n# define TLS1_TXT_RSA_PSK_WITH_NULL_SHA256 \"RSA-PSK-NULL-SHA256\"\n# define TLS1_TXT_RSA_PSK_WITH_NULL_SHA384 \"RSA-PSK-NULL-SHA384\"\n\n/* SRP ciphersuite from RFC 5054 */\n# define TLS1_TXT_SRP_SHA_WITH_3DES_EDE_CBC_SHA \"SRP-3DES-EDE-CBC-SHA\"\n# define TLS1_TXT_SRP_SHA_RSA_WITH_3DES_EDE_CBC_SHA \"SRP-RSA-3DES-EDE-CBC-SHA\"\n# define TLS1_TXT_SRP_SHA_DSS_WITH_3DES_EDE_CBC_SHA \"SRP-DSS-3DES-EDE-CBC-SHA\"\n# define TLS1_TXT_SRP_SHA_WITH_AES_128_CBC_SHA \"SRP-AES-128-CBC-SHA\"\n# define TLS1_TXT_SRP_SHA_RSA_WITH_AES_128_CBC_SHA \"SRP-RSA-AES-128-CBC-SHA\"\n# define TLS1_TXT_SRP_SHA_DSS_WITH_AES_128_CBC_SHA \"SRP-DSS-AES-128-CBC-SHA\"\n# define TLS1_TXT_SRP_SHA_WITH_AES_256_CBC_SHA \"SRP-AES-256-CBC-SHA\"\n# define TLS1_TXT_SRP_SHA_RSA_WITH_AES_256_CBC_SHA \"SRP-RSA-AES-256-CBC-SHA\"\n# define TLS1_TXT_SRP_SHA_DSS_WITH_AES_256_CBC_SHA \"SRP-DSS-AES-256-CBC-SHA\"\n\n/* Camellia ciphersuites from RFC4132 */\n# define TLS1_TXT_RSA_WITH_CAMELLIA_128_CBC_SHA \"CAMELLIA128-SHA\"\n# define TLS1_TXT_DH_DSS_WITH_CAMELLIA_128_CBC_SHA \"DH-DSS-CAMELLIA128-SHA\"\n# define TLS1_TXT_DH_RSA_WITH_CAMELLIA_128_CBC_SHA \"DH-RSA-CAMELLIA128-SHA\"\n# define TLS1_TXT_DHE_DSS_WITH_CAMELLIA_128_CBC_SHA \"DHE-DSS-CAMELLIA128-SHA\"\n# define TLS1_TXT_DHE_RSA_WITH_CAMELLIA_128_CBC_SHA \"DHE-RSA-CAMELLIA128-SHA\"\n# define TLS1_TXT_ADH_WITH_CAMELLIA_128_CBC_SHA \"ADH-CAMELLIA128-SHA\"\n\n# define TLS1_TXT_RSA_WITH_CAMELLIA_256_CBC_SHA \"CAMELLIA256-SHA\"\n# define TLS1_TXT_DH_DSS_WITH_CAMELLIA_256_CBC_SHA \"DH-DSS-CAMELLIA256-SHA\"\n# define TLS1_TXT_DH_RSA_WITH_CAMELLIA_256_CBC_SHA \"DH-RSA-CAMELLIA256-SHA\"\n# define TLS1_TXT_DHE_DSS_WITH_CAMELLIA_256_CBC_SHA \"DHE-DSS-CAMELLIA256-SHA\"\n# define TLS1_TXT_DHE_RSA_WITH_CAMELLIA_256_CBC_SHA \"DHE-RSA-CAMELLIA256-SHA\"\n# define TLS1_TXT_ADH_WITH_CAMELLIA_256_CBC_SHA \"ADH-CAMELLIA256-SHA\"\n\n/* TLS 1.2 Camellia SHA-256 ciphersuites from RFC5932 */\n# define TLS1_TXT_RSA_WITH_CAMELLIA_128_CBC_SHA256 \"CAMELLIA128-SHA256\"\n# define TLS1_TXT_DH_DSS_WITH_CAMELLIA_128_CBC_SHA256 \"DH-DSS-CAMELLIA128-SHA256\"\n# define TLS1_TXT_DH_RSA_WITH_CAMELLIA_128_CBC_SHA256 \"DH-RSA-CAMELLIA128-SHA256\"\n# define TLS1_TXT_DHE_DSS_WITH_CAMELLIA_128_CBC_SHA256 \"DHE-DSS-CAMELLIA128-SHA256\"\n# define TLS1_TXT_DHE_RSA_WITH_CAMELLIA_128_CBC_SHA256 \"DHE-RSA-CAMELLIA128-SHA256\"\n# define TLS1_TXT_ADH_WITH_CAMELLIA_128_CBC_SHA256 \"ADH-CAMELLIA128-SHA256\"\n\n# define TLS1_TXT_RSA_WITH_CAMELLIA_256_CBC_SHA256 \"CAMELLIA256-SHA256\"\n# define TLS1_TXT_DH_DSS_WITH_CAMELLIA_256_CBC_SHA256 \"DH-DSS-CAMELLIA256-SHA256\"\n# define TLS1_TXT_DH_RSA_WITH_CAMELLIA_256_CBC_SHA256 \"DH-RSA-CAMELLIA256-SHA256\"\n# define TLS1_TXT_DHE_DSS_WITH_CAMELLIA_256_CBC_SHA256 \"DHE-DSS-CAMELLIA256-SHA256\"\n# define TLS1_TXT_DHE_RSA_WITH_CAMELLIA_256_CBC_SHA256 \"DHE-RSA-CAMELLIA256-SHA256\"\n# define TLS1_TXT_ADH_WITH_CAMELLIA_256_CBC_SHA256 \"ADH-CAMELLIA256-SHA256\"\n\n# define TLS1_TXT_PSK_WITH_CAMELLIA_128_CBC_SHA256 \"PSK-CAMELLIA128-SHA256\"\n# define TLS1_TXT_PSK_WITH_CAMELLIA_256_CBC_SHA384 \"PSK-CAMELLIA256-SHA384\"\n# define TLS1_TXT_DHE_PSK_WITH_CAMELLIA_128_CBC_SHA256 \"DHE-PSK-CAMELLIA128-SHA256\"\n# define TLS1_TXT_DHE_PSK_WITH_CAMELLIA_256_CBC_SHA384 \"DHE-PSK-CAMELLIA256-SHA384\"\n# define TLS1_TXT_RSA_PSK_WITH_CAMELLIA_128_CBC_SHA256 \"RSA-PSK-CAMELLIA128-SHA256\"\n# define TLS1_TXT_RSA_PSK_WITH_CAMELLIA_256_CBC_SHA384 \"RSA-PSK-CAMELLIA256-SHA384\"\n# define TLS1_TXT_ECDHE_PSK_WITH_CAMELLIA_128_CBC_SHA256 \"ECDHE-PSK-CAMELLIA128-SHA256\"\n# define TLS1_TXT_ECDHE_PSK_WITH_CAMELLIA_256_CBC_SHA384 \"ECDHE-PSK-CAMELLIA256-SHA384\"\n\n/* SEED ciphersuites from RFC4162 */\n# define TLS1_TXT_RSA_WITH_SEED_SHA \"SEED-SHA\"\n# define TLS1_TXT_DH_DSS_WITH_SEED_SHA \"DH-DSS-SEED-SHA\"\n# define TLS1_TXT_DH_RSA_WITH_SEED_SHA \"DH-RSA-SEED-SHA\"\n# define TLS1_TXT_DHE_DSS_WITH_SEED_SHA \"DHE-DSS-SEED-SHA\"\n# define TLS1_TXT_DHE_RSA_WITH_SEED_SHA \"DHE-RSA-SEED-SHA\"\n# define TLS1_TXT_ADH_WITH_SEED_SHA \"ADH-SEED-SHA\"\n\n/* TLS v1.2 ciphersuites */\n# define TLS1_TXT_RSA_WITH_NULL_SHA256 \"NULL-SHA256\"\n# define TLS1_TXT_RSA_WITH_AES_128_SHA256 \"AES128-SHA256\"\n# define TLS1_TXT_RSA_WITH_AES_256_SHA256 \"AES256-SHA256\"\n# define TLS1_TXT_DH_DSS_WITH_AES_128_SHA256 \"DH-DSS-AES128-SHA256\"\n# define TLS1_TXT_DH_RSA_WITH_AES_128_SHA256 \"DH-RSA-AES128-SHA256\"\n# define TLS1_TXT_DHE_DSS_WITH_AES_128_SHA256 \"DHE-DSS-AES128-SHA256\"\n# define TLS1_TXT_DHE_RSA_WITH_AES_128_SHA256 \"DHE-RSA-AES128-SHA256\"\n# define TLS1_TXT_DH_DSS_WITH_AES_256_SHA256 \"DH-DSS-AES256-SHA256\"\n# define TLS1_TXT_DH_RSA_WITH_AES_256_SHA256 \"DH-RSA-AES256-SHA256\"\n# define TLS1_TXT_DHE_DSS_WITH_AES_256_SHA256 \"DHE-DSS-AES256-SHA256\"\n# define TLS1_TXT_DHE_RSA_WITH_AES_256_SHA256 \"DHE-RSA-AES256-SHA256\"\n# define TLS1_TXT_ADH_WITH_AES_128_SHA256 \"ADH-AES128-SHA256\"\n# define TLS1_TXT_ADH_WITH_AES_256_SHA256 \"ADH-AES256-SHA256\"\n\n/* TLS v1.2 GCM ciphersuites from RFC5288 */\n# define TLS1_TXT_RSA_WITH_AES_128_GCM_SHA256 \"AES128-GCM-SHA256\"\n# define TLS1_TXT_RSA_WITH_AES_256_GCM_SHA384 \"AES256-GCM-SHA384\"\n# define TLS1_TXT_DHE_RSA_WITH_AES_128_GCM_SHA256 \"DHE-RSA-AES128-GCM-SHA256\"\n# define TLS1_TXT_DHE_RSA_WITH_AES_256_GCM_SHA384 \"DHE-RSA-AES256-GCM-SHA384\"\n# define TLS1_TXT_DH_RSA_WITH_AES_128_GCM_SHA256 \"DH-RSA-AES128-GCM-SHA256\"\n# define TLS1_TXT_DH_RSA_WITH_AES_256_GCM_SHA384 \"DH-RSA-AES256-GCM-SHA384\"\n# define TLS1_TXT_DHE_DSS_WITH_AES_128_GCM_SHA256 \"DHE-DSS-AES128-GCM-SHA256\"\n# define TLS1_TXT_DHE_DSS_WITH_AES_256_GCM_SHA384 \"DHE-DSS-AES256-GCM-SHA384\"\n# define TLS1_TXT_DH_DSS_WITH_AES_128_GCM_SHA256 \"DH-DSS-AES128-GCM-SHA256\"\n# define TLS1_TXT_DH_DSS_WITH_AES_256_GCM_SHA384 \"DH-DSS-AES256-GCM-SHA384\"\n# define TLS1_TXT_ADH_WITH_AES_128_GCM_SHA256 \"ADH-AES128-GCM-SHA256\"\n# define TLS1_TXT_ADH_WITH_AES_256_GCM_SHA384 \"ADH-AES256-GCM-SHA384\"\n\n/* CCM ciphersuites from RFC6655 */\n# define TLS1_TXT_RSA_WITH_AES_128_CCM \"AES128-CCM\"\n# define TLS1_TXT_RSA_WITH_AES_256_CCM \"AES256-CCM\"\n# define TLS1_TXT_DHE_RSA_WITH_AES_128_CCM \"DHE-RSA-AES128-CCM\"\n# define TLS1_TXT_DHE_RSA_WITH_AES_256_CCM \"DHE-RSA-AES256-CCM\"\n\n# define TLS1_TXT_RSA_WITH_AES_128_CCM_8 \"AES128-CCM8\"\n# define TLS1_TXT_RSA_WITH_AES_256_CCM_8 \"AES256-CCM8\"\n# define TLS1_TXT_DHE_RSA_WITH_AES_128_CCM_8 \"DHE-RSA-AES128-CCM8\"\n# define TLS1_TXT_DHE_RSA_WITH_AES_256_CCM_8 \"DHE-RSA-AES256-CCM8\"\n\n# define TLS1_TXT_PSK_WITH_AES_128_CCM \"PSK-AES128-CCM\"\n# define TLS1_TXT_PSK_WITH_AES_256_CCM \"PSK-AES256-CCM\"\n# define TLS1_TXT_DHE_PSK_WITH_AES_128_CCM \"DHE-PSK-AES128-CCM\"\n# define TLS1_TXT_DHE_PSK_WITH_AES_256_CCM \"DHE-PSK-AES256-CCM\"\n\n# define TLS1_TXT_PSK_WITH_AES_128_CCM_8 \"PSK-AES128-CCM8\"\n# define TLS1_TXT_PSK_WITH_AES_256_CCM_8 \"PSK-AES256-CCM8\"\n# define TLS1_TXT_DHE_PSK_WITH_AES_128_CCM_8 \"DHE-PSK-AES128-CCM8\"\n# define TLS1_TXT_DHE_PSK_WITH_AES_256_CCM_8 \"DHE-PSK-AES256-CCM8\"\n\n/* CCM ciphersuites from RFC7251 */\n# define TLS1_TXT_ECDHE_ECDSA_WITH_AES_128_CCM \"ECDHE-ECDSA-AES128-CCM\"\n# define TLS1_TXT_ECDHE_ECDSA_WITH_AES_256_CCM \"ECDHE-ECDSA-AES256-CCM\"\n# define TLS1_TXT_ECDHE_ECDSA_WITH_AES_128_CCM_8 \"ECDHE-ECDSA-AES128-CCM8\"\n# define TLS1_TXT_ECDHE_ECDSA_WITH_AES_256_CCM_8 \"ECDHE-ECDSA-AES256-CCM8\"\n\n/* ECDH HMAC based ciphersuites from RFC5289 */\n# define TLS1_TXT_ECDHE_ECDSA_WITH_AES_128_SHA256 \"ECDHE-ECDSA-AES128-SHA256\"\n# define TLS1_TXT_ECDHE_ECDSA_WITH_AES_256_SHA384 \"ECDHE-ECDSA-AES256-SHA384\"\n# define TLS1_TXT_ECDH_ECDSA_WITH_AES_128_SHA256 \"ECDH-ECDSA-AES128-SHA256\"\n# define TLS1_TXT_ECDH_ECDSA_WITH_AES_256_SHA384 \"ECDH-ECDSA-AES256-SHA384\"\n# define TLS1_TXT_ECDHE_RSA_WITH_AES_128_SHA256 \"ECDHE-RSA-AES128-SHA256\"\n# define TLS1_TXT_ECDHE_RSA_WITH_AES_256_SHA384 \"ECDHE-RSA-AES256-SHA384\"\n# define TLS1_TXT_ECDH_RSA_WITH_AES_128_SHA256 \"ECDH-RSA-AES128-SHA256\"\n# define TLS1_TXT_ECDH_RSA_WITH_AES_256_SHA384 \"ECDH-RSA-AES256-SHA384\"\n\n/* ECDH GCM based ciphersuites from RFC5289 */\n# define TLS1_TXT_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256 \"ECDHE-ECDSA-AES128-GCM-SHA256\"\n# define TLS1_TXT_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384 \"ECDHE-ECDSA-AES256-GCM-SHA384\"\n# define TLS1_TXT_ECDH_ECDSA_WITH_AES_128_GCM_SHA256 \"ECDH-ECDSA-AES128-GCM-SHA256\"\n# define TLS1_TXT_ECDH_ECDSA_WITH_AES_256_GCM_SHA384 \"ECDH-ECDSA-AES256-GCM-SHA384\"\n# define TLS1_TXT_ECDHE_RSA_WITH_AES_128_GCM_SHA256 \"ECDHE-RSA-AES128-GCM-SHA256\"\n# define TLS1_TXT_ECDHE_RSA_WITH_AES_256_GCM_SHA384 \"ECDHE-RSA-AES256-GCM-SHA384\"\n# define TLS1_TXT_ECDH_RSA_WITH_AES_128_GCM_SHA256 \"ECDH-RSA-AES128-GCM-SHA256\"\n# define TLS1_TXT_ECDH_RSA_WITH_AES_256_GCM_SHA384 \"ECDH-RSA-AES256-GCM-SHA384\"\n\n/* TLS v1.2 PSK GCM ciphersuites from RFC5487 */\n# define TLS1_TXT_PSK_WITH_AES_128_GCM_SHA256 \"PSK-AES128-GCM-SHA256\"\n# define TLS1_TXT_PSK_WITH_AES_256_GCM_SHA384 \"PSK-AES256-GCM-SHA384\"\n\n/* ECDHE PSK ciphersuites from RFC 5489 */\n# define TLS1_TXT_ECDHE_PSK_WITH_RC4_128_SHA \"ECDHE-PSK-RC4-SHA\"\n# define TLS1_TXT_ECDHE_PSK_WITH_3DES_EDE_CBC_SHA \"ECDHE-PSK-3DES-EDE-CBC-SHA\"\n# define TLS1_TXT_ECDHE_PSK_WITH_AES_128_CBC_SHA \"ECDHE-PSK-AES128-CBC-SHA\"\n# define TLS1_TXT_ECDHE_PSK_WITH_AES_256_CBC_SHA \"ECDHE-PSK-AES256-CBC-SHA\"\n\n# define TLS1_TXT_ECDHE_PSK_WITH_AES_128_CBC_SHA256 \"ECDHE-PSK-AES128-CBC-SHA256\"\n# define TLS1_TXT_ECDHE_PSK_WITH_AES_256_CBC_SHA384 \"ECDHE-PSK-AES256-CBC-SHA384\"\n\n# define TLS1_TXT_ECDHE_PSK_WITH_NULL_SHA \"ECDHE-PSK-NULL-SHA\"\n# define TLS1_TXT_ECDHE_PSK_WITH_NULL_SHA256 \"ECDHE-PSK-NULL-SHA256\"\n# define TLS1_TXT_ECDHE_PSK_WITH_NULL_SHA384 \"ECDHE-PSK-NULL-SHA384\"\n\n/* Camellia-CBC ciphersuites from RFC6367 */\n# define TLS1_TXT_ECDHE_ECDSA_WITH_CAMELLIA_128_CBC_SHA256 \"ECDHE-ECDSA-CAMELLIA128-SHA256\"\n# define TLS1_TXT_ECDHE_ECDSA_WITH_CAMELLIA_256_CBC_SHA384 \"ECDHE-ECDSA-CAMELLIA256-SHA384\"\n# define TLS1_TXT_ECDH_ECDSA_WITH_CAMELLIA_128_CBC_SHA256 \"ECDH-ECDSA-CAMELLIA128-SHA256\"\n# define TLS1_TXT_ECDH_ECDSA_WITH_CAMELLIA_256_CBC_SHA384 \"ECDH-ECDSA-CAMELLIA256-SHA384\"\n# define TLS1_TXT_ECDHE_RSA_WITH_CAMELLIA_128_CBC_SHA256 \"ECDHE-RSA-CAMELLIA128-SHA256\"\n# define TLS1_TXT_ECDHE_RSA_WITH_CAMELLIA_256_CBC_SHA384 \"ECDHE-RSA-CAMELLIA256-SHA384\"\n# define TLS1_TXT_ECDH_RSA_WITH_CAMELLIA_128_CBC_SHA256 \"ECDH-RSA-CAMELLIA128-SHA256\"\n# define TLS1_TXT_ECDH_RSA_WITH_CAMELLIA_256_CBC_SHA384 \"ECDH-RSA-CAMELLIA256-SHA384\"\n\n/* draft-ietf-tls-chacha20-poly1305-03 */\n# define TLS1_TXT_ECDHE_RSA_WITH_CHACHA20_POLY1305 \"ECDHE-RSA-CHACHA20-POLY1305\"\n# define TLS1_TXT_ECDHE_ECDSA_WITH_CHACHA20_POLY1305 \"ECDHE-ECDSA-CHACHA20-POLY1305\"\n# define TLS1_TXT_DHE_RSA_WITH_CHACHA20_POLY1305 \"DHE-RSA-CHACHA20-POLY1305\"\n# define TLS1_TXT_PSK_WITH_CHACHA20_POLY1305 \"PSK-CHACHA20-POLY1305\"\n# define TLS1_TXT_ECDHE_PSK_WITH_CHACHA20_POLY1305 \"ECDHE-PSK-CHACHA20-POLY1305\"\n# define TLS1_TXT_DHE_PSK_WITH_CHACHA20_POLY1305 \"DHE-PSK-CHACHA20-POLY1305\"\n# define TLS1_TXT_RSA_PSK_WITH_CHACHA20_POLY1305 \"RSA-PSK-CHACHA20-POLY1305\"\n\n/* Aria ciphersuites from RFC6209 */\n# define TLS1_TXT_RSA_WITH_ARIA_128_GCM_SHA256 \"ARIA128-GCM-SHA256\"\n# define TLS1_TXT_RSA_WITH_ARIA_256_GCM_SHA384 \"ARIA256-GCM-SHA384\"\n# define TLS1_TXT_DHE_RSA_WITH_ARIA_128_GCM_SHA256 \"DHE-RSA-ARIA128-GCM-SHA256\"\n# define TLS1_TXT_DHE_RSA_WITH_ARIA_256_GCM_SHA384 \"DHE-RSA-ARIA256-GCM-SHA384\"\n# define TLS1_TXT_DH_RSA_WITH_ARIA_128_GCM_SHA256 \"DH-RSA-ARIA128-GCM-SHA256\"\n# define TLS1_TXT_DH_RSA_WITH_ARIA_256_GCM_SHA384 \"DH-RSA-ARIA256-GCM-SHA384\"\n# define TLS1_TXT_DHE_DSS_WITH_ARIA_128_GCM_SHA256 \"DHE-DSS-ARIA128-GCM-SHA256\"\n# define TLS1_TXT_DHE_DSS_WITH_ARIA_256_GCM_SHA384 \"DHE-DSS-ARIA256-GCM-SHA384\"\n# define TLS1_TXT_DH_DSS_WITH_ARIA_128_GCM_SHA256 \"DH-DSS-ARIA128-GCM-SHA256\"\n# define TLS1_TXT_DH_DSS_WITH_ARIA_256_GCM_SHA384 \"DH-DSS-ARIA256-GCM-SHA384\"\n# define TLS1_TXT_DH_anon_WITH_ARIA_128_GCM_SHA256 \"ADH-ARIA128-GCM-SHA256\"\n# define TLS1_TXT_DH_anon_WITH_ARIA_256_GCM_SHA384 \"ADH-ARIA256-GCM-SHA384\"\n# define TLS1_TXT_ECDHE_ECDSA_WITH_ARIA_128_GCM_SHA256 \"ECDHE-ECDSA-ARIA128-GCM-SHA256\"\n# define TLS1_TXT_ECDHE_ECDSA_WITH_ARIA_256_GCM_SHA384 \"ECDHE-ECDSA-ARIA256-GCM-SHA384\"\n# define TLS1_TXT_ECDH_ECDSA_WITH_ARIA_128_GCM_SHA256 \"ECDH-ECDSA-ARIA128-GCM-SHA256\"\n# define TLS1_TXT_ECDH_ECDSA_WITH_ARIA_256_GCM_SHA384 \"ECDH-ECDSA-ARIA256-GCM-SHA384\"\n# define TLS1_TXT_ECDHE_RSA_WITH_ARIA_128_GCM_SHA256 \"ECDHE-ARIA128-GCM-SHA256\"\n# define TLS1_TXT_ECDHE_RSA_WITH_ARIA_256_GCM_SHA384 \"ECDHE-ARIA256-GCM-SHA384\"\n# define TLS1_TXT_ECDH_RSA_WITH_ARIA_128_GCM_SHA256 \"ECDH-ARIA128-GCM-SHA256\"\n# define TLS1_TXT_ECDH_RSA_WITH_ARIA_256_GCM_SHA384 \"ECDH-ARIA256-GCM-SHA384\"\n# define TLS1_TXT_PSK_WITH_ARIA_128_GCM_SHA256 \"PSK-ARIA128-GCM-SHA256\"\n# define TLS1_TXT_PSK_WITH_ARIA_256_GCM_SHA384 \"PSK-ARIA256-GCM-SHA384\"\n# define TLS1_TXT_DHE_PSK_WITH_ARIA_128_GCM_SHA256 \"DHE-PSK-ARIA128-GCM-SHA256\"\n# define TLS1_TXT_DHE_PSK_WITH_ARIA_256_GCM_SHA384 \"DHE-PSK-ARIA256-GCM-SHA384\"\n# define TLS1_TXT_RSA_PSK_WITH_ARIA_128_GCM_SHA256 \"RSA-PSK-ARIA128-GCM-SHA256\"\n# define TLS1_TXT_RSA_PSK_WITH_ARIA_256_GCM_SHA384 \"RSA-PSK-ARIA256-GCM-SHA384\"\n\n# define TLS_CT_RSA_SIGN 1\n# define TLS_CT_DSS_SIGN 2\n# define TLS_CT_RSA_FIXED_DH 3\n# define TLS_CT_DSS_FIXED_DH 4\n# define TLS_CT_ECDSA_SIGN 64\n# define TLS_CT_RSA_FIXED_ECDH 65\n# define TLS_CT_ECDSA_FIXED_ECDH 66\n# define TLS_CT_GOST01_SIGN 22\n# define TLS_CT_GOST12_SIGN 238\n# define TLS_CT_GOST12_512_SIGN 239\n\n/*\n * when correcting this number, correct also SSL3_CT_NUMBER in ssl3.h (see\n * comment there)\n */\n# define TLS_CT_NUMBER 10\n\n# if defined(SSL3_CT_NUMBER)\n# if TLS_CT_NUMBER != SSL3_CT_NUMBER\n# error \"SSL/TLS CT_NUMBER values do not match\"\n# endif\n# endif\n\n# define TLS1_FINISH_MAC_LENGTH 12\n\n# define TLS_MD_MAX_CONST_SIZE 22\n# define TLS_MD_CLIENT_FINISH_CONST \"client finished\"\n# define TLS_MD_CLIENT_FINISH_CONST_SIZE 15\n# define TLS_MD_SERVER_FINISH_CONST \"server finished\"\n# define TLS_MD_SERVER_FINISH_CONST_SIZE 15\n# define TLS_MD_KEY_EXPANSION_CONST \"key expansion\"\n# define TLS_MD_KEY_EXPANSION_CONST_SIZE 13\n# define TLS_MD_CLIENT_WRITE_KEY_CONST \"client write key\"\n# define TLS_MD_CLIENT_WRITE_KEY_CONST_SIZE 16\n# define TLS_MD_SERVER_WRITE_KEY_CONST \"server write key\"\n# define TLS_MD_SERVER_WRITE_KEY_CONST_SIZE 16\n# define TLS_MD_IV_BLOCK_CONST \"IV block\"\n# define TLS_MD_IV_BLOCK_CONST_SIZE 8\n# define TLS_MD_MASTER_SECRET_CONST \"master secret\"\n# define TLS_MD_MASTER_SECRET_CONST_SIZE 13\n# define TLS_MD_EXTENDED_MASTER_SECRET_CONST \"extended master secret\"\n# define TLS_MD_EXTENDED_MASTER_SECRET_CONST_SIZE 22\n\n# ifdef CHARSET_EBCDIC\n# undef TLS_MD_CLIENT_FINISH_CONST\n/*\n * client finished\n */\n# define TLS_MD_CLIENT_FINISH_CONST \"\\x63\\x6c\\x69\\x65\\x6e\\x74\\x20\\x66\\x69\\x6e\\x69\\x73\\x68\\x65\\x64\"\n\n# undef TLS_MD_SERVER_FINISH_CONST\n/*\n * server finished\n */\n# define TLS_MD_SERVER_FINISH_CONST \"\\x73\\x65\\x72\\x76\\x65\\x72\\x20\\x66\\x69\\x6e\\x69\\x73\\x68\\x65\\x64\"\n\n# undef TLS_MD_SERVER_WRITE_KEY_CONST\n/*\n * server write key\n */\n# define TLS_MD_SERVER_WRITE_KEY_CONST \"\\x73\\x65\\x72\\x76\\x65\\x72\\x20\\x77\\x72\\x69\\x74\\x65\\x20\\x6b\\x65\\x79\"\n\n# undef TLS_MD_KEY_EXPANSION_CONST\n/*\n * key expansion\n */\n# define TLS_MD_KEY_EXPANSION_CONST \"\\x6b\\x65\\x79\\x20\\x65\\x78\\x70\\x61\\x6e\\x73\\x69\\x6f\\x6e\"\n\n# undef TLS_MD_CLIENT_WRITE_KEY_CONST\n/*\n * client write key\n */\n# define TLS_MD_CLIENT_WRITE_KEY_CONST \"\\x63\\x6c\\x69\\x65\\x6e\\x74\\x20\\x77\\x72\\x69\\x74\\x65\\x20\\x6b\\x65\\x79\"\n\n# undef TLS_MD_SERVER_WRITE_KEY_CONST\n/*\n * server write key\n */\n# define TLS_MD_SERVER_WRITE_KEY_CONST \"\\x73\\x65\\x72\\x76\\x65\\x72\\x20\\x77\\x72\\x69\\x74\\x65\\x20\\x6b\\x65\\x79\"\n\n# undef TLS_MD_IV_BLOCK_CONST\n/*\n * IV block\n */\n# define TLS_MD_IV_BLOCK_CONST \"\\x49\\x56\\x20\\x62\\x6c\\x6f\\x63\\x6b\"\n\n# undef TLS_MD_MASTER_SECRET_CONST\n/*\n * master secret\n */\n# define TLS_MD_MASTER_SECRET_CONST \"\\x6d\\x61\\x73\\x74\\x65\\x72\\x20\\x73\\x65\\x63\\x72\\x65\\x74\"\n# undef TLS_MD_EXTENDED_MASTER_SECRET_CONST\n/*\n * extended master secret\n */\n# define TLS_MD_EXTENDED_MASTER_SECRET_CONST \"\\x65\\x78\\x74\\x65\\x6e\\x64\\x65\\x64\\x20\\x6d\\x61\\x73\\x74\\x65\\x72\\x20\\x73\\x65\\x63\\x72\\x65\\x74\"\n# endif\n\n/* TLS Session Ticket extension struct */\nstruct tls_session_ticket_ext_st {\n unsigned short length;\n void *data;\n};\n\n#ifdef __cplusplus\n}\n#endif\n#endif\n" }, { "path": "cryptomini/include/openssl/ts.h", "content": "/*\n * Copyright 2006-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_TS_H\n# define HEADER_TS_H\n\n# include \n\n# ifndef OPENSSL_NO_TS\n# include \n# include \n# include \n# include \n# include \n# include \n# include \n# include \n# include \n# include \n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n# include \n# include \n\ntypedef struct TS_msg_imprint_st TS_MSG_IMPRINT;\ntypedef struct TS_req_st TS_REQ;\ntypedef struct TS_accuracy_st TS_ACCURACY;\ntypedef struct TS_tst_info_st TS_TST_INFO;\n\n/* Possible values for status. */\n# define TS_STATUS_GRANTED 0\n# define TS_STATUS_GRANTED_WITH_MODS 1\n# define TS_STATUS_REJECTION 2\n# define TS_STATUS_WAITING 3\n# define TS_STATUS_REVOCATION_WARNING 4\n# define TS_STATUS_REVOCATION_NOTIFICATION 5\n\n/* Possible values for failure_info. */\n# define TS_INFO_BAD_ALG 0\n# define TS_INFO_BAD_REQUEST 2\n# define TS_INFO_BAD_DATA_FORMAT 5\n# define TS_INFO_TIME_NOT_AVAILABLE 14\n# define TS_INFO_UNACCEPTED_POLICY 15\n# define TS_INFO_UNACCEPTED_EXTENSION 16\n# define TS_INFO_ADD_INFO_NOT_AVAILABLE 17\n# define TS_INFO_SYSTEM_FAILURE 25\n\n\ntypedef struct TS_status_info_st TS_STATUS_INFO;\ntypedef struct ESS_issuer_serial ESS_ISSUER_SERIAL;\ntypedef struct ESS_cert_id ESS_CERT_ID;\ntypedef struct ESS_signing_cert ESS_SIGNING_CERT;\n\nDEFINE_STACK_OF(ESS_CERT_ID)\n\ntypedef struct ESS_cert_id_v2_st ESS_CERT_ID_V2;\ntypedef struct ESS_signing_cert_v2_st ESS_SIGNING_CERT_V2;\n\nDEFINE_STACK_OF(ESS_CERT_ID_V2)\n\ntypedef struct TS_resp_st TS_RESP;\n\nTS_REQ *TS_REQ_new(void);\nvoid TS_REQ_free(TS_REQ *a);\nint i2d_TS_REQ(const TS_REQ *a, unsigned char **pp);\nTS_REQ *d2i_TS_REQ(TS_REQ **a, const unsigned char **pp, long length);\n\nTS_REQ *TS_REQ_dup(TS_REQ *a);\n\n#ifndef OPENSSL_NO_STDIO\nTS_REQ *d2i_TS_REQ_fp(FILE *fp, TS_REQ **a);\nint i2d_TS_REQ_fp(FILE *fp, TS_REQ *a);\n#endif\nTS_REQ *d2i_TS_REQ_bio(BIO *fp, TS_REQ **a);\nint i2d_TS_REQ_bio(BIO *fp, TS_REQ *a);\n\nTS_MSG_IMPRINT *TS_MSG_IMPRINT_new(void);\nvoid TS_MSG_IMPRINT_free(TS_MSG_IMPRINT *a);\nint i2d_TS_MSG_IMPRINT(const TS_MSG_IMPRINT *a, unsigned char **pp);\nTS_MSG_IMPRINT *d2i_TS_MSG_IMPRINT(TS_MSG_IMPRINT **a,\n const unsigned char **pp, long length);\n\nTS_MSG_IMPRINT *TS_MSG_IMPRINT_dup(TS_MSG_IMPRINT *a);\n\n#ifndef OPENSSL_NO_STDIO\nTS_MSG_IMPRINT *d2i_TS_MSG_IMPRINT_fp(FILE *fp, TS_MSG_IMPRINT **a);\nint i2d_TS_MSG_IMPRINT_fp(FILE *fp, TS_MSG_IMPRINT *a);\n#endif\nTS_MSG_IMPRINT *d2i_TS_MSG_IMPRINT_bio(BIO *bio, TS_MSG_IMPRINT **a);\nint i2d_TS_MSG_IMPRINT_bio(BIO *bio, TS_MSG_IMPRINT *a);\n\nTS_RESP *TS_RESP_new(void);\nvoid TS_RESP_free(TS_RESP *a);\nint i2d_TS_RESP(const TS_RESP *a, unsigned char **pp);\nTS_RESP *d2i_TS_RESP(TS_RESP **a, const unsigned char **pp, long length);\nTS_TST_INFO *PKCS7_to_TS_TST_INFO(PKCS7 *token);\nTS_RESP *TS_RESP_dup(TS_RESP *a);\n\n#ifndef OPENSSL_NO_STDIO\nTS_RESP *d2i_TS_RESP_fp(FILE *fp, TS_RESP **a);\nint i2d_TS_RESP_fp(FILE *fp, TS_RESP *a);\n#endif\nTS_RESP *d2i_TS_RESP_bio(BIO *bio, TS_RESP **a);\nint i2d_TS_RESP_bio(BIO *bio, TS_RESP *a);\n\nTS_STATUS_INFO *TS_STATUS_INFO_new(void);\nvoid TS_STATUS_INFO_free(TS_STATUS_INFO *a);\nint i2d_TS_STATUS_INFO(const TS_STATUS_INFO *a, unsigned char **pp);\nTS_STATUS_INFO *d2i_TS_STATUS_INFO(TS_STATUS_INFO **a,\n const unsigned char **pp, long length);\nTS_STATUS_INFO *TS_STATUS_INFO_dup(TS_STATUS_INFO *a);\n\nTS_TST_INFO *TS_TST_INFO_new(void);\nvoid TS_TST_INFO_free(TS_TST_INFO *a);\nint i2d_TS_TST_INFO(const TS_TST_INFO *a, unsigned char **pp);\nTS_TST_INFO *d2i_TS_TST_INFO(TS_TST_INFO **a, const unsigned char **pp,\n long length);\nTS_TST_INFO *TS_TST_INFO_dup(TS_TST_INFO *a);\n\n#ifndef OPENSSL_NO_STDIO\nTS_TST_INFO *d2i_TS_TST_INFO_fp(FILE *fp, TS_TST_INFO **a);\nint i2d_TS_TST_INFO_fp(FILE *fp, TS_TST_INFO *a);\n#endif\nTS_TST_INFO *d2i_TS_TST_INFO_bio(BIO *bio, TS_TST_INFO **a);\nint i2d_TS_TST_INFO_bio(BIO *bio, TS_TST_INFO *a);\n\nTS_ACCURACY *TS_ACCURACY_new(void);\nvoid TS_ACCURACY_free(TS_ACCURACY *a);\nint i2d_TS_ACCURACY(const TS_ACCURACY *a, unsigned char **pp);\nTS_ACCURACY *d2i_TS_ACCURACY(TS_ACCURACY **a, const unsigned char **pp,\n long length);\nTS_ACCURACY *TS_ACCURACY_dup(TS_ACCURACY *a);\n\nESS_ISSUER_SERIAL *ESS_ISSUER_SERIAL_new(void);\nvoid ESS_ISSUER_SERIAL_free(ESS_ISSUER_SERIAL *a);\nint i2d_ESS_ISSUER_SERIAL(const ESS_ISSUER_SERIAL *a, unsigned char **pp);\nESS_ISSUER_SERIAL *d2i_ESS_ISSUER_SERIAL(ESS_ISSUER_SERIAL **a,\n const unsigned char **pp,\n long length);\nESS_ISSUER_SERIAL *ESS_ISSUER_SERIAL_dup(ESS_ISSUER_SERIAL *a);\n\nESS_CERT_ID *ESS_CERT_ID_new(void);\nvoid ESS_CERT_ID_free(ESS_CERT_ID *a);\nint i2d_ESS_CERT_ID(const ESS_CERT_ID *a, unsigned char **pp);\nESS_CERT_ID *d2i_ESS_CERT_ID(ESS_CERT_ID **a, const unsigned char **pp,\n long length);\nESS_CERT_ID *ESS_CERT_ID_dup(ESS_CERT_ID *a);\n\nESS_SIGNING_CERT *ESS_SIGNING_CERT_new(void);\nvoid ESS_SIGNING_CERT_free(ESS_SIGNING_CERT *a);\nint i2d_ESS_SIGNING_CERT(const ESS_SIGNING_CERT *a, unsigned char **pp);\nESS_SIGNING_CERT *d2i_ESS_SIGNING_CERT(ESS_SIGNING_CERT **a,\n const unsigned char **pp, long length);\nESS_SIGNING_CERT *ESS_SIGNING_CERT_dup(ESS_SIGNING_CERT *a);\n\nESS_CERT_ID_V2 *ESS_CERT_ID_V2_new(void);\nvoid ESS_CERT_ID_V2_free(ESS_CERT_ID_V2 *a);\nint i2d_ESS_CERT_ID_V2(const ESS_CERT_ID_V2 *a, unsigned char **pp);\nESS_CERT_ID_V2 *d2i_ESS_CERT_ID_V2(ESS_CERT_ID_V2 **a,\n const unsigned char **pp, long length);\nESS_CERT_ID_V2 *ESS_CERT_ID_V2_dup(ESS_CERT_ID_V2 *a);\n\nESS_SIGNING_CERT_V2 *ESS_SIGNING_CERT_V2_new(void);\nvoid ESS_SIGNING_CERT_V2_free(ESS_SIGNING_CERT_V2 *a);\nint i2d_ESS_SIGNING_CERT_V2(const ESS_SIGNING_CERT_V2 *a, unsigned char **pp);\nESS_SIGNING_CERT_V2 *d2i_ESS_SIGNING_CERT_V2(ESS_SIGNING_CERT_V2 **a,\n const unsigned char **pp,\n long length);\nESS_SIGNING_CERT_V2 *ESS_SIGNING_CERT_V2_dup(ESS_SIGNING_CERT_V2 *a);\n\nint TS_REQ_set_version(TS_REQ *a, long version);\nlong TS_REQ_get_version(const TS_REQ *a);\n\nint TS_STATUS_INFO_set_status(TS_STATUS_INFO *a, int i);\nconst ASN1_INTEGER *TS_STATUS_INFO_get0_status(const TS_STATUS_INFO *a);\n\nconst STACK_OF(ASN1_UTF8STRING) *\nTS_STATUS_INFO_get0_text(const TS_STATUS_INFO *a);\n\nconst ASN1_BIT_STRING *\nTS_STATUS_INFO_get0_failure_info(const TS_STATUS_INFO *a);\n\nint TS_REQ_set_msg_imprint(TS_REQ *a, TS_MSG_IMPRINT *msg_imprint);\nTS_MSG_IMPRINT *TS_REQ_get_msg_imprint(TS_REQ *a);\n\nint TS_MSG_IMPRINT_set_algo(TS_MSG_IMPRINT *a, X509_ALGOR *alg);\nX509_ALGOR *TS_MSG_IMPRINT_get_algo(TS_MSG_IMPRINT *a);\n\nint TS_MSG_IMPRINT_set_msg(TS_MSG_IMPRINT *a, unsigned char *d, int len);\nASN1_OCTET_STRING *TS_MSG_IMPRINT_get_msg(TS_MSG_IMPRINT *a);\n\nint TS_REQ_set_policy_id(TS_REQ *a, const ASN1_OBJECT *policy);\nASN1_OBJECT *TS_REQ_get_policy_id(TS_REQ *a);\n\nint TS_REQ_set_nonce(TS_REQ *a, const ASN1_INTEGER *nonce);\nconst ASN1_INTEGER *TS_REQ_get_nonce(const TS_REQ *a);\n\nint TS_REQ_set_cert_req(TS_REQ *a, int cert_req);\nint TS_REQ_get_cert_req(const TS_REQ *a);\n\nSTACK_OF(X509_EXTENSION) *TS_REQ_get_exts(TS_REQ *a);\nvoid TS_REQ_ext_free(TS_REQ *a);\nint TS_REQ_get_ext_count(TS_REQ *a);\nint TS_REQ_get_ext_by_NID(TS_REQ *a, int nid, int lastpos);\nint TS_REQ_get_ext_by_OBJ(TS_REQ *a, const ASN1_OBJECT *obj, int lastpos);\nint TS_REQ_get_ext_by_critical(TS_REQ *a, int crit, int lastpos);\nX509_EXTENSION *TS_REQ_get_ext(TS_REQ *a, int loc);\nX509_EXTENSION *TS_REQ_delete_ext(TS_REQ *a, int loc);\nint TS_REQ_add_ext(TS_REQ *a, X509_EXTENSION *ex, int loc);\nvoid *TS_REQ_get_ext_d2i(TS_REQ *a, int nid, int *crit, int *idx);\n\n/* Function declarations for TS_REQ defined in ts/ts_req_print.c */\n\nint TS_REQ_print_bio(BIO *bio, TS_REQ *a);\n\n/* Function declarations for TS_RESP defined in ts/ts_resp_utils.c */\n\nint TS_RESP_set_status_info(TS_RESP *a, TS_STATUS_INFO *info);\nTS_STATUS_INFO *TS_RESP_get_status_info(TS_RESP *a);\n\n/* Caller loses ownership of PKCS7 and TS_TST_INFO objects. */\nvoid TS_RESP_set_tst_info(TS_RESP *a, PKCS7 *p7, TS_TST_INFO *tst_info);\nPKCS7 *TS_RESP_get_token(TS_RESP *a);\nTS_TST_INFO *TS_RESP_get_tst_info(TS_RESP *a);\n\nint TS_TST_INFO_set_version(TS_TST_INFO *a, long version);\nlong TS_TST_INFO_get_version(const TS_TST_INFO *a);\n\nint TS_TST_INFO_set_policy_id(TS_TST_INFO *a, ASN1_OBJECT *policy_id);\nASN1_OBJECT *TS_TST_INFO_get_policy_id(TS_TST_INFO *a);\n\nint TS_TST_INFO_set_msg_imprint(TS_TST_INFO *a, TS_MSG_IMPRINT *msg_imprint);\nTS_MSG_IMPRINT *TS_TST_INFO_get_msg_imprint(TS_TST_INFO *a);\n\nint TS_TST_INFO_set_serial(TS_TST_INFO *a, const ASN1_INTEGER *serial);\nconst ASN1_INTEGER *TS_TST_INFO_get_serial(const TS_TST_INFO *a);\n\nint TS_TST_INFO_set_time(TS_TST_INFO *a, const ASN1_GENERALIZEDTIME *gtime);\nconst ASN1_GENERALIZEDTIME *TS_TST_INFO_get_time(const TS_TST_INFO *a);\n\nint TS_TST_INFO_set_accuracy(TS_TST_INFO *a, TS_ACCURACY *accuracy);\nTS_ACCURACY *TS_TST_INFO_get_accuracy(TS_TST_INFO *a);\n\nint TS_ACCURACY_set_seconds(TS_ACCURACY *a, const ASN1_INTEGER *seconds);\nconst ASN1_INTEGER *TS_ACCURACY_get_seconds(const TS_ACCURACY *a);\n\nint TS_ACCURACY_set_millis(TS_ACCURACY *a, const ASN1_INTEGER *millis);\nconst ASN1_INTEGER *TS_ACCURACY_get_millis(const TS_ACCURACY *a);\n\nint TS_ACCURACY_set_micros(TS_ACCURACY *a, const ASN1_INTEGER *micros);\nconst ASN1_INTEGER *TS_ACCURACY_get_micros(const TS_ACCURACY *a);\n\nint TS_TST_INFO_set_ordering(TS_TST_INFO *a, int ordering);\nint TS_TST_INFO_get_ordering(const TS_TST_INFO *a);\n\nint TS_TST_INFO_set_nonce(TS_TST_INFO *a, const ASN1_INTEGER *nonce);\nconst ASN1_INTEGER *TS_TST_INFO_get_nonce(const TS_TST_INFO *a);\n\nint TS_TST_INFO_set_tsa(TS_TST_INFO *a, GENERAL_NAME *tsa);\nGENERAL_NAME *TS_TST_INFO_get_tsa(TS_TST_INFO *a);\n\nSTACK_OF(X509_EXTENSION) *TS_TST_INFO_get_exts(TS_TST_INFO *a);\nvoid TS_TST_INFO_ext_free(TS_TST_INFO *a);\nint TS_TST_INFO_get_ext_count(TS_TST_INFO *a);\nint TS_TST_INFO_get_ext_by_NID(TS_TST_INFO *a, int nid, int lastpos);\nint TS_TST_INFO_get_ext_by_OBJ(TS_TST_INFO *a, const ASN1_OBJECT *obj,\n int lastpos);\nint TS_TST_INFO_get_ext_by_critical(TS_TST_INFO *a, int crit, int lastpos);\nX509_EXTENSION *TS_TST_INFO_get_ext(TS_TST_INFO *a, int loc);\nX509_EXTENSION *TS_TST_INFO_delete_ext(TS_TST_INFO *a, int loc);\nint TS_TST_INFO_add_ext(TS_TST_INFO *a, X509_EXTENSION *ex, int loc);\nvoid *TS_TST_INFO_get_ext_d2i(TS_TST_INFO *a, int nid, int *crit, int *idx);\n\n/*\n * Declarations related to response generation, defined in ts/ts_resp_sign.c.\n */\n\n/* Optional flags for response generation. */\n\n/* Don't include the TSA name in response. */\n# define TS_TSA_NAME 0x01\n\n/* Set ordering to true in response. */\n# define TS_ORDERING 0x02\n\n/*\n * Include the signer certificate and the other specified certificates in\n * the ESS signing certificate attribute beside the PKCS7 signed data.\n * Only the signer certificates is included by default.\n */\n# define TS_ESS_CERT_ID_CHAIN 0x04\n\n/* Forward declaration. */\nstruct TS_resp_ctx;\n\n/* This must return a unique number less than 160 bits long. */\ntypedef ASN1_INTEGER *(*TS_serial_cb) (struct TS_resp_ctx *, void *);\n\n/*\n * This must return the seconds and microseconds since Jan 1, 1970 in the sec\n * and usec variables allocated by the caller. Return non-zero for success\n * and zero for failure.\n */\ntypedef int (*TS_time_cb) (struct TS_resp_ctx *, void *, long *sec,\n long *usec);\n\n/*\n * This must process the given extension. It can modify the TS_TST_INFO\n * object of the context. Return values: !0 (processed), 0 (error, it must\n * set the status info/failure info of the response).\n */\ntypedef int (*TS_extension_cb) (struct TS_resp_ctx *, X509_EXTENSION *,\n void *);\n\ntypedef struct TS_resp_ctx TS_RESP_CTX;\n\nDEFINE_STACK_OF_CONST(EVP_MD)\n\n/* Creates a response context that can be used for generating responses. */\nTS_RESP_CTX *TS_RESP_CTX_new(void);\nvoid TS_RESP_CTX_free(TS_RESP_CTX *ctx);\n\n/* This parameter must be set. */\nint TS_RESP_CTX_set_signer_cert(TS_RESP_CTX *ctx, X509 *signer);\n\n/* This parameter must be set. */\nint TS_RESP_CTX_set_signer_key(TS_RESP_CTX *ctx, EVP_PKEY *key);\n\nint TS_RESP_CTX_set_signer_digest(TS_RESP_CTX *ctx,\n const EVP_MD *signer_digest);\nint TS_RESP_CTX_set_ess_cert_id_digest(TS_RESP_CTX *ctx, const EVP_MD *md);\n\n/* This parameter must be set. */\nint TS_RESP_CTX_set_def_policy(TS_RESP_CTX *ctx, const ASN1_OBJECT *def_policy);\n\n/* No additional certs are included in the response by default. */\nint TS_RESP_CTX_set_certs(TS_RESP_CTX *ctx, STACK_OF(X509) *certs);\n\n/*\n * Adds a new acceptable policy, only the default policy is accepted by\n * default.\n */\nint TS_RESP_CTX_add_policy(TS_RESP_CTX *ctx, const ASN1_OBJECT *policy);\n\n/*\n * Adds a new acceptable message digest. Note that no message digests are\n * accepted by default. The md argument is shared with the caller.\n */\nint TS_RESP_CTX_add_md(TS_RESP_CTX *ctx, const EVP_MD *md);\n\n/* Accuracy is not included by default. */\nint TS_RESP_CTX_set_accuracy(TS_RESP_CTX *ctx,\n int secs, int millis, int micros);\n\n/*\n * Clock precision digits, i.e. the number of decimal digits: '0' means sec,\n * '3' msec, '6' usec, and so on. Default is 0.\n */\nint TS_RESP_CTX_set_clock_precision_digits(TS_RESP_CTX *ctx,\n unsigned clock_precision_digits);\n/* At most we accept usec precision. */\n# define TS_MAX_CLOCK_PRECISION_DIGITS 6\n\n/* Maximum status message length */\n# define TS_MAX_STATUS_LENGTH (1024 * 1024)\n\n/* No flags are set by default. */\nvoid TS_RESP_CTX_add_flags(TS_RESP_CTX *ctx, int flags);\n\n/* Default callback always returns a constant. */\nvoid TS_RESP_CTX_set_serial_cb(TS_RESP_CTX *ctx, TS_serial_cb cb, void *data);\n\n/* Default callback uses the gettimeofday() and gmtime() system calls. */\nvoid TS_RESP_CTX_set_time_cb(TS_RESP_CTX *ctx, TS_time_cb cb, void *data);\n\n/*\n * Default callback rejects all extensions. The extension callback is called\n * when the TS_TST_INFO object is already set up and not signed yet.\n */\n/* FIXME: extension handling is not tested yet. */\nvoid TS_RESP_CTX_set_extension_cb(TS_RESP_CTX *ctx,\n TS_extension_cb cb, void *data);\n\n/* The following methods can be used in the callbacks. */\nint TS_RESP_CTX_set_status_info(TS_RESP_CTX *ctx,\n int status, const char *text);\n\n/* Sets the status info only if it is still TS_STATUS_GRANTED. */\nint TS_RESP_CTX_set_status_info_cond(TS_RESP_CTX *ctx,\n int status, const char *text);\n\nint TS_RESP_CTX_add_failure_info(TS_RESP_CTX *ctx, int failure);\n\n/* The get methods below can be used in the extension callback. */\nTS_REQ *TS_RESP_CTX_get_request(TS_RESP_CTX *ctx);\n\nTS_TST_INFO *TS_RESP_CTX_get_tst_info(TS_RESP_CTX *ctx);\n\n/*\n * Creates the signed TS_TST_INFO and puts it in TS_RESP.\n * In case of errors it sets the status info properly.\n * Returns NULL only in case of memory allocation/fatal error.\n */\nTS_RESP *TS_RESP_create_response(TS_RESP_CTX *ctx, BIO *req_bio);\n\n/*\n * Declarations related to response verification,\n * they are defined in ts/ts_resp_verify.c.\n */\n\nint TS_RESP_verify_signature(PKCS7 *token, STACK_OF(X509) *certs,\n X509_STORE *store, X509 **signer_out);\n\n/* Context structure for the generic verify method. */\n\n/* Verify the signer's certificate and the signature of the response. */\n# define TS_VFY_SIGNATURE (1u << 0)\n/* Verify the version number of the response. */\n# define TS_VFY_VERSION (1u << 1)\n/* Verify if the policy supplied by the user matches the policy of the TSA. */\n# define TS_VFY_POLICY (1u << 2)\n/*\n * Verify the message imprint provided by the user. This flag should not be\n * specified with TS_VFY_DATA.\n */\n# define TS_VFY_IMPRINT (1u << 3)\n/*\n * Verify the message imprint computed by the verify method from the user\n * provided data and the MD algorithm of the response. This flag should not\n * be specified with TS_VFY_IMPRINT.\n */\n# define TS_VFY_DATA (1u << 4)\n/* Verify the nonce value. */\n# define TS_VFY_NONCE (1u << 5)\n/* Verify if the TSA name field matches the signer certificate. */\n# define TS_VFY_SIGNER (1u << 6)\n/* Verify if the TSA name field equals to the user provided name. */\n# define TS_VFY_TSA_NAME (1u << 7)\n\n/* You can use the following convenience constants. */\n# define TS_VFY_ALL_IMPRINT (TS_VFY_SIGNATURE \\\n | TS_VFY_VERSION \\\n | TS_VFY_POLICY \\\n | TS_VFY_IMPRINT \\\n | TS_VFY_NONCE \\\n | TS_VFY_SIGNER \\\n | TS_VFY_TSA_NAME)\n# define TS_VFY_ALL_DATA (TS_VFY_SIGNATURE \\\n | TS_VFY_VERSION \\\n | TS_VFY_POLICY \\\n | TS_VFY_DATA \\\n | TS_VFY_NONCE \\\n | TS_VFY_SIGNER \\\n | TS_VFY_TSA_NAME)\n\ntypedef struct TS_verify_ctx TS_VERIFY_CTX;\n\nint TS_RESP_verify_response(TS_VERIFY_CTX *ctx, TS_RESP *response);\nint TS_RESP_verify_token(TS_VERIFY_CTX *ctx, PKCS7 *token);\n\n/*\n * Declarations related to response verification context,\n */\nTS_VERIFY_CTX *TS_VERIFY_CTX_new(void);\nvoid TS_VERIFY_CTX_init(TS_VERIFY_CTX *ctx);\nvoid TS_VERIFY_CTX_free(TS_VERIFY_CTX *ctx);\nvoid TS_VERIFY_CTX_cleanup(TS_VERIFY_CTX *ctx);\nint TS_VERIFY_CTX_set_flags(TS_VERIFY_CTX *ctx, int f);\nint TS_VERIFY_CTX_add_flags(TS_VERIFY_CTX *ctx, int f);\nBIO *TS_VERIFY_CTX_set_data(TS_VERIFY_CTX *ctx, BIO *b);\nunsigned char *TS_VERIFY_CTX_set_imprint(TS_VERIFY_CTX *ctx,\n unsigned char *hexstr, long len);\nX509_STORE *TS_VERIFY_CTX_set_store(TS_VERIFY_CTX *ctx, X509_STORE *s);\nSTACK_OF(X509) *TS_VERIFY_CTS_set_certs(TS_VERIFY_CTX *ctx, STACK_OF(X509) *certs);\n\n/*-\n * If ctx is NULL, it allocates and returns a new object, otherwise\n * it returns ctx. It initialises all the members as follows:\n * flags = TS_VFY_ALL_IMPRINT & ~(TS_VFY_TSA_NAME | TS_VFY_SIGNATURE)\n * certs = NULL\n * store = NULL\n * policy = policy from the request or NULL if absent (in this case\n * TS_VFY_POLICY is cleared from flags as well)\n * md_alg = MD algorithm from request\n * imprint, imprint_len = imprint from request\n * data = NULL\n * nonce, nonce_len = nonce from the request or NULL if absent (in this case\n * TS_VFY_NONCE is cleared from flags as well)\n * tsa_name = NULL\n * Important: after calling this method TS_VFY_SIGNATURE should be added!\n */\nTS_VERIFY_CTX *TS_REQ_to_TS_VERIFY_CTX(TS_REQ *req, TS_VERIFY_CTX *ctx);\n\n/* Function declarations for TS_RESP defined in ts/ts_resp_print.c */\n\nint TS_RESP_print_bio(BIO *bio, TS_RESP *a);\nint TS_STATUS_INFO_print_bio(BIO *bio, TS_STATUS_INFO *a);\nint TS_TST_INFO_print_bio(BIO *bio, TS_TST_INFO *a);\n\n/* Common utility functions defined in ts/ts_lib.c */\n\nint TS_ASN1_INTEGER_print_bio(BIO *bio, const ASN1_INTEGER *num);\nint TS_OBJ_print_bio(BIO *bio, const ASN1_OBJECT *obj);\nint TS_ext_print_bio(BIO *bio, const STACK_OF(X509_EXTENSION) *extensions);\nint TS_X509_ALGOR_print_bio(BIO *bio, const X509_ALGOR *alg);\nint TS_MSG_IMPRINT_print_bio(BIO *bio, TS_MSG_IMPRINT *msg);\n\n/*\n * Function declarations for handling configuration options, defined in\n * ts/ts_conf.c\n */\n\nX509 *TS_CONF_load_cert(const char *file);\nSTACK_OF(X509) *TS_CONF_load_certs(const char *file);\nEVP_PKEY *TS_CONF_load_key(const char *file, const char *pass);\nconst char *TS_CONF_get_tsa_section(CONF *conf, const char *section);\nint TS_CONF_set_serial(CONF *conf, const char *section, TS_serial_cb cb,\n TS_RESP_CTX *ctx);\n#ifndef OPENSSL_NO_ENGINE\nint TS_CONF_set_crypto_device(CONF *conf, const char *section,\n const char *device);\nint TS_CONF_set_default_engine(const char *name);\n#endif\nint TS_CONF_set_signer_cert(CONF *conf, const char *section,\n const char *cert, TS_RESP_CTX *ctx);\nint TS_CONF_set_certs(CONF *conf, const char *section, const char *certs,\n TS_RESP_CTX *ctx);\nint TS_CONF_set_signer_key(CONF *conf, const char *section,\n const char *key, const char *pass,\n TS_RESP_CTX *ctx);\nint TS_CONF_set_signer_digest(CONF *conf, const char *section,\n const char *md, TS_RESP_CTX *ctx);\nint TS_CONF_set_def_policy(CONF *conf, const char *section,\n const char *policy, TS_RESP_CTX *ctx);\nint TS_CONF_set_policies(CONF *conf, const char *section, TS_RESP_CTX *ctx);\nint TS_CONF_set_digests(CONF *conf, const char *section, TS_RESP_CTX *ctx);\nint TS_CONF_set_accuracy(CONF *conf, const char *section, TS_RESP_CTX *ctx);\nint TS_CONF_set_clock_precision_digits(CONF *conf, const char *section,\n TS_RESP_CTX *ctx);\nint TS_CONF_set_ordering(CONF *conf, const char *section, TS_RESP_CTX *ctx);\nint TS_CONF_set_tsa_name(CONF *conf, const char *section, TS_RESP_CTX *ctx);\nint TS_CONF_set_ess_cert_id_chain(CONF *conf, const char *section,\n TS_RESP_CTX *ctx);\nint TS_CONF_set_ess_cert_id_digest(CONF *conf, const char *section,\n TS_RESP_CTX *ctx);\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/tserr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_TSERR_H\n# define HEADER_TSERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# include \n\n# ifndef OPENSSL_NO_TS\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_TS_strings(void);\n\n/*\n * TS function codes.\n */\n# define TS_F_DEF_SERIAL_CB 110\n# define TS_F_DEF_TIME_CB 111\n# define TS_F_ESS_ADD_SIGNING_CERT 112\n# define TS_F_ESS_ADD_SIGNING_CERT_V2 147\n# define TS_F_ESS_CERT_ID_NEW_INIT 113\n# define TS_F_ESS_CERT_ID_V2_NEW_INIT 156\n# define TS_F_ESS_SIGNING_CERT_NEW_INIT 114\n# define TS_F_ESS_SIGNING_CERT_V2_NEW_INIT 157\n# define TS_F_INT_TS_RESP_VERIFY_TOKEN 149\n# define TS_F_PKCS7_TO_TS_TST_INFO 148\n# define TS_F_TS_ACCURACY_SET_MICROS 115\n# define TS_F_TS_ACCURACY_SET_MILLIS 116\n# define TS_F_TS_ACCURACY_SET_SECONDS 117\n# define TS_F_TS_CHECK_IMPRINTS 100\n# define TS_F_TS_CHECK_NONCES 101\n# define TS_F_TS_CHECK_POLICY 102\n# define TS_F_TS_CHECK_SIGNING_CERTS 103\n# define TS_F_TS_CHECK_STATUS_INFO 104\n# define TS_F_TS_COMPUTE_IMPRINT 145\n# define TS_F_TS_CONF_INVALID 151\n# define TS_F_TS_CONF_LOAD_CERT 153\n# define TS_F_TS_CONF_LOAD_CERTS 154\n# define TS_F_TS_CONF_LOAD_KEY 155\n# define TS_F_TS_CONF_LOOKUP_FAIL 152\n# define TS_F_TS_CONF_SET_DEFAULT_ENGINE 146\n# define TS_F_TS_GET_STATUS_TEXT 105\n# define TS_F_TS_MSG_IMPRINT_SET_ALGO 118\n# define TS_F_TS_REQ_SET_MSG_IMPRINT 119\n# define TS_F_TS_REQ_SET_NONCE 120\n# define TS_F_TS_REQ_SET_POLICY_ID 121\n# define TS_F_TS_RESP_CREATE_RESPONSE 122\n# define TS_F_TS_RESP_CREATE_TST_INFO 123\n# define TS_F_TS_RESP_CTX_ADD_FAILURE_INFO 124\n# define TS_F_TS_RESP_CTX_ADD_MD 125\n# define TS_F_TS_RESP_CTX_ADD_POLICY 126\n# define TS_F_TS_RESP_CTX_NEW 127\n# define TS_F_TS_RESP_CTX_SET_ACCURACY 128\n# define TS_F_TS_RESP_CTX_SET_CERTS 129\n# define TS_F_TS_RESP_CTX_SET_DEF_POLICY 130\n# define TS_F_TS_RESP_CTX_SET_SIGNER_CERT 131\n# define TS_F_TS_RESP_CTX_SET_STATUS_INFO 132\n# define TS_F_TS_RESP_GET_POLICY 133\n# define TS_F_TS_RESP_SET_GENTIME_WITH_PRECISION 134\n# define TS_F_TS_RESP_SET_STATUS_INFO 135\n# define TS_F_TS_RESP_SET_TST_INFO 150\n# define TS_F_TS_RESP_SIGN 136\n# define TS_F_TS_RESP_VERIFY_SIGNATURE 106\n# define TS_F_TS_TST_INFO_SET_ACCURACY 137\n# define TS_F_TS_TST_INFO_SET_MSG_IMPRINT 138\n# define TS_F_TS_TST_INFO_SET_NONCE 139\n# define TS_F_TS_TST_INFO_SET_POLICY_ID 140\n# define TS_F_TS_TST_INFO_SET_SERIAL 141\n# define TS_F_TS_TST_INFO_SET_TIME 142\n# define TS_F_TS_TST_INFO_SET_TSA 143\n# define TS_F_TS_VERIFY 108\n# define TS_F_TS_VERIFY_CERT 109\n# define TS_F_TS_VERIFY_CTX_NEW 144\n\n/*\n * TS reason codes.\n */\n# define TS_R_BAD_PKCS7_TYPE 132\n# define TS_R_BAD_TYPE 133\n# define TS_R_CANNOT_LOAD_CERT 137\n# define TS_R_CANNOT_LOAD_KEY 138\n# define TS_R_CERTIFICATE_VERIFY_ERROR 100\n# define TS_R_COULD_NOT_SET_ENGINE 127\n# define TS_R_COULD_NOT_SET_TIME 115\n# define TS_R_DETACHED_CONTENT 134\n# define TS_R_ESS_ADD_SIGNING_CERT_ERROR 116\n# define TS_R_ESS_ADD_SIGNING_CERT_V2_ERROR 139\n# define TS_R_ESS_SIGNING_CERTIFICATE_ERROR 101\n# define TS_R_INVALID_NULL_POINTER 102\n# define TS_R_INVALID_SIGNER_CERTIFICATE_PURPOSE 117\n# define TS_R_MESSAGE_IMPRINT_MISMATCH 103\n# define TS_R_NONCE_MISMATCH 104\n# define TS_R_NONCE_NOT_RETURNED 105\n# define TS_R_NO_CONTENT 106\n# define TS_R_NO_TIME_STAMP_TOKEN 107\n# define TS_R_PKCS7_ADD_SIGNATURE_ERROR 118\n# define TS_R_PKCS7_ADD_SIGNED_ATTR_ERROR 119\n# define TS_R_PKCS7_TO_TS_TST_INFO_FAILED 129\n# define TS_R_POLICY_MISMATCH 108\n# define TS_R_PRIVATE_KEY_DOES_NOT_MATCH_CERTIFICATE 120\n# define TS_R_RESPONSE_SETUP_ERROR 121\n# define TS_R_SIGNATURE_FAILURE 109\n# define TS_R_THERE_MUST_BE_ONE_SIGNER 110\n# define TS_R_TIME_SYSCALL_ERROR 122\n# define TS_R_TOKEN_NOT_PRESENT 130\n# define TS_R_TOKEN_PRESENT 131\n# define TS_R_TSA_NAME_MISMATCH 111\n# define TS_R_TSA_UNTRUSTED 112\n# define TS_R_TST_INFO_SETUP_ERROR 123\n# define TS_R_TS_DATASIGN 124\n# define TS_R_UNACCEPTABLE_POLICY 125\n# define TS_R_UNSUPPORTED_MD_ALGORITHM 126\n# define TS_R_UNSUPPORTED_VERSION 113\n# define TS_R_VAR_BAD_VALUE 135\n# define TS_R_VAR_LOOKUP_FAILURE 136\n# define TS_R_WRONG_CONTENT_TYPE 114\n\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/txt_db.h", "content": "/*\n * Copyright 1995-2017 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_TXT_DB_H\n# define HEADER_TXT_DB_H\n\n# include \n# include \n# include \n# include \n\n# define DB_ERROR_OK 0\n# define DB_ERROR_MALLOC 1\n# define DB_ERROR_INDEX_CLASH 2\n# define DB_ERROR_INDEX_OUT_OF_RANGE 3\n# define DB_ERROR_NO_INDEX 4\n# define DB_ERROR_INSERT_INDEX_CLASH 5\n# define DB_ERROR_WRONG_NUM_FIELDS 6\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\ntypedef OPENSSL_STRING *OPENSSL_PSTRING;\nDEFINE_SPECIAL_STACK_OF(OPENSSL_PSTRING, OPENSSL_STRING)\n\ntypedef struct txt_db_st {\n int num_fields;\n STACK_OF(OPENSSL_PSTRING) *data;\n LHASH_OF(OPENSSL_STRING) **index;\n int (**qual) (OPENSSL_STRING *);\n long error;\n long arg1;\n long arg2;\n OPENSSL_STRING *arg_row;\n} TXT_DB;\n\nTXT_DB *TXT_DB_read(BIO *in, int num);\nlong TXT_DB_write(BIO *out, TXT_DB *db);\nint TXT_DB_create_index(TXT_DB *db, int field, int (*qual) (OPENSSL_STRING *),\n OPENSSL_LH_HASHFUNC hash, OPENSSL_LH_COMPFUNC cmp);\nvoid TXT_DB_free(TXT_DB *db);\nOPENSSL_STRING *TXT_DB_get_by_index(TXT_DB *db, int idx,\n OPENSSL_STRING *value);\nint TXT_DB_insert(TXT_DB *db, OPENSSL_STRING *value);\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/ui.h", "content": "/*\n * Copyright 2001-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_UI_H\n# define HEADER_UI_H\n\n# include \n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# include \n# endif\n# include \n# include \n# include \n# include \n\n/* For compatibility reasons, the macro OPENSSL_NO_UI is currently retained */\n# if OPENSSL_API_COMPAT < 0x10200000L\n# ifdef OPENSSL_NO_UI_CONSOLE\n# define OPENSSL_NO_UI\n# endif\n# endif\n\n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n/*\n * All the following functions return -1 or NULL on error and in some cases\n * (UI_process()) -2 if interrupted or in some other way cancelled. When\n * everything is fine, they return 0, a positive value or a non-NULL pointer,\n * all depending on their purpose.\n */\n\n/* Creators and destructor. */\nUI *UI_new(void);\nUI *UI_new_method(const UI_METHOD *method);\nvoid UI_free(UI *ui);\n\n/*-\n The following functions are used to add strings to be printed and prompt\n strings to prompt for data. The names are UI_{add,dup}__string\n and UI_{add,dup}_input_boolean.\n\n UI_{add,dup}__string have the following meanings:\n add add a text or prompt string. The pointers given to these\n functions are used verbatim, no copying is done.\n dup make a copy of the text or prompt string, then add the copy\n to the collection of strings in the user interface.\n \n The function is a name for the functionality that the given\n string shall be used for. It can be one of:\n input use the string as data prompt.\n verify use the string as verification prompt. This\n is used to verify a previous input.\n info use the string for informational output.\n error use the string for error output.\n Honestly, there's currently no difference between info and error for the\n moment.\n\n UI_{add,dup}_input_boolean have the same semantics for \"add\" and \"dup\",\n and are typically used when one wants to prompt for a yes/no response.\n\n All of the functions in this group take a UI and a prompt string.\n The string input and verify addition functions also take a flag argument,\n a buffer for the result to end up with, a minimum input size and a maximum\n input size (the result buffer MUST be large enough to be able to contain\n the maximum number of characters). Additionally, the verify addition\n functions takes another buffer to compare the result against.\n The boolean input functions take an action description string (which should\n be safe to ignore if the expected user action is obvious, for example with\n a dialog box with an OK button and a Cancel button), a string of acceptable\n characters to mean OK and to mean Cancel. The two last strings are checked\n to make sure they don't have common characters. Additionally, the same\n flag argument as for the string input is taken, as well as a result buffer.\n The result buffer is required to be at least one byte long. Depending on\n the answer, the first character from the OK or the Cancel character strings\n will be stored in the first byte of the result buffer. No NUL will be\n added, so the result is *not* a string.\n\n On success, the all return an index of the added information. That index\n is useful when retrieving results with UI_get0_result(). */\nint UI_add_input_string(UI *ui, const char *prompt, int flags,\n char *result_buf, int minsize, int maxsize);\nint UI_dup_input_string(UI *ui, const char *prompt, int flags,\n char *result_buf, int minsize, int maxsize);\nint UI_add_verify_string(UI *ui, const char *prompt, int flags,\n char *result_buf, int minsize, int maxsize,\n const char *test_buf);\nint UI_dup_verify_string(UI *ui, const char *prompt, int flags,\n char *result_buf, int minsize, int maxsize,\n const char *test_buf);\nint UI_add_input_boolean(UI *ui, const char *prompt, const char *action_desc,\n const char *ok_chars, const char *cancel_chars,\n int flags, char *result_buf);\nint UI_dup_input_boolean(UI *ui, const char *prompt, const char *action_desc,\n const char *ok_chars, const char *cancel_chars,\n int flags, char *result_buf);\nint UI_add_info_string(UI *ui, const char *text);\nint UI_dup_info_string(UI *ui, const char *text);\nint UI_add_error_string(UI *ui, const char *text);\nint UI_dup_error_string(UI *ui, const char *text);\n\n/* These are the possible flags. They can be or'ed together. */\n/* Use to have echoing of input */\n# define UI_INPUT_FLAG_ECHO 0x01\n/*\n * Use a default password. Where that password is found is completely up to\n * the application, it might for example be in the user data set with\n * UI_add_user_data(). It is not recommended to have more than one input in\n * each UI being marked with this flag, or the application might get\n * confused.\n */\n# define UI_INPUT_FLAG_DEFAULT_PWD 0x02\n\n/*-\n * The user of these routines may want to define flags of their own. The core\n * UI won't look at those, but will pass them on to the method routines. They\n * must use higher bits so they don't get confused with the UI bits above.\n * UI_INPUT_FLAG_USER_BASE tells which is the lowest bit to use. A good\n * example of use is this:\n *\n * #define MY_UI_FLAG1 (0x01 << UI_INPUT_FLAG_USER_BASE)\n *\n*/\n# define UI_INPUT_FLAG_USER_BASE 16\n\n/*-\n * The following function helps construct a prompt. object_desc is a\n * textual short description of the object, for example \"pass phrase\",\n * and object_name is the name of the object (might be a card name or\n * a file name.\n * The returned string shall always be allocated on the heap with\n * OPENSSL_malloc(), and need to be free'd with OPENSSL_free().\n *\n * If the ui_method doesn't contain a pointer to a user-defined prompt\n * constructor, a default string is built, looking like this:\n *\n * \"Enter {object_desc} for {object_name}:\"\n *\n * So, if object_desc has the value \"pass phrase\" and object_name has\n * the value \"foo.key\", the resulting string is:\n *\n * \"Enter pass phrase for foo.key:\"\n*/\nchar *UI_construct_prompt(UI *ui_method,\n const char *object_desc, const char *object_name);\n\n/*\n * The following function is used to store a pointer to user-specific data.\n * Any previous such pointer will be returned and replaced.\n *\n * For callback purposes, this function makes a lot more sense than using\n * ex_data, since the latter requires that different parts of OpenSSL or\n * applications share the same ex_data index.\n *\n * Note that the UI_OpenSSL() method completely ignores the user data. Other\n * methods may not, however.\n */\nvoid *UI_add_user_data(UI *ui, void *user_data);\n/*\n * Alternatively, this function is used to duplicate the user data.\n * This uses the duplicator method function. The destroy function will\n * be used to free the user data in this case.\n */\nint UI_dup_user_data(UI *ui, void *user_data);\n/* We need a user data retrieving function as well. */\nvoid *UI_get0_user_data(UI *ui);\n\n/* Return the result associated with a prompt given with the index i. */\nconst char *UI_get0_result(UI *ui, int i);\nint UI_get_result_length(UI *ui, int i);\n\n/* When all strings have been added, process the whole thing. */\nint UI_process(UI *ui);\n\n/*\n * Give a user interface parameterised control commands. This can be used to\n * send down an integer, a data pointer or a function pointer, as well as be\n * used to get information from a UI.\n */\nint UI_ctrl(UI *ui, int cmd, long i, void *p, void (*f) (void));\n\n/* The commands */\n/*\n * Use UI_CONTROL_PRINT_ERRORS with the value 1 to have UI_process print the\n * OpenSSL error stack before printing any info or added error messages and\n * before any prompting.\n */\n# define UI_CTRL_PRINT_ERRORS 1\n/*\n * Check if a UI_process() is possible to do again with the same instance of\n * a user interface. This makes UI_ctrl() return 1 if it is redoable, and 0\n * if not.\n */\n# define UI_CTRL_IS_REDOABLE 2\n\n/* Some methods may use extra data */\n# define UI_set_app_data(s,arg) UI_set_ex_data(s,0,arg)\n# define UI_get_app_data(s) UI_get_ex_data(s,0)\n\n# define UI_get_ex_new_index(l, p, newf, dupf, freef) \\\n CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_UI, l, p, newf, dupf, freef)\nint UI_set_ex_data(UI *r, int idx, void *arg);\nvoid *UI_get_ex_data(UI *r, int idx);\n\n/* Use specific methods instead of the built-in one */\nvoid UI_set_default_method(const UI_METHOD *meth);\nconst UI_METHOD *UI_get_default_method(void);\nconst UI_METHOD *UI_get_method(UI *ui);\nconst UI_METHOD *UI_set_method(UI *ui, const UI_METHOD *meth);\n\n# ifndef OPENSSL_NO_UI_CONSOLE\n\n/* The method with all the built-in thingies */\nUI_METHOD *UI_OpenSSL(void);\n\n# endif\n\n/*\n * NULL method. Literally does nothing, but may serve as a placeholder\n * to avoid internal default.\n */\nconst UI_METHOD *UI_null(void);\n\n/* ---------- For method writers ---------- */\n/*-\n A method contains a number of functions that implement the low level\n of the User Interface. The functions are:\n\n an opener This function starts a session, maybe by opening\n a channel to a tty, or by opening a window.\n a writer This function is called to write a given string,\n maybe to the tty, maybe as a field label in a\n window.\n a flusher This function is called to flush everything that\n has been output so far. It can be used to actually\n display a dialog box after it has been built.\n a reader This function is called to read a given prompt,\n maybe from the tty, maybe from a field in a\n window. Note that it's called with all string\n structures, not only the prompt ones, so it must\n check such things itself.\n a closer This function closes the session, maybe by closing\n the channel to the tty, or closing the window.\n\n All these functions are expected to return:\n\n 0 on error.\n 1 on success.\n -1 on out-of-band events, for example if some prompting has\n been canceled (by pressing Ctrl-C, for example). This is\n only checked when returned by the flusher or the reader.\n\n The way this is used, the opener is first called, then the writer for all\n strings, then the flusher, then the reader for all strings and finally the\n closer. Note that if you want to prompt from a terminal or other command\n line interface, the best is to have the reader also write the prompts\n instead of having the writer do it. If you want to prompt from a dialog\n box, the writer can be used to build up the contents of the box, and the\n flusher to actually display the box and run the event loop until all data\n has been given, after which the reader only grabs the given data and puts\n them back into the UI strings.\n\n All method functions take a UI as argument. Additionally, the writer and\n the reader take a UI_STRING.\n*/\n\n/*\n * The UI_STRING type is the data structure that contains all the needed info\n * about a string or a prompt, including test data for a verification prompt.\n */\ntypedef struct ui_string_st UI_STRING;\nDEFINE_STACK_OF(UI_STRING)\n\n/*\n * The different types of strings that are currently supported. This is only\n * needed by method authors.\n */\nenum UI_string_types {\n UIT_NONE = 0,\n UIT_PROMPT, /* Prompt for a string */\n UIT_VERIFY, /* Prompt for a string and verify */\n UIT_BOOLEAN, /* Prompt for a yes/no response */\n UIT_INFO, /* Send info to the user */\n UIT_ERROR /* Send an error message to the user */\n};\n\n/* Create and manipulate methods */\nUI_METHOD *UI_create_method(const char *name);\nvoid UI_destroy_method(UI_METHOD *ui_method);\nint UI_method_set_opener(UI_METHOD *method, int (*opener) (UI *ui));\nint UI_method_set_writer(UI_METHOD *method,\n int (*writer) (UI *ui, UI_STRING *uis));\nint UI_method_set_flusher(UI_METHOD *method, int (*flusher) (UI *ui));\nint UI_method_set_reader(UI_METHOD *method,\n int (*reader) (UI *ui, UI_STRING *uis));\nint UI_method_set_closer(UI_METHOD *method, int (*closer) (UI *ui));\nint UI_method_set_data_duplicator(UI_METHOD *method,\n void *(*duplicator) (UI *ui, void *ui_data),\n void (*destructor)(UI *ui, void *ui_data));\nint UI_method_set_prompt_constructor(UI_METHOD *method,\n char *(*prompt_constructor) (UI *ui,\n const char\n *object_desc,\n const char\n *object_name));\nint UI_method_set_ex_data(UI_METHOD *method, int idx, void *data);\nint (*UI_method_get_opener(const UI_METHOD *method)) (UI *);\nint (*UI_method_get_writer(const UI_METHOD *method)) (UI *, UI_STRING *);\nint (*UI_method_get_flusher(const UI_METHOD *method)) (UI *);\nint (*UI_method_get_reader(const UI_METHOD *method)) (UI *, UI_STRING *);\nint (*UI_method_get_closer(const UI_METHOD *method)) (UI *);\nchar *(*UI_method_get_prompt_constructor(const UI_METHOD *method))\n (UI *, const char *, const char *);\nvoid *(*UI_method_get_data_duplicator(const UI_METHOD *method)) (UI *, void *);\nvoid (*UI_method_get_data_destructor(const UI_METHOD *method)) (UI *, void *);\nconst void *UI_method_get_ex_data(const UI_METHOD *method, int idx);\n\n/*\n * The following functions are helpers for method writers to access relevant\n * data from a UI_STRING.\n */\n\n/* Return type of the UI_STRING */\nenum UI_string_types UI_get_string_type(UI_STRING *uis);\n/* Return input flags of the UI_STRING */\nint UI_get_input_flags(UI_STRING *uis);\n/* Return the actual string to output (the prompt, info or error) */\nconst char *UI_get0_output_string(UI_STRING *uis);\n/*\n * Return the optional action string to output (the boolean prompt\n * instruction)\n */\nconst char *UI_get0_action_string(UI_STRING *uis);\n/* Return the result of a prompt */\nconst char *UI_get0_result_string(UI_STRING *uis);\nint UI_get_result_string_length(UI_STRING *uis);\n/*\n * Return the string to test the result against. Only useful with verifies.\n */\nconst char *UI_get0_test_string(UI_STRING *uis);\n/* Return the required minimum size of the result */\nint UI_get_result_minsize(UI_STRING *uis);\n/* Return the required maximum size of the result */\nint UI_get_result_maxsize(UI_STRING *uis);\n/* Set the result of a UI_STRING. */\nint UI_set_result(UI *ui, UI_STRING *uis, const char *result);\nint UI_set_result_ex(UI *ui, UI_STRING *uis, const char *result, int len);\n\n/* A couple of popular utility functions */\nint UI_UTIL_read_pw_string(char *buf, int length, const char *prompt,\n int verify);\nint UI_UTIL_read_pw(char *buf, char *buff, int size, const char *prompt,\n int verify);\nUI_METHOD *UI_UTIL_wrap_read_pem_callback(pem_password_cb *cb, int rwflag);\n\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/uierr.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_UIERR_H\n# define HEADER_UIERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_UI_strings(void);\n\n/*\n * UI function codes.\n */\n# define UI_F_CLOSE_CONSOLE 115\n# define UI_F_ECHO_CONSOLE 116\n# define UI_F_GENERAL_ALLOCATE_BOOLEAN 108\n# define UI_F_GENERAL_ALLOCATE_PROMPT 109\n# define UI_F_NOECHO_CONSOLE 117\n# define UI_F_OPEN_CONSOLE 114\n# define UI_F_UI_CONSTRUCT_PROMPT 121\n# define UI_F_UI_CREATE_METHOD 112\n# define UI_F_UI_CTRL 111\n# define UI_F_UI_DUP_ERROR_STRING 101\n# define UI_F_UI_DUP_INFO_STRING 102\n# define UI_F_UI_DUP_INPUT_BOOLEAN 110\n# define UI_F_UI_DUP_INPUT_STRING 103\n# define UI_F_UI_DUP_USER_DATA 118\n# define UI_F_UI_DUP_VERIFY_STRING 106\n# define UI_F_UI_GET0_RESULT 107\n# define UI_F_UI_GET_RESULT_LENGTH 119\n# define UI_F_UI_NEW_METHOD 104\n# define UI_F_UI_PROCESS 113\n# define UI_F_UI_SET_RESULT 105\n# define UI_F_UI_SET_RESULT_EX 120\n\n/*\n * UI reason codes.\n */\n# define UI_R_COMMON_OK_AND_CANCEL_CHARACTERS 104\n# define UI_R_INDEX_TOO_LARGE 102\n# define UI_R_INDEX_TOO_SMALL 103\n# define UI_R_NO_RESULT_BUFFER 105\n# define UI_R_PROCESSING_ERROR 107\n# define UI_R_RESULT_TOO_LARGE 100\n# define UI_R_RESULT_TOO_SMALL 101\n# define UI_R_SYSASSIGN_ERROR 109\n# define UI_R_SYSDASSGN_ERROR 110\n# define UI_R_SYSQIOW_ERROR 111\n# define UI_R_UNKNOWN_CONTROL_COMMAND 106\n# define UI_R_UNKNOWN_TTYGET_ERRNO_VALUE 108\n# define UI_R_USER_DATA_DUPLICATION_UNSUPPORTED 112\n\n#endif\n" }, { "path": "cryptomini/include/openssl/whrlpool.h", "content": "/*\n * Copyright 2005-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_WHRLPOOL_H\n# define HEADER_WHRLPOOL_H\n\n#include \n\n# ifndef OPENSSL_NO_WHIRLPOOL\n# include \n# include \n# ifdef __cplusplus\nextern \"C\" {\n# endif\n\n# define WHIRLPOOL_DIGEST_LENGTH (512/8)\n# define WHIRLPOOL_BBLOCK 512\n# define WHIRLPOOL_COUNTER (256/8)\n\ntypedef struct {\n union {\n unsigned char c[WHIRLPOOL_DIGEST_LENGTH];\n /* double q is here to ensure 64-bit alignment */\n double q[WHIRLPOOL_DIGEST_LENGTH / sizeof(double)];\n } H;\n unsigned char data[WHIRLPOOL_BBLOCK / 8];\n unsigned int bitoff;\n size_t bitlen[WHIRLPOOL_COUNTER / sizeof(size_t)];\n} WHIRLPOOL_CTX;\n\nint WHIRLPOOL_Init(WHIRLPOOL_CTX *c);\nint WHIRLPOOL_Update(WHIRLPOOL_CTX *c, const void *inp, size_t bytes);\nvoid WHIRLPOOL_BitUpdate(WHIRLPOOL_CTX *c, const void *inp, size_t bits);\nint WHIRLPOOL_Final(unsigned char *md, WHIRLPOOL_CTX *c);\nunsigned char *WHIRLPOOL(const void *inp, size_t bytes, unsigned char *md);\n\n# ifdef __cplusplus\n}\n# endif\n# endif\n\n#endif\n" }, { "path": "cryptomini/include/openssl/x509.h", "content": "/*\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_X509_H\n# define HEADER_X509_H\n\n# include \n# include \n# include \n# include \n# include \n# include \n# include \n# include \n# include \n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# include \n# include \n# include \n# endif\n\n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n\n/* Flags for X509_get_signature_info() */\n/* Signature info is valid */\n# define X509_SIG_INFO_VALID 0x1\n/* Signature is suitable for TLS use */\n# define X509_SIG_INFO_TLS 0x2\n\n# define X509_FILETYPE_PEM 1\n# define X509_FILETYPE_ASN1 2\n# define X509_FILETYPE_DEFAULT 3\n\n# define X509v3_KU_DIGITAL_SIGNATURE 0x0080\n# define X509v3_KU_NON_REPUDIATION 0x0040\n# define X509v3_KU_KEY_ENCIPHERMENT 0x0020\n# define X509v3_KU_DATA_ENCIPHERMENT 0x0010\n# define X509v3_KU_KEY_AGREEMENT 0x0008\n# define X509v3_KU_KEY_CERT_SIGN 0x0004\n# define X509v3_KU_CRL_SIGN 0x0002\n# define X509v3_KU_ENCIPHER_ONLY 0x0001\n# define X509v3_KU_DECIPHER_ONLY 0x8000\n# define X509v3_KU_UNDEF 0xffff\n\nstruct X509_algor_st {\n ASN1_OBJECT *algorithm;\n ASN1_TYPE *parameter;\n} /* X509_ALGOR */ ;\n\ntypedef STACK_OF(X509_ALGOR) X509_ALGORS;\n\ntypedef struct X509_val_st {\n ASN1_TIME *notBefore;\n ASN1_TIME *notAfter;\n} X509_VAL;\n\ntypedef struct X509_sig_st X509_SIG;\n\ntypedef struct X509_name_entry_st X509_NAME_ENTRY;\n\nDEFINE_STACK_OF(X509_NAME_ENTRY)\n\nDEFINE_STACK_OF(X509_NAME)\n\n# define X509_EX_V_NETSCAPE_HACK 0x8000\n# define X509_EX_V_INIT 0x0001\ntypedef struct X509_extension_st X509_EXTENSION;\n\ntypedef STACK_OF(X509_EXTENSION) X509_EXTENSIONS;\n\nDEFINE_STACK_OF(X509_EXTENSION)\n\ntypedef struct x509_attributes_st X509_ATTRIBUTE;\n\nDEFINE_STACK_OF(X509_ATTRIBUTE)\n\ntypedef struct X509_req_info_st X509_REQ_INFO;\n\ntypedef struct X509_req_st X509_REQ;\n\ntypedef struct x509_cert_aux_st X509_CERT_AUX;\n\ntypedef struct x509_cinf_st X509_CINF;\n\nDEFINE_STACK_OF(X509)\n\n/* This is used for a table of trust checking functions */\n\ntypedef struct x509_trust_st {\n int trust;\n int flags;\n int (*check_trust) (struct x509_trust_st *, X509 *, int);\n char *name;\n int arg1;\n void *arg2;\n} X509_TRUST;\n\nDEFINE_STACK_OF(X509_TRUST)\n\n/* standard trust ids */\n\n# define X509_TRUST_DEFAULT 0 /* Only valid in purpose settings */\n\n# define X509_TRUST_COMPAT 1\n# define X509_TRUST_SSL_CLIENT 2\n# define X509_TRUST_SSL_SERVER 3\n# define X509_TRUST_EMAIL 4\n# define X509_TRUST_OBJECT_SIGN 5\n# define X509_TRUST_OCSP_SIGN 6\n# define X509_TRUST_OCSP_REQUEST 7\n# define X509_TRUST_TSA 8\n\n/* Keep these up to date! */\n# define X509_TRUST_MIN 1\n# define X509_TRUST_MAX 8\n\n/* trust_flags values */\n# define X509_TRUST_DYNAMIC (1U << 0)\n# define X509_TRUST_DYNAMIC_NAME (1U << 1)\n/* No compat trust if self-signed, preempts \"DO_SS\" */\n# define X509_TRUST_NO_SS_COMPAT (1U << 2)\n/* Compat trust if no explicit accepted trust EKUs */\n# define X509_TRUST_DO_SS_COMPAT (1U << 3)\n/* Accept \"anyEKU\" as a wildcard trust OID */\n# define X509_TRUST_OK_ANY_EKU (1U << 4)\n\n/* check_trust return codes */\n\n# define X509_TRUST_TRUSTED 1\n# define X509_TRUST_REJECTED 2\n# define X509_TRUST_UNTRUSTED 3\n\n/* Flags for X509_print_ex() */\n\n# define X509_FLAG_COMPAT 0\n# define X509_FLAG_NO_HEADER 1L\n# define X509_FLAG_NO_VERSION (1L << 1)\n# define X509_FLAG_NO_SERIAL (1L << 2)\n# define X509_FLAG_NO_SIGNAME (1L << 3)\n# define X509_FLAG_NO_ISSUER (1L << 4)\n# define X509_FLAG_NO_VALIDITY (1L << 5)\n# define X509_FLAG_NO_SUBJECT (1L << 6)\n# define X509_FLAG_NO_PUBKEY (1L << 7)\n# define X509_FLAG_NO_EXTENSIONS (1L << 8)\n# define X509_FLAG_NO_SIGDUMP (1L << 9)\n# define X509_FLAG_NO_AUX (1L << 10)\n# define X509_FLAG_NO_ATTRIBUTES (1L << 11)\n# define X509_FLAG_NO_IDS (1L << 12)\n\n/* Flags specific to X509_NAME_print_ex() */\n\n/* The field separator information */\n\n# define XN_FLAG_SEP_MASK (0xf << 16)\n\n# define XN_FLAG_COMPAT 0/* Traditional; use old X509_NAME_print */\n# define XN_FLAG_SEP_COMMA_PLUS (1 << 16)/* RFC2253 ,+ */\n# define XN_FLAG_SEP_CPLUS_SPC (2 << 16)/* ,+ spaced: more readable */\n# define XN_FLAG_SEP_SPLUS_SPC (3 << 16)/* ;+ spaced */\n# define XN_FLAG_SEP_MULTILINE (4 << 16)/* One line per field */\n\n# define XN_FLAG_DN_REV (1 << 20)/* Reverse DN order */\n\n/* How the field name is shown */\n\n# define XN_FLAG_FN_MASK (0x3 << 21)\n\n# define XN_FLAG_FN_SN 0/* Object short name */\n# define XN_FLAG_FN_LN (1 << 21)/* Object long name */\n# define XN_FLAG_FN_OID (2 << 21)/* Always use OIDs */\n# define XN_FLAG_FN_NONE (3 << 21)/* No field names */\n\n# define XN_FLAG_SPC_EQ (1 << 23)/* Put spaces round '=' */\n\n/*\n * This determines if we dump fields we don't recognise: RFC2253 requires\n * this.\n */\n\n# define XN_FLAG_DUMP_UNKNOWN_FIELDS (1 << 24)\n\n# define XN_FLAG_FN_ALIGN (1 << 25)/* Align field names to 20\n * characters */\n\n/* Complete set of RFC2253 flags */\n\n# define XN_FLAG_RFC2253 (ASN1_STRFLGS_RFC2253 | \\\n XN_FLAG_SEP_COMMA_PLUS | \\\n XN_FLAG_DN_REV | \\\n XN_FLAG_FN_SN | \\\n XN_FLAG_DUMP_UNKNOWN_FIELDS)\n\n/* readable oneline form */\n\n# define XN_FLAG_ONELINE (ASN1_STRFLGS_RFC2253 | \\\n ASN1_STRFLGS_ESC_QUOTE | \\\n XN_FLAG_SEP_CPLUS_SPC | \\\n XN_FLAG_SPC_EQ | \\\n XN_FLAG_FN_SN)\n\n/* readable multiline form */\n\n# define XN_FLAG_MULTILINE (ASN1_STRFLGS_ESC_CTRL | \\\n ASN1_STRFLGS_ESC_MSB | \\\n XN_FLAG_SEP_MULTILINE | \\\n XN_FLAG_SPC_EQ | \\\n XN_FLAG_FN_LN | \\\n XN_FLAG_FN_ALIGN)\n\nDEFINE_STACK_OF(X509_REVOKED)\n\ntypedef struct X509_crl_info_st X509_CRL_INFO;\n\nDEFINE_STACK_OF(X509_CRL)\n\ntypedef struct private_key_st {\n int version;\n /* The PKCS#8 data types */\n X509_ALGOR *enc_algor;\n ASN1_OCTET_STRING *enc_pkey; /* encrypted pub key */\n /* When decrypted, the following will not be NULL */\n EVP_PKEY *dec_pkey;\n /* used to encrypt and decrypt */\n int key_length;\n char *key_data;\n int key_free; /* true if we should auto free key_data */\n /* expanded version of 'enc_algor' */\n EVP_CIPHER_INFO cipher;\n} X509_PKEY;\n\ntypedef struct X509_info_st {\n X509 *x509;\n X509_CRL *crl;\n X509_PKEY *x_pkey;\n EVP_CIPHER_INFO enc_cipher;\n int enc_len;\n char *enc_data;\n} X509_INFO;\n\nDEFINE_STACK_OF(X509_INFO)\n\n/*\n * The next 2 structures and their 8 routines are used to manipulate Netscape's\n * spki structures - useful if you are writing a CA web page\n */\ntypedef struct Netscape_spkac_st {\n X509_PUBKEY *pubkey;\n ASN1_IA5STRING *challenge; /* challenge sent in atlas >= PR2 */\n} NETSCAPE_SPKAC;\n\ntypedef struct Netscape_spki_st {\n NETSCAPE_SPKAC *spkac; /* signed public key and challenge */\n X509_ALGOR sig_algor;\n ASN1_BIT_STRING *signature;\n} NETSCAPE_SPKI;\n\n/* Netscape certificate sequence structure */\ntypedef struct Netscape_certificate_sequence {\n ASN1_OBJECT *type;\n STACK_OF(X509) *certs;\n} NETSCAPE_CERT_SEQUENCE;\n\n/*- Unused (and iv length is wrong)\ntypedef struct CBCParameter_st\n {\n unsigned char iv[8];\n } CBC_PARAM;\n*/\n\n/* Password based encryption structure */\n\ntypedef struct PBEPARAM_st {\n ASN1_OCTET_STRING *salt;\n ASN1_INTEGER *iter;\n} PBEPARAM;\n\n/* Password based encryption V2 structures */\n\ntypedef struct PBE2PARAM_st {\n X509_ALGOR *keyfunc;\n X509_ALGOR *encryption;\n} PBE2PARAM;\n\ntypedef struct PBKDF2PARAM_st {\n/* Usually OCTET STRING but could be anything */\n ASN1_TYPE *salt;\n ASN1_INTEGER *iter;\n ASN1_INTEGER *keylength;\n X509_ALGOR *prf;\n} PBKDF2PARAM;\n\n#ifndef OPENSSL_NO_SCRYPT\ntypedef struct SCRYPT_PARAMS_st {\n ASN1_OCTET_STRING *salt;\n ASN1_INTEGER *costParameter;\n ASN1_INTEGER *blockSize;\n ASN1_INTEGER *parallelizationParameter;\n ASN1_INTEGER *keyLength;\n} SCRYPT_PARAMS;\n#endif\n\n#ifdef __cplusplus\n}\n#endif\n\n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n# define X509_EXT_PACK_UNKNOWN 1\n# define X509_EXT_PACK_STRING 2\n\n# define X509_extract_key(x) X509_get_pubkey(x)/*****/\n# define X509_REQ_extract_key(a) X509_REQ_get_pubkey(a)\n# define X509_name_cmp(a,b) X509_NAME_cmp((a),(b))\n\nvoid X509_CRL_set_default_method(const X509_CRL_METHOD *meth);\nX509_CRL_METHOD *X509_CRL_METHOD_new(int (*crl_init) (X509_CRL *crl),\n int (*crl_free) (X509_CRL *crl),\n int (*crl_lookup) (X509_CRL *crl,\n X509_REVOKED **ret,\n ASN1_INTEGER *ser,\n X509_NAME *issuer),\n int (*crl_verify) (X509_CRL *crl,\n EVP_PKEY *pk));\nvoid X509_CRL_METHOD_free(X509_CRL_METHOD *m);\n\nvoid X509_CRL_set_meth_data(X509_CRL *crl, void *dat);\nvoid *X509_CRL_get_meth_data(X509_CRL *crl);\n\nconst char *X509_verify_cert_error_string(long n);\n\nint X509_verify(X509 *a, EVP_PKEY *r);\n\nint X509_REQ_verify(X509_REQ *a, EVP_PKEY *r);\nint X509_CRL_verify(X509_CRL *a, EVP_PKEY *r);\nint NETSCAPE_SPKI_verify(NETSCAPE_SPKI *a, EVP_PKEY *r);\n\nNETSCAPE_SPKI *NETSCAPE_SPKI_b64_decode(const char *str, int len);\nchar *NETSCAPE_SPKI_b64_encode(NETSCAPE_SPKI *x);\nEVP_PKEY *NETSCAPE_SPKI_get_pubkey(NETSCAPE_SPKI *x);\nint NETSCAPE_SPKI_set_pubkey(NETSCAPE_SPKI *x, EVP_PKEY *pkey);\n\nint NETSCAPE_SPKI_print(BIO *out, NETSCAPE_SPKI *spki);\n\nint X509_signature_dump(BIO *bp, const ASN1_STRING *sig, int indent);\nint X509_signature_print(BIO *bp, const X509_ALGOR *alg,\n const ASN1_STRING *sig);\n\nint X509_sign(X509 *x, EVP_PKEY *pkey, const EVP_MD *md);\nint X509_sign_ctx(X509 *x, EVP_MD_CTX *ctx);\n# ifndef OPENSSL_NO_OCSP\nint X509_http_nbio(OCSP_REQ_CTX *rctx, X509 **pcert);\n# endif\nint X509_REQ_sign(X509_REQ *x, EVP_PKEY *pkey, const EVP_MD *md);\nint X509_REQ_sign_ctx(X509_REQ *x, EVP_MD_CTX *ctx);\nint X509_CRL_sign(X509_CRL *x, EVP_PKEY *pkey, const EVP_MD *md);\nint X509_CRL_sign_ctx(X509_CRL *x, EVP_MD_CTX *ctx);\n# ifndef OPENSSL_NO_OCSP\nint X509_CRL_http_nbio(OCSP_REQ_CTX *rctx, X509_CRL **pcrl);\n# endif\nint NETSCAPE_SPKI_sign(NETSCAPE_SPKI *x, EVP_PKEY *pkey, const EVP_MD *md);\n\nint X509_pubkey_digest(const X509 *data, const EVP_MD *type,\n unsigned char *md, unsigned int *len);\nint X509_digest(const X509 *data, const EVP_MD *type,\n unsigned char *md, unsigned int *len);\nint X509_CRL_digest(const X509_CRL *data, const EVP_MD *type,\n unsigned char *md, unsigned int *len);\nint X509_REQ_digest(const X509_REQ *data, const EVP_MD *type,\n unsigned char *md, unsigned int *len);\nint X509_NAME_digest(const X509_NAME *data, const EVP_MD *type,\n unsigned char *md, unsigned int *len);\n\n# ifndef OPENSSL_NO_STDIO\nX509 *d2i_X509_fp(FILE *fp, X509 **x509);\nint i2d_X509_fp(FILE *fp, X509 *x509);\nX509_CRL *d2i_X509_CRL_fp(FILE *fp, X509_CRL **crl);\nint i2d_X509_CRL_fp(FILE *fp, X509_CRL *crl);\nX509_REQ *d2i_X509_REQ_fp(FILE *fp, X509_REQ **req);\nint i2d_X509_REQ_fp(FILE *fp, X509_REQ *req);\n# ifndef OPENSSL_NO_RSA\nRSA *d2i_RSAPrivateKey_fp(FILE *fp, RSA **rsa);\nint i2d_RSAPrivateKey_fp(FILE *fp, RSA *rsa);\nRSA *d2i_RSAPublicKey_fp(FILE *fp, RSA **rsa);\nint i2d_RSAPublicKey_fp(FILE *fp, RSA *rsa);\nRSA *d2i_RSA_PUBKEY_fp(FILE *fp, RSA **rsa);\nint i2d_RSA_PUBKEY_fp(FILE *fp, RSA *rsa);\n# endif\n# ifndef OPENSSL_NO_DSA\nDSA *d2i_DSA_PUBKEY_fp(FILE *fp, DSA **dsa);\nint i2d_DSA_PUBKEY_fp(FILE *fp, DSA *dsa);\nDSA *d2i_DSAPrivateKey_fp(FILE *fp, DSA **dsa);\nint i2d_DSAPrivateKey_fp(FILE *fp, DSA *dsa);\n# endif\n# ifndef OPENSSL_NO_EC\nEC_KEY *d2i_EC_PUBKEY_fp(FILE *fp, EC_KEY **eckey);\nint i2d_EC_PUBKEY_fp(FILE *fp, EC_KEY *eckey);\nEC_KEY *d2i_ECPrivateKey_fp(FILE *fp, EC_KEY **eckey);\nint i2d_ECPrivateKey_fp(FILE *fp, EC_KEY *eckey);\n# endif\nX509_SIG *d2i_PKCS8_fp(FILE *fp, X509_SIG **p8);\nint i2d_PKCS8_fp(FILE *fp, X509_SIG *p8);\nPKCS8_PRIV_KEY_INFO *d2i_PKCS8_PRIV_KEY_INFO_fp(FILE *fp,\n PKCS8_PRIV_KEY_INFO **p8inf);\nint i2d_PKCS8_PRIV_KEY_INFO_fp(FILE *fp, PKCS8_PRIV_KEY_INFO *p8inf);\nint i2d_PKCS8PrivateKeyInfo_fp(FILE *fp, EVP_PKEY *key);\nint i2d_PrivateKey_fp(FILE *fp, EVP_PKEY *pkey);\nEVP_PKEY *d2i_PrivateKey_fp(FILE *fp, EVP_PKEY **a);\nint i2d_PUBKEY_fp(FILE *fp, EVP_PKEY *pkey);\nEVP_PKEY *d2i_PUBKEY_fp(FILE *fp, EVP_PKEY **a);\n# endif\n\nX509 *d2i_X509_bio(BIO *bp, X509 **x509);\nint i2d_X509_bio(BIO *bp, X509 *x509);\nX509_CRL *d2i_X509_CRL_bio(BIO *bp, X509_CRL **crl);\nint i2d_X509_CRL_bio(BIO *bp, X509_CRL *crl);\nX509_REQ *d2i_X509_REQ_bio(BIO *bp, X509_REQ **req);\nint i2d_X509_REQ_bio(BIO *bp, X509_REQ *req);\n# ifndef OPENSSL_NO_RSA\nRSA *d2i_RSAPrivateKey_bio(BIO *bp, RSA **rsa);\nint i2d_RSAPrivateKey_bio(BIO *bp, RSA *rsa);\nRSA *d2i_RSAPublicKey_bio(BIO *bp, RSA **rsa);\nint i2d_RSAPublicKey_bio(BIO *bp, RSA *rsa);\nRSA *d2i_RSA_PUBKEY_bio(BIO *bp, RSA **rsa);\nint i2d_RSA_PUBKEY_bio(BIO *bp, RSA *rsa);\n# endif\n# ifndef OPENSSL_NO_DSA\nDSA *d2i_DSA_PUBKEY_bio(BIO *bp, DSA **dsa);\nint i2d_DSA_PUBKEY_bio(BIO *bp, DSA *dsa);\nDSA *d2i_DSAPrivateKey_bio(BIO *bp, DSA **dsa);\nint i2d_DSAPrivateKey_bio(BIO *bp, DSA *dsa);\n# endif\n# ifndef OPENSSL_NO_EC\nEC_KEY *d2i_EC_PUBKEY_bio(BIO *bp, EC_KEY **eckey);\nint i2d_EC_PUBKEY_bio(BIO *bp, EC_KEY *eckey);\nEC_KEY *d2i_ECPrivateKey_bio(BIO *bp, EC_KEY **eckey);\nint i2d_ECPrivateKey_bio(BIO *bp, EC_KEY *eckey);\n# endif\nX509_SIG *d2i_PKCS8_bio(BIO *bp, X509_SIG **p8);\nint i2d_PKCS8_bio(BIO *bp, X509_SIG *p8);\nPKCS8_PRIV_KEY_INFO *d2i_PKCS8_PRIV_KEY_INFO_bio(BIO *bp,\n PKCS8_PRIV_KEY_INFO **p8inf);\nint i2d_PKCS8_PRIV_KEY_INFO_bio(BIO *bp, PKCS8_PRIV_KEY_INFO *p8inf);\nint i2d_PKCS8PrivateKeyInfo_bio(BIO *bp, EVP_PKEY *key);\nint i2d_PrivateKey_bio(BIO *bp, EVP_PKEY *pkey);\nEVP_PKEY *d2i_PrivateKey_bio(BIO *bp, EVP_PKEY **a);\nint i2d_PUBKEY_bio(BIO *bp, EVP_PKEY *pkey);\nEVP_PKEY *d2i_PUBKEY_bio(BIO *bp, EVP_PKEY **a);\n\nX509 *X509_dup(X509 *x509);\nX509_ATTRIBUTE *X509_ATTRIBUTE_dup(X509_ATTRIBUTE *xa);\nX509_EXTENSION *X509_EXTENSION_dup(X509_EXTENSION *ex);\nX509_CRL *X509_CRL_dup(X509_CRL *crl);\nX509_REVOKED *X509_REVOKED_dup(X509_REVOKED *rev);\nX509_REQ *X509_REQ_dup(X509_REQ *req);\nX509_ALGOR *X509_ALGOR_dup(X509_ALGOR *xn);\nint X509_ALGOR_set0(X509_ALGOR *alg, ASN1_OBJECT *aobj, int ptype,\n void *pval);\nvoid X509_ALGOR_get0(const ASN1_OBJECT **paobj, int *pptype,\n const void **ppval, const X509_ALGOR *algor);\nvoid X509_ALGOR_set_md(X509_ALGOR *alg, const EVP_MD *md);\nint X509_ALGOR_cmp(const X509_ALGOR *a, const X509_ALGOR *b);\nint X509_ALGOR_copy(X509_ALGOR *dest, const X509_ALGOR *src);\n\nX509_NAME *X509_NAME_dup(X509_NAME *xn);\nX509_NAME_ENTRY *X509_NAME_ENTRY_dup(X509_NAME_ENTRY *ne);\n\nint X509_cmp_time(const ASN1_TIME *s, time_t *t);\nint X509_cmp_current_time(const ASN1_TIME *s);\nASN1_TIME *X509_time_adj(ASN1_TIME *s, long adj, time_t *t);\nASN1_TIME *X509_time_adj_ex(ASN1_TIME *s,\n int offset_day, long offset_sec, time_t *t);\nASN1_TIME *X509_gmtime_adj(ASN1_TIME *s, long adj);\n\nconst char *X509_get_default_cert_area(void);\nconst char *X509_get_default_cert_dir(void);\nconst char *X509_get_default_cert_file(void);\nconst char *X509_get_default_cert_dir_env(void);\nconst char *X509_get_default_cert_file_env(void);\nconst char *X509_get_default_private_dir(void);\n\nX509_REQ *X509_to_X509_REQ(X509 *x, EVP_PKEY *pkey, const EVP_MD *md);\nX509 *X509_REQ_to_X509(X509_REQ *r, int days, EVP_PKEY *pkey);\n\nDECLARE_ASN1_FUNCTIONS(X509_ALGOR)\nDECLARE_ASN1_ENCODE_FUNCTIONS(X509_ALGORS, X509_ALGORS, X509_ALGORS)\nDECLARE_ASN1_FUNCTIONS(X509_VAL)\n\nDECLARE_ASN1_FUNCTIONS(X509_PUBKEY)\n\nint X509_PUBKEY_set(X509_PUBKEY **x, EVP_PKEY *pkey);\nEVP_PKEY *X509_PUBKEY_get0(X509_PUBKEY *key);\nEVP_PKEY *X509_PUBKEY_get(X509_PUBKEY *key);\nint X509_get_pubkey_parameters(EVP_PKEY *pkey, STACK_OF(X509) *chain);\nlong X509_get_pathlen(X509 *x);\nint i2d_PUBKEY(EVP_PKEY *a, unsigned char **pp);\nEVP_PKEY *d2i_PUBKEY(EVP_PKEY **a, const unsigned char **pp, long length);\n# ifndef OPENSSL_NO_RSA\nint i2d_RSA_PUBKEY(RSA *a, unsigned char **pp);\nRSA *d2i_RSA_PUBKEY(RSA **a, const unsigned char **pp, long length);\n# endif\n# ifndef OPENSSL_NO_DSA\nint i2d_DSA_PUBKEY(DSA *a, unsigned char **pp);\nDSA *d2i_DSA_PUBKEY(DSA **a, const unsigned char **pp, long length);\n# endif\n# ifndef OPENSSL_NO_EC\nint i2d_EC_PUBKEY(EC_KEY *a, unsigned char **pp);\nEC_KEY *d2i_EC_PUBKEY(EC_KEY **a, const unsigned char **pp, long length);\n# endif\n\nDECLARE_ASN1_FUNCTIONS(X509_SIG)\nvoid X509_SIG_get0(const X509_SIG *sig, const X509_ALGOR **palg,\n const ASN1_OCTET_STRING **pdigest);\nvoid X509_SIG_getm(X509_SIG *sig, X509_ALGOR **palg,\n ASN1_OCTET_STRING **pdigest);\n\nDECLARE_ASN1_FUNCTIONS(X509_REQ_INFO)\nDECLARE_ASN1_FUNCTIONS(X509_REQ)\n\nDECLARE_ASN1_FUNCTIONS(X509_ATTRIBUTE)\nX509_ATTRIBUTE *X509_ATTRIBUTE_create(int nid, int atrtype, void *value);\n\nDECLARE_ASN1_FUNCTIONS(X509_EXTENSION)\nDECLARE_ASN1_ENCODE_FUNCTIONS(X509_EXTENSIONS, X509_EXTENSIONS, X509_EXTENSIONS)\n\nDECLARE_ASN1_FUNCTIONS(X509_NAME_ENTRY)\n\nDECLARE_ASN1_FUNCTIONS(X509_NAME)\n\nint X509_NAME_set(X509_NAME **xn, X509_NAME *name);\n\nDECLARE_ASN1_FUNCTIONS(X509_CINF)\n\nDECLARE_ASN1_FUNCTIONS(X509)\nDECLARE_ASN1_FUNCTIONS(X509_CERT_AUX)\n\n#define X509_get_ex_new_index(l, p, newf, dupf, freef) \\\n CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_X509, l, p, newf, dupf, freef)\nint X509_set_ex_data(X509 *r, int idx, void *arg);\nvoid *X509_get_ex_data(X509 *r, int idx);\nint i2d_X509_AUX(X509 *a, unsigned char **pp);\nX509 *d2i_X509_AUX(X509 **a, const unsigned char **pp, long length);\n\nint i2d_re_X509_tbs(X509 *x, unsigned char **pp);\n\nint X509_SIG_INFO_get(const X509_SIG_INFO *siginf, int *mdnid, int *pknid,\n int *secbits, uint32_t *flags);\nvoid X509_SIG_INFO_set(X509_SIG_INFO *siginf, int mdnid, int pknid,\n int secbits, uint32_t flags);\n\nint X509_get_signature_info(X509 *x, int *mdnid, int *pknid, int *secbits,\n uint32_t *flags);\n\nvoid X509_get0_signature(const ASN1_BIT_STRING **psig,\n const X509_ALGOR **palg, const X509 *x);\nint X509_get_signature_nid(const X509 *x);\n\nint X509_trusted(const X509 *x);\nint X509_alias_set1(X509 *x, const unsigned char *name, int len);\nint X509_keyid_set1(X509 *x, const unsigned char *id, int len);\nunsigned char *X509_alias_get0(X509 *x, int *len);\nunsigned char *X509_keyid_get0(X509 *x, int *len);\nint (*X509_TRUST_set_default(int (*trust) (int, X509 *, int))) (int, X509 *,\n int);\nint X509_TRUST_set(int *t, int trust);\nint X509_add1_trust_object(X509 *x, const ASN1_OBJECT *obj);\nint X509_add1_reject_object(X509 *x, const ASN1_OBJECT *obj);\nvoid X509_trust_clear(X509 *x);\nvoid X509_reject_clear(X509 *x);\n\nSTACK_OF(ASN1_OBJECT) *X509_get0_trust_objects(X509 *x);\nSTACK_OF(ASN1_OBJECT) *X509_get0_reject_objects(X509 *x);\n\nDECLARE_ASN1_FUNCTIONS(X509_REVOKED)\nDECLARE_ASN1_FUNCTIONS(X509_CRL_INFO)\nDECLARE_ASN1_FUNCTIONS(X509_CRL)\n\nint X509_CRL_add0_revoked(X509_CRL *crl, X509_REVOKED *rev);\nint X509_CRL_get0_by_serial(X509_CRL *crl,\n X509_REVOKED **ret, ASN1_INTEGER *serial);\nint X509_CRL_get0_by_cert(X509_CRL *crl, X509_REVOKED **ret, X509 *x);\n\nX509_PKEY *X509_PKEY_new(void);\nvoid X509_PKEY_free(X509_PKEY *a);\n\nDECLARE_ASN1_FUNCTIONS(NETSCAPE_SPKI)\nDECLARE_ASN1_FUNCTIONS(NETSCAPE_SPKAC)\nDECLARE_ASN1_FUNCTIONS(NETSCAPE_CERT_SEQUENCE)\n\nX509_INFO *X509_INFO_new(void);\nvoid X509_INFO_free(X509_INFO *a);\nchar *X509_NAME_oneline(const X509_NAME *a, char *buf, int size);\n\nint ASN1_verify(i2d_of_void *i2d, X509_ALGOR *algor1,\n ASN1_BIT_STRING *signature, char *data, EVP_PKEY *pkey);\n\nint ASN1_digest(i2d_of_void *i2d, const EVP_MD *type, char *data,\n unsigned char *md, unsigned int *len);\n\nint ASN1_sign(i2d_of_void *i2d, X509_ALGOR *algor1,\n X509_ALGOR *algor2, ASN1_BIT_STRING *signature,\n char *data, EVP_PKEY *pkey, const EVP_MD *type);\n\nint ASN1_item_digest(const ASN1_ITEM *it, const EVP_MD *type, void *data,\n unsigned char *md, unsigned int *len);\n\nint ASN1_item_verify(const ASN1_ITEM *it, X509_ALGOR *algor1,\n ASN1_BIT_STRING *signature, void *data, EVP_PKEY *pkey);\n\nint ASN1_item_sign(const ASN1_ITEM *it, X509_ALGOR *algor1,\n X509_ALGOR *algor2, ASN1_BIT_STRING *signature, void *data,\n EVP_PKEY *pkey, const EVP_MD *type);\nint ASN1_item_sign_ctx(const ASN1_ITEM *it, X509_ALGOR *algor1,\n X509_ALGOR *algor2, ASN1_BIT_STRING *signature,\n void *asn, EVP_MD_CTX *ctx);\n\nlong X509_get_version(const X509 *x);\nint X509_set_version(X509 *x, long version);\nint X509_set_serialNumber(X509 *x, ASN1_INTEGER *serial);\nASN1_INTEGER *X509_get_serialNumber(X509 *x);\nconst ASN1_INTEGER *X509_get0_serialNumber(const X509 *x);\nint X509_set_issuer_name(X509 *x, X509_NAME *name);\nX509_NAME *X509_get_issuer_name(const X509 *a);\nint X509_set_subject_name(X509 *x, X509_NAME *name);\nX509_NAME *X509_get_subject_name(const X509 *a);\nconst ASN1_TIME * X509_get0_notBefore(const X509 *x);\nASN1_TIME *X509_getm_notBefore(const X509 *x);\nint X509_set1_notBefore(X509 *x, const ASN1_TIME *tm);\nconst ASN1_TIME *X509_get0_notAfter(const X509 *x);\nASN1_TIME *X509_getm_notAfter(const X509 *x);\nint X509_set1_notAfter(X509 *x, const ASN1_TIME *tm);\nint X509_set_pubkey(X509 *x, EVP_PKEY *pkey);\nint X509_up_ref(X509 *x);\nint X509_get_signature_type(const X509 *x);\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define X509_get_notBefore X509_getm_notBefore\n# define X509_get_notAfter X509_getm_notAfter\n# define X509_set_notBefore X509_set1_notBefore\n# define X509_set_notAfter X509_set1_notAfter\n#endif\n\n\n/*\n * This one is only used so that a binary form can output, as in\n * i2d_X509_PUBKEY(X509_get_X509_PUBKEY(x), &buf)\n */\nX509_PUBKEY *X509_get_X509_PUBKEY(const X509 *x);\nconst STACK_OF(X509_EXTENSION) *X509_get0_extensions(const X509 *x);\nvoid X509_get0_uids(const X509 *x, const ASN1_BIT_STRING **piuid,\n const ASN1_BIT_STRING **psuid);\nconst X509_ALGOR *X509_get0_tbs_sigalg(const X509 *x);\n\nEVP_PKEY *X509_get0_pubkey(const X509 *x);\nEVP_PKEY *X509_get_pubkey(X509 *x);\nASN1_BIT_STRING *X509_get0_pubkey_bitstr(const X509 *x);\nint X509_certificate_type(const X509 *x, const EVP_PKEY *pubkey);\n\nlong X509_REQ_get_version(const X509_REQ *req);\nint X509_REQ_set_version(X509_REQ *x, long version);\nX509_NAME *X509_REQ_get_subject_name(const X509_REQ *req);\nint X509_REQ_set_subject_name(X509_REQ *req, X509_NAME *name);\nvoid X509_REQ_get0_signature(const X509_REQ *req, const ASN1_BIT_STRING **psig,\n const X509_ALGOR **palg);\nvoid X509_REQ_set0_signature(X509_REQ *req, ASN1_BIT_STRING *psig);\nint X509_REQ_set1_signature_algo(X509_REQ *req, X509_ALGOR *palg);\nint X509_REQ_get_signature_nid(const X509_REQ *req);\nint i2d_re_X509_REQ_tbs(X509_REQ *req, unsigned char **pp);\nint X509_REQ_set_pubkey(X509_REQ *x, EVP_PKEY *pkey);\nEVP_PKEY *X509_REQ_get_pubkey(X509_REQ *req);\nEVP_PKEY *X509_REQ_get0_pubkey(X509_REQ *req);\nX509_PUBKEY *X509_REQ_get_X509_PUBKEY(X509_REQ *req);\nint X509_REQ_extension_nid(int nid);\nint *X509_REQ_get_extension_nids(void);\nvoid X509_REQ_set_extension_nids(int *nids);\nSTACK_OF(X509_EXTENSION) *X509_REQ_get_extensions(X509_REQ *req);\nint X509_REQ_add_extensions_nid(X509_REQ *req, STACK_OF(X509_EXTENSION) *exts,\n int nid);\nint X509_REQ_add_extensions(X509_REQ *req, STACK_OF(X509_EXTENSION) *exts);\nint X509_REQ_get_attr_count(const X509_REQ *req);\nint X509_REQ_get_attr_by_NID(const X509_REQ *req, int nid, int lastpos);\nint X509_REQ_get_attr_by_OBJ(const X509_REQ *req, const ASN1_OBJECT *obj,\n int lastpos);\nX509_ATTRIBUTE *X509_REQ_get_attr(const X509_REQ *req, int loc);\nX509_ATTRIBUTE *X509_REQ_delete_attr(X509_REQ *req, int loc);\nint X509_REQ_add1_attr(X509_REQ *req, X509_ATTRIBUTE *attr);\nint X509_REQ_add1_attr_by_OBJ(X509_REQ *req,\n const ASN1_OBJECT *obj, int type,\n const unsigned char *bytes, int len);\nint X509_REQ_add1_attr_by_NID(X509_REQ *req,\n int nid, int type,\n const unsigned char *bytes, int len);\nint X509_REQ_add1_attr_by_txt(X509_REQ *req,\n const char *attrname, int type,\n const unsigned char *bytes, int len);\n\nint X509_CRL_set_version(X509_CRL *x, long version);\nint X509_CRL_set_issuer_name(X509_CRL *x, X509_NAME *name);\nint X509_CRL_set1_lastUpdate(X509_CRL *x, const ASN1_TIME *tm);\nint X509_CRL_set1_nextUpdate(X509_CRL *x, const ASN1_TIME *tm);\nint X509_CRL_sort(X509_CRL *crl);\nint X509_CRL_up_ref(X509_CRL *crl);\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define X509_CRL_set_lastUpdate X509_CRL_set1_lastUpdate\n# define X509_CRL_set_nextUpdate X509_CRL_set1_nextUpdate\n#endif\n\nlong X509_CRL_get_version(const X509_CRL *crl);\nconst ASN1_TIME *X509_CRL_get0_lastUpdate(const X509_CRL *crl);\nconst ASN1_TIME *X509_CRL_get0_nextUpdate(const X509_CRL *crl);\nDEPRECATEDIN_1_1_0(ASN1_TIME *X509_CRL_get_lastUpdate(X509_CRL *crl))\nDEPRECATEDIN_1_1_0(ASN1_TIME *X509_CRL_get_nextUpdate(X509_CRL *crl))\nX509_NAME *X509_CRL_get_issuer(const X509_CRL *crl);\nconst STACK_OF(X509_EXTENSION) *X509_CRL_get0_extensions(const X509_CRL *crl);\nSTACK_OF(X509_REVOKED) *X509_CRL_get_REVOKED(X509_CRL *crl);\nvoid X509_CRL_get0_signature(const X509_CRL *crl, const ASN1_BIT_STRING **psig,\n const X509_ALGOR **palg);\nint X509_CRL_get_signature_nid(const X509_CRL *crl);\nint i2d_re_X509_CRL_tbs(X509_CRL *req, unsigned char **pp);\n\nconst ASN1_INTEGER *X509_REVOKED_get0_serialNumber(const X509_REVOKED *x);\nint X509_REVOKED_set_serialNumber(X509_REVOKED *x, ASN1_INTEGER *serial);\nconst ASN1_TIME *X509_REVOKED_get0_revocationDate(const X509_REVOKED *x);\nint X509_REVOKED_set_revocationDate(X509_REVOKED *r, ASN1_TIME *tm);\nconst STACK_OF(X509_EXTENSION) *\nX509_REVOKED_get0_extensions(const X509_REVOKED *r);\n\nX509_CRL *X509_CRL_diff(X509_CRL *base, X509_CRL *newer,\n EVP_PKEY *skey, const EVP_MD *md, unsigned int flags);\n\nint X509_REQ_check_private_key(X509_REQ *x509, EVP_PKEY *pkey);\n\nint X509_check_private_key(const X509 *x509, const EVP_PKEY *pkey);\nint X509_chain_check_suiteb(int *perror_depth,\n X509 *x, STACK_OF(X509) *chain,\n unsigned long flags);\nint X509_CRL_check_suiteb(X509_CRL *crl, EVP_PKEY *pk, unsigned long flags);\nSTACK_OF(X509) *X509_chain_up_ref(STACK_OF(X509) *chain);\n\nint X509_issuer_and_serial_cmp(const X509 *a, const X509 *b);\nunsigned long X509_issuer_and_serial_hash(X509 *a);\n\nint X509_issuer_name_cmp(const X509 *a, const X509 *b);\nunsigned long X509_issuer_name_hash(X509 *a);\n\nint X509_subject_name_cmp(const X509 *a, const X509 *b);\nunsigned long X509_subject_name_hash(X509 *x);\n\n# ifndef OPENSSL_NO_MD5\nunsigned long X509_issuer_name_hash_old(X509 *a);\nunsigned long X509_subject_name_hash_old(X509 *x);\n# endif\n\nint X509_cmp(const X509 *a, const X509 *b);\nint X509_NAME_cmp(const X509_NAME *a, const X509_NAME *b);\nunsigned long X509_NAME_hash(X509_NAME *x);\nunsigned long X509_NAME_hash_old(X509_NAME *x);\n\nint X509_CRL_cmp(const X509_CRL *a, const X509_CRL *b);\nint X509_CRL_match(const X509_CRL *a, const X509_CRL *b);\nint X509_aux_print(BIO *out, X509 *x, int indent);\n# ifndef OPENSSL_NO_STDIO\nint X509_print_ex_fp(FILE *bp, X509 *x, unsigned long nmflag,\n unsigned long cflag);\nint X509_print_fp(FILE *bp, X509 *x);\nint X509_CRL_print_fp(FILE *bp, X509_CRL *x);\nint X509_REQ_print_fp(FILE *bp, X509_REQ *req);\nint X509_NAME_print_ex_fp(FILE *fp, const X509_NAME *nm, int indent,\n unsigned long flags);\n# endif\n\nint X509_NAME_print(BIO *bp, const X509_NAME *name, int obase);\nint X509_NAME_print_ex(BIO *out, const X509_NAME *nm, int indent,\n unsigned long flags);\nint X509_print_ex(BIO *bp, X509 *x, unsigned long nmflag,\n unsigned long cflag);\nint X509_print(BIO *bp, X509 *x);\nint X509_ocspid_print(BIO *bp, X509 *x);\nint X509_CRL_print_ex(BIO *out, X509_CRL *x, unsigned long nmflag);\nint X509_CRL_print(BIO *bp, X509_CRL *x);\nint X509_REQ_print_ex(BIO *bp, X509_REQ *x, unsigned long nmflag,\n unsigned long cflag);\nint X509_REQ_print(BIO *bp, X509_REQ *req);\n\nint X509_NAME_entry_count(const X509_NAME *name);\nint X509_NAME_get_text_by_NID(X509_NAME *name, int nid, char *buf, int len);\nint X509_NAME_get_text_by_OBJ(X509_NAME *name, const ASN1_OBJECT *obj,\n char *buf, int len);\n\n/*\n * NOTE: you should be passing -1, not 0 as lastpos. The functions that use\n * lastpos, search after that position on.\n */\nint X509_NAME_get_index_by_NID(X509_NAME *name, int nid, int lastpos);\nint X509_NAME_get_index_by_OBJ(X509_NAME *name, const ASN1_OBJECT *obj,\n int lastpos);\nX509_NAME_ENTRY *X509_NAME_get_entry(const X509_NAME *name, int loc);\nX509_NAME_ENTRY *X509_NAME_delete_entry(X509_NAME *name, int loc);\nint X509_NAME_add_entry(X509_NAME *name, const X509_NAME_ENTRY *ne,\n int loc, int set);\nint X509_NAME_add_entry_by_OBJ(X509_NAME *name, const ASN1_OBJECT *obj, int type,\n const unsigned char *bytes, int len, int loc,\n int set);\nint X509_NAME_add_entry_by_NID(X509_NAME *name, int nid, int type,\n const unsigned char *bytes, int len, int loc,\n int set);\nX509_NAME_ENTRY *X509_NAME_ENTRY_create_by_txt(X509_NAME_ENTRY **ne,\n const char *field, int type,\n const unsigned char *bytes,\n int len);\nX509_NAME_ENTRY *X509_NAME_ENTRY_create_by_NID(X509_NAME_ENTRY **ne, int nid,\n int type,\n const unsigned char *bytes,\n int len);\nint X509_NAME_add_entry_by_txt(X509_NAME *name, const char *field, int type,\n const unsigned char *bytes, int len, int loc,\n int set);\nX509_NAME_ENTRY *X509_NAME_ENTRY_create_by_OBJ(X509_NAME_ENTRY **ne,\n const ASN1_OBJECT *obj, int type,\n const unsigned char *bytes,\n int len);\nint X509_NAME_ENTRY_set_object(X509_NAME_ENTRY *ne, const ASN1_OBJECT *obj);\nint X509_NAME_ENTRY_set_data(X509_NAME_ENTRY *ne, int type,\n const unsigned char *bytes, int len);\nASN1_OBJECT *X509_NAME_ENTRY_get_object(const X509_NAME_ENTRY *ne);\nASN1_STRING * X509_NAME_ENTRY_get_data(const X509_NAME_ENTRY *ne);\nint X509_NAME_ENTRY_set(const X509_NAME_ENTRY *ne);\n\nint X509_NAME_get0_der(X509_NAME *nm, const unsigned char **pder,\n size_t *pderlen);\n\nint X509v3_get_ext_count(const STACK_OF(X509_EXTENSION) *x);\nint X509v3_get_ext_by_NID(const STACK_OF(X509_EXTENSION) *x,\n int nid, int lastpos);\nint X509v3_get_ext_by_OBJ(const STACK_OF(X509_EXTENSION) *x,\n const ASN1_OBJECT *obj, int lastpos);\nint X509v3_get_ext_by_critical(const STACK_OF(X509_EXTENSION) *x,\n int crit, int lastpos);\nX509_EXTENSION *X509v3_get_ext(const STACK_OF(X509_EXTENSION) *x, int loc);\nX509_EXTENSION *X509v3_delete_ext(STACK_OF(X509_EXTENSION) *x, int loc);\nSTACK_OF(X509_EXTENSION) *X509v3_add_ext(STACK_OF(X509_EXTENSION) **x,\n X509_EXTENSION *ex, int loc);\n\nint X509_get_ext_count(const X509 *x);\nint X509_get_ext_by_NID(const X509 *x, int nid, int lastpos);\nint X509_get_ext_by_OBJ(const X509 *x, const ASN1_OBJECT *obj, int lastpos);\nint X509_get_ext_by_critical(const X509 *x, int crit, int lastpos);\nX509_EXTENSION *X509_get_ext(const X509 *x, int loc);\nX509_EXTENSION *X509_delete_ext(X509 *x, int loc);\nint X509_add_ext(X509 *x, X509_EXTENSION *ex, int loc);\nvoid *X509_get_ext_d2i(const X509 *x, int nid, int *crit, int *idx);\nint X509_add1_ext_i2d(X509 *x, int nid, void *value, int crit,\n unsigned long flags);\n\nint X509_CRL_get_ext_count(const X509_CRL *x);\nint X509_CRL_get_ext_by_NID(const X509_CRL *x, int nid, int lastpos);\nint X509_CRL_get_ext_by_OBJ(const X509_CRL *x, const ASN1_OBJECT *obj,\n int lastpos);\nint X509_CRL_get_ext_by_critical(const X509_CRL *x, int crit, int lastpos);\nX509_EXTENSION *X509_CRL_get_ext(const X509_CRL *x, int loc);\nX509_EXTENSION *X509_CRL_delete_ext(X509_CRL *x, int loc);\nint X509_CRL_add_ext(X509_CRL *x, X509_EXTENSION *ex, int loc);\nvoid *X509_CRL_get_ext_d2i(const X509_CRL *x, int nid, int *crit, int *idx);\nint X509_CRL_add1_ext_i2d(X509_CRL *x, int nid, void *value, int crit,\n unsigned long flags);\n\nint X509_REVOKED_get_ext_count(const X509_REVOKED *x);\nint X509_REVOKED_get_ext_by_NID(const X509_REVOKED *x, int nid, int lastpos);\nint X509_REVOKED_get_ext_by_OBJ(const X509_REVOKED *x, const ASN1_OBJECT *obj,\n int lastpos);\nint X509_REVOKED_get_ext_by_critical(const X509_REVOKED *x, int crit,\n int lastpos);\nX509_EXTENSION *X509_REVOKED_get_ext(const X509_REVOKED *x, int loc);\nX509_EXTENSION *X509_REVOKED_delete_ext(X509_REVOKED *x, int loc);\nint X509_REVOKED_add_ext(X509_REVOKED *x, X509_EXTENSION *ex, int loc);\nvoid *X509_REVOKED_get_ext_d2i(const X509_REVOKED *x, int nid, int *crit,\n int *idx);\nint X509_REVOKED_add1_ext_i2d(X509_REVOKED *x, int nid, void *value, int crit,\n unsigned long flags);\n\nX509_EXTENSION *X509_EXTENSION_create_by_NID(X509_EXTENSION **ex,\n int nid, int crit,\n ASN1_OCTET_STRING *data);\nX509_EXTENSION *X509_EXTENSION_create_by_OBJ(X509_EXTENSION **ex,\n const ASN1_OBJECT *obj, int crit,\n ASN1_OCTET_STRING *data);\nint X509_EXTENSION_set_object(X509_EXTENSION *ex, const ASN1_OBJECT *obj);\nint X509_EXTENSION_set_critical(X509_EXTENSION *ex, int crit);\nint X509_EXTENSION_set_data(X509_EXTENSION *ex, ASN1_OCTET_STRING *data);\nASN1_OBJECT *X509_EXTENSION_get_object(X509_EXTENSION *ex);\nASN1_OCTET_STRING *X509_EXTENSION_get_data(X509_EXTENSION *ne);\nint X509_EXTENSION_get_critical(const X509_EXTENSION *ex);\n\nint X509at_get_attr_count(const STACK_OF(X509_ATTRIBUTE) *x);\nint X509at_get_attr_by_NID(const STACK_OF(X509_ATTRIBUTE) *x, int nid,\n int lastpos);\nint X509at_get_attr_by_OBJ(const STACK_OF(X509_ATTRIBUTE) *sk,\n const ASN1_OBJECT *obj, int lastpos);\nX509_ATTRIBUTE *X509at_get_attr(const STACK_OF(X509_ATTRIBUTE) *x, int loc);\nX509_ATTRIBUTE *X509at_delete_attr(STACK_OF(X509_ATTRIBUTE) *x, int loc);\nSTACK_OF(X509_ATTRIBUTE) *X509at_add1_attr(STACK_OF(X509_ATTRIBUTE) **x,\n X509_ATTRIBUTE *attr);\nSTACK_OF(X509_ATTRIBUTE) *X509at_add1_attr_by_OBJ(STACK_OF(X509_ATTRIBUTE)\n **x, const ASN1_OBJECT *obj,\n int type,\n const unsigned char *bytes,\n int len);\nSTACK_OF(X509_ATTRIBUTE) *X509at_add1_attr_by_NID(STACK_OF(X509_ATTRIBUTE)\n **x, int nid, int type,\n const unsigned char *bytes,\n int len);\nSTACK_OF(X509_ATTRIBUTE) *X509at_add1_attr_by_txt(STACK_OF(X509_ATTRIBUTE)\n **x, const char *attrname,\n int type,\n const unsigned char *bytes,\n int len);\nvoid *X509at_get0_data_by_OBJ(const STACK_OF(X509_ATTRIBUTE) *x,\n const ASN1_OBJECT *obj, int lastpos, int type);\nX509_ATTRIBUTE *X509_ATTRIBUTE_create_by_NID(X509_ATTRIBUTE **attr, int nid,\n int atrtype, const void *data,\n int len);\nX509_ATTRIBUTE *X509_ATTRIBUTE_create_by_OBJ(X509_ATTRIBUTE **attr,\n const ASN1_OBJECT *obj,\n int atrtype, const void *data,\n int len);\nX509_ATTRIBUTE *X509_ATTRIBUTE_create_by_txt(X509_ATTRIBUTE **attr,\n const char *atrname, int type,\n const unsigned char *bytes,\n int len);\nint X509_ATTRIBUTE_set1_object(X509_ATTRIBUTE *attr, const ASN1_OBJECT *obj);\nint X509_ATTRIBUTE_set1_data(X509_ATTRIBUTE *attr, int attrtype,\n const void *data, int len);\nvoid *X509_ATTRIBUTE_get0_data(X509_ATTRIBUTE *attr, int idx, int atrtype,\n void *data);\nint X509_ATTRIBUTE_count(const X509_ATTRIBUTE *attr);\nASN1_OBJECT *X509_ATTRIBUTE_get0_object(X509_ATTRIBUTE *attr);\nASN1_TYPE *X509_ATTRIBUTE_get0_type(X509_ATTRIBUTE *attr, int idx);\n\nint EVP_PKEY_get_attr_count(const EVP_PKEY *key);\nint EVP_PKEY_get_attr_by_NID(const EVP_PKEY *key, int nid, int lastpos);\nint EVP_PKEY_get_attr_by_OBJ(const EVP_PKEY *key, const ASN1_OBJECT *obj,\n int lastpos);\nX509_ATTRIBUTE *EVP_PKEY_get_attr(const EVP_PKEY *key, int loc);\nX509_ATTRIBUTE *EVP_PKEY_delete_attr(EVP_PKEY *key, int loc);\nint EVP_PKEY_add1_attr(EVP_PKEY *key, X509_ATTRIBUTE *attr);\nint EVP_PKEY_add1_attr_by_OBJ(EVP_PKEY *key,\n const ASN1_OBJECT *obj, int type,\n const unsigned char *bytes, int len);\nint EVP_PKEY_add1_attr_by_NID(EVP_PKEY *key,\n int nid, int type,\n const unsigned char *bytes, int len);\nint EVP_PKEY_add1_attr_by_txt(EVP_PKEY *key,\n const char *attrname, int type,\n const unsigned char *bytes, int len);\n\nint X509_verify_cert(X509_STORE_CTX *ctx);\n\n/* lookup a cert from a X509 STACK */\nX509 *X509_find_by_issuer_and_serial(STACK_OF(X509) *sk, X509_NAME *name,\n ASN1_INTEGER *serial);\nX509 *X509_find_by_subject(STACK_OF(X509) *sk, X509_NAME *name);\n\nDECLARE_ASN1_FUNCTIONS(PBEPARAM)\nDECLARE_ASN1_FUNCTIONS(PBE2PARAM)\nDECLARE_ASN1_FUNCTIONS(PBKDF2PARAM)\n#ifndef OPENSSL_NO_SCRYPT\nDECLARE_ASN1_FUNCTIONS(SCRYPT_PARAMS)\n#endif\n\nint PKCS5_pbe_set0_algor(X509_ALGOR *algor, int alg, int iter,\n const unsigned char *salt, int saltlen);\n\nX509_ALGOR *PKCS5_pbe_set(int alg, int iter,\n const unsigned char *salt, int saltlen);\nX509_ALGOR *PKCS5_pbe2_set(const EVP_CIPHER *cipher, int iter,\n unsigned char *salt, int saltlen);\nX509_ALGOR *PKCS5_pbe2_set_iv(const EVP_CIPHER *cipher, int iter,\n unsigned char *salt, int saltlen,\n unsigned char *aiv, int prf_nid);\n\n#ifndef OPENSSL_NO_SCRYPT\nX509_ALGOR *PKCS5_pbe2_set_scrypt(const EVP_CIPHER *cipher,\n const unsigned char *salt, int saltlen,\n unsigned char *aiv, uint64_t N, uint64_t r,\n uint64_t p);\n#endif\n\nX509_ALGOR *PKCS5_pbkdf2_set(int iter, unsigned char *salt, int saltlen,\n int prf_nid, int keylen);\n\n/* PKCS#8 utilities */\n\nDECLARE_ASN1_FUNCTIONS(PKCS8_PRIV_KEY_INFO)\n\nEVP_PKEY *EVP_PKCS82PKEY(const PKCS8_PRIV_KEY_INFO *p8);\nPKCS8_PRIV_KEY_INFO *EVP_PKEY2PKCS8(EVP_PKEY *pkey);\n\nint PKCS8_pkey_set0(PKCS8_PRIV_KEY_INFO *priv, ASN1_OBJECT *aobj,\n int version, int ptype, void *pval,\n unsigned char *penc, int penclen);\nint PKCS8_pkey_get0(const ASN1_OBJECT **ppkalg,\n const unsigned char **pk, int *ppklen,\n const X509_ALGOR **pa, const PKCS8_PRIV_KEY_INFO *p8);\n\nconst STACK_OF(X509_ATTRIBUTE) *\nPKCS8_pkey_get0_attrs(const PKCS8_PRIV_KEY_INFO *p8);\nint PKCS8_pkey_add1_attr_by_NID(PKCS8_PRIV_KEY_INFO *p8, int nid, int type,\n const unsigned char *bytes, int len);\n\nint X509_PUBKEY_set0_param(X509_PUBKEY *pub, ASN1_OBJECT *aobj,\n int ptype, void *pval,\n unsigned char *penc, int penclen);\nint X509_PUBKEY_get0_param(ASN1_OBJECT **ppkalg,\n const unsigned char **pk, int *ppklen,\n X509_ALGOR **pa, X509_PUBKEY *pub);\n\nint X509_check_trust(X509 *x, int id, int flags);\nint X509_TRUST_get_count(void);\nX509_TRUST *X509_TRUST_get0(int idx);\nint X509_TRUST_get_by_id(int id);\nint X509_TRUST_add(int id, int flags, int (*ck) (X509_TRUST *, X509 *, int),\n const char *name, int arg1, void *arg2);\nvoid X509_TRUST_cleanup(void);\nint X509_TRUST_get_flags(const X509_TRUST *xp);\nchar *X509_TRUST_get0_name(const X509_TRUST *xp);\nint X509_TRUST_get_trust(const X509_TRUST *xp);\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/x509_vfy.h", "content": "/*\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_X509_VFY_H\n# define HEADER_X509_VFY_H\n\n/*\n * Protect against recursion, x509.h and x509_vfy.h each include the other.\n */\n# ifndef HEADER_X509_H\n# include \n# endif\n\n# include \n# include \n# include \n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/*-\nSSL_CTX -> X509_STORE\n -> X509_LOOKUP\n ->X509_LOOKUP_METHOD\n -> X509_LOOKUP\n ->X509_LOOKUP_METHOD\n\nSSL -> X509_STORE_CTX\n ->X509_STORE\n\nThe X509_STORE holds the tables etc for verification stuff.\nA X509_STORE_CTX is used while validating a single certificate.\nThe X509_STORE has X509_LOOKUPs for looking up certs.\nThe X509_STORE then calls a function to actually verify the\ncertificate chain.\n*/\n\ntypedef enum {\n X509_LU_NONE = 0,\n X509_LU_X509, X509_LU_CRL\n} X509_LOOKUP_TYPE;\n\n#if OPENSSL_API_COMPAT < 0x10100000L\n#define X509_LU_RETRY -1\n#define X509_LU_FAIL 0\n#endif\n\nDEFINE_STACK_OF(X509_LOOKUP)\nDEFINE_STACK_OF(X509_OBJECT)\nDEFINE_STACK_OF(X509_VERIFY_PARAM)\n\nint X509_STORE_set_depth(X509_STORE *store, int depth);\n\ntypedef int (*X509_STORE_CTX_verify_cb)(int, X509_STORE_CTX *);\ntypedef int (*X509_STORE_CTX_verify_fn)(X509_STORE_CTX *);\ntypedef int (*X509_STORE_CTX_get_issuer_fn)(X509 **issuer,\n X509_STORE_CTX *ctx, X509 *x);\ntypedef int (*X509_STORE_CTX_check_issued_fn)(X509_STORE_CTX *ctx,\n X509 *x, X509 *issuer);\ntypedef int (*X509_STORE_CTX_check_revocation_fn)(X509_STORE_CTX *ctx);\ntypedef int (*X509_STORE_CTX_get_crl_fn)(X509_STORE_CTX *ctx,\n X509_CRL **crl, X509 *x);\ntypedef int (*X509_STORE_CTX_check_crl_fn)(X509_STORE_CTX *ctx, X509_CRL *crl);\ntypedef int (*X509_STORE_CTX_cert_crl_fn)(X509_STORE_CTX *ctx,\n X509_CRL *crl, X509 *x);\ntypedef int (*X509_STORE_CTX_check_policy_fn)(X509_STORE_CTX *ctx);\ntypedef STACK_OF(X509) *(*X509_STORE_CTX_lookup_certs_fn)(X509_STORE_CTX *ctx,\n X509_NAME *nm);\ntypedef STACK_OF(X509_CRL) *(*X509_STORE_CTX_lookup_crls_fn)(X509_STORE_CTX *ctx,\n X509_NAME *nm);\ntypedef int (*X509_STORE_CTX_cleanup_fn)(X509_STORE_CTX *ctx);\n\n\nvoid X509_STORE_CTX_set_depth(X509_STORE_CTX *ctx, int depth);\n\n# define X509_STORE_CTX_set_app_data(ctx,data) \\\n X509_STORE_CTX_set_ex_data(ctx,0,data)\n# define X509_STORE_CTX_get_app_data(ctx) \\\n X509_STORE_CTX_get_ex_data(ctx,0)\n\n# define X509_L_FILE_LOAD 1\n# define X509_L_ADD_DIR 2\n\n# define X509_LOOKUP_load_file(x,name,type) \\\n X509_LOOKUP_ctrl((x),X509_L_FILE_LOAD,(name),(long)(type),NULL)\n\n# define X509_LOOKUP_add_dir(x,name,type) \\\n X509_LOOKUP_ctrl((x),X509_L_ADD_DIR,(name),(long)(type),NULL)\n\n# define X509_V_OK 0\n# define X509_V_ERR_UNSPECIFIED 1\n# define X509_V_ERR_UNABLE_TO_GET_ISSUER_CERT 2\n# define X509_V_ERR_UNABLE_TO_GET_CRL 3\n# define X509_V_ERR_UNABLE_TO_DECRYPT_CERT_SIGNATURE 4\n# define X509_V_ERR_UNABLE_TO_DECRYPT_CRL_SIGNATURE 5\n# define X509_V_ERR_UNABLE_TO_DECODE_ISSUER_PUBLIC_KEY 6\n# define X509_V_ERR_CERT_SIGNATURE_FAILURE 7\n# define X509_V_ERR_CRL_SIGNATURE_FAILURE 8\n# define X509_V_ERR_CERT_NOT_YET_VALID 9\n# define X509_V_ERR_CERT_HAS_EXPIRED 10\n# define X509_V_ERR_CRL_NOT_YET_VALID 11\n# define X509_V_ERR_CRL_HAS_EXPIRED 12\n# define X509_V_ERR_ERROR_IN_CERT_NOT_BEFORE_FIELD 13\n# define X509_V_ERR_ERROR_IN_CERT_NOT_AFTER_FIELD 14\n# define X509_V_ERR_ERROR_IN_CRL_LAST_UPDATE_FIELD 15\n# define X509_V_ERR_ERROR_IN_CRL_NEXT_UPDATE_FIELD 16\n# define X509_V_ERR_OUT_OF_MEM 17\n# define X509_V_ERR_DEPTH_ZERO_SELF_SIGNED_CERT 18\n# define X509_V_ERR_SELF_SIGNED_CERT_IN_CHAIN 19\n# define X509_V_ERR_UNABLE_TO_GET_ISSUER_CERT_LOCALLY 20\n# define X509_V_ERR_UNABLE_TO_VERIFY_LEAF_SIGNATURE 21\n# define X509_V_ERR_CERT_CHAIN_TOO_LONG 22\n# define X509_V_ERR_CERT_REVOKED 23\n# define X509_V_ERR_INVALID_CA 24\n# define X509_V_ERR_PATH_LENGTH_EXCEEDED 25\n# define X509_V_ERR_INVALID_PURPOSE 26\n# define X509_V_ERR_CERT_UNTRUSTED 27\n# define X509_V_ERR_CERT_REJECTED 28\n/* These are 'informational' when looking for issuer cert */\n# define X509_V_ERR_SUBJECT_ISSUER_MISMATCH 29\n# define X509_V_ERR_AKID_SKID_MISMATCH 30\n# define X509_V_ERR_AKID_ISSUER_SERIAL_MISMATCH 31\n# define X509_V_ERR_KEYUSAGE_NO_CERTSIGN 32\n# define X509_V_ERR_UNABLE_TO_GET_CRL_ISSUER 33\n# define X509_V_ERR_UNHANDLED_CRITICAL_EXTENSION 34\n# define X509_V_ERR_KEYUSAGE_NO_CRL_SIGN 35\n# define X509_V_ERR_UNHANDLED_CRITICAL_CRL_EXTENSION 36\n# define X509_V_ERR_INVALID_NON_CA 37\n# define X509_V_ERR_PROXY_PATH_LENGTH_EXCEEDED 38\n# define X509_V_ERR_KEYUSAGE_NO_DIGITAL_SIGNATURE 39\n# define X509_V_ERR_PROXY_CERTIFICATES_NOT_ALLOWED 40\n# define X509_V_ERR_INVALID_EXTENSION 41\n# define X509_V_ERR_INVALID_POLICY_EXTENSION 42\n# define X509_V_ERR_NO_EXPLICIT_POLICY 43\n# define X509_V_ERR_DIFFERENT_CRL_SCOPE 44\n# define X509_V_ERR_UNSUPPORTED_EXTENSION_FEATURE 45\n# define X509_V_ERR_UNNESTED_RESOURCE 46\n# define X509_V_ERR_PERMITTED_VIOLATION 47\n# define X509_V_ERR_EXCLUDED_VIOLATION 48\n# define X509_V_ERR_SUBTREE_MINMAX 49\n/* The application is not happy */\n# define X509_V_ERR_APPLICATION_VERIFICATION 50\n# define X509_V_ERR_UNSUPPORTED_CONSTRAINT_TYPE 51\n# define X509_V_ERR_UNSUPPORTED_CONSTRAINT_SYNTAX 52\n# define X509_V_ERR_UNSUPPORTED_NAME_SYNTAX 53\n# define X509_V_ERR_CRL_PATH_VALIDATION_ERROR 54\n/* Another issuer check debug option */\n# define X509_V_ERR_PATH_LOOP 55\n/* Suite B mode algorithm violation */\n# define X509_V_ERR_SUITE_B_INVALID_VERSION 56\n# define X509_V_ERR_SUITE_B_INVALID_ALGORITHM 57\n# define X509_V_ERR_SUITE_B_INVALID_CURVE 58\n# define X509_V_ERR_SUITE_B_INVALID_SIGNATURE_ALGORITHM 59\n# define X509_V_ERR_SUITE_B_LOS_NOT_ALLOWED 60\n# define X509_V_ERR_SUITE_B_CANNOT_SIGN_P_384_WITH_P_256 61\n/* Host, email and IP check errors */\n# define X509_V_ERR_HOSTNAME_MISMATCH 62\n# define X509_V_ERR_EMAIL_MISMATCH 63\n# define X509_V_ERR_IP_ADDRESS_MISMATCH 64\n/* DANE TLSA errors */\n# define X509_V_ERR_DANE_NO_MATCH 65\n/* security level errors */\n# define X509_V_ERR_EE_KEY_TOO_SMALL 66\n# define X509_V_ERR_CA_KEY_TOO_SMALL 67\n# define X509_V_ERR_CA_MD_TOO_WEAK 68\n/* Caller error */\n# define X509_V_ERR_INVALID_CALL 69\n/* Issuer lookup error */\n# define X509_V_ERR_STORE_LOOKUP 70\n/* Certificate transparency */\n# define X509_V_ERR_NO_VALID_SCTS 71\n\n# define X509_V_ERR_PROXY_SUBJECT_NAME_VIOLATION 72\n/* OCSP status errors */\n# define X509_V_ERR_OCSP_VERIFY_NEEDED 73 /* Need OCSP verification */\n# define X509_V_ERR_OCSP_VERIFY_FAILED 74 /* Couldn't verify cert through OCSP */\n# define X509_V_ERR_OCSP_CERT_UNKNOWN 75 /* Certificate wasn't recognized by the OCSP responder */\n# define X509_V_ERR_SIGNATURE_ALGORITHM_MISMATCH 76\n# define X509_V_ERR_NO_ISSUER_PUBLIC_KEY 77\n# define X509_V_ERR_UNSUPPORTED_SIGNATURE_ALGORITHM 78\n# define X509_V_ERR_EC_KEY_EXPLICIT_PARAMS 79\n\n/* Certificate verify flags */\n\n# if OPENSSL_API_COMPAT < 0x10100000L\n# define X509_V_FLAG_CB_ISSUER_CHECK 0x0 /* Deprecated */\n# endif\n/* Use check time instead of current time */\n# define X509_V_FLAG_USE_CHECK_TIME 0x2\n/* Lookup CRLs */\n# define X509_V_FLAG_CRL_CHECK 0x4\n/* Lookup CRLs for whole chain */\n# define X509_V_FLAG_CRL_CHECK_ALL 0x8\n/* Ignore unhandled critical extensions */\n# define X509_V_FLAG_IGNORE_CRITICAL 0x10\n/* Disable workarounds for broken certificates */\n# define X509_V_FLAG_X509_STRICT 0x20\n/* Enable proxy certificate validation */\n# define X509_V_FLAG_ALLOW_PROXY_CERTS 0x40\n/* Enable policy checking */\n# define X509_V_FLAG_POLICY_CHECK 0x80\n/* Policy variable require-explicit-policy */\n# define X509_V_FLAG_EXPLICIT_POLICY 0x100\n/* Policy variable inhibit-any-policy */\n# define X509_V_FLAG_INHIBIT_ANY 0x200\n/* Policy variable inhibit-policy-mapping */\n# define X509_V_FLAG_INHIBIT_MAP 0x400\n/* Notify callback that policy is OK */\n# define X509_V_FLAG_NOTIFY_POLICY 0x800\n/* Extended CRL features such as indirect CRLs, alternate CRL signing keys */\n# define X509_V_FLAG_EXTENDED_CRL_SUPPORT 0x1000\n/* Delta CRL support */\n# define X509_V_FLAG_USE_DELTAS 0x2000\n/* Check self-signed CA signature */\n# define X509_V_FLAG_CHECK_SS_SIGNATURE 0x4000\n/* Use trusted store first */\n# define X509_V_FLAG_TRUSTED_FIRST 0x8000\n/* Suite B 128 bit only mode: not normally used */\n# define X509_V_FLAG_SUITEB_128_LOS_ONLY 0x10000\n/* Suite B 192 bit only mode */\n# define X509_V_FLAG_SUITEB_192_LOS 0x20000\n/* Suite B 128 bit mode allowing 192 bit algorithms */\n# define X509_V_FLAG_SUITEB_128_LOS 0x30000\n/* Allow partial chains if at least one certificate is in trusted store */\n# define X509_V_FLAG_PARTIAL_CHAIN 0x80000\n/*\n * If the initial chain is not trusted, do not attempt to build an alternative\n * chain. Alternate chain checking was introduced in 1.1.0. Setting this flag\n * will force the behaviour to match that of previous versions.\n */\n# define X509_V_FLAG_NO_ALT_CHAINS 0x100000\n/* Do not check certificate/CRL validity against current time */\n# define X509_V_FLAG_NO_CHECK_TIME 0x200000\n\n# define X509_VP_FLAG_DEFAULT 0x1\n# define X509_VP_FLAG_OVERWRITE 0x2\n# define X509_VP_FLAG_RESET_FLAGS 0x4\n# define X509_VP_FLAG_LOCKED 0x8\n# define X509_VP_FLAG_ONCE 0x10\n\n/* Internal use: mask of policy related options */\n# define X509_V_FLAG_POLICY_MASK (X509_V_FLAG_POLICY_CHECK \\\n | X509_V_FLAG_EXPLICIT_POLICY \\\n | X509_V_FLAG_INHIBIT_ANY \\\n | X509_V_FLAG_INHIBIT_MAP)\n\nint X509_OBJECT_idx_by_subject(STACK_OF(X509_OBJECT) *h, X509_LOOKUP_TYPE type,\n X509_NAME *name);\nX509_OBJECT *X509_OBJECT_retrieve_by_subject(STACK_OF(X509_OBJECT) *h,\n X509_LOOKUP_TYPE type,\n X509_NAME *name);\nX509_OBJECT *X509_OBJECT_retrieve_match(STACK_OF(X509_OBJECT) *h,\n X509_OBJECT *x);\nint X509_OBJECT_up_ref_count(X509_OBJECT *a);\nX509_OBJECT *X509_OBJECT_new(void);\nvoid X509_OBJECT_free(X509_OBJECT *a);\nX509_LOOKUP_TYPE X509_OBJECT_get_type(const X509_OBJECT *a);\nX509 *X509_OBJECT_get0_X509(const X509_OBJECT *a);\nint X509_OBJECT_set1_X509(X509_OBJECT *a, X509 *obj);\nX509_CRL *X509_OBJECT_get0_X509_CRL(X509_OBJECT *a);\nint X509_OBJECT_set1_X509_CRL(X509_OBJECT *a, X509_CRL *obj);\nX509_STORE *X509_STORE_new(void);\nvoid X509_STORE_free(X509_STORE *v);\nint X509_STORE_lock(X509_STORE *ctx);\nint X509_STORE_unlock(X509_STORE *ctx);\nint X509_STORE_up_ref(X509_STORE *v);\nSTACK_OF(X509_OBJECT) *X509_STORE_get0_objects(X509_STORE *v);\n\nSTACK_OF(X509) *X509_STORE_CTX_get1_certs(X509_STORE_CTX *st, X509_NAME *nm);\nSTACK_OF(X509_CRL) *X509_STORE_CTX_get1_crls(X509_STORE_CTX *st, X509_NAME *nm);\nint X509_STORE_set_flags(X509_STORE *ctx, unsigned long flags);\nint X509_STORE_set_purpose(X509_STORE *ctx, int purpose);\nint X509_STORE_set_trust(X509_STORE *ctx, int trust);\nint X509_STORE_set1_param(X509_STORE *ctx, X509_VERIFY_PARAM *pm);\nX509_VERIFY_PARAM *X509_STORE_get0_param(X509_STORE *ctx);\n\nvoid X509_STORE_set_verify(X509_STORE *ctx, X509_STORE_CTX_verify_fn verify);\n#define X509_STORE_set_verify_func(ctx, func) \\\n X509_STORE_set_verify((ctx),(func))\nvoid X509_STORE_CTX_set_verify(X509_STORE_CTX *ctx,\n X509_STORE_CTX_verify_fn verify);\nX509_STORE_CTX_verify_fn X509_STORE_get_verify(X509_STORE *ctx);\nvoid X509_STORE_set_verify_cb(X509_STORE *ctx,\n X509_STORE_CTX_verify_cb verify_cb);\n# define X509_STORE_set_verify_cb_func(ctx,func) \\\n X509_STORE_set_verify_cb((ctx),(func))\nX509_STORE_CTX_verify_cb X509_STORE_get_verify_cb(X509_STORE *ctx);\nvoid X509_STORE_set_get_issuer(X509_STORE *ctx,\n X509_STORE_CTX_get_issuer_fn get_issuer);\nX509_STORE_CTX_get_issuer_fn X509_STORE_get_get_issuer(X509_STORE *ctx);\nvoid X509_STORE_set_check_issued(X509_STORE *ctx,\n X509_STORE_CTX_check_issued_fn check_issued);\nX509_STORE_CTX_check_issued_fn X509_STORE_get_check_issued(X509_STORE *ctx);\nvoid X509_STORE_set_check_revocation(X509_STORE *ctx,\n X509_STORE_CTX_check_revocation_fn check_revocation);\nX509_STORE_CTX_check_revocation_fn X509_STORE_get_check_revocation(X509_STORE *ctx);\nvoid X509_STORE_set_get_crl(X509_STORE *ctx,\n X509_STORE_CTX_get_crl_fn get_crl);\nX509_STORE_CTX_get_crl_fn X509_STORE_get_get_crl(X509_STORE *ctx);\nvoid X509_STORE_set_check_crl(X509_STORE *ctx,\n X509_STORE_CTX_check_crl_fn check_crl);\nX509_STORE_CTX_check_crl_fn X509_STORE_get_check_crl(X509_STORE *ctx);\nvoid X509_STORE_set_cert_crl(X509_STORE *ctx,\n X509_STORE_CTX_cert_crl_fn cert_crl);\nX509_STORE_CTX_cert_crl_fn X509_STORE_get_cert_crl(X509_STORE *ctx);\nvoid X509_STORE_set_check_policy(X509_STORE *ctx,\n X509_STORE_CTX_check_policy_fn check_policy);\nX509_STORE_CTX_check_policy_fn X509_STORE_get_check_policy(X509_STORE *ctx);\nvoid X509_STORE_set_lookup_certs(X509_STORE *ctx,\n X509_STORE_CTX_lookup_certs_fn lookup_certs);\nX509_STORE_CTX_lookup_certs_fn X509_STORE_get_lookup_certs(X509_STORE *ctx);\nvoid X509_STORE_set_lookup_crls(X509_STORE *ctx,\n X509_STORE_CTX_lookup_crls_fn lookup_crls);\n#define X509_STORE_set_lookup_crls_cb(ctx, func) \\\n X509_STORE_set_lookup_crls((ctx), (func))\nX509_STORE_CTX_lookup_crls_fn X509_STORE_get_lookup_crls(X509_STORE *ctx);\nvoid X509_STORE_set_cleanup(X509_STORE *ctx,\n X509_STORE_CTX_cleanup_fn cleanup);\nX509_STORE_CTX_cleanup_fn X509_STORE_get_cleanup(X509_STORE *ctx);\n\n#define X509_STORE_get_ex_new_index(l, p, newf, dupf, freef) \\\n CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_X509_STORE, l, p, newf, dupf, freef)\nint X509_STORE_set_ex_data(X509_STORE *ctx, int idx, void *data);\nvoid *X509_STORE_get_ex_data(X509_STORE *ctx, int idx);\n\nX509_STORE_CTX *X509_STORE_CTX_new(void);\n\nint X509_STORE_CTX_get1_issuer(X509 **issuer, X509_STORE_CTX *ctx, X509 *x);\n\nvoid X509_STORE_CTX_free(X509_STORE_CTX *ctx);\nint X509_STORE_CTX_init(X509_STORE_CTX *ctx, X509_STORE *store,\n X509 *x509, STACK_OF(X509) *chain);\nvoid X509_STORE_CTX_set0_trusted_stack(X509_STORE_CTX *ctx, STACK_OF(X509) *sk);\nvoid X509_STORE_CTX_cleanup(X509_STORE_CTX *ctx);\n\nX509_STORE *X509_STORE_CTX_get0_store(X509_STORE_CTX *ctx);\nX509 *X509_STORE_CTX_get0_cert(X509_STORE_CTX *ctx);\nSTACK_OF(X509)* X509_STORE_CTX_get0_untrusted(X509_STORE_CTX *ctx);\nvoid X509_STORE_CTX_set0_untrusted(X509_STORE_CTX *ctx, STACK_OF(X509) *sk);\nvoid X509_STORE_CTX_set_verify_cb(X509_STORE_CTX *ctx,\n X509_STORE_CTX_verify_cb verify);\nX509_STORE_CTX_verify_cb X509_STORE_CTX_get_verify_cb(X509_STORE_CTX *ctx);\nX509_STORE_CTX_verify_fn X509_STORE_CTX_get_verify(X509_STORE_CTX *ctx);\nX509_STORE_CTX_get_issuer_fn X509_STORE_CTX_get_get_issuer(X509_STORE_CTX *ctx);\nX509_STORE_CTX_check_issued_fn X509_STORE_CTX_get_check_issued(X509_STORE_CTX *ctx);\nX509_STORE_CTX_check_revocation_fn X509_STORE_CTX_get_check_revocation(X509_STORE_CTX *ctx);\nX509_STORE_CTX_get_crl_fn X509_STORE_CTX_get_get_crl(X509_STORE_CTX *ctx);\nX509_STORE_CTX_check_crl_fn X509_STORE_CTX_get_check_crl(X509_STORE_CTX *ctx);\nX509_STORE_CTX_cert_crl_fn X509_STORE_CTX_get_cert_crl(X509_STORE_CTX *ctx);\nX509_STORE_CTX_check_policy_fn X509_STORE_CTX_get_check_policy(X509_STORE_CTX *ctx);\nX509_STORE_CTX_lookup_certs_fn X509_STORE_CTX_get_lookup_certs(X509_STORE_CTX *ctx);\nX509_STORE_CTX_lookup_crls_fn X509_STORE_CTX_get_lookup_crls(X509_STORE_CTX *ctx);\nX509_STORE_CTX_cleanup_fn X509_STORE_CTX_get_cleanup(X509_STORE_CTX *ctx);\n\n#if OPENSSL_API_COMPAT < 0x10100000L\n# define X509_STORE_CTX_get_chain X509_STORE_CTX_get0_chain\n# define X509_STORE_CTX_set_chain X509_STORE_CTX_set0_untrusted\n# define X509_STORE_CTX_trusted_stack X509_STORE_CTX_set0_trusted_stack\n# define X509_STORE_get_by_subject X509_STORE_CTX_get_by_subject\n# define X509_STORE_get1_certs X509_STORE_CTX_get1_certs\n# define X509_STORE_get1_crls X509_STORE_CTX_get1_crls\n/* the following macro is misspelled; use X509_STORE_get1_certs instead */\n# define X509_STORE_get1_cert X509_STORE_CTX_get1_certs\n/* the following macro is misspelled; use X509_STORE_get1_crls instead */\n# define X509_STORE_get1_crl X509_STORE_CTX_get1_crls\n#endif\n\nX509_LOOKUP *X509_STORE_add_lookup(X509_STORE *v, X509_LOOKUP_METHOD *m);\nX509_LOOKUP_METHOD *X509_LOOKUP_hash_dir(void);\nX509_LOOKUP_METHOD *X509_LOOKUP_file(void);\n\ntypedef int (*X509_LOOKUP_ctrl_fn)(X509_LOOKUP *ctx, int cmd, const char *argc,\n long argl, char **ret);\ntypedef int (*X509_LOOKUP_get_by_subject_fn)(X509_LOOKUP *ctx,\n X509_LOOKUP_TYPE type,\n X509_NAME *name,\n X509_OBJECT *ret);\ntypedef int (*X509_LOOKUP_get_by_issuer_serial_fn)(X509_LOOKUP *ctx,\n X509_LOOKUP_TYPE type,\n X509_NAME *name,\n ASN1_INTEGER *serial,\n X509_OBJECT *ret);\ntypedef int (*X509_LOOKUP_get_by_fingerprint_fn)(X509_LOOKUP *ctx,\n X509_LOOKUP_TYPE type,\n const unsigned char* bytes,\n int len,\n X509_OBJECT *ret);\ntypedef int (*X509_LOOKUP_get_by_alias_fn)(X509_LOOKUP *ctx,\n X509_LOOKUP_TYPE type,\n const char *str,\n int len,\n X509_OBJECT *ret);\n\nX509_LOOKUP_METHOD *X509_LOOKUP_meth_new(const char *name);\nvoid X509_LOOKUP_meth_free(X509_LOOKUP_METHOD *method);\n\nint X509_LOOKUP_meth_set_new_item(X509_LOOKUP_METHOD *method,\n int (*new_item) (X509_LOOKUP *ctx));\nint (*X509_LOOKUP_meth_get_new_item(const X509_LOOKUP_METHOD* method))\n (X509_LOOKUP *ctx);\n\nint X509_LOOKUP_meth_set_free(X509_LOOKUP_METHOD *method,\n void (*free_fn) (X509_LOOKUP *ctx));\nvoid (*X509_LOOKUP_meth_get_free(const X509_LOOKUP_METHOD* method))\n (X509_LOOKUP *ctx);\n\nint X509_LOOKUP_meth_set_init(X509_LOOKUP_METHOD *method,\n int (*init) (X509_LOOKUP *ctx));\nint (*X509_LOOKUP_meth_get_init(const X509_LOOKUP_METHOD* method))\n (X509_LOOKUP *ctx);\n\nint X509_LOOKUP_meth_set_shutdown(X509_LOOKUP_METHOD *method,\n int (*shutdown) (X509_LOOKUP *ctx));\nint (*X509_LOOKUP_meth_get_shutdown(const X509_LOOKUP_METHOD* method))\n (X509_LOOKUP *ctx);\n\nint X509_LOOKUP_meth_set_ctrl(X509_LOOKUP_METHOD *method,\n X509_LOOKUP_ctrl_fn ctrl_fn);\nX509_LOOKUP_ctrl_fn X509_LOOKUP_meth_get_ctrl(const X509_LOOKUP_METHOD *method);\n\nint X509_LOOKUP_meth_set_get_by_subject(X509_LOOKUP_METHOD *method,\n X509_LOOKUP_get_by_subject_fn fn);\nX509_LOOKUP_get_by_subject_fn X509_LOOKUP_meth_get_get_by_subject(\n const X509_LOOKUP_METHOD *method);\n\nint X509_LOOKUP_meth_set_get_by_issuer_serial(X509_LOOKUP_METHOD *method,\n X509_LOOKUP_get_by_issuer_serial_fn fn);\nX509_LOOKUP_get_by_issuer_serial_fn X509_LOOKUP_meth_get_get_by_issuer_serial(\n const X509_LOOKUP_METHOD *method);\n\nint X509_LOOKUP_meth_set_get_by_fingerprint(X509_LOOKUP_METHOD *method,\n X509_LOOKUP_get_by_fingerprint_fn fn);\nX509_LOOKUP_get_by_fingerprint_fn X509_LOOKUP_meth_get_get_by_fingerprint(\n const X509_LOOKUP_METHOD *method);\n\nint X509_LOOKUP_meth_set_get_by_alias(X509_LOOKUP_METHOD *method,\n X509_LOOKUP_get_by_alias_fn fn);\nX509_LOOKUP_get_by_alias_fn X509_LOOKUP_meth_get_get_by_alias(\n const X509_LOOKUP_METHOD *method);\n\n\nint X509_STORE_add_cert(X509_STORE *ctx, X509 *x);\nint X509_STORE_add_crl(X509_STORE *ctx, X509_CRL *x);\n\nint X509_STORE_CTX_get_by_subject(X509_STORE_CTX *vs, X509_LOOKUP_TYPE type,\n X509_NAME *name, X509_OBJECT *ret);\nX509_OBJECT *X509_STORE_CTX_get_obj_by_subject(X509_STORE_CTX *vs,\n X509_LOOKUP_TYPE type,\n X509_NAME *name);\n\nint X509_LOOKUP_ctrl(X509_LOOKUP *ctx, int cmd, const char *argc,\n long argl, char **ret);\n\nint X509_load_cert_file(X509_LOOKUP *ctx, const char *file, int type);\nint X509_load_crl_file(X509_LOOKUP *ctx, const char *file, int type);\nint X509_load_cert_crl_file(X509_LOOKUP *ctx, const char *file, int type);\n\nX509_LOOKUP *X509_LOOKUP_new(X509_LOOKUP_METHOD *method);\nvoid X509_LOOKUP_free(X509_LOOKUP *ctx);\nint X509_LOOKUP_init(X509_LOOKUP *ctx);\nint X509_LOOKUP_by_subject(X509_LOOKUP *ctx, X509_LOOKUP_TYPE type,\n X509_NAME *name, X509_OBJECT *ret);\nint X509_LOOKUP_by_issuer_serial(X509_LOOKUP *ctx, X509_LOOKUP_TYPE type,\n X509_NAME *name, ASN1_INTEGER *serial,\n X509_OBJECT *ret);\nint X509_LOOKUP_by_fingerprint(X509_LOOKUP *ctx, X509_LOOKUP_TYPE type,\n const unsigned char *bytes, int len,\n X509_OBJECT *ret);\nint X509_LOOKUP_by_alias(X509_LOOKUP *ctx, X509_LOOKUP_TYPE type,\n const char *str, int len, X509_OBJECT *ret);\nint X509_LOOKUP_set_method_data(X509_LOOKUP *ctx, void *data);\nvoid *X509_LOOKUP_get_method_data(const X509_LOOKUP *ctx);\nX509_STORE *X509_LOOKUP_get_store(const X509_LOOKUP *ctx);\nint X509_LOOKUP_shutdown(X509_LOOKUP *ctx);\n\nint X509_STORE_load_locations(X509_STORE *ctx,\n const char *file, const char *dir);\nint X509_STORE_set_default_paths(X509_STORE *ctx);\n\n#define X509_STORE_CTX_get_ex_new_index(l, p, newf, dupf, freef) \\\n CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_X509_STORE_CTX, l, p, newf, dupf, freef)\nint X509_STORE_CTX_set_ex_data(X509_STORE_CTX *ctx, int idx, void *data);\nvoid *X509_STORE_CTX_get_ex_data(X509_STORE_CTX *ctx, int idx);\nint X509_STORE_CTX_get_error(X509_STORE_CTX *ctx);\nvoid X509_STORE_CTX_set_error(X509_STORE_CTX *ctx, int s);\nint X509_STORE_CTX_get_error_depth(X509_STORE_CTX *ctx);\nvoid X509_STORE_CTX_set_error_depth(X509_STORE_CTX *ctx, int depth);\nX509 *X509_STORE_CTX_get_current_cert(X509_STORE_CTX *ctx);\nvoid X509_STORE_CTX_set_current_cert(X509_STORE_CTX *ctx, X509 *x);\nX509 *X509_STORE_CTX_get0_current_issuer(X509_STORE_CTX *ctx);\nX509_CRL *X509_STORE_CTX_get0_current_crl(X509_STORE_CTX *ctx);\nX509_STORE_CTX *X509_STORE_CTX_get0_parent_ctx(X509_STORE_CTX *ctx);\nSTACK_OF(X509) *X509_STORE_CTX_get0_chain(X509_STORE_CTX *ctx);\nSTACK_OF(X509) *X509_STORE_CTX_get1_chain(X509_STORE_CTX *ctx);\nvoid X509_STORE_CTX_set_cert(X509_STORE_CTX *c, X509 *x);\nvoid X509_STORE_CTX_set0_verified_chain(X509_STORE_CTX *c, STACK_OF(X509) *sk);\nvoid X509_STORE_CTX_set0_crls(X509_STORE_CTX *c, STACK_OF(X509_CRL) *sk);\nint X509_STORE_CTX_set_purpose(X509_STORE_CTX *ctx, int purpose);\nint X509_STORE_CTX_set_trust(X509_STORE_CTX *ctx, int trust);\nint X509_STORE_CTX_purpose_inherit(X509_STORE_CTX *ctx, int def_purpose,\n int purpose, int trust);\nvoid X509_STORE_CTX_set_flags(X509_STORE_CTX *ctx, unsigned long flags);\nvoid X509_STORE_CTX_set_time(X509_STORE_CTX *ctx, unsigned long flags,\n time_t t);\n\nX509_POLICY_TREE *X509_STORE_CTX_get0_policy_tree(X509_STORE_CTX *ctx);\nint X509_STORE_CTX_get_explicit_policy(X509_STORE_CTX *ctx);\nint X509_STORE_CTX_get_num_untrusted(X509_STORE_CTX *ctx);\n\nX509_VERIFY_PARAM *X509_STORE_CTX_get0_param(X509_STORE_CTX *ctx);\nvoid X509_STORE_CTX_set0_param(X509_STORE_CTX *ctx, X509_VERIFY_PARAM *param);\nint X509_STORE_CTX_set_default(X509_STORE_CTX *ctx, const char *name);\n\n/*\n * Bridge opacity barrier between libcrypt and libssl, also needed to support\n * offline testing in test/danetest.c\n */\nvoid X509_STORE_CTX_set0_dane(X509_STORE_CTX *ctx, SSL_DANE *dane);\n#define DANE_FLAG_NO_DANE_EE_NAMECHECKS (1L << 0)\n\n/* X509_VERIFY_PARAM functions */\n\nX509_VERIFY_PARAM *X509_VERIFY_PARAM_new(void);\nvoid X509_VERIFY_PARAM_free(X509_VERIFY_PARAM *param);\nint X509_VERIFY_PARAM_inherit(X509_VERIFY_PARAM *to,\n const X509_VERIFY_PARAM *from);\nint X509_VERIFY_PARAM_set1(X509_VERIFY_PARAM *to,\n const X509_VERIFY_PARAM *from);\nint X509_VERIFY_PARAM_set1_name(X509_VERIFY_PARAM *param, const char *name);\nint X509_VERIFY_PARAM_set_flags(X509_VERIFY_PARAM *param,\n unsigned long flags);\nint X509_VERIFY_PARAM_clear_flags(X509_VERIFY_PARAM *param,\n unsigned long flags);\nunsigned long X509_VERIFY_PARAM_get_flags(X509_VERIFY_PARAM *param);\nint X509_VERIFY_PARAM_set_purpose(X509_VERIFY_PARAM *param, int purpose);\nint X509_VERIFY_PARAM_set_trust(X509_VERIFY_PARAM *param, int trust);\nvoid X509_VERIFY_PARAM_set_depth(X509_VERIFY_PARAM *param, int depth);\nvoid X509_VERIFY_PARAM_set_auth_level(X509_VERIFY_PARAM *param, int auth_level);\ntime_t X509_VERIFY_PARAM_get_time(const X509_VERIFY_PARAM *param);\nvoid X509_VERIFY_PARAM_set_time(X509_VERIFY_PARAM *param, time_t t);\nint X509_VERIFY_PARAM_add0_policy(X509_VERIFY_PARAM *param,\n ASN1_OBJECT *policy);\nint X509_VERIFY_PARAM_set1_policies(X509_VERIFY_PARAM *param,\n STACK_OF(ASN1_OBJECT) *policies);\n\nint X509_VERIFY_PARAM_set_inh_flags(X509_VERIFY_PARAM *param,\n uint32_t flags);\nuint32_t X509_VERIFY_PARAM_get_inh_flags(const X509_VERIFY_PARAM *param);\n\nint X509_VERIFY_PARAM_set1_host(X509_VERIFY_PARAM *param,\n const char *name, size_t namelen);\nint X509_VERIFY_PARAM_add1_host(X509_VERIFY_PARAM *param,\n const char *name, size_t namelen);\nvoid X509_VERIFY_PARAM_set_hostflags(X509_VERIFY_PARAM *param,\n unsigned int flags);\nunsigned int X509_VERIFY_PARAM_get_hostflags(const X509_VERIFY_PARAM *param);\nchar *X509_VERIFY_PARAM_get0_peername(X509_VERIFY_PARAM *);\nvoid X509_VERIFY_PARAM_move_peername(X509_VERIFY_PARAM *, X509_VERIFY_PARAM *);\nint X509_VERIFY_PARAM_set1_email(X509_VERIFY_PARAM *param,\n const char *email, size_t emaillen);\nint X509_VERIFY_PARAM_set1_ip(X509_VERIFY_PARAM *param,\n const unsigned char *ip, size_t iplen);\nint X509_VERIFY_PARAM_set1_ip_asc(X509_VERIFY_PARAM *param,\n const char *ipasc);\n\nint X509_VERIFY_PARAM_get_depth(const X509_VERIFY_PARAM *param);\nint X509_VERIFY_PARAM_get_auth_level(const X509_VERIFY_PARAM *param);\nconst char *X509_VERIFY_PARAM_get0_name(const X509_VERIFY_PARAM *param);\n\nint X509_VERIFY_PARAM_add0_table(X509_VERIFY_PARAM *param);\nint X509_VERIFY_PARAM_get_count(void);\nconst X509_VERIFY_PARAM *X509_VERIFY_PARAM_get0(int id);\nconst X509_VERIFY_PARAM *X509_VERIFY_PARAM_lookup(const char *name);\nvoid X509_VERIFY_PARAM_table_cleanup(void);\n\n/* Non positive return values are errors */\n#define X509_PCY_TREE_FAILURE -2 /* Failure to satisfy explicit policy */\n#define X509_PCY_TREE_INVALID -1 /* Inconsistent or invalid extensions */\n#define X509_PCY_TREE_INTERNAL 0 /* Internal error, most likely malloc */\n\n/*\n * Positive return values form a bit mask, all but the first are internal to\n * the library and don't appear in results from X509_policy_check().\n */\n#define X509_PCY_TREE_VALID 1 /* The policy tree is valid */\n#define X509_PCY_TREE_EMPTY 2 /* The policy tree is empty */\n#define X509_PCY_TREE_EXPLICIT 4 /* Explicit policy required */\n\nint X509_policy_check(X509_POLICY_TREE **ptree, int *pexplicit_policy,\n STACK_OF(X509) *certs,\n STACK_OF(ASN1_OBJECT) *policy_oids, unsigned int flags);\n\nvoid X509_policy_tree_free(X509_POLICY_TREE *tree);\n\nint X509_policy_tree_level_count(const X509_POLICY_TREE *tree);\nX509_POLICY_LEVEL *X509_policy_tree_get0_level(const X509_POLICY_TREE *tree,\n int i);\n\nSTACK_OF(X509_POLICY_NODE) *X509_policy_tree_get0_policies(const\n X509_POLICY_TREE\n *tree);\n\nSTACK_OF(X509_POLICY_NODE) *X509_policy_tree_get0_user_policies(const\n X509_POLICY_TREE\n *tree);\n\nint X509_policy_level_node_count(X509_POLICY_LEVEL *level);\n\nX509_POLICY_NODE *X509_policy_level_get0_node(X509_POLICY_LEVEL *level,\n int i);\n\nconst ASN1_OBJECT *X509_policy_node_get0_policy(const X509_POLICY_NODE *node);\n\nSTACK_OF(POLICYQUALINFO) *X509_policy_node_get0_qualifiers(const\n X509_POLICY_NODE\n *node);\nconst X509_POLICY_NODE *X509_policy_node_get0_parent(const X509_POLICY_NODE\n *node);\n\n#ifdef __cplusplus\n}\n#endif\n#endif\n" }, { "path": "cryptomini/include/openssl/x509err.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_X509ERR_H\n# define HEADER_X509ERR_H\n\n# include \n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_X509_strings(void);\n\n/*\n * X509 function codes.\n */\n# define X509_F_ADD_CERT_DIR 100\n# define X509_F_BUILD_CHAIN 106\n# define X509_F_BY_FILE_CTRL 101\n# define X509_F_CHECK_NAME_CONSTRAINTS 149\n# define X509_F_CHECK_POLICY 145\n# define X509_F_DANE_I2D 107\n# define X509_F_DIR_CTRL 102\n# define X509_F_GET_CERT_BY_SUBJECT 103\n# define X509_F_I2D_X509_AUX 151\n# define X509_F_LOOKUP_CERTS_SK 152\n# define X509_F_NETSCAPE_SPKI_B64_DECODE 129\n# define X509_F_NETSCAPE_SPKI_B64_ENCODE 130\n# define X509_F_NEW_DIR 153\n# define X509_F_X509AT_ADD1_ATTR 135\n# define X509_F_X509V3_ADD_EXT 104\n# define X509_F_X509_ATTRIBUTE_CREATE_BY_NID 136\n# define X509_F_X509_ATTRIBUTE_CREATE_BY_OBJ 137\n# define X509_F_X509_ATTRIBUTE_CREATE_BY_TXT 140\n# define X509_F_X509_ATTRIBUTE_GET0_DATA 139\n# define X509_F_X509_ATTRIBUTE_SET1_DATA 138\n# define X509_F_X509_CHECK_PRIVATE_KEY 128\n# define X509_F_X509_CRL_DIFF 105\n# define X509_F_X509_CRL_METHOD_NEW 154\n# define X509_F_X509_CRL_PRINT_FP 147\n# define X509_F_X509_EXTENSION_CREATE_BY_NID 108\n# define X509_F_X509_EXTENSION_CREATE_BY_OBJ 109\n# define X509_F_X509_GET_PUBKEY_PARAMETERS 110\n# define X509_F_X509_LOAD_CERT_CRL_FILE 132\n# define X509_F_X509_LOAD_CERT_FILE 111\n# define X509_F_X509_LOAD_CRL_FILE 112\n# define X509_F_X509_LOOKUP_METH_NEW 160\n# define X509_F_X509_LOOKUP_NEW 155\n# define X509_F_X509_NAME_ADD_ENTRY 113\n# define X509_F_X509_NAME_CANON 156\n# define X509_F_X509_NAME_ENTRY_CREATE_BY_NID 114\n# define X509_F_X509_NAME_ENTRY_CREATE_BY_TXT 131\n# define X509_F_X509_NAME_ENTRY_SET_OBJECT 115\n# define X509_F_X509_NAME_ONELINE 116\n# define X509_F_X509_NAME_PRINT 117\n# define X509_F_X509_OBJECT_NEW 150\n# define X509_F_X509_PRINT_EX_FP 118\n# define X509_F_X509_PUBKEY_DECODE 148\n# define X509_F_X509_PUBKEY_GET 161\n# define X509_F_X509_PUBKEY_GET0 119\n# define X509_F_X509_PUBKEY_SET 120\n# define X509_F_X509_REQ_CHECK_PRIVATE_KEY 144\n# define X509_F_X509_REQ_PRINT_EX 121\n# define X509_F_X509_REQ_PRINT_FP 122\n# define X509_F_X509_REQ_TO_X509 123\n# define X509_F_X509_STORE_ADD_CERT 124\n# define X509_F_X509_STORE_ADD_CRL 125\n# define X509_F_X509_STORE_ADD_LOOKUP 157\n# define X509_F_X509_STORE_CTX_GET1_ISSUER 146\n# define X509_F_X509_STORE_CTX_INIT 143\n# define X509_F_X509_STORE_CTX_NEW 142\n# define X509_F_X509_STORE_CTX_PURPOSE_INHERIT 134\n# define X509_F_X509_STORE_NEW 158\n# define X509_F_X509_TO_X509_REQ 126\n# define X509_F_X509_TRUST_ADD 133\n# define X509_F_X509_TRUST_SET 141\n# define X509_F_X509_VERIFY_CERT 127\n# define X509_F_X509_VERIFY_PARAM_NEW 159\n\n/*\n * X509 reason codes.\n */\n# define X509_R_AKID_MISMATCH 110\n# define X509_R_BAD_SELECTOR 133\n# define X509_R_BAD_X509_FILETYPE 100\n# define X509_R_BASE64_DECODE_ERROR 118\n# define X509_R_CANT_CHECK_DH_KEY 114\n# define X509_R_CERT_ALREADY_IN_HASH_TABLE 101\n# define X509_R_CRL_ALREADY_DELTA 127\n# define X509_R_CRL_VERIFY_FAILURE 131\n# define X509_R_IDP_MISMATCH 128\n# define X509_R_INVALID_ATTRIBUTES 138\n# define X509_R_INVALID_DIRECTORY 113\n# define X509_R_INVALID_FIELD_NAME 119\n# define X509_R_INVALID_TRUST 123\n# define X509_R_ISSUER_MISMATCH 129\n# define X509_R_KEY_TYPE_MISMATCH 115\n# define X509_R_KEY_VALUES_MISMATCH 116\n# define X509_R_LOADING_CERT_DIR 103\n# define X509_R_LOADING_DEFAULTS 104\n# define X509_R_METHOD_NOT_SUPPORTED 124\n# define X509_R_NAME_TOO_LONG 134\n# define X509_R_NEWER_CRL_NOT_NEWER 132\n# define X509_R_NO_CERTIFICATE_FOUND 135\n# define X509_R_NO_CERTIFICATE_OR_CRL_FOUND 136\n# define X509_R_NO_CERT_SET_FOR_US_TO_VERIFY 105\n# define X509_R_NO_CRL_FOUND 137\n# define X509_R_NO_CRL_NUMBER 130\n# define X509_R_PUBLIC_KEY_DECODE_ERROR 125\n# define X509_R_PUBLIC_KEY_ENCODE_ERROR 126\n# define X509_R_SHOULD_RETRY 106\n# define X509_R_UNABLE_TO_FIND_PARAMETERS_IN_CHAIN 107\n# define X509_R_UNABLE_TO_GET_CERTS_PUBLIC_KEY 108\n# define X509_R_UNKNOWN_KEY_TYPE 117\n# define X509_R_UNKNOWN_NID 109\n# define X509_R_UNKNOWN_PURPOSE_ID 121\n# define X509_R_UNKNOWN_TRUST_ID 120\n# define X509_R_UNSUPPORTED_ALGORITHM 111\n# define X509_R_WRONG_LOOKUP_TYPE 112\n# define X509_R_WRONG_TYPE 122\n\n#endif\n" }, { "path": "cryptomini/include/openssl/x509v3.h", "content": "/*\n * Copyright 1999-2021 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_X509V3_H\n# define HEADER_X509V3_H\n\n# include \n# include \n# include \n# include \n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/* Forward reference */\nstruct v3_ext_method;\nstruct v3_ext_ctx;\n\n/* Useful typedefs */\n\ntypedef void *(*X509V3_EXT_NEW)(void);\ntypedef void (*X509V3_EXT_FREE) (void *);\ntypedef void *(*X509V3_EXT_D2I)(void *, const unsigned char **, long);\ntypedef int (*X509V3_EXT_I2D) (void *, unsigned char **);\ntypedef STACK_OF(CONF_VALUE) *\n (*X509V3_EXT_I2V) (const struct v3_ext_method *method, void *ext,\n STACK_OF(CONF_VALUE) *extlist);\ntypedef void *(*X509V3_EXT_V2I)(const struct v3_ext_method *method,\n struct v3_ext_ctx *ctx,\n STACK_OF(CONF_VALUE) *values);\ntypedef char *(*X509V3_EXT_I2S)(const struct v3_ext_method *method,\n void *ext);\ntypedef void *(*X509V3_EXT_S2I)(const struct v3_ext_method *method,\n struct v3_ext_ctx *ctx, const char *str);\ntypedef int (*X509V3_EXT_I2R) (const struct v3_ext_method *method, void *ext,\n BIO *out, int indent);\ntypedef void *(*X509V3_EXT_R2I)(const struct v3_ext_method *method,\n struct v3_ext_ctx *ctx, const char *str);\n\n/* V3 extension structure */\n\nstruct v3_ext_method {\n int ext_nid;\n int ext_flags;\n/* If this is set the following four fields are ignored */\n ASN1_ITEM_EXP *it;\n/* Old style ASN1 calls */\n X509V3_EXT_NEW ext_new;\n X509V3_EXT_FREE ext_free;\n X509V3_EXT_D2I d2i;\n X509V3_EXT_I2D i2d;\n/* The following pair is used for string extensions */\n X509V3_EXT_I2S i2s;\n X509V3_EXT_S2I s2i;\n/* The following pair is used for multi-valued extensions */\n X509V3_EXT_I2V i2v;\n X509V3_EXT_V2I v2i;\n/* The following are used for raw extensions */\n X509V3_EXT_I2R i2r;\n X509V3_EXT_R2I r2i;\n void *usr_data; /* Any extension specific data */\n};\n\ntypedef struct X509V3_CONF_METHOD_st {\n char *(*get_string) (void *db, const char *section, const char *value);\n STACK_OF(CONF_VALUE) *(*get_section) (void *db, const char *section);\n void (*free_string) (void *db, char *string);\n void (*free_section) (void *db, STACK_OF(CONF_VALUE) *section);\n} X509V3_CONF_METHOD;\n\n/* Context specific info */\nstruct v3_ext_ctx {\n# define CTX_TEST 0x1\n# define X509V3_CTX_REPLACE 0x2\n int flags;\n X509 *issuer_cert;\n X509 *subject_cert;\n X509_REQ *subject_req;\n X509_CRL *crl;\n X509V3_CONF_METHOD *db_meth;\n void *db;\n/* Maybe more here */\n};\n\ntypedef struct v3_ext_method X509V3_EXT_METHOD;\n\nDEFINE_STACK_OF(X509V3_EXT_METHOD)\n\n/* ext_flags values */\n# define X509V3_EXT_DYNAMIC 0x1\n# define X509V3_EXT_CTX_DEP 0x2\n# define X509V3_EXT_MULTILINE 0x4\n\ntypedef BIT_STRING_BITNAME ENUMERATED_NAMES;\n\ntypedef struct BASIC_CONSTRAINTS_st {\n int ca;\n ASN1_INTEGER *pathlen;\n} BASIC_CONSTRAINTS;\n\ntypedef struct PKEY_USAGE_PERIOD_st {\n ASN1_GENERALIZEDTIME *notBefore;\n ASN1_GENERALIZEDTIME *notAfter;\n} PKEY_USAGE_PERIOD;\n\ntypedef struct otherName_st {\n ASN1_OBJECT *type_id;\n ASN1_TYPE *value;\n} OTHERNAME;\n\ntypedef struct EDIPartyName_st {\n ASN1_STRING *nameAssigner;\n ASN1_STRING *partyName;\n} EDIPARTYNAME;\n\ntypedef struct GENERAL_NAME_st {\n# define GEN_OTHERNAME 0\n# define GEN_EMAIL 1\n# define GEN_DNS 2\n# define GEN_X400 3\n# define GEN_DIRNAME 4\n# define GEN_EDIPARTY 5\n# define GEN_URI 6\n# define GEN_IPADD 7\n# define GEN_RID 8\n int type;\n union {\n char *ptr;\n OTHERNAME *otherName; /* otherName */\n ASN1_IA5STRING *rfc822Name;\n ASN1_IA5STRING *dNSName;\n ASN1_TYPE *x400Address;\n X509_NAME *directoryName;\n EDIPARTYNAME *ediPartyName;\n ASN1_IA5STRING *uniformResourceIdentifier;\n ASN1_OCTET_STRING *iPAddress;\n ASN1_OBJECT *registeredID;\n /* Old names */\n ASN1_OCTET_STRING *ip; /* iPAddress */\n X509_NAME *dirn; /* dirn */\n ASN1_IA5STRING *ia5; /* rfc822Name, dNSName,\n * uniformResourceIdentifier */\n ASN1_OBJECT *rid; /* registeredID */\n ASN1_TYPE *other; /* x400Address */\n } d;\n} GENERAL_NAME;\n\ntypedef struct ACCESS_DESCRIPTION_st {\n ASN1_OBJECT *method;\n GENERAL_NAME *location;\n} ACCESS_DESCRIPTION;\n\ntypedef STACK_OF(ACCESS_DESCRIPTION) AUTHORITY_INFO_ACCESS;\n\ntypedef STACK_OF(ASN1_OBJECT) EXTENDED_KEY_USAGE;\n\ntypedef STACK_OF(ASN1_INTEGER) TLS_FEATURE;\n\nDEFINE_STACK_OF(GENERAL_NAME)\ntypedef STACK_OF(GENERAL_NAME) GENERAL_NAMES;\nDEFINE_STACK_OF(GENERAL_NAMES)\n\nDEFINE_STACK_OF(ACCESS_DESCRIPTION)\n\ntypedef struct DIST_POINT_NAME_st {\n int type;\n union {\n GENERAL_NAMES *fullname;\n STACK_OF(X509_NAME_ENTRY) *relativename;\n } name;\n/* If relativename then this contains the full distribution point name */\n X509_NAME *dpname;\n} DIST_POINT_NAME;\n/* All existing reasons */\n# define CRLDP_ALL_REASONS 0x807f\n\n# define CRL_REASON_NONE -1\n# define CRL_REASON_UNSPECIFIED 0\n# define CRL_REASON_KEY_COMPROMISE 1\n# define CRL_REASON_CA_COMPROMISE 2\n# define CRL_REASON_AFFILIATION_CHANGED 3\n# define CRL_REASON_SUPERSEDED 4\n# define CRL_REASON_CESSATION_OF_OPERATION 5\n# define CRL_REASON_CERTIFICATE_HOLD 6\n# define CRL_REASON_REMOVE_FROM_CRL 8\n# define CRL_REASON_PRIVILEGE_WITHDRAWN 9\n# define CRL_REASON_AA_COMPROMISE 10\n\nstruct DIST_POINT_st {\n DIST_POINT_NAME *distpoint;\n ASN1_BIT_STRING *reasons;\n GENERAL_NAMES *CRLissuer;\n int dp_reasons;\n};\n\ntypedef STACK_OF(DIST_POINT) CRL_DIST_POINTS;\n\nDEFINE_STACK_OF(DIST_POINT)\n\nstruct AUTHORITY_KEYID_st {\n ASN1_OCTET_STRING *keyid;\n GENERAL_NAMES *issuer;\n ASN1_INTEGER *serial;\n};\n\n/* Strong extranet structures */\n\ntypedef struct SXNET_ID_st {\n ASN1_INTEGER *zone;\n ASN1_OCTET_STRING *user;\n} SXNETID;\n\nDEFINE_STACK_OF(SXNETID)\n\ntypedef struct SXNET_st {\n ASN1_INTEGER *version;\n STACK_OF(SXNETID) *ids;\n} SXNET;\n\ntypedef struct NOTICEREF_st {\n ASN1_STRING *organization;\n STACK_OF(ASN1_INTEGER) *noticenos;\n} NOTICEREF;\n\ntypedef struct USERNOTICE_st {\n NOTICEREF *noticeref;\n ASN1_STRING *exptext;\n} USERNOTICE;\n\ntypedef struct POLICYQUALINFO_st {\n ASN1_OBJECT *pqualid;\n union {\n ASN1_IA5STRING *cpsuri;\n USERNOTICE *usernotice;\n ASN1_TYPE *other;\n } d;\n} POLICYQUALINFO;\n\nDEFINE_STACK_OF(POLICYQUALINFO)\n\ntypedef struct POLICYINFO_st {\n ASN1_OBJECT *policyid;\n STACK_OF(POLICYQUALINFO) *qualifiers;\n} POLICYINFO;\n\ntypedef STACK_OF(POLICYINFO) CERTIFICATEPOLICIES;\n\nDEFINE_STACK_OF(POLICYINFO)\n\ntypedef struct POLICY_MAPPING_st {\n ASN1_OBJECT *issuerDomainPolicy;\n ASN1_OBJECT *subjectDomainPolicy;\n} POLICY_MAPPING;\n\nDEFINE_STACK_OF(POLICY_MAPPING)\n\ntypedef STACK_OF(POLICY_MAPPING) POLICY_MAPPINGS;\n\ntypedef struct GENERAL_SUBTREE_st {\n GENERAL_NAME *base;\n ASN1_INTEGER *minimum;\n ASN1_INTEGER *maximum;\n} GENERAL_SUBTREE;\n\nDEFINE_STACK_OF(GENERAL_SUBTREE)\n\nstruct NAME_CONSTRAINTS_st {\n STACK_OF(GENERAL_SUBTREE) *permittedSubtrees;\n STACK_OF(GENERAL_SUBTREE) *excludedSubtrees;\n};\n\ntypedef struct POLICY_CONSTRAINTS_st {\n ASN1_INTEGER *requireExplicitPolicy;\n ASN1_INTEGER *inhibitPolicyMapping;\n} POLICY_CONSTRAINTS;\n\n/* Proxy certificate structures, see RFC 3820 */\ntypedef struct PROXY_POLICY_st {\n ASN1_OBJECT *policyLanguage;\n ASN1_OCTET_STRING *policy;\n} PROXY_POLICY;\n\ntypedef struct PROXY_CERT_INFO_EXTENSION_st {\n ASN1_INTEGER *pcPathLengthConstraint;\n PROXY_POLICY *proxyPolicy;\n} PROXY_CERT_INFO_EXTENSION;\n\nDECLARE_ASN1_FUNCTIONS(PROXY_POLICY)\nDECLARE_ASN1_FUNCTIONS(PROXY_CERT_INFO_EXTENSION)\n\nstruct ISSUING_DIST_POINT_st {\n DIST_POINT_NAME *distpoint;\n int onlyuser;\n int onlyCA;\n ASN1_BIT_STRING *onlysomereasons;\n int indirectCRL;\n int onlyattr;\n};\n\n/* Values in idp_flags field */\n/* IDP present */\n# define IDP_PRESENT 0x1\n/* IDP values inconsistent */\n# define IDP_INVALID 0x2\n/* onlyuser true */\n# define IDP_ONLYUSER 0x4\n/* onlyCA true */\n# define IDP_ONLYCA 0x8\n/* onlyattr true */\n# define IDP_ONLYATTR 0x10\n/* indirectCRL true */\n# define IDP_INDIRECT 0x20\n/* onlysomereasons present */\n# define IDP_REASONS 0x40\n\n# define X509V3_conf_err(val) ERR_add_error_data(6, \\\n \"section:\", (val)->section, \\\n \",name:\", (val)->name, \",value:\", (val)->value)\n\n# define X509V3_set_ctx_test(ctx) \\\n X509V3_set_ctx(ctx, NULL, NULL, NULL, NULL, CTX_TEST)\n# define X509V3_set_ctx_nodb(ctx) (ctx)->db = NULL;\n\n# define EXT_BITSTRING(nid, table) { nid, 0, ASN1_ITEM_ref(ASN1_BIT_STRING), \\\n 0,0,0,0, \\\n 0,0, \\\n (X509V3_EXT_I2V)i2v_ASN1_BIT_STRING, \\\n (X509V3_EXT_V2I)v2i_ASN1_BIT_STRING, \\\n NULL, NULL, \\\n table}\n\n# define EXT_IA5STRING(nid) { nid, 0, ASN1_ITEM_ref(ASN1_IA5STRING), \\\n 0,0,0,0, \\\n (X509V3_EXT_I2S)i2s_ASN1_IA5STRING, \\\n (X509V3_EXT_S2I)s2i_ASN1_IA5STRING, \\\n 0,0,0,0, \\\n NULL}\n\n# define EXT_END { -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}\n\n/* X509_PURPOSE stuff */\n\n# define EXFLAG_BCONS 0x1\n# define EXFLAG_KUSAGE 0x2\n# define EXFLAG_XKUSAGE 0x4\n# define EXFLAG_NSCERT 0x8\n\n# define EXFLAG_CA 0x10\n/* Really self issued not necessarily self signed */\n# define EXFLAG_SI 0x20\n# define EXFLAG_V1 0x40\n# define EXFLAG_INVALID 0x80\n/* EXFLAG_SET is set to indicate that some values have been precomputed */\n# define EXFLAG_SET 0x100\n# define EXFLAG_CRITICAL 0x200\n# define EXFLAG_PROXY 0x400\n\n# define EXFLAG_INVALID_POLICY 0x800\n# define EXFLAG_FRESHEST 0x1000\n# define EXFLAG_SS 0x2000 /* cert is apparently self-signed */\n\n# define EXFLAG_NO_FINGERPRINT 0x100000\n\n# define KU_DIGITAL_SIGNATURE 0x0080\n# define KU_NON_REPUDIATION 0x0040\n# define KU_KEY_ENCIPHERMENT 0x0020\n# define KU_DATA_ENCIPHERMENT 0x0010\n# define KU_KEY_AGREEMENT 0x0008\n# define KU_KEY_CERT_SIGN 0x0004\n# define KU_CRL_SIGN 0x0002\n# define KU_ENCIPHER_ONLY 0x0001\n# define KU_DECIPHER_ONLY 0x8000\n\n# define NS_SSL_CLIENT 0x80\n# define NS_SSL_SERVER 0x40\n# define NS_SMIME 0x20\n# define NS_OBJSIGN 0x10\n# define NS_SSL_CA 0x04\n# define NS_SMIME_CA 0x02\n# define NS_OBJSIGN_CA 0x01\n# define NS_ANY_CA (NS_SSL_CA|NS_SMIME_CA|NS_OBJSIGN_CA)\n\n# define XKU_SSL_SERVER 0x1\n# define XKU_SSL_CLIENT 0x2\n# define XKU_SMIME 0x4\n# define XKU_CODE_SIGN 0x8\n# define XKU_SGC 0x10\n# define XKU_OCSP_SIGN 0x20\n# define XKU_TIMESTAMP 0x40\n# define XKU_DVCS 0x80\n# define XKU_ANYEKU 0x100\n\n# define X509_PURPOSE_DYNAMIC 0x1\n# define X509_PURPOSE_DYNAMIC_NAME 0x2\n\ntypedef struct x509_purpose_st {\n int purpose;\n int trust; /* Default trust ID */\n int flags;\n int (*check_purpose) (const struct x509_purpose_st *, const X509 *, int);\n char *name;\n char *sname;\n void *usr_data;\n} X509_PURPOSE;\n\n# define X509_PURPOSE_SSL_CLIENT 1\n# define X509_PURPOSE_SSL_SERVER 2\n# define X509_PURPOSE_NS_SSL_SERVER 3\n# define X509_PURPOSE_SMIME_SIGN 4\n# define X509_PURPOSE_SMIME_ENCRYPT 5\n# define X509_PURPOSE_CRL_SIGN 6\n# define X509_PURPOSE_ANY 7\n# define X509_PURPOSE_OCSP_HELPER 8\n# define X509_PURPOSE_TIMESTAMP_SIGN 9\n\n# define X509_PURPOSE_MIN 1\n# define X509_PURPOSE_MAX 9\n\n/* Flags for X509V3_EXT_print() */\n\n# define X509V3_EXT_UNKNOWN_MASK (0xfL << 16)\n/* Return error for unknown extensions */\n# define X509V3_EXT_DEFAULT 0\n/* Print error for unknown extensions */\n# define X509V3_EXT_ERROR_UNKNOWN (1L << 16)\n/* ASN1 parse unknown extensions */\n# define X509V3_EXT_PARSE_UNKNOWN (2L << 16)\n/* BIO_dump unknown extensions */\n# define X509V3_EXT_DUMP_UNKNOWN (3L << 16)\n\n/* Flags for X509V3_add1_i2d */\n\n# define X509V3_ADD_OP_MASK 0xfL\n# define X509V3_ADD_DEFAULT 0L\n# define X509V3_ADD_APPEND 1L\n# define X509V3_ADD_REPLACE 2L\n# define X509V3_ADD_REPLACE_EXISTING 3L\n# define X509V3_ADD_KEEP_EXISTING 4L\n# define X509V3_ADD_DELETE 5L\n# define X509V3_ADD_SILENT 0x10\n\nDEFINE_STACK_OF(X509_PURPOSE)\n\nDECLARE_ASN1_FUNCTIONS(BASIC_CONSTRAINTS)\n\nDECLARE_ASN1_FUNCTIONS(SXNET)\nDECLARE_ASN1_FUNCTIONS(SXNETID)\n\nint SXNET_add_id_asc(SXNET **psx, const char *zone, const char *user, int userlen);\nint SXNET_add_id_ulong(SXNET **psx, unsigned long lzone, const char *user,\n int userlen);\nint SXNET_add_id_INTEGER(SXNET **psx, ASN1_INTEGER *izone, const char *user,\n int userlen);\n\nASN1_OCTET_STRING *SXNET_get_id_asc(SXNET *sx, const char *zone);\nASN1_OCTET_STRING *SXNET_get_id_ulong(SXNET *sx, unsigned long lzone);\nASN1_OCTET_STRING *SXNET_get_id_INTEGER(SXNET *sx, ASN1_INTEGER *zone);\n\nDECLARE_ASN1_FUNCTIONS(AUTHORITY_KEYID)\n\nDECLARE_ASN1_FUNCTIONS(PKEY_USAGE_PERIOD)\n\nDECLARE_ASN1_FUNCTIONS(GENERAL_NAME)\nGENERAL_NAME *GENERAL_NAME_dup(GENERAL_NAME *a);\nint GENERAL_NAME_cmp(GENERAL_NAME *a, GENERAL_NAME *b);\n\nASN1_BIT_STRING *v2i_ASN1_BIT_STRING(X509V3_EXT_METHOD *method,\n X509V3_CTX *ctx,\n STACK_OF(CONF_VALUE) *nval);\nSTACK_OF(CONF_VALUE) *i2v_ASN1_BIT_STRING(X509V3_EXT_METHOD *method,\n ASN1_BIT_STRING *bits,\n STACK_OF(CONF_VALUE) *extlist);\nchar *i2s_ASN1_IA5STRING(X509V3_EXT_METHOD *method, ASN1_IA5STRING *ia5);\nASN1_IA5STRING *s2i_ASN1_IA5STRING(X509V3_EXT_METHOD *method,\n X509V3_CTX *ctx, const char *str);\n\nSTACK_OF(CONF_VALUE) *i2v_GENERAL_NAME(X509V3_EXT_METHOD *method,\n GENERAL_NAME *gen,\n STACK_OF(CONF_VALUE) *ret);\nint GENERAL_NAME_print(BIO *out, GENERAL_NAME *gen);\n\nDECLARE_ASN1_FUNCTIONS(GENERAL_NAMES)\n\nSTACK_OF(CONF_VALUE) *i2v_GENERAL_NAMES(X509V3_EXT_METHOD *method,\n GENERAL_NAMES *gen,\n STACK_OF(CONF_VALUE) *extlist);\nGENERAL_NAMES *v2i_GENERAL_NAMES(const X509V3_EXT_METHOD *method,\n X509V3_CTX *ctx, STACK_OF(CONF_VALUE) *nval);\n\nDECLARE_ASN1_FUNCTIONS(OTHERNAME)\nDECLARE_ASN1_FUNCTIONS(EDIPARTYNAME)\nint OTHERNAME_cmp(OTHERNAME *a, OTHERNAME *b);\nvoid GENERAL_NAME_set0_value(GENERAL_NAME *a, int type, void *value);\nvoid *GENERAL_NAME_get0_value(const GENERAL_NAME *a, int *ptype);\nint GENERAL_NAME_set0_othername(GENERAL_NAME *gen,\n ASN1_OBJECT *oid, ASN1_TYPE *value);\nint GENERAL_NAME_get0_otherName(const GENERAL_NAME *gen,\n ASN1_OBJECT **poid, ASN1_TYPE **pvalue);\n\nchar *i2s_ASN1_OCTET_STRING(X509V3_EXT_METHOD *method,\n const ASN1_OCTET_STRING *ia5);\nASN1_OCTET_STRING *s2i_ASN1_OCTET_STRING(X509V3_EXT_METHOD *method,\n X509V3_CTX *ctx, const char *str);\n\nDECLARE_ASN1_FUNCTIONS(EXTENDED_KEY_USAGE)\nint i2a_ACCESS_DESCRIPTION(BIO *bp, const ACCESS_DESCRIPTION *a);\n\nDECLARE_ASN1_ALLOC_FUNCTIONS(TLS_FEATURE)\n\nDECLARE_ASN1_FUNCTIONS(CERTIFICATEPOLICIES)\nDECLARE_ASN1_FUNCTIONS(POLICYINFO)\nDECLARE_ASN1_FUNCTIONS(POLICYQUALINFO)\nDECLARE_ASN1_FUNCTIONS(USERNOTICE)\nDECLARE_ASN1_FUNCTIONS(NOTICEREF)\n\nDECLARE_ASN1_FUNCTIONS(CRL_DIST_POINTS)\nDECLARE_ASN1_FUNCTIONS(DIST_POINT)\nDECLARE_ASN1_FUNCTIONS(DIST_POINT_NAME)\nDECLARE_ASN1_FUNCTIONS(ISSUING_DIST_POINT)\n\nint DIST_POINT_set_dpname(DIST_POINT_NAME *dpn, X509_NAME *iname);\n\nint NAME_CONSTRAINTS_check(X509 *x, NAME_CONSTRAINTS *nc);\nint NAME_CONSTRAINTS_check_CN(X509 *x, NAME_CONSTRAINTS *nc);\n\nDECLARE_ASN1_FUNCTIONS(ACCESS_DESCRIPTION)\nDECLARE_ASN1_FUNCTIONS(AUTHORITY_INFO_ACCESS)\n\nDECLARE_ASN1_ITEM(POLICY_MAPPING)\nDECLARE_ASN1_ALLOC_FUNCTIONS(POLICY_MAPPING)\nDECLARE_ASN1_ITEM(POLICY_MAPPINGS)\n\nDECLARE_ASN1_ITEM(GENERAL_SUBTREE)\nDECLARE_ASN1_ALLOC_FUNCTIONS(GENERAL_SUBTREE)\n\nDECLARE_ASN1_ITEM(NAME_CONSTRAINTS)\nDECLARE_ASN1_ALLOC_FUNCTIONS(NAME_CONSTRAINTS)\n\nDECLARE_ASN1_ALLOC_FUNCTIONS(POLICY_CONSTRAINTS)\nDECLARE_ASN1_ITEM(POLICY_CONSTRAINTS)\n\nGENERAL_NAME *a2i_GENERAL_NAME(GENERAL_NAME *out,\n const X509V3_EXT_METHOD *method,\n X509V3_CTX *ctx, int gen_type,\n const char *value, int is_nc);\n\n# ifdef HEADER_CONF_H\nGENERAL_NAME *v2i_GENERAL_NAME(const X509V3_EXT_METHOD *method,\n X509V3_CTX *ctx, CONF_VALUE *cnf);\nGENERAL_NAME *v2i_GENERAL_NAME_ex(GENERAL_NAME *out,\n const X509V3_EXT_METHOD *method,\n X509V3_CTX *ctx, CONF_VALUE *cnf,\n int is_nc);\nvoid X509V3_conf_free(CONF_VALUE *val);\n\nX509_EXTENSION *X509V3_EXT_nconf_nid(CONF *conf, X509V3_CTX *ctx, int ext_nid,\n const char *value);\nX509_EXTENSION *X509V3_EXT_nconf(CONF *conf, X509V3_CTX *ctx, const char *name,\n const char *value);\nint X509V3_EXT_add_nconf_sk(CONF *conf, X509V3_CTX *ctx, const char *section,\n STACK_OF(X509_EXTENSION) **sk);\nint X509V3_EXT_add_nconf(CONF *conf, X509V3_CTX *ctx, const char *section,\n X509 *cert);\nint X509V3_EXT_REQ_add_nconf(CONF *conf, X509V3_CTX *ctx, const char *section,\n X509_REQ *req);\nint X509V3_EXT_CRL_add_nconf(CONF *conf, X509V3_CTX *ctx, const char *section,\n X509_CRL *crl);\n\nX509_EXTENSION *X509V3_EXT_conf_nid(LHASH_OF(CONF_VALUE) *conf,\n X509V3_CTX *ctx, int ext_nid,\n const char *value);\nX509_EXTENSION *X509V3_EXT_conf(LHASH_OF(CONF_VALUE) *conf, X509V3_CTX *ctx,\n const char *name, const char *value);\nint X509V3_EXT_add_conf(LHASH_OF(CONF_VALUE) *conf, X509V3_CTX *ctx,\n const char *section, X509 *cert);\nint X509V3_EXT_REQ_add_conf(LHASH_OF(CONF_VALUE) *conf, X509V3_CTX *ctx,\n const char *section, X509_REQ *req);\nint X509V3_EXT_CRL_add_conf(LHASH_OF(CONF_VALUE) *conf, X509V3_CTX *ctx,\n const char *section, X509_CRL *crl);\n\nint X509V3_add_value_bool_nf(const char *name, int asn1_bool,\n STACK_OF(CONF_VALUE) **extlist);\nint X509V3_get_value_bool(const CONF_VALUE *value, int *asn1_bool);\nint X509V3_get_value_int(const CONF_VALUE *value, ASN1_INTEGER **aint);\nvoid X509V3_set_nconf(X509V3_CTX *ctx, CONF *conf);\nvoid X509V3_set_conf_lhash(X509V3_CTX *ctx, LHASH_OF(CONF_VALUE) *lhash);\n# endif\n\nchar *X509V3_get_string(X509V3_CTX *ctx, const char *name, const char *section);\nSTACK_OF(CONF_VALUE) *X509V3_get_section(X509V3_CTX *ctx, const char *section);\nvoid X509V3_string_free(X509V3_CTX *ctx, char *str);\nvoid X509V3_section_free(X509V3_CTX *ctx, STACK_OF(CONF_VALUE) *section);\nvoid X509V3_set_ctx(X509V3_CTX *ctx, X509 *issuer, X509 *subject,\n X509_REQ *req, X509_CRL *crl, int flags);\n\nint X509V3_add_value(const char *name, const char *value,\n STACK_OF(CONF_VALUE) **extlist);\nint X509V3_add_value_uchar(const char *name, const unsigned char *value,\n STACK_OF(CONF_VALUE) **extlist);\nint X509V3_add_value_bool(const char *name, int asn1_bool,\n STACK_OF(CONF_VALUE) **extlist);\nint X509V3_add_value_int(const char *name, const ASN1_INTEGER *aint,\n STACK_OF(CONF_VALUE) **extlist);\nchar *i2s_ASN1_INTEGER(X509V3_EXT_METHOD *meth, const ASN1_INTEGER *aint);\nASN1_INTEGER *s2i_ASN1_INTEGER(X509V3_EXT_METHOD *meth, const char *value);\nchar *i2s_ASN1_ENUMERATED(X509V3_EXT_METHOD *meth, const ASN1_ENUMERATED *aint);\nchar *i2s_ASN1_ENUMERATED_TABLE(X509V3_EXT_METHOD *meth,\n const ASN1_ENUMERATED *aint);\nint X509V3_EXT_add(X509V3_EXT_METHOD *ext);\nint X509V3_EXT_add_list(X509V3_EXT_METHOD *extlist);\nint X509V3_EXT_add_alias(int nid_to, int nid_from);\nvoid X509V3_EXT_cleanup(void);\n\nconst X509V3_EXT_METHOD *X509V3_EXT_get(X509_EXTENSION *ext);\nconst X509V3_EXT_METHOD *X509V3_EXT_get_nid(int nid);\nint X509V3_add_standard_extensions(void);\nSTACK_OF(CONF_VALUE) *X509V3_parse_list(const char *line);\nvoid *X509V3_EXT_d2i(X509_EXTENSION *ext);\nvoid *X509V3_get_d2i(const STACK_OF(X509_EXTENSION) *x, int nid, int *crit,\n int *idx);\n\nX509_EXTENSION *X509V3_EXT_i2d(int ext_nid, int crit, void *ext_struc);\nint X509V3_add1_i2d(STACK_OF(X509_EXTENSION) **x, int nid, void *value,\n int crit, unsigned long flags);\n\n#if OPENSSL_API_COMPAT < 0x10100000L\n/* The new declarations are in crypto.h, but the old ones were here. */\n# define hex_to_string OPENSSL_buf2hexstr\n# define string_to_hex OPENSSL_hexstr2buf\n#endif\n\nvoid X509V3_EXT_val_prn(BIO *out, STACK_OF(CONF_VALUE) *val, int indent,\n int ml);\nint X509V3_EXT_print(BIO *out, X509_EXTENSION *ext, unsigned long flag,\n int indent);\n#ifndef OPENSSL_NO_STDIO\nint X509V3_EXT_print_fp(FILE *out, X509_EXTENSION *ext, int flag, int indent);\n#endif\nint X509V3_extensions_print(BIO *out, const char *title,\n const STACK_OF(X509_EXTENSION) *exts,\n unsigned long flag, int indent);\n\nint X509_check_ca(X509 *x);\nint X509_check_purpose(X509 *x, int id, int ca);\nint X509_supported_extension(X509_EXTENSION *ex);\nint X509_PURPOSE_set(int *p, int purpose);\nint X509_check_issued(X509 *issuer, X509 *subject);\nint X509_check_akid(X509 *issuer, AUTHORITY_KEYID *akid);\nvoid X509_set_proxy_flag(X509 *x);\nvoid X509_set_proxy_pathlen(X509 *x, long l);\nlong X509_get_proxy_pathlen(X509 *x);\n\nuint32_t X509_get_extension_flags(X509 *x);\nuint32_t X509_get_key_usage(X509 *x);\nuint32_t X509_get_extended_key_usage(X509 *x);\nconst ASN1_OCTET_STRING *X509_get0_subject_key_id(X509 *x);\nconst ASN1_OCTET_STRING *X509_get0_authority_key_id(X509 *x);\nconst GENERAL_NAMES *X509_get0_authority_issuer(X509 *x);\nconst ASN1_INTEGER *X509_get0_authority_serial(X509 *x);\n\nint X509_PURPOSE_get_count(void);\nX509_PURPOSE *X509_PURPOSE_get0(int idx);\nint X509_PURPOSE_get_by_sname(const char *sname);\nint X509_PURPOSE_get_by_id(int id);\nint X509_PURPOSE_add(int id, int trust, int flags,\n int (*ck) (const X509_PURPOSE *, const X509 *, int),\n const char *name, const char *sname, void *arg);\nchar *X509_PURPOSE_get0_name(const X509_PURPOSE *xp);\nchar *X509_PURPOSE_get0_sname(const X509_PURPOSE *xp);\nint X509_PURPOSE_get_trust(const X509_PURPOSE *xp);\nvoid X509_PURPOSE_cleanup(void);\nint X509_PURPOSE_get_id(const X509_PURPOSE *);\n\nSTACK_OF(OPENSSL_STRING) *X509_get1_email(X509 *x);\nSTACK_OF(OPENSSL_STRING) *X509_REQ_get1_email(X509_REQ *x);\nvoid X509_email_free(STACK_OF(OPENSSL_STRING) *sk);\nSTACK_OF(OPENSSL_STRING) *X509_get1_ocsp(X509 *x);\n/* Flags for X509_check_* functions */\n\n/*\n * Always check subject name for host match even if subject alt names present\n */\n# define X509_CHECK_FLAG_ALWAYS_CHECK_SUBJECT 0x1\n/* Disable wildcard matching for dnsName fields and common name. */\n# define X509_CHECK_FLAG_NO_WILDCARDS 0x2\n/* Wildcards must not match a partial label. */\n# define X509_CHECK_FLAG_NO_PARTIAL_WILDCARDS 0x4\n/* Allow (non-partial) wildcards to match multiple labels. */\n# define X509_CHECK_FLAG_MULTI_LABEL_WILDCARDS 0x8\n/* Constraint verifier subdomain patterns to match a single labels. */\n# define X509_CHECK_FLAG_SINGLE_LABEL_SUBDOMAINS 0x10\n/* Never check the subject CN */\n# define X509_CHECK_FLAG_NEVER_CHECK_SUBJECT 0x20\n/*\n * Match reference identifiers starting with \".\" to any sub-domain.\n * This is a non-public flag, turned on implicitly when the subject\n * reference identity is a DNS name.\n */\n# define _X509_CHECK_FLAG_DOT_SUBDOMAINS 0x8000\n\nint X509_check_host(X509 *x, const char *chk, size_t chklen,\n unsigned int flags, char **peername);\nint X509_check_email(X509 *x, const char *chk, size_t chklen,\n unsigned int flags);\nint X509_check_ip(X509 *x, const unsigned char *chk, size_t chklen,\n unsigned int flags);\nint X509_check_ip_asc(X509 *x, const char *ipasc, unsigned int flags);\n\nASN1_OCTET_STRING *a2i_IPADDRESS(const char *ipasc);\nASN1_OCTET_STRING *a2i_IPADDRESS_NC(const char *ipasc);\nint X509V3_NAME_from_section(X509_NAME *nm, STACK_OF(CONF_VALUE) *dn_sk,\n unsigned long chtype);\n\nvoid X509_POLICY_NODE_print(BIO *out, X509_POLICY_NODE *node, int indent);\nDEFINE_STACK_OF(X509_POLICY_NODE)\n\n#ifndef OPENSSL_NO_RFC3779\ntypedef struct ASRange_st {\n ASN1_INTEGER *min, *max;\n} ASRange;\n\n# define ASIdOrRange_id 0\n# define ASIdOrRange_range 1\n\ntypedef struct ASIdOrRange_st {\n int type;\n union {\n ASN1_INTEGER *id;\n ASRange *range;\n } u;\n} ASIdOrRange;\n\ntypedef STACK_OF(ASIdOrRange) ASIdOrRanges;\nDEFINE_STACK_OF(ASIdOrRange)\n\n# define ASIdentifierChoice_inherit 0\n# define ASIdentifierChoice_asIdsOrRanges 1\n\ntypedef struct ASIdentifierChoice_st {\n int type;\n union {\n ASN1_NULL *inherit;\n ASIdOrRanges *asIdsOrRanges;\n } u;\n} ASIdentifierChoice;\n\ntypedef struct ASIdentifiers_st {\n ASIdentifierChoice *asnum, *rdi;\n} ASIdentifiers;\n\nDECLARE_ASN1_FUNCTIONS(ASRange)\nDECLARE_ASN1_FUNCTIONS(ASIdOrRange)\nDECLARE_ASN1_FUNCTIONS(ASIdentifierChoice)\nDECLARE_ASN1_FUNCTIONS(ASIdentifiers)\n\ntypedef struct IPAddressRange_st {\n ASN1_BIT_STRING *min, *max;\n} IPAddressRange;\n\n# define IPAddressOrRange_addressPrefix 0\n# define IPAddressOrRange_addressRange 1\n\ntypedef struct IPAddressOrRange_st {\n int type;\n union {\n ASN1_BIT_STRING *addressPrefix;\n IPAddressRange *addressRange;\n } u;\n} IPAddressOrRange;\n\ntypedef STACK_OF(IPAddressOrRange) IPAddressOrRanges;\nDEFINE_STACK_OF(IPAddressOrRange)\n\n# define IPAddressChoice_inherit 0\n# define IPAddressChoice_addressesOrRanges 1\n\ntypedef struct IPAddressChoice_st {\n int type;\n union {\n ASN1_NULL *inherit;\n IPAddressOrRanges *addressesOrRanges;\n } u;\n} IPAddressChoice;\n\ntypedef struct IPAddressFamily_st {\n ASN1_OCTET_STRING *addressFamily;\n IPAddressChoice *ipAddressChoice;\n} IPAddressFamily;\n\ntypedef STACK_OF(IPAddressFamily) IPAddrBlocks;\nDEFINE_STACK_OF(IPAddressFamily)\n\nDECLARE_ASN1_FUNCTIONS(IPAddressRange)\nDECLARE_ASN1_FUNCTIONS(IPAddressOrRange)\nDECLARE_ASN1_FUNCTIONS(IPAddressChoice)\nDECLARE_ASN1_FUNCTIONS(IPAddressFamily)\n\n/*\n * API tag for elements of the ASIdentifer SEQUENCE.\n */\n# define V3_ASID_ASNUM 0\n# define V3_ASID_RDI 1\n\n/*\n * AFI values, assigned by IANA. It'd be nice to make the AFI\n * handling code totally generic, but there are too many little things\n * that would need to be defined for other address families for it to\n * be worth the trouble.\n */\n# define IANA_AFI_IPV4 1\n# define IANA_AFI_IPV6 2\n\n/*\n * Utilities to construct and extract values from RFC3779 extensions,\n * since some of the encodings (particularly for IP address prefixes\n * and ranges) are a bit tedious to work with directly.\n */\nint X509v3_asid_add_inherit(ASIdentifiers *asid, int which);\nint X509v3_asid_add_id_or_range(ASIdentifiers *asid, int which,\n ASN1_INTEGER *min, ASN1_INTEGER *max);\nint X509v3_addr_add_inherit(IPAddrBlocks *addr,\n const unsigned afi, const unsigned *safi);\nint X509v3_addr_add_prefix(IPAddrBlocks *addr,\n const unsigned afi, const unsigned *safi,\n unsigned char *a, const int prefixlen);\nint X509v3_addr_add_range(IPAddrBlocks *addr,\n const unsigned afi, const unsigned *safi,\n unsigned char *min, unsigned char *max);\nunsigned X509v3_addr_get_afi(const IPAddressFamily *f);\nint X509v3_addr_get_range(IPAddressOrRange *aor, const unsigned afi,\n unsigned char *min, unsigned char *max,\n const int length);\n\n/*\n * Canonical forms.\n */\nint X509v3_asid_is_canonical(ASIdentifiers *asid);\nint X509v3_addr_is_canonical(IPAddrBlocks *addr);\nint X509v3_asid_canonize(ASIdentifiers *asid);\nint X509v3_addr_canonize(IPAddrBlocks *addr);\n\n/*\n * Tests for inheritance and containment.\n */\nint X509v3_asid_inherits(ASIdentifiers *asid);\nint X509v3_addr_inherits(IPAddrBlocks *addr);\nint X509v3_asid_subset(ASIdentifiers *a, ASIdentifiers *b);\nint X509v3_addr_subset(IPAddrBlocks *a, IPAddrBlocks *b);\n\n/*\n * Check whether RFC 3779 extensions nest properly in chains.\n */\nint X509v3_asid_validate_path(X509_STORE_CTX *);\nint X509v3_addr_validate_path(X509_STORE_CTX *);\nint X509v3_asid_validate_resource_set(STACK_OF(X509) *chain,\n ASIdentifiers *ext,\n int allow_inheritance);\nint X509v3_addr_validate_resource_set(STACK_OF(X509) *chain,\n IPAddrBlocks *ext, int allow_inheritance);\n\n#endif /* OPENSSL_NO_RFC3779 */\n\nDEFINE_STACK_OF(ASN1_STRING)\n\n/*\n * Admission Syntax\n */\ntypedef struct NamingAuthority_st NAMING_AUTHORITY;\ntypedef struct ProfessionInfo_st PROFESSION_INFO;\ntypedef struct Admissions_st ADMISSIONS;\ntypedef struct AdmissionSyntax_st ADMISSION_SYNTAX;\nDECLARE_ASN1_FUNCTIONS(NAMING_AUTHORITY)\nDECLARE_ASN1_FUNCTIONS(PROFESSION_INFO)\nDECLARE_ASN1_FUNCTIONS(ADMISSIONS)\nDECLARE_ASN1_FUNCTIONS(ADMISSION_SYNTAX)\nDEFINE_STACK_OF(ADMISSIONS)\nDEFINE_STACK_OF(PROFESSION_INFO)\ntypedef STACK_OF(PROFESSION_INFO) PROFESSION_INFOS;\n\nconst ASN1_OBJECT *NAMING_AUTHORITY_get0_authorityId(\n const NAMING_AUTHORITY *n);\nconst ASN1_IA5STRING *NAMING_AUTHORITY_get0_authorityURL(\n const NAMING_AUTHORITY *n);\nconst ASN1_STRING *NAMING_AUTHORITY_get0_authorityText(\n const NAMING_AUTHORITY *n);\nvoid NAMING_AUTHORITY_set0_authorityId(NAMING_AUTHORITY *n,\n ASN1_OBJECT* namingAuthorityId);\nvoid NAMING_AUTHORITY_set0_authorityURL(NAMING_AUTHORITY *n,\n ASN1_IA5STRING* namingAuthorityUrl);\nvoid NAMING_AUTHORITY_set0_authorityText(NAMING_AUTHORITY *n,\n ASN1_STRING* namingAuthorityText);\n\nconst GENERAL_NAME *ADMISSION_SYNTAX_get0_admissionAuthority(\n const ADMISSION_SYNTAX *as);\nvoid ADMISSION_SYNTAX_set0_admissionAuthority(\n ADMISSION_SYNTAX *as, GENERAL_NAME *aa);\nconst STACK_OF(ADMISSIONS) *ADMISSION_SYNTAX_get0_contentsOfAdmissions(\n const ADMISSION_SYNTAX *as);\nvoid ADMISSION_SYNTAX_set0_contentsOfAdmissions(\n ADMISSION_SYNTAX *as, STACK_OF(ADMISSIONS) *a);\nconst GENERAL_NAME *ADMISSIONS_get0_admissionAuthority(const ADMISSIONS *a);\nvoid ADMISSIONS_set0_admissionAuthority(ADMISSIONS *a, GENERAL_NAME *aa);\nconst NAMING_AUTHORITY *ADMISSIONS_get0_namingAuthority(const ADMISSIONS *a);\nvoid ADMISSIONS_set0_namingAuthority(ADMISSIONS *a, NAMING_AUTHORITY *na);\nconst PROFESSION_INFOS *ADMISSIONS_get0_professionInfos(const ADMISSIONS *a);\nvoid ADMISSIONS_set0_professionInfos(ADMISSIONS *a, PROFESSION_INFOS *pi);\nconst ASN1_OCTET_STRING *PROFESSION_INFO_get0_addProfessionInfo(\n const PROFESSION_INFO *pi);\nvoid PROFESSION_INFO_set0_addProfessionInfo(\n PROFESSION_INFO *pi, ASN1_OCTET_STRING *aos);\nconst NAMING_AUTHORITY *PROFESSION_INFO_get0_namingAuthority(\n const PROFESSION_INFO *pi);\nvoid PROFESSION_INFO_set0_namingAuthority(\n PROFESSION_INFO *pi, NAMING_AUTHORITY *na);\nconst STACK_OF(ASN1_STRING) *PROFESSION_INFO_get0_professionItems(\n const PROFESSION_INFO *pi);\nvoid PROFESSION_INFO_set0_professionItems(\n PROFESSION_INFO *pi, STACK_OF(ASN1_STRING) *as);\nconst STACK_OF(ASN1_OBJECT) *PROFESSION_INFO_get0_professionOIDs(\n const PROFESSION_INFO *pi);\nvoid PROFESSION_INFO_set0_professionOIDs(\n PROFESSION_INFO *pi, STACK_OF(ASN1_OBJECT) *po);\nconst ASN1_PRINTABLESTRING *PROFESSION_INFO_get0_registrationNumber(\n const PROFESSION_INFO *pi);\nvoid PROFESSION_INFO_set0_registrationNumber(\n PROFESSION_INFO *pi, ASN1_PRINTABLESTRING *rn);\n\n# ifdef __cplusplus\n}\n# endif\n#endif\n" }, { "path": "cryptomini/include/openssl/x509v3err.h", "content": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2021 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#ifndef HEADER_X509V3ERR_H\n# define HEADER_X509V3ERR_H\n\n# ifndef HEADER_SYMHACKS_H\n# include \n# endif\n\n# ifdef __cplusplus\nextern \"C\"\n# endif\nint ERR_load_X509V3_strings(void);\n\n/*\n * X509V3 function codes.\n */\n# define X509V3_F_A2I_GENERAL_NAME 164\n# define X509V3_F_ADDR_VALIDATE_PATH_INTERNAL 166\n# define X509V3_F_ASIDENTIFIERCHOICE_CANONIZE 161\n# define X509V3_F_ASIDENTIFIERCHOICE_IS_CANONICAL 162\n# define X509V3_F_BIGNUM_TO_STRING 167\n# define X509V3_F_COPY_EMAIL 122\n# define X509V3_F_COPY_ISSUER 123\n# define X509V3_F_DO_DIRNAME 144\n# define X509V3_F_DO_EXT_I2D 135\n# define X509V3_F_DO_EXT_NCONF 151\n# define X509V3_F_GNAMES_FROM_SECTNAME 156\n# define X509V3_F_I2S_ASN1_ENUMERATED 121\n# define X509V3_F_I2S_ASN1_IA5STRING 149\n# define X509V3_F_I2S_ASN1_INTEGER 120\n# define X509V3_F_I2V_AUTHORITY_INFO_ACCESS 138\n# define X509V3_F_I2V_AUTHORITY_KEYID 173\n# define X509V3_F_LEVEL_ADD_NODE 168\n# define X509V3_F_NOTICE_SECTION 132\n# define X509V3_F_NREF_NOS 133\n# define X509V3_F_POLICY_CACHE_CREATE 169\n# define X509V3_F_POLICY_CACHE_NEW 170\n# define X509V3_F_POLICY_DATA_NEW 171\n# define X509V3_F_POLICY_SECTION 131\n# define X509V3_F_PROCESS_PCI_VALUE 150\n# define X509V3_F_R2I_CERTPOL 130\n# define X509V3_F_R2I_PCI 155\n# define X509V3_F_S2I_ASN1_IA5STRING 100\n# define X509V3_F_S2I_ASN1_INTEGER 108\n# define X509V3_F_S2I_ASN1_OCTET_STRING 112\n# define X509V3_F_S2I_SKEY_ID 115\n# define X509V3_F_SET_DIST_POINT_NAME 158\n# define X509V3_F_SXNET_ADD_ID_ASC 125\n# define X509V3_F_SXNET_ADD_ID_INTEGER 126\n# define X509V3_F_SXNET_ADD_ID_ULONG 127\n# define X509V3_F_SXNET_GET_ID_ASC 128\n# define X509V3_F_SXNET_GET_ID_ULONG 129\n# define X509V3_F_TREE_INIT 172\n# define X509V3_F_V2I_ASIDENTIFIERS 163\n# define X509V3_F_V2I_ASN1_BIT_STRING 101\n# define X509V3_F_V2I_AUTHORITY_INFO_ACCESS 139\n# define X509V3_F_V2I_AUTHORITY_KEYID 119\n# define X509V3_F_V2I_BASIC_CONSTRAINTS 102\n# define X509V3_F_V2I_CRLD 134\n# define X509V3_F_V2I_EXTENDED_KEY_USAGE 103\n# define X509V3_F_V2I_GENERAL_NAMES 118\n# define X509V3_F_V2I_GENERAL_NAME_EX 117\n# define X509V3_F_V2I_IDP 157\n# define X509V3_F_V2I_IPADDRBLOCKS 159\n# define X509V3_F_V2I_ISSUER_ALT 153\n# define X509V3_F_V2I_NAME_CONSTRAINTS 147\n# define X509V3_F_V2I_POLICY_CONSTRAINTS 146\n# define X509V3_F_V2I_POLICY_MAPPINGS 145\n# define X509V3_F_V2I_SUBJECT_ALT 154\n# define X509V3_F_V2I_TLS_FEATURE 165\n# define X509V3_F_V3_GENERIC_EXTENSION 116\n# define X509V3_F_X509V3_ADD1_I2D 140\n# define X509V3_F_X509V3_ADD_LEN_VALUE 174\n# define X509V3_F_X509V3_ADD_VALUE 105\n# define X509V3_F_X509V3_EXT_ADD 104\n# define X509V3_F_X509V3_EXT_ADD_ALIAS 106\n# define X509V3_F_X509V3_EXT_I2D 136\n# define X509V3_F_X509V3_EXT_NCONF 152\n# define X509V3_F_X509V3_GET_SECTION 142\n# define X509V3_F_X509V3_GET_STRING 143\n# define X509V3_F_X509V3_GET_VALUE_BOOL 110\n# define X509V3_F_X509V3_PARSE_LIST 109\n# define X509V3_F_X509_PURPOSE_ADD 137\n# define X509V3_F_X509_PURPOSE_SET 141\n\n/*\n * X509V3 reason codes.\n */\n# define X509V3_R_BAD_IP_ADDRESS 118\n# define X509V3_R_BAD_OBJECT 119\n# define X509V3_R_BN_DEC2BN_ERROR 100\n# define X509V3_R_BN_TO_ASN1_INTEGER_ERROR 101\n# define X509V3_R_DIRNAME_ERROR 149\n# define X509V3_R_DISTPOINT_ALREADY_SET 160\n# define X509V3_R_DUPLICATE_ZONE_ID 133\n# define X509V3_R_ERROR_CONVERTING_ZONE 131\n# define X509V3_R_ERROR_CREATING_EXTENSION 144\n# define X509V3_R_ERROR_IN_EXTENSION 128\n# define X509V3_R_EXPECTED_A_SECTION_NAME 137\n# define X509V3_R_EXTENSION_EXISTS 145\n# define X509V3_R_EXTENSION_NAME_ERROR 115\n# define X509V3_R_EXTENSION_NOT_FOUND 102\n# define X509V3_R_EXTENSION_SETTING_NOT_SUPPORTED 103\n# define X509V3_R_EXTENSION_VALUE_ERROR 116\n# define X509V3_R_ILLEGAL_EMPTY_EXTENSION 151\n# define X509V3_R_INCORRECT_POLICY_SYNTAX_TAG 152\n# define X509V3_R_INVALID_ASNUMBER 162\n# define X509V3_R_INVALID_ASRANGE 163\n# define X509V3_R_INVALID_BOOLEAN_STRING 104\n# define X509V3_R_INVALID_EXTENSION_STRING 105\n# define X509V3_R_INVALID_INHERITANCE 165\n# define X509V3_R_INVALID_IPADDRESS 166\n# define X509V3_R_INVALID_MULTIPLE_RDNS 161\n# define X509V3_R_INVALID_NAME 106\n# define X509V3_R_INVALID_NULL_ARGUMENT 107\n# define X509V3_R_INVALID_NULL_NAME 108\n# define X509V3_R_INVALID_NULL_VALUE 109\n# define X509V3_R_INVALID_NUMBER 140\n# define X509V3_R_INVALID_NUMBERS 141\n# define X509V3_R_INVALID_OBJECT_IDENTIFIER 110\n# define X509V3_R_INVALID_OPTION 138\n# define X509V3_R_INVALID_POLICY_IDENTIFIER 134\n# define X509V3_R_INVALID_PROXY_POLICY_SETTING 153\n# define X509V3_R_INVALID_PURPOSE 146\n# define X509V3_R_INVALID_SAFI 164\n# define X509V3_R_INVALID_SECTION 135\n# define X509V3_R_INVALID_SYNTAX 143\n# define X509V3_R_ISSUER_DECODE_ERROR 126\n# define X509V3_R_MISSING_VALUE 124\n# define X509V3_R_NEED_ORGANIZATION_AND_NUMBERS 142\n# define X509V3_R_NO_CONFIG_DATABASE 136\n# define X509V3_R_NO_ISSUER_CERTIFICATE 121\n# define X509V3_R_NO_ISSUER_DETAILS 127\n# define X509V3_R_NO_POLICY_IDENTIFIER 139\n# define X509V3_R_NO_PROXY_CERT_POLICY_LANGUAGE_DEFINED 154\n# define X509V3_R_NO_PUBLIC_KEY 114\n# define X509V3_R_NO_SUBJECT_DETAILS 125\n# define X509V3_R_OPERATION_NOT_DEFINED 148\n# define X509V3_R_OTHERNAME_ERROR 147\n# define X509V3_R_POLICY_LANGUAGE_ALREADY_DEFINED 155\n# define X509V3_R_POLICY_PATH_LENGTH 156\n# define X509V3_R_POLICY_PATH_LENGTH_ALREADY_DEFINED 157\n# define X509V3_R_POLICY_WHEN_PROXY_LANGUAGE_REQUIRES_NO_POLICY 159\n# define X509V3_R_SECTION_NOT_FOUND 150\n# define X509V3_R_UNABLE_TO_GET_ISSUER_DETAILS 122\n# define X509V3_R_UNABLE_TO_GET_ISSUER_KEYID 123\n# define X509V3_R_UNKNOWN_BIT_STRING_ARGUMENT 111\n# define X509V3_R_UNKNOWN_EXTENSION 129\n# define X509V3_R_UNKNOWN_EXTENSION_NAME 130\n# define X509V3_R_UNKNOWN_OPTION 120\n# define X509V3_R_UNSUPPORTED_OPTION 117\n# define X509V3_R_UNSUPPORTED_TYPE 167\n# define X509V3_R_USER_TOO_LONG 132\n\n#endif\n" }, { "path": "cryptomini/intercept/err.c", "content": "\n\nvoid ERR_put_error(int lib, int func, int reason, const char *file, int line) {\n\t\n\n}\n\nint ERR_set_mark(void) {\n return 1;\n}\n\nint ERR_pop_to_mark(void) {\n return 1;\n}\n" }, { "path": "cryptomini/intercept/intercept.c", "content": "\n#include \n#include \n\n\n// void *malloc(size_t size);\n// void free(void *ptr);\n\n// void *sbi_malloc(size_t size);\n// void sbi_free(void *ptr);\n\n// void *sbi_memset(void *s, int c, size_t count);\n\n\n// void *malloc(size_t size)\n// {\n// return sbi_malloc(size);\n// }\n\n// void free(void *ptr)\n// {\n// sbi_free(ptr);\n// }\n\n\n// void *memset(void *s, int c, size_t count)\n// {\n// return sbi_memset(s, c, count);\n// }" }, { "path": "cryptomini/intercept/rand.c", "content": "\n#include \n#include \n#include \n// #include \n// #include \n\ninline uint64_t rdtsc()\n{\n uint32_t hi, lo;\n __asm__ __volatile__ (\"rdtsc\" : \"=a\"(lo), \"=d\"(hi));\n return ( (uint64_t)lo)|( ((uint64_t)hi)<<32 );\n}\n\nuint64_t platform_random(){\n #pragma message(\"Platform has no entropy source, this is unsafe. TEST ONLY\")\n static uint64_t w = 0, s = 0xb5ad4eceda1ce2a9;\n\n unsigned long cycles;\n #ifdef RISC_V\n asm volatile (\"rdcycle %0\" : \"=r\" (cycles));\n #else\n cycles = rdtsc();\n #endif\n \n\n // from Middle Square Weyl Sequence algorithm\n uint64_t x = cycles;\n x *= x;\n x += (w += s);\n return (x>>32) | (x<<32);\n}\n\nvoid *crypto_memcpy(void *dest, const void *src, size_t count)\n{\n\tchar *temp1\t = dest;\n\tconst char *temp2 = src;\n\n\twhile (count > 0) {\n\t\t*temp1++ = *temp2++;\n\t\tcount--;\n\t}\n\treturn dest;\n}\n\n\n\n// uint64_t rand64() {\n// static uint64_t w = 0, s = 0xb5ad4eceda1ce2a9;\n\n// uint64_t cycles = rdtsc();\n\n// // from Middle Square Weyl Sequence algorithm\n// uint64_t x = cycles;\n// x *= x;\n// x += (w += s);\n// uint64_t rnd = (x>>32) | (x<<32);\n// // printf(\"\\n0x%lx\\n\", rnd);\n// // return rnd;\n// return (x>>32) | (x<<32);\n// }\n\nint RAND_bytes(unsigned char *buf, int num)\n{\n unsigned char *temp = buf;\n while (num-8 >= 0){\n *(uint64_t*)temp = platform_random();\n temp+=8;\n num -= 8;\n }\n if (num > 0)\n {\n uint64_t rand = platform_random();\n crypto_memcpy(temp, &rand, num);\n }\n return 1;\n}\n\n\nint RAND_priv_bytes(unsigned char *buf, int num)\n{\n return RAND_bytes(buf, num);\n}\n// int main() {\n// unsigned char array[100];\n// for (size_t i = 0; i < 100; i++)\n// {\n// array[i] = 0;\n// }\n \n// RAND_bytes(array, 39);\n// for (size_t i = 0; i < 50; i++)\n// {\n// printf(\"%x \", array[i]);\n// }\n\n// }\n" }, { "path": "cryptomini/makefile", "content": "#CC = /usr/bin/gcc\n#CC = /usr/bin/riscv64-linux-gnu-gcc\n\nCC = /opt/riscv/bin/riscv64-unknown-linux-gnu-gcc\nAR = /opt/riscv/bin/riscv64-unknown-linux-gnu-ar\n\n# CC = /opt/riscv/bin/riscv64-unknown-elf-gcc\n# AR = /opt/riscv/bin/riscv64-unknown-elf-ar\n\n#CC = riscv64-linux-gnu-gcc\n#AR = riscv64-linux-gnu-ar\n\nCCFLAGS = -c -ffunction-sections -fdata-sections \\\n\t-Wall -Werror -ffreestanding -fno-stack-protector -fno-strict-aliasing \\\n\t-O3 -g0 -fno-omit-frame-pointer -fno-optimize-sibling-calls\t\\\n\t-mstrict-align -mno-save-restore -mabi=lp64\t-march=rv64imafdc_zicsr_zifencei -mcmodel=medany \\\n\t-fno-pie -no-pie\t\\\n\t-mabi=lp64d\t\t\t\\\n\t-DRISC_V -DNDEBUG\t\t\\\n\t-DOPENSSL_NO_STDIO\t\t\\\n\t-I. -Iinclude\t\n\n# -nostdlib \\\n# -I. -Iinclude\t\\\n# -lc -lgloss -lgcc -Wl,--start-group -lc -lgloss -Wl,--end-group -lgcc\n\n# LNFLAGS = -static -Wl,-gc-sections\n\n\n\nSRC_DIR := .\nSUB_SRC_DIR_AES := ./aes\nSUB_SRC_DIR_BN := ./bn\nSUB_SRC_DIR_CAMELLIA := ./camellia\nSUB_SRC_DIR_EC := ./ec\nSUB_SRC_DIR_SHA := ./sha\nSUB_SRC_DIR_INTERCEPT := ./intercept\n\nBUILD_DIR := ./build\n\nSRCS := $(wildcard $(SRC_DIR)/*.c $(SUB_SRC_DIR)/*.c)\nOBJS += $(addprefix $(BUILD_DIR)/,$(patsubst %.c,%.o,$(notdir \\\n\t\t\t$(wildcard $(SRC_DIR)/*.c $(SUB_SRC_DIR_AES)/*.c $(SUB_SRC_DIR_BN)/*.c \\\n\t\t\t$(SUB_SRC_DIR_EC)/*.c $(SUB_SRC_DIR_SHA)/*.c $(SUB_SRC_DIR_INTERCEPT)/*.c $(SUB_SRC_DIR_CAMELLIA)/*.c))))\n\nlibcryptomini.a: $(OBJS)\n\t$(AR) crs $@ $^\n\n$(BUILD_DIR)/%.o:$(SRC_DIR)/%.c\n\t$(CC) $(CCFLAGS) -o $@ $^\n\n$(BUILD_DIR)/%.o:$(SUB_SRC_DIR_AES)/%.c\n\t$(CC) $(CCFLAGS) -o $@ $^\n\n$(BUILD_DIR)/%.o:$(SUB_SRC_DIR_BN)/%.c\n\t$(CC) $(CCFLAGS) -o $@ $^\n\n$(BUILD_DIR)/%.o:$(SUB_SRC_DIR_EC)/%.c\n\t$(CC) $(CCFLAGS) -o $@ $^\n\n$(BUILD_DIR)/%.o:$(SUB_SRC_DIR_SHA)/%.c\n\t$(CC) $(CCFLAGS) -o $@ $^\n\n$(BUILD_DIR)/%.o:$(SUB_SRC_DIR_INTERCEPT)/%.c\n\t$(CC) $(CCFLAGS) -o $@ $^\n\n$(BUILD_DIR)/%.o:$(SUB_SRC_DIR_CAMELLIA)/%.c\n\t$(CC) $(CCFLAGS) -o $@ $^\n\n.PHONY: clean\nclean:\n\trm -f libcryptomini.a $(OBJS)\n" }, { "path": "cryptomini/mem.c", "content": "/*\n * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \"e_os.h\"\n#include \"internal/cryptlib.h\"\n#include \"crypto/cryptlib.h\"\n#include \n#include \n#include \n#include \n#include \"intercept/intercept.h\"\n#ifndef OPENSSL_NO_CRYPTO_MDEBUG_BACKTRACE\n# include \n#endif\n\n/*\n * the following pointers may be changed as long as 'allow_customize' is set\n */\nstatic int allow_customize = 1;\n\nstatic void *(*malloc_impl)(size_t, const char *, int)\n = CRYPTO_malloc;\n// static void *(*realloc_impl)(void *, size_t, const char *, int)\n// = CRYPTO_realloc;\nstatic void (*free_impl)(void *, const char *, int)\n = CRYPTO_free;\n\n#ifndef OPENSSL_NO_CRYPTO_MDEBUG\n# include \"internal/tsan_assist.h\"\n\nstatic TSAN_QUALIFIER int malloc_count;\nstatic TSAN_QUALIFIER int realloc_count;\nstatic TSAN_QUALIFIER int free_count;\n\n# define INCREMENT(x) tsan_counter(&(x))\n\nstatic char *md_failstring;\nstatic long md_count;\nstatic int md_fail_percent = 0;\nstatic int md_tracefd = -1;\nstatic int call_malloc_debug = 1;\n\nstatic void parseit(void);\nstatic int shouldfail(void);\n\n# define FAILTEST() if (shouldfail()) return NULL\n\n#else\nstatic int call_malloc_debug = 0;\n\n# define INCREMENT(x) /* empty */\n# define FAILTEST() /* empty */\n#endif\n\nint CRYPTO_set_mem_functions(\n void *(*m)(size_t, const char *, int),\n void *(*r)(void *, size_t, const char *, int),\n void (*f)(void *, const char *, int))\n{\n if (!allow_customize)\n return 0;\n if (m)\n malloc_impl = m;\n // if (r)\n // realloc_impl = r;\n if (f)\n free_impl = f;\n return 1;\n}\n\nint CRYPTO_set_mem_debug(int flag)\n{\n if (!allow_customize)\n return 0;\n call_malloc_debug = flag;\n return 1;\n}\n\nvoid CRYPTO_get_mem_functions(\n void *(**m)(size_t, const char *, int),\n void *(**r)(void *, size_t, const char *, int),\n void (**f)(void *, const char *, int))\n{\n if (m != NULL)\n *m = malloc_impl;\n // if (r != NULL)\n // *r = realloc_impl;\n if (f != NULL)\n *f = free_impl;\n}\n\n#ifndef OPENSSL_NO_CRYPTO_MDEBUG\nvoid CRYPTO_get_alloc_counts(int *mcount, int *rcount, int *fcount)\n{\n if (mcount != NULL)\n *mcount = tsan_load(&malloc_count);\n if (rcount != NULL)\n *rcount = tsan_load(&realloc_count);\n if (fcount != NULL)\n *fcount = tsan_load(&free_count);\n}\n\n/*\n * Parse a \"malloc failure spec\" string. This likes like a set of fields\n * separated by semicolons. Each field has a count and an optional failure\n * percentage. For example:\n * 100@0;100@25;0@0\n * or 100;100@25;0\n * This means 100 mallocs succeed, then next 100 fail 25% of the time, and\n * all remaining (count is zero) succeed.\n */\nstatic void parseit(void)\n{\n char *semi = strchr(md_failstring, ';');\n char *atsign;\n\n if (semi != NULL)\n *semi++ = '\\0';\n\n /* Get the count (atol will stop at the @ if there), and percentage */\n md_count = atol(md_failstring);\n atsign = strchr(md_failstring, '@');\n md_fail_percent = atsign == NULL ? 0 : atoi(atsign + 1);\n\n if (semi != NULL)\n md_failstring = semi;\n}\n\n/*\n * Windows doesn't have random(), but it has rand()\n * Some rand() implementations aren't good, but we're not\n * dealing with secure randomness here.\n */\n# ifdef _WIN32\n# define random() rand()\n# endif\n/*\n * See if the current malloc should fail.\n */\nstatic int shouldfail(void)\n{\n int roll = (int)(random() % 100);\n int shoulditfail = roll < md_fail_percent;\n# ifndef _WIN32\n/* suppressed on Windows as POSIX-like file descriptors are non-inheritable */\n int len;\n char buff[80];\n\n if (md_tracefd > 0) {\n BIO_snprintf(buff, sizeof(buff),\n \"%c C%ld %%%d R%d\\n\",\n shoulditfail ? '-' : '+', md_count, md_fail_percent, roll);\n len = strlen(buff);\n if (write(md_tracefd, buff, len) != len)\n perror(\"shouldfail write failed\");\n# ifndef OPENSSL_NO_CRYPTO_MDEBUG_BACKTRACE\n if (shoulditfail) {\n void *addrs[30];\n int num = backtrace(addrs, OSSL_NELEM(addrs));\n\n backtrace_symbols_fd(addrs, num, md_tracefd);\n }\n# endif\n }\n# endif\n\n if (md_count) {\n /* If we used up this one, go to the next. */\n if (--md_count == 0)\n parseit();\n }\n\n return shoulditfail;\n}\n\nvoid ossl_malloc_setup_failures(void)\n{\n const char *cp = getenv(\"OPENSSL_MALLOC_FAILURES\");\n\n if (cp != NULL && (md_failstring = strdup(cp)) != NULL)\n parseit();\n if ((cp = getenv(\"OPENSSL_MALLOC_FD\")) != NULL)\n md_tracefd = atoi(cp);\n}\n#endif\n\nvoid *CRYPTO_malloc(size_t num, const char *file, int line)\n{\n void *ret = NULL;\n\n INCREMENT(malloc_count);\n if (malloc_impl != NULL && malloc_impl != CRYPTO_malloc)\n return malloc_impl(num, file, line);\n\n if (num == 0)\n return NULL;\n\n FAILTEST();\n if (allow_customize) {\n /*\n * Disallow customization after the first allocation. We only set this\n * if necessary to avoid a store to the same cache line on every\n * allocation.\n */\n allow_customize = 0;\n }\n#ifndef OPENSSL_NO_CRYPTO_MDEBUG\n if (call_malloc_debug) {\n CRYPTO_mem_debug_malloc(NULL, num, 0, file, line);\n ret = malloc(num);\n CRYPTO_mem_debug_malloc(ret, num, 1, file, line);\n } else {\n ret = malloc(num);\n }\n#else\n (void)(file); (void)(line);\n ret = malloc(num);\n#endif\n\n return ret;\n}\n\nvoid *CRYPTO_zalloc(size_t num, const char *file, int line)\n{\n void *ret = CRYPTO_malloc(num, file, line);\n\n FAILTEST();\n if (ret != NULL)\n memset(ret, 0, num);\n return ret;\n}\n\n// void *CRYPTO_realloc(void *str, size_t num, const char *file, int line)\n// {\n// INCREMENT(realloc_count);\n// if (realloc_impl != NULL && realloc_impl != &CRYPTO_realloc)\n// return realloc_impl(str, num, file, line);\n\n// FAILTEST();\n// if (str == NULL)\n// return CRYPTO_malloc(num, file, line);\n\n// if (num == 0) {\n// CRYPTO_free(str, file, line);\n// return NULL;\n// }\n\n// #ifndef OPENSSL_NO_CRYPTO_MDEBUG\n// if (call_malloc_debug) {\n// void *ret;\n// CRYPTO_mem_debug_realloc(str, NULL, num, 0, file, line);\n// ret = realloc(str, num);\n// CRYPTO_mem_debug_realloc(str, ret, num, 1, file, line);\n// return ret;\n// }\n// #else\n// (void)(file); (void)(line);\n// #endif\n// return realloc(str, num);\n\n// }\n\nvoid *CRYPTO_clear_realloc(void *str, size_t old_len, size_t num,\n const char *file, int line)\n{\n void *ret = NULL;\n\n if (str == NULL)\n return CRYPTO_malloc(num, file, line);\n\n if (num == 0) {\n CRYPTO_clear_free(str, old_len, file, line);\n return NULL;\n }\n\n /* Can't shrink the buffer since memcpy below copies |old_len| bytes. */\n if (num < old_len) {\n OPENSSL_cleanse((char*)str + num, old_len - num);\n return str;\n }\n\n ret = CRYPTO_malloc(num, file, line);\n if (ret != NULL) {\n memcpy(ret, str, old_len);\n CRYPTO_clear_free(str, old_len, file, line);\n }\n return ret;\n}\n\nvoid CRYPTO_free(void *str, const char *file, int line)\n{\n INCREMENT(free_count);\n if (free_impl != NULL && free_impl != &CRYPTO_free) {\n free_impl(str, file, line);\n return;\n }\n\n#ifndef OPENSSL_NO_CRYPTO_MDEBUG\n if (call_malloc_debug) {\n CRYPTO_mem_debug_free(str, 0, file, line);\n free(str);\n CRYPTO_mem_debug_free(str, 1, file, line);\n } else {\n free(str);\n }\n#else\n free(str);\n#endif\n}\n\nvoid CRYPTO_clear_free(void *str, size_t num, const char *file, int line)\n{\n if (str == NULL)\n return;\n if (num)\n OPENSSL_cleanse(str, num);\n CRYPTO_free(str, file, line);\n}\n" }, { "path": "cryptomini/mem_clr.c", "content": "/*\n * Copyright 2002-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \n\n/*\n * Pointer to memset is volatile so that compiler must de-reference\n * the pointer and can't assume that it points to any function in\n * particular (such as memset, which it then might further \"optimize\")\n */\ntypedef void *(*memset_t)(void *, int, size_t);\n\nstatic volatile memset_t memset_func = memset;\n\nvoid OPENSSL_cleanse(void *ptr, size_t len)\n{\n memset_func(ptr, 0, len);\n}\n\n// void *sbi_memset(void *s, int c, size_t count);\n// void OPENSSL_cleanse(void *ptr, size_t len)\n// {\n// sbi_memset(ptr, 0, len);\n// }\n\n" }, { "path": "cryptomini/mem_sec.c", "content": "/*\n * Copyright 2015-2020 The OpenSSL Project Authors. All Rights Reserved.\n * Copyright 2004-2014, Akamai Technologies. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n/*\n * This file is in two halves. The first half implements the public API\n * to be used by external consumers, and to be used by OpenSSL to store\n * data in a \"secure arena.\" The second half implements the secure arena.\n * For details on that implementation, see below (look for uppercase\n * \"SECURE HEAP IMPLEMENTATION\").\n */\n#include \"e_os.h\"\n#include \n\n#include \n\n/* e_os.h defines OPENSSL_SECURE_MEMORY if secure memory can be implemented */\n#undef OPENSSL_SECURE_MEMORY\n#ifdef OPENSSL_SECURE_MEMORY\n# include \n# include \n# include \n# include \n# include \n# if defined(OPENSSL_SYS_LINUX)\n# include \n# if defined(SYS_mlock2)\n# include \n# include \n# endif\n# endif\n# if defined(__FreeBSD__)\n# define MADV_DONTDUMP MADV_NOCORE\n# endif\n# if !defined(MAP_CONCEAL)\n# define MAP_CONCEAL 0\n# endif\n# include \n# include \n# include \n#endif\n\n#define CLEAR(p, s) OPENSSL_cleanse(p, s)\n#ifndef PAGE_SIZE\n# define PAGE_SIZE 4096\n#endif\n#if !defined(MAP_ANON) && defined(MAP_ANONYMOUS)\n# define MAP_ANON MAP_ANONYMOUS\n#endif\n\n#ifdef OPENSSL_SECURE_MEMORY\nstatic size_t secure_mem_used;\n\nstatic int secure_mem_initialized;\n\nstatic CRYPTO_RWLOCK *sec_malloc_lock = NULL;\n\n/*\n * These are the functions that must be implemented by a secure heap (sh).\n */\nstatic int sh_init(size_t size, int minsize);\nstatic void *sh_malloc(size_t size);\nstatic void sh_free(void *ptr);\nstatic void sh_done(void);\nstatic size_t sh_actual_size(char *ptr);\nstatic int sh_allocated(const char *ptr);\n#endif\n\nint CRYPTO_secure_malloc_init(size_t size, int minsize)\n{\n#ifdef OPENSSL_SECURE_MEMORY\n int ret = 0;\n\n if (!secure_mem_initialized) {\n sec_malloc_lock = CRYPTO_THREAD_lock_new();\n if (sec_malloc_lock == NULL)\n return 0;\n if ((ret = sh_init(size, minsize)) != 0) {\n secure_mem_initialized = 1;\n } else {\n CRYPTO_THREAD_lock_free(sec_malloc_lock);\n sec_malloc_lock = NULL;\n }\n }\n\n return ret;\n#else\n return 0;\n#endif /* OPENSSL_SECURE_MEMORY */\n}\n\nint CRYPTO_secure_malloc_done(void)\n{\n#ifdef OPENSSL_SECURE_MEMORY\n if (secure_mem_used == 0) {\n sh_done();\n secure_mem_initialized = 0;\n CRYPTO_THREAD_lock_free(sec_malloc_lock);\n sec_malloc_lock = NULL;\n return 1;\n }\n#endif /* OPENSSL_SECURE_MEMORY */\n return 0;\n}\n\nint CRYPTO_secure_malloc_initialized(void)\n{\n#ifdef OPENSSL_SECURE_MEMORY\n return secure_mem_initialized;\n#else\n return 0;\n#endif /* OPENSSL_SECURE_MEMORY */\n}\n\nvoid *CRYPTO_secure_malloc(size_t num, const char *file, int line)\n{\n#ifdef OPENSSL_SECURE_MEMORY\n void *ret;\n size_t actual_size;\n\n if (!secure_mem_initialized) {\n return CRYPTO_malloc(num, file, line);\n }\n CRYPTO_THREAD_write_lock(sec_malloc_lock);\n ret = sh_malloc(num);\n actual_size = ret ? sh_actual_size(ret) : 0;\n secure_mem_used += actual_size;\n CRYPTO_THREAD_unlock(sec_malloc_lock);\n return ret;\n#else\n return CRYPTO_malloc(num, file, line);\n#endif /* OPENSSL_SECURE_MEMORY */\n}\n\nvoid *CRYPTO_secure_zalloc(size_t num, const char *file, int line)\n{\n#ifdef OPENSSL_SECURE_MEMORY\n if (secure_mem_initialized)\n /* CRYPTO_secure_malloc() zeroes allocations when it is implemented */\n return CRYPTO_secure_malloc(num, file, line);\n#endif\n return CRYPTO_zalloc(num, file, line);\n}\n\nvoid CRYPTO_secure_free(void *ptr, const char *file, int line)\n{\n#ifdef OPENSSL_SECURE_MEMORY\n size_t actual_size;\n\n if (ptr == NULL)\n return;\n if (!CRYPTO_secure_allocated(ptr)) {\n CRYPTO_free(ptr, file, line);\n return;\n }\n CRYPTO_THREAD_write_lock(sec_malloc_lock);\n actual_size = sh_actual_size(ptr);\n CLEAR(ptr, actual_size);\n secure_mem_used -= actual_size;\n sh_free(ptr);\n CRYPTO_THREAD_unlock(sec_malloc_lock);\n#else\n CRYPTO_free(ptr, file, line);\n#endif /* OPENSSL_SECURE_MEMORY */\n}\n\nvoid CRYPTO_secure_clear_free(void *ptr, size_t num,\n const char *file, int line)\n{\n#ifdef OPENSSL_SECURE_MEMORY\n size_t actual_size;\n\n if (ptr == NULL)\n return;\n if (!CRYPTO_secure_allocated(ptr)) {\n OPENSSL_cleanse(ptr, num);\n CRYPTO_free(ptr, file, line);\n return;\n }\n CRYPTO_THREAD_write_lock(sec_malloc_lock);\n actual_size = sh_actual_size(ptr);\n CLEAR(ptr, actual_size);\n secure_mem_used -= actual_size;\n sh_free(ptr);\n CRYPTO_THREAD_unlock(sec_malloc_lock);\n#else\n if (ptr == NULL)\n return;\n OPENSSL_cleanse(ptr, num);\n CRYPTO_free(ptr, file, line);\n#endif /* OPENSSL_SECURE_MEMORY */\n}\n\nint CRYPTO_secure_allocated(const void *ptr)\n{\n#ifdef OPENSSL_SECURE_MEMORY\n int ret;\n\n if (!secure_mem_initialized)\n return 0;\n CRYPTO_THREAD_write_lock(sec_malloc_lock);\n ret = sh_allocated(ptr);\n CRYPTO_THREAD_unlock(sec_malloc_lock);\n return ret;\n#else\n return 0;\n#endif /* OPENSSL_SECURE_MEMORY */\n}\n\nsize_t CRYPTO_secure_used(void)\n{\n#ifdef OPENSSL_SECURE_MEMORY\n return secure_mem_used;\n#else\n return 0;\n#endif /* OPENSSL_SECURE_MEMORY */\n}\n\nsize_t CRYPTO_secure_actual_size(void *ptr)\n{\n#ifdef OPENSSL_SECURE_MEMORY\n size_t actual_size;\n\n CRYPTO_THREAD_write_lock(sec_malloc_lock);\n actual_size = sh_actual_size(ptr);\n CRYPTO_THREAD_unlock(sec_malloc_lock);\n return actual_size;\n#else\n return 0;\n#endif\n}\n/* END OF PAGE ...\n\n ... START OF PAGE */\n\n/*\n * SECURE HEAP IMPLEMENTATION\n */\n#ifdef OPENSSL_SECURE_MEMORY\n\n\n/*\n * The implementation provided here uses a fixed-sized mmap() heap,\n * which is locked into memory, not written to core files, and protected\n * on either side by an unmapped page, which will catch pointer overruns\n * (or underruns) and an attempt to read data out of the secure heap.\n * Free'd memory is zero'd or otherwise cleansed.\n *\n * This is a pretty standard buddy allocator. We keep areas in a multiple\n * of \"sh.minsize\" units. The freelist and bitmaps are kept separately,\n * so all (and only) data is kept in the mmap'd heap.\n *\n * This code assumes eight-bit bytes. The numbers 3 and 7 are all over the\n * place.\n */\n\n#define ONE ((size_t)1)\n\n# define TESTBIT(t, b) (t[(b) >> 3] & (ONE << ((b) & 7)))\n# define SETBIT(t, b) (t[(b) >> 3] |= (ONE << ((b) & 7)))\n# define CLEARBIT(t, b) (t[(b) >> 3] &= (0xFF & ~(ONE << ((b) & 7))))\n\n#define WITHIN_ARENA(p) \\\n ((char*)(p) >= sh.arena && (char*)(p) < &sh.arena[sh.arena_size])\n#define WITHIN_FREELIST(p) \\\n ((char*)(p) >= (char*)sh.freelist && (char*)(p) < (char*)&sh.freelist[sh.freelist_size])\n\n\ntypedef struct sh_list_st\n{\n struct sh_list_st *next;\n struct sh_list_st **p_next;\n} SH_LIST;\n\ntypedef struct sh_st\n{\n char* map_result;\n size_t map_size;\n char *arena;\n size_t arena_size;\n char **freelist;\n ossl_ssize_t freelist_size;\n size_t minsize;\n unsigned char *bittable;\n unsigned char *bitmalloc;\n size_t bittable_size; /* size in bits */\n} SH;\n\nstatic SH sh;\n\nstatic size_t sh_getlist(char *ptr)\n{\n ossl_ssize_t list = sh.freelist_size - 1;\n size_t bit = (sh.arena_size + ptr - sh.arena) / sh.minsize;\n\n for (; bit; bit >>= 1, list--) {\n if (TESTBIT(sh.bittable, bit))\n break;\n OPENSSL_assert((bit & 1) == 0);\n }\n\n return list;\n}\n\n\nstatic int sh_testbit(char *ptr, int list, unsigned char *table)\n{\n size_t bit;\n\n OPENSSL_assert(list >= 0 && list < sh.freelist_size);\n OPENSSL_assert(((ptr - sh.arena) & ((sh.arena_size >> list) - 1)) == 0);\n bit = (ONE << list) + ((ptr - sh.arena) / (sh.arena_size >> list));\n OPENSSL_assert(bit > 0 && bit < sh.bittable_size);\n return TESTBIT(table, bit);\n}\n\nstatic void sh_clearbit(char *ptr, int list, unsigned char *table)\n{\n size_t bit;\n\n OPENSSL_assert(list >= 0 && list < sh.freelist_size);\n OPENSSL_assert(((ptr - sh.arena) & ((sh.arena_size >> list) - 1)) == 0);\n bit = (ONE << list) + ((ptr - sh.arena) / (sh.arena_size >> list));\n OPENSSL_assert(bit > 0 && bit < sh.bittable_size);\n OPENSSL_assert(TESTBIT(table, bit));\n CLEARBIT(table, bit);\n}\n\nstatic void sh_setbit(char *ptr, int list, unsigned char *table)\n{\n size_t bit;\n\n OPENSSL_assert(list >= 0 && list < sh.freelist_size);\n OPENSSL_assert(((ptr - sh.arena) & ((sh.arena_size >> list) - 1)) == 0);\n bit = (ONE << list) + ((ptr - sh.arena) / (sh.arena_size >> list));\n OPENSSL_assert(bit > 0 && bit < sh.bittable_size);\n OPENSSL_assert(!TESTBIT(table, bit));\n SETBIT(table, bit);\n}\n\nstatic void sh_add_to_list(char **list, char *ptr)\n{\n SH_LIST *temp;\n\n OPENSSL_assert(WITHIN_FREELIST(list));\n OPENSSL_assert(WITHIN_ARENA(ptr));\n\n temp = (SH_LIST *)ptr;\n temp->next = *(SH_LIST **)list;\n OPENSSL_assert(temp->next == NULL || WITHIN_ARENA(temp->next));\n temp->p_next = (SH_LIST **)list;\n\n if (temp->next != NULL) {\n OPENSSL_assert((char **)temp->next->p_next == list);\n temp->next->p_next = &(temp->next);\n }\n\n *list = ptr;\n}\n\nstatic void sh_remove_from_list(char *ptr)\n{\n SH_LIST *temp, *temp2;\n\n temp = (SH_LIST *)ptr;\n if (temp->next != NULL)\n temp->next->p_next = temp->p_next;\n *temp->p_next = temp->next;\n if (temp->next == NULL)\n return;\n\n temp2 = temp->next;\n OPENSSL_assert(WITHIN_FREELIST(temp2->p_next) || WITHIN_ARENA(temp2->p_next));\n}\n\n\nstatic int sh_init(size_t size, int minsize)\n{\n int ret;\n size_t i;\n size_t pgsize;\n size_t aligned;\n\n memset(&sh, 0, sizeof(sh));\n\n /* make sure size and minsize are powers of 2 */\n OPENSSL_assert(size > 0);\n OPENSSL_assert((size & (size - 1)) == 0);\n OPENSSL_assert(minsize > 0);\n OPENSSL_assert((minsize & (minsize - 1)) == 0);\n if (size <= 0 || (size & (size - 1)) != 0)\n goto err;\n if (minsize <= 0 || (minsize & (minsize - 1)) != 0)\n goto err;\n\n while (minsize < (int)sizeof(SH_LIST))\n minsize *= 2;\n\n sh.arena_size = size;\n sh.minsize = minsize;\n sh.bittable_size = (sh.arena_size / sh.minsize) * 2;\n\n /* Prevent allocations of size 0 later on */\n if (sh.bittable_size >> 3 == 0)\n goto err;\n\n sh.freelist_size = -1;\n for (i = sh.bittable_size; i; i >>= 1)\n sh.freelist_size++;\n\n sh.freelist = OPENSSL_zalloc(sh.freelist_size * sizeof(char *));\n OPENSSL_assert(sh.freelist != NULL);\n if (sh.freelist == NULL)\n goto err;\n\n sh.bittable = OPENSSL_zalloc(sh.bittable_size >> 3);\n OPENSSL_assert(sh.bittable != NULL);\n if (sh.bittable == NULL)\n goto err;\n\n sh.bitmalloc = OPENSSL_zalloc(sh.bittable_size >> 3);\n OPENSSL_assert(sh.bitmalloc != NULL);\n if (sh.bitmalloc == NULL)\n goto err;\n\n /* Allocate space for heap, and two extra pages as guards */\n#if defined(_SC_PAGE_SIZE) || defined (_SC_PAGESIZE)\n {\n# if defined(_SC_PAGE_SIZE)\n long tmppgsize = sysconf(_SC_PAGE_SIZE);\n# else\n long tmppgsize = sysconf(_SC_PAGESIZE);\n# endif\n if (tmppgsize < 1)\n pgsize = PAGE_SIZE;\n else\n pgsize = (size_t)tmppgsize;\n }\n#else\n pgsize = PAGE_SIZE;\n#endif\n sh.map_size = pgsize + sh.arena_size + pgsize;\n if (1) {\n#ifdef MAP_ANON\n sh.map_result = mmap(NULL, sh.map_size,\n PROT_READ|PROT_WRITE, MAP_ANON|MAP_PRIVATE|MAP_CONCEAL, -1, 0);\n } else {\n#endif\n int fd;\n\n sh.map_result = MAP_FAILED;\n if ((fd = open(\"/dev/zero\", O_RDWR)) >= 0) {\n sh.map_result = mmap(NULL, sh.map_size,\n PROT_READ|PROT_WRITE, MAP_PRIVATE, fd, 0);\n close(fd);\n }\n }\n if (sh.map_result == MAP_FAILED)\n goto err;\n sh.arena = (char *)(sh.map_result + pgsize);\n sh_setbit(sh.arena, 0, sh.bittable);\n sh_add_to_list(&sh.freelist[0], sh.arena);\n\n /* Now try to add guard pages and lock into memory. */\n ret = 1;\n\n /* Starting guard is already aligned from mmap. */\n if (mprotect(sh.map_result, pgsize, PROT_NONE) < 0)\n ret = 2;\n\n /* Ending guard page - need to round up to page boundary */\n aligned = (pgsize + sh.arena_size + (pgsize - 1)) & ~(pgsize - 1);\n if (mprotect(sh.map_result + aligned, pgsize, PROT_NONE) < 0)\n ret = 2;\n\n#if defined(OPENSSL_SYS_LINUX) && defined(MLOCK_ONFAULT) && defined(SYS_mlock2)\n if (syscall(SYS_mlock2, sh.arena, sh.arena_size, MLOCK_ONFAULT) < 0) {\n if (errno == ENOSYS) {\n if (mlock(sh.arena, sh.arena_size) < 0)\n ret = 2;\n } else {\n ret = 2;\n }\n }\n#else\n if (mlock(sh.arena, sh.arena_size) < 0)\n ret = 2;\n#endif\n#ifdef MADV_DONTDUMP\n if (madvise(sh.arena, sh.arena_size, MADV_DONTDUMP) < 0)\n ret = 2;\n#endif\n\n return ret;\n\n err:\n sh_done();\n return 0;\n}\n\nstatic void sh_done(void)\n{\n OPENSSL_free(sh.freelist);\n OPENSSL_free(sh.bittable);\n OPENSSL_free(sh.bitmalloc);\n if (sh.map_result != MAP_FAILED && sh.map_size)\n munmap(sh.map_result, sh.map_size);\n memset(&sh, 0, sizeof(sh));\n}\n\nstatic int sh_allocated(const char *ptr)\n{\n return WITHIN_ARENA(ptr) ? 1 : 0;\n}\n\nstatic char *sh_find_my_buddy(char *ptr, int list)\n{\n size_t bit;\n char *chunk = NULL;\n\n bit = (ONE << list) + (ptr - sh.arena) / (sh.arena_size >> list);\n bit ^= 1;\n\n if (TESTBIT(sh.bittable, bit) && !TESTBIT(sh.bitmalloc, bit))\n chunk = sh.arena + ((bit & ((ONE << list) - 1)) * (sh.arena_size >> list));\n\n return chunk;\n}\n\nstatic void *sh_malloc(size_t size)\n{\n ossl_ssize_t list, slist;\n size_t i;\n char *chunk;\n\n if (size > sh.arena_size)\n return NULL;\n\n list = sh.freelist_size - 1;\n for (i = sh.minsize; i < size; i <<= 1)\n list--;\n if (list < 0)\n return NULL;\n\n /* try to find a larger entry to split */\n for (slist = list; slist >= 0; slist--)\n if (sh.freelist[slist] != NULL)\n break;\n if (slist < 0)\n return NULL;\n\n /* split larger entry */\n while (slist != list) {\n char *temp = sh.freelist[slist];\n\n /* remove from bigger list */\n OPENSSL_assert(!sh_testbit(temp, slist, sh.bitmalloc));\n sh_clearbit(temp, slist, sh.bittable);\n sh_remove_from_list(temp);\n OPENSSL_assert(temp != sh.freelist[slist]);\n\n /* done with bigger list */\n slist++;\n\n /* add to smaller list */\n OPENSSL_assert(!sh_testbit(temp, slist, sh.bitmalloc));\n sh_setbit(temp, slist, sh.bittable);\n sh_add_to_list(&sh.freelist[slist], temp);\n OPENSSL_assert(sh.freelist[slist] == temp);\n\n /* split in 2 */\n temp += sh.arena_size >> slist;\n OPENSSL_assert(!sh_testbit(temp, slist, sh.bitmalloc));\n sh_setbit(temp, slist, sh.bittable);\n sh_add_to_list(&sh.freelist[slist], temp);\n OPENSSL_assert(sh.freelist[slist] == temp);\n\n OPENSSL_assert(temp-(sh.arena_size >> slist) == sh_find_my_buddy(temp, slist));\n }\n\n /* peel off memory to hand back */\n chunk = sh.freelist[list];\n OPENSSL_assert(sh_testbit(chunk, list, sh.bittable));\n sh_setbit(chunk, list, sh.bitmalloc);\n sh_remove_from_list(chunk);\n\n OPENSSL_assert(WITHIN_ARENA(chunk));\n\n /* zero the free list header as a precaution against information leakage */\n memset(chunk, 0, sizeof(SH_LIST));\n\n return chunk;\n}\n\nstatic void sh_free(void *ptr)\n{\n size_t list;\n void *buddy;\n\n if (ptr == NULL)\n return;\n OPENSSL_assert(WITHIN_ARENA(ptr));\n if (!WITHIN_ARENA(ptr))\n return;\n\n list = sh_getlist(ptr);\n OPENSSL_assert(sh_testbit(ptr, list, sh.bittable));\n sh_clearbit(ptr, list, sh.bitmalloc);\n sh_add_to_list(&sh.freelist[list], ptr);\n\n /* Try to coalesce two adjacent free areas. */\n while ((buddy = sh_find_my_buddy(ptr, list)) != NULL) {\n OPENSSL_assert(ptr == sh_find_my_buddy(buddy, list));\n OPENSSL_assert(ptr != NULL);\n OPENSSL_assert(!sh_testbit(ptr, list, sh.bitmalloc));\n sh_clearbit(ptr, list, sh.bittable);\n sh_remove_from_list(ptr);\n OPENSSL_assert(!sh_testbit(ptr, list, sh.bitmalloc));\n sh_clearbit(buddy, list, sh.bittable);\n sh_remove_from_list(buddy);\n\n list--;\n\n /* Zero the higher addressed block's free list pointers */\n memset(ptr > buddy ? ptr : buddy, 0, sizeof(SH_LIST));\n if (ptr > buddy)\n ptr = buddy;\n\n OPENSSL_assert(!sh_testbit(ptr, list, sh.bitmalloc));\n sh_setbit(ptr, list, sh.bittable);\n sh_add_to_list(&sh.freelist[list], ptr);\n OPENSSL_assert(sh.freelist[list] == ptr);\n }\n}\n\nstatic size_t sh_actual_size(char *ptr)\n{\n int list;\n\n OPENSSL_assert(WITHIN_ARENA(ptr));\n if (!WITHIN_ARENA(ptr))\n return 0;\n list = sh_getlist(ptr);\n OPENSSL_assert(sh_testbit(ptr, list, sh.bittable));\n return sh.arena_size / (ONE << list);\n}\n#endif /* OPENSSL_SECURE_MEMORY */\n" }, { "path": "cryptomini/sha/sha1_one.c", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \n#include \n#include \n\nunsigned char *SHA1(const unsigned char *d, size_t n, unsigned char *md)\n{\n SHA_CTX c;\n static unsigned char m[SHA_DIGEST_LENGTH];\n\n if (md == NULL)\n md = m;\n if (!SHA1_Init(&c))\n return NULL;\n SHA1_Update(&c, d, n);\n SHA1_Final(md, &c);\n OPENSSL_cleanse(&c, sizeof(c));\n return md;\n}\n" }, { "path": "cryptomini/sha/sha1dgst.c", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \n\n# include \n\n/* The implementation is in ../md32_common.h */\n\n# include \"sha_local.h\"\n" }, { "path": "cryptomini/sha/sha256.c", "content": "/*\n * Copyright 2004-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n\n#include \n#include \n\n#include \n#include \n#include \n\nint SHA224_Init(SHA256_CTX *c)\n{\n memset(c, 0, sizeof(*c));\n c->h[0] = 0xc1059ed8UL;\n c->h[1] = 0x367cd507UL;\n c->h[2] = 0x3070dd17UL;\n c->h[3] = 0xf70e5939UL;\n c->h[4] = 0xffc00b31UL;\n c->h[5] = 0x68581511UL;\n c->h[6] = 0x64f98fa7UL;\n c->h[7] = 0xbefa4fa4UL;\n c->md_len = SHA224_DIGEST_LENGTH;\n return 1;\n}\n\nint SHA256_Init(SHA256_CTX *c)\n{\n memset(c, 0, sizeof(*c));\n c->h[0] = 0x6a09e667UL;\n c->h[1] = 0xbb67ae85UL;\n c->h[2] = 0x3c6ef372UL;\n c->h[3] = 0xa54ff53aUL;\n c->h[4] = 0x510e527fUL;\n c->h[5] = 0x9b05688cUL;\n c->h[6] = 0x1f83d9abUL;\n c->h[7] = 0x5be0cd19UL;\n c->md_len = SHA256_DIGEST_LENGTH;\n return 1;\n}\n\nunsigned char *SHA224(const unsigned char *d, size_t n, unsigned char *md)\n{\n SHA256_CTX c;\n static unsigned char m[SHA224_DIGEST_LENGTH];\n\n if (md == NULL)\n md = m;\n SHA224_Init(&c);\n SHA256_Update(&c, d, n);\n SHA256_Final(md, &c);\n OPENSSL_cleanse(&c, sizeof(c));\n return md;\n}\n\nunsigned char *SHA256(const unsigned char *d, size_t n, unsigned char *md)\n{\n SHA256_CTX c;\n static unsigned char m[SHA256_DIGEST_LENGTH];\n\n if (md == NULL)\n md = m;\n SHA256_Init(&c);\n SHA256_Update(&c, d, n);\n SHA256_Final(md, &c);\n OPENSSL_cleanse(&c, sizeof(c));\n return md;\n}\n\nint SHA224_Update(SHA256_CTX *c, const void *data, size_t len)\n{\n return SHA256_Update(c, data, len);\n}\n\nint SHA224_Final(unsigned char *md, SHA256_CTX *c)\n{\n return SHA256_Final(md, c);\n}\n\n#define DATA_ORDER_IS_BIG_ENDIAN\n\n#define HASH_LONG SHA_LONG\n#define HASH_CTX SHA256_CTX\n#define HASH_CBLOCK SHA_CBLOCK\n\n/*\n * Note that FIPS180-2 discusses \"Truncation of the Hash Function Output.\"\n * default: case below covers for it. It's not clear however if it's\n * permitted to truncate to amount of bytes not divisible by 4. I bet not,\n * but if it is, then default: case shall be extended. For reference.\n * Idea behind separate cases for pre-defined lengths is to let the\n * compiler decide if it's appropriate to unroll small loops.\n */\n#define HASH_MAKE_STRING(c,s) do { \\\n unsigned long ll; \\\n unsigned int nn; \\\n switch ((c)->md_len) \\\n { case SHA224_DIGEST_LENGTH: \\\n for (nn=0;nnh[nn]; (void)HOST_l2c(ll,(s)); } \\\n break; \\\n case SHA256_DIGEST_LENGTH: \\\n for (nn=0;nnh[nn]; (void)HOST_l2c(ll,(s)); } \\\n break; \\\n default: \\\n if ((c)->md_len > SHA256_DIGEST_LENGTH) \\\n return 0; \\\n for (nn=0;nn<(c)->md_len/4;nn++) \\\n { ll=(c)->h[nn]; (void)HOST_l2c(ll,(s)); } \\\n break; \\\n } \\\n } while (0)\n\n#define HASH_UPDATE SHA256_Update\n#define HASH_TRANSFORM SHA256_Transform\n#define HASH_FINAL SHA256_Final\n#define HASH_BLOCK_DATA_ORDER sha256_block_data_order\n#ifndef SHA256_ASM\nstatic\n#endif\nvoid sha256_block_data_order(SHA256_CTX *ctx, const void *in, size_t num);\n\n#include \"crypto/md32_common.h\"\n\n#ifndef SHA256_ASM\nstatic const SHA_LONG K256[64] = {\n 0x428a2f98UL, 0x71374491UL, 0xb5c0fbcfUL, 0xe9b5dba5UL,\n 0x3956c25bUL, 0x59f111f1UL, 0x923f82a4UL, 0xab1c5ed5UL,\n 0xd807aa98UL, 0x12835b01UL, 0x243185beUL, 0x550c7dc3UL,\n 0x72be5d74UL, 0x80deb1feUL, 0x9bdc06a7UL, 0xc19bf174UL,\n 0xe49b69c1UL, 0xefbe4786UL, 0x0fc19dc6UL, 0x240ca1ccUL,\n 0x2de92c6fUL, 0x4a7484aaUL, 0x5cb0a9dcUL, 0x76f988daUL,\n 0x983e5152UL, 0xa831c66dUL, 0xb00327c8UL, 0xbf597fc7UL,\n 0xc6e00bf3UL, 0xd5a79147UL, 0x06ca6351UL, 0x14292967UL,\n 0x27b70a85UL, 0x2e1b2138UL, 0x4d2c6dfcUL, 0x53380d13UL,\n 0x650a7354UL, 0x766a0abbUL, 0x81c2c92eUL, 0x92722c85UL,\n 0xa2bfe8a1UL, 0xa81a664bUL, 0xc24b8b70UL, 0xc76c51a3UL,\n 0xd192e819UL, 0xd6990624UL, 0xf40e3585UL, 0x106aa070UL,\n 0x19a4c116UL, 0x1e376c08UL, 0x2748774cUL, 0x34b0bcb5UL,\n 0x391c0cb3UL, 0x4ed8aa4aUL, 0x5b9cca4fUL, 0x682e6ff3UL,\n 0x748f82eeUL, 0x78a5636fUL, 0x84c87814UL, 0x8cc70208UL,\n 0x90befffaUL, 0xa4506cebUL, 0xbef9a3f7UL, 0xc67178f2UL\n};\n\n/*\n * FIPS specification refers to right rotations, while our ROTATE macro\n * is left one. This is why you might notice that rotation coefficients\n * differ from those observed in FIPS document by 32-N...\n */\n# define Sigma0(x) (ROTATE((x),30) ^ ROTATE((x),19) ^ ROTATE((x),10))\n# define Sigma1(x) (ROTATE((x),26) ^ ROTATE((x),21) ^ ROTATE((x),7))\n# define sigma0(x) (ROTATE((x),25) ^ ROTATE((x),14) ^ ((x)>>3))\n# define sigma1(x) (ROTATE((x),15) ^ ROTATE((x),13) ^ ((x)>>10))\n\n# define Ch(x,y,z) (((x) & (y)) ^ ((~(x)) & (z)))\n# define Maj(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))\n\n# ifdef OPENSSL_SMALL_FOOTPRINT\n\nstatic void sha256_block_data_order(SHA256_CTX *ctx, const void *in,\n size_t num)\n{\n unsigned MD32_REG_T a, b, c, d, e, f, g, h, s0, s1, T1, T2;\n SHA_LONG X[16], l;\n int i;\n const unsigned char *data = in;\n\n while (num--) {\n\n a = ctx->h[0];\n b = ctx->h[1];\n c = ctx->h[2];\n d = ctx->h[3];\n e = ctx->h[4];\n f = ctx->h[5];\n g = ctx->h[6];\n h = ctx->h[7];\n\n for (i = 0; i < 16; i++) {\n (void)HOST_c2l(data, l);\n T1 = X[i] = l;\n T1 += h + Sigma1(e) + Ch(e, f, g) + K256[i];\n T2 = Sigma0(a) + Maj(a, b, c);\n h = g;\n g = f;\n f = e;\n e = d + T1;\n d = c;\n c = b;\n b = a;\n a = T1 + T2;\n }\n\n for (; i < 64; i++) {\n s0 = X[(i + 1) & 0x0f];\n s0 = sigma0(s0);\n s1 = X[(i + 14) & 0x0f];\n s1 = sigma1(s1);\n\n T1 = X[i & 0xf] += s0 + s1 + X[(i + 9) & 0xf];\n T1 += h + Sigma1(e) + Ch(e, f, g) + K256[i];\n T2 = Sigma0(a) + Maj(a, b, c);\n h = g;\n g = f;\n f = e;\n e = d + T1;\n d = c;\n c = b;\n b = a;\n a = T1 + T2;\n }\n\n ctx->h[0] += a;\n ctx->h[1] += b;\n ctx->h[2] += c;\n ctx->h[3] += d;\n ctx->h[4] += e;\n ctx->h[5] += f;\n ctx->h[6] += g;\n ctx->h[7] += h;\n\n }\n}\n\n# else\n\n# define ROUND_00_15(i,a,b,c,d,e,f,g,h) do { \\\n T1 += h + Sigma1(e) + Ch(e,f,g) + K256[i]; \\\n h = Sigma0(a) + Maj(a,b,c); \\\n d += T1; h += T1; } while (0)\n\n# define ROUND_16_63(i,a,b,c,d,e,f,g,h,X) do { \\\n s0 = X[(i+1)&0x0f]; s0 = sigma0(s0); \\\n s1 = X[(i+14)&0x0f]; s1 = sigma1(s1); \\\n T1 = X[(i)&0x0f] += s0 + s1 + X[(i+9)&0x0f]; \\\n ROUND_00_15(i,a,b,c,d,e,f,g,h); } while (0)\n\nstatic void sha256_block_data_order(SHA256_CTX *ctx, const void *in,\n size_t num)\n{\n unsigned MD32_REG_T a, b, c, d, e, f, g, h, s0, s1, T1;\n SHA_LONG X[16];\n int i;\n const unsigned char *data = in;\n const union {\n long one;\n char little;\n } is_endian = {\n 1\n };\n\n while (num--) {\n\n a = ctx->h[0];\n b = ctx->h[1];\n c = ctx->h[2];\n d = ctx->h[3];\n e = ctx->h[4];\n f = ctx->h[5];\n g = ctx->h[6];\n h = ctx->h[7];\n\n if (!is_endian.little && sizeof(SHA_LONG) == 4\n && ((size_t)in % 4) == 0) {\n const SHA_LONG *W = (const SHA_LONG *)data;\n\n T1 = X[0] = W[0];\n ROUND_00_15(0, a, b, c, d, e, f, g, h);\n T1 = X[1] = W[1];\n ROUND_00_15(1, h, a, b, c, d, e, f, g);\n T1 = X[2] = W[2];\n ROUND_00_15(2, g, h, a, b, c, d, e, f);\n T1 = X[3] = W[3];\n ROUND_00_15(3, f, g, h, a, b, c, d, e);\n T1 = X[4] = W[4];\n ROUND_00_15(4, e, f, g, h, a, b, c, d);\n T1 = X[5] = W[5];\n ROUND_00_15(5, d, e, f, g, h, a, b, c);\n T1 = X[6] = W[6];\n ROUND_00_15(6, c, d, e, f, g, h, a, b);\n T1 = X[7] = W[7];\n ROUND_00_15(7, b, c, d, e, f, g, h, a);\n T1 = X[8] = W[8];\n ROUND_00_15(8, a, b, c, d, e, f, g, h);\n T1 = X[9] = W[9];\n ROUND_00_15(9, h, a, b, c, d, e, f, g);\n T1 = X[10] = W[10];\n ROUND_00_15(10, g, h, a, b, c, d, e, f);\n T1 = X[11] = W[11];\n ROUND_00_15(11, f, g, h, a, b, c, d, e);\n T1 = X[12] = W[12];\n ROUND_00_15(12, e, f, g, h, a, b, c, d);\n T1 = X[13] = W[13];\n ROUND_00_15(13, d, e, f, g, h, a, b, c);\n T1 = X[14] = W[14];\n ROUND_00_15(14, c, d, e, f, g, h, a, b);\n T1 = X[15] = W[15];\n ROUND_00_15(15, b, c, d, e, f, g, h, a);\n\n data += SHA256_CBLOCK;\n } else {\n SHA_LONG l;\n\n (void)HOST_c2l(data, l);\n T1 = X[0] = l;\n ROUND_00_15(0, a, b, c, d, e, f, g, h);\n (void)HOST_c2l(data, l);\n T1 = X[1] = l;\n ROUND_00_15(1, h, a, b, c, d, e, f, g);\n (void)HOST_c2l(data, l);\n T1 = X[2] = l;\n ROUND_00_15(2, g, h, a, b, c, d, e, f);\n (void)HOST_c2l(data, l);\n T1 = X[3] = l;\n ROUND_00_15(3, f, g, h, a, b, c, d, e);\n (void)HOST_c2l(data, l);\n T1 = X[4] = l;\n ROUND_00_15(4, e, f, g, h, a, b, c, d);\n (void)HOST_c2l(data, l);\n T1 = X[5] = l;\n ROUND_00_15(5, d, e, f, g, h, a, b, c);\n (void)HOST_c2l(data, l);\n T1 = X[6] = l;\n ROUND_00_15(6, c, d, e, f, g, h, a, b);\n (void)HOST_c2l(data, l);\n T1 = X[7] = l;\n ROUND_00_15(7, b, c, d, e, f, g, h, a);\n (void)HOST_c2l(data, l);\n T1 = X[8] = l;\n ROUND_00_15(8, a, b, c, d, e, f, g, h);\n (void)HOST_c2l(data, l);\n T1 = X[9] = l;\n ROUND_00_15(9, h, a, b, c, d, e, f, g);\n (void)HOST_c2l(data, l);\n T1 = X[10] = l;\n ROUND_00_15(10, g, h, a, b, c, d, e, f);\n (void)HOST_c2l(data, l);\n T1 = X[11] = l;\n ROUND_00_15(11, f, g, h, a, b, c, d, e);\n (void)HOST_c2l(data, l);\n T1 = X[12] = l;\n ROUND_00_15(12, e, f, g, h, a, b, c, d);\n (void)HOST_c2l(data, l);\n T1 = X[13] = l;\n ROUND_00_15(13, d, e, f, g, h, a, b, c);\n (void)HOST_c2l(data, l);\n T1 = X[14] = l;\n ROUND_00_15(14, c, d, e, f, g, h, a, b);\n (void)HOST_c2l(data, l);\n T1 = X[15] = l;\n ROUND_00_15(15, b, c, d, e, f, g, h, a);\n }\n\n for (i = 16; i < 64; i += 8) {\n ROUND_16_63(i + 0, a, b, c, d, e, f, g, h, X);\n ROUND_16_63(i + 1, h, a, b, c, d, e, f, g, X);\n ROUND_16_63(i + 2, g, h, a, b, c, d, e, f, X);\n ROUND_16_63(i + 3, f, g, h, a, b, c, d, e, X);\n ROUND_16_63(i + 4, e, f, g, h, a, b, c, d, X);\n ROUND_16_63(i + 5, d, e, f, g, h, a, b, c, X);\n ROUND_16_63(i + 6, c, d, e, f, g, h, a, b, X);\n ROUND_16_63(i + 7, b, c, d, e, f, g, h, a, X);\n }\n\n ctx->h[0] += a;\n ctx->h[1] += b;\n ctx->h[2] += c;\n ctx->h[3] += d;\n ctx->h[4] += e;\n ctx->h[5] += f;\n ctx->h[6] += g;\n ctx->h[7] += h;\n\n }\n}\n\n# endif\n#endif /* SHA256_ASM */\n" }, { "path": "cryptomini/sha/sha512.c", "content": "/*\n * Copyright 2004-2018 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n/*-\n * IMPLEMENTATION NOTES.\n *\n * As you might have noticed 32-bit hash algorithms:\n *\n * - permit SHA_LONG to be wider than 32-bit\n * - optimized versions implement two transform functions: one operating\n * on [aligned] data in host byte order and one - on data in input\n * stream byte order;\n * - share common byte-order neutral collector and padding function\n * implementations, ../md32_common.h;\n *\n * Neither of the above applies to this SHA-512 implementations. Reasons\n * [in reverse order] are:\n *\n * - it's the only 64-bit hash algorithm for the moment of this writing,\n * there is no need for common collector/padding implementation [yet];\n * - by supporting only one transform function [which operates on\n * *aligned* data in input stream byte order, big-endian in this case]\n * we minimize burden of maintenance in two ways: a) collector/padding\n * function is simpler; b) only one transform function to stare at;\n * - SHA_LONG64 is required to be exactly 64-bit in order to be able to\n * apply a number of optimizations to mitigate potential performance\n * penalties caused by previous design decision;\n *\n * Caveat lector.\n *\n * Implementation relies on the fact that \"long long\" is 64-bit on\n * both 32- and 64-bit platforms. If some compiler vendor comes up\n * with 128-bit long long, adjustment to sha.h would be required.\n * As this implementation relies on 64-bit integer type, it's totally\n * inappropriate for platforms which don't support it, most notably\n * 16-bit platforms.\n */\n#include \n#include \n\n#include \n#include \n#include \n\n#include \"internal/cryptlib.h\"\n#include \"crypto/sha.h\"\n\n#if defined(__i386) || defined(__i386__) || defined(_M_IX86) || \\\n defined(__x86_64) || defined(_M_AMD64) || defined(_M_X64) || \\\n defined(__s390__) || defined(__s390x__) || \\\n defined(__aarch64__) || \\\n defined(SHA512_ASM)\n# define SHA512_BLOCK_CAN_MANAGE_UNALIGNED_DATA\n#endif\n\nint sha512_224_init(SHA512_CTX *c)\n{\n c->h[0] = U64(0x8c3d37c819544da2);\n c->h[1] = U64(0x73e1996689dcd4d6);\n c->h[2] = U64(0x1dfab7ae32ff9c82);\n c->h[3] = U64(0x679dd514582f9fcf);\n c->h[4] = U64(0x0f6d2b697bd44da8);\n c->h[5] = U64(0x77e36f7304c48942);\n c->h[6] = U64(0x3f9d85a86a1d36c8);\n c->h[7] = U64(0x1112e6ad91d692a1);\n\n c->Nl = 0;\n c->Nh = 0;\n c->num = 0;\n c->md_len = SHA224_DIGEST_LENGTH;\n return 1;\n}\n\nint sha512_256_init(SHA512_CTX *c)\n{\n c->h[0] = U64(0x22312194fc2bf72c);\n c->h[1] = U64(0x9f555fa3c84c64c2);\n c->h[2] = U64(0x2393b86b6f53b151);\n c->h[3] = U64(0x963877195940eabd);\n c->h[4] = U64(0x96283ee2a88effe3);\n c->h[5] = U64(0xbe5e1e2553863992);\n c->h[6] = U64(0x2b0199fc2c85b8aa);\n c->h[7] = U64(0x0eb72ddc81c52ca2);\n\n c->Nl = 0;\n c->Nh = 0;\n c->num = 0;\n c->md_len = SHA256_DIGEST_LENGTH;\n return 1;\n}\n\nint SHA384_Init(SHA512_CTX *c)\n{\n c->h[0] = U64(0xcbbb9d5dc1059ed8);\n c->h[1] = U64(0x629a292a367cd507);\n c->h[2] = U64(0x9159015a3070dd17);\n c->h[3] = U64(0x152fecd8f70e5939);\n c->h[4] = U64(0x67332667ffc00b31);\n c->h[5] = U64(0x8eb44a8768581511);\n c->h[6] = U64(0xdb0c2e0d64f98fa7);\n c->h[7] = U64(0x47b5481dbefa4fa4);\n\n c->Nl = 0;\n c->Nh = 0;\n c->num = 0;\n c->md_len = SHA384_DIGEST_LENGTH;\n return 1;\n}\n\nint SHA512_Init(SHA512_CTX *c)\n{\n c->h[0] = U64(0x6a09e667f3bcc908);\n c->h[1] = U64(0xbb67ae8584caa73b);\n c->h[2] = U64(0x3c6ef372fe94f82b);\n c->h[3] = U64(0xa54ff53a5f1d36f1);\n c->h[4] = U64(0x510e527fade682d1);\n c->h[5] = U64(0x9b05688c2b3e6c1f);\n c->h[6] = U64(0x1f83d9abfb41bd6b);\n c->h[7] = U64(0x5be0cd19137e2179);\n\n c->Nl = 0;\n c->Nh = 0;\n c->num = 0;\n c->md_len = SHA512_DIGEST_LENGTH;\n return 1;\n}\n\n#ifndef SHA512_ASM\nstatic\n#endif\nvoid sha512_block_data_order(SHA512_CTX *ctx, const void *in, size_t num);\n\nint SHA512_Final(unsigned char *md, SHA512_CTX *c)\n{\n unsigned char *p = (unsigned char *)c->u.p;\n size_t n = c->num;\n\n p[n] = 0x80; /* There always is a room for one */\n n++;\n if (n > (sizeof(c->u) - 16)) {\n memset(p + n, 0, sizeof(c->u) - n);\n n = 0;\n sha512_block_data_order(c, p, 1);\n }\n\n memset(p + n, 0, sizeof(c->u) - 16 - n);\n#ifdef B_ENDIAN\n c->u.d[SHA_LBLOCK - 2] = c->Nh;\n c->u.d[SHA_LBLOCK - 1] = c->Nl;\n#else\n p[sizeof(c->u) - 1] = (unsigned char)(c->Nl);\n p[sizeof(c->u) - 2] = (unsigned char)(c->Nl >> 8);\n p[sizeof(c->u) - 3] = (unsigned char)(c->Nl >> 16);\n p[sizeof(c->u) - 4] = (unsigned char)(c->Nl >> 24);\n p[sizeof(c->u) - 5] = (unsigned char)(c->Nl >> 32);\n p[sizeof(c->u) - 6] = (unsigned char)(c->Nl >> 40);\n p[sizeof(c->u) - 7] = (unsigned char)(c->Nl >> 48);\n p[sizeof(c->u) - 8] = (unsigned char)(c->Nl >> 56);\n p[sizeof(c->u) - 9] = (unsigned char)(c->Nh);\n p[sizeof(c->u) - 10] = (unsigned char)(c->Nh >> 8);\n p[sizeof(c->u) - 11] = (unsigned char)(c->Nh >> 16);\n p[sizeof(c->u) - 12] = (unsigned char)(c->Nh >> 24);\n p[sizeof(c->u) - 13] = (unsigned char)(c->Nh >> 32);\n p[sizeof(c->u) - 14] = (unsigned char)(c->Nh >> 40);\n p[sizeof(c->u) - 15] = (unsigned char)(c->Nh >> 48);\n p[sizeof(c->u) - 16] = (unsigned char)(c->Nh >> 56);\n#endif\n\n sha512_block_data_order(c, p, 1);\n\n if (md == 0)\n return 0;\n\n switch (c->md_len) {\n /* Let compiler decide if it's appropriate to unroll... */\n case SHA224_DIGEST_LENGTH:\n for (n = 0; n < SHA224_DIGEST_LENGTH / 8; n++) {\n SHA_LONG64 t = c->h[n];\n\n *(md++) = (unsigned char)(t >> 56);\n *(md++) = (unsigned char)(t >> 48);\n *(md++) = (unsigned char)(t >> 40);\n *(md++) = (unsigned char)(t >> 32);\n *(md++) = (unsigned char)(t >> 24);\n *(md++) = (unsigned char)(t >> 16);\n *(md++) = (unsigned char)(t >> 8);\n *(md++) = (unsigned char)(t);\n }\n /*\n * For 224 bits, there are four bytes left over that have to be\n * processed separately.\n */\n {\n SHA_LONG64 t = c->h[SHA224_DIGEST_LENGTH / 8];\n\n *(md++) = (unsigned char)(t >> 56);\n *(md++) = (unsigned char)(t >> 48);\n *(md++) = (unsigned char)(t >> 40);\n *(md++) = (unsigned char)(t >> 32);\n }\n break;\n case SHA256_DIGEST_LENGTH:\n for (n = 0; n < SHA256_DIGEST_LENGTH / 8; n++) {\n SHA_LONG64 t = c->h[n];\n\n *(md++) = (unsigned char)(t >> 56);\n *(md++) = (unsigned char)(t >> 48);\n *(md++) = (unsigned char)(t >> 40);\n *(md++) = (unsigned char)(t >> 32);\n *(md++) = (unsigned char)(t >> 24);\n *(md++) = (unsigned char)(t >> 16);\n *(md++) = (unsigned char)(t >> 8);\n *(md++) = (unsigned char)(t);\n }\n break;\n case SHA384_DIGEST_LENGTH:\n for (n = 0; n < SHA384_DIGEST_LENGTH / 8; n++) {\n SHA_LONG64 t = c->h[n];\n\n *(md++) = (unsigned char)(t >> 56);\n *(md++) = (unsigned char)(t >> 48);\n *(md++) = (unsigned char)(t >> 40);\n *(md++) = (unsigned char)(t >> 32);\n *(md++) = (unsigned char)(t >> 24);\n *(md++) = (unsigned char)(t >> 16);\n *(md++) = (unsigned char)(t >> 8);\n *(md++) = (unsigned char)(t);\n }\n break;\n case SHA512_DIGEST_LENGTH:\n for (n = 0; n < SHA512_DIGEST_LENGTH / 8; n++) {\n SHA_LONG64 t = c->h[n];\n\n *(md++) = (unsigned char)(t >> 56);\n *(md++) = (unsigned char)(t >> 48);\n *(md++) = (unsigned char)(t >> 40);\n *(md++) = (unsigned char)(t >> 32);\n *(md++) = (unsigned char)(t >> 24);\n *(md++) = (unsigned char)(t >> 16);\n *(md++) = (unsigned char)(t >> 8);\n *(md++) = (unsigned char)(t);\n }\n break;\n /* ... as well as make sure md_len is not abused. */\n default:\n return 0;\n }\n\n return 1;\n}\n\nint SHA384_Final(unsigned char *md, SHA512_CTX *c)\n{\n return SHA512_Final(md, c);\n}\n\nint SHA512_Update(SHA512_CTX *c, const void *_data, size_t len)\n{\n SHA_LONG64 l;\n unsigned char *p = c->u.p;\n const unsigned char *data = (const unsigned char *)_data;\n\n if (len == 0)\n return 1;\n\n l = (c->Nl + (((SHA_LONG64) len) << 3)) & U64(0xffffffffffffffff);\n if (l < c->Nl)\n c->Nh++;\n if (sizeof(len) >= 8)\n c->Nh += (((SHA_LONG64) len) >> 61);\n c->Nl = l;\n\n if (c->num != 0) {\n size_t n = sizeof(c->u) - c->num;\n\n if (len < n) {\n memcpy(p + c->num, data, len), c->num += (unsigned int)len;\n return 1;\n } else {\n memcpy(p + c->num, data, n), c->num = 0;\n len -= n, data += n;\n sha512_block_data_order(c, p, 1);\n }\n }\n\n if (len >= sizeof(c->u)) {\n#ifndef SHA512_BLOCK_CAN_MANAGE_UNALIGNED_DATA\n if ((size_t)data % sizeof(c->u.d[0]) != 0)\n while (len >= sizeof(c->u))\n memcpy(p, data, sizeof(c->u)),\n sha512_block_data_order(c, p, 1),\n len -= sizeof(c->u), data += sizeof(c->u);\n else\n#endif\n sha512_block_data_order(c, data, len / sizeof(c->u)),\n data += len, len %= sizeof(c->u), data -= len;\n }\n\n if (len != 0)\n memcpy(p, data, len), c->num = (int)len;\n\n return 1;\n}\n\nint SHA384_Update(SHA512_CTX *c, const void *data, size_t len)\n{\n return SHA512_Update(c, data, len);\n}\n\nvoid SHA512_Transform(SHA512_CTX *c, const unsigned char *data)\n{\n#ifndef SHA512_BLOCK_CAN_MANAGE_UNALIGNED_DATA\n if ((size_t)data % sizeof(c->u.d[0]) != 0)\n memcpy(c->u.p, data, sizeof(c->u.p)), data = c->u.p;\n#endif\n sha512_block_data_order(c, data, 1);\n}\n\nunsigned char *SHA384(const unsigned char *d, size_t n, unsigned char *md)\n{\n SHA512_CTX c;\n static unsigned char m[SHA384_DIGEST_LENGTH];\n\n if (md == NULL)\n md = m;\n SHA384_Init(&c);\n SHA512_Update(&c, d, n);\n SHA512_Final(md, &c);\n OPENSSL_cleanse(&c, sizeof(c));\n return md;\n}\n\nunsigned char *SHA512(const unsigned char *d, size_t n, unsigned char *md)\n{\n SHA512_CTX c;\n static unsigned char m[SHA512_DIGEST_LENGTH];\n\n if (md == NULL)\n md = m;\n SHA512_Init(&c);\n SHA512_Update(&c, d, n);\n SHA512_Final(md, &c);\n OPENSSL_cleanse(&c, sizeof(c));\n return md;\n}\n\n#ifndef SHA512_ASM\nstatic const SHA_LONG64 K512[80] = {\n U64(0x428a2f98d728ae22), U64(0x7137449123ef65cd),\n U64(0xb5c0fbcfec4d3b2f), U64(0xe9b5dba58189dbbc),\n U64(0x3956c25bf348b538), U64(0x59f111f1b605d019),\n U64(0x923f82a4af194f9b), U64(0xab1c5ed5da6d8118),\n U64(0xd807aa98a3030242), U64(0x12835b0145706fbe),\n U64(0x243185be4ee4b28c), U64(0x550c7dc3d5ffb4e2),\n U64(0x72be5d74f27b896f), U64(0x80deb1fe3b1696b1),\n U64(0x9bdc06a725c71235), U64(0xc19bf174cf692694),\n U64(0xe49b69c19ef14ad2), U64(0xefbe4786384f25e3),\n U64(0x0fc19dc68b8cd5b5), U64(0x240ca1cc77ac9c65),\n U64(0x2de92c6f592b0275), U64(0x4a7484aa6ea6e483),\n U64(0x5cb0a9dcbd41fbd4), U64(0x76f988da831153b5),\n U64(0x983e5152ee66dfab), U64(0xa831c66d2db43210),\n U64(0xb00327c898fb213f), U64(0xbf597fc7beef0ee4),\n U64(0xc6e00bf33da88fc2), U64(0xd5a79147930aa725),\n U64(0x06ca6351e003826f), U64(0x142929670a0e6e70),\n U64(0x27b70a8546d22ffc), U64(0x2e1b21385c26c926),\n U64(0x4d2c6dfc5ac42aed), U64(0x53380d139d95b3df),\n U64(0x650a73548baf63de), U64(0x766a0abb3c77b2a8),\n U64(0x81c2c92e47edaee6), U64(0x92722c851482353b),\n U64(0xa2bfe8a14cf10364), U64(0xa81a664bbc423001),\n U64(0xc24b8b70d0f89791), U64(0xc76c51a30654be30),\n U64(0xd192e819d6ef5218), U64(0xd69906245565a910),\n U64(0xf40e35855771202a), U64(0x106aa07032bbd1b8),\n U64(0x19a4c116b8d2d0c8), U64(0x1e376c085141ab53),\n U64(0x2748774cdf8eeb99), U64(0x34b0bcb5e19b48a8),\n U64(0x391c0cb3c5c95a63), U64(0x4ed8aa4ae3418acb),\n U64(0x5b9cca4f7763e373), U64(0x682e6ff3d6b2b8a3),\n U64(0x748f82ee5defb2fc), U64(0x78a5636f43172f60),\n U64(0x84c87814a1f0ab72), U64(0x8cc702081a6439ec),\n U64(0x90befffa23631e28), U64(0xa4506cebde82bde9),\n U64(0xbef9a3f7b2c67915), U64(0xc67178f2e372532b),\n U64(0xca273eceea26619c), U64(0xd186b8c721c0c207),\n U64(0xeada7dd6cde0eb1e), U64(0xf57d4f7fee6ed178),\n U64(0x06f067aa72176fba), U64(0x0a637dc5a2c898a6),\n U64(0x113f9804bef90dae), U64(0x1b710b35131c471b),\n U64(0x28db77f523047d84), U64(0x32caab7b40c72493),\n U64(0x3c9ebe0a15c9bebc), U64(0x431d67c49c100d4c),\n U64(0x4cc5d4becb3e42b6), U64(0x597f299cfc657e2a),\n U64(0x5fcb6fab3ad6faec), U64(0x6c44198c4a475817)\n};\n\n# ifndef PEDANTIC\n# if defined(__GNUC__) && __GNUC__>=2 && \\\n !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)\n# if defined(__x86_64) || defined(__x86_64__)\n# define ROTR(a,n) ({ SHA_LONG64 ret; \\\n asm (\"rorq %1,%0\" \\\n : \"=r\"(ret) \\\n : \"J\"(n),\"0\"(a) \\\n : \"cc\"); ret; })\n# if !defined(B_ENDIAN)\n# define PULL64(x) ({ SHA_LONG64 ret=*((const SHA_LONG64 *)(&(x))); \\\n asm (\"bswapq %0\" \\\n : \"=r\"(ret) \\\n : \"0\"(ret)); ret; })\n# endif\n# elif (defined(__i386) || defined(__i386__)) && !defined(B_ENDIAN)\n# if defined(I386_ONLY)\n# define PULL64(x) ({ const unsigned int *p=(const unsigned int *)(&(x));\\\n unsigned int hi=p[0],lo=p[1]; \\\n asm(\"xchgb %%ah,%%al;xchgb %%dh,%%dl;\"\\\n \"roll $16,%%eax; roll $16,%%edx; \"\\\n \"xchgb %%ah,%%al;xchgb %%dh,%%dl;\"\\\n : \"=a\"(lo),\"=d\"(hi) \\\n : \"0\"(lo),\"1\"(hi) : \"cc\"); \\\n ((SHA_LONG64)hi)<<32|lo; })\n# else\n# define PULL64(x) ({ const unsigned int *p=(const unsigned int *)(&(x));\\\n unsigned int hi=p[0],lo=p[1]; \\\n asm (\"bswapl %0; bswapl %1;\" \\\n : \"=r\"(lo),\"=r\"(hi) \\\n : \"0\"(lo),\"1\"(hi)); \\\n ((SHA_LONG64)hi)<<32|lo; })\n# endif\n# elif (defined(_ARCH_PPC) && defined(__64BIT__)) || defined(_ARCH_PPC64)\n# define ROTR(a,n) ({ SHA_LONG64 ret; \\\n asm (\"rotrdi %0,%1,%2\" \\\n : \"=r\"(ret) \\\n : \"r\"(a),\"K\"(n)); ret; })\n# elif defined(__aarch64__)\n# define ROTR(a,n) ({ SHA_LONG64 ret; \\\n asm (\"ror %0,%1,%2\" \\\n : \"=r\"(ret) \\\n : \"r\"(a),\"I\"(n)); ret; })\n# if defined(__BYTE_ORDER__) && defined(__ORDER_LITTLE_ENDIAN__) && \\\n __BYTE_ORDER__==__ORDER_LITTLE_ENDIAN__\n# define PULL64(x) ({ SHA_LONG64 ret; \\\n asm (\"rev %0,%1\" \\\n : \"=r\"(ret) \\\n : \"r\"(*((const SHA_LONG64 *)(&(x))))); ret; })\n# endif\n# endif\n# elif defined(_MSC_VER)\n# if defined(_WIN64) /* applies to both IA-64 and AMD64 */\n# pragma intrinsic(_rotr64)\n# define ROTR(a,n) _rotr64((a),n)\n# endif\n# if defined(_M_IX86) && !defined(OPENSSL_NO_ASM) && \\\n !defined(OPENSSL_NO_INLINE_ASM)\n# if defined(I386_ONLY)\nstatic SHA_LONG64 __fastcall __pull64be(const void *x)\n{\n _asm mov edx,[ecx + 0]\n _asm mov eax,[ecx + 4]\n _asm xchg dh, dl\n _asm xchg ah, al\n _asm rol edx, 16\n _asm rol eax, 16\n _asm xchg dh, dl\n _asm xchg ah, al\n}\n# else\nstatic SHA_LONG64 __fastcall __pull64be(const void *x)\n{\n _asm mov edx,[ecx + 0]\n _asm mov eax,[ecx + 4]\n _asm bswap edx\n _asm bswap eax\n}\n# endif\n# define PULL64(x) __pull64be(&(x))\n# endif\n# endif\n# endif\n# ifndef PULL64\n# define B(x,j) (((SHA_LONG64)(*(((const unsigned char *)(&x))+j)))<<((7-j)*8))\n# define PULL64(x) (B(x,0)|B(x,1)|B(x,2)|B(x,3)|B(x,4)|B(x,5)|B(x,6)|B(x,7))\n# endif\n# ifndef ROTR\n# define ROTR(x,s) (((x)>>s) | (x)<<(64-s))\n# endif\n# define Sigma0(x) (ROTR((x),28) ^ ROTR((x),34) ^ ROTR((x),39))\n# define Sigma1(x) (ROTR((x),14) ^ ROTR((x),18) ^ ROTR((x),41))\n# define sigma0(x) (ROTR((x),1) ^ ROTR((x),8) ^ ((x)>>7))\n# define sigma1(x) (ROTR((x),19) ^ ROTR((x),61) ^ ((x)>>6))\n# define Ch(x,y,z) (((x) & (y)) ^ ((~(x)) & (z)))\n# define Maj(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))\n\n# if defined(__i386) || defined(__i386__) || defined(_M_IX86)\n/*\n * This code should give better results on 32-bit CPU with less than\n * ~24 registers, both size and performance wise...\n */\n\nstatic void sha512_block_data_order(SHA512_CTX *ctx, const void *in,\n size_t num)\n{\n const SHA_LONG64 *W = in;\n SHA_LONG64 A, E, T;\n SHA_LONG64 X[9 + 80], *F;\n int i;\n\n while (num--) {\n\n F = X + 80;\n A = ctx->h[0];\n F[1] = ctx->h[1];\n F[2] = ctx->h[2];\n F[3] = ctx->h[3];\n E = ctx->h[4];\n F[5] = ctx->h[5];\n F[6] = ctx->h[6];\n F[7] = ctx->h[7];\n\n for (i = 0; i < 16; i++, F--) {\n# ifdef B_ENDIAN\n T = W[i];\n# else\n T = PULL64(W[i]);\n# endif\n F[0] = A;\n F[4] = E;\n F[8] = T;\n T += F[7] + Sigma1(E) + Ch(E, F[5], F[6]) + K512[i];\n E = F[3] + T;\n A = T + Sigma0(A) + Maj(A, F[1], F[2]);\n }\n\n for (; i < 80; i++, F--) {\n T = sigma0(F[8 + 16 - 1]);\n T += sigma1(F[8 + 16 - 14]);\n T += F[8 + 16] + F[8 + 16 - 9];\n\n F[0] = A;\n F[4] = E;\n F[8] = T;\n T += F[7] + Sigma1(E) + Ch(E, F[5], F[6]) + K512[i];\n E = F[3] + T;\n A = T + Sigma0(A) + Maj(A, F[1], F[2]);\n }\n\n ctx->h[0] += A;\n ctx->h[1] += F[1];\n ctx->h[2] += F[2];\n ctx->h[3] += F[3];\n ctx->h[4] += E;\n ctx->h[5] += F[5];\n ctx->h[6] += F[6];\n ctx->h[7] += F[7];\n\n W += SHA_LBLOCK;\n }\n}\n\n# elif defined(OPENSSL_SMALL_FOOTPRINT)\n\nstatic void sha512_block_data_order(SHA512_CTX *ctx, const void *in,\n size_t num)\n{\n const SHA_LONG64 *W = in;\n SHA_LONG64 a, b, c, d, e, f, g, h, s0, s1, T1, T2;\n SHA_LONG64 X[16];\n int i;\n\n while (num--) {\n\n a = ctx->h[0];\n b = ctx->h[1];\n c = ctx->h[2];\n d = ctx->h[3];\n e = ctx->h[4];\n f = ctx->h[5];\n g = ctx->h[6];\n h = ctx->h[7];\n\n for (i = 0; i < 16; i++) {\n# ifdef B_ENDIAN\n T1 = X[i] = W[i];\n# else\n T1 = X[i] = PULL64(W[i]);\n# endif\n T1 += h + Sigma1(e) + Ch(e, f, g) + K512[i];\n T2 = Sigma0(a) + Maj(a, b, c);\n h = g;\n g = f;\n f = e;\n e = d + T1;\n d = c;\n c = b;\n b = a;\n a = T1 + T2;\n }\n\n for (; i < 80; i++) {\n s0 = X[(i + 1) & 0x0f];\n s0 = sigma0(s0);\n s1 = X[(i + 14) & 0x0f];\n s1 = sigma1(s1);\n\n T1 = X[i & 0xf] += s0 + s1 + X[(i + 9) & 0xf];\n T1 += h + Sigma1(e) + Ch(e, f, g) + K512[i];\n T2 = Sigma0(a) + Maj(a, b, c);\n h = g;\n g = f;\n f = e;\n e = d + T1;\n d = c;\n c = b;\n b = a;\n a = T1 + T2;\n }\n\n ctx->h[0] += a;\n ctx->h[1] += b;\n ctx->h[2] += c;\n ctx->h[3] += d;\n ctx->h[4] += e;\n ctx->h[5] += f;\n ctx->h[6] += g;\n ctx->h[7] += h;\n\n W += SHA_LBLOCK;\n }\n}\n\n# else\n# define ROUND_00_15(i,a,b,c,d,e,f,g,h) do { \\\n T1 += h + Sigma1(e) + Ch(e,f,g) + K512[i]; \\\n h = Sigma0(a) + Maj(a,b,c); \\\n d += T1; h += T1; } while (0)\n\n# define ROUND_16_80(i,j,a,b,c,d,e,f,g,h,X) do { \\\n s0 = X[(j+1)&0x0f]; s0 = sigma0(s0); \\\n s1 = X[(j+14)&0x0f]; s1 = sigma1(s1); \\\n T1 = X[(j)&0x0f] += s0 + s1 + X[(j+9)&0x0f]; \\\n ROUND_00_15(i+j,a,b,c,d,e,f,g,h); } while (0)\n\nstatic void sha512_block_data_order(SHA512_CTX *ctx, const void *in,\n size_t num)\n{\n const SHA_LONG64 *W = in;\n SHA_LONG64 a, b, c, d, e, f, g, h, s0, s1, T1;\n SHA_LONG64 X[16];\n int i;\n\n while (num--) {\n\n a = ctx->h[0];\n b = ctx->h[1];\n c = ctx->h[2];\n d = ctx->h[3];\n e = ctx->h[4];\n f = ctx->h[5];\n g = ctx->h[6];\n h = ctx->h[7];\n\n# ifdef B_ENDIAN\n T1 = X[0] = W[0];\n ROUND_00_15(0, a, b, c, d, e, f, g, h);\n T1 = X[1] = W[1];\n ROUND_00_15(1, h, a, b, c, d, e, f, g);\n T1 = X[2] = W[2];\n ROUND_00_15(2, g, h, a, b, c, d, e, f);\n T1 = X[3] = W[3];\n ROUND_00_15(3, f, g, h, a, b, c, d, e);\n T1 = X[4] = W[4];\n ROUND_00_15(4, e, f, g, h, a, b, c, d);\n T1 = X[5] = W[5];\n ROUND_00_15(5, d, e, f, g, h, a, b, c);\n T1 = X[6] = W[6];\n ROUND_00_15(6, c, d, e, f, g, h, a, b);\n T1 = X[7] = W[7];\n ROUND_00_15(7, b, c, d, e, f, g, h, a);\n T1 = X[8] = W[8];\n ROUND_00_15(8, a, b, c, d, e, f, g, h);\n T1 = X[9] = W[9];\n ROUND_00_15(9, h, a, b, c, d, e, f, g);\n T1 = X[10] = W[10];\n ROUND_00_15(10, g, h, a, b, c, d, e, f);\n T1 = X[11] = W[11];\n ROUND_00_15(11, f, g, h, a, b, c, d, e);\n T1 = X[12] = W[12];\n ROUND_00_15(12, e, f, g, h, a, b, c, d);\n T1 = X[13] = W[13];\n ROUND_00_15(13, d, e, f, g, h, a, b, c);\n T1 = X[14] = W[14];\n ROUND_00_15(14, c, d, e, f, g, h, a, b);\n T1 = X[15] = W[15];\n ROUND_00_15(15, b, c, d, e, f, g, h, a);\n# else\n T1 = X[0] = PULL64(W[0]);\n ROUND_00_15(0, a, b, c, d, e, f, g, h);\n T1 = X[1] = PULL64(W[1]);\n ROUND_00_15(1, h, a, b, c, d, e, f, g);\n T1 = X[2] = PULL64(W[2]);\n ROUND_00_15(2, g, h, a, b, c, d, e, f);\n T1 = X[3] = PULL64(W[3]);\n ROUND_00_15(3, f, g, h, a, b, c, d, e);\n T1 = X[4] = PULL64(W[4]);\n ROUND_00_15(4, e, f, g, h, a, b, c, d);\n T1 = X[5] = PULL64(W[5]);\n ROUND_00_15(5, d, e, f, g, h, a, b, c);\n T1 = X[6] = PULL64(W[6]);\n ROUND_00_15(6, c, d, e, f, g, h, a, b);\n T1 = X[7] = PULL64(W[7]);\n ROUND_00_15(7, b, c, d, e, f, g, h, a);\n T1 = X[8] = PULL64(W[8]);\n ROUND_00_15(8, a, b, c, d, e, f, g, h);\n T1 = X[9] = PULL64(W[9]);\n ROUND_00_15(9, h, a, b, c, d, e, f, g);\n T1 = X[10] = PULL64(W[10]);\n ROUND_00_15(10, g, h, a, b, c, d, e, f);\n T1 = X[11] = PULL64(W[11]);\n ROUND_00_15(11, f, g, h, a, b, c, d, e);\n T1 = X[12] = PULL64(W[12]);\n ROUND_00_15(12, e, f, g, h, a, b, c, d);\n T1 = X[13] = PULL64(W[13]);\n ROUND_00_15(13, d, e, f, g, h, a, b, c);\n T1 = X[14] = PULL64(W[14]);\n ROUND_00_15(14, c, d, e, f, g, h, a, b);\n T1 = X[15] = PULL64(W[15]);\n ROUND_00_15(15, b, c, d, e, f, g, h, a);\n# endif\n\n for (i = 16; i < 80; i += 16) {\n ROUND_16_80(i, 0, a, b, c, d, e, f, g, h, X);\n ROUND_16_80(i, 1, h, a, b, c, d, e, f, g, X);\n ROUND_16_80(i, 2, g, h, a, b, c, d, e, f, X);\n ROUND_16_80(i, 3, f, g, h, a, b, c, d, e, X);\n ROUND_16_80(i, 4, e, f, g, h, a, b, c, d, X);\n ROUND_16_80(i, 5, d, e, f, g, h, a, b, c, X);\n ROUND_16_80(i, 6, c, d, e, f, g, h, a, b, X);\n ROUND_16_80(i, 7, b, c, d, e, f, g, h, a, X);\n ROUND_16_80(i, 8, a, b, c, d, e, f, g, h, X);\n ROUND_16_80(i, 9, h, a, b, c, d, e, f, g, X);\n ROUND_16_80(i, 10, g, h, a, b, c, d, e, f, X);\n ROUND_16_80(i, 11, f, g, h, a, b, c, d, e, X);\n ROUND_16_80(i, 12, e, f, g, h, a, b, c, d, X);\n ROUND_16_80(i, 13, d, e, f, g, h, a, b, c, X);\n ROUND_16_80(i, 14, c, d, e, f, g, h, a, b, X);\n ROUND_16_80(i, 15, b, c, d, e, f, g, h, a, X);\n }\n\n ctx->h[0] += a;\n ctx->h[1] += b;\n ctx->h[2] += c;\n ctx->h[3] += d;\n ctx->h[4] += e;\n ctx->h[5] += f;\n ctx->h[6] += g;\n ctx->h[7] += h;\n\n W += SHA_LBLOCK;\n }\n}\n\n# endif\n\n#endif /* SHA512_ASM */\n" }, { "path": "cryptomini/sha/sha_local.h", "content": "/*\n * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \n\n#include \n#include \n\n#define DATA_ORDER_IS_BIG_ENDIAN\n\n#define HASH_LONG SHA_LONG\n#define HASH_CTX SHA_CTX\n#define HASH_CBLOCK SHA_CBLOCK\n#define HASH_MAKE_STRING(c,s) do { \\\n unsigned long ll; \\\n ll=(c)->h0; (void)HOST_l2c(ll,(s)); \\\n ll=(c)->h1; (void)HOST_l2c(ll,(s)); \\\n ll=(c)->h2; (void)HOST_l2c(ll,(s)); \\\n ll=(c)->h3; (void)HOST_l2c(ll,(s)); \\\n ll=(c)->h4; (void)HOST_l2c(ll,(s)); \\\n } while (0)\n\n#define HASH_UPDATE SHA1_Update\n#define HASH_TRANSFORM SHA1_Transform\n#define HASH_FINAL SHA1_Final\n#define HASH_INIT SHA1_Init\n#define HASH_BLOCK_DATA_ORDER sha1_block_data_order\n#define Xupdate(a,ix,ia,ib,ic,id) ( (a)=(ia^ib^ic^id), \\\n ix=(a)=ROTATE((a),1) \\\n )\n\n#ifndef SHA1_ASM\nstatic void sha1_block_data_order(SHA_CTX *c, const void *p, size_t num);\n#else\nvoid sha1_block_data_order(SHA_CTX *c, const void *p, size_t num);\n#endif\n\n#include \"crypto/md32_common.h\"\n\n#define INIT_DATA_h0 0x67452301UL\n#define INIT_DATA_h1 0xefcdab89UL\n#define INIT_DATA_h2 0x98badcfeUL\n#define INIT_DATA_h3 0x10325476UL\n#define INIT_DATA_h4 0xc3d2e1f0UL\n\nint HASH_INIT(SHA_CTX *c)\n{\n memset(c, 0, sizeof(*c));\n c->h0 = INIT_DATA_h0;\n c->h1 = INIT_DATA_h1;\n c->h2 = INIT_DATA_h2;\n c->h3 = INIT_DATA_h3;\n c->h4 = INIT_DATA_h4;\n return 1;\n}\n\n#define K_00_19 0x5a827999UL\n#define K_20_39 0x6ed9eba1UL\n#define K_40_59 0x8f1bbcdcUL\n#define K_60_79 0xca62c1d6UL\n\n/*\n * As pointed out by Wei Dai, F() below can be simplified to the code in\n * F_00_19. Wei attributes these optimizations to Peter Gutmann's SHS code,\n * and he attributes it to Rich Schroeppel.\n * #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z)))\n * I've just become aware of another tweak to be made, again from Wei Dai,\n * in F_40_59, (x&a)|(y&a) -> (x|y)&a\n */\n#define F_00_19(b,c,d) ((((c) ^ (d)) & (b)) ^ (d))\n#define F_20_39(b,c,d) ((b) ^ (c) ^ (d))\n#define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d)))\n#define F_60_79(b,c,d) F_20_39(b,c,d)\n\n#ifndef OPENSSL_SMALL_FOOTPRINT\n\n# define BODY_00_15(i,a,b,c,d,e,f,xi) \\\n (f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \\\n (b)=ROTATE((b),30);\n\n# define BODY_16_19(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \\\n Xupdate(f,xi,xa,xb,xc,xd); \\\n (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \\\n (b)=ROTATE((b),30);\n\n# define BODY_20_31(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \\\n Xupdate(f,xi,xa,xb,xc,xd); \\\n (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \\\n (b)=ROTATE((b),30);\n\n# define BODY_32_39(i,a,b,c,d,e,f,xa,xb,xc,xd) \\\n Xupdate(f,xa,xa,xb,xc,xd); \\\n (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \\\n (b)=ROTATE((b),30);\n\n# define BODY_40_59(i,a,b,c,d,e,f,xa,xb,xc,xd) \\\n Xupdate(f,xa,xa,xb,xc,xd); \\\n (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \\\n (b)=ROTATE((b),30);\n\n# define BODY_60_79(i,a,b,c,d,e,f,xa,xb,xc,xd) \\\n Xupdate(f,xa,xa,xb,xc,xd); \\\n (f)=xa+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \\\n (b)=ROTATE((b),30);\n\n# ifdef X\n# undef X\n# endif\n# ifndef MD32_XARRAY\n /*\n * Originally X was an array. As it's automatic it's natural\n * to expect RISC compiler to accommodate at least part of it in\n * the register bank, isn't it? Unfortunately not all compilers\n * \"find\" this expectation reasonable:-( On order to make such\n * compilers generate better code I replace X[] with a bunch of\n * X0, X1, etc. See the function body below...\n */\n# define X(i) XX##i\n# else\n /*\n * However! Some compilers (most notably HP C) get overwhelmed by\n * that many local variables so that we have to have the way to\n * fall down to the original behavior.\n */\n# define X(i) XX[i]\n# endif\n\n# if !defined(SHA1_ASM)\nstatic void HASH_BLOCK_DATA_ORDER(SHA_CTX *c, const void *p, size_t num)\n{\n const unsigned char *data = p;\n register unsigned MD32_REG_T A, B, C, D, E, T, l;\n# ifndef MD32_XARRAY\n unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,\n XX8, XX9, XX10, XX11, XX12, XX13, XX14, XX15;\n# else\n SHA_LONG XX[16];\n# endif\n\n A = c->h0;\n B = c->h1;\n C = c->h2;\n D = c->h3;\n E = c->h4;\n\n for (;;) {\n const union {\n long one;\n char little;\n } is_endian = {\n 1\n };\n\n if (!is_endian.little && sizeof(SHA_LONG) == 4\n && ((size_t)p % 4) == 0) {\n const SHA_LONG *W = (const SHA_LONG *)data;\n\n X(0) = W[0];\n X(1) = W[1];\n BODY_00_15(0, A, B, C, D, E, T, X(0));\n X(2) = W[2];\n BODY_00_15(1, T, A, B, C, D, E, X(1));\n X(3) = W[3];\n BODY_00_15(2, E, T, A, B, C, D, X(2));\n X(4) = W[4];\n BODY_00_15(3, D, E, T, A, B, C, X(3));\n X(5) = W[5];\n BODY_00_15(4, C, D, E, T, A, B, X(4));\n X(6) = W[6];\n BODY_00_15(5, B, C, D, E, T, A, X(5));\n X(7) = W[7];\n BODY_00_15(6, A, B, C, D, E, T, X(6));\n X(8) = W[8];\n BODY_00_15(7, T, A, B, C, D, E, X(7));\n X(9) = W[9];\n BODY_00_15(8, E, T, A, B, C, D, X(8));\n X(10) = W[10];\n BODY_00_15(9, D, E, T, A, B, C, X(9));\n X(11) = W[11];\n BODY_00_15(10, C, D, E, T, A, B, X(10));\n X(12) = W[12];\n BODY_00_15(11, B, C, D, E, T, A, X(11));\n X(13) = W[13];\n BODY_00_15(12, A, B, C, D, E, T, X(12));\n X(14) = W[14];\n BODY_00_15(13, T, A, B, C, D, E, X(13));\n X(15) = W[15];\n BODY_00_15(14, E, T, A, B, C, D, X(14));\n BODY_00_15(15, D, E, T, A, B, C, X(15));\n\n data += SHA_CBLOCK;\n } else {\n (void)HOST_c2l(data, l);\n X(0) = l;\n (void)HOST_c2l(data, l);\n X(1) = l;\n BODY_00_15(0, A, B, C, D, E, T, X(0));\n (void)HOST_c2l(data, l);\n X(2) = l;\n BODY_00_15(1, T, A, B, C, D, E, X(1));\n (void)HOST_c2l(data, l);\n X(3) = l;\n BODY_00_15(2, E, T, A, B, C, D, X(2));\n (void)HOST_c2l(data, l);\n X(4) = l;\n BODY_00_15(3, D, E, T, A, B, C, X(3));\n (void)HOST_c2l(data, l);\n X(5) = l;\n BODY_00_15(4, C, D, E, T, A, B, X(4));\n (void)HOST_c2l(data, l);\n X(6) = l;\n BODY_00_15(5, B, C, D, E, T, A, X(5));\n (void)HOST_c2l(data, l);\n X(7) = l;\n BODY_00_15(6, A, B, C, D, E, T, X(6));\n (void)HOST_c2l(data, l);\n X(8) = l;\n BODY_00_15(7, T, A, B, C, D, E, X(7));\n (void)HOST_c2l(data, l);\n X(9) = l;\n BODY_00_15(8, E, T, A, B, C, D, X(8));\n (void)HOST_c2l(data, l);\n X(10) = l;\n BODY_00_15(9, D, E, T, A, B, C, X(9));\n (void)HOST_c2l(data, l);\n X(11) = l;\n BODY_00_15(10, C, D, E, T, A, B, X(10));\n (void)HOST_c2l(data, l);\n X(12) = l;\n BODY_00_15(11, B, C, D, E, T, A, X(11));\n (void)HOST_c2l(data, l);\n X(13) = l;\n BODY_00_15(12, A, B, C, D, E, T, X(12));\n (void)HOST_c2l(data, l);\n X(14) = l;\n BODY_00_15(13, T, A, B, C, D, E, X(13));\n (void)HOST_c2l(data, l);\n X(15) = l;\n BODY_00_15(14, E, T, A, B, C, D, X(14));\n BODY_00_15(15, D, E, T, A, B, C, X(15));\n }\n\n BODY_16_19(16, C, D, E, T, A, B, X(0), X(0), X(2), X(8), X(13));\n BODY_16_19(17, B, C, D, E, T, A, X(1), X(1), X(3), X(9), X(14));\n BODY_16_19(18, A, B, C, D, E, T, X(2), X(2), X(4), X(10), X(15));\n BODY_16_19(19, T, A, B, C, D, E, X(3), X(3), X(5), X(11), X(0));\n\n BODY_20_31(20, E, T, A, B, C, D, X(4), X(4), X(6), X(12), X(1));\n BODY_20_31(21, D, E, T, A, B, C, X(5), X(5), X(7), X(13), X(2));\n BODY_20_31(22, C, D, E, T, A, B, X(6), X(6), X(8), X(14), X(3));\n BODY_20_31(23, B, C, D, E, T, A, X(7), X(7), X(9), X(15), X(4));\n BODY_20_31(24, A, B, C, D, E, T, X(8), X(8), X(10), X(0), X(5));\n BODY_20_31(25, T, A, B, C, D, E, X(9), X(9), X(11), X(1), X(6));\n BODY_20_31(26, E, T, A, B, C, D, X(10), X(10), X(12), X(2), X(7));\n BODY_20_31(27, D, E, T, A, B, C, X(11), X(11), X(13), X(3), X(8));\n BODY_20_31(28, C, D, E, T, A, B, X(12), X(12), X(14), X(4), X(9));\n BODY_20_31(29, B, C, D, E, T, A, X(13), X(13), X(15), X(5), X(10));\n BODY_20_31(30, A, B, C, D, E, T, X(14), X(14), X(0), X(6), X(11));\n BODY_20_31(31, T, A, B, C, D, E, X(15), X(15), X(1), X(7), X(12));\n\n BODY_32_39(32, E, T, A, B, C, D, X(0), X(2), X(8), X(13));\n BODY_32_39(33, D, E, T, A, B, C, X(1), X(3), X(9), X(14));\n BODY_32_39(34, C, D, E, T, A, B, X(2), X(4), X(10), X(15));\n BODY_32_39(35, B, C, D, E, T, A, X(3), X(5), X(11), X(0));\n BODY_32_39(36, A, B, C, D, E, T, X(4), X(6), X(12), X(1));\n BODY_32_39(37, T, A, B, C, D, E, X(5), X(7), X(13), X(2));\n BODY_32_39(38, E, T, A, B, C, D, X(6), X(8), X(14), X(3));\n BODY_32_39(39, D, E, T, A, B, C, X(7), X(9), X(15), X(4));\n\n BODY_40_59(40, C, D, E, T, A, B, X(8), X(10), X(0), X(5));\n BODY_40_59(41, B, C, D, E, T, A, X(9), X(11), X(1), X(6));\n BODY_40_59(42, A, B, C, D, E, T, X(10), X(12), X(2), X(7));\n BODY_40_59(43, T, A, B, C, D, E, X(11), X(13), X(3), X(8));\n BODY_40_59(44, E, T, A, B, C, D, X(12), X(14), X(4), X(9));\n BODY_40_59(45, D, E, T, A, B, C, X(13), X(15), X(5), X(10));\n BODY_40_59(46, C, D, E, T, A, B, X(14), X(0), X(6), X(11));\n BODY_40_59(47, B, C, D, E, T, A, X(15), X(1), X(7), X(12));\n BODY_40_59(48, A, B, C, D, E, T, X(0), X(2), X(8), X(13));\n BODY_40_59(49, T, A, B, C, D, E, X(1), X(3), X(9), X(14));\n BODY_40_59(50, E, T, A, B, C, D, X(2), X(4), X(10), X(15));\n BODY_40_59(51, D, E, T, A, B, C, X(3), X(5), X(11), X(0));\n BODY_40_59(52, C, D, E, T, A, B, X(4), X(6), X(12), X(1));\n BODY_40_59(53, B, C, D, E, T, A, X(5), X(7), X(13), X(2));\n BODY_40_59(54, A, B, C, D, E, T, X(6), X(8), X(14), X(3));\n BODY_40_59(55, T, A, B, C, D, E, X(7), X(9), X(15), X(4));\n BODY_40_59(56, E, T, A, B, C, D, X(8), X(10), X(0), X(5));\n BODY_40_59(57, D, E, T, A, B, C, X(9), X(11), X(1), X(6));\n BODY_40_59(58, C, D, E, T, A, B, X(10), X(12), X(2), X(7));\n BODY_40_59(59, B, C, D, E, T, A, X(11), X(13), X(3), X(8));\n\n BODY_60_79(60, A, B, C, D, E, T, X(12), X(14), X(4), X(9));\n BODY_60_79(61, T, A, B, C, D, E, X(13), X(15), X(5), X(10));\n BODY_60_79(62, E, T, A, B, C, D, X(14), X(0), X(6), X(11));\n BODY_60_79(63, D, E, T, A, B, C, X(15), X(1), X(7), X(12));\n BODY_60_79(64, C, D, E, T, A, B, X(0), X(2), X(8), X(13));\n BODY_60_79(65, B, C, D, E, T, A, X(1), X(3), X(9), X(14));\n BODY_60_79(66, A, B, C, D, E, T, X(2), X(4), X(10), X(15));\n BODY_60_79(67, T, A, B, C, D, E, X(3), X(5), X(11), X(0));\n BODY_60_79(68, E, T, A, B, C, D, X(4), X(6), X(12), X(1));\n BODY_60_79(69, D, E, T, A, B, C, X(5), X(7), X(13), X(2));\n BODY_60_79(70, C, D, E, T, A, B, X(6), X(8), X(14), X(3));\n BODY_60_79(71, B, C, D, E, T, A, X(7), X(9), X(15), X(4));\n BODY_60_79(72, A, B, C, D, E, T, X(8), X(10), X(0), X(5));\n BODY_60_79(73, T, A, B, C, D, E, X(9), X(11), X(1), X(6));\n BODY_60_79(74, E, T, A, B, C, D, X(10), X(12), X(2), X(7));\n BODY_60_79(75, D, E, T, A, B, C, X(11), X(13), X(3), X(8));\n BODY_60_79(76, C, D, E, T, A, B, X(12), X(14), X(4), X(9));\n BODY_60_79(77, B, C, D, E, T, A, X(13), X(15), X(5), X(10));\n BODY_60_79(78, A, B, C, D, E, T, X(14), X(0), X(6), X(11));\n BODY_60_79(79, T, A, B, C, D, E, X(15), X(1), X(7), X(12));\n\n c->h0 = (c->h0 + E) & 0xffffffffL;\n c->h1 = (c->h1 + T) & 0xffffffffL;\n c->h2 = (c->h2 + A) & 0xffffffffL;\n c->h3 = (c->h3 + B) & 0xffffffffL;\n c->h4 = (c->h4 + C) & 0xffffffffL;\n\n if (--num == 0)\n break;\n\n A = c->h0;\n B = c->h1;\n C = c->h2;\n D = c->h3;\n E = c->h4;\n\n }\n}\n# endif\n\n#else /* OPENSSL_SMALL_FOOTPRINT */\n\n# define BODY_00_15(xi) do { \\\n T=E+K_00_19+F_00_19(B,C,D); \\\n E=D, D=C, C=ROTATE(B,30), B=A; \\\n A=ROTATE(A,5)+T+xi; } while(0)\n\n# define BODY_16_19(xa,xb,xc,xd) do { \\\n Xupdate(T,xa,xa,xb,xc,xd); \\\n T+=E+K_00_19+F_00_19(B,C,D); \\\n E=D, D=C, C=ROTATE(B,30), B=A; \\\n A=ROTATE(A,5)+T; } while(0)\n\n# define BODY_20_39(xa,xb,xc,xd) do { \\\n Xupdate(T,xa,xa,xb,xc,xd); \\\n T+=E+K_20_39+F_20_39(B,C,D); \\\n E=D, D=C, C=ROTATE(B,30), B=A; \\\n A=ROTATE(A,5)+T; } while(0)\n\n# define BODY_40_59(xa,xb,xc,xd) do { \\\n Xupdate(T,xa,xa,xb,xc,xd); \\\n T+=E+K_40_59+F_40_59(B,C,D); \\\n E=D, D=C, C=ROTATE(B,30), B=A; \\\n A=ROTATE(A,5)+T; } while(0)\n\n# define BODY_60_79(xa,xb,xc,xd) do { \\\n Xupdate(T,xa,xa,xb,xc,xd); \\\n T=E+K_60_79+F_60_79(B,C,D); \\\n E=D, D=C, C=ROTATE(B,30), B=A; \\\n A=ROTATE(A,5)+T+xa; } while(0)\n\n# if !defined(SHA1_ASM)\nstatic void HASH_BLOCK_DATA_ORDER(SHA_CTX *c, const void *p, size_t num)\n{\n const unsigned char *data = p;\n register unsigned MD32_REG_T A, B, C, D, E, T, l;\n int i;\n SHA_LONG X[16];\n\n A = c->h0;\n B = c->h1;\n C = c->h2;\n D = c->h3;\n E = c->h4;\n\n for (;;) {\n for (i = 0; i < 16; i++) {\n (void)HOST_c2l(data, l);\n X[i] = l;\n BODY_00_15(X[i]);\n }\n for (i = 0; i < 4; i++) {\n BODY_16_19(X[i], X[i + 2], X[i + 8], X[(i + 13) & 15]);\n }\n for (; i < 24; i++) {\n BODY_20_39(X[i & 15], X[(i + 2) & 15], X[(i + 8) & 15],\n X[(i + 13) & 15]);\n }\n for (i = 0; i < 20; i++) {\n BODY_40_59(X[(i + 8) & 15], X[(i + 10) & 15], X[i & 15],\n X[(i + 5) & 15]);\n }\n for (i = 4; i < 24; i++) {\n BODY_60_79(X[(i + 8) & 15], X[(i + 10) & 15], X[i & 15],\n X[(i + 5) & 15]);\n }\n\n c->h0 = (c->h0 + A) & 0xffffffffL;\n c->h1 = (c->h1 + B) & 0xffffffffL;\n c->h2 = (c->h2 + C) & 0xffffffffL;\n c->h3 = (c->h3 + D) & 0xffffffffL;\n c->h4 = (c->h4 + E) & 0xffffffffL;\n\n if (--num == 0)\n break;\n\n A = c->h0;\n B = c->h1;\n C = c->h2;\n D = c->h3;\n E = c->h4;\n\n }\n}\n# endif\n\n#endif\n" }, { "path": "cryptomini/threads_none.c", "content": "/*\n * Copyright 2016-2019 The OpenSSL Project Authors. All Rights Reserved.\n *\n * Licensed under the OpenSSL license (the \"License\"). You may not use\n * this file except in compliance with the License. You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.openssl.org/source/license.html\n */\n\n#include \n#include \"internal/cryptlib.h\"\n\n#if !defined(OPENSSL_THREADS) || defined(CRYPTO_TDEBUG)\n\n# if defined(OPENSSL_SYS_UNIX)\n# include \n# include \n# endif\n\nCRYPTO_RWLOCK *CRYPTO_THREAD_lock_new(void)\n{\n CRYPTO_RWLOCK *lock;\n\n if ((lock = OPENSSL_zalloc(sizeof(unsigned int))) == NULL) {\n /* Don't set error, to avoid recursion blowup. */\n return NULL;\n }\n\n *(unsigned int *)lock = 1;\n\n return lock;\n}\n\nint CRYPTO_THREAD_read_lock(CRYPTO_RWLOCK *lock)\n{\n if (!ossl_assert(*(unsigned int *)lock == 1))\n return 0;\n return 1;\n}\n\nint CRYPTO_THREAD_write_lock(CRYPTO_RWLOCK *lock)\n{\n if (!ossl_assert(*(unsigned int *)lock == 1))\n return 0;\n return 1;\n}\n\nint CRYPTO_THREAD_unlock(CRYPTO_RWLOCK *lock)\n{\n if (!ossl_assert(*(unsigned int *)lock == 1))\n return 0;\n return 1;\n}\n\nvoid CRYPTO_THREAD_lock_free(CRYPTO_RWLOCK *lock) {\n if (lock == NULL)\n return;\n\n *(unsigned int *)lock = 0;\n OPENSSL_free(lock);\n\n return;\n}\n\nint CRYPTO_THREAD_run_once(CRYPTO_ONCE *once, void (*init)(void))\n{\n if (*once != 0)\n return 1;\n\n init();\n *once = 1;\n\n return 1;\n}\n\n#define OPENSSL_CRYPTO_THREAD_LOCAL_KEY_MAX 256\n\nstatic void *thread_local_storage[OPENSSL_CRYPTO_THREAD_LOCAL_KEY_MAX];\n\nint CRYPTO_THREAD_init_local(CRYPTO_THREAD_LOCAL *key, void (*cleanup)(void *))\n{\n static unsigned int thread_local_key = 0;\n\n if (thread_local_key >= OPENSSL_CRYPTO_THREAD_LOCAL_KEY_MAX)\n return 0;\n\n *key = thread_local_key++;\n\n thread_local_storage[*key] = NULL;\n\n return 1;\n}\n\nvoid *CRYPTO_THREAD_get_local(CRYPTO_THREAD_LOCAL *key)\n{\n if (*key >= OPENSSL_CRYPTO_THREAD_LOCAL_KEY_MAX)\n return NULL;\n\n return thread_local_storage[*key];\n}\n\nint CRYPTO_THREAD_set_local(CRYPTO_THREAD_LOCAL *key, void *val)\n{\n if (*key >= OPENSSL_CRYPTO_THREAD_LOCAL_KEY_MAX)\n return 0;\n\n thread_local_storage[*key] = val;\n\n return 1;\n}\n\nint CRYPTO_THREAD_cleanup_local(CRYPTO_THREAD_LOCAL *key)\n{\n *key = OPENSSL_CRYPTO_THREAD_LOCAL_KEY_MAX + 1;\n return 1;\n}\n\nCRYPTO_THREAD_ID CRYPTO_THREAD_get_current_id(void)\n{\n return 0;\n}\n\nint CRYPTO_THREAD_compare_id(CRYPTO_THREAD_ID a, CRYPTO_THREAD_ID b)\n{\n return (a == b);\n}\n\nint CRYPTO_atomic_add(int *val, int amount, int *ret, CRYPTO_RWLOCK *lock)\n{\n *val += amount;\n *ret = *val;\n\n return 1;\n}\n\nint openssl_init_fork_handlers(void)\n{\n return 0;\n}\n\nint openssl_get_fork_id(void)\n{\n return 0;\n// # if defined(OPENSSL_SYS_UNIX)\n// return getpid();\n// # else\n// return 0;\n// # endif\n}\n#endif\n" }, { "path": "ftpm-driver/.vscode/settings.json", "content": "{\n \"files.associations\": {\n \"types.h\": \"c\",\n \"string.h\": \"c\"\n }\n}" }, { "path": "ftpm-driver/Makefile", "content": "\nDRIVER = ftpm-driver.ko\n\nifneq ($(KERNELRELEASE),)\n\tftpm-driver-y := \\\n\t\tftpm.o \\\n\t\tftpm-ioctl.o \\\n\t ftpm-sbi.o\n\tobj-m += ftpm-driver.o\n\n\n\n\nPWD := $(shell pwd)\nLINUXSRC := $(PWD)/../linuxs\n\n\n\nall:\n\t$(MAKE) -C $(LINUXSRC) ARCH=riscv CROSS_COMPILE=riscv64-unknown-linux-gnu- M=$(PWD)\n\nendif\n\nclean:\n\trm -rvf *.o *.ko *.order *.symvers *.mod.c .tmp_versions .*o.cmd\n" }, { "path": "ftpm-driver/ftpm-driver.mod", "content": "/workspace/rfTPM/ftpm-driver/ftpm.o\n/workspace/rfTPM/ftpm-driver/ftpm-ioctl.o\n/workspace/rfTPM/ftpm-driver/ftpm-sbi.o\n" }, { "path": "ftpm-driver/ftpm-ioctl.c", "content": "//******************************************************************************\n// Copyright (c) 2018, The Regents of the University of California (Regents).\n// All Rights Reserved. See LICENSE for license details.\n//------------------------------------------------------------------------------\n#include \n#include \n#include \n#include \n\n#include \"ftpm.h\"\n#include \"ftpm-sbi.h\"\n#include \"ftpm_user.h\"\n\nunsigned long ftpm_tid;\nunsigned long state_pfn;\n\nvoid *state_vaddr;\n\nstruct ftpm_cmd {\n uint32_t length;\n uint8_t buffer[];\n};\n\nint ftpm_run_command(struct tss_ftpm_context* cnx)\n{\n struct sbiret ret;\n\n ret = sbi_sm_ftpm_run_command(cnx);\n\n return 0;\n}\n\n\nlong ftpm_ioctl(struct file *filep, unsigned int cmd, unsigned long arg)\n{\n long ret;\n char data[64];\n\n size_t ioc_size;\n\n if (!arg)\n return -EINVAL;\n\n ioc_size = _IOC_SIZE(cmd);\n ioc_size = ioc_size > sizeof(data) ? sizeof(data) : ioc_size;\n\n if (copy_from_user(data, (void __user *)arg, ioc_size)) {\n return -EFAULT;\n }\n\n switch (cmd) {\n case FTPM_IOC_RUN_COMMAND:\n ret = ftpm_run_command((struct tss_ftpm_context*)data);\n break;\n\n default:\n return -ENOSYS;\n }\n\n if (copy_to_user((void __user *)arg, data, ioc_size)) {\n return -EFAULT;\n }\n\n return ret;\n}" }, { "path": "ftpm-driver/ftpm-sbi.c", "content": "#include \"ftpm-sbi.h\"\n\n#include \"ftpm_user.h\"\n\n\nstruct sbiret sbi_sm_ftpm_run_command(struct tss_ftpm_context *cnx) {\n return sbi_ecall(SBI_EXT_EXPERIMENTAL_FTPM,\n SBI_FTPM_RUN_COMMAND,\n (unsigned long) cnx, 0, 0, 0, 0, 0);\n}" }, { "path": "ftpm-driver/ftpm-sbi.h", "content": "#ifndef _FTPM_SBI_H_\n#define _FTPM_SBI_H_\n\n#include \n#include \"ftpm_user.h\"\n\n\nstruct sbiret sbi_sm_ftpm_run_command(struct tss_ftpm_context *cnx);\n#endif" }, { "path": "ftpm-driver/ftpm.c", "content": "\n#include \"ftpm.h\"\n#include \"ftpm-sbi.h\"\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#define DRV_DESCRIPTION \"ftpm\"\n#define DRV_VERSION \"1.0.0\"\n\nMODULE_DESCRIPTION(DRV_DESCRIPTION);\nMODULE_AUTHOR(\"iwangjye@gmail.com\");\nMODULE_VERSION(DRV_VERSION);\nMODULE_LICENSE(\"Dual BSD/GPL\");\n\nstatic const struct file_operations ftpm_fops = {\n .owner = THIS_MODULE,\n .unlocked_ioctl = ftpm_ioctl,\n};\n\n\nstruct miscdevice ftpm_dev = {\n .minor = MISC_DYNAMIC_MINOR,\n .name = \"ftpm\",\n .fops = &ftpm_fops,\n .mode = 0666,\n};\n\n\nstatic int __init ftpm_dev_init(void)\n{\n int ret;\n\n\n ret = misc_register(&ftpm_dev);\n if (ret < 0)\n {\n pr_err(\"[fTPM-DRIVER] misc_register() failed\\n\");\n }\n\n ftpm_dev.this_device->coherent_dma_mask = DMA_BIT_MASK(32);\n\n pr_info(\"[fTPM-DRIVER] \" DRV_DESCRIPTION \" v\" DRV_VERSION \"\\n\");\n\n return ret;\n}\n\n\nstatic void __exit ftpm_dev_exit(void)\n{\n pr_info(\"[fTPM-DRIVER] ftpm_dev_exit()\\n\");\n misc_deregister(&ftpm_dev); \n return;\n}\n\nmodule_init(ftpm_dev_init);\nmodule_exit(ftpm_dev_exit);\n" }, { "path": "ftpm-driver/ftpm.h", "content": "//******************************************************************************\n// Copyright (c) 2018, The Regents of the University of California (Regents).\n// All Rights Reserved. See LICENSE for license details.\n//------------------------------------------------------------------------------\n#ifndef _FTPM_H_\n#define _FTPM_H_\n\n\n\n\n\n\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n\n\n\n\n\n\n\n\n// /* IMPORTANT: This code assumes Sv39 */\n// // #include \"riscv64.h\"\n\n// #define PAGE_UP(addr)\t(((addr)+((PAGE_SIZE)-1))&(~((PAGE_SIZE)-1)))\n// #define MAX_COMMAND_SIZE\t\t4096\t/* maximum size of a command */\n// #define MAX_RESPONSE_SIZE\t\t4096\t/* maximum size of a response */\n\n// #define TPM_SEND_COMMAND 8\n\n// typedef uintptr_t vaddr_t;\n// typedef uintptr_t paddr_t;\n\n// extern struct miscdevice rtpm_dev;\n// extern struct rtpm_sbi_communication_t *cm;\n\n\n// int rtpm_mmap(struct file *filp, struct vm_area_struct *vma);\n// long rtpm_ioctl(struct file *filep, unsigned int cmd, unsigned long arg);\n// // ssize_t rtpm_read (struct file *, char __user *buffer, size_t length, loff_t *);\n// // ssize_t rtpm_write (struct file *, const char __user *buffer, size_t length, loff_t *);\n\n\n// // struct sbiret sbi_rtpm_tee_acquire(unsigned long tid, unsigned long addr);\n\n// int rtpm_tee_acquire(unsigned long data);\n\nlong ftpm_ioctl(struct file *filep, unsigned int cmd, unsigned long arg);\n\n#define rtpm_info(fmt, ...) \\\n pr_info(\"rtpm: \" fmt, ##__VA_ARGS__)\n#define rtpm_err(fmt, ...) \\\n pr_err(\"rtpm: \" fmt, ##__VA_ARGS__)\n#define rtpm_warn(fmt, ...) \\\n pr_warn(\"rtpm: \" fmt, ##__VA_ARGS__)\n#endif\n" }, { "path": "ftpm-driver/ftpm_user.h", "content": "\n#ifndef _FTPM_USER_H_\n#define _FTPM_USER_H_\n\n\n\n// struct rtpm_ioctl_tee_acquire {\n// unsigned long tid;\n// unsigned long pfn;\n// };\n\nstruct tss_ftpm_context {\n uintptr_t commandBuffer;\n uint32_t written;\n uintptr_t responseBuffer;\n uint32_t read;\n};\n\n\n#define SBI_EXT_EXPERIMENTAL_FTPM 0x08424b45\n#define SBI_FTPM_RUN_COMMAND 2001\n\n#define FTPM_IOC_MAGIC 0xa5\n\n\n#define FTPM_IOC_RUN_COMMAND \\\n _IOWR(FTPM_IOC_MAGIC, 0x01, struct tss_ftpm_context)\n\n#endif" }, { "path": "ftpm-driver/rtpm-controller.c", "content": "#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n\n#include \"rtpm_user.h\"\n\n#define RTPM_DEV_PATH \"/dev/utpm\"\n\n// ./rtpm-controller acquire 1 32767\n\nint main(int argc, char **argv) {\n\n char *type;\n unsigned long tid;\n unsigned long pfn = 0x80000000;\n\n struct rtpm_ioctl_tee_acquire tee_acquire;\n\n type = argv[1];\n tid = atoi(argv[2]);\n pfn = atoi(argv[3]);\n\n printf(\"[RTPM-CONTROLLER] type=%s, tid=%lx, pfn=%lx\\n\", type, tid, pfn);\n\n int fd = open(RTPM_DEV_PATH, O_RDWR);\n if (fd < 0) {\n printf(\"cannot open device file\\n\");\n return -1;\n }\n\n if (strcmp(type, \"acquire\") == 0) {\n tee_acquire.tid = tid;\n tee_acquire.pfn = pfn;\n\n if (ioctl(fd, RTPM_IOC_TEE_ACQUIRE, &tee_acquire) < 0) {\n printf(\"ioctl failed\\n\");\n return -1;\n }\n }\n\n close(fd);\n}" }, { "path": "ftpm-driver/rtpm-driver.mod", "content": "/opt/NestedTEE/enclave/vtpm/rtpm-driver/rtpm.o\n/opt/NestedTEE/enclave/vtpm/rtpm-driver/rtpm-ioctl.o\n/opt/NestedTEE/enclave/vtpm/rtpm-driver/rtpm-sbi.o\n" }, { "path": "ftpm-opensbi/.clang-format", "content": "AlignConsecutiveAssignments: true\nAlignEscapedNewlines: Left\nAlignTrailingComments: true\nAllowShortFunctionsOnASingleLine: None\nBraceWrapping:\n AfterFunction: true\nBreakBeforeBraces: Custom\nBreakStringLiterals: false\nContinuationIndentWidth: 8\nCpp11BracedListStyle: false\nIndentWidth: 8\nReflowComments: false\nSortIncludes: false\nSpacesInContainerLiterals: false\nTabWidth: 8\nUseTab: Always\n" }, { "path": "ftpm-opensbi/.gitignore", "content": "# Object files\n*.o\n*.a\n*.dep\n\n#Build & install directories\nbuild/\ninstall/\n\n# Development friendly files\ntags\ncscope*\n*.swp\n" }, { "path": "ftpm-opensbi/.vscode/settings.json", "content": "{\n \"files.associations\": {\n \"string_view\": \"c\",\n \"semihosting.h\": \"c\",\n \"fdt_helper.h\": \"c\",\n \"intercept.h\": \"c\",\n \"ff.h\": \"c\",\n \"diskio.h\": \"c\",\n \"ffconf.h\": \"c\",\n \"time.h\": \"c\",\n \"sbi_console.h\": \"c\",\n \"platform.h\": \"c\",\n \"fdt_timer.h\": \"c\",\n \"cerrno\": \"c\",\n \"aes.h\": \"c\",\n \"ftpm.h\": \"c\"\n }\n}" }, { "path": "ftpm-opensbi/CONTRIBUTORS.md", "content": "\nList of OpenSBI Contributors (Alphabetically sorted)\n====================================================\n\n* **[Western Digital Corporation](https://www.wdc.com/)**\n * Project initiator and maintainer\n * Copyright (c) 2019 Western Digital Corporation or its affiliates\n\n* Alistair Francis \n\n* Andreas Schwab \n\n* Anup Patel \n\n* Atish Patra \n\n* Bin Meng \n\n* Damien Le Moal \n\n* Karsten Merker \n\n* Nick Kossifidis \n\n* Shawn Chang \n\n* Xiang Wang \n" }, { "path": "ftpm-opensbi/COPYING.BSD", "content": "The 2-Clause BSD License\nSPDX short identifier: BSD-2-Clause\n\nCopyright (c) 2019 Western Digital Corporation or its affiliates and other\ncontributors.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n1. Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n2. Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "ftpm-opensbi/Kconfig", "content": "# SPDX-License-Identifier: BSD-2-Clause\n\nmainmenu \"OpenSBI $(OPENSBI_PLATFORM) Configuration\"\n\nconfig OPENSBI_SRC_DIR\n\tstring\n\toption env=\"OPENSBI_SRC_DIR\"\n\nconfig OPENSBI_PLATFORM\n\tstring\n\toption env=\"OPENSBI_PLATFORM\"\n\nconfig OPENSBI_PLATFORM_SRC_DIR\n\tstring\n\toption env=\"OPENSBI_PLATFORM_SRC_DIR\"\n\nmenu \"Platform Options\"\nsource \"$(OPENSBI_PLATFORM_SRC_DIR)/Kconfig\"\nendmenu\n\nsource \"$(OPENSBI_SRC_DIR)/lib/sbi/Kconfig\"\n\nsource \"$(OPENSBI_SRC_DIR)/lib/utils/Kconfig\"\n\nsource \"$(OPENSBI_SRC_DIR)/firmware/Kconfig\"\n" }, { "path": "ftpm-opensbi/ThirdPartyNotices.md", "content": "Copyright (c) 2019 Western Digital Corporation or its affiliates.\n\nThird Party Notices\n===================\n\nThis project includes or partly uses code from the following open source\nsoftware subject to the following open source licenses.\n\nlibfdt\n------\n\nCopyright (C) 2016 Free Electrons\nCopyright (C) 2016 NextThing Co.\n\nThe libfdt source code is disjunctively dual licensed (GPL-2.0+ or\nBSD-2-Clause). Some of this project code is used in OpenSBI under the terms of\nthe BSD 2-Clause license. The full text of this license can be found in the\nfile [COPYING.BSD](COPYING.BSD).\n" }, { "path": "ftpm-opensbi/docs/contributing.md", "content": "OpenSBI Contribution Guideline\n==============================\n\nAll contributions to OpenSBI can be sent in the following ways:\n1. Email patches to the OpenSBI mailing list at `opensbi@lists.infradead.org`\n2. GitHub Pull Requests (PRs) to the [OpenSBI main repository]\n\nTo join the OpenSBI mailing list, please visit the [OpenSBI infradead page].\n\nThe OpenSBI maintainers prefer patches via the OpenSBI mailing list\n(option 1 above) so that they are visible to a wider audience. All\naccepted patches on the OpenSBI mailing list will be taken by any of\nthe OpenSBI maintainers and merged into the [OpenSBI main repository]\nusing GitHub PRs.\n\nAll contributed work must follow the following rules:\n1. OpenSBI code should be written in accordance to the [Linux coding style].\n2. This project embraces the [Developer Certificate of Origin (DCO)] for\ncontributions. This means that you must agree to the following prior to\nsubmitting patches: if you agree with this developer certificate you\nacknowledge this by adding a Signed-off-by tag to your patch commit log.\nEvery submitted patch must have this tag.\n3. A commit message must have a subject line, followed by a blank line,\nfollowed by a description of the patch content. A blank line and the author\nSigned-off-by tag must follow this description.\n4. A commit subject line must start with a prefix followed by a \":\". Common\nprefixes are for example \"lib:\", \"platform:\", \"firmware:\", \"docs:\", \"utils:\"\nand \"top:\".\n5. Maintainers should use \"Rebase and Merge\" when using GitHub to merge pull\nrequests to avoid creating unnecessary merge commits.\n6. Maintainers should avoid creating branches directly in the main\nriscv/opensbi repository. Instead, prefer using a fork of the riscv/opensbi main\nrepository and branches within that fork to create pull requests.\n7. A maintainer cannot merge his own pull requests in the riscv/opensbi main\nrepository.\n8. A pull request must get at least one review from a maintainer.\n9. A pull request must spend at least 24 hours in review to allow for other\ndevelopers to review.\n\n-----------------------------------------------------------------------\n\nDeveloper Certificate of Origin\nVersion 1.1\n\nCopyright (C) 2004, 2006 The Linux Foundation and its contributors.\n660 York Street, Suite 102,\nSan Francisco, CA 94110 USA\n\nEveryone is permitted to copy and distribute verbatim copies of this\nlicense document, but changing it is not allowed.\n\n\nDeveloper's Certificate of Origin 1.1\n\nBy making a contribution to this project, I certify that:\n\n(a) The contribution was created in whole or in part by me and I\n have the right to submit it under the open source license\n indicated in the file; or\n\n(b) The contribution is based upon previous work that, to the best\n of my knowledge, is covered under an appropriate open source\n license and I have the right under that license to submit that\n work with modifications, whether created in whole or in part\n by me, under the same open source license (unless I am\n permitted to submit under a different license), as indicated\n in the file; or\n\n(c) The contribution was provided directly to me by some other\n person who certified (a), (b) or (c) and I have not modified\n it.\n\n(d) I understand and agree that this project and the contribution\n are public and that a record of the contribution (including all\n personal information I submit with it, including my sign-off) is\n maintained indefinitely and may be redistributed consistent with\n this project or the open source license(s) involved.\n\n-----------------------------------------------------------------------\n\n[OpenSBI main repository]: https://github.com/riscv/opensbi\n[OpenSBI infradead page]: http://lists.infradead.org/mailman/listinfo/opensbi\n[Linux coding style]: https://www.kernel.org/doc/html/v4.10/process/coding-style.html\n[Developer Certificate of Origin (DCO)]: http://developercertificate.org/\n" }, { "path": "ftpm-opensbi/docs/domain_support.md", "content": "OpenSBI Domain Support\n======================\n\nAn OpenSBI domain is a system-level partition (subset) of underlying hardware\nhaving its own memory regions (RAM and MMIO devices) and HARTs. The OpenSBI\nwill try to achieve secure isolation between domains using RISC-V platform\nfeatures such as PMP, ePMP, IOPMP, SiFive Shield, etc.\n\nImportant entities which help implement OpenSBI domain support are:\n\n* **struct sbi_domain_memregion** - Representation of a domain memory region\n* **struct sbi_hartmask** - Representation of domain HART set\n* **struct sbi_domain** - Representation of a domain instance\n\nEach HART of a RISC-V platform must have an OpenSBI domain assigned to it.\nThe OpenSBI platform support is responsible for populating domains and\nproviding HART id to domain mapping. The OpenSBI domain support will by\ndefault assign **the ROOT domain** to all HARTs of a RISC-V platform, so\nit is not mandatory for the OpenSBI platform support to populate domains.\n\nDomain Memory Region\n--------------------\n\nA domain memory region is represented by **struct sbi_domain_memregion** in\nOpenSBI and has following details:\n\n* **order** - The size of a memory region is **2 ^ order** where **order**\n must be **3 <= order <= __riscv_xlen**\n* **base** - The base address of a memory region is **2 ^ order**\n aligned start address\n* **flags** - The flags of a memory region represent memory type (i.e.\n RAM or MMIO) and allowed accesses (i.e. READ, WRITE, EXECUTE, etc.)\n\nDomain Instance\n---------------\n\nA domain instance is represented by **struct sbi_domain** in OpenSBI and\nhas following details:\n\n* **index** - Logical index of this domain\n* **name** - Name of this domain\n* **assigned_harts** - HARTs assigned to this domain\n* **possible_harts** - HARTs possible in this domain\n* **regions** - Array of memory regions terminated by a memory region\n with order zero\n* **boot_hartid** - HART id of the HART booting this domain. The domain\n boot HART will be started at boot-time if boot HART is possible and\n assigned for this domain.\n* **next_addr** - Address of the next booting stage for this domain\n* **next_arg1** - Arg1 (or 'a1' register) of the next booting stage for\n this domain\n* **next_mode** - Privilege mode of the next booting stage for this\n domain. This can be either S-mode or U-mode.\n* **system_reset_allowed** - Is domain allowed to reset the system?\n\nThe memory regions represented by **regions** in **struct sbi_domain** have\nfollowing additional constraints to align with RISC-V PMP requirements:\n\n* A memory region to protect OpenSBI firmware from S-mode and U-mode\n should always be present\n* For two overlapping memory regions, one should be sub-region of another\n* Two overlapping memory regions should not be of same size\n* Two overlapping memory regions cannot have same flags\n* Memory access checks on overlapping address should prefer smallest\n overlapping memory region flags.\n\nROOT Domain\n-----------\n\n**The ROOT domain** is the default OpenSBI domain which is assigned by\ndefault to all HARTs of a RISC-V platform. The OpenSBI domain support\nwill hand-craft **the ROOT domain** very early at boot-time in the\nfollowing manner:\n\n* **index** - Logical index of the ROOT domain is always zero\n* **name** - Name of the ROOT domain is \"root\"\n* **assigned_harts** - At boot-time all valid HARTs of a RISC-V platform\n are assigned the ROOT domain which changes later based on OpenSBI\n platform support\n* **possible_harts** - All valid HARTs of a RISC-V platform are possible\n HARTs of the ROOT domain\n* **regions** - Two memory regions available to the ROOT domain:\n **A)** A memory region to protect OpenSBI firmware from S-mode and U-mode\n **B)** A memory region of **order=__riscv_xlen** allowing S-mode and\n U-mode access to full memory address space\n* **boot_hartid** - Coldboot HART is the HART booting the ROOT domain\n* **next_addr** - Next booting stage address in coldboot HART scratch\n space is the next address for the ROOT domain\n* **next_arg1** - Next booting stage arg1 in coldboot HART scratch space\n is the next arg1 for the ROOT domain\n* **next_mode** - Next booting stage mode in coldboot HART scratch space\n is the next mode for the ROOT domain\n* **system_reset_allowed** - The ROOT domain is allowed to reset the system\n\nDomain Effects\n--------------\n\nFew noteworthy effects of a system partitioned into domains are as follows:\n\n* At any point in time, a HART is running in exactly one OpenSBI domain context\n* The SBI IPI and RFENCE calls from HART A are restricted to the HARTs in\n domain assigned to HART A\n* The SBI HSM calls which try to change/read state of HART B from HART A will\n only work if both HART A and HART B are assigned same domain\n* A HART running in S-mode or U-mode can only access memory based on the\n memory regions of the domain assigned to the HART\n\nDomain Device Tree Bindings\n---------------------------\n\nThe OpenSBI domains can be described in the **device tree (DT) blob** (or\nflattened device tree) passed to the OpenSBI firmwares by the previous\nbooting stage. This allows OpenSBI platform support to parse and populate\nOpenSBI domains from the device tree blob (or flattened device tree).\n\n### Domain Configuration Node\n\nAll OpenSBI domain description related DT nodes should be under the domain\nconfiguration DT node. The **/chosen** DT node is the preferred parent of\nthe domain configuration DT node.\n\nThe DT properties of a domain configuration DT node are as follows:\n\n* **compatible** (Mandatory) - The compatible string of the domain\n configuration. This DT property should have value *\"opensbi,domain,config\"*\n\n### Domain Memory Region Node\n\nThe domain memory region DT node describes details of a memory region and\ncan be pointed by multiple domain instance DT nodes. The access permissions\nof the memory region are specified separately in domain instance node.\n\nThe DT properties of a domain memory region DT node are as follows:\n\n* **compatible** (Mandatory) - The compatible string of the domain memory\n region. This DT property should have value *\"opensbi,domain,memregion\"*\n* **base** (Mandatory) - The base address of the domain memory region. This\n DT property should have a **2 ^ order** aligned 64 bit address (i.e. two\n DT cells).\n* **order** (Mandatory) - The order of the domain memory region. This DT\n property should have a 32 bit value (i.e. one DT cell) in the range\n **3 <= order <= __riscv_xlen**.\n* **mmio** (Optional) - A boolean flag representing whether the domain\n memory region is a memory-mapped I/O (MMIO) region.\n* **devices** (Optional) - The list of device DT node phandles for devices\n which fall under this domain memory region.\n\n### Domain Instance Node\n\nThe domain instance DT node describes set of possible HARTs, set of memory\nregions, and other details of a domain instance.\n\nThe DT properties of a domain instance DT node are as follows:\n\n* **compatible** (Mandatory) - The compatible string of the domain instance.\n This DT property should have value *\"opensbi,domain,instance\"*\n* **possible-harts** (Optional) - The list of CPU DT node phandles for the\n the domain instance. This list represents the possible HARTs of the\n domain instance.\n* **regions** (Optional) - The list of domain memory region DT node phandle\n and access permissions for the domain instance. Each list entry is a pair\n of DT node phandle and access permissions. The access permissions are\n represented as a 32bit bitmask having bits: **readable** (BIT[0]),\n **writeable** (BIT[1]), **executable** (BIT[2]), and **m-mode** (BIT[3]).\n* **boot-hart** (Optional) - The DT node phandle of the HART booting the\n domain instance. If coldboot HART is assigned to the domain instance then\n this DT property is ignored and the coldboot HART is assumed to be the\n boot HART of the domain instance.\n* **next-arg1** (Optional) - The 64 bit next booting stage arg1 for the\n domain instance. If this DT property is not available and coldboot HART\n is not assigned to the domain instance then **0x0** is used as default\n value. If this DT property is not available and coldboot HART is assigned\n to the domain instance then **next booting stage arg1 of coldboot HART**\n is used as default value.\n* **next-addr** (Optional) - The 64 bit next booting stage address for the\n domain instance. If this DT property is not available and coldboot HART\n is not assigned to the domain instance then **0x0** is used as default\n value. If this DT property is not available and coldboot HART is assigned\n to the domain instance then **next booting stage address of coldboot HART**\n is used as default value.\n* **next-mode** (Optional) - The 32 bit next booting stage mode for the\n domain instance. The possible values of this DT property are: **0x1**\n (s-mode), and **0x0** (u-mode). If this DT property is not available\n and coldboot HART is not assigned to the domain instance then **0x1**\n is used as default value. If this DT property is not available and\n coldboot HART is assigned to the domain instance then **next booting\n stage mode of coldboot HART** is used as default value.\n* **system-reset-allowed** (Optional) - A boolean flag representing\n whether the domain instance is allowed to do system reset.\n\n### Assigning HART To Domain Instance\n\nBy default, all HARTs are assigned to **the ROOT domain**. The OpenSBI\nplatform support can provide the HART to domain instance assignment using\nplatform specific callback.\n\nThe HART to domain instance assignment can be parsed from the device tree\nusing optional DT property **opensbi,domain** in each CPU DT node. The\nvalue of DT property **opensbi,domain** is the DT phandle of the domain\ninstance DT node. If **opensbi,domain** DT property is not specified then\ncorresponding HART is assigned to **the ROOT domain**.\n\n### Domain Configuration Only Accessible to OpenSBI\n\nThe software running inside a domain instance should only be aware of\ndevices and hardware resources accessible to itself.\n\nTo hide domain configuration from domain instances, the following should\nbe done:\n\n* The previous booting stage should preferably provide a separate device\n tree for each domain instance and mention location of device tree in\n respective domain instance DT nodes using **next-arg1** DT property.\n* If domain assigned to a HART does not have separate device tree then\n OpenSBI platform support should remove all domain configuration details\n from the device tree passed by previous booting stage before passing it\n to the next booting stage.\n\n### Example\n\n```\n chosen {\n opensbi-domains {\n compatible = \"opensbi,domain,config\";\n\n tmem: tmem {\n compatible = \"opensbi,domain,memregion\";\n base = <0x0 0x80100000>;\n order = <20>;\n };\n\n tuart: tuart {\n compatible = \"opensbi,domain,memregion\";\n base = <0x0 0x10011000>;\n order = <12>;\n mmio;\n devices = <&uart1>;\n };\n\n allmem: allmem {\n compatible = \"opensbi,domain,memregion\";\n base = <0x0 0x0>;\n order = <64>;\n };\n\n tdomain: trusted-domain {\n compatible = \"opensbi,domain,instance\";\n possible-harts = <&cpu0>;\n regions = <&tmem 0x7>, <&tuart 0x7>;\n boot-hart = <&cpu0>;\n next-arg1 = <0x0 0x0>;\n next-addr = <0x0 0x80100000>;\n next-mode = <0x0>;\n system-reset-allowed;\n };\n\n udomain: untrusted-domain {\n compatible = \"opensbi,domain,instance\";\n possible-harts = <&cpu1 &cpu2 &cpu3 &cpu4>;\n regions = <&tmem 0x0>, <&tuart 0x0>, <&allmem 0x7>;\n };\n };\n };\n\n cpus {\n #address-cells = <1>;\n #size-cells = <0>;\n timebase-frequency = <10000000>;\n\n cpu0: cpu@0 {\n device_type = \"cpu\";\n reg = <0x00>;\n compatible = \"riscv\";\n opensbi-domain = <&tdomain>;\n ...\n };\n\n cpu1: cpu@1 {\n device_type = \"cpu\";\n reg = <0x01>;\n compatible = \"riscv\";\n opensbi-domain = <&udomain>;\n ...\n };\n\n cpu2: cpu@2 {\n device_type = \"cpu\";\n reg = <0x02>;\n compatible = \"riscv\";\n opensbi-domain = <&udomain>;\n ...\n };\n\n cpu3: cpu@3 {\n device_type = \"cpu\";\n reg = <0x03>;\n compatible = \"riscv\";\n opensbi-domain = <&udomain>;\n ...\n };\n\n cpu4: cpu@4 {\n device_type = \"cpu\";\n reg = <0x04>;\n compatible = \"riscv\";\n opensbi-domain = <&udomain>;\n ...\n };\n };\n\n uart1: serial@10011000 {\n ...\n };\n```\n" }, { "path": "ftpm-opensbi/docs/doxygen.cfg", "content": "# Doxyfile 1.8.13\n\n# This file describes the settings to be used by the documentation system\n# doxygen (www.doxygen.org) for a project.\n#\n# All text after a double hash (##) is considered a comment and is placed in\n# front of the TAG it is preceding.\n#\n# All text after a single hash (#) is considered a comment and will be ignored.\n# The format is:\n# TAG = value [value, ...]\n# For lists, items can also be appended using:\n# TAG += value [value, ...]\n# Values that contain spaces should be placed between quotes (\\\" \\\").\n\n#---------------------------------------------------------------------------\n# Project related configuration options\n#---------------------------------------------------------------------------\n\n# This tag specifies the encoding used for all characters in the config file\n# that follow. The default is UTF-8 which is also the encoding used for all text\n# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv\n# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv\n# for the list of possible encodings.\n# The default value is: UTF-8.\n\nDOXYFILE_ENCODING = UTF-8\n\n# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by\n# double-quotes, unless you are using Doxywizard) that should identify the\n# project for which the documentation is generated. This name is used in the\n# title of most generated pages and in a few other places.\n# The default value is: My Project.\n\nPROJECT_NAME = \"RISC-V OpenSBI\"\n\n# The PROJECT_NUMBER tag can be used to enter a project or revision number. This\n# could be handy for archiving the generated documentation or if some version\n# control system is used.\n\nPROJECT_NUMBER = \"v@@OPENSBI_MAJOR@@.@@OPENSBI_MINOR@@\"\n\n# Using the PROJECT_BRIEF tag one can provide an optional one line description\n# for a project that appears at the top of each page and should give viewer a\n# quick idea about the purpose of the project. Keep the description short.\n\nPROJECT_BRIEF = \"Open source implemenation of the supervisor binary interface\"\n\n# With the PROJECT_LOGO tag one can specify a logo or an icon that is included\n# in the documentation. The maximum height of the logo should not exceed 55\n# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy\n# the logo to the output directory.\n\nPROJECT_LOGO = \n\n# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path\n# into which the generated documentation will be written. If a relative path is\n# entered, it will be relative to the location where doxygen was started. If\n# left blank the current directory will be used.\n\nOUTPUT_DIRECTORY = @@BUILD_DIR@@/docs\n\n# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-\n# directories (in 2 levels) under the output directory of each output format and\n# will distribute the generated files over these directories. Enabling this\n# option can be useful when feeding doxygen a huge amount of source files, where\n# putting all generated files in the same directory would otherwise causes\n# performance problems for the file system.\n# The default value is: NO.\n\nCREATE_SUBDIRS = NO\n\n# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII\n# characters to appear in the names of generated files. If set to NO, non-ASCII\n# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode\n# U+3044.\n# The default value is: NO.\n\nALLOW_UNICODE_NAMES = NO\n\n# The OUTPUT_LANGUAGE tag is used to specify the language in which all\n# documentation generated by doxygen is written. Doxygen will use this\n# information to generate all constant output in the proper language.\n# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,\n# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),\n# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,\n# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),\n# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,\n# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,\n# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,\n# Ukrainian and Vietnamese.\n# The default value is: English.\n\nOUTPUT_LANGUAGE = English\n\n# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member\n# descriptions after the members that are listed in the file and class\n# documentation (similar to Javadoc). Set to NO to disable this.\n# The default value is: YES.\n\nBRIEF_MEMBER_DESC = YES\n\n# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief\n# description of a member or function before the detailed description\n#\n# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the\n# brief descriptions will be completely suppressed.\n# The default value is: YES.\n\nREPEAT_BRIEF = YES\n\n# This tag implements a quasi-intelligent brief description abbreviator that is\n# used to form the text in various listings. Each string in this list, if found\n# as the leading text of the brief description, will be stripped from the text\n# and the result, after processing the whole list, is used as the annotated\n# text. Otherwise, the brief description is used as-is. If left blank, the\n# following values are used ($name is automatically replaced with the name of\n# the entity):The $name class, The $name widget, The $name file, is, provides,\n# specifies, contains, represents, a, an and the.\n\nABBREVIATE_BRIEF = \"The $name class\" \\\n \"The $name widget\" \\\n \"The $name file\" \\\n is \\\n provides \\\n specifies \\\n contains \\\n represents \\\n a \\\n an \\\n the\n\n# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then\n# doxygen will generate a detailed section even if there is only a brief\n# description.\n# The default value is: NO.\n\nALWAYS_DETAILED_SEC = NO\n\n# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all\n# inherited members of a class in the documentation of that class as if those\n# members were ordinary class members. Constructors, destructors and assignment\n# operators of the base classes will not be shown.\n# The default value is: NO.\n\nINLINE_INHERITED_MEMB = NO\n\n# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path\n# before files name in the file list and in the header files. If set to NO the\n# shortest path that makes the file name unique will be used\n# The default value is: YES.\n\nFULL_PATH_NAMES = YES\n\n# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.\n# Stripping is only done if one of the specified strings matches the left-hand\n# part of the path. The tag can be used to show relative paths in the file list.\n# If left blank the directory from which doxygen is run is used as the path to\n# strip.\n#\n# Note that you can specify absolute paths here, but also relative paths, which\n# will be relative from the directory where doxygen is started.\n# This tag requires that the tag FULL_PATH_NAMES is set to YES.\n\nSTRIP_FROM_PATH = \n\n# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the\n# path mentioned in the documentation of a class, which tells the reader which\n# header file to include in order to use a class. If left blank only the name of\n# the header file containing the class definition is used. Otherwise one should\n# specify the list of include paths that are normally passed to the compiler\n# using the -I flag.\n\nSTRIP_FROM_INC_PATH = \n\n# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but\n# less readable) file names. This can be useful is your file systems doesn't\n# support long names like on DOS, Mac, or CD-ROM.\n# The default value is: NO.\n\nSHORT_NAMES = NO\n\n# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the\n# first line (until the first dot) of a Javadoc-style comment as the brief\n# description. If set to NO, the Javadoc-style will behave just like regular Qt-\n# style comments (thus requiring an explicit @brief command for a brief\n# description.)\n# The default value is: NO.\n\nJAVADOC_AUTOBRIEF = NO\n\n# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first\n# line (until the first dot) of a Qt-style comment as the brief description. If\n# set to NO, the Qt-style will behave just like regular Qt-style comments (thus\n# requiring an explicit \\brief command for a brief description.)\n# The default value is: NO.\n\nQT_AUTOBRIEF = NO\n\n# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a\n# multi-line C++ special comment block (i.e. a block of //! or /// comments) as\n# a brief description. This used to be the default behavior. The new default is\n# to treat a multi-line C++ comment block as a detailed description. Set this\n# tag to YES if you prefer the old behavior instead.\n#\n# Note that setting this tag to YES also means that rational rose comments are\n# not recognized any more.\n# The default value is: NO.\n\nMULTILINE_CPP_IS_BRIEF = NO\n\n# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the\n# documentation from any documented member that it re-implements.\n# The default value is: YES.\n\nINHERIT_DOCS = YES\n\n# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new\n# page for each member. If set to NO, the documentation of a member will be part\n# of the file/class/namespace that contains it.\n# The default value is: NO.\n\nSEPARATE_MEMBER_PAGES = NO\n\n# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen\n# uses this value to replace tabs by spaces in code fragments.\n# Minimum value: 1, maximum value: 16, default value: 4.\n\nTAB_SIZE = 4\n\n# This tag can be used to specify a number of aliases that act as commands in\n# the documentation. An alias has the form:\n# name=value\n# For example adding\n# \"sideeffect=@par Side Effects:\\n\"\n# will allow you to put the command \\sideeffect (or @sideeffect) in the\n# documentation, which will result in a user-defined paragraph with heading\n# \"Side Effects:\". You can put \\n's in the value part of an alias to insert\n# newlines.\n\nALIASES = \n\n# This tag can be used to specify a number of word-keyword mappings (TCL only).\n# A mapping has the form \"name=value\". For example adding \"class=itcl::class\"\n# will allow you to use the command class in the itcl::class meaning.\n\nTCL_SUBST = \n\n# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources\n# only. Doxygen will then generate output that is more tailored for C. For\n# instance, some of the names that are used will be different. The list of all\n# members will be omitted, etc.\n# The default value is: NO.\n\nOPTIMIZE_OUTPUT_FOR_C = YES\n\n# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or\n# Python sources only. Doxygen will then generate output that is more tailored\n# for that language. For instance, namespaces will be presented as packages,\n# qualified scopes will look different, etc.\n# The default value is: NO.\n\nOPTIMIZE_OUTPUT_JAVA = NO\n\n# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran\n# sources. Doxygen will then generate output that is tailored for Fortran.\n# The default value is: NO.\n\nOPTIMIZE_FOR_FORTRAN = NO\n\n# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL\n# sources. Doxygen will then generate output that is tailored for VHDL.\n# The default value is: NO.\n\nOPTIMIZE_OUTPUT_VHDL = NO\n\n# Doxygen selects the parser to use depending on the extension of the files it\n# parses. With this tag you can assign which parser to use for a given\n# extension. Doxygen has a built-in mapping, but you can override or extend it\n# using this tag. The format is ext=language, where ext is a file extension, and\n# language is one of the parsers supported by doxygen: IDL, Java, Javascript,\n# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:\n# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:\n# Fortran. In the later case the parser tries to guess whether the code is fixed\n# or free formatted code, this is the default for Fortran type files), VHDL. For\n# instance to make doxygen treat .inc files as Fortran files (default is PHP),\n# and .f files as C (default is Fortran), use: inc=Fortran f=C.\n#\n# Note: For files without extension you can use no_extension as a placeholder.\n#\n# Note that for custom extensions you also need to set FILE_PATTERNS otherwise\n# the files are not read by doxygen.\n\nEXTENSION_MAPPING = \n\n# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments\n# according to the Markdown format, which allows for more readable\n# documentation. See http://daringfireball.net/projects/markdown/ for details.\n# The output of markdown processing is further processed by doxygen, so you can\n# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in\n# case of backward compatibilities issues.\n# The default value is: YES.\n\nMARKDOWN_SUPPORT = YES\n\n# When the TOC_INCLUDE_HEADINGS tag is set to a non-zero value, all headings up\n# to that level are automatically included in the table of contents, even if\n# they do not have an id attribute.\n# Note: This feature currently applies only to Markdown headings.\n# Minimum value: 0, maximum value: 99, default value: 0.\n# This tag requires that the tag MARKDOWN_SUPPORT is set to YES.\n\nTOC_INCLUDE_HEADINGS = 0\n\n# When enabled doxygen tries to link words that correspond to documented\n# classes, or namespaces to their corresponding documentation. Such a link can\n# be prevented in individual cases by putting a % sign in front of the word or\n# globally by setting AUTOLINK_SUPPORT to NO.\n# The default value is: YES.\n\nAUTOLINK_SUPPORT = YES\n\n# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want\n# to include (a tag file for) the STL sources as input, then you should set this\n# tag to YES in order to let doxygen match functions declarations and\n# definitions whose arguments contain STL classes (e.g. func(std::string);\n# versus func(std::string) {}). This also make the inheritance and collaboration\n# diagrams that involve STL classes more complete and accurate.\n# The default value is: NO.\n\nBUILTIN_STL_SUPPORT = NO\n\n# If you use Microsoft's C++/CLI language, you should set this option to YES to\n# enable parsing support.\n# The default value is: NO.\n\nCPP_CLI_SUPPORT = NO\n\n# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:\n# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen\n# will parse them like normal C++ but will assume all classes use public instead\n# of private inheritance when no explicit protection keyword is present.\n# The default value is: NO.\n\nSIP_SUPPORT = NO\n\n# For Microsoft's IDL there are propget and propput attributes to indicate\n# getter and setter methods for a property. Setting this option to YES will make\n# doxygen to replace the get and set methods by a property in the documentation.\n# This will only work if the methods are indeed getting or setting a simple\n# type. If this is not the case, or you want to show the methods anyway, you\n# should set this option to NO.\n# The default value is: YES.\n\nIDL_PROPERTY_SUPPORT = YES\n\n# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC\n# tag is set to YES then doxygen will reuse the documentation of the first\n# member in the group (if any) for the other members of the group. By default\n# all members of a group must be documented explicitly.\n# The default value is: NO.\n\nDISTRIBUTE_GROUP_DOC = NO\n\n# If one adds a struct or class to a group and this option is enabled, then also\n# any nested class or struct is added to the same group. By default this option\n# is disabled and one has to add nested compounds explicitly via \\ingroup.\n# The default value is: NO.\n\nGROUP_NESTED_COMPOUNDS = NO\n\n# Set the SUBGROUPING tag to YES to allow class member groups of the same type\n# (for instance a group of public functions) to be put as a subgroup of that\n# type (e.g. under the Public Functions section). Set it to NO to prevent\n# subgrouping. Alternatively, this can be done per class using the\n# \\nosubgrouping command.\n# The default value is: YES.\n\nSUBGROUPING = YES\n\n# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions\n# are shown inside the group in which they are included (e.g. using \\ingroup)\n# instead of on a separate page (for HTML and Man pages) or section (for LaTeX\n# and RTF).\n#\n# Note that this feature does not work in combination with\n# SEPARATE_MEMBER_PAGES.\n# The default value is: NO.\n\nINLINE_GROUPED_CLASSES = NO\n\n# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions\n# with only public data fields or simple typedef fields will be shown inline in\n# the documentation of the scope in which they are defined (i.e. file,\n# namespace, or group documentation), provided this scope is documented. If set\n# to NO, structs, classes, and unions are shown on a separate page (for HTML and\n# Man pages) or section (for LaTeX and RTF).\n# The default value is: NO.\n\nINLINE_SIMPLE_STRUCTS = NO\n\n# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or\n# enum is documented as struct, union, or enum with the name of the typedef. So\n# typedef struct TypeS {} TypeT, will appear in the documentation as a struct\n# with name TypeT. When disabled the typedef will appear as a member of a file,\n# namespace, or class. And the struct will be named TypeS. This can typically be\n# useful for C code in case the coding convention dictates that all compound\n# types are typedef'ed and only the typedef is referenced, never the tag name.\n# The default value is: NO.\n\nTYPEDEF_HIDES_STRUCT = NO\n\n# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This\n# cache is used to resolve symbols given their name and scope. Since this can be\n# an expensive process and often the same symbol appears multiple times in the\n# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small\n# doxygen will become slower. If the cache is too large, memory is wasted. The\n# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range\n# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536\n# symbols. At the end of a run doxygen will report the cache usage and suggest\n# the optimal cache size from a speed point of view.\n# Minimum value: 0, maximum value: 9, default value: 0.\n\nLOOKUP_CACHE_SIZE = 0\n\n#---------------------------------------------------------------------------\n# Build related configuration options\n#---------------------------------------------------------------------------\n\n# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in\n# documentation are documented, even if no documentation was available. Private\n# class members and static file members will be hidden unless the\n# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.\n# Note: This will also disable the warnings about undocumented members that are\n# normally produced when WARNINGS is set to YES.\n# The default value is: NO.\n\nEXTRACT_ALL = YES\n\n# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will\n# be included in the documentation.\n# The default value is: NO.\n\nEXTRACT_PRIVATE = NO\n\n# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal\n# scope will be included in the documentation.\n# The default value is: NO.\n\nEXTRACT_PACKAGE = NO\n\n# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be\n# included in the documentation.\n# The default value is: NO.\n\nEXTRACT_STATIC = YES\n\n# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined\n# locally in source files will be included in the documentation. If set to NO,\n# only classes defined in header files are included. Does not have any effect\n# for Java sources.\n# The default value is: YES.\n\nEXTRACT_LOCAL_CLASSES = NO\n\n# This flag is only useful for Objective-C code. If set to YES, local methods,\n# which are defined in the implementation section but not in the interface are\n# included in the documentation. If set to NO, only methods in the interface are\n# included.\n# The default value is: NO.\n\nEXTRACT_LOCAL_METHODS = NO\n\n# If this flag is set to YES, the members of anonymous namespaces will be\n# extracted and appear in the documentation as a namespace called\n# 'anonymous_namespace{file}', where file will be replaced with the base name of\n# the file that contains the anonymous namespace. By default anonymous namespace\n# are hidden.\n# The default value is: NO.\n\nEXTRACT_ANON_NSPACES = NO\n\n# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all\n# undocumented members inside documented classes or files. If set to NO these\n# members will be included in the various overviews, but no documentation\n# section is generated. This option has no effect if EXTRACT_ALL is enabled.\n# The default value is: NO.\n\nHIDE_UNDOC_MEMBERS = NO\n\n# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all\n# undocumented classes that are normally visible in the class hierarchy. If set\n# to NO, these classes will be included in the various overviews. This option\n# has no effect if EXTRACT_ALL is enabled.\n# The default value is: NO.\n\nHIDE_UNDOC_CLASSES = YES\n\n# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend\n# (class|struct|union) declarations. If set to NO, these declarations will be\n# included in the documentation.\n# The default value is: NO.\n\nHIDE_FRIEND_COMPOUNDS = YES\n\n# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any\n# documentation blocks found inside the body of a function. If set to NO, these\n# blocks will be appended to the function's detailed documentation block.\n# The default value is: NO.\n\nHIDE_IN_BODY_DOCS = NO\n\n# The INTERNAL_DOCS tag determines if documentation that is typed after a\n# \\internal command is included. If the tag is set to NO then the documentation\n# will be excluded. Set it to YES to include the internal documentation.\n# The default value is: NO.\n\nINTERNAL_DOCS = NO\n\n# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file\n# names in lower-case letters. If set to YES, upper-case letters are also\n# allowed. This is useful if you have classes or files whose names only differ\n# in case and if your file system supports case sensitive file names. Windows\n# and Mac users are advised to set this option to NO.\n# The default value is: system dependent.\n\nCASE_SENSE_NAMES = NO\n\n# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with\n# their full class and namespace scopes in the documentation. If set to YES, the\n# scope will be hidden.\n# The default value is: NO.\n\nHIDE_SCOPE_NAMES = NO\n\n# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will\n# append additional text to a page's title, such as Class Reference. If set to\n# YES the compound reference will be hidden.\n# The default value is: NO.\n\nHIDE_COMPOUND_REFERENCE= NO\n\n# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of\n# the files that are included by a file in the documentation of that file.\n# The default value is: YES.\n\nSHOW_INCLUDE_FILES = YES\n\n# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each\n# grouped member an include statement to the documentation, telling the reader\n# which file to include in order to use the member.\n# The default value is: NO.\n\nSHOW_GROUPED_MEMB_INC = NO\n\n# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include\n# files with double quotes in the documentation rather than with sharp brackets.\n# The default value is: NO.\n\nFORCE_LOCAL_INCLUDES = NO\n\n# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the\n# documentation for inline members.\n# The default value is: YES.\n\nINLINE_INFO = YES\n\n# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the\n# (detailed) documentation of file and class members alphabetically by member\n# name. If set to NO, the members will appear in declaration order.\n# The default value is: YES.\n\nSORT_MEMBER_DOCS = YES\n\n# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief\n# descriptions of file, namespace and class members alphabetically by member\n# name. If set to NO, the members will appear in declaration order. Note that\n# this will also influence the order of the classes in the class list.\n# The default value is: NO.\n\nSORT_BRIEF_DOCS = NO\n\n# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the\n# (brief and detailed) documentation of class members so that constructors and\n# destructors are listed first. If set to NO the constructors will appear in the\n# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.\n# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief\n# member documentation.\n# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting\n# detailed member documentation.\n# The default value is: NO.\n\nSORT_MEMBERS_CTORS_1ST = NO\n\n# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy\n# of group names into alphabetical order. If set to NO the group names will\n# appear in their defined order.\n# The default value is: NO.\n\nSORT_GROUP_NAMES = NO\n\n# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by\n# fully-qualified names, including namespaces. If set to NO, the class list will\n# be sorted only by class name, not including the namespace part.\n# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.\n# Note: This option applies only to the class list, not to the alphabetical\n# list.\n# The default value is: NO.\n\nSORT_BY_SCOPE_NAME = NO\n\n# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper\n# type resolution of all parameters of a function it will reject a match between\n# the prototype and the implementation of a member function even if there is\n# only one candidate or it is obvious which candidate to choose by doing a\n# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still\n# accept a match between prototype and implementation in such cases.\n# The default value is: NO.\n\nSTRICT_PROTO_MATCHING = NO\n\n# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo\n# list. This list is created by putting \\todo commands in the documentation.\n# The default value is: YES.\n\nGENERATE_TODOLIST = YES\n\n# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test\n# list. This list is created by putting \\test commands in the documentation.\n# The default value is: YES.\n\nGENERATE_TESTLIST = YES\n\n# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug\n# list. This list is created by putting \\bug commands in the documentation.\n# The default value is: YES.\n\nGENERATE_BUGLIST = YES\n\n# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)\n# the deprecated list. This list is created by putting \\deprecated commands in\n# the documentation.\n# The default value is: YES.\n\nGENERATE_DEPRECATEDLIST= YES\n\n# The ENABLED_SECTIONS tag can be used to enable conditional documentation\n# sections, marked by \\if ... \\endif and \\cond \n# ... \\endcond blocks.\n\nENABLED_SECTIONS = \n\n# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the\n# initial value of a variable or macro / define can have for it to appear in the\n# documentation. If the initializer consists of more lines than specified here\n# it will be hidden. Use a value of 0 to hide initializers completely. The\n# appearance of the value of individual variables and macros / defines can be\n# controlled using \\showinitializer or \\hideinitializer command in the\n# documentation regardless of this setting.\n# Minimum value: 0, maximum value: 10000, default value: 30.\n\nMAX_INITIALIZER_LINES = 30\n\n# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at\n# the bottom of the documentation of classes and structs. If set to YES, the\n# list will mention the files that were used to generate the documentation.\n# The default value is: YES.\n\nSHOW_USED_FILES = YES\n\n# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This\n# will remove the Files entry from the Quick Index and from the Folder Tree View\n# (if specified).\n# The default value is: YES.\n\nSHOW_FILES = YES\n\n# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces\n# page. This will remove the Namespaces entry from the Quick Index and from the\n# Folder Tree View (if specified).\n# The default value is: YES.\n\nSHOW_NAMESPACES = YES\n\n# The FILE_VERSION_FILTER tag can be used to specify a program or script that\n# doxygen should invoke to get the current version for each file (typically from\n# the version control system). Doxygen will invoke the program by executing (via\n# popen()) the command command input-file, where command is the value of the\n# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided\n# by doxygen. Whatever the program writes to standard output is used as the file\n# version. For an example see the documentation.\n\nFILE_VERSION_FILTER = \n\n# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed\n# by doxygen. The layout file controls the global structure of the generated\n# output files in an output format independent way. To create the layout file\n# that represents doxygen's defaults, run doxygen with the -l option. You can\n# optionally specify a file name after the option, if omitted DoxygenLayout.xml\n# will be used as the name of the layout file.\n#\n# Note that if you run doxygen from a directory containing a file called\n# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE\n# tag is left empty.\n\nLAYOUT_FILE = \n\n# The CITE_BIB_FILES tag can be used to specify one or more bib files containing\n# the reference definitions. This must be a list of .bib files. The .bib\n# extension is automatically appended if omitted. This requires the bibtex tool\n# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.\n# For LaTeX the style of the bibliography can be controlled using\n# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the\n# search path. See also \\cite for info how to create references.\n\nCITE_BIB_FILES = \n\n#---------------------------------------------------------------------------\n# Configuration options related to warning and progress messages\n#---------------------------------------------------------------------------\n\n# The QUIET tag can be used to turn on/off the messages that are generated to\n# standard output by doxygen. If QUIET is set to YES this implies that the\n# messages are off.\n# The default value is: NO.\n\nQUIET = NO\n\n# The WARNINGS tag can be used to turn on/off the warning messages that are\n# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES\n# this implies that the warnings are on.\n#\n# Tip: Turn warnings on while writing the documentation.\n# The default value is: YES.\n\nWARNINGS = YES\n\n# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate\n# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag\n# will automatically be disabled.\n# The default value is: YES.\n\nWARN_IF_UNDOCUMENTED = YES\n\n# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for\n# potential errors in the documentation, such as not documenting some parameters\n# in a documented function, or documenting parameters that don't exist or using\n# markup commands wrongly.\n# The default value is: YES.\n\nWARN_IF_DOC_ERROR = YES\n\n# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that\n# are documented, but have no documentation for their parameters or return\n# value. If set to NO, doxygen will only warn about wrong or incomplete\n# parameter documentation, but not about the absence of documentation.\n# The default value is: NO.\n\nWARN_NO_PARAMDOC = NO\n\n# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when\n# a warning is encountered.\n# The default value is: NO.\n\nWARN_AS_ERROR = NO\n\n# The WARN_FORMAT tag determines the format of the warning messages that doxygen\n# can produce. The string should contain the $file, $line, and $text tags, which\n# will be replaced by the file and line number from which the warning originated\n# and the warning text. Optionally the format may contain $version, which will\n# be replaced by the version of the file (if it could be obtained via\n# FILE_VERSION_FILTER)\n# The default value is: $file:$line: $text.\n\nWARN_FORMAT = \"$file:$line: $text\"\n\n# The WARN_LOGFILE tag can be used to specify a file to which warning and error\n# messages should be written. If left blank the output is written to standard\n# error (stderr).\n\nWARN_LOGFILE = \n\n#---------------------------------------------------------------------------\n# Configuration options related to the input files\n#---------------------------------------------------------------------------\n\n# The INPUT tag is used to specify the files and/or directories that contain\n# documented source files. You may enter file names like myfile.cpp or\n# directories like /usr/src/myproject. Separate the files or directories with\n# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING\n# Note: If this tag is empty the current directory is searched.\n\nINPUT = @@SRC_DIR@@/README.md \\\n @@SRC_DIR@@/docs/contributing.md \\\n @@SRC_DIR@@/docs/platform_guide.md \\\n @@SRC_DIR@@/docs/platform_requirements.md \\\n @@SRC_DIR@@/docs/library_usage.md \\\n @@SRC_DIR@@/docs/domain_support.md \\\n @@SRC_DIR@@/docs/firmware \\\n @@SRC_DIR@@/docs/platform \\\n @@SRC_DIR@@/include \\\n @@SRC_DIR@@/lib\n\n# This tag can be used to specify the character encoding of the source files\n# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses\n# libiconv (or the iconv built into libc) for the transcoding. See the libiconv\n# documentation (see: http://www.gnu.org/software/libiconv) for the list of\n# possible encodings.\n# The default value is: UTF-8.\n\nINPUT_ENCODING = UTF-8\n\n# If the value of the INPUT tag contains directories, you can use the\n# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and\n# *.h) to filter out the source-files in the directories.\n#\n# Note that for custom extensions or not directly supported extensions you also\n# need to set EXTENSION_MAPPING for the extension otherwise the files are not\n# read by doxygen.\n#\n# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,\n# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,\n# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,\n# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f95, *.f03, *.f08,\n# *.f, *.for, *.tcl, *.vhd, *.vhdl, *.ucf and *.qsf.\n\nFILE_PATTERNS = *.c \\\n *.h \\\n *.md\n\n# The RECURSIVE tag can be used to specify whether or not subdirectories should\n# be searched for input files as well.\n# The default value is: NO.\n\nRECURSIVE = YES\n\n# The EXCLUDE tag can be used to specify files and/or directories that should be\n# excluded from the INPUT source files. This way you can easily exclude a\n# subdirectory from a directory tree whose root is specified with the INPUT tag.\n#\n# Note that relative paths are relative to the directory from which doxygen is\n# run.\n\nEXCLUDE = \n\n# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or\n# directories that are symbolic links (a Unix file system feature) are excluded\n# from the input.\n# The default value is: NO.\n\nEXCLUDE_SYMLINKS = NO\n\n# If the value of the INPUT tag contains directories, you can use the\n# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude\n# certain files from those directories.\n#\n# Note that the wildcards are matched against the file with absolute path, so to\n# exclude all test directories for example use the pattern */test/*\n\nEXCLUDE_PATTERNS = \n\n# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names\n# (namespaces, classes, functions, etc.) that should be excluded from the\n# output. The symbol name can be a fully qualified name, a word, or if the\n# wildcard * is used, a substring. Examples: ANamespace, AClass,\n# AClass::ANamespace, ANamespace::*Test\n#\n# Note that the wildcards are matched against the file with absolute path, so to\n# exclude all test directories use the pattern */test/*\n\nEXCLUDE_SYMBOLS = \n\n# The EXAMPLE_PATH tag can be used to specify one or more files or directories\n# that contain example code fragments that are included (see the \\include\n# command).\n\nEXAMPLE_PATH = \n\n# If the value of the EXAMPLE_PATH tag contains directories, you can use the\n# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and\n# *.h) to filter out the source-files in the directories. If left blank all\n# files are included.\n\nEXAMPLE_PATTERNS = *\n\n# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be\n# searched for input files to be used with the \\include or \\dontinclude commands\n# irrespective of the value of the RECURSIVE tag.\n# The default value is: NO.\n\nEXAMPLE_RECURSIVE = NO\n\n# The IMAGE_PATH tag can be used to specify one or more files or directories\n# that contain images that are to be included in the documentation (see the\n# \\image command).\n\nIMAGE_PATH = \n\n# The INPUT_FILTER tag can be used to specify a program that doxygen should\n# invoke to filter for each input file. Doxygen will invoke the filter program\n# by executing (via popen()) the command:\n#\n# \n#\n# where is the value of the INPUT_FILTER tag, and is the\n# name of an input file. Doxygen will then use the output that the filter\n# program writes to standard output. If FILTER_PATTERNS is specified, this tag\n# will be ignored.\n#\n# Note that the filter must not add or remove lines; it is applied before the\n# code is scanned, but not when the output code is generated. If lines are added\n# or removed, the anchors will not be placed correctly.\n#\n# Note that for custom extensions or not directly supported extensions you also\n# need to set EXTENSION_MAPPING for the extension otherwise the files are not\n# properly processed by doxygen.\n\nINPUT_FILTER = \n\n# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern\n# basis. Doxygen will compare the file name with each pattern and apply the\n# filter if there is a match. The filters are a list of the form: pattern=filter\n# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how\n# filters are used. If the FILTER_PATTERNS tag is empty or if none of the\n# patterns match the file name, INPUT_FILTER is applied.\n#\n# Note that for custom extensions or not directly supported extensions you also\n# need to set EXTENSION_MAPPING for the extension otherwise the files are not\n# properly processed by doxygen.\n\nFILTER_PATTERNS = \n\n# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using\n# INPUT_FILTER) will also be used to filter the input files that are used for\n# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).\n# The default value is: NO.\n\nFILTER_SOURCE_FILES = NO\n\n# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file\n# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and\n# it is also possible to disable source filtering for a specific pattern using\n# *.ext= (so without naming a filter).\n# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.\n\nFILTER_SOURCE_PATTERNS = \n\n# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that\n# is part of the input, its contents will be placed on the main page\n# (index.html). This can be useful if you have a project on for instance GitHub\n# and want to reuse the introduction page also for the doxygen output.\n\nUSE_MDFILE_AS_MAINPAGE = README.md\n\n#---------------------------------------------------------------------------\n# Configuration options related to source browsing\n#---------------------------------------------------------------------------\n\n# If the SOURCE_BROWSER tag is set to YES then a list of source files will be\n# generated. Documented entities will be cross-referenced with these sources.\n#\n# Note: To get rid of all source code in the generated output, make sure that\n# also VERBATIM_HEADERS is set to NO.\n# The default value is: NO.\n\nSOURCE_BROWSER = NO\n\n# Setting the INLINE_SOURCES tag to YES will include the body of functions,\n# classes and enums directly into the documentation.\n# The default value is: NO.\n\nINLINE_SOURCES = NO\n\n# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any\n# special comment blocks from generated source code fragments. Normal C, C++ and\n# Fortran comments will always remain visible.\n# The default value is: YES.\n\nSTRIP_CODE_COMMENTS = YES\n\n# If the REFERENCED_BY_RELATION tag is set to YES then for each documented\n# function all documented functions referencing it will be listed.\n# The default value is: NO.\n\nREFERENCED_BY_RELATION = NO\n\n# If the REFERENCES_RELATION tag is set to YES then for each documented function\n# all documented entities called/used by that function will be listed.\n# The default value is: NO.\n\nREFERENCES_RELATION = NO\n\n# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set\n# to YES then the hyperlinks from functions in REFERENCES_RELATION and\n# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will\n# link to the documentation.\n# The default value is: YES.\n\nREFERENCES_LINK_SOURCE = YES\n\n# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the\n# source code will show a tooltip with additional information such as prototype,\n# brief description and links to the definition and documentation. Since this\n# will make the HTML file larger and loading of large files a bit slower, you\n# can opt to disable this feature.\n# The default value is: YES.\n# This tag requires that the tag SOURCE_BROWSER is set to YES.\n\nSOURCE_TOOLTIPS = YES\n\n# If the USE_HTAGS tag is set to YES then the references to source code will\n# point to the HTML generated by the htags(1) tool instead of doxygen built-in\n# source browser. The htags tool is part of GNU's global source tagging system\n# (see http://www.gnu.org/software/global/global.html). You will need version\n# 4.8.6 or higher.\n#\n# To use it do the following:\n# - Install the latest version of global\n# - Enable SOURCE_BROWSER and USE_HTAGS in the config file\n# - Make sure the INPUT points to the root of the source tree\n# - Run doxygen as normal\n#\n# Doxygen will invoke htags (and that will in turn invoke gtags), so these\n# tools must be available from the command line (i.e. in the search path).\n#\n# The result: instead of the source browser generated by doxygen, the links to\n# source code will now point to the output of htags.\n# The default value is: NO.\n# This tag requires that the tag SOURCE_BROWSER is set to YES.\n\nUSE_HTAGS = NO\n\n# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a\n# verbatim copy of the header file for each class for which an include is\n# specified. Set to NO to disable this.\n# See also: Section \\class.\n# The default value is: YES.\n\nVERBATIM_HEADERS = YES\n\n# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the\n# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the\n# cost of reduced performance. This can be particularly helpful with template\n# rich C++ code for which doxygen's built-in parser lacks the necessary type\n# information.\n# Note: The availability of this option depends on whether or not doxygen was\n# generated with the -Duse-libclang=ON option for CMake.\n# The default value is: NO.\n\nCLANG_ASSISTED_PARSING = NO\n\n# If clang assisted parsing is enabled you can provide the compiler with command\n# line options that you would normally use when invoking the compiler. Note that\n# the include paths will already be set by doxygen for the files and directories\n# specified with INPUT and INCLUDE_PATH.\n# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.\n\nCLANG_OPTIONS = \n\n#---------------------------------------------------------------------------\n# Configuration options related to the alphabetical class index\n#---------------------------------------------------------------------------\n\n# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all\n# compounds will be generated. Enable this if the project contains a lot of\n# classes, structs, unions or interfaces.\n# The default value is: YES.\n\nALPHABETICAL_INDEX = YES\n\n# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in\n# which the alphabetical index list will be split.\n# Minimum value: 1, maximum value: 20, default value: 5.\n# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.\n\nCOLS_IN_ALPHA_INDEX = 5\n\n# In case all classes in a project start with a common prefix, all classes will\n# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag\n# can be used to specify a prefix (or a list of prefixes) that should be ignored\n# while generating the index headers.\n# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.\n\nIGNORE_PREFIX = \n\n#---------------------------------------------------------------------------\n# Configuration options related to the HTML output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output\n# The default value is: YES.\n\nGENERATE_HTML = YES\n\n# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it.\n# The default directory is: html.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_OUTPUT = html\n\n# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each\n# generated HTML page (for example: .htm, .php, .asp).\n# The default value is: .html.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_FILE_EXTENSION = .html\n\n# The HTML_HEADER tag can be used to specify a user-defined HTML header file for\n# each generated HTML page. If the tag is left blank doxygen will generate a\n# standard header.\n#\n# To get valid HTML the header file that includes any scripts and style sheets\n# that doxygen needs, which is dependent on the configuration options used (e.g.\n# the setting GENERATE_TREEVIEW). It is highly recommended to start with a\n# default header using\n# doxygen -w html new_header.html new_footer.html new_stylesheet.css\n# YourConfigFile\n# and then modify the file new_header.html. See also section \"Doxygen usage\"\n# for information on how to generate the default header that doxygen normally\n# uses.\n# Note: The header is subject to change so you typically have to regenerate the\n# default header when upgrading to a newer version of doxygen. For a description\n# of the possible markers and block names see the documentation.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_HEADER = \n\n# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each\n# generated HTML page. If the tag is left blank doxygen will generate a standard\n# footer. See HTML_HEADER for more information on how to generate a default\n# footer and what special commands can be used inside the footer. See also\n# section \"Doxygen usage\" for information on how to generate the default footer\n# that doxygen normally uses.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_FOOTER = \n\n# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style\n# sheet that is used by each HTML page. It can be used to fine-tune the look of\n# the HTML output. If left blank doxygen will generate a default style sheet.\n# See also section \"Doxygen usage\" for information on how to generate the style\n# sheet that doxygen normally uses.\n# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as\n# it is more robust and this tag (HTML_STYLESHEET) will in the future become\n# obsolete.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_STYLESHEET = \n\n# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined\n# cascading style sheets that are included after the standard style sheets\n# created by doxygen. Using this option one can overrule certain style aspects.\n# This is preferred over using HTML_STYLESHEET since it does not replace the\n# standard style sheet and is therefore more robust against future updates.\n# Doxygen will copy the style sheet files to the output directory.\n# Note: The order of the extra style sheet files is of importance (e.g. the last\n# style sheet in the list overrules the setting of the previous ones in the\n# list). For an example see the documentation.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_EXTRA_STYLESHEET = \n\n# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or\n# other source files which should be copied to the HTML output directory. Note\n# that these files will be copied to the base HTML output directory. Use the\n# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these\n# files. In the HTML_STYLESHEET file, use the file name only. Also note that the\n# files will be copied as-is; there are no commands or markers available.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_EXTRA_FILES = \n\n# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen\n# will adjust the colors in the style sheet and background images according to\n# this color. Hue is specified as an angle on a colorwheel, see\n# http://en.wikipedia.org/wiki/Hue for more information. For instance the value\n# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300\n# purple, and 360 is red again.\n# Minimum value: 0, maximum value: 359, default value: 220.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_COLORSTYLE_HUE = 220\n\n# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors\n# in the HTML output. For a value of 0 the output will use grayscales only. A\n# value of 255 will produce the most vivid colors.\n# Minimum value: 0, maximum value: 255, default value: 100.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_COLORSTYLE_SAT = 100\n\n# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the\n# luminance component of the colors in the HTML output. Values below 100\n# gradually make the output lighter, whereas values above 100 make the output\n# darker. The value divided by 100 is the actual gamma applied, so 80 represents\n# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not\n# change the gamma.\n# Minimum value: 40, maximum value: 240, default value: 80.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_COLORSTYLE_GAMMA = 80\n\n# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML\n# page will contain the date and time when the page was generated. Setting this\n# to YES can help to show when doxygen was last run and thus if the\n# documentation is up to date.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_TIMESTAMP = NO\n\n# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML\n# documentation will contain sections that can be hidden and shown after the\n# page has loaded.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_DYNAMIC_SECTIONS = NO\n\n# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries\n# shown in the various tree structured indices initially; the user can expand\n# and collapse entries dynamically later on. Doxygen will expand the tree to\n# such a level that at most the specified number of entries are visible (unless\n# a fully collapsed tree already exceeds this amount). So setting the number of\n# entries 1 will produce a full collapsed tree by default. 0 is a special value\n# representing an infinite number of entries and will result in a full expanded\n# tree by default.\n# Minimum value: 0, maximum value: 9999, default value: 100.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_INDEX_NUM_ENTRIES = 100\n\n# If the GENERATE_DOCSET tag is set to YES, additional index files will be\n# generated that can be used as input for Apple's Xcode 3 integrated development\n# environment (see: http://developer.apple.com/tools/xcode/), introduced with\n# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a\n# Makefile in the HTML output directory. Running make will produce the docset in\n# that directory and running make install will install the docset in\n# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at\n# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html\n# for more information.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_DOCSET = NO\n\n# This tag determines the name of the docset feed. A documentation feed provides\n# an umbrella under which multiple documentation sets from a single provider\n# (such as a company or product suite) can be grouped.\n# The default value is: Doxygen generated docs.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_FEEDNAME = \"Doxygen generated docs\"\n\n# This tag specifies a string that should uniquely identify the documentation\n# set bundle. This should be a reverse domain-name style string, e.g.\n# com.mycompany.MyDocSet. Doxygen will append .docset to the name.\n# The default value is: org.doxygen.Project.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_BUNDLE_ID = org.doxygen.Project\n\n# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify\n# the documentation publisher. This should be a reverse domain-name style\n# string, e.g. com.mycompany.MyDocSet.documentation.\n# The default value is: org.doxygen.Publisher.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_PUBLISHER_ID = org.doxygen.Publisher\n\n# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.\n# The default value is: Publisher.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_PUBLISHER_NAME = Publisher\n\n# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three\n# additional HTML index files: index.hhp, index.hhc, and index.hhk. The\n# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop\n# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on\n# Windows.\n#\n# The HTML Help Workshop contains a compiler that can convert all HTML output\n# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML\n# files are now used as the Windows 98 help format, and will replace the old\n# Windows help format (.hlp) on all Windows platforms in the future. Compressed\n# HTML files also contain an index, a table of contents, and you can search for\n# words in the documentation. The HTML workshop also contains a viewer for\n# compressed HTML files.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_HTMLHELP = NO\n\n# The CHM_FILE tag can be used to specify the file name of the resulting .chm\n# file. You can add a path in front of the file if the result should not be\n# written to the html output directory.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nCHM_FILE = \n\n# The HHC_LOCATION tag can be used to specify the location (absolute path\n# including file name) of the HTML help compiler (hhc.exe). If non-empty,\n# doxygen will try to run the HTML help compiler on the generated index.hhp.\n# The file has to be specified with full path.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nHHC_LOCATION = \n\n# The GENERATE_CHI flag controls if a separate .chi index file is generated\n# (YES) or that it should be included in the master .chm file (NO).\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nGENERATE_CHI = NO\n\n# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)\n# and project file content.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nCHM_INDEX_ENCODING = \n\n# The BINARY_TOC flag controls whether a binary table of contents is generated\n# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it\n# enables the Previous and Next buttons.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nBINARY_TOC = NO\n\n# The TOC_EXPAND flag can be set to YES to add extra items for group members to\n# the table of contents of the HTML help documentation and to the tree view.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nTOC_EXPAND = NO\n\n# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and\n# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that\n# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help\n# (.qch) of the generated HTML documentation.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_QHP = NO\n\n# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify\n# the file name of the resulting .qch file. The path specified is relative to\n# the HTML output folder.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQCH_FILE = \n\n# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help\n# Project output. For more information please see Qt Help Project / Namespace\n# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).\n# The default value is: org.doxygen.Project.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_NAMESPACE = org.doxygen.Project\n\n# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt\n# Help Project output. For more information please see Qt Help Project / Virtual\n# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-\n# folders).\n# The default value is: doc.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_VIRTUAL_FOLDER = doc\n\n# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom\n# filter to add. For more information please see Qt Help Project / Custom\n# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-\n# filters).\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_CUST_FILTER_NAME = \n\n# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the\n# custom filter to add. For more information please see Qt Help Project / Custom\n# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-\n# filters).\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_CUST_FILTER_ATTRS = \n\n# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this\n# project's filter section matches. Qt Help Project / Filter Attributes (see:\n# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_SECT_FILTER_ATTRS = \n\n# The QHG_LOCATION tag can be used to specify the location of Qt's\n# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the\n# generated .qhp file.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHG_LOCATION = \n\n# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be\n# generated, together with the HTML files, they form an Eclipse help plugin. To\n# install this plugin and make it available under the help contents menu in\n# Eclipse, the contents of the directory containing the HTML and XML files needs\n# to be copied into the plugins directory of eclipse. The name of the directory\n# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.\n# After copying Eclipse needs to be restarted before the help appears.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_ECLIPSEHELP = NO\n\n# A unique identifier for the Eclipse help plugin. When installing the plugin\n# the directory name containing the HTML and XML files should also have this\n# name. Each documentation set should have its own identifier.\n# The default value is: org.doxygen.Project.\n# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.\n\nECLIPSE_DOC_ID = org.doxygen.Project\n\n# If you want full control over the layout of the generated HTML pages it might\n# be necessary to disable the index and replace it with your own. The\n# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top\n# of each HTML page. A value of NO enables the index and the value YES disables\n# it. Since the tabs in the index contain the same information as the navigation\n# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nDISABLE_INDEX = NO\n\n# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index\n# structure should be generated to display hierarchical information. If the tag\n# value is set to YES, a side panel will be generated containing a tree-like\n# index structure (just like the one that is generated for HTML Help). For this\n# to work a browser that supports JavaScript, DHTML, CSS and frames is required\n# (i.e. any modern browser). Windows users are probably better off using the\n# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can\n# further fine-tune the look of the index. As an example, the default style\n# sheet generated by doxygen has an example that shows how to put an image at\n# the root of the tree instead of the PROJECT_NAME. Since the tree basically has\n# the same information as the tab index, you could consider setting\n# DISABLE_INDEX to YES when enabling this option.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_TREEVIEW = YES\n\n# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that\n# doxygen will group on one line in the generated HTML documentation.\n#\n# Note that a value of 0 will completely suppress the enum values from appearing\n# in the overview section.\n# Minimum value: 0, maximum value: 20, default value: 4.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nENUM_VALUES_PER_LINE = 4\n\n# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used\n# to set the initial width (in pixels) of the frame in which the tree is shown.\n# Minimum value: 0, maximum value: 1500, default value: 250.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nTREEVIEW_WIDTH = 250\n\n# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to\n# external symbols imported via tag files in a separate window.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nEXT_LINKS_IN_WINDOW = NO\n\n# Use this tag to change the font size of LaTeX formulas included as images in\n# the HTML documentation. When you change the font size after a successful\n# doxygen run you need to manually remove any form_*.png images from the HTML\n# output directory to force them to be regenerated.\n# Minimum value: 8, maximum value: 50, default value: 10.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nFORMULA_FONTSIZE = 10\n\n# Use the FORMULA_TRANPARENT tag to determine whether or not the images\n# generated for formulas are transparent PNGs. Transparent PNGs are not\n# supported properly for IE 6.0, but are supported on all modern browsers.\n#\n# Note that when changing this option you need to delete any form_*.png files in\n# the HTML output directory before the changes have effect.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nFORMULA_TRANSPARENT = YES\n\n# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see\n# http://www.mathjax.org) which uses client side Javascript for the rendering\n# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX\n# installed or if you want to formulas look prettier in the HTML output. When\n# enabled you may also need to install MathJax separately and configure the path\n# to it using the MATHJAX_RELPATH option.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nUSE_MATHJAX = NO\n\n# When MathJax is enabled you can set the default output format to be used for\n# the MathJax output. See the MathJax site (see:\n# http://docs.mathjax.org/en/latest/output.html) for more details.\n# Possible values are: HTML-CSS (which is slower, but has the best\n# compatibility), NativeMML (i.e. MathML) and SVG.\n# The default value is: HTML-CSS.\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_FORMAT = HTML-CSS\n\n# When MathJax is enabled you need to specify the location relative to the HTML\n# output directory using the MATHJAX_RELPATH option. The destination directory\n# should contain the MathJax.js script. For instance, if the mathjax directory\n# is located at the same level as the HTML output directory, then\n# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax\n# Content Delivery Network so you can quickly see the result without installing\n# MathJax. However, it is strongly recommended to install a local copy of\n# MathJax from http://www.mathjax.org before deployment.\n# The default value is: http://cdn.mathjax.org/mathjax/latest.\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_RELPATH = http://cdn.mathjax.org/mathjax/latest\n\n# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax\n# extension names that should be enabled during MathJax rendering. For example\n# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_EXTENSIONS = \n\n# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces\n# of code that will be used on startup of the MathJax code. See the MathJax site\n# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an\n# example see the documentation.\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_CODEFILE = \n\n# When the SEARCHENGINE tag is enabled doxygen will generate a search box for\n# the HTML output. The underlying search engine uses javascript and DHTML and\n# should work on any modern browser. Note that when using HTML help\n# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)\n# there is already a search function so this one should typically be disabled.\n# For large projects the javascript based search engine can be slow, then\n# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to\n# search using the keyboard; to jump to the search box use + S\n# (what the is depends on the OS and browser, but it is typically\n# , /