sha256.c 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214
  1. /* Functions to compute SHA256 message digest of files or memory blocks.
  2. according to the definition of SHA256 in FIPS 180-2.
  3. Copyright (C) 2007-2019 Free Software Foundation, Inc.
  4. This file is part of the GNU C Library.
  5. The GNU C Library is free software; you can redistribute it and/or
  6. modify it under the terms of the GNU Lesser General Public
  7. License as published by the Free Software Foundation; either
  8. version 2.1 of the License, or (at your option) any later version.
  9. The GNU C Library is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  12. Lesser General Public License for more details.
  13. You should have received a copy of the GNU Lesser General Public
  14. License along with the GNU C Library; if not, see
  15. <http://www.gnu.org/licenses/>. */
  16. /* Written by Ulrich Drepper <drepper@redhat.com>, 2007. */
  17. #ifdef HAVE_CONFIG_H
  18. # include <config.h>
  19. #endif
  20. #include <endian.h>
  21. #include <stdlib.h>
  22. #include <string.h>
  23. #include <stdint.h>
  24. #include <sys/types.h>
  25. #include "sha256.h"
  26. #if __BYTE_ORDER == __LITTLE_ENDIAN
  27. # ifdef _LIBC
  28. # include <byteswap.h>
  29. # define SWAP(n) bswap_32 (n)
  30. # define SWAP64(n) bswap_64 (n)
  31. # else
  32. # define SWAP(n) \
  33. (((n) << 24) | (((n) & 0xff00) << 8) | (((n) >> 8) & 0xff00) | ((n) >> 24))
  34. # define SWAP64(n) \
  35. (((n) << 56) \
  36. | (((n) & 0xff00) << 40) \
  37. | (((n) & 0xff0000) << 24) \
  38. | (((n) & 0xff000000) << 8) \
  39. | (((n) >> 8) & 0xff000000) \
  40. | (((n) >> 24) & 0xff0000) \
  41. | (((n) >> 40) & 0xff00) \
  42. | ((n) >> 56))
  43. # endif
  44. #else
  45. # define SWAP(n) (n)
  46. # define SWAP64(n) (n)
  47. #endif
  48. /* This array contains the bytes used to pad the buffer to the next
  49. 64-byte boundary. (FIPS 180-2:5.1.1) */
  50. static const unsigned char fillbuf[64] = { 0x80, 0 /* , 0, 0, ... */ };
  51. /* Constants for SHA256 from FIPS 180-2:4.2.2. */
  52. static const uint32_t K[64] =
  53. {
  54. 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,
  55. 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
  56. 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
  57. 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
  58. 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
  59. 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
  60. 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
  61. 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
  62. 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
  63. 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
  64. 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,
  65. 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
  66. 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,
  67. 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
  68. 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
  69. 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
  70. };
  71. void __sha256_process_block (const void *, size_t, struct sha256_ctx *);
  72. /* Initialize structure containing state of computation.
  73. (FIPS 180-2:5.3.2) */
  74. void
  75. __sha256_init_ctx (struct sha256_ctx *ctx)
  76. {
  77. ctx->H[0] = 0x6a09e667;
  78. ctx->H[1] = 0xbb67ae85;
  79. ctx->H[2] = 0x3c6ef372;
  80. ctx->H[3] = 0xa54ff53a;
  81. ctx->H[4] = 0x510e527f;
  82. ctx->H[5] = 0x9b05688c;
  83. ctx->H[6] = 0x1f83d9ab;
  84. ctx->H[7] = 0x5be0cd19;
  85. ctx->total64 = 0;
  86. ctx->buflen = 0;
  87. }
  88. /* Process the remaining bytes in the internal buffer and the usual
  89. prolog according to the standard and write the result to RESBUF.
  90. IMPORTANT: On some systems it is required that RESBUF is correctly
  91. aligned for a 32 bits value. */
  92. void *
  93. __sha256_finish_ctx (struct sha256_ctx *ctx, void *resbuf)
  94. {
  95. /* Take yet unprocessed bytes into account. */
  96. uint32_t bytes = ctx->buflen;
  97. size_t pad;
  98. /* Now count remaining bytes. */
  99. ctx->total64 += bytes;
  100. pad = bytes >= 56 ? 64 + 56 - bytes : 56 - bytes;
  101. memcpy (&ctx->buffer[bytes], fillbuf, pad);
  102. /* Put the 64-bit file length in *bits* at the end of the buffer. */
  103. #if _STRING_ARCH_unaligned
  104. ctx->buffer64[(bytes + pad) / 8] = SWAP64 (ctx->total64 << 3);
  105. #else
  106. ctx->buffer32[(bytes + pad + 4) / 4] = SWAP (ctx->total[TOTAL64_low] << 3);
  107. ctx->buffer32[(bytes + pad) / 4] = SWAP ((ctx->total[TOTAL64_high] << 3) |
  108. (ctx->total[TOTAL64_low] >> 29));
  109. #endif
  110. /* Process last bytes. */
  111. __sha256_process_block (ctx->buffer, bytes + pad + 8, ctx);
  112. /* Put result from CTX in first 32 bytes following RESBUF. */
  113. for (unsigned int i = 0; i < 8; ++i)
  114. ((uint32_t *) resbuf)[i] = SWAP (ctx->H[i]);
  115. return resbuf;
  116. }
  117. void
  118. __sha256_process_bytes (const void *buffer, size_t len, struct sha256_ctx *ctx)
  119. {
  120. /* When we already have some bits in our internal buffer concatenate
  121. both inputs first. */
  122. if (ctx->buflen != 0)
  123. {
  124. size_t left_over = ctx->buflen;
  125. size_t add = 128 - left_over > len ? len : 128 - left_over;
  126. memcpy (&ctx->buffer[left_over], buffer, add);
  127. ctx->buflen += add;
  128. if (ctx->buflen > 64)
  129. {
  130. __sha256_process_block (ctx->buffer, ctx->buflen & ~63, ctx);
  131. ctx->buflen &= 63;
  132. /* The regions in the following copy operation cannot overlap. */
  133. memcpy (ctx->buffer, &ctx->buffer[(left_over + add) & ~63],
  134. ctx->buflen);
  135. }
  136. buffer = (const char *) buffer + add;
  137. len -= add;
  138. }
  139. /* Process available complete blocks. */
  140. if (len >= 64)
  141. {
  142. #if !_STRING_ARCH_unaligned
  143. /* To check alignment gcc has an appropriate operator. Other
  144. compilers don't. */
  145. # if __GNUC__ >= 2
  146. # define UNALIGNED_P(p) (((uintptr_t) p) % __alignof__ (uint32_t) != 0)
  147. # else
  148. # define UNALIGNED_P(p) (((uintptr_t) p) % sizeof (uint32_t) != 0)
  149. # endif
  150. if (UNALIGNED_P (buffer))
  151. while (len > 64)
  152. {
  153. __sha256_process_block (memcpy (ctx->buffer, buffer, 64), 64, ctx);
  154. buffer = (const char *) buffer + 64;
  155. len -= 64;
  156. }
  157. else
  158. #endif
  159. {
  160. __sha256_process_block (buffer, len & ~63, ctx);
  161. buffer = (const char *) buffer + (len & ~63);
  162. len &= 63;
  163. }
  164. }
  165. /* Move remaining bytes into internal buffer. */
  166. if (len > 0)
  167. {
  168. size_t left_over = ctx->buflen;
  169. memcpy (&ctx->buffer[left_over], buffer, len);
  170. left_over += len;
  171. if (left_over >= 64)
  172. {
  173. __sha256_process_block (ctx->buffer, 64, ctx);
  174. left_over -= 64;
  175. memcpy (ctx->buffer, &ctx->buffer[64], left_over);
  176. }
  177. ctx->buflen = left_over;
  178. }
  179. }
  180. #include <sha256-block.c>