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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
|
/***************************************************************************
* Copyright (C) 2005 by *
* Joris Guisson <joris.guisson@gmail.com> *
* Ivan Vasic <ivasic@gmail.com> *
* *
* 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 <tqfile.h>
#include <tqdatastream.h>
#include <tqstringlist.h>
#include <util/log.h>
#include <util/functions.h>
#include <util/error.h>
#include <util/sha1hashgen.h>
#include <time.h>
#include <stdlib.h>
#include "torrent.h"
#include "bdecoder.h"
#include "bnode.h"
#include "announcelist.h"
#include <klocale.h>
namespace bt
{
Torrent::Torrent() : piece_length(0),file_length(0),priv_torrent(false)
{
encoding = "utf8";
trackers = 0;
}
Torrent::~Torrent()
{
delete trackers;
}
void Torrent::load(const TQByteArray & data,bool verbose)
{
BNode* node = 0;
try
{
BDecoder decoder(data,verbose);
node = decoder.decode();
BDictNode* dict = dynamic_cast<BDictNode*>(node);
if (!dict)
throw Error(i18n("Corrupted torrent!"));
// see if we can find an encoding node
BValueNode* enc = dict->getValue("encoding");
if (enc)
{
encoding = enc->data().toString();
Out() << "Encoding : " << encoding << endl;
}
BValueNode* announce = dict->getValue("announce");
BListNode* nodes = dict->getList("nodes");
if (!announce && !nodes)
throw Error(i18n("Torrent has no announce or nodes field"));
if (announce)
loadTrackerURL(announce);
if (nodes) // DHT torrrents have a node key
loadNodes(nodes);
loadInfo(dict->getDict(TQString("info")));
loadAnnounceList(dict->getData("announce-list"));
BNode* n = dict->getData("info");
SHA1HashGen hg;
Uint8* info = (Uint8*)data.data();
info_hash = hg.generate(info + n->getOffset(),n->getLength());
delete node;
}
catch (...)
{
delete node;
throw;
}
}
void Torrent::load(const TQString & file,bool verbose)
{
TQFile fptr(file);
if (!fptr.open(IO_ReadOnly))
throw Error(i18n(" Unable to open torrent file %1 : %2")
.tqarg(file).tqarg(fptr.errorString()));
TQByteArray data(fptr.size());
// Out() << "File size = " << fptr.size() << endl;
fptr.readBlock(data.data(),fptr.size());
load(data,verbose);
}
void Torrent::loadInfo(BDictNode* dict)
{
if (!dict)
throw Error(i18n("Corrupted torrent!"));
loadPieceLength(dict->getValue("piece length"));
BValueNode* n = dict->getValue("length");
if (n)
loadFileLength(n);
else
loadFiles(dict->getList("files"));
loadHash(dict->getValue("pieces"));
loadName(dict->getValue("name"));
n = dict->getValue("private");
if (n && n->data().toInt() == 1)
priv_torrent = true;
// do a safety check to see if the number of hashes matches the file_length
Uint32 num_chunks = (file_length / this->piece_length);
if (file_length % piece_length > 0)
num_chunks++;
if (num_chunks != hash_pieces.count())
{
Out(SYS_GEN|LOG_DEBUG) << "File sizes and number of hashes do not match for " << name_suggestion << endl;
throw Error(i18n("Corrupted torrent!"));
}
}
void Torrent::loadFiles(BListNode* node)
{
Out() << "Multi file torrent" << endl;
if (!node)
throw Error(i18n("Corrupted torrent!"));
Uint32 idx = 0;
BListNode* fl = node;
for (Uint32 i = 0;i < fl->getNumChildren();i++)
{
BDictNode* d = fl->getDict(i);
if (!d)
throw Error(i18n("Corrupted torrent!"));
BListNode* ln = d->getList("path");
if (!ln)
throw Error(i18n("Corrupted torrent!"));
TQString path;
for (Uint32 j = 0;j < ln->getNumChildren();j++)
{
BValueNode* v = ln->getValue(j);
if (!v || v->data().getType() != Value::STRING)
throw Error(i18n("Corrupted torrent!"));
TQString sd = v->data().toString(encoding);
path += sd;
if (j + 1 < ln->getNumChildren())
path += bt::DirSeparator();
}
// we do not want empty dirs
if (path.endsWith(bt::DirSeparator()))
continue;
if (!checkPathForDirectoryTraversal(path))
throw Error(i18n("Corrupted torrent!"));
BValueNode* v = d->getValue("length");
if (!v)
throw Error(i18n("Corrupted torrent!"));
if (v->data().getType() == Value::INT || v->data().getType() == Value::INT64)
{
Uint64 s = v->data().toInt64();
TorrentFile file(idx,path,file_length,s,piece_length);
// update file_length
file_length += s;
files.append(file);
}
else
{
throw Error(i18n("Corrupted torrent!"));
}
idx++;
}
}
void Torrent::loadTrackerURL(BValueNode* node)
{
if (!node || node->data().getType() != Value::STRING)
throw Error(i18n("Corrupted torrent!"));
// tracker_urls.append(KURL(node->data().toString(encoding).stripWhiteSpace()));
if (!trackers)
trackers = new TrackerTier();
trackers->urls.append(KURL(node->data().toString(encoding).stripWhiteSpace()));
}
void Torrent::loadPieceLength(BValueNode* node)
{
if (!node)
throw Error(i18n("Corrupted torrent!"));
if (node->data().getType() == Value::INT)
piece_length = node->data().toInt();
else if (node->data().getType() == Value::INT64)
piece_length = node->data().toInt64();
else
throw Error(i18n("Corrupted torrent!"));
}
void Torrent::loadFileLength(BValueNode* node)
{
if (!node)
throw Error(i18n("Corrupted torrent!"));
if (node->data().getType() == Value::INT)
file_length = node->data().toInt();
else if (node->data().getType() == Value::INT64)
file_length = node->data().toInt64();
else
throw Error(i18n("Corrupted torrent!"));
}
void Torrent::loadHash(BValueNode* node)
{
if (!node || node->data().getType() != Value::STRING)
throw Error(i18n("Corrupted torrent!"));
TQByteArray hash_string = node->data().toByteArray();
for (unsigned int i = 0;i < hash_string.size();i+=20)
{
Uint8 h[20];
memcpy(h,hash_string.data()+i,20);
SHA1Hash hash(h);
hash_pieces.append(hash);
}
}
void Torrent::loadName(BValueNode* node)
{
if (!node || node->data().getType() != Value::STRING)
throw Error(i18n("Corrupted torrent!"));
name_suggestion = node->data().toString(encoding);
}
void Torrent::loadAnnounceList(BNode* node)
{
if (!node)
return;
BListNode* ml = dynamic_cast<BListNode*>(node);
if (!ml)
return;
if (!trackers)
trackers = new TrackerTier();
TrackerTier* tier = trackers;
//ml->printDebugInfo();
for (Uint32 i = 0;i < ml->getNumChildren();i++)
{
BListNode* url = dynamic_cast<BListNode*>(ml->getChild(i));
if (!url)
throw Error(i18n("Parse Error"));
for (Uint32 j = 0;j < url->getNumChildren();j++)
{
BValueNode* vn = dynamic_cast<BValueNode*>(url->getChild(j));
if (!vn)
throw Error(i18n("Parse Error"));
KURL url(vn->data().toString().stripWhiteSpace());
tier->urls.append(url);
//Out() << "Added tracker " << url << endl;
}
tier->next = new TrackerTier();
tier = tier->next;
}
}
void Torrent::loadNodes(BListNode* node)
{
for (Uint32 i = 0;i < node->getNumChildren();i++)
{
BListNode* c = node->getList(i);
if (!c || c->getNumChildren() != 2)
throw Error(i18n("Corrupted torrent!"));
// first child is the IP, second the port
BValueNode* ip = c->getValue(0);
BValueNode* port = c->getValue(1);
if (!ip || !port)
throw Error(i18n("Corrupted torrent!"));
if (ip->data().getType() != Value::STRING)
throw Error(i18n("Corrupted torrent!"));
if (port->data().getType() != Value::INT)
throw Error(i18n("Corrupted torrent!"));
// add the DHT node
kt::DHTNode n;
n.ip = ip->data().toString();
n.port = port->data().toInt();
nodes.append(n);
}
}
void Torrent::debugPrintInfo()
{
Out() << "Name : " << name_suggestion << endl;
// for (KURL::List::iterator i = tracker_urls.begin();i != tracker_urls.end();i++)
// Out() << "Tracker URL : " << *i << endl;
Out() << "Piece Length : " << piece_length << endl;
if (this->isMultiFile())
{
Out() << "Files : " << endl;
Out() << "===================================" << endl;
for (Uint32 i = 0;i < getNumFiles();i++)
{
TorrentFile & tf = getFile(i);
Out() << "Path : " << tf.getPath() << endl;
Out() << "Size : " << tf.getSize() << endl;
Out() << "First Chunk : " << tf.getFirstChunk() << endl;
Out() << "Last Chunk : " << tf.getLastChunk() << endl;
Out() << "First Chunk Off : " << tf.getFirstChunkOffset() << endl;
Out() << "Last Chunk Size : " << tf.getLastChunkSize() << endl;
Out() << "===================================" << endl;
}
}
else
{
Out() << "File Length : " << file_length << endl;
}
Out() << "Pieces : " << hash_pieces.size() << endl;
}
bool Torrent::verifyHash(const SHA1Hash & h,Uint32 index)
{
if (index >= hash_pieces.count())
return false;
const SHA1Hash & ph = hash_pieces[index];
return ph == h;
}
const SHA1Hash & Torrent::getHash(Uint32 idx) const
{
if (idx >= hash_pieces.count())
throw Error(TQString("Torrent::getHash %1 is out of bounds").tqarg(idx));
return hash_pieces[idx];
}
TorrentFile & Torrent::getFile(Uint32 idx)
{
if (idx >= files.size())
return TorrentFile::null;
return files.at(idx);
}
const TorrentFile & Torrent::getFile(Uint32 idx) const
{
if (idx >= files.size())
return TorrentFile::null;
return files.at(idx);
}
unsigned int Torrent::getNumTrackerURLs() const
{
Uint32 count = 0;
TrackerTier* tt = trackers;
while (tt)
{
count += tt->urls.count();
tt = tt->next;
}
return count;
}
void Torrent::calcChunkPos(Uint32 chunk,TQValueList<Uint32> & file_list) const
{
file_list.clear();
if (chunk >= hash_pieces.size() || files.empty())
return;
for (Uint32 i = 0;i < files.count();i++)
{
const TorrentFile & f = files[i];
if (chunk >= f.getFirstChunk() && chunk <= f.getLastChunk() && f.getSize() != 0)
file_list.append(f.getIndex());
}
}
bool Torrent::isMultimedia() const
{
return IsMultimediaFile(this->getNameSuggestion());
}
void Torrent::updateFilePercentage(const BitSet & bs)
{
for (Uint32 i = 0;i < files.count();i++)
{
TorrentFile & f = files[i];
f.updateNumDownloadedChunks(bs);
}
}
void Torrent::updateFilePercentage(Uint32 chunk,const BitSet & bs)
{
TQValueList<Uint32> cfiles;
calcChunkPos(chunk,cfiles);
TQValueList<Uint32>::iterator i = cfiles.begin();
while (i != cfiles.end())
{
TorrentFile & f = getFile(*i);
f.updateNumDownloadedChunks(bs);
i++;
}
}
bool Torrent::checkPathForDirectoryTraversal(const TQString & p)
{
TQStringList sl = TQStringList::split(bt::DirSeparator(),p);
return !sl.tqcontains("..");
}
}
|