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_CHUNK_ITERATOR_H
38
#define LIBTORRENT_DATA_CHUNK_ITERATOR_H
46
ChunkIterator(Chunk* chunk, uint32_t first, uint32_t last);
48
bool empty() const { return m_iterator == m_chunk->end() || m_first >= m_last; }
50
// Only non-zero length ranges will be returned.
51
Chunk::data_type data();
53
MemoryChunk* memory_chunk() { return &m_iterator->chunk(); }
55
uint32_t memory_chunk_first() const { return m_first - m_iterator->position(); }
56
uint32_t memory_chunk_last() const { return m_last - m_iterator->position(); }
59
bool forward(uint32_t length);
63
Chunk::iterator m_iterator;
70
ChunkIterator::ChunkIterator(Chunk* chunk, uint32_t first, uint32_t last) :
72
m_iterator(chunk->at_position(first)),
78
inline Chunk::data_type
79
ChunkIterator::data() {
80
Chunk::data_type data = m_chunk->at_memory(m_first, m_iterator);
81
data.second = std::min(data.second, m_last - m_first);
87
ChunkIterator::next() {
88
m_first = m_iterator->position() + m_iterator->size();
90
while (++m_iterator != m_chunk->end()) {
91
if (m_iterator->size() != 0)
92
return m_first < m_last;
98
// Returns true if the new position is on a file boundary while not at
99
// the edges of the chunk.
101
// Do not return true if the length was zero, in order to avoid
102
// getting stuck looping when no data is being read/written.
104
ChunkIterator::forward(uint32_t length) {
107
if (m_first >= m_last)
111
if (m_first < m_iterator->position() + m_iterator->size())
115
} while (m_iterator != m_chunk->end());