197447ea4SJohn-Mark Gurney /*- 297447ea4SJohn-Mark Gurney * Copyright 2005 Colin Percival 397447ea4SJohn-Mark Gurney * All rights reserved. 497447ea4SJohn-Mark Gurney * 597447ea4SJohn-Mark Gurney * Redistribution and use in source and binary forms, with or without 697447ea4SJohn-Mark Gurney * modification, are permitted provided that the following conditions 797447ea4SJohn-Mark Gurney * are met: 897447ea4SJohn-Mark Gurney * 1. Redistributions of source code must retain the above copyright 997447ea4SJohn-Mark Gurney * notice, this list of conditions and the following disclaimer. 1097447ea4SJohn-Mark Gurney * 2. Redistributions in binary form must reproduce the above copyright 1197447ea4SJohn-Mark Gurney * notice, this list of conditions and the following disclaimer in the 1297447ea4SJohn-Mark Gurney * documentation and/or other materials provided with the distribution. 1397447ea4SJohn-Mark Gurney * 1497447ea4SJohn-Mark Gurney * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 1597447ea4SJohn-Mark Gurney * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 1697447ea4SJohn-Mark Gurney * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 1797447ea4SJohn-Mark Gurney * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 1897447ea4SJohn-Mark Gurney * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 1997447ea4SJohn-Mark Gurney * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 2097447ea4SJohn-Mark Gurney * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 2197447ea4SJohn-Mark Gurney * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 2297447ea4SJohn-Mark Gurney * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 2397447ea4SJohn-Mark Gurney * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 2497447ea4SJohn-Mark Gurney * SUCH DAMAGE. 2597447ea4SJohn-Mark Gurney */ 2697447ea4SJohn-Mark Gurney 2797447ea4SJohn-Mark Gurney #include <sys/cdefs.h> 2897447ea4SJohn-Mark Gurney __FBSDID("$FreeBSD$"); 2997447ea4SJohn-Mark Gurney 3097447ea4SJohn-Mark Gurney #include <sys/endian.h> 3197447ea4SJohn-Mark Gurney #include <sys/types.h> 3297447ea4SJohn-Mark Gurney 338083f14fSJohn-Mark Gurney #ifdef _KERNEL 348083f14fSJohn-Mark Gurney #include <sys/systm.h> 358083f14fSJohn-Mark Gurney #else 3697447ea4SJohn-Mark Gurney #include <string.h> 378083f14fSJohn-Mark Gurney #endif 3897447ea4SJohn-Mark Gurney 3997447ea4SJohn-Mark Gurney #include "sha256.h" 4097447ea4SJohn-Mark Gurney 4197447ea4SJohn-Mark Gurney #if BYTE_ORDER == BIG_ENDIAN 4297447ea4SJohn-Mark Gurney 4397447ea4SJohn-Mark Gurney /* Copy a vector of big-endian uint32_t into a vector of bytes */ 4497447ea4SJohn-Mark Gurney #define be32enc_vect(dst, src, len) \ 4597447ea4SJohn-Mark Gurney memcpy((void *)dst, (const void *)src, (size_t)len) 4697447ea4SJohn-Mark Gurney 4797447ea4SJohn-Mark Gurney /* Copy a vector of bytes into a vector of big-endian uint32_t */ 4897447ea4SJohn-Mark Gurney #define be32dec_vect(dst, src, len) \ 4997447ea4SJohn-Mark Gurney memcpy((void *)dst, (const void *)src, (size_t)len) 5097447ea4SJohn-Mark Gurney 5197447ea4SJohn-Mark Gurney #else /* BYTE_ORDER != BIG_ENDIAN */ 5297447ea4SJohn-Mark Gurney 5397447ea4SJohn-Mark Gurney /* 5497447ea4SJohn-Mark Gurney * Encode a length len/4 vector of (uint32_t) into a length len vector of 5597447ea4SJohn-Mark Gurney * (unsigned char) in big-endian form. Assumes len is a multiple of 4. 5697447ea4SJohn-Mark Gurney */ 5797447ea4SJohn-Mark Gurney static void 5897447ea4SJohn-Mark Gurney be32enc_vect(unsigned char *dst, const uint32_t *src, size_t len) 5997447ea4SJohn-Mark Gurney { 6097447ea4SJohn-Mark Gurney size_t i; 6197447ea4SJohn-Mark Gurney 6297447ea4SJohn-Mark Gurney for (i = 0; i < len / 4; i++) 6397447ea4SJohn-Mark Gurney be32enc(dst + i * 4, src[i]); 6497447ea4SJohn-Mark Gurney } 6597447ea4SJohn-Mark Gurney 6697447ea4SJohn-Mark Gurney /* 6797447ea4SJohn-Mark Gurney * Decode a big-endian length len vector of (unsigned char) into a length 6897447ea4SJohn-Mark Gurney * len/4 vector of (uint32_t). Assumes len is a multiple of 4. 6997447ea4SJohn-Mark Gurney */ 7097447ea4SJohn-Mark Gurney static void 7197447ea4SJohn-Mark Gurney be32dec_vect(uint32_t *dst, const unsigned char *src, size_t len) 7297447ea4SJohn-Mark Gurney { 7397447ea4SJohn-Mark Gurney size_t i; 7497447ea4SJohn-Mark Gurney 7597447ea4SJohn-Mark Gurney for (i = 0; i < len / 4; i++) 7697447ea4SJohn-Mark Gurney dst[i] = be32dec(src + i * 4); 7797447ea4SJohn-Mark Gurney } 7897447ea4SJohn-Mark Gurney 7997447ea4SJohn-Mark Gurney #endif /* BYTE_ORDER != BIG_ENDIAN */ 8097447ea4SJohn-Mark Gurney 8197447ea4SJohn-Mark Gurney /* Elementary functions used by SHA256 */ 8297447ea4SJohn-Mark Gurney #define Ch(x, y, z) ((x & (y ^ z)) ^ z) 8397447ea4SJohn-Mark Gurney #define Maj(x, y, z) ((x & (y | z)) | (y & z)) 8497447ea4SJohn-Mark Gurney #define SHR(x, n) (x >> n) 8597447ea4SJohn-Mark Gurney #define ROTR(x, n) ((x >> n) | (x << (32 - n))) 8697447ea4SJohn-Mark Gurney #define S0(x) (ROTR(x, 2) ^ ROTR(x, 13) ^ ROTR(x, 22)) 8797447ea4SJohn-Mark Gurney #define S1(x) (ROTR(x, 6) ^ ROTR(x, 11) ^ ROTR(x, 25)) 8897447ea4SJohn-Mark Gurney #define s0(x) (ROTR(x, 7) ^ ROTR(x, 18) ^ SHR(x, 3)) 8997447ea4SJohn-Mark Gurney #define s1(x) (ROTR(x, 17) ^ ROTR(x, 19) ^ SHR(x, 10)) 9097447ea4SJohn-Mark Gurney 9197447ea4SJohn-Mark Gurney /* SHA256 round function */ 9297447ea4SJohn-Mark Gurney #define RND(a, b, c, d, e, f, g, h, k) \ 9397447ea4SJohn-Mark Gurney t0 = h + S1(e) + Ch(e, f, g) + k; \ 9497447ea4SJohn-Mark Gurney t1 = S0(a) + Maj(a, b, c); \ 9597447ea4SJohn-Mark Gurney d += t0; \ 9697447ea4SJohn-Mark Gurney h = t0 + t1; 9797447ea4SJohn-Mark Gurney 9897447ea4SJohn-Mark Gurney /* Adjusted round function for rotating state */ 9997447ea4SJohn-Mark Gurney #define RNDr(S, W, i, k) \ 10097447ea4SJohn-Mark Gurney RND(S[(64 - i) % 8], S[(65 - i) % 8], \ 10197447ea4SJohn-Mark Gurney S[(66 - i) % 8], S[(67 - i) % 8], \ 10297447ea4SJohn-Mark Gurney S[(68 - i) % 8], S[(69 - i) % 8], \ 10397447ea4SJohn-Mark Gurney S[(70 - i) % 8], S[(71 - i) % 8], \ 10497447ea4SJohn-Mark Gurney W[i] + k) 10597447ea4SJohn-Mark Gurney 10697447ea4SJohn-Mark Gurney /* 10797447ea4SJohn-Mark Gurney * SHA256 block compression function. The 256-bit state is transformed via 10897447ea4SJohn-Mark Gurney * the 512-bit input block to produce a new state. 10997447ea4SJohn-Mark Gurney */ 11097447ea4SJohn-Mark Gurney static void 11197447ea4SJohn-Mark Gurney SHA256_Transform(uint32_t * state, const unsigned char block[64]) 11297447ea4SJohn-Mark Gurney { 11397447ea4SJohn-Mark Gurney uint32_t W[64]; 11497447ea4SJohn-Mark Gurney uint32_t S[8]; 11597447ea4SJohn-Mark Gurney uint32_t t0, t1; 11697447ea4SJohn-Mark Gurney int i; 11797447ea4SJohn-Mark Gurney 11897447ea4SJohn-Mark Gurney /* 1. Prepare message schedule W. */ 11997447ea4SJohn-Mark Gurney be32dec_vect(W, block, 64); 12097447ea4SJohn-Mark Gurney for (i = 16; i < 64; i++) 12197447ea4SJohn-Mark Gurney W[i] = s1(W[i - 2]) + W[i - 7] + s0(W[i - 15]) + W[i - 16]; 12297447ea4SJohn-Mark Gurney 12397447ea4SJohn-Mark Gurney /* 2. Initialize working variables. */ 12497447ea4SJohn-Mark Gurney memcpy(S, state, 32); 12597447ea4SJohn-Mark Gurney 12697447ea4SJohn-Mark Gurney /* 3. Mix. */ 12797447ea4SJohn-Mark Gurney RNDr(S, W, 0, 0x428a2f98); 12897447ea4SJohn-Mark Gurney RNDr(S, W, 1, 0x71374491); 12997447ea4SJohn-Mark Gurney RNDr(S, W, 2, 0xb5c0fbcf); 13097447ea4SJohn-Mark Gurney RNDr(S, W, 3, 0xe9b5dba5); 13197447ea4SJohn-Mark Gurney RNDr(S, W, 4, 0x3956c25b); 13297447ea4SJohn-Mark Gurney RNDr(S, W, 5, 0x59f111f1); 13397447ea4SJohn-Mark Gurney RNDr(S, W, 6, 0x923f82a4); 13497447ea4SJohn-Mark Gurney RNDr(S, W, 7, 0xab1c5ed5); 13597447ea4SJohn-Mark Gurney RNDr(S, W, 8, 0xd807aa98); 13697447ea4SJohn-Mark Gurney RNDr(S, W, 9, 0x12835b01); 13797447ea4SJohn-Mark Gurney RNDr(S, W, 10, 0x243185be); 13897447ea4SJohn-Mark Gurney RNDr(S, W, 11, 0x550c7dc3); 13997447ea4SJohn-Mark Gurney RNDr(S, W, 12, 0x72be5d74); 14097447ea4SJohn-Mark Gurney RNDr(S, W, 13, 0x80deb1fe); 14197447ea4SJohn-Mark Gurney RNDr(S, W, 14, 0x9bdc06a7); 14297447ea4SJohn-Mark Gurney RNDr(S, W, 15, 0xc19bf174); 14397447ea4SJohn-Mark Gurney RNDr(S, W, 16, 0xe49b69c1); 14497447ea4SJohn-Mark Gurney RNDr(S, W, 17, 0xefbe4786); 14597447ea4SJohn-Mark Gurney RNDr(S, W, 18, 0x0fc19dc6); 14697447ea4SJohn-Mark Gurney RNDr(S, W, 19, 0x240ca1cc); 14797447ea4SJohn-Mark Gurney RNDr(S, W, 20, 0x2de92c6f); 14897447ea4SJohn-Mark Gurney RNDr(S, W, 21, 0x4a7484aa); 14997447ea4SJohn-Mark Gurney RNDr(S, W, 22, 0x5cb0a9dc); 15097447ea4SJohn-Mark Gurney RNDr(S, W, 23, 0x76f988da); 15197447ea4SJohn-Mark Gurney RNDr(S, W, 24, 0x983e5152); 15297447ea4SJohn-Mark Gurney RNDr(S, W, 25, 0xa831c66d); 15397447ea4SJohn-Mark Gurney RNDr(S, W, 26, 0xb00327c8); 15497447ea4SJohn-Mark Gurney RNDr(S, W, 27, 0xbf597fc7); 15597447ea4SJohn-Mark Gurney RNDr(S, W, 28, 0xc6e00bf3); 15697447ea4SJohn-Mark Gurney RNDr(S, W, 29, 0xd5a79147); 15797447ea4SJohn-Mark Gurney RNDr(S, W, 30, 0x06ca6351); 15897447ea4SJohn-Mark Gurney RNDr(S, W, 31, 0x14292967); 15997447ea4SJohn-Mark Gurney RNDr(S, W, 32, 0x27b70a85); 16097447ea4SJohn-Mark Gurney RNDr(S, W, 33, 0x2e1b2138); 16197447ea4SJohn-Mark Gurney RNDr(S, W, 34, 0x4d2c6dfc); 16297447ea4SJohn-Mark Gurney RNDr(S, W, 35, 0x53380d13); 16397447ea4SJohn-Mark Gurney RNDr(S, W, 36, 0x650a7354); 16497447ea4SJohn-Mark Gurney RNDr(S, W, 37, 0x766a0abb); 16597447ea4SJohn-Mark Gurney RNDr(S, W, 38, 0x81c2c92e); 16697447ea4SJohn-Mark Gurney RNDr(S, W, 39, 0x92722c85); 16797447ea4SJohn-Mark Gurney RNDr(S, W, 40, 0xa2bfe8a1); 16897447ea4SJohn-Mark Gurney RNDr(S, W, 41, 0xa81a664b); 16997447ea4SJohn-Mark Gurney RNDr(S, W, 42, 0xc24b8b70); 17097447ea4SJohn-Mark Gurney RNDr(S, W, 43, 0xc76c51a3); 17197447ea4SJohn-Mark Gurney RNDr(S, W, 44, 0xd192e819); 17297447ea4SJohn-Mark Gurney RNDr(S, W, 45, 0xd6990624); 17397447ea4SJohn-Mark Gurney RNDr(S, W, 46, 0xf40e3585); 17497447ea4SJohn-Mark Gurney RNDr(S, W, 47, 0x106aa070); 17597447ea4SJohn-Mark Gurney RNDr(S, W, 48, 0x19a4c116); 17697447ea4SJohn-Mark Gurney RNDr(S, W, 49, 0x1e376c08); 17797447ea4SJohn-Mark Gurney RNDr(S, W, 50, 0x2748774c); 17897447ea4SJohn-Mark Gurney RNDr(S, W, 51, 0x34b0bcb5); 17997447ea4SJohn-Mark Gurney RNDr(S, W, 52, 0x391c0cb3); 18097447ea4SJohn-Mark Gurney RNDr(S, W, 53, 0x4ed8aa4a); 18197447ea4SJohn-Mark Gurney RNDr(S, W, 54, 0x5b9cca4f); 18297447ea4SJohn-Mark Gurney RNDr(S, W, 55, 0x682e6ff3); 18397447ea4SJohn-Mark Gurney RNDr(S, W, 56, 0x748f82ee); 18497447ea4SJohn-Mark Gurney RNDr(S, W, 57, 0x78a5636f); 18597447ea4SJohn-Mark Gurney RNDr(S, W, 58, 0x84c87814); 18697447ea4SJohn-Mark Gurney RNDr(S, W, 59, 0x8cc70208); 18797447ea4SJohn-Mark Gurney RNDr(S, W, 60, 0x90befffa); 18897447ea4SJohn-Mark Gurney RNDr(S, W, 61, 0xa4506ceb); 18997447ea4SJohn-Mark Gurney RNDr(S, W, 62, 0xbef9a3f7); 19097447ea4SJohn-Mark Gurney RNDr(S, W, 63, 0xc67178f2); 19197447ea4SJohn-Mark Gurney 19297447ea4SJohn-Mark Gurney /* 4. Mix local working variables into global state */ 19397447ea4SJohn-Mark Gurney for (i = 0; i < 8; i++) 19497447ea4SJohn-Mark Gurney state[i] += S[i]; 19597447ea4SJohn-Mark Gurney } 19697447ea4SJohn-Mark Gurney 19797447ea4SJohn-Mark Gurney static unsigned char PAD[64] = { 19897447ea4SJohn-Mark Gurney 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 19997447ea4SJohn-Mark Gurney 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20097447ea4SJohn-Mark Gurney 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20197447ea4SJohn-Mark Gurney 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 20297447ea4SJohn-Mark Gurney }; 20397447ea4SJohn-Mark Gurney 20497447ea4SJohn-Mark Gurney /* Add padding and terminating bit-count. */ 20597447ea4SJohn-Mark Gurney static void 20697447ea4SJohn-Mark Gurney SHA256_Pad(SHA256_CTX * ctx) 20797447ea4SJohn-Mark Gurney { 20897447ea4SJohn-Mark Gurney unsigned char len[8]; 20997447ea4SJohn-Mark Gurney uint32_t r, plen; 21097447ea4SJohn-Mark Gurney 21197447ea4SJohn-Mark Gurney /* 21297447ea4SJohn-Mark Gurney * Convert length to a vector of bytes -- we do this now rather 21397447ea4SJohn-Mark Gurney * than later because the length will change after we pad. 21497447ea4SJohn-Mark Gurney */ 21597447ea4SJohn-Mark Gurney be64enc(len, ctx->count); 21697447ea4SJohn-Mark Gurney 21797447ea4SJohn-Mark Gurney /* Add 1--64 bytes so that the resulting length is 56 mod 64 */ 21897447ea4SJohn-Mark Gurney r = (ctx->count >> 3) & 0x3f; 21997447ea4SJohn-Mark Gurney plen = (r < 56) ? (56 - r) : (120 - r); 22097447ea4SJohn-Mark Gurney SHA256_Update(ctx, PAD, (size_t)plen); 22197447ea4SJohn-Mark Gurney 22297447ea4SJohn-Mark Gurney /* Add the terminating bit-count */ 22397447ea4SJohn-Mark Gurney SHA256_Update(ctx, len, 8); 22497447ea4SJohn-Mark Gurney } 22597447ea4SJohn-Mark Gurney 22697447ea4SJohn-Mark Gurney /* SHA-256 initialization. Begins a SHA-256 operation. */ 22797447ea4SJohn-Mark Gurney void 22897447ea4SJohn-Mark Gurney SHA256_Init(SHA256_CTX * ctx) 22997447ea4SJohn-Mark Gurney { 23097447ea4SJohn-Mark Gurney 23197447ea4SJohn-Mark Gurney /* Zero bits processed so far */ 23297447ea4SJohn-Mark Gurney ctx->count = 0; 23397447ea4SJohn-Mark Gurney 23497447ea4SJohn-Mark Gurney /* Magic initialization constants */ 23597447ea4SJohn-Mark Gurney ctx->state[0] = 0x6A09E667; 23697447ea4SJohn-Mark Gurney ctx->state[1] = 0xBB67AE85; 23797447ea4SJohn-Mark Gurney ctx->state[2] = 0x3C6EF372; 23897447ea4SJohn-Mark Gurney ctx->state[3] = 0xA54FF53A; 23997447ea4SJohn-Mark Gurney ctx->state[4] = 0x510E527F; 24097447ea4SJohn-Mark Gurney ctx->state[5] = 0x9B05688C; 24197447ea4SJohn-Mark Gurney ctx->state[6] = 0x1F83D9AB; 24297447ea4SJohn-Mark Gurney ctx->state[7] = 0x5BE0CD19; 24397447ea4SJohn-Mark Gurney } 24497447ea4SJohn-Mark Gurney 24597447ea4SJohn-Mark Gurney /* Add bytes into the hash */ 24697447ea4SJohn-Mark Gurney void 24797447ea4SJohn-Mark Gurney SHA256_Update(SHA256_CTX * ctx, const void *in, size_t len) 24897447ea4SJohn-Mark Gurney { 24997447ea4SJohn-Mark Gurney uint64_t bitlen; 25097447ea4SJohn-Mark Gurney uint32_t r; 25197447ea4SJohn-Mark Gurney const unsigned char *src = in; 25297447ea4SJohn-Mark Gurney 25397447ea4SJohn-Mark Gurney /* Number of bytes left in the buffer from previous updates */ 25497447ea4SJohn-Mark Gurney r = (ctx->count >> 3) & 0x3f; 25597447ea4SJohn-Mark Gurney 25697447ea4SJohn-Mark Gurney /* Convert the length into a number of bits */ 25797447ea4SJohn-Mark Gurney bitlen = len << 3; 25897447ea4SJohn-Mark Gurney 25997447ea4SJohn-Mark Gurney /* Update number of bits */ 26097447ea4SJohn-Mark Gurney ctx->count += bitlen; 26197447ea4SJohn-Mark Gurney 26297447ea4SJohn-Mark Gurney /* Handle the case where we don't need to perform any transforms */ 26397447ea4SJohn-Mark Gurney if (len < 64 - r) { 26497447ea4SJohn-Mark Gurney memcpy(&ctx->buf[r], src, len); 26597447ea4SJohn-Mark Gurney return; 26697447ea4SJohn-Mark Gurney } 26797447ea4SJohn-Mark Gurney 26897447ea4SJohn-Mark Gurney /* Finish the current block */ 26997447ea4SJohn-Mark Gurney memcpy(&ctx->buf[r], src, 64 - r); 27097447ea4SJohn-Mark Gurney SHA256_Transform(ctx->state, ctx->buf); 27197447ea4SJohn-Mark Gurney src += 64 - r; 27297447ea4SJohn-Mark Gurney len -= 64 - r; 27397447ea4SJohn-Mark Gurney 27497447ea4SJohn-Mark Gurney /* Perform complete blocks */ 27597447ea4SJohn-Mark Gurney while (len >= 64) { 27697447ea4SJohn-Mark Gurney SHA256_Transform(ctx->state, src); 27797447ea4SJohn-Mark Gurney src += 64; 27897447ea4SJohn-Mark Gurney len -= 64; 27997447ea4SJohn-Mark Gurney } 28097447ea4SJohn-Mark Gurney 28197447ea4SJohn-Mark Gurney /* Copy left over data into buffer */ 28297447ea4SJohn-Mark Gurney memcpy(ctx->buf, src, len); 28397447ea4SJohn-Mark Gurney } 28497447ea4SJohn-Mark Gurney 28597447ea4SJohn-Mark Gurney /* 28697447ea4SJohn-Mark Gurney * SHA-256 finalization. Pads the input data, exports the hash value, 28797447ea4SJohn-Mark Gurney * and clears the context state. 28897447ea4SJohn-Mark Gurney */ 28997447ea4SJohn-Mark Gurney void 29097447ea4SJohn-Mark Gurney SHA256_Final(unsigned char digest[32], SHA256_CTX * ctx) 29197447ea4SJohn-Mark Gurney { 29297447ea4SJohn-Mark Gurney 29397447ea4SJohn-Mark Gurney /* Add padding */ 29497447ea4SJohn-Mark Gurney SHA256_Pad(ctx); 29597447ea4SJohn-Mark Gurney 29697447ea4SJohn-Mark Gurney /* Write the hash */ 29797447ea4SJohn-Mark Gurney be32enc_vect(digest, ctx->state, 32); 29897447ea4SJohn-Mark Gurney 29997447ea4SJohn-Mark Gurney /* Clear the context state */ 30097447ea4SJohn-Mark Gurney memset((void *)ctx, 0, sizeof(*ctx)); 30197447ea4SJohn-Mark Gurney } 302*2ff9c4f9SJohn-Mark Gurney 303*2ff9c4f9SJohn-Mark Gurney #ifdef WEAK_REFS 304*2ff9c4f9SJohn-Mark Gurney /* When building libmd, provide weak references. Note: this is not 305*2ff9c4f9SJohn-Mark Gurney activated in the context of compiling these sources for internal 306*2ff9c4f9SJohn-Mark Gurney use in libcrypt. 307*2ff9c4f9SJohn-Mark Gurney */ 308*2ff9c4f9SJohn-Mark Gurney #undef SHA256_Init 309*2ff9c4f9SJohn-Mark Gurney __weak_reference(_libmd_SHA256_Init, SHA256_Init); 310*2ff9c4f9SJohn-Mark Gurney #undef SHA256_Update 311*2ff9c4f9SJohn-Mark Gurney __weak_reference(_libmd_SHA256_Update, SHA256_Update); 312*2ff9c4f9SJohn-Mark Gurney #undef SHA256_Final 313*2ff9c4f9SJohn-Mark Gurney __weak_reference(_libmd_SHA256_Final, SHA256_Final); 314*2ff9c4f9SJohn-Mark Gurney #undef SHA256_Transform 315*2ff9c4f9SJohn-Mark Gurney __weak_reference(_libmd_SHA256_Transform, SHA256_Transform); 316*2ff9c4f9SJohn-Mark Gurney #endif 317