1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
/* Copyright (C) 2010 Wildfire Games.
* This file is part of 0 A.D.
*
* 0 A.D. 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 2 of the License, or
* (at your option) any later version.
*
* 0 A.D. 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 0 A.D. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef INCLUDED_MD5
#define INCLUDED_MD5
#include <cstring>
/**
* MD5 hashing algorithm. Note that MD5 is broken and must not be used for
* anything that requires security.
*/
class MD5
{
public:
static const size_t DIGESTSIZE = 16;
MD5();
void Update(const u8* data, size_t len)
{
// (Defined inline for efficiency in the common fixed-length fits-in-buffer case)
const size_t CHUNK_SIZE = sizeof(m_Buf);
m_InputLen += len;
// If we have enough space in m_Buf and won't flush, simply append the input
if (m_BufLen + len < CHUNK_SIZE)
{
memcpy(m_Buf + m_BufLen, data, len);
m_BufLen += len;
return;
}
// Fall back to non-inline function if we have to do more work
UpdateRest(data, len);
}
void Final(u8* digest);
private:
void InitState();
void UpdateRest(const u8* data, size_t len);
void Transform(const u32* in);
u32 m_Digest[4]; // internal state
u8 m_Buf[64]; // buffered input bytes
size_t m_BufLen; // bytes in m_Buf that are valid
u64 m_InputLen; // bytes
};
#endif // INCLUDED_MD5
|
