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
37
#ifndef LIBTORRENT_DATA_HASH_QUEUE_H
38
#define LIBTORRENT_DATA_HASH_QUEUE_H
41
#include <rak/priority_queue_default.h>
43
#include "hash_queue_node.h"
44
#include "chunk_handle.h"
50
// Calculating hash of incore memory is blindingly fast, it's always
51
// the loading from swap/disk that takes time. So with the exception
52
// of large resumed downloads, try to check the hash immediately. This
53
// helps us in getting as much done as possible while the pages are in
56
class HashQueue : private std::deque<HashQueueNode> {
58
typedef std::deque<HashQueueNode> base_type;
59
typedef HashQueueNode::slot_done_type slot_done_type;
61
using base_type::iterator;
63
using base_type::empty;
65
using base_type::begin;
69
~HashQueue() { clear(); }
71
void push_back(ChunkHandle handle, slot_done_type d);
73
bool has(HashQueueNode::id_type id);
74
bool has(HashQueueNode::id_type id, uint32_t index);
76
void remove(HashQueueNode::id_type id);
81
uint32_t read_ahead() const { return m_readAhead; }
82
void set_read_ahead(uint32_t bytes) { m_readAhead = bytes; }
84
uint32_t interval() const { return m_interval; }
85
void set_interval(uint32_t usec) { m_interval = usec; }
87
uint32_t max_tries() const { return m_maxTries; }
88
void set_max_tries(uint32_t tries) { m_maxTries = tries; }
91
bool check(bool force);
93
inline void willneed(int bytes);
96
rak::priority_item m_taskWork;