Function sha_transform

src/common/sha.cpp:127–242

// do SHA transformation

static void sha_transform(SHA_INFO *sha_info)
{
	int i;
	Sha1::LONG W[80];

	const BYTE* dp = sha_info->data;

/*
the following makes sure that at least one code block below is
traversed or an error is reported, without the necessity for nested
preprocessor if/else/endif blocks, which are a great pain in the
nether regions of the anatomy...
*/
#undef SWAP_DONE

#if (SHA_BYTE_ORDER == 1234)
#define SWAP_DONE
	for (i = 0; i < 16; ++i)
	{
		const Sha1::LONG T = *((Sha1::LONG *) dp);
		dp += 4;
		W[i] =  ((T << 24) & 0xff000000) | ((T <<  8) & 0x00ff0000) |
			((T >>  8) & 0x0000ff00) | ((T >> 24) & 0x000000ff);
	}
#endif // SHA_BYTE_ORDER == 1234

#if (SHA_BYTE_ORDER == 4321)
#define SWAP_DONE
	for (i = 0; i < 16; ++i)
	{
		const Sha1::LONG T = *((Sha1::LONG *) dp);
		dp += 4;
		W[i] = T32(T);
	}
#endif // SHA_BYTE_ORDER == 4321

#if (SHA_BYTE_ORDER == 12345678)
#define SWAP_DONE
	for (i = 0; i < 16; i += 2)
	{
		Sha1::LONG T = *((Sha1::LONG *) dp);
		dp += 8;
		W[i] =  ((T << 24) & 0xff000000) | ((T <<  8) & 0x00ff0000) |
			((T >>  8) & 0x0000ff00) | ((T >> 24) & 0x000000ff);
		T >>= 32;
		W[i + 1] = ((T << 24) & 0xff000000) | ((T <<  8) & 0x00ff0000) |
			((T >>  8) & 0x0000ff00) | ((T >> 24) & 0x000000ff);
	}
#endif // SHA_BYTE_ORDER == 12345678

#if (SHA_BYTE_ORDER == 87654321)
#define SWAP_DONE
	for (i = 0; i < 16; i += 2)
	{
		const Sha1::LONG T = *((Sha1::LONG *) dp);
		dp += 8;
		W[i] = T32(T >> 32);
		W[i + 1] = T32(T);