dxil_hash.cpp 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210
  1. /**************************************************************************/
  2. /* dxil_hash.cpp */
  3. /**************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /**************************************************************************/
  8. /* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */
  9. /* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
  10. /* */
  11. /* Permission is hereby granted, free of charge, to any person obtaining */
  12. /* a copy of this software and associated documentation files (the */
  13. /* "Software"), to deal in the Software without restriction, including */
  14. /* without limitation the rights to use, copy, modify, merge, publish, */
  15. /* distribute, sublicense, and/or sell copies of the Software, and to */
  16. /* permit persons to whom the Software is furnished to do so, subject to */
  17. /* the following conditions: */
  18. /* */
  19. /* The above copyright notice and this permission notice shall be */
  20. /* included in all copies or substantial portions of the Software. */
  21. /* */
  22. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  23. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  24. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */
  25. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  26. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  27. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  28. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  29. /**************************************************************************/
  30. // Based on the patched public domain implementation released by Microsoft here:
  31. // https://github.com/microsoft/hlsl-specs/blob/main/proposals/infra/INF-0004-validator-hashing.md
  32. #include "dxil_hash.h"
  33. #include <memory.h>
  34. #define S11 7
  35. #define S12 12
  36. #define S13 17
  37. #define S14 22
  38. #define S21 5
  39. #define S22 9
  40. #define S23 14
  41. #define S24 20
  42. #define S31 4
  43. #define S32 11
  44. #define S33 16
  45. #define S34 23
  46. #define S41 6
  47. #define S42 10
  48. #define S43 15
  49. #define S44 21
  50. static const BYTE padding[64] = {
  51. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  52. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  53. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  54. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  55. };
  56. static void FF(UINT &a, UINT b, UINT c, UINT d, UINT x, UINT8 s, UINT ac) {
  57. a += ((b & c) | (~b & d)) + x + ac;
  58. a = ((a << s) | (a >> (32 - s))) + b;
  59. }
  60. static void GG(UINT &a, UINT b, UINT c, UINT d, UINT x, UINT8 s, UINT ac) {
  61. a += ((b & d) | (c & ~d)) + x + ac;
  62. a = ((a << s) | (a >> (32 - s))) + b;
  63. }
  64. static void HH(UINT &a, UINT b, UINT c, UINT d, UINT x, UINT8 s, UINT ac) {
  65. a += (b ^ c ^ d) + x + ac;
  66. a = ((a << s) | (a >> (32 - s))) + b;
  67. }
  68. static void II(UINT &a, UINT b, UINT c, UINT d, UINT x, UINT8 s, UINT ac) {
  69. a += (c ^ (b | ~d)) + x + ac;
  70. a = ((a << s) | (a >> (32 - s))) + b;
  71. }
  72. void compute_dxil_hash(const BYTE *pData, UINT byteCount, BYTE *pOutHash) {
  73. UINT leftOver = byteCount & 0x3f;
  74. UINT padAmount;
  75. bool bTwoRowsPadding = false;
  76. if (leftOver < 56) {
  77. padAmount = 56 - leftOver;
  78. } else {
  79. padAmount = 120 - leftOver;
  80. bTwoRowsPadding = true;
  81. }
  82. UINT padAmountPlusSize = padAmount + 8;
  83. UINT state[4] = { 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476 };
  84. UINT N = (byteCount + padAmountPlusSize) >> 6;
  85. UINT offset = 0;
  86. UINT NextEndState = bTwoRowsPadding ? N - 2 : N - 1;
  87. const BYTE *pCurrData = pData;
  88. for (UINT i = 0; i < N; i++, offset += 64, pCurrData += 64) {
  89. UINT x[16] = {};
  90. const UINT *pX;
  91. if (i == NextEndState) {
  92. if (!bTwoRowsPadding && i == N - 1) {
  93. UINT remainder = byteCount - offset;
  94. x[0] = byteCount << 3;
  95. memcpy((BYTE *)x + 4, pCurrData, remainder);
  96. memcpy((BYTE *)x + 4 + remainder, padding, padAmount);
  97. x[15] = 1 | (byteCount << 1);
  98. } else if (bTwoRowsPadding) {
  99. if (i == N - 2) {
  100. UINT remainder = byteCount - offset;
  101. memcpy(x, pCurrData, remainder);
  102. memcpy((BYTE *)x + remainder, padding, padAmount - 56);
  103. NextEndState = N - 1;
  104. } else if (i == N - 1) {
  105. x[0] = byteCount << 3;
  106. memcpy((BYTE *)x + 4, padding + padAmount - 56, 56);
  107. x[15] = 1 | (byteCount << 1);
  108. }
  109. }
  110. pX = x;
  111. } else {
  112. pX = (const UINT *)pCurrData;
  113. }
  114. UINT a = state[0];
  115. UINT b = state[1];
  116. UINT c = state[2];
  117. UINT d = state[3];
  118. /* Round 1 */
  119. FF(a, b, c, d, pX[0], S11, 0xd76aa478); /* 1 */
  120. FF(d, a, b, c, pX[1], S12, 0xe8c7b756); /* 2 */
  121. FF(c, d, a, b, pX[2], S13, 0x242070db); /* 3 */
  122. FF(b, c, d, a, pX[3], S14, 0xc1bdceee); /* 4 */
  123. FF(a, b, c, d, pX[4], S11, 0xf57c0faf); /* 5 */
  124. FF(d, a, b, c, pX[5], S12, 0x4787c62a); /* 6 */
  125. FF(c, d, a, b, pX[6], S13, 0xa8304613); /* 7 */
  126. FF(b, c, d, a, pX[7], S14, 0xfd469501); /* 8 */
  127. FF(a, b, c, d, pX[8], S11, 0x698098d8); /* 9 */
  128. FF(d, a, b, c, pX[9], S12, 0x8b44f7af); /* 10 */
  129. FF(c, d, a, b, pX[10], S13, 0xffff5bb1); /* 11 */
  130. FF(b, c, d, a, pX[11], S14, 0x895cd7be); /* 12 */
  131. FF(a, b, c, d, pX[12], S11, 0x6b901122); /* 13 */
  132. FF(d, a, b, c, pX[13], S12, 0xfd987193); /* 14 */
  133. FF(c, d, a, b, pX[14], S13, 0xa679438e); /* 15 */
  134. FF(b, c, d, a, pX[15], S14, 0x49b40821); /* 16 */
  135. /* Round 2 */
  136. GG(a, b, c, d, pX[1], S21, 0xf61e2562); /* 17 */
  137. GG(d, a, b, c, pX[6], S22, 0xc040b340); /* 18 */
  138. GG(c, d, a, b, pX[11], S23, 0x265e5a51); /* 19 */
  139. GG(b, c, d, a, pX[0], S24, 0xe9b6c7aa); /* 20 */
  140. GG(a, b, c, d, pX[5], S21, 0xd62f105d); /* 21 */
  141. GG(d, a, b, c, pX[10], S22, 0x2441453); /* 22 */
  142. GG(c, d, a, b, pX[15], S23, 0xd8a1e681); /* 23 */
  143. GG(b, c, d, a, pX[4], S24, 0xe7d3fbc8); /* 24 */
  144. GG(a, b, c, d, pX[9], S21, 0x21e1cde6); /* 25 */
  145. GG(d, a, b, c, pX[14], S22, 0xc33707d6); /* 26 */
  146. GG(c, d, a, b, pX[3], S23, 0xf4d50d87); /* 27 */
  147. GG(b, c, d, a, pX[8], S24, 0x455a14ed); /* 28 */
  148. GG(a, b, c, d, pX[13], S21, 0xa9e3e905); /* 29 */
  149. GG(d, a, b, c, pX[2], S22, 0xfcefa3f8); /* 30 */
  150. GG(c, d, a, b, pX[7], S23, 0x676f02d9); /* 31 */
  151. GG(b, c, d, a, pX[12], S24, 0x8d2a4c8a); /* 32 */
  152. /* Round 3 */
  153. HH(a, b, c, d, pX[5], S31, 0xfffa3942); /* 33 */
  154. HH(d, a, b, c, pX[8], S32, 0x8771f681); /* 34 */
  155. HH(c, d, a, b, pX[11], S33, 0x6d9d6122); /* 35 */
  156. HH(b, c, d, a, pX[14], S34, 0xfde5380c); /* 36 */
  157. HH(a, b, c, d, pX[1], S31, 0xa4beea44); /* 37 */
  158. HH(d, a, b, c, pX[4], S32, 0x4bdecfa9); /* 38 */
  159. HH(c, d, a, b, pX[7], S33, 0xf6bb4b60); /* 39 */
  160. HH(b, c, d, a, pX[10], S34, 0xbebfbc70); /* 40 */
  161. HH(a, b, c, d, pX[13], S31, 0x289b7ec6); /* 41 */
  162. HH(d, a, b, c, pX[0], S32, 0xeaa127fa); /* 42 */
  163. HH(c, d, a, b, pX[3], S33, 0xd4ef3085); /* 43 */
  164. HH(b, c, d, a, pX[6], S34, 0x4881d05); /* 44 */
  165. HH(a, b, c, d, pX[9], S31, 0xd9d4d039); /* 45 */
  166. HH(d, a, b, c, pX[12], S32, 0xe6db99e5); /* 46 */
  167. HH(c, d, a, b, pX[15], S33, 0x1fa27cf8); /* 47 */
  168. HH(b, c, d, a, pX[2], S34, 0xc4ac5665); /* 48 */
  169. /* Round 4 */
  170. II(a, b, c, d, pX[0], S41, 0xf4292244); /* 49 */
  171. II(d, a, b, c, pX[7], S42, 0x432aff97); /* 50 */
  172. II(c, d, a, b, pX[14], S43, 0xab9423a7); /* 51 */
  173. II(b, c, d, a, pX[5], S44, 0xfc93a039); /* 52 */
  174. II(a, b, c, d, pX[12], S41, 0x655b59c3); /* 53 */
  175. II(d, a, b, c, pX[3], S42, 0x8f0ccc92); /* 54 */
  176. II(c, d, a, b, pX[10], S43, 0xffeff47d); /* 55 */
  177. II(b, c, d, a, pX[1], S44, 0x85845dd1); /* 56 */
  178. II(a, b, c, d, pX[8], S41, 0x6fa87e4f); /* 57 */
  179. II(d, a, b, c, pX[15], S42, 0xfe2ce6e0); /* 58 */
  180. II(c, d, a, b, pX[6], S43, 0xa3014314); /* 59 */
  181. II(b, c, d, a, pX[13], S44, 0x4e0811a1); /* 60 */
  182. II(a, b, c, d, pX[4], S41, 0xf7537e82); /* 61 */
  183. II(d, a, b, c, pX[11], S42, 0xbd3af235); /* 62 */
  184. II(c, d, a, b, pX[2], S43, 0x2ad7d2bb); /* 63 */
  185. II(b, c, d, a, pX[9], S44, 0xeb86d391); /* 64 */
  186. state[0] += a;
  187. state[1] += b;
  188. state[2] += c;
  189. state[3] += d;
  190. }
  191. memcpy(pOutHash, state, 16);
  192. }