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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
|
/***************************************************************************
* Copyright (C) 2005 by Joris Guisson *
* [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 2 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. *
***************************************************************************/
#include <qurl.h>
#include <string.h>
#include <algorithm>
#include "log.h"
#include "sha1hash.h"
#include "sha1hashgen.h"
#include "urlencoder.h"
#include <stdio.h>
namespace bt
{
SHA1Hash::SHA1Hash()
{
std::fill(hash,hash+20,'\0');
}
SHA1Hash::SHA1Hash(const SHA1Hash & other)
{
for (int i = 0;i < 20;i++)
hash[i] = other.hash[i];
}
SHA1Hash::SHA1Hash(const Uint8* h)
{
memcpy(hash,h,20);
}
SHA1Hash::~SHA1Hash()
{}
SHA1Hash & SHA1Hash::operator = (const SHA1Hash & other)
{
for (int i = 0;i < 20;i++)
hash[i] = other.hash[i];
return *this;
}
bool SHA1Hash::operator == (const SHA1Hash & other) const
{
for (int i = 0;i < 20;i++)
if (hash[i] != other.hash[i])
return false;
return true;
}
SHA1Hash SHA1Hash::generate(const Uint8* data,Uint32 len)
{
SHA1HashGen hg;
return hg.generate(data,len);
}
QString SHA1Hash::toString() const
{
char tmp[41];
QString fmt;
for (int i = 0;i < 20;i++)
fmt += "%02x";
tmp[40] = '\0';
snprintf(tmp,41,fmt.ascii(),
hash[0],hash[1],hash[2],hash[3],hash[4],
hash[5],hash[6],hash[7],hash[8],hash[9],
hash[10],hash[11],hash[12],hash[13],hash[14],
hash[15],hash[16],hash[17],hash[18],hash[19]);
return QString(tmp);
}
QByteArray SHA1Hash::toByteArray() const
{
QByteArray arr(20);
arr.duplicate((const char*)hash,20);
return arr;
}
QString SHA1Hash::toURLString() const
{
return URLEncoder::encode((const char*)hash,20);
}
Log & operator << (Log & out,const SHA1Hash & h)
{
out << h.toString();
return out;
}
SHA1Hash operator ^ (const SHA1Hash & a,const SHA1Hash & b)
{
SHA1Hash k;
for (int i = 0;i < 20;i++)
{
k.hash[i] = a.hash[i] ^ b.hash[i];
}
return k;
}
bool operator < (const SHA1Hash & a,const SHA1Hash & b)
{
for (int i = 0;i < 20;i++)
{
if (a.hash[i] < b.hash[i])
return true;
else if (a.hash[i] > b.hash[i])
return false;
}
return false;
}
}
|
