diff options
| author | jsing <> | 2023-03-26 17:52:07 +0000 |
|---|---|---|
| committer | jsing <> | 2023-03-26 17:52:07 +0000 |
| commit | 6f6a43811514dcf59822a1b76319e8ebfdbf9c2f (patch) | |
| tree | 1418638a4a5bdb6cea8dc3ea100016acbf020024 /src | |
| parent | 5820d8a3b40cde5895e4b4b260a07b1a5e31c942 (diff) | |
| download | openbsd-6f6a43811514dcf59822a1b76319e8ebfdbf9c2f.tar.gz openbsd-6f6a43811514dcf59822a1b76319e8ebfdbf9c2f.tar.bz2 openbsd-6f6a43811514dcf59822a1b76319e8ebfdbf9c2f.zip | |
Use multiple statements instead of comma separated expressions.
No change to generated assembly.
Diffstat (limited to 'src')
| -rw-r--r-- | src/lib/libcrypto/sha/sha512.c | 57 |
1 files changed, 33 insertions, 24 deletions
diff --git a/src/lib/libcrypto/sha/sha512.c b/src/lib/libcrypto/sha/sha512.c index 9fc5d97245..b5eb56c172 100644 --- a/src/lib/libcrypto/sha/sha512.c +++ b/src/lib/libcrypto/sha/sha512.c | |||
| @@ -1,4 +1,4 @@ | |||
| 1 | /* $OpenBSD: sha512.c,v 1.18 2023/03/26 17:06:14 jsing Exp $ */ | 1 | /* $OpenBSD: sha512.c,v 1.19 2023/03/26 17:52:07 jsing Exp $ */ |
| 2 | /* ==================================================================== | 2 | /* ==================================================================== |
| 3 | * Copyright (c) 2004 The OpenSSL Project. All rights reserved | 3 | * Copyright (c) 2004 The OpenSSL Project. All rights reserved |
| 4 | * according to the OpenSSL license [found in ../../LICENSE]. | 4 | * according to the OpenSSL license [found in ../../LICENSE]. |
| @@ -107,9 +107,11 @@ SHA512_Final(unsigned char *md, SHA512_CTX *c) | |||
| 107 | 107 | ||
| 108 | p[n]=0x80; /* There always is a room for one */ | 108 | p[n]=0x80; /* There always is a room for one */ |
| 109 | n++; | 109 | n++; |
| 110 | if (n > (sizeof(c->u) - 16)) | 110 | if (n > (sizeof(c->u) - 16)) { |
| 111 | memset (p + n, 0, sizeof(c->u) - n), n = 0, | 111 | memset(p + n, 0, sizeof(c->u) - n); |
| 112 | sha512_block_data_order (c, p, 1); | 112 | n = 0; |
| 113 | sha512_block_data_order(c, p, 1); | ||
| 114 | } | ||
| 113 | 115 | ||
| 114 | memset (p + n, 0, sizeof(c->u) - 16 - n); | 116 | memset (p + n, 0, sizeof(c->u) - 16 - n); |
| 115 | #if BYTE_ORDER == BIG_ENDIAN | 117 | #if BYTE_ORDER == BIG_ENDIAN |
| @@ -134,7 +136,7 @@ SHA512_Final(unsigned char *md, SHA512_CTX *c) | |||
| 134 | p[sizeof(c->u) - 16] = (unsigned char)(c->Nh >> 56); | 136 | p[sizeof(c->u) - 16] = (unsigned char)(c->Nh >> 56); |
| 135 | #endif | 137 | #endif |
| 136 | 138 | ||
| 137 | sha512_block_data_order (c, p, 1); | 139 | sha512_block_data_order(c, p, 1); |
| 138 | 140 | ||
| 139 | if (md == 0) | 141 | if (md == 0) |
| 140 | return 0; | 142 | return 0; |
| @@ -204,34 +206,41 @@ SHA512_Update(SHA512_CTX *c, const void *_data, size_t len) | |||
| 204 | size_t n = sizeof(c->u) - c->num; | 206 | size_t n = sizeof(c->u) - c->num; |
| 205 | 207 | ||
| 206 | if (len < n) { | 208 | if (len < n) { |
| 207 | memcpy (p + c->num, data, len), c->num += (unsigned int)len; | 209 | memcpy(p + c->num, data, len); |
| 210 | c->num += (unsigned int)len; | ||
| 208 | return 1; | 211 | return 1; |
| 209 | } | 212 | } else{ |
| 210 | else { | 213 | memcpy(p + c->num, data, n); |
| 211 | memcpy (p + c->num, data, n), c->num = 0; | 214 | c->num = 0; |
| 212 | len -= n, data += n; | 215 | len -= n; |
| 213 | sha512_block_data_order (c, p, 1); | 216 | data += n; |
| 217 | sha512_block_data_order(c, p, 1); | ||
| 214 | } | 218 | } |
| 215 | } | 219 | } |
| 216 | 220 | ||
| 217 | if (len >= sizeof(c->u)) { | 221 | if (len >= sizeof(c->u)) { |
| 218 | #ifndef SHA512_BLOCK_CAN_MANAGE_UNALIGNED_DATA | 222 | #ifndef SHA512_BLOCK_CAN_MANAGE_UNALIGNED_DATA |
| 219 | if ((size_t)data % sizeof(c->u.d[0]) != 0) | 223 | if ((size_t)data % sizeof(c->u.d[0]) != 0) { |
| 220 | while (len >= sizeof(c->u)) | 224 | while (len >= sizeof(c->u)) { |
| 221 | memcpy (p, data, sizeof(c->u)), | 225 | memcpy(p, data, sizeof(c->u)); |
| 222 | sha512_block_data_order (c, p, 1), | 226 | sha512_block_data_order(c, p, 1); |
| 223 | len -= sizeof(c->u), | 227 | len -= sizeof(c->u); |
| 224 | data += sizeof(c->u); | 228 | data += sizeof(c->u); |
| 225 | else | 229 | } |
| 230 | } else | ||
| 226 | #endif | 231 | #endif |
| 227 | sha512_block_data_order (c, data, len/sizeof(c->u)), | 232 | { |
| 228 | data += len, | 233 | sha512_block_data_order(c, data, len/sizeof(c->u)); |
| 229 | len %= sizeof(c->u), | 234 | data += len; |
| 230 | data -= len; | 235 | len %= sizeof(c->u); |
| 236 | data -= len; | ||
| 237 | } | ||
| 231 | } | 238 | } |
| 232 | 239 | ||
| 233 | if (len != 0) | 240 | if (len != 0) { |
| 234 | memcpy (p, data, len), c->num = (int)len; | 241 | memcpy(p, data, len); |
| 242 | c->num = (int)len; | ||
| 243 | } | ||
| 235 | 244 | ||
| 236 | return 1; | 245 | return 1; |
| 237 | } | 246 | } |
