1
// libTorrent - BitTorrent library
2
// Copyright (C) 2005-2006, 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
42
#include "block_transfer.h"
43
#include "block_list.h"
44
#include "exceptions.h"
48
BlockList::BlockList(const Piece& piece, uint32_t blockLength) :
50
m_priority(PRIORITY_OFF),
58
if (piece.length() == 0)
59
throw internal_error("BlockList::BlockList(...) received zero length piece.");
61
// Look into optimizing this by using input iterators in the ctor.
62
base_type::resize((m_piece.length() + blockLength - 1) / blockLength);
64
// ATM assume offset of 0.
65
// uint32_t offset = m_piece.offset();
68
for (iterator itr = begin(), last = end() - 1; itr != last; ++itr, offset += blockLength) {
69
itr->set_parent(this);
70
itr->set_piece(Piece(m_piece.index(), offset, blockLength));
73
base_type::back().set_parent(this);
74
base_type::back().set_piece(Piece(m_piece.index(), offset, (m_piece.length() % blockLength) ? m_piece.length() % blockLength : blockLength));
77
BlockList::~BlockList() {