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_ENTRY_LIST_H
38
#define LIBTORRENT_ENTRY_LIST_H
41
#include <rak/functional.h>
43
#include "entry_list_node.h"
52
class EntryList : private std::vector<EntryListNode*> {
54
typedef std::vector<EntryListNode*> base_type;
55
typedef std::vector<std::string> path_list;
56
typedef rak::mem_fun1<FileManager, void, FileMeta*> slot_meta_type;
58
using base_type::value_type;
60
using base_type::iterator;
61
using base_type::reverse_iterator;
63
using base_type::begin;
65
using base_type::rbegin;
66
using base_type::rend;
68
using base_type::back;
69
using base_type::empty;
70
using base_type::reserve;
72
EntryList() : m_bytesSize(0), m_isOpen(false) {}
73
~EntryList() { clear(); }
75
bool is_open() const { return m_isOpen; }
77
// We take over ownership of 'file'.
78
void push_back(const Path& path, const EntryListNode::Range& range, off_t size);
82
// Only closes the files.
86
// You must call set_root_dir after all nodes have been added.
87
const std::string& root_dir() const { return m_rootDir; }
88
void set_root_dir(const std::string& path);
92
size_t files_size() const { return base_type::size(); }
93
off_t bytes_size() const { return m_bytesSize; }
95
// If the files span multiple disks, the one with the least amount
96
// of free diskspace will be returned.
97
uint64_t free_diskspace() const;
99
EntryListNode* get_node(uint32_t idx) { return base_type::operator[](idx); }
101
Chunk* create_chunk(off_t offset, uint32_t length, int prot);
103
iterator at_position(iterator itr, off_t offset);
105
path_list* indirect_links() { return &m_indirectLinks; }
107
void slot_insert_filemeta(slot_meta_type s) { m_slotInsertFileMeta = s; }
108
void slot_erase_filemeta(slot_meta_type s) { m_slotEraseFileMeta = s; }
111
bool open_file(EntryListNode* node, const Path& lastPath);
113
inline void make_directory(Path::const_iterator pathBegin, Path::const_iterator pathEnd, Path::const_iterator startItr);
115
inline MemoryChunk create_chunk_part(iterator itr, off_t offset, uint32_t length, int prot);
118
std::string m_rootDir;
122
path_list m_indirectLinks;
124
slot_meta_type m_slotInsertFileMeta;
125
slot_meta_type m_slotEraseFileMeta;
added
removed
src/data/entry_list.h
