1
// libTorrent - BitTorrent library
2
// Copyright (C) 2005-2007, Jari Sundell
4
// This program is free software; you can redistribute it and/or modify
5
// it under the terms of the GNU General Public License as published by
6
// the Free Software Foundation; either version 2 of the License, or
7
// (at your option) any later version.
9
// This program is distributed in the hope that it will be useful,
10
// but WITHOUT ANY WARRANTY; without even the implied warranty of
11
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12
// GNU General Public License for more details.
14
// You should have received a copy of the GNU General Public License
15
// along with this program; if not, write to the Free Software
16
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18
// In addition, as a special exception, the copyright holders give
19
// permission to link the code of portions of this program with the
20
// OpenSSL library under certain conditions as described in each
21
// individual source file, and distribute linked combinations
24
// You must obey the GNU General Public License in all respects for
25
// all of the code used other than OpenSSL. If you modify file(s)
26
// with this exception, you may extend this exception to your version
27
// of the file(s), but you are not obligated to do so. If you do not
28
// wish to do so, delete this exception statement from your version.
29
// If you delete this exception statement from all source files in the
30
// program, then also delete it here.
32
// Contact: Jari Sundell <jaris@ifi.uio.no>
35
// 3185 Skoppum, NORWAY
39
#include "torrent/exceptions.h"
40
#include "hash_chunk.h"
42
#include "chunk_list_node.h"
47
HashChunk::perform(uint32_t length, bool force) {
48
length = std::min(length, remaining());
50
if (m_position + length > m_chunk.chunk()->chunk_size())
51
throw internal_error("HashChunk::perform(...) received length out of range");
53
uint32_t l = force ? length : m_chunk.chunk()->incore_length(m_position);
55
bool complete = l == length;
58
Chunk::iterator node = m_chunk.chunk()->at_position(m_position);
60
l -= perform_part(node, l);
67
HashChunk::advise_willneed(uint32_t length) {
68
if (!m_chunk.is_valid())
69
throw internal_error("HashChunk::willneed(...) called on an invalid chunk");
71
if (m_position + length > m_chunk.chunk()->chunk_size())
72
throw internal_error("HashChunk::willneed(...) received length out of range");
74
uint32_t pos = m_position;
77
Chunk::iterator itr = m_chunk.chunk()->at_position(pos);
79
uint32_t l = std::min(length, remaining_part(itr, pos));
81
itr->chunk().advise(pos - itr->position(), l, MemoryChunk::advice_willneed);
90
HashChunk::remaining() {
91
if (!m_chunk.is_valid())
92
throw internal_error("HashChunk::remaining(...) called on an invalid chunk");
94
return m_chunk.chunk()->chunk_size() - m_position;
98
HashChunk::perform_part(Chunk::iterator itr, uint32_t length) {
99
length = std::min(length, remaining_part(itr, m_position));
101
m_hash.update(itr->chunk().begin() + m_position - itr->position(), length);
102
m_position += length;