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
|
/* <!-- copyright */
/*
* aria2 - The high speed download utility
*
* Copyright (C) 2006 Tatsuhiro Tsujikawa
*
* 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
*
* In addition, as a special exception, the copyright holders give
* permission to link the code of portions of this program with the
* OpenSSL library under certain conditions as described in each
* individual source file, and distribute linked combinations
* including the two.
* You must obey the GNU General Public License in all respects
* for all of the code used other than OpenSSL. If you modify
* file(s) with this exception, you may extend this exception to your
* version of the file(s), but you are not obligated to do so. If you
* do not wish to do so, delete this exception statement from your
* version. If you delete this exception statement from all source
* files in the program, then also delete it here.
*/
/* copyright --> */
#include "ShaVisitor.h"
#include "Util.h"
ShaVisitor::ShaVisitor():
ctx(DIGEST_ALGO_SHA1) {
ctx.digestInit();
}
ShaVisitor::~ShaVisitor() {}
void ShaVisitor::visit(const Data* d) {
if(d->isNumber()) {
ctx.digestUpdate("i", 1);
} else {
string lenStr = Util::llitos(d->getLen());
ctx.digestUpdate(lenStr.c_str(), lenStr.size());
ctx.digestUpdate(":", 1);
}
ctx.digestUpdate(d->getData(), d->getLen());
if(d->isNumber()) {
ctx.digestUpdate("e", 1);
}
}
void ShaVisitor::visit(const Dictionary* d) {
ctx.digestUpdate("d", 1);
const Order& v = d->getOrder();
for(Order::const_iterator itr = v.begin(); itr != v.end(); itr++) {
string lenStr = Util::llitos(itr->size());
ctx.digestUpdate(lenStr.c_str(), lenStr.size());
ctx.digestUpdate(":", 1);
ctx.digestUpdate(itr->c_str(), itr->size());
const MetaEntry* e = d->get(*itr);
this->visit(e);
}
ctx.digestUpdate("e", 1);
}
void ShaVisitor::visit(const List* l) {
ctx.digestUpdate("l", 1);
for(MetaList::const_iterator itr = l->getList().begin(); itr != l->getList().end(); itr++) {
this->visit(*itr);
}
ctx.digestUpdate("e", 1);
}
void ShaVisitor::visit(const MetaEntry* e) {
if(dynamic_cast<const Data*>(e) != NULL) {
visit((const Data*)e);
} else if(dynamic_cast<const Dictionary*>(e) != NULL) {
visit((const Dictionary*)e);
} else if(dynamic_cast<const List*>(e) != NULL) {
visit((const List*)e);
}
}
void ShaVisitor::getHash(unsigned char* hashValue, int& len) {
len = ctx.digestLength();
ctx.digestFinal(hashValue);
}
|
