entry_list.h

一个BT下载库. 支持DHT. 采用底层的网络通讯提速.

// libTorrent - BitTorrent library
// Copyright (C) 2005-2006, Jari Sundell
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
// 
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
// 
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
//
// In addition, as a special exception, the copyright holders give
// permission to link the code of portions of this program with the
// OpenSSL library under certain conditions as described in each
// individual source file, and distribute linked combinations
// including the two.
//
// You must obey the GNU General Public License in all respects for
// all of the code used other than OpenSSL.  If you modify file(s)
// with this exception, you may extend this exception to your version
// of the file(s), but you are not obligated to do so.  If you do not
// wish to do so, delete this exception statement from your version.
// If you delete this exception statement from all source files in the
// program, then also delete it here.
//
// Contact:  Jari Sundell <[e-mail]>
//
//           Skomakerveien 33
//           3185 Skoppum, NORWAY

#ifndef LIBTORRENT_ENTRY_LIST_H
#define LIBTORRENT_ENTRY_LIST_H

#include <vector>
#include <rak/functional.h>

#include "entry_list_node.h"

namespace torrent {

class Chunk;
class EntryListNode;
class FileManager;
class MemoryChunk;

class EntryList : private std::vector<EntryListNode*> {
public:
  typedef std::vector<EntryListNode*>                 base_type;
  typedef rak::mem_fun1<FileManager, void, FileMeta*> slot_meta_type;

  using base_type::value_type;

  using base_type::iterator;
  using base_type::reverse_iterator;

  using base_type::begin;
  using base_type::end;
  using base_type::rbegin;
  using base_type::rend;

  using base_type::back;
  using base_type::empty;
  using base_type::reserve;

  EntryList() : m_bytesSize(0), m_isOpen(false) {}
  ~EntryList() { clear(); }

  bool                is_open() const                            { return m_isOpen; }

  // We take over ownership of 'file'.
  void                push_back(const Path& path, const EntryListNode::Range& range, off_t size);

  void                clear();

  // Only closes the files.
  void                open();
  void                close();

  // You must call set_root_dir after all nodes have been added.
  const std::string&  root_dir() const                           { return m_rootDir; }
  void                set_root_dir(const std::string& path);

  bool                resize_all();

  size_t              files_size() const                         { return base_type::size(); }
  off_t               bytes_size() const                         { return m_bytesSize; }

  EntryListNode*      get_node(uint32_t idx)                     { return base_type::operator[](idx); }

  Chunk*              create_chunk(off_t offset, uint32_t length, int prot);

  iterator            at_position(iterator itr, off_t offset);

  void                slot_insert_filemeta(slot_meta_type s)     { m_slotInsertFileMeta = s; }
  void                slot_erase_filemeta(slot_meta_type s)      { m_slotEraseFileMeta = s; }

private:
  bool                open_file(EntryListNode* node, const Path& lastPath);

  inline MemoryChunk  create_chunk_part(iterator itr, off_t offset, uint32_t length, int prot);

  off_t               m_bytesSize;
  std::string         m_rootDir;

  bool                m_isOpen;

  slot_meta_type      m_slotInsertFileMeta;
  slot_meta_type      m_slotEraseFileMeta;
};

}

#endif