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
|
/***************************************************************************
* Copyright (C) 2005 by Joris Guisson *
* joris.guisson@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 <util/sha1hash.h>
#include "chunk.h"
#include "globals.h"
namespace bt
{
Chunk::Chunk(unsigned int index,Uint32 size)
: status(Chunk::NOT_DOWNLOADED),index(index),
data(0),size(size),ref_count(0),priority(NORMAL_PRIORITY)
{
}
Chunk::~Chunk()
{
clear();
}
void Chunk::setData(Uint8* d,Status nstatus)
{
clear();
status = nstatus;
data = d;
}
void Chunk::allocate()
{
clear();
status = BUFFERED;
data = new Uint8[size];
}
void Chunk::clear()
{
if (data)
{
if (status == BUFFERED)
delete [] data;
data = 0;
}
}
void Chunk::unmapped()
{
setData(0,Chunk::ON_DISK);
}
bool Chunk::checkHash(const SHA1Hash & h) const
{
if (status != BUFFERED && status != MMAPPED)
{
return false;
}
else
{
return SHA1Hash::generate(data,size) == h;
}
}
}
|
