20621a0642Now diablo.h is treated in the same way as all other header files of Source, as it only contains the declarations of global variables and functions of diablo.cpp. Besides consistency, this also enables mods to include diablo.h just like any other header file without having to include every header file (and without having to include C++ specific aspects of the now all.h).
126 lines
2.6 KiB
C++
126 lines
2.6 KiB
C++
#include "all.h"
|
|
|
|
SHA1Context sgSHA1[3];
|
|
|
|
void SHA1Clear()
|
|
{
|
|
memset(sgSHA1, 0, sizeof(sgSHA1));
|
|
}
|
|
|
|
void SHA1Result(int n, char Message_Digest[SHA1HashSize])
|
|
{
|
|
DWORD *Message_Digest_Block;
|
|
int i;
|
|
|
|
Message_Digest_Block = (DWORD *)Message_Digest;
|
|
if (Message_Digest) {
|
|
for (i = 0; i < 5; i++) {
|
|
*Message_Digest_Block = sgSHA1[n].state[i];
|
|
Message_Digest_Block++;
|
|
}
|
|
}
|
|
}
|
|
|
|
void SHA1Calculate(int n, const char *data, char Message_Digest[SHA1HashSize])
|
|
{
|
|
SHA1Input(&sgSHA1[n], data, 64);
|
|
if (Message_Digest)
|
|
SHA1Result(n, Message_Digest);
|
|
}
|
|
|
|
void SHA1Input(SHA1Context *context, const char *message_array, int len)
|
|
{
|
|
int i, count;
|
|
|
|
count = context->count[0] + 8 * len;
|
|
if (count < context->count[0])
|
|
context->count[1]++;
|
|
|
|
context->count[0] = count;
|
|
context->count[1] += len >> 29;
|
|
|
|
for (i = len; i >= 64; i -= 64) {
|
|
memcpy(context->buffer, message_array, sizeof(context->buffer));
|
|
SHA1ProcessMessageBlock(context);
|
|
message_array += 64;
|
|
}
|
|
}
|
|
|
|
void SHA1ProcessMessageBlock(SHA1Context *context)
|
|
{
|
|
int i, temp;
|
|
int W[80];
|
|
int A, B, C, D, E;
|
|
|
|
DWORD *buf = (DWORD *)context->buffer;
|
|
for (i = 0; i < 16; i++)
|
|
W[i] = buf[i];
|
|
|
|
for (i = 16; i < 80; i++) {
|
|
W[i] = W[i - 16] ^ W[i - 14] ^ W[i - 8] ^ W[i - 3];
|
|
}
|
|
|
|
A = context->state[0];
|
|
B = context->state[1];
|
|
C = context->state[2];
|
|
D = context->state[3];
|
|
E = context->state[4];
|
|
|
|
for (i = 0; i < 20; i++) {
|
|
temp = SHA1CircularShift(5, A) + ((B & C) | ((~B) & D)) + E + W[i] + 0x5A827999;
|
|
E = D;
|
|
D = C;
|
|
C = SHA1CircularShift(30, B);
|
|
B = A;
|
|
A = temp;
|
|
}
|
|
|
|
for (i = 20; i < 40; i++) {
|
|
temp = SHA1CircularShift(5, A) + (B ^ C ^ D) + E + W[i] + 0x6ED9EBA1;
|
|
E = D;
|
|
D = C;
|
|
C = SHA1CircularShift(30, B);
|
|
B = A;
|
|
A = temp;
|
|
}
|
|
|
|
for (i = 40; i < 60; i++) {
|
|
temp = SHA1CircularShift(5, A) + ((B & C) | (B & D) | (C & D)) + E + W[i] + 0x8F1BBCDC;
|
|
E = D;
|
|
D = C;
|
|
C = SHA1CircularShift(30, B);
|
|
B = A;
|
|
A = temp;
|
|
}
|
|
|
|
for (i = 60; i < 80; i++) {
|
|
temp = SHA1CircularShift(5, A) + (B ^ C ^ D) + E + W[i] + 0xCA62C1D6;
|
|
E = D;
|
|
D = C;
|
|
C = SHA1CircularShift(30, B);
|
|
B = A;
|
|
A = temp;
|
|
}
|
|
|
|
context->state[0] += A;
|
|
context->state[1] += B;
|
|
context->state[2] += C;
|
|
context->state[3] += D;
|
|
context->state[4] += E;
|
|
}
|
|
|
|
void SHA1Reset(int n)
|
|
{
|
|
SHA1Init(&sgSHA1[n]);
|
|
}
|
|
|
|
void SHA1Init(SHA1Context *context)
|
|
{
|
|
context->count[0] = 0;
|
|
context->count[1] = 0;
|
|
context->state[0] = 0x67452301;
|
|
context->state[1] = 0xEFCDAB89;
|
|
context->state[2] = 0x98BADCFE;
|
|
context->state[3] = 0x10325476;
|
|
context->state[4] = 0xC3D2E1F0;
|
|
}
|