| Author: | Arvid Norberg, arvid@rasterbar.com |
|---|---|
| Version: | 0.13 |
Table of contents
The interface of libtorrent consists of a few classes. The main class is the session, it contains the main loop that serves all torrents.
The basic usage is as follows:
construct a session
parse .torrent-files and add them to the session (see bdecode() bencode() and add_torrent())
main loop (see session)
- query the torrent_handles for progress (see torrent_handle)
- query the session for information
- add and remove torrents from the session at run-time
save resume data for all torrent_handles (optional, see write_resume_data())
destruct session object
Each class and function is described in this manual.
There are a few typedefs in the libtorrent namespace which pulls in network types from the asio namespace. These are:
typedef asio::ip::address address; typedef asio::ip::address_v4 address_v4; typedef asio::ip::address_v6 address_v6; using asio::ip::tcp; using asio::ip::udp;
These are declared in the <libtorrent/socket.hpp> header.
The using statements will give easy access to:
tcp::endpoint udp::endpoint
Which are the endpoint types used in libtorrent. An endpoint is an address with an associated port.
For documentation on these types, please refer to the asio documentation.
The session class has the following synopsis:
class session: public boost::noncopyable
{
session(fingerprint const& print
= libtorrent::fingerprint(
"LT", 0, 1, 0, 0));
session(
fingerprint const& print
, std::pair<int, int> listen_port_range
, char const* listen_interface = 0);
torrent_handle add_torrent(
boost::intrusive_ptr<torrent_info> const& ti
, boost::filesystem::path const& save_path
, entry const& resume_data = entry()
, storage_mode_t storage_mode = storage_mode_sparse
, bool paused = false
, storage_constructor_type sc = default_storage_constructor
, void* userdata = 0);
torrent_handle add_torrent(
char const* tracker_url
, sha1_hash const& info_hash
, char const* name
, boost::filesystem::path const& save_path
, entry const& resume_data = entry()
, storage_mode_t storage_mode = storage_mode_sparse
, bool paused = false
, storage_constructor_type sc = default_storage_constructor
, void* userdata = 0);
session_proxy abort();
enum options_t
{
none = 0,
delete_files = 1
};
void remove_torrent(torrent_handle const& h, int options = none);
torrent_handle find_torrent(sha_hash const& ih);
std::vector<torrent_handle> get_torrents() const;
void set_settings(session_settings const& settings);
void set_pe_settings(pe_settings const& settings);
void set_upload_rate_limit(int bytes_per_second);
int upload_rate_limit() const;
void set_download_rate_limit(int bytes_per_second);
int download_rate_limit() const;
void set_max_uploads(int limit);
void set_max_connections(int limit);
void set_max_half_open_connections(int limit);
int max_half_open_connections() const;
void set_peer_proxy(proxy_settings const& s);
void set_web_seed_proxy(proxy_settings const& s);
void set_tracker_proxy(proxy_settings const& s);
proxy_settings const& peer_proxy() const;
proxy_settings const& web_seed_proxy() const;
proxy_settings const& tracker_proxy() const;
int num_uploads() const;
int num_connections() const;
void set_ip_filter(ip_filter const& f);
session_status status() const;
bool is_listening() const;
unsigned short listen_port() const;
bool listen_on(
std::pair<int, int> const& port_range
, char const* interface = 0);
std::auto_ptr<alert> pop_alert();
void set_severity_level(alert::severity_t s);
void add_extension(boost::function<
boost::shared_ptr<torrent_plugin>(torrent*)> ext);
void start_dht();
void stop_dht();
void set_dht_settings(
dht_settings const& settings);
entry dht_state() const;
void add_dht_node(std::pair<std::string
, int> const& node);
void add_dht_router(std::pair<std::string
, int> const& node);
void start_lsd();
void stop_lsd();
void start_upnp();
void stop_upnp();
void start_natpmp();
void stop_natpmp();
};
Once it's created, the session object will spawn the main thread that will do all the work. The main thread will be idle as long it doesn't have any torrents to participate in.
session(fingerprint const& print
= libtorrent::fingerprint("LT", 0, 1, 0, 0));
session(fingerprint const& print
, std::pair<int, int> listen_port_range
, char const* listen_interface = 0);
If the fingerprint in the first overload is omited, the client will get a default fingerprint stating the version of libtorrent. The fingerprint is a short string that will be used in the peer-id to identify the client and the client's version. For more details see the fingerprint class. The constructor that only takes a fingerprint will not open a listen port for the session, to get it running you'll have to call session::listen_on(). The other constructor, that takes a port range and an interface as well as the fingerprint will automatically try to listen on a port on the given interface. For more information about the parameters, see listen_on() function.
The destructor of session will notify all trackers that our torrents have been shut down. If some trackers are down, they will time out. All this before the destructor of session returns. So, it's advised that any kind of interface (such as windows) are closed before destructing the session object. Because it can take a few second for it to finish. The timeout can be set with set_settings().
session_proxy abort();
In case you want to destruct the session asynchrounously, you can request a session destruction proxy. If you don't do this, the destructor of the session object will block while the trackers are contacted. If you keep one session_proxy to the session when destructing it, the destructor will not block, but start to close down the session, the destructor of the proxy will then synchronize the threads. So, the destruction of the session is performed from the session destructor call until the session_proxy destructor call. The session_proxy does not have any operations on it (since the session is being closed down, no operations are allowed on it). The only valid operation is calling the destructor:
class session_proxy
{
public:
session_proxy();
~session_proxy()
};
typedef storage_interface* (&storage_constructor_type)(
boost::intrusive_ptr<torrent_info const>, fs::path const&
, file_pool&);
torrent_handle add_torrent(
boost::intrusive_ptr<torrent_info> const& ti
, boost::filesystem::path const& save_path
, entry const& resume_data = entry()
, storage_mode_t storage_mode = storage_mode_sparse
, bool paused = false
, storage_constructor_type sc = default_storage_constructor
, void* userdata = 0);
torrent_handle add_torrent(
char const* tracker_url
, sha1_hash const& info_hash
, char const* name
, boost::filesystem::path const& save_path
, entry const& resume_data = entry()
, storage_mode_t storage_mode = storage_mode_sparse
, bool paused = false
, storage_constructor_type sc = default_storage_constructor
, void* userdata = 0);
You add torrents through the add_torrent() function where you give an object representing the information found in the torrent file and the path where you want to save the files. The save_path will be prepended to the directory structure in the torrent-file.
If the torrent you are trying to add already exists in the session (is either queued for checking, being checked or downloading) add_torrent() will throw duplicate_torrent which derives from std::exception.
The optional parameter, resume_data can be given if up to date fast-resume data is available. The fast-resume data can be acquired from a running torrent by calling torrent_handle::write_resume_data(). See fast resume.
The storage_mode parameter refers to the layout of the storage for this torrent. There are 3 different modes:
For more information, see storage allocation.
paused is a boolean that specifies whether or not the torrent is to be started in a paused state. I.e. it won't connect to the tracker or any of the peers until it's resumed. This is typically a good way of avoiding race conditions when setting configuration options on torrents before starting them.
storage_constructor can be used to customize how the data is stored. The default storage will simply write the data to the files it belongs to, but it could be overridden to save everything to a single file at a specific location or encrypt the content on disk for instance. For more information about the storage_interface that needs to be implemented for a custom storage, see storage_interface.
The torrent_handle returned by add_torrent() can be used to retrieve information about the torrent's progress, its peers etc. It is also used to abort a torrent.
The userdata parameter is optional and will be passed on to the extension constructor functions, if any (see add_extension()).
The second overload that takes a tracker url and an info-hash instead of metadata (torrent_info) can be used with torrents where (at least some) peers support the metadata extension. For the overload to be available, libtorrent must be built with extensions enabled (TORRENT_DISABLE_EXTENSIONS must not be defined). It also takes an optional name argument. This may be 0 in case no name should be assigned to the torrent. In case it's not 0, the name is used for the torrent as long as it doesn't have metadata. See torrent_handle::name.
If the torrent doesn't have a tracker, but relies on the DHT to find peers, the tracker_url can be 0.
void remove_torrent(torrent_handle const& h, int options = none);
remove_torrent() will close all peer connections associated with the torrent and tell the tracker that we've stopped participating in the swarm. The optional second argument options can be used to delete all the files downloaded by this torrent. To do this, pass in the value session::delete_files. The removal of the torrent is asyncronous, there is no guarantee that adding the same torrent immediately after it was removed will not throw a duplicate_torrent exception.
torrent_handle find_torrent(sha_hash const& ih); std::vector<torrent_handle> get_torrents() const;
find_torrent() looks for a torrent with the given info-hash. In case there is such a torrent in the session, a torrent_handle to that torrent is returned. In case the torrent cannot be found, an invalid torrent_handle is returned.
See torrent_handle::is_valid() to know if the torrent was found or not.
get_torrents() returns a vector of torrent_handles to all the torrents currently in the session.
void set_upload_rate_limit(int bytes_per_second); void set_download_rate_limit(int bytes_per_second); int upload_rate_limit() const; int download_rate_limit() const;
set_upload_rate_limit() set the maximum number of bytes allowed to be sent to peers per second. This bandwidth is distributed among all the peers. If you don't want to limit upload rate, you can set this to -1 (the default). set_download_rate_limit() works the same way but for download rate instead of upload rate. download_rate_limit() and upload_rate_limit() returns the previously set limits.
void set_max_uploads(int limit); void set_max_connections(int limit);
These functions will set a global limit on the number of unchoked peers (uploads) and the number of connections opened. The number of connections is set to a hard minimum of at least two connections per torrent, so if you set a too low connections limit, and open too many torrents, the limit will not be met. The number of uploads is at least one per torrent.
int num_uploads() const; int num_connections() const;
Returns the number of currently unchoked peers and the number of connections (including half-open ones) respectively.
void set_max_half_open_connections(int limit); int max_half_open_connections() const;
Sets the maximum number of half-open connections libtorrent will have when connecting to peers. A half-open connection is one where connect() has been called, but the connection still hasn't been established (nor failed). Windows XP Service Pack 2 sets a default, system wide, limit of the number of half-open connections to 10. So, this limit can be used to work nicer together with other network applications on that system. The default is to have no limit, and passing -1 as the limit, means to have no limit. When limiting the number of simultaneous connection attempts, peers will be put in a queue waiting for their turn to get connected.
max_half_open_connections() returns the set limit. This limit defaults to 8 on windows.
void set_ip_filter(ip_filter const& filter);
Sets a filter that will be used to reject and accept incoming as well as outgoing connections based on their originating ip address. The default filter will allow connections to any ip address. To build a set of rules for which addresses are accepted and not, see ip_filter.
Each time a peer is blocked because of the IP filter, a peer_blocked_alert is generated.
session_status status() const;
status() returns session wide-statistics and status. The session_status struct has the following members:
struct session_status
{
bool has_incoming_connections;
float upload_rate;
float download_rate;
float payload_upload_rate;
float payload_download_rate;
size_type total_download;
size_type total_upload;
size_type total_payload_download;
size_type total_payload_upload;
int num_peers;
int dht_nodes;
int dht_cache_nodes;
int dht_torrents;
int dht_global_nodes;
};
has_incoming_connections is false as long as no incoming connections have been established on the listening socket. Every time you change the listen port, this will be reset to false.
upload_rate, download_rate, payload_download_rate and payload_upload_rate are the total download and upload rates accumulated from all torrents. The payload versions is the payload download only.
total_download and total_upload are the total number of bytes downloaded and uploaded to and from all torrents. total_payload_download and total_payload_upload are the same thing but where only the payload is considered.
num_peers is the total number of peer connections this session has. This includes incoming connections that still hasn't sent their handshake or outgoing connections that still hasn't completed the TCP connection. This number may be slightly higher than the sum of all peers of all torrents because the incoming connections may not be assigned a torrent yet.
dht_nodes, dht_cache_nodes and dht_torrents are only available when built with DHT support. They are all set to 0 if the DHT isn't running. When the DHT is running, dht_nodes is set to the number of nodes in the routing table. This number only includes active nodes, not cache nodes. The dht_cache_nodes is set to the number of nodes in the node cache. These nodes are used to replace the regular nodes in the routing table in case any of them becomes unresponsive.
dht_torrents are the number of torrents tracked by the DHT at the moment.
dht_global_nodes is an estimation of the total number of nodes in the DHT network.
bool is_listening() const;
unsigned short listen_port() const;
bool listen_on(
std::pair<int, int> const& port_range
, char const* interface = 0);
is_listening() will tell you whether or not the session has successfully opened a listening port. If it hasn't, this function will return false, and then you can use listen_on() to make another try.
listen_port() returns the port we ended up listening on. Since you just pass a port-range to the constructor and to listen_on(), to know which port it ended up using, you have to ask the session using this function.
listen_on() will change the listen port and/or the listen interface. If the session is already listening on a port, this socket will be closed and a new socket will be opened with these new settings. The port range is the ports it will try to listen on, if the first port fails, it will continue trying the next port within the range and so on. The interface parameter can be left as 0, in that case the os will decide which interface to listen on, otherwise it should be the ip-address of the interface you want the listener socket bound to. listen_on() returns true if it managed to open the socket, and false if it failed. If it fails, it will also generate an appropriate alert (listen_failed_alert).
The interface parameter can also be a hostname that will resolve to the device you want to listen on.
If you're also starting the DHT, it is a good idea to do that after you've called listen_on(), since the default listen port for the DHT is the same as the tcp listen socket. If you start the DHT first, it will assume the tcp port is free and open the udp socket on that port, then later, when listen_on() is called, it may turn out that the tcp port is in use. That results in the DHT and the bittorrent socket listening on different ports. If the DHT is active when listen_on is called, the udp port will be rebound to the new port, if it was configured to use the same port as the tcp socket, and if the listen_on call failed to bind to the same port that the udp uses.
The reason why it's a good idea to run the DHT and the bittorrent socket on the same port is because that is an assumption that may be used to increase performance. One way to accelerate the connecting of peers on windows may be to first ping all peers with a DHT ping packet, and connect to those that responds first. On windows one can only connect to a few peers at a time because of a built in limitation (in XP Service pack 2).
std::auto_ptr<alert> pop_alert(); void set_severity_level(alert::severity_t s);
pop_alert() is used to ask the session if any errors or events has occurred. With set_severity_level() you can filter how serious the event has to be for you to receive it through pop_alert(). For information, see alerts.
void add_extension(boost::function<
boost::shared_ptr<torrent_plugin>(torrent*, void*)> ext);
This function adds an extension to this session. The argument is a function object that is called with a torrent* and which should return a boost::shared_ptr<torrent_plugin>. To write custom plugins, see libtorrent plugins. The main plugins implemented in libtorrent are:
To use these, imclude <libtorrent/extensions/metadata_transfer.hpp> or <libtorrent/extensions/ut_pex.hpp>. The functions to pass in to add_extension() are libtorrent::create_metadata_plugin and libtorrent::create_ut_pex_plugin respectively.
e.g.
ses.add_extension(&libtorrent::create_metadata_plugin); ses.add_extension(&libtorrent::create_ut_pex_plugin);
void set_settings(session_settings const& settings); void set_pe_settings(pe_settings const& settings);
Sets the session settings and the packet encryption settings respectively. See session_settings and pe_settings for more information on available options.
void set_peer_proxy(proxy_settings const& s); void set_web_seed_proxy(proxy_settings const& s); void set_tracker_proxy(proxy_settings const& s); void set_dht_proxy(proxy_settings const& s);
The set_dht_proxy is not available when DHT is disabled. These functions sets the proxy settings for different kinds of connections, bittorrent peers, web seeds, trackers and the DHT traffic.
set_peer_proxy affects regular bittorrent peers. set_web_seed_proxy affects only web seeds. see HTTP seeding.
set_tracker_proxy only affects HTTP tracker connections (UDP tracker connections are affected if the given proxy supports UDP, e.g. SOCKS5).
set_dht_proxy affects the DHT messages. Since they are sent over UDP, it only has any effect if the proxy supports UDP.
For more information on what settings are available for proxies, see proxy_settings.
proxy_settings const& peer_proxy() const; proxy_settings const& web_seed_proxy() const; proxy_settings const& tracker_proxy() const; proxy_settings const& dht_proxy() const;
These functions returns references to their respective current settings.
The dht_proxy is not available when DHT is disabled.
void start_dht(entry const& startup_state); void stop_dht(); void set_dht_settings(dht_settings const& settings); entry dht_state() const;
These functions are not available in case TORRENT_DISABLE_DHT is defined. start_dht starts the dht node and makes the trackerless service available to torrents. The startup state is optional and can contain nodes and the node id from the previous session. The dht node state is a bencoded dictionary with the following entries:
dht_state will return the current state of the dht node, this can be used to start up the node again, passing this entry to start_dht. It is a good idea to save this to disk when the session is closed, and read it up again when starting.
If the port the DHT is supposed to listen on is already in use, and exception is thrown, asio::error.
stop_dht stops the dht node.
add_dht_node adds a node to the routing table. This can be used if your client has its own source of bootstrapping nodes.
set_dht_settings sets some parameters availavle to the dht node. The struct has the following members:
struct dht_settings
{
int max_peers_reply;
int search_branching;
int service_port;
int max_fail_count;
};
max_peers_reply is the maximum number of peers the node will send in response to a get_peers message from another node.
search_branching is the number of concurrent search request the node will send when announcing and refreshing the routing table. This parameter is called alpha in the kademlia paper.
service_port is the udp port the node will listen to. This will default to 0, which means the udp listen port will be the same as the tcp listen port. This is in general a good idea, since some NAT implementations reserves the udp port for any mapped tcp port, and vice versa. NAT-PMP guarantees this for example.
max_fail_count is the maximum number of failed tries to contact a node before it is removed from the routing table. If there are known working nodes that are ready to replace a failing node, it will be replaced immediately, this limit is only used to clear out nodes that don't have any node that can replace them.
void add_dht_node(std::pair<std::string, int> const& node); void add_dht_router(std::pair<std::string, int> const& node);
add_dht_node takes a host name and port pair. That endpoint will be pinged, and if a valid DHT reply is received, the node will be added to the routing table.
add_dht_router adds the given endpoint to a list of DHT router nodes. If a search is ever made while the routing table is empty, those nodes will be used as backups. Nodes in the router node list will also never be added to the regular routing table, which effectively means they are only used for bootstrapping, to keep the load off them.
An example routing node that you could typically add is router.bittorrent.com.
void start_lsd(); void stop_lsd();
Starts and stops Local Service Discovery. This service will broadcast the infohashes of all the non-private torrents on the local network to look for peers on the same swarm within multicast reach.
It is turned off by default.
void start_upnp(); void stop_upnp();
Starts and stops the UPnP service. When started, the listen port and the DHT port are attempted to be forwarded on local UPnP router devices.
It is off by default.
void start_natpmp(); void stop_natpmp();
Starts and stops the NAT-PMP service. When started, the listen port and the DHT port are attempted to be forwarded on the router through NAT-PMP.
It is off by default.
The entry class represents one node in a bencoded hierarchy. It works as a variant type, it can be either a list, a dictionary (std::map), an integer or a string. This is its synopsis:
class entry
{
public:
typedef std::map<std::string, entry> dictionary_type;
typedef std::string string_type;
typedef std::list<entry> list_type;
typedef size_type integer_type;
enum data_type
{
int_t,
string_t,
list_t,
dictionary_t,
undefined_t
};
data_type type() const;
entry(dictionary_type const&);
entry(string_type const&);
entry(list_type const&);
entry(integer_type const&);
entry();
entry(data_type t);
entry(entry const& e);
~entry();
void operator=(entry const& e);
void operator=(dictionary_type const&);
void operator=(string_type const&);
void operator=(list_type const&);
void operator=(integer_type const&);
integer_type& integer();
integer_type const& integer() const;
string_type& string();
string_type const& string() const;
list_type& list();
list_type const& list() const;
dictionary_type& dict();
dictionary_type const& dict() const;
// these functions requires that the entry
// is a dictionary, otherwise they will throw
entry& operator[](char const* key);
entry& operator[](std::string const& key);
entry const& operator[](char const* key) const;
entry const& operator[](std::string const& key) const;
entry* find_key(char const* key);
entry const* find_key(char const* key) const;
void print(std::ostream& os, int indent = 0) const;
};
TODO: finish documentation of entry.
integer_type& integer(); integer_type const& integer() const; string_type& string(); string_type const& string() const; list_type& list(); list_type const& list() const; dictionary_type& dict(); dictionary_type const& dict() const;
The integer(), string(), list() and dict() functions are accessors that return the respective type. If the entry object isn't of the type you request, the accessor will throw type_error (which derives from std::runtime_error). You can ask an entry for its type through the type() function.
The print() function is there for debug purposes only.
If you want to create an entry you give it the type you want it to have in its constructor, and then use one of the non-const accessors to get a reference which you then can assign the value you want it to have.
The typical code to get info from a torrent file will then look like this:
entry torrent_file;
// ...
// throws if this is not a dictionary
entry::dictionary_type const& dict = torrent_file.dict();
entry::dictionary_type::const_iterator i;
i = dict.find("announce");
if (i != dict.end())
{
std::string tracker_url = i->second.string();
std::cout << tracker_url << "\n";
}
The following code is equivalent, but a little bit shorter:
entry torrent_file;
// ...
// throws if this is not a dictionary
if (entry* i = torrent_file.find_key("announce"))
{
std::string tracker_url = i->string();
std::cout << tracker_url << "\n";
}
To make it easier to extract information from a torrent file, the class torrent_info exists.
entry& operator[](char const* key); entry& operator[](std::string const& key); entry const& operator[](char const* key) const; entry const& operator[](std::string const& key) const;
All of these functions requires the entry to be a dictionary, if it isn't they will throw libtorrent::type_error.
The non-const versions of the operator[] will return a reference to either the existing element at the given key or, if there is no element with the given key, a reference to a newly inserted element at that key.
The const version of operator[] will only return a reference to an existing element at the given key. If the key is not found, it will throw libtorrent::type_error.
entry* find_key(char const* key); entry const* find_key(char const* key) const;
These functions requires the entry to be a dictionary, if it isn't they will throw libtorrent::type_error.
They will look for an element at the given key in the dictionary, if the element cannot be found, they will return 0. If an element with the given key is found, the return a pointer to it.
The torrent_info has the following synopsis:
class torrent_info
{
public:
torrent_info();
torrent_info(sha1_hash const& info_hash);
torrent_info(entry const& torrent_file);
entry create_torrent() const;
void set_comment(char const* str);
void set_piece_size(int size);
void set_creator(char const* str);
void set_hash(int index, sha1_hash const& h);
void add_tracker(std::string const& url, int tier = 0);
void add_file(boost::filesystem::path file, size_type size);
void add_url_seed(std::string const& url);
typedef std::vector<file_entry>::const_iterator file_iterator;
typedef std::vector<file_entry>::const_reverse_iterator
reverse_file_iterator;
bool remap_files(std::vector<file_entry> const& map);
file_iterator begin_files(bool storage = false) const;
file_iterator end_files(bool storage = false) const;
reverse_file_iterator rbegin_files(bool storage = false) const;
reverse_file_iterator rend_files(bool storage = false) const;
int num_files(bool storage = false) const;
file_entry const& file_at(int index, bool storage = false) const;
std::vector<file_slice> map_block(int piece, size_type offset
, int size, bool storage = false) const;
peer_request map_file(int file_index, size_type file_offset
, int size, bool storage = false) const;
std::vector<announce_entry> const& trackers() const;
bool priv() const;
void set_priv(bool v);
std::vector<std::string> const& url_seeds() const;
size_type total_size() const;
size_type piece_length() const;
int num_pieces() const;
sha1_hash const& info_hash() const;
std::string const& name() const;
std::string const& comment() const;
std::string const& creator() const;
std::vector<std::pair<std::string, int> > const& nodes() const;
void add_node(std::pair<std::string, int> const& node);
boost::optional<boost::posix_time::ptime>
creation_date() const;
void print(std::ostream& os) const;
size_type piece_size(unsigned int index) const;
sha1_hash const& hash_for_piece(unsigned int index) const;
};
torrent_info(); torrent_info(sha1_hash const& info_hash); torrent_info(entry const& torrent_file);
The default constructor of torrent_info is used when creating torrent files. It will initialize the object to an empty torrent, containing no files. The info hash will be set to 0 when this constructor is used. To use the empty torrent_info object, add files and piece hashes, announce URLs and optionally a creator tag and comment. To do this you use the members set_comment(), set_piece_size(), set_creator(), set_hash() etc.
The constructor that takes an info-hash is identical to the default constructor with the exception that it will initialize the info-hash to the given value. This is used internally when downloading torrents without the metadata. The metadata will be created by libtorrent as soon as it has been downloaded from the swarm.
The last constructor is the one that is used in most cases. It will create a torrent_info object from the information found in the given torrent_file. The entry represents a tree node in an bencoded file. To load an ordinary .torrent file into an entry, use bdecode(), see bdecode() bencode().
void set_comment(char const* str); void set_piece_size(int size); void set_creator(char const* str); void set_hash(int index, sha1_hash const& h); void add_tracker(std::string const& url, int tier = 0); void add_file(boost::filesystem::path file, size_type size);
These files are used when creating a torrent file. set_comment() will simply set the comment that belongs to this torrent. The comment can be retrieved with the comment() member. The string should be UTF-8 encoded.
set_piece_size() will set the size of each piece in this torrent. The piece size must be an even multiple of 2. i.e. usually something like 256 kiB, 512 kiB, 1024 kiB etc. The size is given in number of bytes.
set_creator() is an optional attribute that can be used to identify your application that was used to create the torrent file. The string should be UTF-8 encoded.
set_hash() writes the hash for the piece with the given piece-index. You have to call this function for every piece in the torrent. Usually the hasher is used to calculate the sha1-hash for a piece.
add_tracker() adds a tracker to the announce-list. The tier determines the order in which the trackers are to be tried. For more information see trackers().
add_file() adds a file to the torrent. The order in which you add files will determine the order in which they are placed in the torrent file. You have to add at least one file to the torrent. The path you give has to be a relative path from the root directory of the torrent. The size is given in bytes.
When you have added all the files and hashes to your torrent, you can generate an entry which then can be encoded as a .torrent file. You do this by calling create_torrent().
For a complete example of how to create a torrent from a file structure, see make_torrent.
entry create_torrent();
Returns an entry representing the bencoded tree of data that makes up a .torrent file. You can save this data as a torrent file with bencode() (see bdecode() bencode()), for a complete example, see make_torrent.
This function is not const because it will also set the info-hash of the torrent_info object.
Note that a torrent file must include at least one file, and it must have at least one tracker url or at least one DHT node.
bool remap_files(std::vector<file_entry> const& map);
This call will create a new mapping of the data in this torrent to other files. The torrent_info maintains 2 views of the file storage. One that is true to the torrent file, and one that represents what is actually saved on disk. This call will change what the files on disk are called.
The each entry in the vector map is a file_entry. The only fields in this struct that are used in this case are path, size and file_base.
The return value indicates if the remap was successful or not. True means success and false means failure. The sum of all the files passed in through map has to be exactly the same as the total_size of the torrent. If the number of bytes that are mapped do not match, false will be returned (this is the only case this function may fail).
Changing this mapping for an existing torrent will not move or rename files. If some files should be renamed, this can be done before the torrent is added.
file_iterator begin_files(bool storage = false) const; file_iterator end_files(bool storage = false) const; reverse_file_iterator rbegin_files(bool storage = false) const; reverse_file_iterator rend_files(bool storage = false) const;
This class will need some explanation. First of all, to get a list of all files in the torrent, you can use begin_files(), end_files(), rbegin_files() and rend_files(). These will give you standard vector iterators with the type file_entry.
The storage parameter specifies which view of the files you want. The default is false, which means you will see the content of the torrent file. If set to true, you will see the file that the storage class uses to save the files to disk. Typically these views are the same, but in case the files have been remapped, they may differ. For more info, see remap_files().
struct file_entry
{
boost::filesystem::path path;
size_type offset;
size_type size;
size_type file_base;
boost::shared_ptr<const boost::filesystem::path> orig_path;
};
The path is the full (relative) path of each file. i.e. if it is a multi-file torrent, all the files starts with a directory with the same name as torrent_info::name(). The filenames are encoded with UTF-8.
size is the size of the file (in bytes) and offset is the byte offset of the file within the torrent. i.e. the sum of all the sizes of the files before it in the list.
file_base is the offset in the file where the storage should start. The normal case is to have this set to 0, so that the storage starts saving data at the start if the file. In cases where multiple files are mapped into the same file though, the file_base should be set to an offset so that the different regions do not overlap. This is used when mapping "unselected" files into a so-called part file.
orig_path is set to 0 in case the path element is an exact copy of that found in the metadata. In case the path in the original metadata was incorrectly encoded, and had to be fixed in order to be acceptable utf-8, the original string is preserved in orig_path. The reason to keep it is to be able to reproduce the info-section exactly, with the correct info-hash.
int num_files(bool storage = false) const; file_entry const& file_at(int index, bool storage = false) const;
If you need index-access to files you can use the num_files() and file_at() to access files using indices.
The storage parameter specifies which view of the files you want. The default is false, which means you will see the content of the torrent file. If set to true, you will see the file that the storage class uses to save the files to disk. Typically these views are the same, but in case the files have been remapped, they may differ. For more info, see remap_files().
std::vector<file_slice> map_block(int piece, size_type offset
, int size, bool storage = false) const;
This function will map a piece index, a byte offset within that piece and a size (in bytes) into the corresponding files with offsets where that data for that piece is supposed to be stored.
The file slice struct looks like this:
struct file_slice
{
int file_index;
size_type offset;
size_type size;
};
The file_index refers to the index of the file (in the torrent_info). To get the path and filename, use file_at() and give the file_index as argument. The offset is the byte offset in the file where the range starts, and size is the number of bytes this range is. The size + offset will never be greater than the file size.
The storage parameter specifies which view of the files you want. The default is false, which means you will see the content of the torrent file. If set to true, you will see the file that the storage class uses to save the files to disk. Typically these views are the same, but in case the files have been remapped, they may differ. For more info, see remap_files().
peer_request map_file(int file_index, size_type file_offset
, int size, bool storage = false) const;
This function will map a range in a specific file into a range in the torrent. The file_offset parameter is the offset in the file, given in bytes, where 0 is the start of the file. The peer_request structure looks like this:
struct peer_request
{
int piece;
int start;
int length;
bool operator==(peer_request const& r) const;
};
piece is the index of the piece in which the range starts. start is the offset within that piece where the range starts. length is the size of the range, in bytes.
The input range is assumed to be valid within the torrent. file_offset + size is not allowed to be greater than the file size. file_index must refer to a valid file, i.e. it cannot be >= num_files().
std::vector<std::string> const& url_seeds() const; void add_url_seed(std::string const& url);
If there are any url-seeds in this torrent, url_seeds() will return a vector of those urls. If you're creating a torrent file, add_url_seed() adds one url to the list of url-seeds. Currently, the only transport protocol supported for the url is http.
The storage parameter specifies which view of the files you want. The default is false, which means you will see the content of the torrent file. If set to true, you will see the file that the storage class uses to save the files to disk. Typically these views are the same, but in case the files have been remapped, they may differ. For more info, see remap_files().
See HTTP seeding for more information.
void print(std::ostream& os) const;
The print() function is there for debug purposes only. It will print the info from the torrent file to the given outstream. This function has been deprecated and will be removed from future releases.
std::vector<announce_entry> const& trackers() const;
The trackers() function will return a sorted vector of announce_entry. Each announce entry contains a string, which is the tracker url, and a tier index. The tier index is the high-level priority. No matter which trackers that works or not, the ones with lower tier will always be tried before the one with higher tier number.
struct announce_entry
{
announce_entry(std::string const& url);
std::string url;
int tier;
};
size_type total_size() const; size_type piece_length() const; size_type piece_size(unsigned int index) const; int num_pieces() const;
total_size(), piece_length() and num_pieces() returns the total number of bytes the torrent-file represents (all the files in it), the number of byte for each piece and the total number of pieces, respectively. The difference between piece_size() and piece_length() is that piece_size() takes the piece index as argument and gives you the exact size of that piece. It will always be the same as piece_length() except in the case of the last piece, which may be smaller.
size_type piece_size(unsigned int index) const; sha1_hash const& hash_for_piece(unsigned int index) const;
hash_for_piece() takes a piece-index and returns the 20-bytes sha1-hash for that piece and info_hash() returns the 20-bytes sha1-hash for the info-section of the torrent file. For more information on the sha1_hash, see the big_number class. info_hash() will only return a valid hash if the torrent_info was read from a .torrent file or if an entry was created from it (through create_torrent).
std::string const& name() const; std::string const& comment() const; boost::optional<boost::posix_time::ptime> creation_date() const;
name() returns the name of the torrent.
comment() returns the comment associated with the torrent. If there's no comment, it will return an empty string. creation_date() returns a boost::posix_time::ptime object, representing the time when this torrent file was created. If there's no time stamp in the torrent file, this will return a date of January 1:st 1970.
Both the name and the comment is UTF-8 encoded strings.
creator() returns the creator string in the torrent. If there is no creator string it will return an empty string.
bool priv() const; void set_priv(bool v);
priv() returns true if this torrent is private. i.e., it should not be distributed on the trackerless network (the kademlia DHT).
set_priv() sets or clears the private flag on this torrent.
std::vector<std::pair<std::string, int> > const& nodes() const;
If this torrent contains any DHT nodes, they are put in this vector in their original form (host name and port number).
void add_node(std::pair<std::string, int> const& node);
This is used when creating torrent. Use this to add a known DHT node. It may be used, by the client, to bootstrap into the DHT network.
You will usually have to store your torrent handles somewhere, since it's the object through which you retrieve information about the torrent and aborts the torrent. Its declaration looks like this:
struct torrent_handle
{
torrent_handle();
torrent_status status();
void file_progress(std::vector<float>& fp);
void get_download_queue(std::vector<partial_piece_info>& queue) const;
void get_peer_info(std::vector<peer_info>& v) const;
torrent_info const& get_torrent_info() const;
bool is_valid() const;
std::string name() const;
entry write_resume_data() const;
void force_reannounce() const;
void force_reannounce(boost::posix_time::time_duration) const;
void scrape_tracker() const;
void connect_peer(asio::ip::tcp::endpoint const& adr, int source = 0) const;
void set_tracker_login(std::string const& username
, std::string const& password) const;
std::vector<announce_entry> const& trackers() const;
void replace_trackers(std::vector<announce_entry> const&);
void add_url_seed(std::string const& url);
void remove_url_seed(std::string const& url);
std::set<std::string> url_seeds() const;
void set_ratio(float ratio) const;
void set_max_uploads(int max_uploads) const;
void set_max_connections(int max_connections) const;
void set_upload_limit(int limit) const;
int upload_limit() const;
void set_download_limit(int limit) const;
int download_limit() const;
void set_sequenced_download_threshold(int threshold) const;
void set_peer_upload_limit(asio::ip::tcp::endpoint ip, int limit) const;
void set_peer_download_limit(asio::ip::tcp::endpoint ip, int limit) const;
void use_interface(char const* net_interface) const;
void pause() const;
void resume() const;
bool is_paused() const;
bool is_seed() const;
void resolve_countries(bool r);
bool resolve_countries() const;
void piece_priority(int index, int priority) const;
int piece_priority(int index) const;
void prioritize_pieces(std::vector<int> const& pieces) const;
std::vector<int> piece_priorities() const;
void prioritize_files(std::vector<int> const& files) const;
// these functions are deprecated
void filter_piece(int index, bool filter) const;
void filter_pieces(std::vector<bool> const& bitmask) const;
bool is_piece_filtered(int index) const;
std::vector<bool> filtered_pieces() const;
void filter_files(std::vector<bool> const& files) const;
bool has_metadata() const;
boost::filesystem::path save_path() const;
void move_storage(boost::filesystem::path const& save_path) const;
sha1_hash info_hash() const;
bool operator==(torrent_handle const&) const;
bool operator!=(torrent_handle const&) const;
bool operator<(torrent_handle const&) const;
};
The default constructor will initialize the handle to an invalid state. Which means you cannot perform any operation on it, unless you first assign it a valid handle. If you try to perform any operation on an uninitialized handle, it will throw invalid_handle.
Warning
All operations on a torrent_handle may throw invalid_handle exception, in case the handle is no longer refering to a torrent. There are two exceptions, info_hash() and is_valid() will never throw. Since the torrents are processed by a background thread, there is no guarantee that a handle will remain valid between two calls.
void piece_priority(int index, int priority) const; int piece_priority(int index) const; void prioritize_pieces(std::vector<int> const& pieces) const; std::vector<int> piece_priorities() const; void prioritize_files(std::vector<int> const& files) const;
These functions are used to set and get the prioritiy of individual pieces. By default all pieces have priority 1. That means that the random rarest first algorithm is effectively active for all pieces. You may however change the priority of individual pieces. There are 8 different priority levels:
- piece is not downloaded at all
- normal priority. Download order is dependent on availability
- higher than normal priority. Pieces are preferred over pieces with the same availability, but not over pieces with lower availability
- pieces are as likely to be picked as partial pieces.
- pieces are preferred over partial pieces, but not over pieces with lower availability
- currently the same as 4
- piece is as likely to be picked as any piece with availability 1
- maximum priority, availability is disregarded, the piece is preferred over any other piece with lower priority
The exact definitions of these priorities are implementation details, and subject to change. The interface guarantees that higher number means higher priority, and that 0 means do not download.
piece_priority sets or gets the priority for an individual piece, specified by index.
prioritize_pieces takes a vector of integers, one integer per piece in the torrent. All the piece priorities will be updated with the priorities in the vector.
piece_priorities returns a vector with one element for each piece in the torrent. Each element is the current priority of that piece.
prioritize_files takes a vector that has at as many elements as there are files in the torrent. Each entry is the priority of that file. The function sets the priorities of all the pieces in the torrent based on the vector.
void file_progress(std::vector<float>& fp);
This function fills in the supplied vector with the progress (a value in the range [0, 1]) describing the download progress of each file in this torrent. The progress values are ordered the same as the files in the torrent_info. This operation is not very cheap.
boost::filesystem::path save_path() const;
save_path() returns the path that was given to add_torrent() when this torrent was started.
void move_storage(boost::filesystem::path const& save_path) const;
Moves the file(s) that this torrent are currently seeding from or downloading to. This operation will only have the desired effect if the given save_path is located on the same drive as the original save path. Since disk IO is performed in a separate thread, this operation is also asynchronous. Once the operation completes, the storage_moved_alert is generated, with the new path as the message.
void force_reannounce() const; void force_reannounce(boost::posix_time::time_duration) const;
force_reannounce() will force this torrent to do another tracker request, to receive new peers. The second overload of force_reannounce that takes a time_duration as argument will schedule a reannounce in that amount of time from now.
void scrape_tracker() const;
scrape_tracker() will send a scrape request to the tracker. A scrape request queries the tracker for statistics such as total number of incomplete peers, complete peers, number of downloads etc.
This request will specifically update the num_complete and num_incomplete fields in the torrent_status struct once it completes. When it completes, it will generate a scrape_reply_alert. If it fails, it will generate a scrape_failed_alert.
void connect_peer(asio::ip::tcp::endpoint const& adr, int source = 0) const;
connect_peer() is a way to manually connect to peers that one believe is a part of the torrent. If the peer does not respond, or is not a member of this torrent, it will simply be disconnected. No harm can be done by using this other than an unnecessary connection attempt is made. If the torrent is uninitialized or in queued or checking mode, this will throw invalid_handle. The second (optional) argument will be bitwised ORed into the source mask of this peer. Typically this is one of the source flags in peer_info. i.e. tracker, pex, dht etc.
std::string name() const;
Returns the name of the torrent. i.e. the name from the metadata associated with it. In case the torrent was started without metadata, and hasn't completely received it yet, it returns the name given to it when added to the session. See session::add_torrent.
void set_ratio(float ratio) const;
set_ratio() sets the desired download / upload ratio. If set to 0, it is considered being infinite. i.e. the client will always upload as much as it can, no matter how much it gets back in return. With this setting it will work much like the standard clients.
Besides 0, the ratio can be set to any number greater than or equal to 1. It means how much to attempt to upload in return for each download. e.g. if set to 2, the client will try to upload 2 bytes for every byte received. The default setting for this is 0, which will make it work as a standard client.
void set_upload_limit(int limit) const; void set_download_limit(int limit) const; int upload_limit() const; int download_limit() const;
set_upload_limit will limit the upload bandwidth used by this particular torrent to the limit you set. It is given as the number of bytes per second the torrent is allowed to upload. set_download_limit works the same way but for download bandwidth instead of upload bandwidth. Note that setting a higher limit on a torrent then the global limit (session::set_upload_rate_limit) will not override the global rate limit. The torrent can never upload more than the global rate limit.
upload_limit and download_limit will return the current limit setting, for upload and download, respectively.
void set_sequenced_download_threshold(int threshold);
sequenced-download threshold is the limit on how popular a piece has to be (popular == inverse of rarity) to be downloaded in sequence instead of in random (rarest first) order. It can be used to tweak disk performance in settings where the random download property is less necessary. For example, if the threshold is 10, all pieces which 10 or more peers have, will be downloaded in index order. This setting defaults to 100, which means that it is disabled in practice.
Setting this threshold to a very small value will affect the piece distribution negatively in the swarm. It should basically only be used in situations where the random seeks on the disk is the download bottleneck.
void set_peer_upload_limit(asio::ip::tcp::endpoint ip, int limit) const; void set_peer_download_limit(asio::ip::tcp::endpoint ip, int limit) const;
Works like set_upload_limit and set_download_limit respectively, but controls individual peer instead of the whole torrent.
void pause() const; void resume() const; bool is_paused() const;
pause(), and resume() will disconnect all peers and reconnect all peers respectively. When a torrent is paused, it will however remember all share ratios to all peers and remember all potential (not connected) peers. You can use is_paused() to determine if a torrent is currently paused. Torrents may be paused automatically if there is a file error (e.g. disk full) or something similar. See file_error_alert.
void resolve_countries(bool r); bool resolve_countries() const;
Sets or gets the flag that derermines if countries should be resolved for the peers of this torrent. It defaults to false. If it is set to true, the peer_info structure for the peers in this torrent will have their country member set. See peer_info for more information on how to interpret this field.
bool is_seed() const;
Returns true if the torrent is in seed mode (i.e. if it has finished downloading).
bool has_metadata() const;
Returns true if this torrent has metadata (either it was started from a .torrent file or the metadata has been downloaded). The only scenario where this can return false is when the torrent was started torrent-less (i.e. with just an info-hash and tracker ip). Note that if the torrent doesn't have metadata, the member get_torrent_info() will throw.
void set_tracker_login(std::string const& username
, std::string const& password) const;
set_tracker_login() sets a username and password that will be sent along in the HTTP-request of the tracker announce. Set this if the tracker requires authorization.
std::vector<announce_entry> const& trackers() const; void replace_trackers(std::vector<announce_entry> const&) const;
trackers() will return the list of trackers for this torrent. The announce entry contains both a string url which specify the announce url for the tracker as well as an int tier, which is specifies the order in which this tracker is tried. If you want libtorrent to use another list of trackers for this torrent, you can use replace_trackers() which takes a list of the same form as the one returned from trackers() and will replace it. If you want an immediate effect, you have to call force_reannounce().
void add_url_seed(std::string const& url); void remove_url_seed(std::string const& url); std::set<std::string> url_seeds() const;
add_url_seed() adds another url to the torrent's list of url seeds. If the given url already exists in that list, the call has no effect. The torrent will connect to the server and try to download pieces from it, unless it's paused, queued, checking or seeding. remove_url_seed() removes the given url if it exists already. url_seeds() return a set of the url seeds currently in this torrent. Note that urls that fails may be removed automatically from the list.
See HTTP seeding for more information.
void use_interface(char const* net_interface) const;
use_interface() sets the network interface this torrent will use when it opens outgoing connections. By default, it uses the same interface as the session uses to listen on. The parameter must be a string containing an ip-address (either an IPv4 or IPv6 address). If the string does not conform to this format and exception is thrown.
sha1_hash info_hash() const;
info_hash() returns the info-hash for the torrent.
void set_max_uploads(int max_uploads) const; void set_max_connections(int max_connections) const;
set_max_uploads() sets the maximum number of peers that's unchoked at the same time on this torrent. If you set this to -1, there will be no limit.
set_max_connections() sets the maximum number of connection this torrent will open. If all connections are used up, incoming connections may be refused or poor connections may be closed. This must be at least 2. The default is unlimited number of connections. If -1 is given to the function, it means unlimited.
entry write_resume_data() const;
write_resume_data() generates fast-resume data and returns it as an entry. This entry is suitable for being bencoded. For more information about how fast-resume works, see fast resume.
There are three cases where this function will just return an empty entry:
- The torrent handle is invalid.
- The torrent is checking (or is queued for checking) its storage, it will obviously not be ready to write resume data.
- The torrent hasn't received valid metadata and was started without metadata (see libtorrent's metadata from peers extension)
Note that by the time this function returns, the resume data may already be invalid if the torrent is still downloading! The recommended practice is to first pause the torrent, then generate the fast resume data, and then close it down. Since the disk IO is done in a separate thread, in order to synchronize, you shoule to wait for the torrent_paused_alert before you write the resume data.
In full allocation mode the reume data is never invalidated by subsequent writes to the files, since pieces won't move around. This means that you don't need to pause before writing resume data in full or sparse mode. If you don't, however, any data written to disk after you saved resume data and before the session closed is lost.
It also means that if the resume data is out dated, libtorrent will not re-check the files, but assume that it is fairly recent. The assumption is that it's better to loose a little bit than to re-check the entire file.
It is still a good idea to save resume data periodically during download as well as when closing down.
torrent_status status() const;
status() will return a structure with information about the status of this torrent. If the torrent_handle is invalid, it will throw invalid_handle exception. See torrent_status.
void get_download_queue(std::vector<partial_piece_info>& queue) const;
get_download_queue() takes a non-const reference to a vector which it will fill with information about pieces that are partially downloaded or not downloaded at all but partially requested. The entry in the vector (partial_piece_info) looks like this:
struct partial_piece_info
{
int piece_index;
int blocks_in_piece;
block_info blocks[256];
enum state_t { none, slow, medium, fast };
state_t piece_state;
};
piece_index is the index of the piece in question. blocks_in_piece is the number of blocks in this particular piece. This number will be the same for most pieces, but the last piece may have fewer blocks than the standard pieces.
piece_state is set to either fast, medium, slow or none. It tells which download rate category the peers downloading this piece falls into. none means that no peer is currently downloading any part of the piece. Peers prefer picking pieces from the same category as themselves. The reason for this is to keep the number of partially downloaded pieces down. Pieces set to none can be converted into any of fast, medium or slow as soon as a peer want to download from it.
struct block_info
{
enum block_state_t
{ none, requested, writing, finished };
tcp::endpoint peer;
unsigned state:2;
unsigned num_peers:14;
};
The block_info array contains data for each individual block in the piece. Each block has a state (state) which is any of:
The peer field is the ip address of the peer this block was downloaded from. num_peers is the number of peers that is currently requesting this block. Typically this is 0 or 1, but at the end of the torrent blocks may be requested by more peers in parallel to speed things up.
void get_peer_info(std::vector<peer_info>&) const;
get_peer_info() takes a reference to a vector that will be cleared and filled with one entry for each peer connected to this torrent, given the handle is valid. If the torrent_handle is invalid, it will throw invalid_handle exception. Each entry in the vector contains information about that particular peer. See peer_info.
torrent_info const& get_torrent_info() const;
Returns a const reference to the torrent_info object associated with this torrent. This reference is valid as long as the torrent_handle is valid, no longer. If the torrent_handle is invalid or if it doesn't have any metadata, invalid_handle exception will be thrown. The torrent may be in a state without metadata only if it was started without a .torrent file, i.e. by using the libtorrent extension of just supplying a tracker and info-hash.
bool is_valid() const;
Returns true if this handle refers to a valid torrent and false if it hasn't been initialized or if the torrent it refers to has been aborted. Note that a handle may become invalid after it has been added to the session. Usually this is because the storage for the torrent is somehow invalid or if the filenames are not allowed (and hence cannot be opened/created) on your filesystem. If such an error occurs, a file_error_alert is generated and all handles that refers to that torrent will become invalid.
TODO: document storage
It contains the following fields:
struct torrent_status
{
enum state_t
{
queued_for_checking,
checking_files,
connecting_to_tracker,
downloading_metadata,
downloading,
finished,
seeding,
allocating
};
state_t state;
bool paused;
float progress;
boost::posix_time::time_duration next_announce;
boost::posix_time::time_duration announce_interval;
std::string current_tracker;
size_type total_download;
size_type total_upload;
size_type total_payload_download;
size_type total_payload_upload;
size_type total_failed_bytes;
size_type total_redundant_bytes;
float download_rate;
float upload_rate;
float download_payload_rate;
float upload_payload_rate;
int num_peers;
int num_complete;
int num_incomplete;
int list_seeds;
int list_peers;
const std::vector<bool>* pieces;
int num_pieces;
size_type total_done;
size_type total_wanted_done;
size_type total_wanted;
int num_seeds;
float distributed_copies;
int block_size;
int num_uploads;
int num_connections;
int uploads_limit;
int connections_limit;
bool compact_mode;
};
progress is a value in the range [0, 1], that represents the progress of the torrent's current task. It may be checking files or downloading. The torrent's current task is in the state member, it will be one of the following:
| queued_for_checking | The torrent is in the queue for being checked. But there currently is another torrent that are being checked. This torrent will wait for its turn. |
| checking_files | The torrent has not started its download yet, and is currently checking existing files. |
| connecting_to_tracker | The torrent has sent a request to the tracker and is currently waiting for a response |
| downloading_metadata | The torrent is trying to download metadata from peers. This assumes the metadata_transfer extension is in use. |
| downloading | The torrent is being downloaded. This is the state most torrents will be in most of the time. The progress meter will tell how much of the files that has been downloaded. |
| finished | In this state the torrent has finished downloading but still doesn't have the entire torrent. i.e. some pieces are filtered and won't get downloaded. |
| seeding | In this state the torrent has finished downloading and is a pure seeder. |
| allocating | If the torrent was started in full allocation mode, this indicates that the (disk) storage for the torrent is allocated. |
When downloading, the progress is total_wanted_done / total_wanted.
paused is set to true if the torrent is paused and false otherwise.
next_announce is the time until the torrent will announce itself to the tracker. And announce_interval is the time the tracker want us to wait until we announce ourself again the next time.
current_tracker is the URL of the last working tracker. If no tracker request has been successful yet, it's set to an empty string.
total_download and total_upload is the number of bytes downloaded and uploaded to all peers, accumulated, this session only.
total_payload_download and total_payload_upload counts the amount of bytes send and received this session, but only the actual payload data (i.e the interesting data), these counters ignore any protocol overhead.
total_failed_bytes is the number of bytes that has been downloaded and that has failed the piece hash test. In other words, this is just how much crap that has been downloaded.
total_redundant_bytes is the number of bytes that has been downloaded even though that data already was downloaded. The reason for this is that in some situations the same data can be downloaded by mistake. When libtorrent sends requests to a peer, and the peer doesn't send a response within a certain timeout, libtorrent will re-request that block. Another situation when libtorrent may re-request blocks is when the requests it sends out are not replied in FIFO-order (it will re-request blocks that are skipped by an out of order block). This is supposed to be as low as possible.
pieces is the bitmask that represents which pieces we have (set to true) and the pieces we don't have. It's a pointer and may be set to 0 if the torrent isn't downloading or seeding.
num_pieces is the number of pieces that has been downloaded. It is equivalent to: std::accumulate(pieces->begin(), pieces->end()). So you don't have to count yourself. This can be used to see if anything has updated since last time if you want to keep a graph of the pieces up to date.
download_rate and upload_rate are the total rates for all peers for this torrent. These will usually have better precision than summing the rates from all peers. The rates are given as the number of bytes per second. The download_payload_rate and upload_payload_rate respectively is the total transfer rate of payload only, not counting protocol chatter. This might be slightly smaller than the other rates, but if projected over a long time (e.g. when calculating ETA:s) the difference may be noticeable.
num_peers is the number of peers this torrent currently is connected to. Peer connections that are in the half-open state (is attempting to connect) or are queued for later connection attempt do not count. Although they are visible in the peer list when you call get_peer_info().
num_complete and num_incomplete are set to -1 if the tracker did not send any scrape data in its announce reply. This data is optional and may not be available from all trackers. If these are not -1, they are the total number of peers that are seeding (complete) and the total number of peers that are still downloading (incomplete) this torrent.
list_seeds and list_peers are the number of seeds in our peer list and the total number of peers (including seeds) respectively. We are not necessarily connected to all the peers in our peer list. This is the number of peers we know of in total, including banned peers and peers that we have failed to connect to.
total_done is the total number of bytes of the file(s) that we have. All this does not necessarily has to be downloaded during this session (that's total_payload_download).
total_wanted_done is the number of bytes we have downloaded, only counting the pieces that we actually want to download. i.e. excluding any pieces that we have but are filtered as not wanted.
total_wanted is the total number of bytes we want to download. This is also excluding pieces that have been filtered.
num_seeds is the number of peers that are seeding that this client is currently connected to.
distributed_copies is the number of distributed copies of the torrent. Note that one copy may be spread out among many peers. The integer part tells how many copies there are currently of the rarest piece(s) among the peers this client is connected to. The fractional part tells the share of pieces that have more copies than the rarest piece(s). For example: 2.5 would mean that the rarest pieces have only 2 copies among the peers this torrent is connected to, and that 50% of all the pieces have more than two copies.
If we are a seed, the piece picker is deallocated as an optimization, and piece availability is no longer tracked. In this case the distributed copies is set to -1.
block_size is the size of a block, in bytes. A block is a sub piece, it is the number of bytes that each piece request asks for and the number of bytes that each bit in the partial_piece_info's bitset represents (see get_download_queue()). This is typically 16 kB, but it may be larger if the pieces are larger.
num_uploads is the number of unchoked peers in this torrent.
num_connections is the number of peer connections this torrent has, including half-open connections that hasn't completed the bittorrent handshake yet. This is always <= num_peers.
uploads_limit is the set limit of upload slots (unchoked peers) for this torrent.
connections_limit is the set limit of number of connections for this torrent.
compact_mode is true if this torrent was started with compact allocation mode for its storage. False means it was started in full allocation mode.
It contains the following fields:
struct peer_info
{
enum
{
interesting = 0x1,
choked = 0x2,
remote_interested = 0x4,
remote_choked = 0x8,
supports_extensions = 0x10,
local_connection = 0x20,
handshake = 0x40,
connecting = 0x80,
queued = 0x100,
on_parole = 0x200,
seed = 0x400,
optimistic_unchoke = 0x800,
rc4_encrypted = 0x100000,
plaintext_encrypted = 0x200000
};
unsigned int flags;
enum peer_source_flags
{
tracker = 0x1,
dht = 0x2,
pex = 0x4,
lsd = 0x8
};
int source;
asio::ip::tcp::endpoint ip;
float up_speed;
float down_speed;
float payload_up_speed;
float payload_down_speed;
size_type total_download;
size_type total_upload;
peer_id pid;
std::vector<bool> pieces;
int upload_limit;
int download_limit;
time_duration last_request;
time_duration last_active;
int send_buffer_size;
int used_send_buffer;
int num_hashfails;
char country[2];
size_type load_balancing;
int download_queue_length;
int upload_queue_length;
int failcount;
int downloading_piece_index;
int downloading_block_index;
int downloading_