Merged source and header files in directory structure. Got rid of SConstruct build.

4 files changed, 0 insertions, 759 deletions

diff --git a/src/security/digest/md5/md5MessageDigest.cpp b/src/security/digest/md5/md5MessageDigest.cpp
deleted file mode 100644
index a83f0623..00000000
--- a/src/security/digest/md5/md5MessageDigest.cpp
+++ /dev/null
@@ -1,347 +0,0 @@
-//
-// VMime library (http://www.vmime.org)
-// Copyright (C) 2002-2013 Vincent Richard <[email protected]>
-//
-// This program is free software; you can redistribute it and/or
-// modify it under the terms of the GNU General Public License as
-// published by the Free Software Foundation; either version 3 of
-// the License, or (at your option) any later version.
-//
-// This program is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-// General Public License for more details.
-//
-// You should have received a copy of the GNU General Public License along
-// with this program; if not, write to the Free Software Foundation, Inc.,
-// 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
-//
-// Linking this library statically or dynamically with other modules is making
-// a combined work based on this library.  Thus, the terms and conditions of
-// the GNU General Public License cover the whole combination.
-//
-//
-// Derived from cryptoapi implementation, originally based on the
-// public domain implementation written by Colin Plumb in 1993.
-//
-// Copyright (C) Cryptoapi developers.
-//
-// Algorithm Copyright:
-//
-//     Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
-//     rights reserved.
-//
-//     License to copy and use this software is granted provided that it
-//     is identified as the "RSA Data Security, Inc. MD5 Message-Digest
-//     Algorithm" in all material mentioning or referencing this software
-//     or this function.
-//
-//     License is also granted to make and use derivative works provided
-//     that such works are identified as "derived from the RSA Data
-//     Security, Inc. MD5 Message-Digest Algorithm" in all material
-//     mentioning or referencing the derived work.
-//
-//     RSA Data Security, Inc. makes no representations concerning either
-//     the merchantability of this software or the suitability of this
-//     software forany particular purpose. It is provided "as is"
-//     without express or implied warranty of any kind.
-//     These notices must be retained in any copies of any part of this
-//     documentation and/or software.
-
-#include "vmime/security/digest/md5/md5MessageDigest.hpp"
-
-#include <cstring>
-
-
-namespace vmime {
-namespace security {
-namespace digest {
-namespace md5 {
-
-
-md5MessageDigest::md5MessageDigest()
-{
-	init();
-}
-
-
-void md5MessageDigest::reset()
-{
-	init();
-}
-
-
-void md5MessageDigest::init()
-{
-	m_hash[0] = 0x67452301;
-	m_hash[1] = 0xefcdab89;
-	m_hash[2] = 0x98badcfe;
-	m_hash[3] = 0x10325476;
-
-	m_byteCount = 0;
-	m_finalized = false;
-}
-
-
-static void copyUint8Array(vmime_uint8* dest, const vmime_uint8* src, size_t count)
-{
-	for ( ; count >= 4 ; count -= 4, dest += 4, src += 4)
-	{
-		dest[0] = src[0];
-		dest[1] = src[1];
-		dest[2] = src[2];
-		dest[3] = src[3];
-	}
-
-	for ( ; count ; --count, ++dest, ++src)
-		dest[0] = src[0];
-}
-
-
-static inline vmime_uint32 swapUint32(const vmime_uint32 D)
-{
-	return ((D << 24) | ((D << 8) & 0x00FF0000) | ((D >> 8) & 0x0000FF00) | (D >> 24));
-}
-
-
-static inline void swapUint32Array(vmime_uint32* buf, size_t words)
-{
-	for ( ; words >= 4 ; words -= 4, buf += 4)
-	{
-		buf[0] = swapUint32(buf[0]);
-		buf[1] = swapUint32(buf[1]);
-		buf[2] = swapUint32(buf[2]);
-		buf[3] = swapUint32(buf[3]);
-	}
-
-	for ( ; words ; --words, ++buf)
-		buf[0] = swapUint32(buf[0]);
-}
-
-
-void md5MessageDigest::update(const byte_t b)
-{
-	update(&b, 1);
-}
-
-
-void md5MessageDigest::update(const string& s)
-{
-	update(reinterpret_cast <const byte_t*>(s.data()), s.length());
-}
-
-
-void md5MessageDigest::update(const byte_t* data, const size_t offset, const size_t len)
-{
-	update(data + offset, len);
-}
-
-
-void md5MessageDigest::update(const byte_t* data, const size_t length)
-{
-	const size_t avail = 64 - (m_byteCount & 0x3f);
-	size_t len = length;
-
-	m_byteCount += len;
-
-	if (avail > len)
-	{
-		copyUint8Array(m_block.b8 + (64 - avail), data, len);
-		return;
-	}
-
-	copyUint8Array(m_block.b8 + (64 - avail), data, avail);
-	transformHelper();
-
-	data += avail;
-	len -= avail;
-
-	while (len >= 64)
-	{
-		copyUint8Array(m_block.b8, data, 64);
-		transformHelper();
-
-		data += 64;
-		len -= 64;
-	}
-
-	copyUint8Array(m_block.b8, data, len);
-}
-
-
-void md5MessageDigest::finalize(const string& s)
-{
-	update(s);
-	finalize();
-}
-
-
-void md5MessageDigest::finalize(const byte_t* buffer, const size_t len)
-{
-	update(buffer, len);
-	finalize();
-}
-
-
-void md5MessageDigest::finalize(const byte_t* buffer,
-	const size_t offset, const size_t len)
-{
-	update(buffer, offset, len);
-	finalize();
-}
-
-
-void md5MessageDigest::finalize()
-{
-	const long offset = m_byteCount & 0x3f;
-
-	vmime_uint8* p = m_block.b8 + offset;
-	long padding = 56 - (offset + 1);
-
-	*p++ = 0x80;
-
-	if (padding < 0)
-	{
-		memset(p, 0x00, padding + 8);
-		transformHelper();
-		p = m_block.b8;
-		padding = 56;
-	}
-
-	memset(p, 0, padding);
-
-	m_block.b32[14] = static_cast <vmime_uint32>(m_byteCount << 3);
-	m_block.b32[15] = static_cast <vmime_uint32>(m_byteCount >> 29);
-
-#if VMIME_BYTE_ORDER_BIG_ENDIAN
-	swapUint32Array(m_block.b32, (64 - 8) / 4);
-#endif
-
-	transform();
-
-#if VMIME_BYTE_ORDER_BIG_ENDIAN
-	swapUint32Array(m_hash, 4);
-#endif
-
-	m_finalized = true;
-}
-
-
-void md5MessageDigest::transformHelper()
-{
-#if VMIME_BYTE_ORDER_BIG_ENDIAN
-	swapUint32Array(m_block.b32, 64 / 4);
-#endif
-	transform();
-}
-
-
-void md5MessageDigest::transform()
-{
-	const vmime_uint32* const in = m_block.b32;
-
-	vmime_uint32 a = m_hash[0];
-	vmime_uint32 b = m_hash[1];
-	vmime_uint32 c = m_hash[2];
-	vmime_uint32 d = m_hash[3];
-
-#define F1(x, y, z)	(z ^ (x & (y ^ z)))
-#define F2(x, y, z)	F1(z, x, y)
-#define F3(x, y, z)	(x ^ y ^ z)
-#define F4(x, y, z)	(y ^ (x | ~z))
-
-#define MD5STEP(f, w, x, y, z, in, s) \
-	(w += f(x, y, z) + in, w = (w<<s | w>>(32-s)) + x)
-
-	MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
-	MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
-	MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
-	MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
-	MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
-	MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
-	MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
-	MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
-	MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
-	MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
-	MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
-	MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
-	MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
-	MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
-	MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
-	MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
-
-	MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
-	MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
-	MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
-	MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
-	MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
-	MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
-	MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
-	MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
-	MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
-	MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
-	MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
-	MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
-	MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
-	MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
-	MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
-	MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
-
-	MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
-	MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
-	MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
-	MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
-	MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
-	MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
-	MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
-	MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
-	MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
-	MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
-	MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
-	MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
-	MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
-	MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
-	MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
-	MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
-
-	MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
-	MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
-	MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
-	MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
-	MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
-	MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
-	MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
-	MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
-	MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
-	MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
-	MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
-	MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
-	MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
-	MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
-	MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
-	MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
-
-	m_hash[0] += a;
-	m_hash[1] += b;
-	m_hash[2] += c;
-	m_hash[3] += d;
-}
-
-
-size_t md5MessageDigest::getDigestLength() const
-{
-	return 16;
-}
-
-
-const byte_t* md5MessageDigest::getDigest() const
-{
-	return reinterpret_cast <const byte_t*>(m_hash);
-}
-
-
-} // md5
-} // digest
-} // security
-} // vmime
-
diff --git a/src/security/digest/messageDigest.cpp b/src/security/digest/messageDigest.cpp
deleted file mode 100644
index 18fc8628..00000000
--- a/src/security/digest/messageDigest.cpp
+++ /dev/null
@@ -1,57 +0,0 @@
-//
-// VMime library (http://www.vmime.org)
-// Copyright (C) 2002-2013 Vincent Richard <[email protected]>
-//
-// This program is free software; you can redistribute it and/or
-// modify it under the terms of the GNU General Public License as
-// published by the Free Software Foundation; either version 3 of
-// the License, or (at your option) any later version.
-//
-// This program is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-// General Public License for more details.
-//
-// You should have received a copy of the GNU General Public License along
-// with this program; if not, write to the Free Software Foundation, Inc.,
-// 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
-//
-// Linking this library statically or dynamically with other modules is making
-// a combined work based on this library.  Thus, the terms and conditions of
-// the GNU General Public License cover the whole combination.
-//
-
-#include "vmime/security/digest/messageDigest.hpp"
-
-#include <sstream>
-
-
-namespace vmime {
-namespace security {
-namespace digest {
-
-
-const string messageDigest::getHexDigest() const
-{
-	const byte_t* hash = getDigest();
-	const size_t len = getDigestLength();
-
-	static const unsigned char hex[] = "0123456789abcdef";
-
-	std::ostringstream oss;
-	oss.imbue(std::locale::classic());
-
-	for (size_t i = 0 ; i < len ; ++i)
-	{
-		oss << hex[(hash[i] & 0xf0) >> 4];
-		oss << hex[(hash[i] & 0x0f)];
-	}
-
-	return oss.str();
-}
-
-
-} // digest
-} // security
-} // vmime
-
diff --git a/src/security/digest/messageDigestFactory.cpp b/src/security/digest/messageDigestFactory.cpp
deleted file mode 100644
index 2831c5a1..00000000
--- a/src/security/digest/messageDigestFactory.cpp
+++ /dev/null
@@ -1,84 +0,0 @@
-//
-// VMime library (http://www.vmime.org)
-// Copyright (C) 2002-2013 Vincent Richard <[email protected]>
-//
-// This program is free software; you can redistribute it and/or
-// modify it under the terms of the GNU General Public License as
-// published by the Free Software Foundation; either version 3 of
-// the License, or (at your option) any later version.
-//
-// This program is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-// General Public License for more details.
-//
-// You should have received a copy of the GNU General Public License along
-// with this program; if not, write to the Free Software Foundation, Inc.,
-// 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
-//
-// Linking this library statically or dynamically with other modules is making
-// a combined work based on this library.  Thus, the terms and conditions of
-// the GNU General Public License cover the whole combination.
-//
-
-#include "vmime/security/digest/messageDigestFactory.hpp"
-#include "vmime/exception.hpp"
-
-#include "vmime/security/digest/md5/md5MessageDigest.hpp"
-#include "vmime/security/digest/sha1/sha1MessageDigest.hpp"
-
-
-namespace vmime {
-namespace security {
-namespace digest {
-
-
-messageDigestFactory::messageDigestFactory()
-{
-	registerAlgorithm <md5::md5MessageDigest>("md5");
-	registerAlgorithm <sha1::sha1MessageDigest>("sha1");
-}
-
-
-messageDigestFactory::~messageDigestFactory()
-{
-}
-
-
-messageDigestFactory* messageDigestFactory::getInstance()
-{
-	static messageDigestFactory instance;
-	return (&instance);
-}
-
-
-shared_ptr <messageDigest> messageDigestFactory::create(const string& name)
-{
-	const MapType::const_iterator it = m_algos.find
-		(utility::stringUtils::toLower(name));
-
-	if (it != m_algos.end())
-		return (*it).second->create();
-
-	throw exceptions::no_digest_algorithm_available(name);
-}
-
-
-const std::vector <string> messageDigestFactory::getSupportedAlgorithms() const
-{
-	std::vector <string> res;
-
-	for (MapType::const_iterator it = m_algos.begin() ;
-	     it != m_algos.end() ; ++it)
-	{
-		res.push_back((*it).first);
-	}
-
-	return res;
-}
-
-
-} // digest
-} // security
-} // vmime
-
diff --git a/src/security/digest/sha1/sha1MessageDigest.cpp b/src/security/digest/sha1/sha1MessageDigest.cpp
deleted file mode 100644
index aa055af5..00000000
--- a/src/security/digest/sha1/sha1MessageDigest.cpp
+++ /dev/null
@@ -1,271 +0,0 @@
-//
-// VMime library (http://www.vmime.org)
-// Copyright (C) 2002-2013 Vincent Richard <[email protected]>
-//
-// This program is free software; you can redistribute it and/or
-// modify it under the terms of the GNU General Public License as
-// published by the Free Software Foundation; either version 3 of
-// the License, or (at your option) any later version.
-//
-// This program is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-// General Public License for more details.
-//
-// You should have received a copy of the GNU General Public License along
-// with this program; if not, write to the Free Software Foundation, Inc.,
-// 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
-//
-// Linking this library statically or dynamically with other modules is making
-// a combined work based on this library.  Thus, the terms and conditions of
-// the GNU General Public License cover the whole combination.
-//
-//
-// This is an implementation by Steve Reid <[email protected]>
-// 100% public domain.
-
-#include "vmime/security/digest/sha1/sha1MessageDigest.hpp"
-
-#include <cstring>
-#include <cassert>
-
-
-namespace vmime {
-namespace security {
-namespace digest {
-namespace sha1 {
-
-
-#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
-
-// blk0() and blk() perform the initial expand.
-// I got the idea of expanding during the round function from SSLeay
-#if VMIME_BYTE_ORDER_LITTLE_ENDIAN
-	#define blk0(i) (block->l[i] = (rol(block->l[i], 24) & 0xFF00FF00) \
-	                             | (rol(block->l[i],  8) & 0x00FF00FF))
-#else
-	#define blk0(i) block->l[i]
-#endif
-
-#define blk(i) (block->l[i & 15] = rol(block->l[(i + 13) & 15] ^ block->l[(i + 8) & 15] \
-                ^ block->l[(i + 2) & 15] ^ block->l[i & 15], 1))
-
-// (R0+R1), R2, R3, R4 are the different operations used in SHA1
-#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
-#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
-#define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
-#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
-#define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
-
-
-sha1MessageDigest::sha1MessageDigest()
-{
-	init();
-}
-
-
-void sha1MessageDigest::reset()
-{
-	init();
-}
-
-
-void sha1MessageDigest::init()
-{
-	m_state[0] = 0x67452301;
-	m_state[1] = 0xefcdab89;
-	m_state[2] = 0x98badcfe;
-	m_state[3] = 0x10325476;
-	m_state[4] = 0xc3d2e1f0;
-
-	m_count[0] = 0;
-	m_count[1] = 0;
-}
-
-
-void sha1MessageDigest::update(const byte_t b)
-{
-	update(&b, 1);
-}
-
-
-void sha1MessageDigest::update(const string& s)
-{
-	update(reinterpret_cast <const byte_t*>(s.data()), s.length());
-}
-
-
-void sha1MessageDigest::update(const byte_t* buffer, const size_t offset,
-	const unsigned long len)
-{
-	update(buffer + offset, len);
-}
-
-
-void sha1MessageDigest::update(const byte_t* buffer, const size_t len)
-{
-	unsigned int i, j;
-
-	j = (m_count[0] >> 3) & 63;
-
-	if ((m_count[0] += static_cast <unsigned int>(len << 3)) < static_cast <unsigned int>(len << 3))
-		m_count[1]++;
-
-	m_count[1] += static_cast <unsigned int>(len >> 29);
-
-	if ((j + len) > 63)
-	{
-		memcpy(&m_buffer[j], buffer, (i = 64 - j));
-
-		transform(m_state, m_buffer);
-
-		for ( ; i + 63 < len ; i += 64)
-			transform(m_state, &buffer[i]);
-
-		j = 0;
-	}
-	else
-	{
-		i = 0;
-	}
-
-	std::memcpy(&m_buffer[j], &buffer[i], len - i);
-}
-
-
-void sha1MessageDigest::finalize()
-{
-	unsigned int i, j;
-	unsigned char finalcount[8];
-
-	for (i = 0 ; i < 8 ; i++)
-	{
-		finalcount[i] = static_cast <unsigned char>
-			((m_count[(i >= 4 ? 0 : 1)]
-			 >> ((3-(i & 3)) * 8) ) & 255);  // Endian independent
-	}
-
-	update(reinterpret_cast <const byte_t*>("\200"), 1);
-
-	while ((m_count[0] & 504) != 448)
-		update(reinterpret_cast <const byte_t*>("\0"), 1);
-
-	update(finalcount, 8);  // Should cause a transform()
-
-	for (i = 0 ; i < 20 ; i++)
-	{
-		m_digest[i] = static_cast <unsigned char>
-			((m_state[i >> 2] >> ((3 - (i & 3)) * 8)) & 255);
-	}
-
-	// Wipe variables
-	i = j = 0;
-
-	std::memset(m_buffer, 0, 64);
-	std::memset(m_state, 0, 5 * sizeof(unsigned int));
-	std::memset(m_count, 0, 2 * sizeof(unsigned int));
-	std::memset(&finalcount, 0, 8);
-}
-
-
-void sha1MessageDigest::finalize(const string& s)
-{
-	finalize(reinterpret_cast <const byte_t*>(s.data()), s.length());
-}
-
-
-void sha1MessageDigest::finalize(const byte_t* buffer, const size_t len)
-{
-	update(buffer, len);
-	finalize();
-}
-
-
-void sha1MessageDigest::finalize(const byte_t* buffer,
-	const size_t offset, const size_t len)
-{
-	finalize(buffer + offset, len);
-}
-
-
-/** Hash a single 512-bit block.
-  * This is the core of the algorithm.
-  */
-void sha1MessageDigest::transform
-	(unsigned int state[5], const unsigned char buffer[64])
-{
-	unsigned int a, b, c, d, e;
-
-	typedef union
-	{
-		unsigned char c[64];
-		unsigned int l[16];
-	} CHAR64LONG16;
-
-	assert(sizeof(unsigned int) == 4);
-
-	CHAR64LONG16* block;
-	static unsigned char workspace[64];
-
-	block = reinterpret_cast <CHAR64LONG16*>(workspace);
-	memcpy(block, buffer, 64);
-
-	// Copy context->state[] to working vars
-	a = state[0];
-	b = state[1];
-	c = state[2];
-	d = state[3];
-	e = state[4];
-
-	// 4 rounds of 20 operations each. Loop unrolled.
-	R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3);
-	R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7);
-	R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11);
-	R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15);
-	R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
-	R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23);
-	R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27);
-	R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31);
-	R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35);
-	R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39);
-	R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43);
-	R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47);
-	R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51);
-	R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55);
-	R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59);
-	R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63);
-	R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67);
-	R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71);
-	R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75);
-	R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79);
-
-	// Add the working vars back into context.state[]
-	state[0] += a;
-	state[1] += b;
-	state[2] += c;
-	state[3] += d;
-	state[4] += e;
-
-	// Wipe variables
-	a = b = c = d = e = 0;
-}
-
-
-size_t sha1MessageDigest::getDigestLength() const
-{
-	return 20;
-}
-
-
-const byte_t* sha1MessageDigest::getDigest() const
-{
-	return m_digest;
-}
-
-
-} // sha1
-} // digest
-} // security
-} // vmime
-
-