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
37
#ifndef LIBTORRENT_BLOCK_LIST_H
38
#define LIBTORRENT_BLOCK_LIST_H
42
#include <torrent/common.h>
43
#include <torrent/block.h>
44
#include <torrent/piece.h>
48
class BlockList : public std::vector<Block> {
50
typedef std::vector<Block> base_type;
51
typedef uint32_t size_type;
53
using base_type::value_type;
54
using base_type::reference;
55
using base_type::difference_type;
57
using base_type::iterator;
58
using base_type::reverse_iterator;
59
using base_type::size;
60
using base_type::empty;
62
using base_type::begin;
64
using base_type::rbegin;
65
using base_type::rend;
67
using base_type::operator[];
69
BlockList(const Piece& piece, uint32_t blockLength);
72
bool is_all_finished() const { return m_finished == size(); }
74
const Piece& piece() const { return m_piece; }
76
uint32_t index() const { return m_piece.index(); }
78
priority_t priority() const { return m_priority; }
79
void set_priority(priority_t p) { m_priority = p; }
81
size_type finished() const { return m_finished; }
82
void inc_finished() { m_finished++; }
83
void clear_finished() { m_finished = 0; }
85
uint32_t failed() const { return m_failed; }
87
// Temporary, just increment for now.
88
void inc_failed() { m_failed++; }
90
uint32_t attempt() const { return m_attempt; }
91
void set_attempt(uint32_t a) { m_attempt = a; }
93
// Set when the chunk was initially requested from a seeder. This
94
// allows us to quickly determine if it is a suitable chunk to
95
// request from another seeder, e.g by already knowing it is a rare
97
bool by_seeder() const { return m_bySeeder; }
98
void set_by_seeder(bool state) { m_bySeeder = state; }
101
BlockList(const BlockList&);
102
void operator = (const BlockList&);
105
priority_t m_priority;
107
size_type m_finished;
added
removed
src/torrent/block_list.h
