代码拉取完成，页面将自动刷新
From: CarterLi <carter.li@eoitek.com>
Date: Fri, 15 Jun 2018 14:58:09 +0800
Subject: [PATCH] Use openssl md5 / sha1
Link: https://github.com/kn007/patch/issues/5
diff -uNr a/auto/sources b/auto/sources
--- a/auto/sources 2020-03-03 23:04:21.000000000 +0800
+++ b/auto/sources 2020-03-13 22:00:37.317527023 +0800
@@ -60,8 +60,6 @@
src/core/ngx_file.c \
src/core/ngx_crc32.c \
src/core/ngx_murmurhash.c \
- src/core/ngx_md5.c \
- src/core/ngx_sha1.c \
src/core/ngx_rbtree.c \
src/core/ngx_radix_tree.c \
src/core/ngx_slab.c \
diff -uNr a/src/core/ngx_md5.c b/src/core/ngx_md5.c
--- a/src/core/ngx_md5.c 2020-03-03 23:04:21.000000000 +0800
+++ /dev/null 1970-01-01 08:00:00.000000000 +0800
@@ -1,283 +0,0 @@
-
-/*
- * An internal implementation, based on Alexander Peslyak's
- * public domain implementation:
- * http://openwall.info/wiki/people/solar/software/public-domain-source-code/md5
- */
-
-
-#include <ngx_config.h>
-#include <ngx_core.h>
-#include <ngx_md5.h>
-
-
-static const u_char *ngx_md5_body(ngx_md5_t *ctx, const u_char *data,
- size_t size);
-
-
-void
-ngx_md5_init(ngx_md5_t *ctx)
-{
- ctx->a = 0x67452301;
- ctx->b = 0xefcdab89;
- ctx->c = 0x98badcfe;
- ctx->d = 0x10325476;
-
- ctx->bytes = 0;
-}
-
-
-void
-ngx_md5_update(ngx_md5_t *ctx, const void *data, size_t size)
-{
- size_t used, free;
-
- used = (size_t) (ctx->bytes & 0x3f);
- ctx->bytes += size;
-
- if (used) {
- free = 64 - used;
-
- if (size < free) {
- ngx_memcpy(&ctx->buffer[used], data, size);
- return;
- }
-
- ngx_memcpy(&ctx->buffer[used], data, free);
- data = (u_char *) data + free;
- size -= free;
- (void) ngx_md5_body(ctx, ctx->buffer, 64);
- }
-
- if (size >= 64) {
- data = ngx_md5_body(ctx, data, size & ~(size_t) 0x3f);
- size &= 0x3f;
- }
-
- ngx_memcpy(ctx->buffer, data, size);
-}
-
-
-void
-ngx_md5_final(u_char result[16], ngx_md5_t *ctx)
-{
- size_t used, free;
-
- used = (size_t) (ctx->bytes & 0x3f);
-
- ctx->buffer[used++] = 0x80;
-
- free = 64 - used;
-
- if (free < 8) {
- ngx_memzero(&ctx->buffer[used], free);
- (void) ngx_md5_body(ctx, ctx->buffer, 64);
- used = 0;
- free = 64;
- }
-
- ngx_memzero(&ctx->buffer[used], free - 8);
-
- ctx->bytes <<= 3;
- ctx->buffer[56] = (u_char) ctx->bytes;
- ctx->buffer[57] = (u_char) (ctx->bytes >> 8);
- ctx->buffer[58] = (u_char) (ctx->bytes >> 16);
- ctx->buffer[59] = (u_char) (ctx->bytes >> 24);
- ctx->buffer[60] = (u_char) (ctx->bytes >> 32);
- ctx->buffer[61] = (u_char) (ctx->bytes >> 40);
- ctx->buffer[62] = (u_char) (ctx->bytes >> 48);
- ctx->buffer[63] = (u_char) (ctx->bytes >> 56);
-
- (void) ngx_md5_body(ctx, ctx->buffer, 64);
-
- result[0] = (u_char) ctx->a;
- result[1] = (u_char) (ctx->a >> 8);
- result[2] = (u_char) (ctx->a >> 16);
- result[3] = (u_char) (ctx->a >> 24);
- result[4] = (u_char) ctx->b;
- result[5] = (u_char) (ctx->b >> 8);
- result[6] = (u_char) (ctx->b >> 16);
- result[7] = (u_char) (ctx->b >> 24);
- result[8] = (u_char) ctx->c;
- result[9] = (u_char) (ctx->c >> 8);
- result[10] = (u_char) (ctx->c >> 16);
- result[11] = (u_char) (ctx->c >> 24);
- result[12] = (u_char) ctx->d;
- result[13] = (u_char) (ctx->d >> 8);
- result[14] = (u_char) (ctx->d >> 16);
- result[15] = (u_char) (ctx->d >> 24);
-
- ngx_memzero(ctx, sizeof(*ctx));
-}
-
-
-/*
- * The basic MD5 functions.
- *
- * F and G are optimized compared to their RFC 1321 definitions for
- * architectures that lack an AND-NOT instruction, just like in
- * Colin Plumb's implementation.
- */
-
-#define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
-#define G(x, y, z) ((y) ^ ((z) & ((x) ^ (y))))
-#define H(x, y, z) ((x) ^ (y) ^ (z))
-#define I(x, y, z) ((y) ^ ((x) | ~(z)))
-
-/*
- * The MD5 transformation for all four rounds.
- */
-
-#define STEP(f, a, b, c, d, x, t, s) \
- (a) += f((b), (c), (d)) + (x) + (t); \
- (a) = (((a) << (s)) | (((a) & 0xffffffff) >> (32 - (s)))); \
- (a) += (b)
-
-/*
- * SET() reads 4 input bytes in little-endian byte order and stores them
- * in a properly aligned word in host byte order.
- *
- * The check for little-endian architectures that tolerate unaligned
- * memory accesses is just an optimization. Nothing will break if it
- * does not work.
- */
-
-#if (NGX_HAVE_LITTLE_ENDIAN && NGX_HAVE_NONALIGNED)
-
-#define SET(n) (*(uint32_t *) &p[n * 4])
-#define GET(n) (*(uint32_t *) &p[n * 4])
-
-#else
-
-#define SET(n) \
- (block[n] = \
- (uint32_t) p[n * 4] | \
- ((uint32_t) p[n * 4 + 1] << 8) | \
- ((uint32_t) p[n * 4 + 2] << 16) | \
- ((uint32_t) p[n * 4 + 3] << 24))
-
-#define GET(n) block[n]
-
-#endif
-
-
-/*
- * This processes one or more 64-byte data blocks, but does not update
- * the bit counters. There are no alignment requirements.
- */
-
-static const u_char *
-ngx_md5_body(ngx_md5_t *ctx, const u_char *data, size_t size)
-{
- uint32_t a, b, c, d;
- uint32_t saved_a, saved_b, saved_c, saved_d;
- const u_char *p;
-#if !(NGX_HAVE_LITTLE_ENDIAN && NGX_HAVE_NONALIGNED)
- uint32_t block[16];
-#endif
-
- p = data;
-
- a = ctx->a;
- b = ctx->b;
- c = ctx->c;
- d = ctx->d;
-
- do {
- saved_a = a;
- saved_b = b;
- saved_c = c;
- saved_d = d;
-
- /* Round 1 */
-
- STEP(F, a, b, c, d, SET(0), 0xd76aa478, 7);
- STEP(F, d, a, b, c, SET(1), 0xe8c7b756, 12);
- STEP(F, c, d, a, b, SET(2), 0x242070db, 17);
- STEP(F, b, c, d, a, SET(3), 0xc1bdceee, 22);
- STEP(F, a, b, c, d, SET(4), 0xf57c0faf, 7);
- STEP(F, d, a, b, c, SET(5), 0x4787c62a, 12);
- STEP(F, c, d, a, b, SET(6), 0xa8304613, 17);
- STEP(F, b, c, d, a, SET(7), 0xfd469501, 22);
- STEP(F, a, b, c, d, SET(8), 0x698098d8, 7);
- STEP(F, d, a, b, c, SET(9), 0x8b44f7af, 12);
- STEP(F, c, d, a, b, SET(10), 0xffff5bb1, 17);
- STEP(F, b, c, d, a, SET(11), 0x895cd7be, 22);
- STEP(F, a, b, c, d, SET(12), 0x6b901122, 7);
- STEP(F, d, a, b, c, SET(13), 0xfd987193, 12);
- STEP(F, c, d, a, b, SET(14), 0xa679438e, 17);
- STEP(F, b, c, d, a, SET(15), 0x49b40821, 22);
-
- /* Round 2 */
-
- STEP(G, a, b, c, d, GET(1), 0xf61e2562, 5);
- STEP(G, d, a, b, c, GET(6), 0xc040b340, 9);
- STEP(G, c, d, a, b, GET(11), 0x265e5a51, 14);
- STEP(G, b, c, d, a, GET(0), 0xe9b6c7aa, 20);
- STEP(G, a, b, c, d, GET(5), 0xd62f105d, 5);
- STEP(G, d, a, b, c, GET(10), 0x02441453, 9);
- STEP(G, c, d, a, b, GET(15), 0xd8a1e681, 14);
- STEP(G, b, c, d, a, GET(4), 0xe7d3fbc8, 20);
- STEP(G, a, b, c, d, GET(9), 0x21e1cde6, 5);
- STEP(G, d, a, b, c, GET(14), 0xc33707d6, 9);
- STEP(G, c, d, a, b, GET(3), 0xf4d50d87, 14);
- STEP(G, b, c, d, a, GET(8), 0x455a14ed, 20);
- STEP(G, a, b, c, d, GET(13), 0xa9e3e905, 5);
- STEP(G, d, a, b, c, GET(2), 0xfcefa3f8, 9);
- STEP(G, c, d, a, b, GET(7), 0x676f02d9, 14);
- STEP(G, b, c, d, a, GET(12), 0x8d2a4c8a, 20);
-
- /* Round 3 */
-
- STEP(H, a, b, c, d, GET(5), 0xfffa3942, 4);
- STEP(H, d, a, b, c, GET(8), 0x8771f681, 11);
- STEP(H, c, d, a, b, GET(11), 0x6d9d6122, 16);
- STEP(H, b, c, d, a, GET(14), 0xfde5380c, 23);
- STEP(H, a, b, c, d, GET(1), 0xa4beea44, 4);
- STEP(H, d, a, b, c, GET(4), 0x4bdecfa9, 11);
- STEP(H, c, d, a, b, GET(7), 0xf6bb4b60, 16);
- STEP(H, b, c, d, a, GET(10), 0xbebfbc70, 23);
- STEP(H, a, b, c, d, GET(13), 0x289b7ec6, 4);
- STEP(H, d, a, b, c, GET(0), 0xeaa127fa, 11);
- STEP(H, c, d, a, b, GET(3), 0xd4ef3085, 16);
- STEP(H, b, c, d, a, GET(6), 0x04881d05, 23);
- STEP(H, a, b, c, d, GET(9), 0xd9d4d039, 4);
- STEP(H, d, a, b, c, GET(12), 0xe6db99e5, 11);
- STEP(H, c, d, a, b, GET(15), 0x1fa27cf8, 16);
- STEP(H, b, c, d, a, GET(2), 0xc4ac5665, 23);
-
- /* Round 4 */
-
- STEP(I, a, b, c, d, GET(0), 0xf4292244, 6);
- STEP(I, d, a, b, c, GET(7), 0x432aff97, 10);
- STEP(I, c, d, a, b, GET(14), 0xab9423a7, 15);
- STEP(I, b, c, d, a, GET(5), 0xfc93a039, 21);
- STEP(I, a, b, c, d, GET(12), 0x655b59c3, 6);
- STEP(I, d, a, b, c, GET(3), 0x8f0ccc92, 10);
- STEP(I, c, d, a, b, GET(10), 0xffeff47d, 15);
- STEP(I, b, c, d, a, GET(1), 0x85845dd1, 21);
- STEP(I, a, b, c, d, GET(8), 0x6fa87e4f, 6);
- STEP(I, d, a, b, c, GET(15), 0xfe2ce6e0, 10);
- STEP(I, c, d, a, b, GET(6), 0xa3014314, 15);
- STEP(I, b, c, d, a, GET(13), 0x4e0811a1, 21);
- STEP(I, a, b, c, d, GET(4), 0xf7537e82, 6);
- STEP(I, d, a, b, c, GET(11), 0xbd3af235, 10);
- STEP(I, c, d, a, b, GET(2), 0x2ad7d2bb, 15);
- STEP(I, b, c, d, a, GET(9), 0xeb86d391, 21);
-
- a += saved_a;
- b += saved_b;
- c += saved_c;
- d += saved_d;
-
- p += 64;
-
- } while (size -= 64);
-
- ctx->a = a;
- ctx->b = b;
- ctx->c = c;
- ctx->d = d;
-
- return p;
-}
diff -uNr a/src/core/ngx_md5.h b/src/core/ngx_md5.h
--- a/src/core/ngx_md5.h 2020-03-03 23:04:21.000000000 +0800
+++ b/src/core/ngx_md5.h 2020-03-13 22:00:37.318527030 +0800
@@ -12,17 +12,13 @@
#include <ngx_config.h>
#include <ngx_core.h>
+#include <openssl/md5.h>
-typedef struct {
- uint64_t bytes;
- uint32_t a, b, c, d;
- u_char buffer[64];
-} ngx_md5_t;
+typedef MD5_CTX ngx_md5_t;
-
-void ngx_md5_init(ngx_md5_t *ctx);
-void ngx_md5_update(ngx_md5_t *ctx, const void *data, size_t size);
-void ngx_md5_final(u_char result[16], ngx_md5_t *ctx);
+#define ngx_md5_init MD5_Init
+#define ngx_md5_update MD5_Update
+#define ngx_md5_final MD5_Final
#endif /* _NGX_MD5_H_INCLUDED_ */
diff -uNr a/src/core/ngx_sha1.c b/src/core/ngx_sha1.c
--- a/src/core/ngx_sha1.c 2020-03-03 23:04:21.000000000 +0800
+++ /dev/null 1970-01-01 08:00:00.000000000 +0800
@@ -1,294 +0,0 @@
-
-/*
- * Copyright (C) Maxim Dounin
- * Copyright (C) Nginx, Inc.
- *
- * An internal SHA1 implementation.
- */
-
-
-#include <ngx_config.h>
-#include <ngx_core.h>
-#include <ngx_sha1.h>
-
-
-static const u_char *ngx_sha1_body(ngx_sha1_t *ctx, const u_char *data,
- size_t size);
-
-
-void
-ngx_sha1_init(ngx_sha1_t *ctx)
-{
- ctx->a = 0x67452301;
- ctx->b = 0xefcdab89;
- ctx->c = 0x98badcfe;
- ctx->d = 0x10325476;
- ctx->e = 0xc3d2e1f0;
-
- ctx->bytes = 0;
-}
-
-
-void
-ngx_sha1_update(ngx_sha1_t *ctx, const void *data, size_t size)
-{
- size_t used, free;
-
- used = (size_t) (ctx->bytes & 0x3f);
- ctx->bytes += size;
-
- if (used) {
- free = 64 - used;
-
- if (size < free) {
- ngx_memcpy(&ctx->buffer[used], data, size);
- return;
- }
-
- ngx_memcpy(&ctx->buffer[used], data, free);
- data = (u_char *) data + free;
- size -= free;
- (void) ngx_sha1_body(ctx, ctx->buffer, 64);
- }
-
- if (size >= 64) {
- data = ngx_sha1_body(ctx, data, size & ~(size_t) 0x3f);
- size &= 0x3f;
- }
-
- ngx_memcpy(ctx->buffer, data, size);
-}
-
-
-void
-ngx_sha1_final(u_char result[20], ngx_sha1_t *ctx)
-{
- size_t used, free;
-
- used = (size_t) (ctx->bytes & 0x3f);
-
- ctx->buffer[used++] = 0x80;
-
- free = 64 - used;
-
- if (free < 8) {
- ngx_memzero(&ctx->buffer[used], free);
- (void) ngx_sha1_body(ctx, ctx->buffer, 64);
- used = 0;
- free = 64;
- }
-
- ngx_memzero(&ctx->buffer[used], free - 8);
-
- ctx->bytes <<= 3;
- ctx->buffer[56] = (u_char) (ctx->bytes >> 56);
- ctx->buffer[57] = (u_char) (ctx->bytes >> 48);
- ctx->buffer[58] = (u_char) (ctx->bytes >> 40);
- ctx->buffer[59] = (u_char) (ctx->bytes >> 32);
- ctx->buffer[60] = (u_char) (ctx->bytes >> 24);
- ctx->buffer[61] = (u_char) (ctx->bytes >> 16);
- ctx->buffer[62] = (u_char) (ctx->bytes >> 8);
- ctx->buffer[63] = (u_char) ctx->bytes;
-
- (void) ngx_sha1_body(ctx, ctx->buffer, 64);
-
- result[0] = (u_char) (ctx->a >> 24);
- result[1] = (u_char) (ctx->a >> 16);
- result[2] = (u_char) (ctx->a >> 8);
- result[3] = (u_char) ctx->a;
- result[4] = (u_char) (ctx->b >> 24);
- result[5] = (u_char) (ctx->b >> 16);
- result[6] = (u_char) (ctx->b >> 8);
- result[7] = (u_char) ctx->b;
- result[8] = (u_char) (ctx->c >> 24);
- result[9] = (u_char) (ctx->c >> 16);
- result[10] = (u_char) (ctx->c >> 8);
- result[11] = (u_char) ctx->c;
- result[12] = (u_char) (ctx->d >> 24);
- result[13] = (u_char) (ctx->d >> 16);
- result[14] = (u_char) (ctx->d >> 8);
- result[15] = (u_char) ctx->d;
- result[16] = (u_char) (ctx->e >> 24);
- result[17] = (u_char) (ctx->e >> 16);
- result[18] = (u_char) (ctx->e >> 8);
- result[19] = (u_char) ctx->e;
-
- ngx_memzero(ctx, sizeof(*ctx));
-}
-
-
-/*
- * Helper functions.
- */
-
-#define ROTATE(bits, word) (((word) << (bits)) | ((word) >> (32 - (bits))))
-
-#define F1(b, c, d) (((b) & (c)) | ((~(b)) & (d)))
-#define F2(b, c, d) ((b) ^ (c) ^ (d))
-#define F3(b, c, d) (((b) & (c)) | ((b) & (d)) | ((c) & (d)))
-
-#define STEP(f, a, b, c, d, e, w, t) \
- temp = ROTATE(5, (a)) + f((b), (c), (d)) + (e) + (w) + (t); \
- (e) = (d); \
- (d) = (c); \
- (c) = ROTATE(30, (b)); \
- (b) = (a); \
- (a) = temp;
-
-
-/*
- * GET() reads 4 input bytes in big-endian byte order and returns
- * them as uint32_t.
- */
-
-#define GET(n) \
- ((uint32_t) p[n * 4 + 3] | \
- ((uint32_t) p[n * 4 + 2] << 8) | \
- ((uint32_t) p[n * 4 + 1] << 16) | \
- ((uint32_t) p[n * 4] << 24))
-
-
-/*
- * This processes one or more 64-byte data blocks, but does not update
- * the bit counters. There are no alignment requirements.
- */
-
-static const u_char *
-ngx_sha1_body(ngx_sha1_t *ctx, const u_char *data, size_t size)
-{
- uint32_t a, b, c, d, e, temp;
- uint32_t saved_a, saved_b, saved_c, saved_d, saved_e;
- uint32_t words[80];
- ngx_uint_t i;
- const u_char *p;
-
- p = data;
-
- a = ctx->a;
- b = ctx->b;
- c = ctx->c;
- d = ctx->d;
- e = ctx->e;
-
- do {
- saved_a = a;
- saved_b = b;
- saved_c = c;
- saved_d = d;
- saved_e = e;
-
- /* Load data block into the words array */
-
- for (i = 0; i < 16; i++) {
- words[i] = GET(i);
- }
-
- for (i = 16; i < 80; i++) {
- words[i] = ROTATE(1, words[i - 3] ^ words[i - 8] ^ words[i - 14]
- ^ words[i - 16]);
- }
-
- /* Transformations */
-
- STEP(F1, a, b, c, d, e, words[0], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[1], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[2], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[3], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[4], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[5], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[6], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[7], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[8], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[9], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[10], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[11], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[12], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[13], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[14], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[15], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[16], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[17], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[18], 0x5a827999);
- STEP(F1, a, b, c, d, e, words[19], 0x5a827999);
-
- STEP(F2, a, b, c, d, e, words[20], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[21], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[22], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[23], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[24], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[25], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[26], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[27], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[28], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[29], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[30], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[31], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[32], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[33], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[34], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[35], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[36], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[37], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[38], 0x6ed9eba1);
- STEP(F2, a, b, c, d, e, words[39], 0x6ed9eba1);
-
- STEP(F3, a, b, c, d, e, words[40], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[41], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[42], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[43], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[44], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[45], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[46], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[47], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[48], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[49], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[50], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[51], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[52], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[53], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[54], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[55], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[56], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[57], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[58], 0x8f1bbcdc);
- STEP(F3, a, b, c, d, e, words[59], 0x8f1bbcdc);
-
- STEP(F2, a, b, c, d, e, words[60], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[61], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[62], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[63], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[64], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[65], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[66], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[67], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[68], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[69], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[70], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[71], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[72], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[73], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[74], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[75], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[76], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[77], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[78], 0xca62c1d6);
- STEP(F2, a, b, c, d, e, words[79], 0xca62c1d6);
-
- a += saved_a;
- b += saved_b;
- c += saved_c;
- d += saved_d;
- e += saved_e;
-
- p += 64;
-
- } while (size -= 64);
-
- ctx->a = a;
- ctx->b = b;
- ctx->c = c;
- ctx->d = d;
- ctx->e = e;
-
- return p;
-}
diff -uNr a/src/core/ngx_sha1.h b/src/core/ngx_sha1.h
--- a/src/core/ngx_sha1.h 2020-03-03 23:04:21.000000000 +0800
+++ b/src/core/ngx_sha1.h 2020-03-13 22:00:37.319527037 +0800
@@ -12,17 +12,13 @@
#include <ngx_config.h>
#include <ngx_core.h>
+#include <openssl/sha.h>
-typedef struct {
- uint64_t bytes;
- uint32_t a, b, c, d, e, f;
- u_char buffer[64];
-} ngx_sha1_t;
+typedef SHA_CTX ngx_sha1_t;
-
-void ngx_sha1_init(ngx_sha1_t *ctx);
-void ngx_sha1_update(ngx_sha1_t *ctx, const void *data, size_t size);
-void ngx_sha1_final(u_char result[20], ngx_sha1_t *ctx);
+#define ngx_sha1_init SHA1_Init
+#define ngx_sha1_update SHA1_Update
+#define ngx_sha1_final SHA1_Final
#endif /* _NGX_SHA1_H_INCLUDED_ */
此处可能存在不合适展示的内容，页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容，可点击提交进行申诉，我们将尽快为您处理。
马建仓 AI 助手
